Choquet game explained
The Choquet game is a topological game named after Gustave Choquet, who was in 1969 the first to investigate such games.[1] A closely related game is known as the strong Choquet game.
Let
be a non-empty
topological space. The Choquet game of
,
, is defined as follows: Player I chooses
, a non-empty
open subset of
, then Player II chooses
, a non-empty open subset of
, then Player I chooses
, a non-empty open subset of
, etc. The players continue this process, constructing a sequence
U0\supseteqV0\supseteqU1\supseteqV1\supseteqU2...
. If
then Player I wins, otherwise Player II wins.
It was proved by John C. Oxtoby that a non-empty topological space
is a
Baire space if and only if Player I has no winning strategy. A nonempty topological space
in which Player II has a winning strategy is called a
Choquet space. (Note that it is possible that neither player has a winning strategy.) Thus every Choquet space is Baire. On the other hand, there are Baire spaces (even
separable metrizable ones) that are not Choquet spaces, so the converse fails.
The strong Choquet game of
,
, is defined similarly, except that Player I chooses
, then Player II chooses
, then Player I chooses
, etc, such that
for all
. A topological space
in which Player II has a winning strategy for
is called a
strong Choquet space. Every strong Choquet space is a Choquet space, although the converse does not hold.
All nonempty complete metric spaces and compact T2 spaces are strong Choquet. (In the first case, Player II, given
, chooses
such that
\operatorname{diam}(Vi)<1/i
and
\operatorname{cl}(Vi)\subseteqVi-1
. Then the sequence
\left\{xi\right\}\tox\inVi
for all
.) Any subset of a strong Choquet space that is a
set is strong Choquet. Metrizable spaces are
completely metrizable if and only if they are strong Choquet.
[2] [3] References
- Book: Choquet. Gustave. Lectures on Analysis: Integration and topological vector spaces. 1969. W. A. Benjamin. 9780805369601. en.
- Book: Becker. Howard. Kechris. A. S.. Alexander Kechris. The Descriptive Set Theory of Polish Group Actions. 1996. Cambridge University Press. 9780521576055. 59. en.
- Book: Kechris. Alexander. Classical Descriptive Set Theory. 2012. Springer Science & Business Media. 9781461241904. 43–45. en.