Borel sets without perfectly many
overlapping translations IV
Andrzej Rosłanowski
Department of Mathematics
University of Nebraska at Omaha
Omaha, NE 68182-0243, USA
[email protected]
and
Saharon Shelah
Institute of Mathematics
The Hebrew University of Jerusalem
91904 Jerusalem, Israel
and Department of Mathematics
Rutgers University
New Brunswick, NJ 08854, USA
[email protected]
http://shelah.logic.at
Abstract.
We show that, consistently, there exists a Borel set B⊆ω2
admitting a sequence ⟨ηα:α<λ⟩ of distinct
elements of ω2 such that (ηα+B)∩(ηβ+B) is
uncountable for all α,β<λ but with no perfect set P such
that ∣(η+B)∩(ν+B)∣≥6 for any distinct η,ν∈P.
This answers two questions from our previous works, [4, Problem
5.1], [6, Problem 7.6].
Key words and phrases:
Σ20 sets, Cantor space, splitting rank,
non-disjointness rank, pots sets, npots sets, forcing
2020 Mathematics Subject Classification:
Primary 03E35; Secondary 03E15, 03E50
Publication 1240 of the second author. Research partially supported
by the Israel Science Foundation (ISF) grant no: 1838/19
Both authors are grateful to an individual who prefers to remain anonymous
for providing typing services that were used during the work on the paper.
1. Introduction
In the series of articles [4, 5, 6] we
investigated the existence of Borel sets with many, but not too many pairwise
non-disjoint translations. For instance, in [5], for a
countable ordinal ε<ω1 and an integer 2≤ι<ω we
constructed a Σ20 set B⊆ω2 with the following
property.
In some ccc forcing notion there is a sequence
⟨ρα:α<ℵε⟩ of distinct elements of
ω2 such that
[TABLE]
*but in no extension there is a perfect set of such ρ’s. *
Similar resuts for the general case of perfect Abelian Polish groups were
presented in [6]. However, in all those cases when discussing
nonempty intersections we considered finite intersections only. It seemed
that our arguments really needed a finite enumeration of “witnesses for
nondisjointness”. So in [4, Problem 5.1] and [6, Problem
7.6] we asked if there is a ccc forcing notion P adding a
Σ20 subset B of the Cantor space ω2 such that
for some H⊆ω2 of size λ, the intersections
(B+h)∩(B+h′) are infinite (uncountable, respectively) for all
h,h′∈H, but for every perfect set P⊆ω2 there are
x,x′∈P with the intersection (B+x)∩(B+x′) finite (countable,
respectively).
In the present paper we answer the above two questions positively. Our
forcing construction slightly generalizes and simplifies that of
[4, 5]. This allows us to show a stronger result:
If λ<λω1 then some ccc forcing notion adds a
Σ20 set B which has λ translations with pairwise
uncountable intersections, while for every perfect set P⊆ω2
there are x,x′∈P with ∣(B+x)∩(B+x′)∣<6.
The article is organized as follows. First, in Section 2, we recall the
splitting rank from Shelah [7]. This rank was fundamental for the
question of no perfect squares and it is fundamental for problems of
nondisjoint translations as well. Then, in the third section we introduce
nice indexed bases Oˉ and we define when translations of a
Σ20 set have Oˉ–large intersection. This allows us to put
in the same framework sets with finite, infinite and uncountable
intersections. We also analyze when a Σ20 set may have a perfect
set of translations with Oˉ–large intersections and we introduce a
non-disjointness rank on finite approximations. Our main consistency theorem
is presented in the fourth section. In the final part of the paper we
summarize our results and pose a few relevant problems.
Notation: Our notation is standard and
compatible with that of classical textbooks (like Jech [2] or
Bartoszyński and Judah [1]). However, in forcing we keep the
older convention that a stronger condition is the larger one.
- (1)
For a set u we let u⟨2⟩={(x,y)∈u×u:x=y}.
2. (2)
The Cantor space ω2 of all infinite sequences with values 0 and 1
is equipped with the natural product topology and the group operation of
coordinate-wise addition + modulo 2.
3. (3)
Ordinal numbers will be denoted be the lower case initial letters of
the Greek alphabet α,β,γ,δ,ε,ζ as well as
ξ. Finite ordinals (non-negative integers) will be denoted by letters
a,b,c,d,i,j,k,ℓ,m,n,M and ι.
4. (4)
The Greek letters κ,λ will stand for uncountable
cardinals.
5. (5)
For a forcing notion P, all P–names for objects in
the extension via P will be denoted with a tilde below (e.g.,
τ
~
,
X
~
), and \mathchoice{\oalign{\displaystyle G\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle G\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\mathbb{P}} will stand for the
canonical P–name for the generic filter in P.
We fully utilize the algebraic properties of (ω2,+), in particular the fact
that all elements of ω2 are self-inverse.
2. The splitting rank
In this section we remind some basic facts from [7, Section 1]
concerning a rank (on models with countable vocabulary) which will be used
in the construction of a forcing notion in the fourth section. This rank and
relevant proofs were also presented in [4, Section 2].
Let λ be a cardinal and M be a model with the universe
λ and a countable vocabulary τ.
Definition 2.1**.**
- (1)
By induction on ordinals δ, for finite non-empty sets
w⊆λ we define when rk(w,M)≥δ. Let
w={α0,…,αn}⊆λ, ∣w∣=n+1.
- (a)
rk(w)≥0 if and only if for every quantifier free formula
φ∈L(τ) and each k≤n, if
M⊨φ[α0,…,αk,…,αn] then the set
[TABLE]
is
uncountable;
2. (b)
if δ is limit, then rk(w,M)≥δ if and only if
rk(w,M)≥γ for all γ<δ;
3. (c)
rk(w,M)≥δ+1 if and only if for every quantifier
free formula φ∈L(τ) and each k≤n, if M⊨φ[α0,…,αk,…,αn] then there is
α∗∈λ∖w such that
[TABLE]
2. (2)
The rank rk(w,M) of a finite non-empty set
w⊆λ is defined by:
rk(w,M)=−1 if ¬(rk(w,M)≥0), and
rk(w,M)=∞ if rk(w,M)≥δ for all ordinals
δ, and
for an ordinal δ: rk(w,M)=δ if rk(w,M)≥δ but ¬(rk(w,M)≥δ+1).
Definition 2.2**.**
For an ordinal ε and a cardinal λ let NPrε(λ) be the following statement: “there is a model
M∗ with the universe λ and a countable vocabulary τ∗
such that sup{rk(w,M∗):∅=w∈[λ]<ω}<ε.”
Prε(λ) is the negation of NPrε(λ).
Observation 2.3**.**
If λ is uncountable and NPrε(λ), then
there is a model M∗ with the universe λ and a countable
vocabulary τ∗ such that
rk({α},M∗)≥0* for all α∈λ and*
rk(w,M∗)<ε* for every finite non-empty set w⊆λ.*
Proposition 2.4** **(See [7, Claim 1.7] and/or [4, Proposition
2.6]).
- (1)
NPr1(ω1).
2. (2)
If NPrε(λ), then NPrε+1(λ+).
3. (3)
If NPrε(μ) for μ<λ and
cf(λ)=ω, then NPrε+1(λ).
Proposition 2.5** (See [7, Conclusion 1.8] and/or [4, Proposition 2.7]).**
Assume β<α<ω1, M is a model with a countable
vocabulary τ and the universe μ, m,n<ω, n>0, A⊆μ and ∣A∣≥ℶω⋅α. Then there is w⊆A
with ∣w∣=n and rk(w,M)≥ω⋅β+m 111“
⋅ ” stands for the ordinal multiplication.
Definition 2.6**.**
Let λω1 be the smallest cardinal λ such that Prω1(λ).
Corollary 2.7**.**
- (1)
If α<ω1, then NPrω1(ℵα).
2. (2)
Prω1(ℶω1)* holds true.*
3. (3)
ℵω1≤λω1≤ℶω1.
Corollary 2.8** (See [4, Proposition 2.10 and Corollary 2.11]).**
Let μ=ℶω1≤κ. If P is a ccc forcing
notion, then ⊩PPrω1(μ). In particular,
if Cκ be the forcing notion adding κ Cohen reals,
then ⊩Cκλω1≤μ≤c.
3. Spectrum of translation non-disjointness
We want to analyze sets with many non-disjoint translations in more detail,
restricting ourselves to Σ20 subsets of ω2. In this section we
will keep the following assumptions.
Assumptions 3.1**.**
Let Tˉ=⟨Tn:n<ω⟩, where each Tn⊆ω>2 is a tree with no maximal nodes (for n<ω). Let
B=n<ω⋃lim(Tn).
Definition 3.2**.**
- (1)
Let L consist of all non-empty sets u⊆ω>2 such that
u⊆ℓ2 for some ℓ=ℓ(u)<ω.
2. (2)
A simple base is a (strict) partial order O=(O,≺)
such that O⊆L and for u,u′∈O:
- (a)
if u≺u′ then ℓ(u)<ℓ(u′) and u={η↾ℓ(u):η∈u′},
2. (b)
there is a v∈O such that u≺v,
3. (c)
if ρ∈ℓ(u)2 then u+ρ∈O, and if ρ∈ℓ(u′)2 and u≺u′ then u+ρ↾ℓ(u)≺u′+ρ.
3. (3)
Let (O,≺) be a simple base. An O–tower is a
≺–increasing sequence uˉ=⟨un:n<ω⟩⊆O (so un≺un+1 for all
n<ω). The cover of an O–tower uˉ is the set
{\mathcal{C}}(\bar{u})\stackrel{{\scriptstyle\rm def}}{{=}}\big{\{}\eta\in{}^{\omega}2:\big{(}\forall n<\omega\big{)}\big{(}\eta{\restriction}\ell(u_{n})\in u_{n}\big{)}\big{\}}.
4. (4)
An indexed base is a sequence Oˉ=⟨Oi:i<i∗⟩ where 0<i∗≤ω and each Oi is a simple base.
Definition 3.3**.**
Let Oˉ=⟨Oi:i<i∗⟩ be an indexed base.
- (1)
We say that two translations B+x and B+y of the
set222Remember Assumptions 3.1 B (for x,y∈ω2)
have Oˉ–large intersection if for some
⟨uˉi:i<i∗⟩ for every i<i∗ we have:
uˉi is an Oi–tower,
for some n1,n2<ω,
[TABLE]
C(uˉi)∩C(uˉj)=∅ whenever j<i∗, j=i.
In the above situation we may also say that (B+x)∩(B+y)* is
Oˉ–large.*
2. (2)
We say that B is perfectly orthogonal to Oˉ–small (or
a Oˉ–pots–set) if there is a perfect set P⊆ω2
such that the translations B+x, B+y have a Oˉ–large
intersection for all x,y∈P.
The set B is an Oˉ–npots–set if it is not
Oˉ–pots.
3. (3)
We say that B has λ* many pairwise
Oˉ–nondisjoint translations* if for some set
X⊆ω2 of cardinality λ, for all x,y∈X the
translations B+x, B+y have a Oˉ–large intersection.
4. (4)
We define the spectrum of translation
Oˉ–nondisjointness of B as
[TABLE]
Example 3.4**.**
- (1)
Let 3≤ι≤ω. Put O0={u∈L:∣u∣=1} and let
a relation ≺0 be defined by:
u≺0v if and only if ℓ(u)<ℓ(v) ∧ u={η↾ℓ(u):η∈v}.
Then (O0,≺0) is a simple base and Oˉι=⟨O0:i<ι⟩ is an indexed base. Two translations
B+x and B+y of the set B (for x,y∈ω2) have
Oˉι–large intersection if and only if (B+x)∩(B+y)
has at least ι members.
2. (2)
Let Oper={u∈L:∣u∣≥3} and let a relation
≺per be defined by
u≺perv if and only if
u={η↾ℓ(u):η∈v} ∧ (∀ν∈u)(∣{η∈v:ν⊲η}∣≥2).
Then (Oper,≺per) is a simple base and Oˉper=⟨Oper⟩ is an indexed base. Two translations B+x and
B+y of the set B (for x,y∈ω2) have Oˉper–large
intersection if and only if (B+x)∩(B+y) is uncountable.
Proposition 3.5**.**
Let Oˉ be an indexed base and let Tˉ,B be as in Assumptions
3.1.
- (1)
The set B is a Oˉ–pots–set if and only if there
is a perfect set P⊆ω2 such that P×P⊆stndOˉ(B).
2. (2)
The set stndOˉ(B) is Σ11.
3. (3)
Let c<λ≤μ and let Cμ be the forcing notion
adding μ Cohen reals. Then, remembering Definition 3.3(2),
[TABLE]
4. (4)
Assume Prω1(λ). If B has λ many
pairwise Oˉ–nondisjoint translations, then it is an Oˉ–pots–set.
Proof.
(1,2) Straightforward; in evaluation of the complexity of
stndOˉ(B) note that for Oi–towers uˉi=⟨uni:n<ω⟩, x∈ω2 and k<ω:
C(uˉi)⊆lim(Tk)+x if and only if (∀n<ω)(uni⊆Tk+x), and
C(uˉi1)∩C(uˉi2)=∅ if and only if
(∃ℓ<ω)(∀n1,n2>ℓ)(un1i1↾ℓ∩un2i2↾ℓ=∅).
(3) This is a consequence of (1,2) above and Shelah
[7, Fact 1.16].
(4) By [7, Claim 1.12(1)].
∎
To carry out our arguments we need to assume that our indexed base Oˉ
satisfies some additional properties.
Definition 3.6**.**
An indexed base Oˉ=⟨Oi:i<i∗⟩ is nice
if it satisfies the following demands (i)–(v).
- (i)
Either i∗≥6 or for some i<i∗ we
have
[TABLE]
2. (ii)
If i<i∗, u≺iv≺iv′≺iv′′, and ℓ(v)≤ℓ≤ℓ(v′), then {η↾ℓ:η∈v′}∈Oi and
u≺i{η↾ℓ:η∈v′}≺iv′′.
3. (iii)
If i<i∗, u≺iv, ℓ(v)<ℓ and v′⊆ℓ2 is such that for each ν∈v the set {η∈v′:ν⊲η} has exactly one element, then v′∈Oi and u≺iv′.
4. (iv)
Suppose u≺iv and u′⊆u is such that
u′∈Oi. Let v′={η∈v:η↾ℓ(u)∈u′}. Then
v′∈Oi and u′≺iv′.
5. (v)
If i∗=ω, then for each i<i∗ there are infinitely many
j<i∗ such that Oi=Oj.
Observation 3.7**.**
The indexed bases Oˉι and Oˉper introduced in
Example 3.4 are nice.
Proposition 3.8**.**
Suppose an indexed base Oˉ=⟨Oi:i<i∗⟩ is
nice. Then:
- (⊛)
If 2≤K<ω and uˉk (for k<K) is an Oi(k)–tower for some i(k)<i∗, then there are
Oi(k)–towers vˉk=⟨vnk:n<ω⟩ (for
k<K) such that
C(vˉk)=C(uˉk), v0k=u0k and
k∈K⋂{ℓ(vnk):n<ω}* is infinite.*
Proof.
Induction on K. For K=2 we proceed as follows. Let uˉ0 be an
Oi(0)–tower and uˉ1 be an Oi(1)–tower. Choose
inductively a sequence ⟨nk:k<ω⟩ so that
5<n0<n1<n2<n3<…,
ℓ(u51)<ℓ(un00),
if ℓ(uj1)≤ℓ(unk0)<ℓ(nj+11), then
ℓ(nj+51)≤ℓ(nk+10).
For k<ω let j(k) be such that ℓ(uj(k)1)≤ℓ(unk0)<ℓ(nj(k)+11). Put vk={η↾ℓ(unk0):η∈uj(k)+11}. By 3.6(ii), vk∈Oi(1) and uj(k)−11≺i(1)vk≺i(1)uj(k)+21. The rest should be clear.
∎
For the rest of this section we will be assuming the following.
Assumptions 3.9**.**
- (1)
Tˉ=⟨Tn:n<ω⟩, B are as in Assumptions
3.1,
2. (2)
Oˉ=⟨Oi:i<i∗⟩ is a nice indexed base. Also,
Oi=(Oi,≺i),
3. (3)
there are distinct x,y∈ω2 such that (B+x)∩(B+y) is
Oˉ–large.
Definition 3.10**.**
Let MTˉ,Oˉ consist of all tuples
[TABLE]
such that:
- (a)
0<ℓ<ω, u⊆ℓ2 and 2≤∣u∣, and
ι=i∗ if i∗<ω, and 3≤ι<ω otherwise;
2. (b)
gˉ=⟨gi:i<ι⟩, where333remember
u⟨2⟩={(η,ν)∈u×u:η=ν}
gi:u⟨2⟩⟶Oi is such that
gi(η,ν)=gi(ν,η) and \ell\big{(}g_{i}(\eta,\nu)\big{)}=\ell for
each (η,ν)∈u⟨2⟩;
3. (c)
if (η,ν)∈u⟨2⟩ and i<i′<ι,
then gi(η,ν)∩gi′(η,ν)=∅,
4. (d)
hˉ=⟨hi:i<ι⟩, where hi:u⟨2⟩⟶ω;
5. (e)
for each (η,ν)∈u⟨2⟩, if σ∈gi(η,ν) then η+σ∈Thi(η,ν).
Definition 3.11**.**
Assume m=(ℓ,ι,u,hˉ,gˉ)∈MTˉ,Oˉ and ρ∈ℓ2. We define m+ρ=(ℓ′,ι′,u′,hˉ′,gˉ′) by
ℓ′=ℓ, ι′=ι, u′={η+ρ:η∈u},
gˉ′=⟨gi′:i<ι′⟩, where gi′:(u′)⟨2⟩⟶Oi:(η+ρ,ν+ρ)↦gi(η,ν)+ρ,
hˉ′=⟨hi′:i<ι′⟩, where hi′:(u′)⟨2⟩⟶ω are such that hi′(η+ρ,ν+ρ)=hi(η,ν) for (η,ν)∈u⟨2⟩.
Also if ρ∈ω2, then we set m+ρ=m+(ρ↾ℓ).
Observation 3.12**.**
- (1)
If m∈MTˉ,Oˉ and ρ∈ℓm2, then m+ρ∈MTˉ,Oˉ.
2. (2)
For each ρ∈ω2 the mapping MTˉ,Oˉ⟶MTˉ,Oˉ:m↦m+ρ is a bijection.
Definition 3.13**.**
Assume m,n∈MTˉ,Oˉ. We say that n* strictly extends m*
(m⊏n in short) if and only if:
ℓm<ℓn, ιm≤ιn,
um={η↾ℓm:η∈un}, and
for every (η,ν)∈(un)⟨2⟩ such that
η↾ℓm=ν↾ℓm and each i<ιm we have
gim(η↾ℓm,ν↾ℓm)≺gin(η,ν), and
him(η↾ℓm,ν↾ℓm)=hin(η,ν).
Definition 3.14**.**
- (1)
By induction on ordinals α we define
DTˉ(α)⊆MTˉ,Oˉ. We declare that:
DTˉ(0)=MTˉ,Oˉ,
if α is a limit ordinal, then DTˉ(α)=β<α⋂DTˉ(β),
if α=β+1, then DTˉ(α) consists of all
m∈MTˉ,Oˉ such that for each for each ν∈um there is an n∈MTˉ,Oˉ satisfying
m⊏n and n∈DTˉ(β), and if
i∗=ω then ιm<ιn, and
the set {η∈un:ν⊲η} has at least two elements
2. (2)
We define a function444ndrk stands for nondisjointness rank ndrkOˉTˉ=ndrk:MTˉ,Oˉ⟶ON∪{∞} as follows.
If m∈DTˉ(α) for all ordinals α, then
we say that ndrk(m)=∞.
Otherwise, ndrk(m) is the first ordinal α for which
m∈/DTˉ(α+1).
3. (3)
We also define
[TABLE]
Lemma 3.15**.**
- (1)
The relation ⊏ is a strict partial order on MTˉ,Oˉ.
2. (2)
If m,n∈MTˉ,Oˉ and m⊏n and n∈DTˉ(α), then m∈DTˉ(α).
3. (3)
If α<β then DTˉ(β)⊆DTˉ(α). Hence for m∈MTˉ,Oˉ, m∈DTˉ(α)
if and only if α≤ndrk(m).
4. (4)
If m∈MTˉ,Oˉ and ρ∈ω2 then ndrk(m)=ndrk(m+ρ).
5. (5)
If m∈MTˉ,Oˉ and ndrk(m)≥ω1, then
there is an n∈MTˉ,Oˉ such that m⊏n, ∣{η∈un:ν⊲η}∣≥2 for each ν∈um, if i∗=ω then
ιm<ιn, and ndrk(n)≥ω1.
6. (6)
If m∈MTˉ,Oˉ and ∞>ndrk(m)=β>α, then there is
n∈MTˉ,Oˉ such that m⊏n and ndrk(n)=α.
7. (7)
If NDRK(Tˉ)≥ω1, then NDRK(Tˉ)=∞.
8. (8)
Assume m∈MTˉ,Oˉ and u′⊆um, ∣u′∣≥2. Put
ℓ′=ℓm, ι′=ιm, and for i<ι′ let
hi′=him↾(u′)⟨2⟩ and gi′=gim↾(u′)⟨2⟩. Let m↾u′=(ℓ′,u′,i′,hˉ′,gˉ′). Then m↾u′∈MTˉ,Oˉ and
ndrk(m)≤ndrk(m↾u′).
Proof.
Exactly the same as for [4, Lemma 3.10].
∎
Proposition 3.16**.**
For a nice indexed base Oˉ the following conditions (a) – (d)
are equivalent.
- (a)
NDRKOˉ(Tˉ)≥ω1.
2. (b)
NDRKOˉ(Tˉ)=∞.
3. (c)
B* is perfectly orthogonal to Oˉ–small (see 3.3(2)).*
4. (d)
In some ccc forcing extension, the set B has
λω1 many pairwise Oˉ–nondisjoint translations
(see 3.3(3)).
Proof.
The proof follows closely the lines of [4, Proposition 3.11].
(c)⇒(d) Assume (c) and let
P⊆ω2 be a perfect set such that the translations B+x, B+y
have Oˉ–large intersection for all x,y∈P. Let
κ=ℶω1. By Corollary 2.8,
⊩Cκλω1≤c. By Proposition
3.5(2), the formula “P×P⊆stndOˉ(B)” is Π21, so it holds in the forcing extension by
Cκ. Now we easily conclude (d).
(d)⇒(a) Assume (d) and let P
be the ccc forcing notion witnessing this assumption, G⊆P be
generic over V. Let us work in V[G].
Let ⟨ηα:α<λω1⟩ be
a sequence of distinct elements of ω2 such that
[TABLE]
Remember Definition 3.2(3): an Oi–tower is an
≺i–increasing sequence uˉ=⟨un:n<ω⟩ and its
cover C(uˉ) is the set {η∈ω2:(∀n<ω)(η↾ℓ(un)∈un)}.
Let τ={Rm:m∈MTˉ,Oˉ} be a vocabulary where each Rm is a
∣um∣–ary relational symbol. Let {\mathbb{M}}=\big{(}\lambda_{\omega_{1}},\big{\{}R^{\mathbb{M}}_{\mathbf{m}}\big{\}}_{{\mathbf{m}}\in{{\mathbf{M}}_{\bar{T},\bar{{\mathcal{O}}}}}}\big{)} be the model in the vocabulary
τ, where for m=(ℓ,ι,u,h,g)∈MTˉ,Oˉ the relation RmM is
defined by
[TABLE]
Claim 3.16.1**.**
- (1)
If α0,α1,…,αj−1<λω1 are
distinct, j≥2, then for infinitely many k<ω there is
m∈MTˉ,Oˉ such that
[TABLE]
2. (2)
Assume that m∈MTˉ,Oˉ, j<∣um∣,
α0,α1,…,α∣um∣−1<λω1 and
α∗<λω1 are all pairwise distinct and such that
M⊨Rm[α0,…,αj,…,α∣um∣−1]* and*
M⊨Rm[α0,…,αj−1,α∗,αj+1,…α∣um∣−1].
Then for infinitely many
k<ω there is an n∈MTˉ,Oˉ such that m⊏n
and ℓn=k, un={ηα0↾k,…,ηα∣um∣−1↾k,ηα∗↾k} and M⊨Rn[α0,…,α∣um∣−1,α∗], and if i∗=ω
then also ιm<ιn.
3. (3)
If m∈MTˉ,Oˉ and M⊨Rm[α0,…,α∣um∣−1], then
[TABLE]
Proof of the Claim.
(1) It is a simpler version of the proof below.
(2) By the definition of RmM, since M⊨Rm[α0,…,αj−1,α∗,αj+1,…α∣um∣−1] and M⊨Rm[α0,…,αj,…,α∣um∣−1],
we may choose a sequence
[TABLE]
satisfying the following demands. Letting α∣um∣=α∗, for
(j_{1},j_{2})\in\big{(}|u^{\mathbf{m}}|+1\big{)}^{\langle 2\rangle} and i<ιm:
uˉi(j1,j2)=uˉi(j2,j1) is a Oi–tower,
if {j1,j2}={j,∣um∣}, then u0i(j1,j2)=gim(ηαj1↾ℓm,ηαj2↾ℓm),
if i1<i2<ιm, then {\mathcal{C}}\big{(}\bar{u}^{i_{1}}(j_{1},j_{2})\big{)}\cap{\mathcal{C}}\big{(}\bar{u}^{i_{2}}(j_{1},j_{2})\big{)}=\emptyset,
if {j1,j2}={j,∣um∣}, then
{\mathcal{C}}\big{(}\bar{u}^{i}(j_{1},j_{2})\big{)} is included in
[TABLE]
for some Ni′,Ni′′ we have
[TABLE]
Since Oˉ is nice (and ιm and um are finite), we
may use 3.8(⊛) and modify uˉi(j1,j2)
(without changing u0i(j1,j2)) and demand that the set
[TABLE]
is infinite. Let ℓ0∈A∖(ℓm+1) be bigger than the
second element of A∖(ℓm+1) and such that
ηα∣um∣↾ℓ0=ηαj↾ℓ0, and
x↾ℓ0=y↾ℓ0 whenever x∈C(uˉi1(j1,j2)),
y∈C(uˉi2(j1,j2)), (j_{1},j_{2})\in\big{(}|u^{\mathbf{m}}|+1\big{)}^{\langle 2\rangle} and i1<i2<ιm.
Let ι=ιm=i∗ if i∗<ω and let ι=ιm+1
otherwise. In the latter case we also have to choose
Oιm–towers uˉιm(j1,j2), but to ensure the
demand 3.10(c) we will have to modify the already chosen towers
uˉi(j1,j2) (for i<ιm). Fix (j_{1},j_{2})\in\big{(}|u^{\mathbf{m}}|+1\big{)}^{\langle 2\rangle} for a moment. Let
[TABLE]
By 3.6(v) and the assumptions on
⟨ηα:α<λω1⟩, there
are infinitely many Oιm–towers vˉk such that their
covers are pairwise disjoint and included in
\big{(}\lim(T_{k_{1}})+\eta_{\alpha_{j_{1}}}\big{)}\cap\big{(}\lim(T_{k_{2}})+\eta_{\alpha_{j_{2}}}\big{)} for some k1,k2.
Choose ℓ(j1,j2)∈A∖(ℓ0+1) so large, that there are
more than K+1 many k’s for which the sets {η↾ℓ(j1,j2):η∈vnk} are pairwise disjoint (for large n) and
ℓ(v5k)<ℓ(j1,j2) for all those k’s. For i<im let
n(i),m(i) be such that ℓ(un(i)i(j1,j2))=ℓ0 and
ℓ(um(i)i(j1,j2))=ℓ(j1,j2), and let vi⊆um(i)i(j1,j2) be such that for each ν∈un(i)i(j1,j2) the
set {η∈vi:ν⊲η} has exactly one element. By
3.6(iii) we have
[TABLE]
Using repeatedly 3.6(iv) we may modify the towers
uˉi(j1,j2) (for i<im) and demand that
for each i<ιm, for some n∗(i),
[TABLE]
Looking back at the towers vˉk, we may choose one,
vˉk∗=vˉ(j1,j2), which has the property that for all large
n
[TABLE]
Now unfix (j1,j2) and set ℓ=max{ℓ(j1,j2):(j1,j2)∈(∣um∣+1)⟨2⟩}.
Suppose j1<j2≤∣um∣ and let n be such
that ℓ(vn−1(j1,j2))<ℓ≤ℓ(vn(j1,j2)). By
3.6(ii), we may let
u0ιm(j1,j2)=u0ιm(j2,j1)={η↾ℓ:η∈vn(j1,j2)},
umιm(j1,j2)=umιm(j2,j1)=vn+m(j1,j2) for m>0,
getting a Oιm–tower uˉιm(j1,j2). We also
fix k(j1,j2),k(j2,j1) such that
[TABLE]
If i∗=ιm<ω, then the procedure leading to the choice of
uˉιm(j1,j2) is not present and we just let
ℓ=min(A∖(ℓ0+1)).
Let u=\big{\{}\eta_{\alpha_{0}}{\restriction}\ell,\ldots,\eta_{\alpha_{|u^{\mathbf{m}}|-1}}{\restriction}\ell,\eta_{\alpha^{*}}{\restriction}\ell\big{\}}.
For each i<ι and (j_{1},j_{2})\in\big{(}|u^{\mathbf{m}}|+1)^{\langle 2\rangle} put
gi(ηαj1↾ℓ,ηαj2↾ℓ)=uni(j1,j2), where n is such that \ell\big{(}u^{i}_{n}(j_{1},j_{2})\big{)}=\ell. This defines gi:u⟨2⟩⟶Oi for
i<ι. For (ν1,ν2)∈u⟨2⟩ we also set
[TABLE]
It should be clear that n=(ℓ,ι,u,g,h)∈MTˉ,Oˉ is as required.
(3) By induction on β we show that
for every
m∈MTˉ,Oˉ and all α0,…,α∣um∣−1<λω1 such that M⊨Rm[α0,…,α∣um∣−1]:
β≤rk({α0,…,α∣um∣−1},M) implies
β≤ndrk(m).
Steps β=0 and β is limit: Straightforward.
Step β=γ+1: Suppose m∈MTˉ,Oˉ and
α0,…,α∣um∣−1<λω1 are such that
M⊨Rm[α0,…,α∣um∣−1] and
γ+1≤rk({α0,…,α∣um∣−1},M). Let
ν∈um, so ν=ηαj↾ℓm for some j<∣um∣.
Since γ+1≤rk({α0,…,α∣um∣−1},M) we may
find α∗∈λω1∖{α0,…,α∣um∣−1} such that
[TABLE]
and rk({α0,…,α∣um∣−1,α∗},M)≥γ. By clause (2) we may find n∈MTˉ,Oˉ such that m⊏n
and un={ηα0↾ℓn,…,ηα∣um∣−1↾ℓn,ηα∗↾ℓn}, and if i∗=ω then
ιm<ιn, and M⊨Rn[α0,…,α∣um∣−1,α∗]. Then also
∣{η∈un:ν⊲η}∣≥2. By the inductive hypothesis we have
also γ≤ndrk(n). Now we may easily conclude that γ+1≤ndrk(m).
∎
By the definition of λω1,
- (⊙)
sup{rk(w,M):∅=w∈[λω1]<ω}≥ω1
Now, suppose that β<ω1. By (⊙), there are distinct
α0,…,αj−1<λω1, j≥2, such that
rk({α0,…,αj−1},M)≥β. By Claim 3.16.1(1)
we may find m∈MTˉ,Oˉ such that M⊨Rm[α0,…,αj−1]. Then by Claim 3.16.1(3) we also
have ndrkOˉTˉ(m)≥β. Consequently,
NDRK(Tˉ)≥ω1.
All the considerations above where carried out in V[G]. However, the
rank function ndrkOˉTˉ is absolute, so we may also
claim that in V we have NDRKOˉ(Tˉ)≥ω1.
∎
4. The main result
In this section we construct a forcing notion adding a sequence Tˉ of
subtrees of ω>2 such that NDRKOˉ6(Tˉ)<ω1 and yet with many Oˉ–nondisjoint translations (for a
nice Oˉ). The sequence Tˉ will be added by finite
approximations, so we will need a finite version of Definition 3.10.
Definition 4.1**.**
Assume that
- (a)
0<n,M<ω, tˉ=⟨tm:m<M⟩, and each tm
is a subtree of n≥2 in which all terminal branches are of
length n,
2. (b)
Tj⊆ω>2 (for j<ω) are trees with no
maximal nodes, Tˉ=⟨Tj:j<ω⟩ and tm=Tm∩n≥2 for m<M,
3. (c)
MTˉ,Oˉ6 is defined as in Definition
3.10 for Oˉ6 introduced in Example 3.4(1).
We let Mtˉ,Oˉ6n consist of all tuples m=(ℓm,6,um,hˉm,gˉm)∈MTˉ,Oˉ6 such that
ℓm≤n and rng(him)⊆M for each i<6.
The extension relation ⊏ on Mtˉ,Oˉ6n is inherited from
MTˉ,Oˉ6 (see Definition 3.13).
Observation 4.2**.**
- (1)
The Definition of Mtˉ,Oˉ6n does not depend on the choice of Tˉ,
as long as the clause 4.1(c) is satisfied.
2. (2)
If m∈Mtˉ,Oˉ6n and ρ∈ℓm2, then m+ρ∈Mtˉ,Oˉ6n
(remember Definition 3.11).
Lemma 4.3** (See [3, Lemma 2.3].).**
Let 0<ℓ<ω and let B⊆ℓ2 be a linearly
independent set of vectors (in (ℓ2,+) over Z2).
If A⊆ℓ2, ∣A∣≥5 and A+A⊆B+B,
then for a unique x∈ℓ2 we have A+x⊆B.
Theorem 4.4**.**
Assume that an uncountable cardinal λ satisfies NPrω1(λ) and suppose that Oˉ=⟨Oi:i<i∗⟩ is a nice indexed base. Then there is a ccc forcing
notion P of size λ such that
[TABLE]
Proof.
Fix a countable vocabulary τ={Rn,ζ:n,ζ<ω}, where
Rn,ζ is an n–ary relational symbol (for n,ζ<ω). By
the assumption on λ, we may fix a model M=(λ,{Rn,ζM}n,ζ<ω) in the vocabulary τ with the
universe λ and an ordinal α∗<ω1 such that:
- (⊛)a
for every n and a quantifier free formula
φ(x0,…,xn−1)∈L(τ) there is ζ<ω such
that for all a0,…,an−1∈λ,
[TABLE]
2. (⊛)b
sup{rk(v,M):∅=v∈[λ]<ω}<α∗,
3. (⊛)c
the rank of every singleton is at least 0.
For a nonempty finite set v⊆λ let rk(v)=rk(v,M), and
let ζ(v)<ω and k(v)<∣v∣ be such that R∣v∣,ζ(v),k(v)
witness the rank of v. Thus letting {a0,…,ak,…an−1} be the
increasing enumeration of v and k=k(v) and ζ=ζ(v), we have
- (⊛)d
if rk(v)≥0, then M⊨Rn,ζ[a0,…,ak,…,an−1] but there is no a∈λ∖v such that
[TABLE]
2. (⊛)e
if rk(v)=−1, then M⊨Rn,ζ[a0,…,ak,…,an−1] but the set
[TABLE]
is countable.
Without loss of generality we may also require that (for ζ=ζ(v),
n=∣v∣)
- (⊛)f
for every b0,…,bn−1<λ
[TABLE]
Now we will define a forcing notion P. A condition p in
P is a tuple
[TABLE]
such that the following demands (∗)1–(∗)11 are satisfied.
- (∗)1
w∈[λ]<ω, ∣w∣≥5, 5≤n,M<ω, ι<ω and if i∗<ω then ι=i∗.
2. (∗)2
ηˉ=⟨ηα:α∈w⟩⊆n2.
3. (∗)3
tˉ=⟨tm:m<M⟩, where ∅=tm⊆n≥2 for m<M is a tree in which all terminal
branches are of length n and tm∩tm′∩n2=∅ for
m<m′<M.
4. (∗)4
rˉ=⟨rm:m<M⟩, where 0<rm≤n
for m<M.
5. (∗)5
hˉ=⟨hi:i<ι⟩, where hi:w⟨2⟩⟶M are such that hi(α,β)=hi(β,α).
6. (∗)6
gˉ=⟨gi:i<ι⟩, where gi:w⟨2⟩⟶Oi are such that
\ell\big{(}g_{i}(\alpha,\beta)\big{)}=n, gi(α,β)=gi(β,α)
and, for each (α,β)∈w⟨2⟩,
\big{|}\bigcup\limits_{i<\iota}g_{i}(\alpha,\beta)\big{|}\geq 6.
7. (∗)7
For each m<M,
[TABLE]
8. (∗)8
The family
[TABLE]
is a linearly independent set of vectors in n2 (over the field
Z2); in particular there are no repetitions in the representation
above and all elements are non-zero vectors.
9. (∗)9
M consists of all triples d=(ℓd,vd,md)=(ℓ,v,m) such that
- (∗)9a
0<ℓ≤n, v⊆w, 5≤∣v∣, and
ηα↾ℓ=ηβ↾ℓ for distinct α,β∈v,
2. (∗)9b
m∈Mtˉ,Oˉ6n, ℓm=ℓ, um={ηα↾ℓ:α∈v},
3. (∗)9c
for each (α,β)∈(v)⟨2⟩ and i<6 we have
rhim(ηα↾ℓ,ηβ↾ℓ)≤ℓd,
4. (∗)9d
\big{(}\forall(\alpha,\beta)\in v^{\langle 2\rangle}\big{)}\big{(}\forall i<6\big{)}\big{(}\exists j<\iota\big{)}\big{(}h^{\mathbf{m}}_{i}(\eta_{\alpha}{\restriction}\ell,\eta_{\beta}{\restriction}\ell)=h_{j}(\alpha,\beta)\big{)}.
10. (∗)10
If d0,d1∈M, ℓd0=ℓd1=ℓ,
ρ∈ℓ2, and md1=md0+ρ, then
rk(vd0)=rk(vd1), ζ(vd0)=ζ(vd1),
k(vd0)=k(vd0) and if α∈vd0, β∈vd1 are such that ∣α∩vd0∣=k(vd0)=k(vd1)=∣β∩vd1∣, then (ηα↾ℓ)+ρ=ηβ↾ℓ.
11. (∗)11
Suppose that
d0,d1∈M, md0⊏md1 and
vd0⊆vd1, and
α0∈vd0, ∣α0∩vd0∣=k(vd0),
rk(vd0)=−1.
Then ∣{ν∈umd1:(ηα0↾ℓd0)⊴ν}∣=1.
To define the order ≤ of P we declare for p,q∈P that
p≤q if and only if
wp⊆wq, np≤nq, Mp≤Mq, ιp≤ιq and
tmp=tmq∩np≥2 and rmp=rmq for all m<Mp,
and
ηαp⊴ηαq for all α∈wp,
and
hiq↾(wp)⟨2⟩=hip and gip(α,β)⪯igiq(α,β) for i<ιp and (α,β)∈(wp)⟨2⟩.
Claim 4.4.1**.**
- (1)
(P,≤)* is a partial order of size λ.*
2. (2)
For each β<λ and n0,M0<ω the set
[TABLE]
is open dense in P.
3. (3)
If i∗=ω, then for each ι<ω the set
Dι={p∈P:ιp≥ι} is open dense in P.
Proof of the Claim.
(1) First let us argue that P=∅. Let ι=i∗ if it
is finite, and ι=6 if i∗=ω. Let w={α0,α1,α2,α3,α4} be any 5 element subset of
λ. Using 3.2(2c)+3.6(ii) we may find
v(i,b) for i<ι and b<2 such that for some
ℓ<ω for all i<ι and b<2 we have
[TABLE]
By 3.6(i), we may also require that if i∗<6 then for some
i<ι we have ∣v(i,1)∣≥6. Fix an enumeration
[TABLE]
Choose n>ℓ+5 and a sequence ⟨ρa:a<A+5⟩⊆n2 so that
⟨ρa↾[ℓ,n):a<A+5⟩ is linearly independent in
[ℓ,n)2 over Z2, and
σa⊲ρa for each a<A.
Put
ηαb=ρA+b (for b<5) and ηˉ=⟨ηαb:b<5⟩,
g_{i}(\alpha_{j},\alpha_{k})=g_{i}(\alpha_{k},\alpha_{j})=\big{\{}\rho_{a}:a<A\ \wedge\ j=j_{a}\ \wedge\ k=k_{a}\ \wedge\ i_{a}=i\big{\}} (for i<ι and j<k<5) and
gˉ=⟨gi:i<ι⟩.
It follows from Definition 3.6(iii) that
gi(αj,αk)∈Oi.
We also let M=10⋅ι and we fix a bijection φ:[w]2×ι⟶M. Then for j<k<5 and i<ι we set
h_{i}(\alpha_{j},\alpha_{k})=h_{i}(\alpha_{k},\alpha_{j})=\varphi\big{(}\{\alpha_{j},\alpha_{k}\},i\big{)}. This way we defined
hˉ=⟨hi:i<ι⟩.
We put rm=n for m<M and we let tm⊆n≥2 be trees in
which all terminal branches are of length n and such that
[TABLE]
Finally, M is defined by clause (∗)9.
One easily verifies that (w,n,ι,M,ηˉ,tˉ,rˉ,hˉ,gˉ,M)∈P.
We see from the arguments above that ∣P∣≥λ and since there are
only countably many elements p of P with wp=w, we get
∣P∣=λ.
Clearly, ≤ is a partial order on P.
(2) Let p∈P, β∈λ∖wp.
We will define a condition q in a manner similar to the construction
in (1) above. Let α−=min(wp) and α+=max(wp).
Set wq=wp∪{β}, ιq=ιp.
For (α0,α1)∈(wq)⟨2⟩ and i<ιq
pick v(i,α0,α1)∈Oi so that: for some ℓ, for
all i<ιq and (α0,α1)∈(wq)⟨2⟩
we have
\ell\big{(}v(i,\alpha_{0},\alpha_{1})\big{)}=\ell,
if α0,α1∈wp then gip(α0,α1)≺iv(i,α0,α1)=v(i,α1,α0),
if α0∈wp then gip(α+,α−)≺iv(i,α0,β)=v(i,β,α0).
Fix an enumeration
[TABLE]
Choose n>ℓ+∣wp∣+1 and a sequence ⟨ρa:a≤A+∣wp∣⟩⊆n2 so that
⟨ρa↾[ℓ,n):a≤A+∣wp∣⟩ is linearly
independent in [ℓ,n)2 over Z2,
σa⊲ρa for each a<A, and
if α∈wp is such that ∣wp∩α∣=k then
ηαp⊲ρA+k.
Put
ηβq=ρA+∣wp∣, and if α∈wp is such that
∣wp∩α∣=k then ηαq=ρA+k and
ηˉq=⟨ηαq:α∈wq⟩,
g_{i}^{q}(\alpha_{0},\alpha_{1})=g_{i}^{q}(\alpha_{1},\alpha_{0})=\big{\{}\rho_{a}:a<A\ \wedge\ i=i^{a}\ \wedge\ \alpha_{0}=\alpha_{0}^{a}\ \wedge\ \alpha_{1}=\alpha^{a}_{1}\big{\}} (for i<ιq and
α0<α1 from wq) and gˉq=⟨giq:i<ιq⟩.
It follows from Definition 3.6(iii) that
giq(α0,α1)∈Oi and if (α0,α1)∈(wp)⟨2⟩ then gip(α0,α1)≺igiq(α0,α1).
We also let Mq=Mp+ιq⋅∣wp∣ and we define mappings
hiq:(wq)⟨2⟩⟶Mq so that:
if (α0,α1)∈(wp)⟨2⟩ and
i<ιq, then hiq(α0,α1)=hip(α0,α1),
if α∈wp and i<ιq, then
hiq(α,β)=hiq(β,α)=Mp+∣α∩wp∣⋅ι+i.
This way we defined hˉq=⟨hiq:i<ιq⟩.
We put rmq=rmp for m<Mp and rmq=n for Mp≤m<Mq. We
let tmq⊆n≥2 be trees in which all terminal branches
are of length n and such that
[TABLE]
[Note that by our definitions above and by clause (∗)7 for p we have
tmp∩np2=tmq∩np2 for all m<Mp.]
Naturally we also set nq=n and we define Mq by clause (∗)9.
We claim that q=\big{(}w^{q},n^{q},\iota^{q},M^{q},\bar{\eta}^{q},\bar{t}^{q},\bar{r}^{q},\bar{h}^{q},\bar{g}^{q},{\mathcal{M}}^{q}\big{)}\in{\mathbb{P}}. Demands (∗)1–(∗)9 are
pretty straightforward.
RE (∗)10 : To justify clause (∗)10, suppose
that d0,d1∈Mq, ℓd0=ℓd1=ℓ, ρ∈ℓ2 and m=md0=md1+ρ, and consider the following two
cases.
Case 1: β∈/vd0∪vd1
If ℓ≤np then rhim(ηα0↾ℓ,ηα1↾ℓ)≤np, so him(ηα0↾ℓ,ηα1↾ℓ)<Mp for all (\alpha_{0},\alpha_{1})\in\big{(}v^{{\mathfrak{d}}_{0}}\big{)}^{\langle 2\rangle}. Hence also d0,d1∈Mp and
clause (∗)10 for p applies. If ℓ>np then the sequence
⟨ηαq↾ℓ:α∈vd0∪vd1⟩ is linearly independent and
[TABLE]
Since ∣vd0∣≥5 we immediately conclude ρ=0, and
therefore also vd0=vd1 (remember ℓ>np).
Case 2: β∈vd0∪vd1
Say, β∈vd0. If α∈vd0∖{β}, then
hjq(α,β)≥Mp for all j<ι, and hence
rhim(ηα↾ℓ,ηβ↾ℓ)q=nq (remember
(∗)9d). Consequently, ℓ=nq. Since the sequence
⟨ηαq:α∈vd0∪vd1⟩ is
linearly independent, like before we get ρ=0 and
vd0=vd1.
RE (∗)11 : Assume towards contradiction that for
some d0,d1∈Mq we have:
v0d⊆v1d and without loss of generality
∣vd1∣=∣vd0∣+1,
α0∈vd0, ∣α0∩vd0∣=k(vd0),
rk(vd0)=−1, and md0⊏md1, and
there is α1∈vd1 such that ηα0q↾ℓd0=ηα1q↾ℓd0 but
ηα0q↾ℓd1=ηα1q↾ℓd1.
Let ℓ0=ℓd0, ℓ1=ℓd1.
Suppose β∈vd0 and take β′∈vd0∖{β}. Then hjq(β,β′)≥Mp for all j<ι. Hence, for
some j<ι,
[TABLE]
contradicting the last item in our assumptions.
If we had vd1=vd0∪{β}, then considering a β′∈vd0∖{α0} we will immediately arrive to
[TABLE]
a contradiction.
Therefore the only remaining possibility is that β∈/vd1.
If ℓ1≤np, then d0,d1∈Mp and clause (∗)11 for p
gives us a contradiction. So assume ℓ1>np. Since
{ηγq↾np:γ∈vd1} are all pairwise distinct,
we conclude ℓ0<np and md0∈Mp. We define n∈Mtˉ,Oˉ6n
by setting:
ℓn=np, un={ηγq↾np:γ∈vd1}={ηγp:γ∈vd1}, ιn=6,
and for (γ,γ′)∈(vd1)⟨2⟩ and i<6:
if {γ,γ′}={α0,α1}, then
[TABLE]
and hin(ηγp,ηγ′p)=himd1(ηγq↾ℓ1,ηγ′q↾ℓ1),
if {γ,γ′}={α0,α1}, then we fix
distinct σ0,…,σ5∈j<ιq⋃gjp(α0,α1) (remember (∗)6 for p), and we let
gin(ηα0p,ηα1p)=gin(ηα1p,ηα0p)={σi} and
hin(ηα0p,ηα1p)=hin(ηα1p,ηα0p)=m where ηα0p+σi,ηα1+σi∈tmp (for i<6).
Since md0⊏md1, in the case when {γ,γ′}={α0,α1} we have
[TABLE]
and hence gin(ηγp,ηγ′p)∩gjn(ηγp,ηγ′p)=∅ whenever i<j<6.
Hence 3.10(c) is satisfied. Other cases and other conditions of
3.10 follow immediately by our choices, and hence
[TABLE]
Moreover, md0⊏n and
d∗=(np,vd1,n)∈Mp. However, then d0,d∗ contradict
clause (∗)11 for p.
(3) Let p∈P. Set wq=wp and ιq=ιp+1.
For (α0,α1)∈(wq)⟨2⟩ and i<ιq we use
Proposition 3.8 to pick v(i,α0,α1)∈Oi so
that: for some ℓ, for all i<ιq and (α0,α1)∈(wq)⟨2⟩ we have
\ell\big{(}v(i,\alpha_{0},\alpha_{1})\big{)}=\ell,
if i<ιp then gip(α0,α1)≺iv(i,α0,α1)=v(i,α1,α0),
for some v∈Oιp, v≺ιpv(ιp,α0,α1)=v(ιp,α1,α0).
Fix an enumeration
[TABLE]
Choose n=nq>ℓ and a sequence ⟨ρa:a<A+∣wp∣⟩⊆n2 so that
⟨ρa↾[ℓ,n):a<A+∣wq∣⟩ is linearly
independent in [ℓ,n)2 over Z2, and
σa⊲ρa for each a<A, and
if α∈wq is such that ∣wq∩α∣=k then
ηαp⊲ρA+k.
Put
if α∈wq is such that ∣wq∩α∣=k then
ηαq=ρA+k and
ηˉq=⟨ηαq:α∈wq⟩,
g_{i}^{q}(\alpha_{0},\alpha_{1})=g_{i}^{q}(\alpha_{1},\alpha_{0})=\big{\{}\rho_{a}:a<A\ \wedge\ i=i^{a}\ \wedge\ \alpha_{0}=\alpha_{0}^{a}\ \wedge\ \alpha_{1}=\alpha^{a}_{1}\big{\}} (for i<ιq and
α0<α1 from wq) and gˉq=⟨giq:i<ιq⟩.
It follows from Definition 3.6(iii) that
giq(α0,α1)∈Oi and if (α0,α1)∈(wp)⟨2⟩ then gip(α0,α1)≺iqiq(α0,α1).
We also let Mq=Mp+∣[wq]2∣ and we fix a bijection ψ:[wq]2⟶[Mp,Mq). Then we define mappings
hiq:(wq)⟨2⟩⟶Mq so that for
α0<α1 from wq we have
if i<ιq, then hiq(α0,α1)=hiq(α1,α0)=hip(α0,α1),
hιpq(α0,α1)=hιpq(α1,α0)=ψ({α0,α1}).
This way we defined hˉq=⟨hiq:i<ιq⟩.
We put rmq=rmp for m<Mp and rmq=n for Mp≤m<Mq. We
let tmq⊆n≥2 be trees in which all terminal branches
are of length n and such that
[TABLE]
[Note that by our definitions above and by clause (∗)7 for p we have
tmp∩np2=tmq∩np2 for all m<Mp.]
We define Mq by clause (∗)9. Like previously, one easily verifies
that q=\big{(}w^{q},n^{q},\iota^{q},M^{q},\bar{\eta}^{q},\bar{t}^{q},\bar{r}^{q},\bar{h}^{q},\bar{g}^{q},{\mathcal{M}}^{q}\big{)}\in{\mathbb{P}}.
[The crucial point is that if d∈Mq, η,ν∈umd and
himd(η,ν)≥Mp, then ℓd=nq.]
∎
Claim 4.4.2**.**
The forcing notion P has the Knaster property.
Proof of the Claim.
Suppose that ⟨pξ:ξ<ω1⟩ is a sequence of pairwise
distinct conditions from P and let
[TABLE]
where ηˉξ=⟨ηαξ:α∈wξ⟩,
tˉξ=⟨tmξ:m<Mξ⟩, rˉξ=⟨rmξ:m<Mξ⟩, and hˉξ=⟨hiξ:i<ιξ⟩, gˉξ=⟨giξ:iξ<ι⟩. By a
standard Δ–system cleaning procedure we may find an uncountable set
A⊆ω1 such that the following demands (∗)12–(∗)15
are satisfied.
- (∗)12
{wξ:ξ∈A} forms a Δ–system with the
kernel w∗.
2. (∗)13
If ξ,ς∈A, then ∣wξ∣=∣wς∣ ,
nξ=nς, ιξ=ις, Mξ=Mς, and
tmξ=tmς and rmξ=rmς (for m<Mξ).
3. (∗)14
If ξ<ς are from A and
π:wξ⟶wς is the order isomorphism, then
- (a)
π(α)=α for α∈w∗=wξ∩wς,
2. (b)
if ∅=v⊆wξ, then rk(v)=rk(π[v]),
ζ(v)=ζ(π[v]) and k(v)=k(π[v]),
3. (c)
ηαξ=ηπ(α)ς (for
α∈wξ),
4. (d)
giξ(α,β)=giζ(π(α),π(β)) and
hiξ(α,β)=hiζ(π(α),π(β)) for
(α,β)∈(wξ)⟨2⟩ and i<ιξ, and
4. (∗)15
Mξ=Mς (this actually follows from the
previous demands).
Note that then also
- (∗)16
if ξ∈A, v⊆w∗ and δ∈wξ∖w∗ are such that {\rm rk}\big{(}v\cup\{\delta\}\big{)}=-1, then
k\big{(}v\cup\{\delta\}\big{)}\neq|\delta\cap v|.
[Why? Suppose {\rm rk}\big{(}v\cup\{\delta\}\big{)}=-1 and
k=k\big{(}v\cup\{\delta\}\big{)}=|\delta\cap v|, j=j\big{(}v\cup\{\delta\}\big{)}. For ς∈A let πς:wξ⟶wς be the order isomorphism and let
δς=πς(δ). By (∗)14 we know that
k=k\big{(}v\cup\{\delta_{\varsigma}\}\big{)}=|\delta_{\varsigma}\cap v| and
j=j\big{(}v\cup\{\delta_{\varsigma}\}\big{)}. Therefore, letting
v∪{δ}={a0,…,an−1} be the increasing enumeration, for
every ς∈A we have M⊨Rn,j[a0,…,ak−1,δς,ak+1,…,an−1]. Hence the set
[TABLE]
is uncountable, contradicting (⊛)e from the beginning of
the proof of the theorem.]
We will show that for distinct ξ,ς from A the conditions
pξ,pς are compatible. So let ξ,ς∈A,
ξ<ς and let π:wξ⟶wς be the order
isomorphism. We will define q=\big{(}w,n,\iota,M,\bar{\eta},\bar{t},\bar{r},\bar{h},\bar{g},{\mathcal{M}}\big{)} where ηˉ=⟨ηα:α∈w⟩, tˉ=⟨tm:m<M⟩, rˉ=⟨rm:m<M⟩, and hˉ=⟨hi:i<ι⟩,
gˉ=⟨gi:i<ι⟩.
We set
- (∗)17
ι=ιξ and w=wξ∪wς.
Similarly to the arguments in previous claims, we first pick
[TABLE]
and an ℓ such that for all i<ι and (α0,α1)∈w⟨2⟩ we have
v(i,α0,α1)=v(i,α1,α0)∈Oi,
\ell\big{(}v(i,\alpha_{0},\alpha_{1})\big{)}=\ell,
if α0,α1∈wξ then giξ(α0,α1)≺iv(i,α0,α1), and
if α0,α1∈wς then giς(α0,α1)≺iv(i,α0,α1).
(No other demands on v(i,α0,α1) but symmetry if α0∈wξ∖wς and α1∈wς∖wξ.)
Then we fix an enumeration
[TABLE]
and we choose n>ℓ and ⟨ρa:a<A+∣w∣⟩⊆n2
so that
⟨ρa↾[ℓ,n):a<A+∣w∣⟩ is linearly
independent in [ℓ,n)2 over Z2, and
σa⊲ρa for each a<A, and
if α∈wξ is such that ∣wξ∩α∣=k then
ηαξ⊲ρA+k,
if α∈wς∖wξ is such that
∣(wς∖wξ)∩α∣=k then ηας⊲ρA+∣wξ∣+k.
Put
- (∗)18
n is the one chosen right above,
2. (∗)19
ηˉ=⟨ηα:α∈w⟩, where
if α∈wξ is such that ∣wξ∩α∣=k then
ηα=ρA+k,
if α∈wς∖wξ is such that ∣(wς∖wξ)∩α∣=k then ηα=ρA+∣wξ∣+k,
3. (∗)20
gˉ=⟨gi:i<ι⟩, where for i<ι and
α0<α1 from w we put
[TABLE]
As before, by 3.6(iii), we know that
gi(α0,α1)∈Oi and if (α0,α1)∈(wξ)⟨2⟩ then giξ(α0,α1)≺igi(α0,α1) and similarly for ς in place of ξ.
Let
- (∗)21
M=Mξ+∣wξ∖wς∣2
and let ψ:(wξ∖wς)×(wς∖wξ)⟶[Mξ,M) be a bijection. Then we define
- (∗)22
hˉ=⟨hi:i<ι⟩, where mappings
hi:w⟨2⟩⟶M are such that for distinct
α0,α1∈w and i<ι we have
hi(α0,α1)=hi(α1,α0),
if α0,α1∈wξ, then hi(α1,α0)=hiξ(α1,α0),
if α0,α1∈wς, then hi(α1,α0)=hiς(α1,α0),
if α0∈wξ∖wς and α1∈wς∖wξ, then hi(α1,α0)=ψ(α0,α1).
2. (∗)23
tˉ=⟨tm:m<M⟩, where tm⊆n≥2 are trees in which all terminal branches are of length n and such that
[TABLE]
3. (∗)24
rˉ=⟨rm:m<M⟩, where rm=rmξ for
m<Mξ, rm=n if Mξ≤m<M.
4. (∗)25
M is defined by (∗)9 (for the objects introduced in
(∗)17–(∗)24).
In clauses (∗)17–(∗)25 we defined all the ingredients of
[TABLE]
We still need to argue that q∈P (after this it will be obvious that
it is a condition stronger than both pξ and pς).
It is pretty straightforward that q satisfies demands (∗)1–(∗)9.
RE (∗)10 : To justify clause (∗)10, suppose
that d0,d1∈M, ℓd0=ℓd1=ℓ and ρ∈ℓ2 and md1=md0+ρ, and consider the following
three cases.
Case 1: vd0⊆wξ
Then for each (δ,ε)∈(vd0)⟨2⟩ and
i<ι we have hi(δ,ε)<Mξ, and consequently
{\rm rng}\big{(}h_{j}^{{\mathbf{m}}^{{\mathfrak{d}}_{0}}}\big{)}\subseteq M_{\xi} (for j<6). Hence also
{\rm rng}\big{(}h_{j}^{{\mathbf{m}}^{{\mathfrak{d}}_{1}}}\big{)}\subseteq M_{\xi} (for j<6). But looking at
(∗)22 (and remembering (∗)9d) we now conclude
hi(δ,ε)<Mξ for (δ,ε)∈(vd1)⟨2⟩ and i<ι. Consequently, either vd1⊆wξ
or vd1⊆wς.
If vd1⊆wξ and ℓ≤nξ, then d0,d1∈Mξ and clause (∗)10 for pξ can be used to get the desired
conclusion.
If vd1⊆wξ and ℓ>nξ, then {ηα↾ℓ:α∈vd0∪vd1} is linearly independent and hence
ρ=0 and vd0=vd1.
If vd1⊆wς and ℓ≤nξ, then consider
v=π−1[vd1]⊆wξ and
d=(ℓ,v,md1). Clearly, d∈Mξ and we may use
(∗)10 for pξ to conclude that rk(v)=rk(vd0),
ζ(v)=ζ(vd0), k(v)=k(vd0), and if α∈vd0, β∈v are such that ∣α∩vd0∣=k(vd0)=k(v)=∣β∩v∣, then (ηα↾ℓ)+ρ=ηβ↾ℓ. Now we use the properties (∗)14(b,c)
of π to get a similar assertions with vd1 in place of v.
If vd1⊆wς and ℓ>nξ, then we consider
v=π−1[vd1]⊆wξ and use the linear independence of
{ηα↾ℓ:α∈vd0∪v} to conclude that
ρ=0 and v^{{\mathfrak{d}}_{0}}=v=\pi^{-1}\big{[}v^{{\mathfrak{d}}_{1}}\big{]}. Finally we
use the properties (∗)14(b,c) of π to get the desired assertions.
Case 2: vd0⊆wς
Same as the previous case, just interchanging ξ and ς.
Case 3: vd0∖wξ=∅=vd0∖wς
Then for some (δ,ε)∈(vd0)⟨2⟩ we have
hi(δ,ε)≥Mξ for all i<ι, so necessarily
ℓ=n. Now, the linear independence of ηˉ implies
ρ=0 and vd0=vd1 and the desired conclusion
follows.
RE (∗)11 : Let us prove clause (∗)11
now. Suppose that d0,d1∈M, δ∈vd0,
∣δ∩vd0∣=k(vd0), rk(vd0)=−1, and
vd0⊆vd1 and md0⊏md1. Assume towards contradiction that there is an
ε∈vd1 such that
- (∗)26
ηε↾ℓd1=ηδ↾ℓd1 but ηε↾ℓd0=ηδ↾ℓd0.
Without loss of generality vd1=vd0∪{ε}. Since we
must have ℓd0<n, for no α,β∈vd0 we can have
(∀i<ι)(hi(α,β)≥Mξ). Therefore either
vd0⊆wξ or vd0⊆wς. By the
symmetry, we may assume vd0⊆wξ. Note that
- (∗)27
if (α,β)∈(vd1)⟨2⟩∖{(ε,δ),(δ,ε)} then
hi(α,β)<Mξ for all i<ι.
Now, if vd1⊆wξ and ℓd1≤nξ, then d0,d1∈Mξ and they contradict clause (∗)11
for pξ. Let us consider the possibility that vd1⊆wξ but ℓd1>nξ. Define n∈Mtˉ,Oˉ6n by:
ℓn=nξ, un={ηγ↾nξ:γ∈vd1} (note ηε↾nξ=ηδ↾nξ),
ιn=6, and for (γ,γ′)∈(vd1)⟨2⟩ and i<6:
if {γ,γ′}={ε,δ}, then
[TABLE]
and hin(ηγ↾nξ,ηγ′↾nξ)=himd1(ηγ↾ℓd1,ηγ′↾ℓd1), and
for {γ,γ′}={δ,ε} we fix any
distinct σ0,…,σ5∈j<ι⋃gjξ(δ,ε) and we let gin(ηδ↾nξ,ηε↾nξ)=gin(ηε↾nξ,ηδ↾nξ)={σi} and hin(ηδ↾nξ,ηε↾nξ)=hin(ηε↾nξ,ηδ↾nξ)=m where (ηδ↾nξ)+σi,(ηε↾nξ)+σi∈tmξ (for i<6).
Since md0⊏md1, in the case when {γ,γ′}={δ,ε} we have
[TABLE]
and hence gin(ηγp,ηγ′p)∩gjn(ηγp,ηγ′p)=∅ whenever i<j<6.
Hence 3.10(c) is satisfied. Other cases and other conditions of
3.10 follow immediately by our choices, and hence
[TABLE]
Moreover, md0⊏n and
d∗=(nξ,vd1,n)∈Mξ. However, then d0,d∗ contradict
clause (∗)11 for pξ.
Consequently, vd1∖wξ=∅, so necessarily
ε∈/w∗.
Suppose ∣vd0∖w∗∣≥2, say α0,α1∈vd0∖w∗. Then hi(ε,α0),hi(ε,α1)≥Mξ for all i<ι. But md0⊏md1 implies
that for α∈vd0∖{δ} we have
[TABLE]
so we arrive to a contradiction.
If we had vd0⊆w∗, then vd1⊆wς
and we may repeat the earlier arguments with ς in place
of ξ to get a contradiction. Thus the only possibility left is that
∣vd0∖w∗∣=1. Let {α}=vd0∖w∗. If
α=δ, then h0md1(ηα↾ℓd1,ηε↾ℓd1)=h0md0(ηα↾ℓd0,ηε↾ℓd0)<Mξ gives a contradiction like
before. Therefore, vd0=(vd0∩w∗)∪{δ}. But now
our assumptions on vd0,δ contradict (∗)16.
∎
Claim 4.4.3**.**
Assume p=\big{(}w,n,\iota,M,\bar{\eta},\bar{t},\bar{h},\bar{g},{\mathcal{M}}\big{)}\in{\mathbb{P}}. If m∈Mtˉ,Oˉ6n is such that ℓm=n and ∣um∣≥5, then for some ρ∈n2 and v⊆w we have
\big{(}n,v,({\mathbf{m}}+\rho)\big{)}\in{\mathcal{M}}.
Proof of the Claim.
Let m∈Mtˉ,Oˉ6n be such that ℓm=n. Suppose (\eta,\nu)\in\big{(}u^{\mathbf{m}}\big{)}^{\langle 2\rangle}.
Let gjm(η,ν)={σj} for j<6. Then σjs are
pairwise distinct, and if η+σi=ν+σj then
[TABLE]
whenever k∈/{i,j}. Hence we may pick j0<j1<j2<6 such that
[TABLE]
are all pairwise distinct. Just to simplify notation let us assume that
j0=0, j1=1 ad j2=2.
For each j<3 we have η+σj,ν+σj∈⋃m<Mtm. By clause (∗)7 there are (αj,βj),(αj′,βj′)∈w⟨2⟩ and ρj∈i<ι⋃gi(αj,βj) and ρj′∈i<ι⋃gi(αj′,βj′) such that
η+σj=ηαj+ρj and ν+σj=ηαj′+ρj′ for j<3.Then
η+ν=ηαj+ηαj′+ρj+ρj′ for all
j<3. We will consider 3 cases, the first two of them will be shown to be
impossible.
Case 1: ηαj=ηαj′ for some
j<3.
Then, by the linear independence demanded in (∗)7,
ηαj=ηαj′ for all j<3 and {ρ0,ρ0′}={ρ1,ρ1′}={ρ2,ρ2′}. But gi(α,β)’s are
disjoint, so each \rho\in\bigcup\big{\{}g_{i}(\alpha,\beta):(\alpha,\beta)\in w^{\langle 2\rangle}\ \wedge\ i<\iota\big{\}} uniquely determines α,β such that
ηα+ρ,ηβ+ρ∈m<M⋃tm. Therefore,
∣{α0,α1,α2}∣≤2 in the current case. Since
η+σj,ν+σj are all pairwise distinct (for j<3), this
gives an immediate contradiction.
Case 2: ηαj=ηαj′ and
ρj=ρj′ for some (equivalently: all) j<3.
Then {ηα0,ηα0′}={ηα1,ηα1′}={ηα2,ηα2′}
and {ρ0,ρ0′}={ρ1,ρ1′}={ρ2,ρ2′}. However,
this again contradicts η+σj,ν+σj being pairwise
distinct.
Thus the only possible case is the following:
Case 3: ηαj=ηαj′ and
ρj=ρj′ for all j<3.
Then η+ν=ηα0+ηα0′.
Consequently we have shown that
[TABLE]
By Lemma 4.3 for some ρ we have um+ρ⊆{ηα:α∈w}. Let v={α∈w:ηα∈um+ρ}. Let us argue that \big{(}n,v,({\mathbf{m}}+\rho)\big{)}\in{\mathcal{M}}: demands
(∗)9a–(∗)9c are immediate consequences of our choices
above. Let us verify (∗)9d.
Suppose that (α,β)∈v⟨2⟩ and i<6. Let
η=ηα+ρ,ν=ηβ+ρ (so they are in um) and
let {σi}=gim(η,ν). Then η+σi,ν+σi∈m<M⋃tm, so we may choose (α′,β′),(α′′,β′′)∈w⟨2⟩ and j′,j′′<ι and
ρ′∈gj′(α′,β′) and ρ′′∈gj′′(α′′,β′′)
such that η+σi=ηα′+ρ′ and
ν+σi=ηα′′+ρ′′. Then
[TABLE]
By the linear independence stated in (∗)8 we get ρ′=ρ′′ and
{ηα′,ηα′′}={ηα,ηβ}. Consequently
also {α,β}={α′,α′′} and {α′,β′}={α′′,β′′} and j′=j′′. Since α=β we get
α′=α′′ and thus α′=β′′,
α′′=β′. Consequently, {α′′,β′′}={α′,β′}={α′,α′′}={α,β}. Hence
η+σi=ηα′+ρ′∈thj′(α,β)=thj′(β,α) and
ν+σi=ηα′′+ρ′∈thj′(α,β)=thj′(β,α). Therefore,
him+ρ(ηα,ηβ)=him(η,ν)=hj′(α,β)=hj′(β,α).
∎
Define P–names \mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m} and \mathchoice{\oalign{\displaystyle\eta\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle\eta\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\alpha} (for
m<ω and α<λ) by
⊩P“ \mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m}=\bigcup\{t^{p}_{m}:p\in\mathchoice{\oalign{\displaystyle G\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle G\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\mathbb{P}}\ \wedge\ m<M^{p}\} ”, and
⊩P“ \mathchoice{\oalign{\displaystyle\eta\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle\eta\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\alpha}=\bigcup\{\eta^{p}_{\alpha}:p\in\mathchoice{\oalign{\displaystyle G\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle G\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle G\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\mathbb{P}}\ \wedge\ \alpha\in w^{p}\} ”.
Claim 4.4.4**.**
- (1)
For each m<ω and α<λ,
⊩P“ \mathchoice{\oalign{\displaystyle\eta\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle\eta\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle\eta\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{\alpha}\in{}^{\omega}2 and
\mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m}\subseteq{}^{\omega>}2 is a tree without terminal nodes ”.
2. (2)
For all α<β<λ we have
[TABLE]
3. (3)
⊩P“ \bigcup\limits_{m<\omega}\lim(\mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m}) is a Oˉ6–npots set ”.
Proof of the Claim.
(1, 2) By Claim 4.4.1 (and the definition of the order in P).
(3) Let G⊆P be a generic filter over V and
let us work in V[G]. Let \bar{T}=\langle(\mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m})^{G}:m<\omega\rangle.
Suppose towards contradiction that B=\bigcup\limits_{m<\omega}\lim\big{(}(\mathchoice{\oalign{\displaystyle T\crcr\vbox to0.86108pt{\hbox{\displaystyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\textstyle T\crcr\vbox to0.86108pt{\hbox{\textstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}{\oalign{\scriptscriptstyle T\crcr\vbox to0.86108pt{\hbox{\scriptscriptstyle{\tilde{\mkern-3.0mu}\mkern 3.0mu}{}}\vss}}}_{m})^{G}\big{)} is an Oˉ6–pots set. Then, by
Proposition 3.16, NDRKOˉ6(Tˉ)=∞. Using Lemma
3.15(5), by induction on j<ω we choose mj,mj∗∈MTˉ,Oˉ6 and pj∈G such that
- (i)
ndrkOˉ6(mj)≥ω1, ∣umj∣>5 and
mj⊏mj∗⊏mj+1,
2. (ii)
for each ν∈umj∗ the set {η∈umj+1:ν⊲η} has at least two elements, and
3. (iii)
pj≤pj+1, ℓmj<ℓmj∗=npj<ℓmj+1 and rng(himj)⊆Mpj for all
i<6, and
4. (iv)
∣{η↾npj:η∈umj+1}∣=∣umj∣=∣umj∗∣.
To carry out the construction we proceed as follows. Suppose we have
determined mj so that ndrkOˉ6(mj)≥ω1. Using
densities given in Claim 4.4.1, we find pj∈G with
npj>ℓmj and rng(himj)⊆Mpj (for
i<6). Next we choose n such that mj⊏n,
ndrkOˉ6(n)≥ω1, and ℓn>npj. Using
Lemma 3.15(8) (for a u′⊆un such that {η↾ℓmj:η∈u′}=umj, ∣u′∣=∣umj∣) we may
also demand that ∣un∣=∣umj∣. Now we let
ℓ=npj, u={η↾ℓ:η∈un},
hˉ=⟨hi:i<6⟩, where for i<6 and (\eta,\nu)\in\big{(}u^{{\mathbf{n}}}\big{)}^{\langle 2\rangle}
hi(η↾ℓ,ν↾ℓ)=hin(η,ν)=himj(η↾ℓmj,ν↾ℓmj),
gˉ=⟨gi:i<6⟩, where for i<6 and
(\eta,\nu)\in\big{(}u^{{\mathbf{n}}}\big{)}^{\langle 2\rangle}
g_{i}(\eta{\restriction}\ell,\nu{\restriction}\ell)=\big{\{}\rho{\restriction}\ell:\rho\in g^{{\mathbf{n}}}_{i}(\eta,\nu)\big{\}}.
Clearly, mj∗=(ℓ,6,u,hˉ,gˉ)∈MTˉ,Oˉ6
and mj⊏mj∗. Finally use Lemma 3.15(5) to pick
mj+1⊐n such that ndrk(mj+1)≥ω1 and
condition (ii) is satisfied. Note that mj∗⊏mj+1.
Then, by (iii)+(iv), mj,mj∗∈Mtˉpj,Oˉ6npj. It follows from Claim 4.4.3
that for some wj⊆wpj and ρj∈npj2 we have
(npj,wj,mj∗+ρj)∈Mpj.
Fix j for a moment and consider (npj,wj,mj∗+ρj)∈Mpj⊆Mpj+1 and (npj+1,wj+1,mj+1∗+ρj+1)∈Mpj+1. (Note that since (npj,wj,mj∗+ρj)∈Mpj, we know that rhimj∗(η,ν)≤npj for
all i<6, (η,ν)∈umj∗.) Since (mj∗+(ρj+1↾npj))⊏(mj+1∗+ρj+1), we may choose wj∗⊆wj+1 such that (npj,wj∗,mj∗+(ρj+1↾npj))∈Mpj+1. Since (mj∗+ρj)+(ρj+ρj+1↾npj)=mj∗+(ρj+1↾npj), we may use clause (∗)10
for pj+1 to conclude that rk(wj∗)=rk(wj).
Condition (ii) of the choice of mj+1 implies that
[TABLE]
Let δ(γ) be the smallest δ∈wj+1∖wj∗
with the above property and let wj∗(γ)=(wj∗∖{γ})∪{δ(γ)}. Then, for γ∈wj∗,
(npj,wj∗(γ),mj∗+(ρj+1↾npj))∈Mpj+1 and therefore, by clause (∗)10 for pj+1, we get
that for each γ∈wj:
[TABLE]
Let n=∣wj∗∣, ζ=ζ(wj∗), k=k(wj∗), and let
wj∗={α0,…,αk,…,αn−1} be the increasing
enumeration. Let αk∗=δ(αk). Then clause (∗)10 also
gives that wj∗(αk)={α0,…,αk−1,αk∗,αk+1,…,αn−1} is the increasing enumeration. Now,
[TABLE]
and consequently if rk(wj∗)≥0, then
[TABLE]
(remember (⊛)d from the very beginning of the proof of
the Theorem).
Now, unfixing j, it follows from the above considerations that for some
j0<ω we must have:
- (a)
rk(wj0∗)=−1, and
2. (b)
(npj0,wj0∗,mj0∗+(ρj0+1↾npj0)),(npj0+1,wj0+1,mj0+1∗+ρj0+1)∈Mpj0+1,
3. (c)
for each ν∈umj0∗ the set {η∈umj0+1∗:ν⊲η} has at least two elements.
However, this contradicts clause (∗)11 (for pj0+1).
∎
∎
5. Conclusions and Questions
Corollary 5.1**.**
Assume NPrω1(λ) and λ=λℵ0<μ=μℵ0.
- (1)
Let Oˉ be a nice indexed base. Then there
is a ccc forcing notion Q of size μ forcing that:
2ℵ0=μ* and there is a Σ20 set B⊆ω2
which has λ many pairwise Oˉ–nondisjoint translates but
does not have λ+ many pairwise Oˉ6–nondisjoint
translates.*
2. (2)
In particular, there is a ccc forcing notion Q′ of size μ
forcing that:
2ℵ0=μ* and for some Σ20 set
B⊆ω2 there are pairwise distinct ⟨ηξ:ξ<λ⟩ such that (B+ηξ)∩(B+ηζ)
is uncountable for each ξ,ζ<λ, but*
for any set A⊆ω2 of size λ+ there are x,y∈A
such that ∣(B+x)∩(B+y)∣<6.
Proof.
(1) Let P be the forcing notion given by Theorem 4.4
and let Q=P∗Cμ. The set B added by P is a
Oˉ6–npots–set in VP, so by Proposition 3.16
we got NDRKOˉ6(Tˉ)=∞. The rank
ndrkOˉ6Tˉ is absolute, so in VQ we still have
NDRKOˉ6(Tˉ)=∞ and thus B is a Oˉ6–npots–set in VQ. By 3.5(3) this set cannot have
λ+ pairwise Oˉ6–nondisjoint translates, but it does have
λ many pairwise Oˉ–nondisjoint translates (by
absoluteness).
∎
Corollary 5.2**.**
Assume MA and ℵα<c, α<ω1.
- (1)
Let Oˉ be a nice indexed base. Then there exists a
Σ20 Oˉ6–npots–set B⊆ω2 which has
ℵα many pairwise Oˉ–nondisjoint translations.
2. (2)
In particular, there exists a Σ20 set B⊆ω2 such
that
for some pairwise distinct ⟨ηξ:ξ<ℵα⟩⊆ω2 the intersections (B+ηξ)∩(B+ηζ) are uncountable for each ξ,ζ<ℵα, but
for every perfect set P⊆ω2 there are x,y∈P such that
∣(B+x)∩(B+y)∣<6.
Proof.
Standard consequence of the proof of Theorem 4.4, using
the fact that “B is a Oˉ6–npots–set” is sufficiently
absolute by Proposition 3.16.
∎
Problem 5.3**.**
- (1)
Can one differentiate between various nice Oˉ in the context
of our results? In particular:
2. (2)
Is it consistent that for some nice Oˉ there is an Σ20
Oˉ–npots–set which has ℵα many pairwise
Oˉ–nondisjoint translations, but for some other nice
Oˉ∗ every Σ20 set with ℵα many pairwise
Oˉ∗–nondisjoint translations is automatically Oˉ∗–pots ?
3. (3)
Is it consistent that there is an Σ20 set B⊆ω2
which is has ℵα many pairwise Oˉper–nondisjoint
translations, is Oˉper–npots, but is also
Oˉ6–pots?
Problem 5.4**.**
- (1)
Consider the forcing notion P given by Theorem
4.4 for Oˉper. In the forcing extension by
P, the ranks NDRKOˉ6(Tˉ) and
NDRKOˉper(Tˉ) are both countable. Are they equal? What
are their values?
2. (2)
Does there exist a sequence of trees Tˉ∗ (as in Assumptions
3.1) for which the ranks NDRKOˉper(Tˉ) and
NDRKOˉι(Tˉ) are different (for some/all ι)?
3. (3)
Generalize the construction of [5] to arbitrary nice
Oˉ.
4. (4)
Generalize the result of the present paper to the context of arbitrary
perfect Abelian Polish groups.