This paper constructs a topological space with a Lusin π-base whose Cartesian square lacks such a base, highlighting a unique property of these spaces.
Contribution
It presents the first example of a space with a Lusin π-base whose square does not have a Lusin π-base, revealing new insights into their structural properties.
Findings
01
Constructed a space with a Lusin π-base but its square lacks one.
02
Demonstrated the non-preservation of Lusin π-base property under Cartesian square formation.
03
Provided a counterexample to previous assumptions about Lusin π-bases.
Abstract
We construct a space X that has a Lusin π-base and such that X2 has no Lusin π-base.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Advanced Topology and Set Theory · Rings, Modules, and Algebras
Full text
A space with a Lusin π-base
whose square has no Lusin π-base3332010 Mathematics Subject Classification: Primary 54E99; Secondary 54H05. Keywords: Lusin pi-base, pi-tree, the Baire space, the Sorgenfrey line, Souslin scheme, Lusin scheme, product of topological spaces
Mikhail Patrakeev111Krasovskii Institute of Mathematics and Mechanics of UB RAS, 620990, 16 Sofia Kovalevskaya street, Yekaterinburg, Russia and Ural Federal University, 620002, 19 Mira street, Yekaterinburg, Russia; [email protected]
This work is supported by Act 211 Government of the Russian Federation, contract no. 02.A03.21.0006
Abstract
We construct a space X that has a Lusin π-base and such that X2 has no Lusin π-base.
1 Introduction
The class of topological spaces with a Lusin π-base, see Definition 2, was introduced in [1]; this class equals the class of spaces with a π-tree [2, Remark 11].
In this paper we build a space with a Lusin π-base whose square has no Lusin π-base, see Theorem 25.
The Baire space ωω, the Sorgenfrey line S, and the irrational Sorgenfrey line I have a Lusin π-base [1, 3], and all at most countable products of ωω,S, and I also have a Lusin π-base [3].
If a space X has a Lusin π-base, then the products X×ωω,X×S, and X×Sω have a Lusin π-base [3],
and also X∖F has a Lusin π-base whenever F⊆X is a σ-compact [2] (but a dense open subset of X can be without a Lusin π-base).
If a space X has a Lusin π-base, then it can be mapped onto ωω by a continuous one-to-one map and also X can be mapped onto an arbitrary nonempty Polish space by a continuous open map [1].
If a space X has a Lusin π-base, then it has a countable π-base and a countable pseudo-base (both with clopen members); and also X is a Choquet space (but it can be not strong Choquet even in a separable metrizable case). For each M⊆ωω, there exists a separable metrizable space with a Lusin π-base that contains a closed subspace homeomorphic to M.
2 Notation and terminology
We use terminology from [4] and [5]. A space is a topological space. Also we use the following notations:
Notation 1**.**
The symbol :− means ‘‘equals by definition’’;
the symbol :⟷ is used to show that an expression on the left side is an abbreviation for expression on the right side;
✎
ω:− the set of finite ordinals = the set of natural numbers,
so 0=∅∈ω and n={0,…,n−1} for all n∈ω;
✎
s is a sequence:⟷s is a function such that domain(s)∈ω or domain(s)=ω;
✎
if s is sequence, then
length(s):−domain(s);
✎
⟨s0,…,sn−1⟩:−
the sequence s such that length(s)=n∈ω and s(i)=si for all i∈n;
✎
⟨⟩:− the sequence of length 0;
✎
if s=⟨s0,…,sn−1⟩, then
s⌢x:−⟨s0,…,sn−1,x⟩;
✎
f↾A:− the restriction of function f to A;
✎
A⊂B:⟷A⊆BandA=B;
✎
if s and t are sequences, then
s⊑t:⟷s=t↾length(s),
s⊏t:⟷s⊑tands=t
(actually, s⊑t↔s⊆t
and s⊏t↔s⊂t);
✎
BA:− the set of functions from B to A;
in particular, {}^{0}{A}=\big{\{}\langle\rangle\big{\}};
✎
<ωA:−⋃n∈ωnA=
the set of finite sequences in A;
✎
A is a singleton:⟷A={x} for some x;
✎
nbhds(p,X):−
the set of (not necessarily open) neighbourhoods of point p in space X;
✎
γ is a π-net for a space X:⟷for each nonempty open U⊆X, there is G∈γ such that G⊆U, and all elements of γ are nonempty;
✎
γ is a π-base for a space X:⟷γ is a π-net for X and all elements of γ are open.
Recall that [6] a Lusin scheme on a set X is a family L=⟨La⟩a∈<ωω of subsets of X such that
(L0)
La⊇La⌢n for all a∈<ωω,n∈ω and
(L1)
La⌢n∩La⌢m=∅ for all a∈<ωω and n=m∈ω.
Definition 2**.**
✎
A Lusin scheme L on a set X is strict iff
(L2)
L⟨⟩=X,
(L3)
La=⋃n∈ωLa⌢n for all a∈<ωω, and
(L4)
⋂n∈ωLp↾n is a singleton for all p∈ωω.
✎
A Lusin scheme L on a space X is open iff
(L5)
each La is an open subset of X.
✎
A Lusin π-base for a space X is an open strict Lusin scheme L on X such that
Suppose that L is a strict Lusin scheme. Then, for all a,b∈<ωω,
(1)
La=∅;
(2)
La⊃Lb⟷a⊏b;
(3)
La∩Lb=∅⟷(a⊑b or a⊒b). ∎
Remark 4**.**
Suppose that L is a Lusin π-base for a space X. Then the family {La:a∈<ωω} is a π-base for X. ∎
Notation 5**.**
✎
S:− the standard Lusin scheme:− the Lusin scheme ⟨Sa⟩a∈<ωω such that
Sa={p∈ωω:a⊑p}
for all a∈<ωω.
✎
ωω:− the Baire space:− the space ⟨ωω,τprod⟩, where τprod is the Tychonoff product topology with ω carrying the discrete topology.
Remark 6**.**
(1)
The family {Sa:a∈<ωω} is a base for the Baire space ωω.
(2)
The standard Lusin scheme S is a Lusin π-base for ωω. ∎
Notation 7**.**
We denote by ⊲ the strict lexicographic order on ωω; that is,
for all p,q∈ωω,
✎
p⊲q:⟷∃n,i,j∈ω such that
➢
p↾n=q↾n,
➢
(p↾n)⌢i⊑p,
➢
(q↾n)⌢j⊑q, and
➢
i<j.
✎
p\downfilledspoon:−{p}∪{q∈ωω:p⊲q}.
✎
A↑:−⋃{p\downfilledspoon:p∈A}.
Remark 8**.**
Suppose that a∈<ωω and n,m∈ω.
Then
➢
Sa⌢n∩(Sa⌢m↑)=∅
whenever n<m. ∎
3 Construction of a space ⟨ωω,τF⟩
In this section, for each family F=⟨Fp⟩p∈ωω of free filters on a ω, we construct a topology τF on ωω such that the space
⟨ωω,τF⟩ has a Lusin π-base, see Example 14. In the next section we build a family F in such a way that the square of ⟨ωω,τF⟩ has no Lusin π-base.
First we reformulate condition (L6) of the definition of a Lusin π-base, see Definition 2 and Remark 10, by using the notion of a shoot:
Notation 9**.**
Suppose that L is a Lusin scheme, a∈<ωω, and k∈ω. Then
The clause (L6) of the definition of a Lusin π-base is equivalent to the following:
(L6’)
∀p∈X∀U∈nbhds(p,X)
\exists{a}\in{}^{<\hskip 0.2pt\omega}\omega\
such that
➢
La∋p and
➢
shootL(a)∈˙U. ∎
It is convenient to call Lak a k-tail of La, so that the shootL(a) is the set of tails of La and shootL(a)∈˙U iff some tail of La is contained in U. Note also that the family shootL(a) is closed under finite intersections. We will use the following simple properties of shoots:
Remark 11**.**
Suppose that L is a strict Lusin scheme and a∈<ωω.
Then
(1)
shootL(a)∈˙La.
(2)
If shootL(a)∈˙A and A⊆B,
then
shootL(a)∈˙B.
(3)
If shootL(a)∈˙A and shootL(a)∈˙B,
then
shootL(a)∈˙A∩B.
(4)
If A∩B=∅,
then shootL(a)∈˙A or shootL(a)∈˙B. ∎
Next we define sets Sp(M,g), which will form basic neighbourhoods at points p∈ωω for topology τF in Example 14.
Recall that Sa={p∈ωω:a⊑p},Sak=⋃j⩾kSa⌢j,
and [ω]ω is the set of infinite subsets of ω.
Notation 12**.**
Suppose that p∈ωω,M∈[ω]ω, and g:M→ω. Then
✎
Sp(M,g):−{p}∪m∈M⋃Sp↾mg(m).
Remark 13**.**
Suppose that
p∈ωω,M∈[ω]ω,g:M→ω, and g(m)>p(m) for all m∈M.
Then:
(1)
Sp↾mg(m)⊆Sp↾m∖Sp↾(m+1) for all m∈M.
(2)
Sp(M,g)⊆p\downfilledspoon. ∎
Recall that γ is a filter on ω iff γ is a family of nonempty subsets of ω such that (1) A∩B∈γ for all A,B∈γ and (2) C∈γ whenever ω⊇C⊇A∈γ.
A filter γ is free iff ⋂{A:A∈γ}=∅. Now we construct a space ⟨ωω,τF⟩, which has S as a Lusin π-base:
Example 14**.**
Suppose that F=⟨Fp⟩p∈ωω is an indexed family of free filters on ω. Then
✎
τF:− the topology on ωω generated by the subbase
\big{\{}\,\widehat{\mathbf{S}}_{{p}}({M},{g})\>:\>{p}\in{}^{\omega}\omega,\>{M}\in\mathcal{F}_{{p}},\ \mathsf{and}\ {g}\colon{M}\to\omega\big{\}}.
The space ⟨ωω,τF⟩ has the following properties:
(F1)
For each point p∈ωω, the family \big{\{}\,\widehat{\mathbf{S}}_{{p}}({M},{g}):{M}\in\mathcal{F}_{{p}}\enskip\mathsf{and}\enskip{g}\colon{M}\to\omega\big{\}}
is a neighbourhood base for ⟨ωω,τF⟩ at p.
(F2)
The standard Lusin scheme S is a Lusin π-base for ⟨ωω,τF⟩. ∎
It is interesting to note one additional property of the above space, although we do not use it in this paper.
In [3] we found sufficient conditions under which the product of spaces that have a Lusin π-base also has a Lusin π-base; these conditions were formulated by using the following terminology: For a Lusin scheme L on a space X, a point p∈X and its neighbourhood U⊆X, the span of U at p is defined as follows:
[TABLE]
(so that clause (L6’) of Remark 10 is equivalent to the assertion that every
spanL(U,p) is nonempty).
If L is a Lusin π-base for X and p∈X, then
the family {spanL(U,p):U∈nbhds(p,X)} has the finite intersection property [3, Lemma 3.6], so we can define
the rootL(p,X) to be the filter on ω generated by this family.
A theorem in [3] says that if some spaces have Lusin π-bases with ‘‘good’’ roots, then the product of these spaces has a Lusin π-base.
Now, the space ⟨ωω,τF⟩ from Example 14 has the following property:
(F3)
\operatorname{\mathsf{root}}_{\hskip 1.0pt\mathbf{S}}\big{(}{p},\langle{}^{\omega}\omega,\tau_{\scriptscriptstyle\mathcal{F}}\rangle\big{)}=\mathcal{F}_{{p}} for all p∈ωω.
Therefore we can build a space with a Lusin π-base that has any roots we wish.
4 Construction of a space ⟨ωω,τF⟩ whose square
has no Lusin π-base
In this section we prove Theorem 25, the main result of the article, which says that there exists a space with a Lusin π-base whose square has no Lusin π-base.
To build such a space we construct a family F of free filters on ω in such a way that the space ⟨ωω,τF⟩2 has no Lusin π-base. We construct this family in the proof of Lemma 24, so Theorem 25 is a corollary to this lemma. To make the logic of construction more transparent, we state Lemmas 17, 19, 20, 22 without proofs and prove them in Section 5.
Notation 15**.**
✎
A game is an ordered pair of sequences \Gamma=\big{\langle}\langle{c}_{{n}}\rangle_{{n}\in\omega},\langle{d}_{{n}}\rangle_{{n}\in\omega}\big{\rangle} such that, for all n∈ω,
➢
cn=⟨cn0,cn1⟩∈<ωω×<ωω,
➢
dn=⟨dn0,dn1⟩∈<ωω×<ωω,
➢
cn0⊏dn0⊏cn+10, and
cn1⊏dn1⊏cn+11.
✎
The result of a game Γ is the pair \big{\langle}\operatorname{\mathsf{res}}^{0}(\Gamma),\operatorname{\mathsf{res}}^{1}(\Gamma)\big{\rangle}\in{}^{\omega}\omega\times{}^{\omega}\omega such that, for all n∈ω,
➢
cn0⊑res0(Γ) and
cn1⊑res1(Γ).
✎
A strategy is an ordered pair σ=⟨σ0,σ1⟩ of functions σ0,σ1:<ωω×<ωω→<ωω such that for each c=⟨c0,c1⟩∈<ωω×<ωω,
➢
c0⊏σ0(c) and
c1⊏σ1(c).
✎
A game Γfollows a strategy σ
iff for all n∈ω,
➢
dn0=σ0(cn) and dn1=σ1(cn).
Remark 16**.**
Suppose that
\Gamma=\big{\langle}\langle{c}_{{n}}\rangle_{{n},{m}\in\omega},\langle{d}_{{n}}\rangle_{{n}\in\omega}\big{\rangle} is a game.
Then, for all i∈2={0,1} and n,m∈ω,
(1)
Scni⊃Sdni⊃Scn+1i∋resi(Γ);
(2)
cni=resi(Γ)↾length(cni);
(3)
dni=resi(Γ)↾length(dni);
(4)
length(cn+1i)−1⩾length(dni);
(5)
cni⊑cmi⟷n⩽m;
(6)
dni⊑dmi⟷n⩽m. ∎
Lemma 17**.**
For each strategy σ, there exists a family ⟨Γz⟩z∈ω2 of games that follow σ such that resi(Γz)=resj(Γy)
for all ⟨z,i⟩=⟨y,j⟩∈ω2×2.
Recall that a family γ is a π-net for a space X iff ∅\ninγ and each nonempty open U⊆X contains some G∈γ as a subset. Recall also that ωω is the Baire space ⟨ωω,τprod⟩.
Notation 18**.**
A candidate is a strict Lusin scheme L on the set
ωω×ωω
such that {Lb:b∈<ωω} is a π-net for the space ωω×ωω
and each Lb has nonempty interior in ωω×ωω.
Lemma 19**.**
Suppose that the standard Lusin scheme S is a Lusin π-base for a space ⟨ωω,τ⟩
and L is a Lusin π-base for ⟨ωω,τ⟩×⟨ωω,τ⟩.
Then L is a candidate.
Lemma 20**.**
For each candidate L,
there exists a strategy σ
that possesses the following property:
(★)
For each c=⟨c0,c1⟩∈<ωω×<ωω,
there is b∈<ωω such that
➢
Sc0×Sc1⊇Lb⊇Sσ0(c)×Sσ1(c)* and*
➢
\operatorname{\mathsf{shoot}}_{{L}}({b}{\upharpoonright}{k})\>\not\mathop{\dot{\in}}\>\big{(}\mathbf{S}_{\sigma^{0}({c})}{\uparrow}\times\mathbf{S}_{\sigma^{1}({c})}\big{)}\cup\big{(}\mathbf{S}_{\sigma^{0}({c})}\times(\mathbf{S}_{\sigma^{1}({c})}{\uparrow})\big{)}\quad*
for all k<length(b).*
Notation 21**.**
Suppose that L is a candidate.
Then we denote by σL some (fixed) strategy σ such that property (★) holds.
Lemma 22**.**
For each game Γ, there are sets M0,M1∈[ω]ω and functions g0:M0→ω,g1:M1→ω that possess the following property:
(◆)
For each candidate L
and each a∈<ωω,
➢
if game Γ follows strategy σL and
La∋⟨res0(Γ),res1(Γ)⟩,
➢
then
shootL(a)∈˙Sres0(Γ)(M0,g0)×Sres1(Γ)(M1,g1).
Notation 23**.**
Suppose that Γ is a game.
Then we denote by M0(Γ),M1(Γ),g0(Γ),g1(Γ) some (fixed) sets M0,M1 and functions g0,g1 such that property (◆) holds.
Lemma 24**.**
There exists an indexed family F=⟨Fp⟩p∈ωω of free filters on ω such that the space ⟨ωω,τF⟩×⟨ωω,τF⟩(see Example 14) has no Lusin π-base.
Proof*.*
We may assume that {σ(x):x∈ω2} is the set of all strategies, because the cardinality of this set equals the cardinality of ω2.
Using Lemma 17, we can build (by transfinite recursion on ω2, well-ordered in the type of its cardinality) an indexed family ⟨Γx⟩x∈ω2 of games such that
Now we define an indexed family F=⟨Fp⟩p∈ωω
of free filters on ω. Since all rxi are different by (A2), we may,
for each pair ⟨x,i⟩∈ω2×2,
take Frxi to be an arbitrary free filter on ω such that Frxi∋Mxi. Otherwise, if p differs from all rxi, set Fp to be an arbitrary free filter on ω.
We must prove that the space ⟨ωω,τF⟩×⟨ωω,τF⟩
has no Lusin π-base.
Suppose, on the contrary, that L is a Lusin π-base for
⟨ωω,τF⟩×⟨ωω,τF⟩.
Since the standard Lusin scheme S is a Lusin π-base for ⟨ωω,τF⟩
(see (F2) of Example 14),
it follows by Lemma 19 that L is candidate, so there is x∈ω2 such that σ(x)=σL
(see Notation 21).
Since Mx0∈Frx0 and
gx0:Mx0→ω,
it follows by (F1) of Example 14 that
Srx0(Mx0,gx0)
is a neighbourhood of point rx0 in the space ⟨ωω,τF⟩;
similarly, Srx1(Mx1,gx1)
is a neighbourhood of rx1 in the same space. Then
On the other hand, game Γx follows strategy σ(x)=σL by (A1) and
La∋⟨rx0,rx1⟩=⟨res0(Γx),res1(Γx)⟩, so
we get a contradiction with
[TABLE]
which follows from the choice of Mx0,Mx1,gx0, and gx1.
∎
It looks like we did not use Lemmas 20, 22 in the above proof; actually, these lemmas were needed to make Notations 21, 23 correct. As a corollary to Lemma 24 and (F2) of Example 14, we get the main result of the article:
Theorem 25**.**
There exists a space with a Lusin π-base whose square has no Lusin π-base. ∎
This lemma says that for each strategy σ, there exists a family ⟨Γz⟩z∈ω2 of games that follow σ such that resi(Γz)=resj(Γy)
for all ⟨z,i⟩=⟨y,j⟩∈ω2×2.
In this proof we use the following notation: for a,b∈<ωω,a∥b means a\nsqsubseteqb and a\nsqsupseteqb.
It is not hard to build
cˇui,dˇui∈<ωω for all u∈<ω2 and i∈2 such that the following holds:
(B1)
dˇui=σi(⟨cˇu0,cˇu1⟩)
for all u∈<ω2 and i∈2;
(B2)
dˇui⊏cˇu⌢0i and
dˇui⊏cˇu⌢1i
for all u∈<ω2 and i∈2;
(B3)
if n∈ω,
then
cˇvi∥cˇwj
for all ⟨v,i⟩=⟨w,j⟩∈n2×2.
Since σ is a strategy, it follows from (B1)–(B2) that for each z∈ω2, there is a unique game
\Gamma=\big{\langle}\langle{c}_{{n}}\rangle_{{n}\in\omega},\langle{d}_{{n}}\rangle_{{n}\in\omega}\big{\rangle}
such that
cn=⟨cˇz↾n0,cˇz↾n1⟩ and
dn=⟨dˇz↾n0,dˇz↾n1⟩
for all n∈ω. We denote this game by Γz.
Each game Γz follows strategy σ by (B1). Now, suppose that
⟨z,i⟩=⟨y,j⟩∈ω2×2.
There is n∈ω such that ⟨z↾n,i⟩=⟨y↾n,j⟩, so
cˇz↾ni∥cˇy↾nj by (B3).
Then resi(Γz)=resj(Γy)
because resi(Γz)⊒cˇz↾ni
and resj(Γy)⊒cˇy↾nj.
∎
This lemma says that if S is a Lusin π-base for ⟨ωω,τ⟩
and L is a Lusin π-base for ⟨ωω,τ⟩×⟨ωω,τ⟩,
then L is a strict Lusin scheme on the set
ωω×ωω,{Lb:b∈<ωω} is a π-net for the space ωω×ωω,
and each Lb has nonempty interior in ωω×ωω.
Recall that ωω=⟨ωω,τprod⟩.
Since S is a Lusin π-base for ⟨ωω,τ⟩,
it follows that each Sa is open in ⟨ωω,τ⟩, so
(C)
τ⊇τprod
because
{Sa:a∈<ωω} is a base for ωω
by (1) Remark 6.
Since L is a Lusin π-base for ⟨ωω,τ⟩×⟨ωω,τ⟩,L is a strict Lusin scheme on ωω×ωω.
The family {Lb:b∈<ωω} is a π-base for ⟨ωω,τ⟩×⟨ωω,τ⟩ by Remark 4, so {Lb:b∈<ωω} is a π-net for ωω×ωω by (C).
Now, for each Lb there are nonempty U0,U1∈τ such that
Lb⊇U0×U1 because
Lb is nonempty and open in ⟨ωω,τ⟩×⟨ωω,τ⟩.
Then there are a0,a1∈<ωω such that
U0⊇Sa0 and
U1⊇Sa1 because
{Sa:a∈<ωω} is a π-base for ⟨ωω,τ⟩ by Remark 4. Therefore
Lb⊇Sa0×Sa1,
so the interior of Lb in ωω×ωω contains
Sa0×Sa1, which in not empty.
∎
This lemma says that for each candidate L,
there exists a strategy σ
that possesses the following property:
(★)
For each c=⟨c0,c1⟩∈<ωω×<ωω,
there is b∈<ωω such that
➢
Sc0×Sc1⊇Lb⊇Sσ0(c)×Sσ1(c) and
➢
\operatorname{\mathsf{shoot}}_{{L}}({b}{\upharpoonright}{k})\>\not\mathop{\dot{\in}}\>\big{(}\mathbf{S}_{\sigma^{0}({c})}{\uparrow}\times\mathbf{S}_{\sigma^{1}({c})}\big{)}\cup\big{(}\mathbf{S}_{\sigma^{0}({c})}\times(\mathbf{S}_{\sigma^{1}({c})}{\uparrow})\big{)}\quad
for all k<length(b).
Suppose that L is a candidate; we must find a pair σ=⟨σ0,σ1⟩ of
functions σ0,σ1:<ωω×<ωω→<ωω such that (★) holds.
Let c=⟨c0,c1⟩∈<ωω×<ωω.
The set Sc0×Sc1 is nonempty and open in the space ωω×ωω,
so there is bc∈<ωω such that
Lbc⊆Sc0×Sc1
because {Lb:b∈<ωω} is a π-net for ωω×ωω.
Then there are
ac0,ac1∈<ωω
such that
Sac0×Sac1⊆Lbc
because Lbc has nonempty interior in ωω×ωω and
{Sa:a∈<ωω} is a base for ωω. For each n∈ω, put
To prove (D), suppose on the contrary that n<m and there is
p=⟨p0,p1⟩∈Rc,n∩Rc,m. We may assume without loss of generality that
p∈Sac0⌢n↑×Sac1⌢n,
so that p0∈Sac0⌢n↑
and p1∈Sac1⌢n.
Since Sac1⌢n∩Sac1⌢m=∅ (because n=m),
we have p1\ninSac1⌢m,
so p\ninSac0⌢m↑×Sac1⌢m.
Then p∈Sac0⌢m×(Sac1⌢m↑)
because p∈Rc,m,
therefore
p1∈Sac1⌢m↑.
This contradicts Remark 8,
which says that
Sac1⌢n∩(Sac1⌢m↑)=∅,
so (D) is proved.
Now, for each k<length(bc),
there is at most one n∈ω such that
shootL(bc↾k)∈˙Rc,n —
this follows from (D) and (4) of Remark 11.
Then there is some nc∈ω such that, for all k<length(bc),
[TABLE]
Also we have
[TABLE]
so σ0(c):−ac0⌢nc and
σ1(c):−ac1⌢nc define a strategy σ that we search.
∎
This lemma says that for each game Γ, there are sets M0,M1∈[ω]ω and functions g0:M0→ω,g1:M1→ω that possess the following property:
(◆)
For each candidate L
and each a∈<ωω,
➢
if game Γ follows strategy σL and
La∋⟨res0(Γ),res1(Γ)⟩,
➢
then
shootL(a)∈˙Sres0(Γ)(M0,g0)×Sres1(Γ)(M1,g1).
Suppose that \Gamma=\big{\langle}\langle{c}_{{n}}\rangle_{{n}\in\omega},\langle{d}_{{n}}\rangle_{{n}\in\omega}\big{\rangle} is a game. Put r0:−res0(Γ)∈ωω and
r1:−res1(Γ)∈ωω.
Here are sets and functions that we must find:
✎
M0:−{length(c2k+10)−1:k∈ω};
✎
M1:−{length(c2k+21)−1:k∈ω};
✎
g0 is the function from M0 to ω such that g0(m)=r0(m)+1 for all
m∈M0;
✎
g1 is the function from M1 to ω such that g1(m)=r1(m)+1 for all
m∈M1.
We must show that (◆) holds.
Suppose that L is a candidate, a∈<ωω, game Γ follows strategy σL, and
La∋⟨r0,r1⟩;
we must prove that shootL(a)∈˙Sr0(M0,g0)×Sr1(M1,g1).
Suppose on the contrary that
(E1)
shootL(a)∈˙Sr0(M0,g0)×Sr1(M1,g1).
Let b−1:−⟨⟩∈<ωω.
Recall that dni=σLi(cn) for all n∈ω and i∈2 because game Γ follows strategy σL.
If n∈ω, then, by definition of σL (see Notaiton 21),
for cn=⟨cn0,cn1⟩∈<ωω×<ωω,
there is bn∈<ωω such that
(E2)
Scn0×Scn1⊇Lbn⊇Sdn0×Sdn1 and
(E3)
\operatorname{\mathsf{shoot}}_{{L}}({b}_{{n}}{\upharpoonright}{k})\>\not\mathop{\dot{\in}}\>\big{(}\mathbf{S}_{{d}^{0}_{{n}}}{\uparrow}\times\mathbf{S}_{{d}^{1}_{{n}}}\big{)}\cup\big{(}\mathbf{S}_{{d}^{0}_{{n}}}\times(\mathbf{S}_{{d}^{1}_{{n}}}{\uparrow})\big{)}\quad
for all k<length(bn).
We have Lbn⊃Lbn+1 and
Lbn∋⟨r0,r1⟩ for all n∈ω
by (E2) and (1) of Remark 16.
Then bn⊏bn+1 for all n∈ω
by (2) of Remark 3.
Also we have La∋⟨r0,r1⟩ by the choice of a,
so La∩Lbn=∅,
and hence a⊒bn or a⊑bn for all n∈ω
by (3) of Remark 3.
Therefore there is n˙∈ω such that bn˙−1⊑a⊏bn˙.
Let c−10:−c−11:−⟨⟩∈<ωω.
We have shootL(a)∈˙La by (1) of Remark 11,
La⊆Lbn˙−1 by the choice of n˙ and (2) of Remark 3, and
Lbn˙−1⊆Scn˙−10×Scn˙−11
by (E2) (and because Lb−1=ωω×ωω=Sc−10×Sc−11
by (L2) of Definition 2), so shootL(a)∈˙Scn˙−10×Scn˙−11
by (2) of Remark 11.
Therefore
[TABLE]
by (E1) and (3) of Remark 11, and then using (2) of Remark 11 we get
[TABLE]
Let
✎
T0:−Sr0(M0,g0)∩Scn˙−10 and
✎
T1:−Sr1(M1,g1)∩Scn˙−11,
so that
(E4)
shootL(a)∈˙T0×T1.
Next we show the following:
(E50)
if n˙ is even, then
T0⊆Sdn˙0 and
(E51)
if n˙ is odd, then
T1⊆Sdn˙1.
To prove (E50), assume that n˙ is even and q∈T0.
Recall that
Sr0(M0,g0)={r0}∪⋃m∈M0Sp0↾mg0(m).
If q=r0, then q∈Sdn˙0
by (1) of Remark 16.
If q=r0, then there is m˙∈M0 such that
q∈Sr0↾m˙g0(m˙),
so
(E60)
q∈Sr0↾m˙r0(m˙)+1
by the choice of g0.
Since m˙∈M0, there is k˙∈ω such that
(E70)
m˙=length(c2k˙+10)−1.
We have
q\ninSr0↾(m˙+1)
by (E60) and (1) of Remark 13, so
q\ninSr0↾length(c2k˙+10)=Sc2k˙+10 by (E70) and (2) of Remark 16.
On the other hand, q∈Scn˙−10
by definition of T0, therefore
Sc2k˙+10⊉Scn˙−10,
hence
c2k˙+10\nsqsubseteqcn˙−10 by (2) of Remark 3,
so 2k˙+1n˙−1 by (5) of Remark 16,
that is, 2k˙+1>n˙−1.
Then 2k˙⩾n˙−1
and also 2k˙=n˙−1 because n˙ is even, so we get
(E80)
2k˙⩾n˙.
Now, q∈Sr0↾m˙r0(m˙)+1 by (E60),
Sr0↾m˙r0(m˙)+1⊆Sr0↾m˙
by (1) of Remark 13,
Sr0↾m˙=Sr0↾(length(c2k˙+10)−1)
by (E70),
Sr0↾(length(c2k˙+10)−1)⊆Sr0↾length(d2k˙0)
by (4) of Remark 16 and (2) of Remark 3,
Sr0↾length(d2k˙0)=Sd2k˙0
by (3) of Remark 16, and
Sd2k˙0⊆Sdn˙0
by (E80), (6) of Remark 16, and (2) of Remark 3.
Therefore q∈Sdn˙0, which proves (E50).
The proof of (E51) is similar: Assume that n˙ is odd and q∈T1.Sr1(M1,g1)={r1}∪⋃m∈M1Sp1↾mg1(m).
If q=r1, then q∈Sdn˙1.
If q=r1, then there is m˙∈M1 such that
q∈Sr1↾m˙g1(m˙),
so
(E61)
q∈Sr1↾m˙r1(m˙)+1.
Since m˙∈M1, there is k˙∈ω such that
(E71)
m˙=length(c2k˙+21)−1.
We have
q\ninSr1↾(m˙+1)=Sr1↾length(c2k˙+21)=Sc2k˙+21.
On the other hand, q∈Scn˙−11,
therefore
Sc2k˙+21⊉Scn˙−11,
hence
c2k˙+21\nsqsubseteqcn˙−11,
so 2k˙+2n˙−1,
that is, 2k˙+2>n˙−1.
Then 2k˙+1⩾n˙−1
and also 2k˙+1=n˙−1 because n˙ is odd, so we get
(E81)
2k˙+1⩾n˙.
By the same argument as above, we can write
[TABLE]
This proves (E51).
Now, (E50) and (E51) imply
(E5)
T0⊆Sdn˙0orT1⊆Sdn˙1.
Also, for each i∈2, we have
Ti⊆Sri(Mi,gi)
by definition of Ti,Sri(Mi,gi)⊆ri\downfilledspoon
by (2) of Remark 13, and
ri\downfilledspoon⊆Sdn˙i↑
(because ri∈Sdn˙i
by (1) of Remark 16), so
(E9)
T0⊆Sdn˙0↑andT1⊆Sdn˙1↑.
It follows from (E5) and (E9) that
T0×T1⊆Sdn˙0×(Sdn˙1↑) or
T0×T1⊆Sdn˙0↑×Sdn˙1,
so
But also, since a⊏bn˙ by the choice of n˙,
there is k<length(bn˙) such that
a=bn˙↾k. Then
shootL(a)=shootL(bn˙↾k)
and we have a contradiction with (E3), which says
[TABLE]
∎
Bibliography6
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Patrakeev, Metrizable images of the Sorgenfrey line , Topology Proc. 45 (2015), 253–269.
2[2] M. Patrakeev, The complement of a σ 𝜎 \hskip 1.0pt\sigma -compact subset of a space with a π 𝜋 \hskip 1.0pt\pi -tree also has a π 𝜋 \hskip 1.0pt\pi -tree , Topology Appl. 221 (2017), 326–351, http://dx.doi.org/10.1016/j.topol.2017.02.060 .
3[3] M. Patrakeev, When the property of having a π 𝜋 \pi -tree is preserved by products , Topology Proc. 53 (2019), 73–95.
4[4] K. P. Hart, J. Nagata, and J. E. Vaughan, eds., Encyclopedia of general topology , Elsevier, Amsterdam, 2004.
5[5] K. Kunen, Set Theory , North-Holland, 1980.
6[6] A. S. Kechris, Classical descriptive set theory , Graduate Texts in Mathematics, vol. 156, Springer, 1994.