Selection principles and games in bitopological function spaces
Daniil Lyakhovets
[
Krasovskii Institute of Mathematics and Mechanics, 620219, Yekaterinburg, Russia
Alexander V. Osipov
[
Krasovskii Institute of Mathematics and Mechanics, Ural Federal
University, Ural State University of Economics, 620219, Yekaterinburg, Russia
Abstract
For a Tychonoff space X, we denote by (C(X),τk,τp)
the bitopological space of all real-valued continuous functions on
X where τk is the compact-open topology and τp is
the topology of pointwise convergence. In papers
[5, 6, 13] variations of selective separability and
tightness in (C(X),τk,τp) were investigated. In this
paper we continued to study the selective properties and the
corresponding topological games in the space (C(X),τk,τp).
keywords:
selection principles , compact-open topology , function
space , bitopological space , topological games , separable space
MSC:
[2010] 54C35 , 54D65 , 54E55 , 54A20 , 91A05
, 91A44
††journal: …
label1][email protected]
label2][email protected]
1 Introduction
In papers [1, 3, 7, 9, 10, 11, 12, 14] the authors
investigated the selectors of dense subsets of the space C(X) of
all real-valued continuous functions on a Tychonoff space X with
the topology τp of pointwise convergence and with the
compact-open topology τk. For a Tychonoff space X, we
denote by (C(X),τk,τp) the bitopological space. In
articles [5, 6, 13], variations of selective
separability and tightness in (C(X),τk,τp) were
investigated. In this paper, we continued to study the selective
properties and the corresponding topological games in the space
(C(X),τk,τp). The following selection properties for
(C(X),τk,τp) are considered.
S1(Dk,Sp)=Sfin(Dk,Sp)⇒S1(Dk,Dp)⇒Sfin(Dk,Dp)
For example, a space (C(X),τk,τp) satisfies
S1(Dk,Sp) (resp.,
Sfin(Dk,Sp)) if whenever (Dn:n∈N) is a sequence of dense subsets of Ck(X), one can
take points fn∈Dn (resp., finite Fn⊂Dn) such
that {fn:n∈N} (resp., ⋃{Fn:n∈N}) is sequentially dense in Cp(X). There is a
topological game, denoted by G∗(A,B),
corresponding to S∗(A,B).
In this paper, we have gave characterizations for the
bitopological space (C(X),τk,τp) to satisfy the
selection properties and the corresponding games.
2 Main definitions and notation
Let A and B be sets consisting of
families of subsets of an infinite set X. Then many topological
properties are characterized in terms of the following classical
selection principles:
S1(A,B) is the selection hypothesis: for
each sequence (An:n∈N) of elements of
A there is a sequence (bn:n∈N) such
that for each n, bn∈An, and {bn:n∈N} is an element of B.
Sfin(A,B) is the selection hypothesis:
for each sequence (An:n∈N) of elements of
A there is a sequence (Bn:n∈N) of
finite sets such that for each n, Bn⊆An, and
⋃n∈NBn∈B.
The following prototype of many classical properties is called
”A choose B” in [15].
(BA) : For each U∈A there exists V⊆U such
that V∈B. In this paper we accept that
∣V∣=ℵ0.
Then Sfin(A,B) implies
(BA).
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.
An open cover U of a space X is called:
∙ an ω-cover (a k-cover) if each finite
(compact) subset C of X is contained in an element of
U.
∙ a γ-cover (a γk-cover) if U
is infinite and for each finite (compact) subset C of X the
set {U∈U:C⊈U} is finite.
For a topological space X we denote:
∙ O — the family of all open covers of X;
∙ Γ — the family of all open γ-covers of
X;
∙ Γk — the family of all open γk-covers
of X;
∙ Ω — the family of all open ω-covers of
X;
∙ K — the family of all open k-covers of
X;
∙ Dk — the family of all dense subsets of
Ck(X);
∙ Dp — the family of all dense subsets of
Cp(X);
∙ Sk — the family of all sequentially dense
subsets of Ck(X);
∙ Sp — the family of all sequentially dense
subsets of Cp(X);
∙ K(X) — the family of all non-empty compact
subsets of X;
∙ F(X) — the family of all non-empty finite
subsets of X.
A space X is said to be a γk-set if each k-cover
U of X contains a countable set {Un:n∈N} which is a γk-cover of X [4].
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. Clearly, every sequentially separable space is
separable.
Let X be a topological space, and x∈X. A subset A of X
converges to x, x=limA, if A is infinite, x∈/A, and for each neighborhood U of x, A∖U is
finite. Consider the following collection:
∙ Ωx={A⊆X:x∈A∖A};
∙ Γx={A⊆X:x=limA}.
Note that if A∈Γx, then there exists {an}⊂A
converging to x. So, simply Γx may be the set of
non-trivial convergent sequences to x.
We write Π(Ax,Bx) without specifying
x, we mean (∀x)Π(Ax,Bx).
So we have three types of topological properties of (C(X),τk,τp)
described through the selection principles of X where the index
k means the compact-open topology and the index p - the
topology of pointwise convergence:
∙ local properties of the form S∗(Φxk,Ψxp);
∙ global properties of the form S∗(Φk,Ψp);
∙ semi-local properties of the form
S∗(Φk,Ψxp).
There is a game, denoted by Gfin(A,B),
corresponding to Sfin(A,B); 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∈N⋃Bn∈B; otherwise, ONE wins.
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.
If ONE does not have a winning strategy in the game
G∗(A,B), then the selection hypothesis
S∗(A,B) is true; it is easy to prove. The
converse implication is not always true.
Similarly, one defines the game G1(A,B),
associated with S1(A,B).
So we have three types of topological games on (C(X),τk,τp) described through the selection principles (or
topological games) of X:
∙ local games of the form G∗(Φxk,Ψxp);
∙ global games of the form G∗(Φk,Ψp);
∙ semi-local games of the form G∗(Φk,Ψxp).
The symbol 0 denotes the constantly zero function in
C(X).
3 S1(Dk,Dp) and G1(Dk,Dp)
Theorem 3.1**.**
(Theorem 3.7 in [13] for λ=k and μ=p) For a space X the following are
equivalent:
-
(C(X),τk,τp)* has the property
S1(Ω0k,Ω0p);*
2. 2.
X* has the property S1(K,Ω).*
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 3.2**.**
(Noble [8]) A space Ck(X) is separable iff
iw(X)=ℵ0.
Recall that a subset A of a bitopological space
(X,τ1,τ2) is bidense (double dense or short d-dense)
in X if A is dense in both (X,τ1) and (X,τ2)
([2]). (X,τ1,τ2) is d-separable if there is
a countable set A which is d-dense in X. Note that if
iw(X)=ℵ0, then (C(X),τk,τp) is d-separable.
Theorem 3.3**.**
For a space X with iw(X)=ℵ0 the following are equivalent:
-
(C(X),τk,τp)* has the property
S1(Dk,Dp);*
2. 2.
(C(X),τk,τp)* has the property
S1(Dk,Ω0p);*
3. 3.
(C(X),τk,τp)* has the property
S1(Ω0k,Ω0p);*
4. 4.
X* has the property S1(K,Ω);*
5. 5.
(C(X),τk,τp)* has the property
(DpDk);*
6. 6.
ONE has no winning strategy in the game
G1(K,Ω);
7. 7.
ONE has no winning strategy in the game
G1(Dk,Dp);
8. 8.
ONE has no winning strategy in the game G1(Ω0k,Ω0p);
9. 9.
ONE has no winning strategy in the game
G1(Dk,Ω0p).
Proof.
(1)⇒(4). Let (Uik:i∈N) be a sequence
k-covers of X and let D={fs:s∈N} be a
countable dense set in Ck(X). Consider Pi:={hL,W,fsi∈C(X):hL,W,fsi↾L=fs↾L,L∈K(X),L⊂W:W∈Uik,h↾(X∖W)=1,fs∈D}.
Note Pi is a dense subset of Ck(X) for each i∈N. Indeed fix f∈C(X),K∈K(X),ϵ>0, then ⟨f,K,ϵ⟩ is neighborhood of
f. There is Wk∈Uik such that K⊂Wk. Then there
exists fs∈D such that fs∈⟨f,K,ϵ⟩. Take hK,Wk,fsi∈⟨f,K,ϵ⟩.
Since {Pi:i∈N} is a countable set of dense sets
in Ck(X), by (1), there exists {pi:i∈N}
such that pi∈Pi and {pi:i∈N} is a dense
set in Cp(X). For {pi=hLi,Wi,fsi:i∈N}, we have that {Wi:i∈N} is
ω-cover of X. Indeed, let M={x1,x2,...,xk} is
a finite set in X. Consider U=⟨0,M,(−21;21)⟩, then there exists i′ such
that pi′∈U. It follows that M⊂Wi′.
(3)⇒(2) is immediate.
(4)⇒(3). Let {Pi:i∈N} such that
Pi∈Ω0k. Fix m∈N. Take Mim:={Wi,m,h=h−1(−m1;m1):h∈Pi}, where
Wi,m,n is nonempty. Note that Mim is k - cover of X.
Indeed for each K∈K,⟨0,K,(−m1;m1)⟩ there exists p∈Pi:p∈⟨0,K,(−m1;m1)⟩, then K⊂Wi,m,pi=p−1(−m1;m1). Mean for
every i,m Mim is family K - covers in X. Then
by (4), there is {Wi,m,hi,m:i,m∈N} such
that Wi,m,hi,m∈Mim and {Wi,m,hi,m:i,m∈N} is ω - cover of X. Show that {hi,m:i,m∈N}∈Ω0p. Take an arbitrary S={x1,x2,...,xk} and ϵ>0. Consider ⟨0,S,ϵ⟩ - neighborhood of
0. There is m′:m′1<ϵ. Since a
ω - cover of X is large cover of X, then there are m′,i′∈N such that S⊂Wi′,m′,hi′,m′ and
m′1<ϵ, therefor hi′,m′∈⟨0,S,ϵ⟩.
(2)⇒(1). Let {Di,j:i,j∈N} be a
countable set of dense sets in Ck(X). Let D={di:i∈N} is a countable dense set in Ck(X) for every
i∈N. By S1(Dk,Ωdip) there exists
{di,j:j∈N} such that di,j∈Di,j and
{di,j:j∈N}∈Ωdip. Consider M={di,j:i,j,∈N}. Prove that M is dense in
Cp(X). Fix f∈C(X). Let L={x1,x2,...,xn} be a
finite set of X and ϵ>0. The set ⟨f,L,ϵ⟩ is a neighborhood of f, then there is
di′∈D such that di′∈⟨f,L,ϵ⟩, than there is
j′ such that di′,j′∈⟨f,L,ϵ⟩, than M∈Dp
(6)⇒(4) is immediate.
(4)⇒(6). Let σ be a strategy for ONE in G1(K,Ω) and let the first move of ONE be a k-cover
σ(∅)={U(α1):α1∈Λ1}. Suppose that for each finite sequence s of numbers αi∈Λi of length
at most m, Us has been already defined. Then define {U(α1,...,αm,αk):αk∈Λk} to be the set
σ(U(α1),U(α1,α2),...,U(α1,...,αm))∖{U(α1),U(α1,α2),...,U(α1,...,αm)}.
Because each compact subset of X belongs to infinitely many elements of a k-cover, we have that,
for each s, a finite sequence of numbers αi∈Λi, the set {Us⌢(αn):αn∈Λn} is a k-cover.
Apply (4) and, for each s, choose αs∈Λs such that {Us⌢(αs):s a finite sequence of numbers αi∈Λi,i∈N }
is a ω-cover of X. Then inductively define a sequence α1=α∅,αk+1=α(α1,...,αk) for k⩾1.
Then Uα1,Uα1,α2,...,Uα1,...,αk,... is a ω-cover, and because it is, in fact, a
sequence of moves TWO in a play of game G1(K,Ω), σ is not a winning strategy for ONE.
Similarly to (4)⇔(6) we have that
(1)⇔(7), (2)⇔(9) and
(3)⇔(8).
∎
4 Sfin(Dk,Dp) and Gfin(Dk,Dp)
Theorem 4.1**.**
(Theorem 3.9 in [13] for λ=k and μ=p) For a space X the following are
equivalent:
-
(C(X),τk,τp)* has the property
Sfin(Ω0k,Ω0p);*
2. 2.
X* has the property Sfin(K,Ω).*
Theorem 4.2**.**
For a space X with iw(X)=ℵ0 the following statements are equivalent:
-
(C(X),τk,τp)* has the property
Sfin(Dk,Dp);*
2. 2.
(C(X),τk,τp)* has the property
Sfin(Dk,Ω0p);*
3. 3.
(C(X),τk,τp)* has the property
Sfin(Ω0k,Ω0p);*
4. 4.
X* satisfies the selection principle Sfin(K,Ω);*
5. 5.
ONE has no winning strategy in the game
Gfin(K,Ω);
6. 6.
ONE has no winning strategy in the game
Gfin(Dk,Dp);
7. 7.
ONE has no winning strategy in the game
Gfin(Ω0k,Ω0p);
8. 8.
ONE has no winning strategy in the game
Gfin(Dk,Ω0p).
Proof.
The implications are proved similarly to the proof of Theorem
5.3.
∎
5 S1(Dk,Sp) and G1(Dk,Sp)
Theorem 5.1**.**
(Theorem 15 in [3]) For a space X the following are
equivalent:
-
(C(X),τk,τp)* has the property
S1(Ω0k,Γ0p);*
2. 2.
X* has the property S1(K,Γ).*
Theorem 5.2**.**
(Theorem 10 in [7]) For a space X the following are
equivalent:
-
X* has the property Sfin(K,Γ);*
2. 2.
X* has the property S1(K,Γ);*
3. 3.
ONE has no winning strategy in the game
G1(K,Γ).
Theorem 5.3**.**
For a space X with iw(X)=ℵ0 the following statements are equivalent:
-
(C(X),τk,τp)* has the property
S1(Dk,Sp);*
2. 2.
(C(X),τk,τp)* has the property
(SpDk);*
3. 3.
X* has the property S1(K,Γ);*
4. 4.
(C(X),τk,τp)* has the property
Sfin(Dk,Sp);*
5. 5.
X* has the property Sfin(K,Γ);*
6. 6.
Each finite power of X has the property
S1(K,Γ);
7. 7.
(C(X),τk,τp)* has the property
S1(Ω0k,Γ0p);*
8. 8.
(C(X),τk,τp)* has the property
S1(Dk,Γ0p);*
9. 9.
X* has the property (ΓK);*
10. 10.
ONE has no winning strategy in the game
G1(K,Γ);
11. 11.
ONE has no winning strategy in the game
G1(Dk,Sp);
12. 12.
ONE has no winning strategy in the game G1(Ω0k,Γ0p);
13. 13.
ONE has no winning strategy in the game
G1(Dk,Γ0p).
Proof.
By Theorem 5.1 (Theorem 15 in [3]),
(3)⇔(7).
By Theorem 5.2 (Theorem 10 in [7]),
(3)⇔(5)⇔(10).
By Theorem 14 in [3], (3)⇔(9).
(3)⇔(6) (Proposition 13 and Theorem 10 in
[7]).
(1)⇒(4) is immediate.
(7)⇒(8) is immediate.
Similarly to (3)⇔(10) (the implication
(2)⇒(3) in Theorem 10 in [7]) we have that
(1)⇔(11), (7)⇔(12) and
(8)⇔(13).
(4)⇒(2). Let D be a dense subset of Ck(X). By the
property Sfin(Dk,Sp), for
sequence (Di:Di=D and i∈N)
there is a sequence (Ki:i∈N) such that for each
i, Ki is finite, Ki⊂Di, and
⋃i∈NKi is a countable sequentially dense
subset of Cp(X).
(2)⇒(9). Let U be an open k-cover of
X. Note that the set D:={f∈C(X):f↾(X∖U)≡1 for some
U∈U} is dense in Ck(X) and, hence,
D contains a countable sequentially dense set A in
Cp(X) . Take {fn:n∈N}⊂A such that
fn↦0 (n↦∞) in Cp(X). Let
fn↾(X∖Un)≡1 for some
Un∈U. Then {Un:n∈N} is a
γ-subcover of U, because of fn↦0. Hence, X satisfies (ΓK).
(3)⇒(1). Let (Di,j:i,j∈N) be a
sequence of dense subsets of Ck(X) and let D={fi:i∈N} be a countable dense subset of Ck(X).
For every fi∈D and j∈N consider
Ui,j={Uh,i,j:Uh,i,j=(fi−h)−1(−j1,j1)∧(Uh,i,j=∅) for h∈Di,j}. Note that
Ui,j is an k-cover of X for every i,j∈N. Since X satisfies S1(K,Γ),
there is a sequence (Uh(i,j),i,j:i,j∈N) such
that Uh(i,j),i,j∈Ui,j, and
ϕ:={Uh(i,j),i,j:i,j∈N} is an element of
Γ.
We claim that {h(i,j):i,j∈N} is a sequentially
dense subset of Cp(X).
Fix g∈C(X). There exists (fik:k∈N) such
that fik→g (k→∞) in τp.
Then (g−fik)→0 in τp. Show that h(ik,j)→g in τp. Let W=⟨g,A,ϵ⟩ be a base neighborhood of g in Cp(X), where A is a
finite subset of X and ϵ>0. Since ϕ is a
γ-cover of X, then {Uh(ik,j),ik,j:k,j∈N} is a γ-cover of X, too. There exists
k′,j′ such that j′1<2ϵ and for
every k>k′,j>j′ the following statements are true:
(g−fik)(A)⊂(−2ϵ;2ϵ)
and (fik−h(ik,j))(A)⊂(−j′1;j′1)⊂(−2ϵ;2ϵ). Notice, that
((g−fik)+(fik−h(ik,j)))(A)=(g−h(ik,j))(A)⊂(−ϵ;ϵ). Then h(ik,j)⊂W for every k>k′,j>j′.
(8)⇒(3). Let {Ui:i∈N}⊂K and let D={dj:j∈N} be a countable dense subset of Ck(X). Consider
Di={fK,U,i,j∈C(X): such that fK,U,i,j↾K≡dj, fK,U,i,j↾(X∖U)≡1
where K∈K(X), K⊂U∈Ui} for
every i∈N. Since D is a dense subset of Ck(X),
then Di is a dense subset of Ck(X) for every i∈N. By (8), there is a set {fK(i),U(i),i,j(i):i∈N} such that fK(i),U(i),i,j(i)∈Di and
{fK(i),U(i),i,j(i):i∈N}∈Γ0p. Claim that a set {U(i):i∈N}∈Γ. Let
K be a finite subset of X and let
W=[K,(−21,21)] be a base neighborhood of 0. Since {fK(i),U(i),i,j(i):i∈N}∈Γ0p, there is i′∈N such that fK(i),U(i),i,j(i)∈W for every i>i′. It follows that K⊂U(i) for every i>i′ and hence {U(i):i∈N}∈Γ.
∎
We can summarize the relationships between considered notions in
next diagrams.
G1(Dk,Γ0p)⇔Gfin(Dk,Γ0p)⇒G1(Dk,Ω0p)⇒Gfin(Dk,Ω0p)
⇕
⇕
⇕ ⇕
G1(Ω0k,Γ0p)⇔Gfin(Ω0k,Γ0p)⇒G1(Ω0k,Ω0p)⇒Gfin(Ω0k,Ω0p)
⇕
⇕
⇕ ⇕
G1(Dk,Sp)⇔Gfin(Dk,Sp)⇒G1(Dk,Dp)⇒Gfin(Dk,Dp)
⇕
⇕
⇕ ⇕
S1(Dk,Sp)⇔Sfin(Dk,Sp)⇒S1(Dk,Dp)⇒Sfin(Dk,Dp)
⇕
⇕
⇕ ⇕
S1(Dk,Γ0p)⇔Sfin(Dk,Γ0p)⇒S1(Dk,Ω0p)⇒Sfin(Dk,Ω0p)
⇕
⇕
⇕ ⇕
S1(Ω0k,Γ0p)⇔Sfin(Ω0k,Γ0p)⇒S1(Ω0k,Ω0p)⇒Sfin(Ω0k,Ω0p)
Fig. 2. The Diagram of games and selectors of (C(X),τk,τp).
G1(K,Γ)⇔Gfin(K,Γ)⇒G1(K,Ω)⇒Gfin(K,Ω)
⇕
⇕
⇕ ⇕
S1(K,Γ)⇔Sfin(K,Γ)⇒S1(K,Ω)⇒Sfin(K,Ω)
Fig. 3. The Diagram of games and selection principles for a space
X with iw(X)=ℵ0 corresponding to selectors of (C(X),τk,τp).