On Ramsey properties, function spaces, and topological games
Steven Clontz
[
Department of Mathematics and Statistics,
University of South Alabama, Mobile, Alabama, U.S.A.
Alexander V. Osipov
[
Krasovskii Institute of Mathematics and Mechanics, Ural Federal
University,
Ural State University of Economics, Yekaterinburg, Russia
Abstract
An open question of Gruenhage asks if all strategically selectively separable
spaces are Markov selectively separable, a game-theoretic
statement known to hold for countable spaces. As a corollary of a result by
Berner and JuhΓ‘sz, we note that the βstrongβ
version of this statement,
where the second player is restricted to selecting single points in the
rather than finite subsets,
holds for all T3β spaces without isolated points.
Continuing this investigation,
we also consider games related to selective sequential separability, and demonstrate
results analogous to those for selective separability. In particular,
strong selective sequential separability in the presence of the Ramsey property
may be reduced to a weaker condition on a countable sequentially dense subset.
Additionally, Ξ³- and Ο-covering properties on X are shown
to be equivalent to corresponding sequential properties on Cpβ(X).
A strengthening of the Ramsey property is also introduced, which is still equivalent to
Ξ±2β and Ξ±4β in the context of Cpβ(X).
keywords:
selection principles , topological games , predetermined
strategy , Markov strategy , covering properties , Cpβ
theory , Ramsey property , selectively sequentially
separable , Ξ©-Ramsey property
MSC:
[2010] 91A44 , 91A05 , 54C35 , 54C65
β β journal: β¦
label1][email protected]
label2][email protected]
1 Introduction
Let A and B be sets whose elements are
families of subsets of an infinite set X. Then S1β(A,B) denotes a selection principle: for each
sequence (Anβ:nβΟ) of elements of A there
is a sequence (bnβ:nβΟ) such that for each n, bnββAnβ, and {bnβ:nβΟ} is an element of B.
Sfinβ(A,B) is a selection
principle: for each sequence (Anβ:nβΟ) of elements
of A there is a sequence (Bnβ:nβΟ) of
finite sets such that for each n, BnββAnβ, and
βnβΟβBnββB.
In this paper, by a cover we mean a nontrivial one; that is,
U is a cover of X if X=βU and
Xβ/U.
A cover U of a space X is:
an Ο-cover if every finite subset of X is contained in a
member of U.
a Ξ³-cover if it is infinite and each xβX belongs to all but finitely many elements of U.
Note that every Ξ³-cover contains a countable
Ξ³-cover, and every Ξ³-cover is also an Ο-cover.
For a topological space X we denote:
Ξ© β the family of all open Ο-covers of
X;
Ξ β the family of all open Ξ³-covers of
X.
Let X be a Hausdorff topological space, and xβX.
A subset A of X
converges to a unique x=limA if A is infinite, xβ/A, and for each neighborhood U of x, AβU is
finite; We also assume x=lim{x}.
We may then consider the following collections:
Ξ©xβ={AβX:xβAβAΒ orΒ A={x}};
Ξxβ={AβX:x=limA}.
Note that if AβΞxβ, then there exists
a countable set Aβ²={anβ:n<Ο}βA with
Aβ²βΞxβ. As such, Ξxβ may be considered
to be the set of non-trivial convergent sequences to x.
As was noted earlier, ΞβΞ©; likewise,
ΞxββΞ©xβ.
Given these definitions, we may describe the following
well-known selection principles.
A space X has Arhangelβskiiβs countable fan tightness
if X satisfies
Sfinβ(Ξ©xβ,Ξ©xβ)
for every xβX [2].
A space X has Sakaiβs countable strong fan tightness
if X satisfies
S1β(Ξ©xβ,Ξ©xβ)
for every xβX [25].
A space X has Arhangelβskiiβs property Ξ±4β,
if X satisfies Sfinβ(Ξxβ,Ξxβ)
for every xβX [1].
A space X has Arhangelβskiiβs property Ξ±2β,
if X satisfies S1β(Ξxβ,Ξxβ)
for every xβX [1].
A space X is strictly
FreΛchet-Urysohn if X satisfies
S1β(Ξ©xβ,Ξxβ)
for every xβX [27].
A space X is strongly
FreΛchet-Urysohn
if X satisfies
Sfinβ(Ξ©xβ,Ξxβ)
for every xβX [18, 33].
It is easy to check that X satisfies Sfinβ(Ξxβ,Ξ©xβ) for any xβX if and only if X does not contain
a copy of the sequential fan SΟβ,
where SΟβ is the quotient space of
countably many convergent sequences obtained by identifying all
limit points.
Definition 1.1** ([20]).**
A space X has the Ramsey property if for any choices
xi,jββX for i,jβΟ such that lim{lim{xi,jβ:jβΟ}:iβΟ}=x for some point xβX,
there exists an infinite set MβΟ such that for
every open neighborhood U of x, xm,nββU for
sufficiently large m,nβM with m<n.
In particular, note that x=lim{xm,m+β:mβM} where
m+=min({kβM:k>M}), and thus Ramsey βΞ±4β
(and furthermore Ξ±3β; see [20]). But the relation between
Ξ±2β and the Ramsey property
remains open, even for topological groups (Question 3.15 in [32]).
We also will use the following strengthening of Ramsey:
Definition 1.2**.**
A space X has the Ξ©-Ramsey property if and only if
for any choices Ti,jββ[X]<Ο for i,jβΟ such
that lim{limβjβΟβTi,jβ:iβΟ}=x for
some point xβX, there exists an infinite set MβΟ such that for every open neighborhood U of x,
Tm,nββU for sufficiently large m<nβM.
The following implications follow for any topological space X
since ΞxββΞ©xβ:
S1β(Ξxβ,Ξxβ)βSfinβ(Ξxβ,Ξxβ)βSfinβ(Ξxβ,Ξ©xβ)βS1β(Ξxβ,Ξ©xβ)
β β ββ β β β β ββ
β β β β β β ββ β β ββ β β β β β
β ββ β β ββββ β β β ββ β β β
S1β(Ξ©xβ,Ξxβ)βSfinβ(Ξ©xβ,Ξxβ)βSfinβ(Ξ©xβ,Ξ©xβ)βS1β(Ξ©xβ,Ξ©xβ)
If X is a space and AβX, then the sequential closure of A,
denoted by [A]seqβ, is the set of all limits of sequences
from A. A set DβX is said to be sequentially dense
if X=[D]seqβ. A space X is called sequentially separable if
it has a countable sequentially dense set.
For a topological space X we denote:
D is the family of all dense subsets of X;
S is the family of all sequentially dense
subsets of X.
Let Ξ represent S1β or Sfinβ.
When we write Ξ (A,Bxβ) without specifying
x, we mean (βx)Ξ (A,Bxβ).
As above,
the following implications hold on any topological space X
since SβD:
S1β(S,Ξxβ)βSfinβ(S,Ξxβ)βSfinβ(S,Ξ©xβ)βS1β(S,Ξ©xβ)
β β β β β
ββ β β β β β β ββ β β ββ β β β β β
β ββ β β ββ β ββ β β β
S1β(D,Ξxβ)βSfinβ(D,Ξxβ)βSfinβ(D,Ξ©xβ)βS1β(D,Ξ©xβ)
Some of these selection principles are known by name.
A space X is R-separable, if X satisfies
S1β(D,D) (Def. 47, [6]).
A space X is M-separable (or selectively
separable), if X satisfies Sfinβ(D,D).
A space X is selectively sequentially separable, if
X satisfies Sfinβ(S,S) (Def. 1.2,
[7]).
Proposition 1.3** (Proposition 1.3 in [7]).**
Every
sequentially dense subspace of a selectively sequentially
separable space is sequentially separable. In particular, every
selectively sequentially separable space is sequentially
separable.
And so the following implications hold on any topological space X:
S1β(S,S)βSfinβ(S,S)βSfinβ(S,D)βS1β(S,D)
β β β β β
ββ β β β β β ββ β β ββ β β
β β β β ββ β β ββ β ββ β β β
S1β(D,S)βSfinβ(D,S)βSfinβ(D,D)βS1β(D,D)
We now have three types of topological properties
described as selection principles:
local properties of the form Sββ(Ξ¦xβ,Ξ¨xβ);
semi-local properties of the form Sββ(Ξ¦,Ξ¨xβ).
global properties of the form Sββ(Ξ¦,Ξ¨);
There is a game, denoted by Gfinβ(A,B),
corresponding to Sfinβ(A,B).
In this game two players,
ONE and TWO, play a round for each natural number n. In the
n-th round ONE chooses a set AnββA and TWO
responds with a finite subset Bnβ of Anβ. A play
A1β,B1β;...;Anβ,Bnβ;... is won by TWO if nβΟββBnββB; otherwise, ONE wins.
Similarly, one defines the game G1β(A,B),
associated with S1β(A,B).
A strategy of a player is a function Ο from the set of all
finite sequences of moves of the opponent into the set of (legal)
moves of the strategy owner.
It then follows that the selection principle
Sββ(A,B) is equivalent to player ONE
lacking a winning predetermined
strategy for Gββ(A,B) that
is defined solely on the current round number n (ignoring the
moves of TWO) [11]. Even when ONE lacks such a predetermined
winning strategy, it is still possible
for ONE to have a winning strategy that uses perfect information.
As such, we now have three types of topological games on a topological space
X:
local games of the form Gββ(Ξ¦xβ,Ξ¨xβ);
semi-local games of the form Gββ(Ξ¦,Ξ¨xβ).
global games of the form Gββ(Ξ¦,Ξ¨);
Let us now more formally define our βstrategiesβ.
Definition 1.4**.**
A strategy for TWO in the game
Gfinβ(A,B) is a function Ο
satisfying Ο(β¨A0β,...,Anββ©)β[Anβ]<Ο for
β¨A0β,...,Anββ©βAn+1. We say this strategy
is winning if whenever ONE plays AnββA during
each round n<Ο, TWO wins the game by playing
Ο(β¨A0β,...,Anββ©) during each round n<Ο. If a
winning strategy exists, then we write TWO βGfinβ(A,B).
We will also be interested in strategies that use limited information;
specifically, those that only use the current round number n
and the most recent move of the opponent.
Definition 1.5**.**
A Markov strategy for TWO in the game
Gfinβ(A,B) is a function Ο
satisfying Ο(A,n)β[Anβ]<Ο for AβA
and nβΟ. We say this Markov strategy is winning if whenever ONE plays AnββA during each
round n<Ο, TWO wins the game by playing Ο(Anβ,n)
during each round n<Ο. If a winning Markov strategy exists,
then we write TWO markββGfinβ(A,B).
Both definitions may be naturally modified for the game
G1β(A,B) instead. It is then easily
seen that
[TABLE]
where ββ{1,fin}.
2 Main results
Barman and Dow showed ([4], Theorem 2.9) that every
separable FreΛchet-Urysohn T2β-space is selectively
separable. By definition of FreΛchet-Urysohn,
closure is equivalent to sequential closure in such spaces, so we
immediately have:
Proposition 2.1**.**
(Proposition 2.2. in [7]) Every FreΛchet-Urysohn
separable T2β-space is selectively sequentially separable.
Let Ξxβ²β={AβX:βBβΞxβ(BβA)}, and note that SβΞxβ²β (while
Sξ βΞxβ). These may be considered the
sequences which cluster at x.
In particular, we have that Sββ(Ξ¦,S)βSββ(Ξ¦,Ξxβ²β) (with similar game-theoretic results).
We now turn to the following theorem:
Theorem 2.2**.**
Let ββ{1,fin}; if β=1 assume X is Ramsey,
and otherwise assume X is Ξ©-Ramsey.
Then for any non-empty set Ξ¦, the following are equivalent:
-
X* satisfies Sββ(Ξ¦,S) *(resp. TWO
βGββ(Ξ¦,S), TWO markββGββ(Ξ¦,S));
2. 2.
X* is sequentially separable and satisfies Sββ(Ξ¦,Ξxβ²β) *(resp. TWO βGββ(Ξ¦,Ξxβ²β), TWO
markββGββ(Ξ¦,Ξxβ²β));
3. 3.
X* has a countable sequentially dense subset D where
Sββ(Ξ¦,Ξxβ²β) *(resp. TWO βGββ(Ξ¦,Ξxβ²β), TWO markββGββ(Ξ¦,Ξxβ²β))
holds for all xβD.
Proof.
Let PβΞ¦. Then for the countable set {P}, we may
apply any variant of the first condition to obtain
Tiββ[P]<Ο
for iβΟ with
β{Tiβ:iβΟ}βS, demonstrating the
respective second condition, which trivially implies the third.
As such, we only need prove that the final condition implies
the first; let D={diβ:iβΟ} witness that final condition.
a) Assume Sββ(Ξ¦,Ξxβ²β) for xβD.
Let Pi,mββΞ¦ for all i,mβΟ.
For each iβΟ, Sββ(Ξ¦,Ξdiββ²β) allows us to choose
Ti,mββ[Pi,mβ]β and mtββΟ for tβΟ
such that diβ=limβ{Ti,mtββ:tβΟ}.
We claim that β{Ti,mβ:i,mβΟ} is sequentially dense.
To see this, let xβX, and choose isββΟ for sβΟ
such that x=lim{disββ:sβΟ}. We then choose MβΟ
witnessing the appropriate Ramsey property
for {Tisβ,mtββ:s,tβΟ} and
x; it follows that x=limβ{Tisβ,ms+ββ:sβM}.
Thus for any countable collection of sets Pi,mββΞ¦, we have
Ti,mββ[Pi,mβ]β with
β{Ti,mβ:i,mβΟ} sequentially
dense, witnessing S1β(Ξ¦,S).
b) Now assume TWOβGββ(Ξ¦,Ξdiββ²β) is witnessed by
the strategy Οiβ for each iβΟ.
Let p:ΟβΟ be a function such that
pβ(i) is infinite for all iβΟ. For a nonempty finite
sequence t, let tβ² be its subsequence removing all terms of
index n such that p(n)ξ =p(β£tβ£β1).
We define the strategy Ο for the game
Gββ(S,S) by
Ο(t)=Οp(β£tβ£β1)β(tβ²); that is, Ο partitions
any counterplay by ONE into countably many subplays according to p,
and uses a different Οiβ for each subplay.
Let Ξ±βSΟ, and let Ξ±iβ be its
subsequence removing all terms of index n such that p(n)ξ =i. Then β{Οiβ(Ξ±iββΎ(n+1)):nβΟ}βΞdiββ²β since Οiβ is a winning strategy
for TWO, so choose ni,tββΟ for tβΟ where
diβ=limβ{Οiβ(Ξ±iββΎ(ntβ+1)):tβΟ}.
We claim that
β{Ο(Ξ±βΎ(n+1)):nβΟ}βS, so let xβX. Then there exists
{disββ:sβΟ} such that x=lim{disββ:sβΟ}.
We then apply the appropriate Ramsey property to
{Οisββ(Ξ±isβββΎ(nisβ,tβ+1)):s,tβΟ} to obtain an MβΟ with
x=lim{Οisββ(Ξ±isβββΎ(nisβ,s+β+1)):sβM}.
Since each
Οisββ(Ξ±isβββΎ(nisβ,s+β+1))=Ο(Ξ±βΎ(n+1))
for some nβΟ, the result follows.
c) Finally let TWO markββG1β(S,Ξdiββ)
for each iβΟ be witnessed by Οiβ.
Let p:ΟβΟ be a function such that
pβ(i) is infinite for all iβΟ.
We then define the Markov strategy Ο by
[TABLE]
so that as in the previous case, Ο partitions
any counterplay by ONE into countably many subplays according to p,
and uses a different Οiβ for each subplay.
Let Ξ±βSΟ, and let Ξ±iβ be its
subsequence removing all terms of index n such that p(n)ξ =i.
Then {Οiβ(Ξ±iβ(n),n):nβΟ}βΞdiββ²β
since Οiβ is a winning strategy
for TWO, so choose ni,tββΟ for tβΟ where
diβ=lim{Οiβ(Ξ±iβ(ni,tβ),ni,tβ):tβΟ}.
We claim that
{Ο(Ξ±(n),n):nβΟ}βS, so let xβX. Then there exists
{disββ:sβΟ} such that x=lim{disββ:sβΟ}.
We then apply the appropriate Ramsey property to
{Οisββ(Ξ±isββ(nisβ,tβ),nisβ,tβ):s,tβΟ}
to obtain an MβΟ with
x=lim{Οisββ(Ξ±isββ(nisβ,s+β),nisβ,s+β):sβM}.
Since each
Οisββ(Ξ±isββ(nisβ,s+β),nisβ,s+β)=Ο(Ξ±(n),n)
for some nβΟ, the result follows.
β
The previous result mirrors the following slight generalization
of theorems 16 and 41 of [9].
Theorem 2.3** ([9]).**
For a topological space X, nonempty set Ξ¦, and ββ{1,fin},
the following are equivalent:
-
X* satisfies Sββ(Ξ¦,D) *(resp. TWO
βGββ(Ξ¦,D), TWO
markββGββ(Ξ¦,D));
2. 2.
X* is separable and satisfies Sββ(Ξ¦,Ξ©xβ) *(resp. TWO βGββ(Ξ¦,Ξ©xβ), TWO markββGββ(Ξ¦,Ξ©xβ));
3. 3.
X* has a countable dense subset D where
Sββ(Ξ¦,Ξ©xβ) *(resp. TWO βGββ(Ξ¦,Ξ©xβ), TWO markββGββ(Ξ¦,Ξ©xβ)) holds for all xβD.
Proof.
In [9], Ξ¦=D was an additional assumption,
but was never required in the proofs, since
Sββ(Ξ¦,D) implies separability for any non-empty
Ξ¦.
β
Recall that a Ο-base for a space X is a family
U of nonempty open subsets of
X such that for each nonempty open set VβX there is a
UβU with UβV.
Then the Ο-weight of a space X, denoted Ο(X), is the minimal
cardinality of a Ο-base for X.
Corollary 2.4**.**
Let X be a T3β-space with no isolated
points. Then the following are equivalent:
-
Ο(X)=β΅0β;
2. 2.
TWO βG1β(D,D);
3. 3.
TWO markββG1β(D,D);
4. 4.
X is separable and TWO βG1β(D,Ξ©xβ);
5. 5.
X is separable and TWO markββG1β(D,Ξ©xβ);
6. 6.
X has a countable dense subset D where TWO βG1β(D,Ξ©xβ) for all xβD.
7. 7.
X has a countable dense subset D where TWO markββG1β(D,Ξ©xβ) for all xβD.
Proof.
The equivalence of (1) and (2) is [8, Theorem 2.1].
Assuming (1), let {Pnβ:nβΟ} be a countable Ο-base.
We may then define Ο(D,n)βDβ©Pnβ arbitrarily, and
itβs easy to see that this is winning for TWO, implying (3)
and therefore (2).
All other equivalencies follow from Theorem 2.3.
β
The equivalance (2) β (3) is similar to the following
open question of Gruenhage, first shown to be true when X is countable
by Barman and Dow in
[5, Theorem 2.11]; see [9, Lemma 37] for a
general sufficient condition which guarantees that a winning strategy
may be improved to a Markov winning strategy.
Question 2.5**.**
When does TWO βGfinβ(D,D) imply
TWO markββGfinβ(D,D)?
3 Ξ©-Ramsey in Topological Groups
We now adapt techniques of Sakai [26] to obtain the following lemma
giving a useful recharacterization of the Ξ©-Ramsey property for
topological groups, which we require in the following section.
Lemma 3.1**.**
Let β¨G,β
β© be a topological group with unit e.
Then the Ξ©-Ramsey property is equivalent to the following:
if Tn,mββ[G]<Ο and e=limβ{Tn,mβ:mβΟ}
for each nβΟ, then there exists MβΟ
such that e=limβ{Tn,mβ:n,mβM,n<m}.
Proof.
The forward direction follows by noting that e=lim{e} and
thus applying the Ξ©-Ramsey property to
{Tn,mβ:n,mβΟ}.
For the converse, let xnβ=limβ{Tn,mβ:mβΟ} for
each nβΟ, and e=lim{xnβ:nβΟ} (since G is
homoegeneous). If Sn,mβ=xnβ1ββ
Tn,mβ, it follows
that limβ{Sn,mβ:mβΟ}=xnβ1ββ
xnβ=e.
We apply the assumption to obtain MβΟ where
e=limβ{Sn,mβ:n,mβM,n<m}, and claim that M
witnesses Ξ©-Ramsey.
Let U be a neighborhood of e, which must contain
{xnβ:nβ₯kβ²} for some kβ²βΟ. By applying
[26, Lemma 2.3], we may choose an open neighborhood V
of e where {xnβ:nβ₯kβ²}β
VβU. Since
e=limβ{Sn,mβ:n,mβM,n<m}, we may choose kβ₯kβ²
where β{Sn,mβ:n,mβM,kβ€n<m}βV. So for kβ€n<m,
[TABLE]
β
4 Applications in Cpβ-theory
For a Tychonoff space X, we denote by Cpβ(X) the topological group
of all real-valued continuous functions on X with the topology of
pointwise convergence. The symbol 0 stands for the constant
function to [math].
Basic open sets of Cpβ(X) are of the form
[x1β,...,xkβ;U1β,...,Ukβ]={fβCpβ(X):f(xiβ)βUiβ,
i=1,...,k}, where each xiββX and each Uiβ is a non-empty
open subset of R. When Uiβ=U for all iβ€k,
we simply write [x1β,β¦,xkβ;U].
Consider the following result of Sakai.
Theorem 4.1** (Theorem 2.5 of [26]).**
The Ramsey property is equivalent to Ξ±2β
and Ξ±4β for Cpβ(X).
By using the previous Lemma 3.1, we may show the following.
Theorem 4.2**.**
The Ξ©-Ramsey property is equivalent to the Ramsey,
Ξ±2β, and Ξ±4β properties for Cpβ(X).
Proof.
Let Tn,mββ[Cpβ(X)]<Ο and
0=limβ{Tn,mβ:mβΟ} for each nβΟ.
We let gn,mβ(x)=max{β£f(x)β£:fββiβ€nβTi,mβ},
noting 0=lim{gn,mβ:mβΟ} for each nβΟ.
We apply Ξ±2β, that is, S1β(Ξ0β,Ξ0β)
to {gn,mβ:n<mβΟ} to obtain an increasing mapping
Ο:ΟβΟ with
0=lim{gm,Ο(m)β:mβΟ}.
Now let Ο0(n)=n and Οi+1(n)=Ο(Οi(n)) and set
M={Οi(0):iβΟ}. We will demonstrate that
0=lim{Tn,mβ:n,mβM,n<m}. For xβX and
Ο΅>0, pick kβΟ where
β£gm,Ο(m)β(x)β£<Ο΅ for k<m,mβM. It follows that
for fβTn,mβ where n,mβM and k<n<m, let m=Ο(mβ²)
where nβ€mβ². Then β£f(x)β£β€β£gn,mβ(x)β£β€β£gmβ²,mβ(x)β£=β£gmβ²,Ο(mβ²)β(x)β£<Ο΅.
Thus Cpβ(X) is Ξ©-Ramsey.
Since Ξ©-Ramsey implies Ramsey, the result follows.
β
Recall that the i-weight iw(X) of a space X is the smallest
infinite cardinal number Ο such that X can be mapped by a
one-to-one continuous mapping onto a Tychonoff space of the weight
not greater than Ο.
Theorem 4.3** (Noble [19]).**
Let X be a space. A space Cpβ(X) is separable if and only if
iw(X)=β΅0β.
Note that if X is itself Tychonoff and iw(X)=β΅0β,
then the image of X under a witnessing
one-to-one continuous mapping yields a coarser topology for X
which is separable and metrizable; this is the characterization
given in [17].
In papers [2, 3, 6, 15, 21, 22, 23, 24, 25, 31]
various selection principles for a Tychonoff space X were
related to the selection principles for Cpβ(X). Likewise, in
[9, 16, 25, 29, 30] various selection games for X and
Cpβ(X) and a bitopological space (C(X),Οkβ,Οpβ) were
related.
So we have the following applications in Cpβ-theory.
Theorem 4.4** (Theorems 22 and 43 in [9]).**
For a Tychonoff space X and ββ{1,fin}, the
following are equivalent:
-
TWO has a winning (Markov) strategy in Gββ(Ξ©,Ξ©) on X;
2. 2.
TWO has a winning (Markov) strategy in Gββ
(Ξ©0β,Ξ©0β) on Cpβ(X);
3. 3.
TWO has a winning (Markov) strategy in
Gββ(D,Ξ©0β) on Cpβ(X).
Corollary 4.5**.**
Let X be a Tychonoff space with
a coarser second-countable topology
(that is, iw(X)=β΅0β) and ββ{1,fin}. The following assertions are equivalent:
-
TWO has a winning (Markov) strategy in Gββ(Ξ©,Ξ©) on X;
2. 2.
TWO has a winning (Markov) strategy in Gββ
(Ξ©0β,Ξ©0β) on Cpβ(X);
3. 3.
TWO has a winning (Markov) strategy in
Gββ(D,Ξ©0β) on Cpβ(X).
4. 4.
TWO has a winning (Markov) strategy in
Gββ(D,D) on Cpβ(X);
Proof.
By Theorems 2.3, 4.3 and 4.4,
the items (1-4) are equivalent.
β
Corollary 4.6**.**
Let X be a Tychonoff space with a coarser
second-countable topology. The following assertions are equivalent:
-
Ο(Cpβ(X))=β΅0β;
2. 2.
TWO β
G1β(D,D) for Cpβ(X);
3. 3.
TWO β G1β(D,Ξ©xβ)
for Cpβ(X);
4. 4.
TWO β G1β(Ξ©,Ξ©) for
X;
5. 5.
TWO markββ
G1β(D,D) for Cpβ(X);
6. 6.
TWO markββ
G1β(D,Ξ©xβ) for Cpβ(X);
7. 7.
TWO markββ G1β(Ξ©,Ξ©)
for X;
8. 8.
X is countable.
Proof.
Items (1-7) follow from Theorem 2.4 and Corollary 4.5.
The fact that (8) is equivalent to (6) and (7) doesnβt require iw(X)=β΅0β
and may be found in [12, Theorem 17]
along with several other equivalencies.
β
We now turn to the case where TWO may choose finite sets
each round.
Corollary 4.7**.**
Let X be a separable metrizable space.
Then the following are equivalent:
-
TWO β
Gfinβ(D,D) for Cpβ(X);
2. 2.
TWO β
Gfinβ(D,Ξ©xβ) for Cpβ(X);
3. 3.
TWO β Gfinβ(Ξ©,Ξ©) for
X;
4. 4.
TWO markββ
Gfinβ(D,D) for Cpβ(X);
5. 5.
TWO markββ
Gfinβ(D,Ξ©xβ) for Cpβ(X);
6. 6.
TWO markββ Gfinβ(Ξ©,Ξ©) for X;
7. 7.
X is Ο-compact.
Proof.
Second-countability allows us to
apply Corollary 4.5 to show (1-3) are mutually equivalent,
as are (4-6).
By [9, Corollary 39], (3) is equivalent to (6),
and by [9, Lemma 24], (6) equivalent to (7).
β
We now demonstrate analogous results, replacing D
and Ξ© with S and Ξ.
We recall that a subset of X that is the
complete preimage of zero for a certain function fromΒ C(X) is called a zero-set.
A subset OβX is called a cozero-set (or functionally
open) of X if XβO is a zero-set.
A Ξ³-cover U of co-zero sets of X is Ξ³Fβ-shrinkable if there exists a Ξ³-cover {F(U):UβU} of zero-sets of X with F(U)βU for
some UβU ([22]).
For a topological space X we let ΞFββΞ
denote the family of Ξ³Fβ-shrinkable covers of X.
Theorem 4.8**.**
For a Tychonoff space X with ββ{1,fin},
the following are equivalent:
-
TWO has a winning (Markov) strategy in Gββ(ΞFβ,Ξ©) on X;
2. 2.
TWO has a winning (Markov) strategy in Gββ
(Ξ0β,Ξ©0β) on Cpβ(X);
3. 3.
TWO has a winning (Markov) strategy in
Gββ(S,Ξ©0β) on Cpβ(X).
Proof.
(1)β(2). For each BβΞ0β we define
Unβ(B)={fβ[(β2n1β,2n1β)]:fβB}. To see that Unβ(B)βΞFβ, let xβX.
Since BβΞ0β, Bβ[x;(β2n+11β,2n+11β)]
is finite. It follows that for fβBβ©[x;(β2n+11β,2n+11β)],
[TABLE]
and we have shown that
{fβ[[β2n+11β,2n+11β]]:fβB} is a Ξ³ cover by zero sets; therefore Unβ(B)βΞFβ.
Let BnββΞ0β, and for UβUnβ(Bnβ) fix fU,nββBnβ
such that U=fU,nββ[(β2n1β,2n1β)].
If TWO βGββ(ΞFβ,Ξ©) holds, then we may find a
winning strategy Ο that not only produces Ο covers,
but produces covers such that every cofinite subset is an Ο
cover. To see this, partition any play by ONE into infinitely many
subplays and consider the strategy that applies the known winning
strategy to each subplay (the beginnings of which are cofinal in
Ο).
Now let Ο(β¨B0β,β¦,Bnββ©)={fU,nβ:UβΟ(β¨U0β(B0β),β¦,Unβ(Bnβ)β©)}.
(Note here that the cardinalities of moves made by Ο
are no greater than the cardinalities produced by
Ο, so this proof applies to both G1β and Gfinβ.)
We claim that 0βn<ΟββΟ(β¨B0β,...,Bnββ©)β.
To see this, let Gβ[X]<Ο and Ο΅>0.
Then choose n<Ο such that 2n1β<Ο΅
and GβU for some UβΟ(β¨U0β(B0β),β¦,Unβ(Bnβ)β©).
Then
[TABLE]
demonstrates that fU,nββΟ(β¨B0β,β¦,Bnββ©)β©[G;(βΟ΅,Ο΅)], verifying our claim.
If TWO markββGββ(ΞFβ,Ξ©) holds, then we may again
assume we have a witnessing strategy Ο producing omega
covers such that every cofinite subset is an Ο-cover, for
the same reason as above.
Now let Ο(Bnβ,n)={fU,nβ:UβΟ(Unβ(Bnβ),n)}.
(Note again here that the cardinality of Ο matches the cardinality
of Ο, so this proof applies to both G1β and Gfinβ.)
We claim that 0βn<ΟββΟ(Bnβ,n)β.
To see this, let Gβ[X]<Ο and Ο΅>0.
Then choose n<Ο such that 2n1β<Ο΅
and GβU for some UβΟ(Unβ(Bnβ),n).
Then
[TABLE]
demonstrates that fU,nββΟ(Bnβ,n)β©[G;(βΟ΅,Ο΅)], verifying our claim.
(2)β(3). For each SβS, select
GSββS such that limG=0. Given a strategy for TWO in
Gββ(Ξ0β,Ξ©0β), TWOβs strategy for
Gββ(S,Ξ©0β) simply substitutes each SβS
with GSβ.
(3)β(1). For each UβΞFβ define
S(U)={fβC(X):fβΎ(XβU)β‘1
for some UβU}. By [22, Lemma 6.5], S(U) is
sequentially dense in Cpβ(X).
Let UnββΞFβ, and for each fβS(Unβ) choose
Uf,nββUnβ where fβΎ(XβUf,nβ)β‘1.
So let Ο witness TWO βGββ(S,Ξ©0β), so 0βn<ΟββΟ(β¨S(U0β),...,S(Unβ)β©)β. We then
define Ο(β¨U0β,...,Unββ©)={Uf,nβ:fβΟ(β¨S(U0β),...,S(Unβ)β©)}.
Let Fβ[X]<Ο, so we may choose nβΟ such that
fβΟ(β¨S(U0β),β¦,S(Unβ)β©)β©[F;(β1/2,1/2)]. Then as fβΎF cannot map to 1,
FβUf,nβ. Therefore Ο produces Ο-covers.
Finally, let Ο witness TWO markββGββ(S,Ξ©0β), so 0βn<ΟββΟ(S(Unβ),n)β.
We then define Ο(Unβ,n)={Uf,nβ:fβΟ(S(Unβ),n)}. Let Fβ[X]<Ο, so we may
choose nβΟ such that fβΟ(S(Unβ),n)β©[F;(β1/2,1/2)]. Then as fβΎF cannot map to 1,
FβUf,nβ. Therefore Ο produces Ο-covers.
β
Corollary 4.9**.**
Let X be a Tychonoff space with a coarser second countably
topology and ββ{1,fin}. The following assertions are
equivalent:
-
TWO has a winning (Markov) strategy in Gββ(ΞFβ,Ξ©) on X;
2. 2.
TWO has a winning (Markov) strategy in Gββ
(Ξ0β,Ξ©0β) on Cpβ(X);
3. 3.
TWO has a winning (Markov) strategy in
Gββ(S,Ξ©0β) on Cpβ(X).
4. 4.
TWO has a winning (Markov) strategy in
Gββ(S,D) on Cpβ(X);
Proof.
By Theorems 2.3 and 4.3, items (3) and (4) are
equivalent.
β