Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0907.4126

Stationary and convergent strategies in Choquet games

François G. Dorais·Carl Mummert
View original source ↗Read source document ↗Export metadata ↓

Abstract

If NONEMPTY has a winning strategy against EMPTY in the Choquet game on a space, the space is said to be a Choquet space. Such a winning strategy allows NONEMPTY to consider the entire finite history of previous moves before making each new move; a stationary strategy only permits NONEMPTY to consider the previous move by EMPTY. We show that NONEMPTY has a stationary winning strategy for every second countable T1 Choquet space. More generally, NONEMPTY has a stationary winning strategy for any T1 Choquet space with an open-finite basis. We also study convergent strategies for the Choquet game, proving the following results. (1) A T1 space X is the open image of a complete metric space if and only if NONEMPTY has a convergent winning strategy in the Choquet game on X. (2) A T1 space X is the compact open image of a metric space if and only if X is metacompact and NONEMPTY has a stationary convergent strategy in the Choquet game on X. (3) A T1 space X is the compact open image of a complete metric space if and only if X is metacompact and NONEMPTY has a stationary convergent winning strategy in the Choquet game on X.

Explore related subjects

math.GNmath.LO

Keep this discovery

BibTeXRIS

François G. Dorais, Carl Mummert. 2009-07-23. Stationary and convergent strategies in Choquet games. https://doi.org/10.4064/fm209-1-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN↗
arXiv2026

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN↗
arXiv2026

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN↗