A consistency result on long cardinal sequences
Juan Carlos Martinez
Facultat de Matemàtiques i Informàtica
Universitat de Barcelona
Gran
Via 585
08007 Barcelona, Spain
[email protected]
and
Lajos Soukup
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences
Budapest, V. Reáltanoda u. 13-15, H-1053, Hungary
[email protected]
Abstract.
For any regular cardinal
κ and ordinal η<κ++ it is consistent that 2κ is as large as you wish, and
every function
f:η⟶[κ,2κ]∩Card with f(α)=κ for cf(α)<κ is the cardinal sequence of some locally compact scattered space.
Key words and phrases:
locally compact scattered space, superatomic Boolean algebra, cardinal sequence.
2010 Mathematics Subject Classification:
54A25, 06E05, 54G12, 03E35
The first author was supported by the Spanish Ministry of Education DGI grant MTM2017-86777-P and by the Catalan DURSI grant 2017SGR270. The second author was supported by NKFIH grants nos. K113047 and K129211.
1. Introduction
If X is a
locally compact,
scattered Hausdorff (in short: LCS) space and α is an ordinal,
we let Iα(X) denote the αth Cantor-Bendixson level
of X. The cardinal sequence of X, CS(X), is the sequence of the
cardinalities of the infinite Cantor-Bendixson levels of X, i.e.
[TABLE]
where ht−(X), the
reduced height of X, is the minimal ordinal
β such that Iβ(X) is finite.
The height of X, denoted by ht(X), is defined as the minimal ordinal
β such that Iβ(X)=∅.
Clearly ht−(X)≤ht(X)≤ht−(X)+1.
If α is an ordinal,
let C(α) denote the class of all cardinal sequences
of LCS spaces of reduced height α and put
[TABLE]
Let ⟨κ⟩α denote the constant κ-valued sequence of length α.
In [2] it was shown that the class C(α) is described if the classes Cκ(β) are characterized
for every infinite cardinal κ and ordinal β≤α. Then, under GCH, a full description of the classes Cκ(α)
for infinite cardinals κ and ordinals α<ω2 was
given.
The situation becomes, however, more complicated for α≥ω2.
In [7] we gave a consistent full characterization of Cκ(α) for any uncountable regular cardinals κ and ordinals α<κ++ under GCH.
If GCH fails, much less is known on Cκ(α) even for α<κ++.
In [9] it was proved that ⟨ω⟩ω1⌢\makebox[−3.0pt]⟨ω2⟩∈Cω(ω1+1) is consistent.
In [3] a similar result was proved for uncountable cardinals instead of ω: if κ is a regular cardinal with κ<κ=κ>ω and 2κ=κ+, then in
some cardinality preserving generic extension of the ground model we have
[TABLE]
In [8] we proved that if κ and λ are regular cardinals, κ<κ=κ, 2κ=κ+, and δ<κ++ with cf(δ)=κ+, then in
some cardinality preserving generic extension of the ground model we have
[TABLE]
In this paper we will prove a much stronger result than the above mentioned one.
Theorem 1.1**.**
Assume that κ and λ are regular cardinals,
κ++≤λ, κ<κ=κ,
2κ=κ+, λκ+=λ and δ<κ++.
Then, in
some cardinality preserving generic extension of the ground model, we have
2κ=λ and
[TABLE]
Definition 1.2**.**
Let C be a family of sequences of cardinals.
We say that an LCS space X is universal for C iff
CS(X)∈C and for each s∈C there is an open subspace Z⊂X with CS(Z)=s.
Instead of Theorem 1.1 we prove the following stronger result:
Theorem 1.3**.**
Assume that κ and λ are regular cardinals,
κ++≤λ,
κ<κ=κ,
2κ=κ+, λκ+=λ and δ<κ++.
Then, in some cardinal preserving generic extension,
we have 2κ=λ and
there is an LCS space X which is universal for
[TABLE]
Definition 1.4**.**
Let κ<λ be cardinals, δ be an ordinal, and A⊂δ.
An LCS space X of height δ is called (κ,λ,δ,A)-good iff
there is an open subspace Y⊂X
such that
- (1)
CS(Y)=⟨κ⟩δ,
2. (2)
Iζ(Y)=Iζ(X), and so ∣Iζ(X)∣=κ, for ζ∈δ∖A,
3. (3)
∣Iζ(X)∣=λ for ζ∈A,
4. (4)
for ζ∈A the set Zζ=I<ζ(Y)∪Iζ(X) is an open subspace of X
such that
- (a)
Iξ(Zζ)=Iξ(Y) for ξ<ζ,
2. (b)
Iζ(Zζ)=Iζ(X).
Theorem 1.3 follows immediately from Koszmider’s Theorem,
Theorem 1.6 and Proposition 1.7 below.
The following result of Koszmider can be obtained by
putting together [5, Fact 32 and Theorem 33]:
Definition 1.5** (See [4, 5]).**
Assume that κ<λ are infinite cardinals. We say that a function F:[λ]2⟶κ+ is a κ+-strongly unbounded
function on λ iff for every ordinal ϑ<κ+ and for every
family A⊂[λ]<κ of
pairwise disjoint sets with ∣A∣=κ+,
there are different a,b∈A
such that F{α,β}>ϑ for every α∈a and β∈b.
**Koszmider’s Theorem **.
If κ,λ are infinite cardinals such that κ++≤λ, κ<κ=κ, 2κ=κ+ and λκ+=λ, then
in some cardinal preserving generic extension
κ<κ=κ, λκ=λ and
there is a κ+- strongly unbounded function on λ.
For an ordinal δ<κ++
let
[TABLE]
Theorem 1.6**.**
If κ<λ are regular cardinals with
κ<κ=κ, λκ=λ, and there is a κ+- strongly unbounded function on λ,
then for each δ<κ++ there is
a κ-complete κ+-c.c poset P of cardinality λ such that
in VP we have 2κ=λ and
there is a (κ,λ,δ,Lκδ)-good space.
We will prove Theorem 1.6 in Section
2.
Proposition 1.7**.**
If κ<λ are regular cardinals
and δ<κ++, then a (κ,λ,δ,Lκδ)-good space
is universal for
[TABLE]
Proof.
Let X be a (κ,λ,δ,Lκδ)-good space.
Fix f∈C.
For ζ∈Lκδ pick T_{\zeta}\in\bigl{[}{\operatorname{I}_{\zeta}(X)}\bigr{]}^{f({\zeta})},
and let
[TABLE]
Since I<ζ(Y)∪Tζ is an open subspace of X for ζ∈Lκδ,
for every α<δ we have
[TABLE]
Since
[TABLE]
we have
[TABLE]
Since ∣Iα(Y)∣=κ and ∣Iα(Y)∪Tα∣=κ+f(α)=f(α), we have
CS(Z)=f, which was to be proved.
∎
2. Proof of theorem 1.6
Graded posets
In [3], [6], [9] and in many other papers, the
existence of an LCS space is proved
in such a way that instead of constructing the space
directly, a certain “graded poset” is produced which
guaranteed the existence of the wanted LCS-space.
From these results, Bagaria, [1], extracted
the notion of s-posets and established the formal connection between graded posets and LCS-spaces.
For technical reasons, we will use a reformulation of Bagaria’s result introduced in
[10].
If ⪯ is an arbitrary partial order on a set X then define the topology
τ⪯ on X generated by the family
{U⪯(x),X∖U⪯(x):x∈X} as a subbase, where
U⪯(x)={y∈X:y⪯x}.
Proposition 2.1** ([10, Proposition 2.1]).**
Assume that ⟨X,⪯⟩ is a poset, {Xα:α<δ} is a partition of X
and
i:\bigl{[}{X}\bigr{]}^{2}\longrightarrow X\cup\{undef\}
is a function satisfying
(a)–(c) below:
- (a)
if x∈Xα, y∈Xβ and
x⪯y then either x=y or α<β,
2. (b)
\forall\{x,y\}\in\bigl{[}{X}\bigr{]}^{2}* \big{(}
∀z∈X (z⪯x∧z⪯y) iff
z⪯i{x,y} \big{)}.*
3. (c)
if x∈Xα and β<α
then the set {y∈Xβ:y⪯x} is infinite.
Then X=⟨X,τ⪯⟩ is an LCS space
with Iα(X)=Xα for α<δ.
Definition 2.2**.**
Let κ<λ be cardinals, δ be an ordinal, and A⊂δ.
Assume that ⟨X,⪯⟩ is a poset, {Xα:α<δ} is a partition of X
and
i:\bigl{[}{X}\bigr{]}^{2}\longrightarrow X\cup\{undef\}
is a function satisfying
conditions (a)–(c) from Proposition 2.1.
We say that poset ⟨X,⪯⟩ is
(κ,λ,δ,A)-good iff
there is a set Y⊂X
such that:
- (d)
if x0⪯x1, then either x0=x1 or x0∈Y;
2. (e)
X_{\zeta}\in\bigl{[}{Y}\bigr{]}^{\kappa} for ζ∈δ∖A;
3. (f)
∣Xζ∣=λ and ∣Xζ∩Y∣=κ for ζ∈A.
Proposition 2.3**.**
Let κ<λ be cardinals, δ be an ordinal, and A⊂δ.
If ⟨X,⪯⟩ is a (κ,λ,δ,A)-good poset, then
X=⟨X,τ⪯⟩ is a (κ,λ,δ,A)-good space.
Proof of Proposition 2.3.
By Proposition 2.1, X=⟨X,τ⪯⟩ is an LCS space
with Iα(X)=Xα for α<δ.
By (d), the subspace Y is open, and so Iζ(Y)=Iζ(X)∩Y.
Thus ∣Iζ(Y)∣=κ by (e) and (f). So CS(Y)=⟨κ⟩δ, i.e. 1.4(1) holds.
If ζ∈δ∖A, then Iζ(X)⊂Y by (e), so Iζ(X)=Iζ(Y). Thus 1.4(2) holds.
Moreover Iζ(Y)=Iζ(X)∩Y.
1.4(3) follows from (f).
Also,
for ζ∈A
(a) and (d) imply that U⪯(s)⊂Zζ for s∈Zζ, and so Zζ is an open subspace of X.
Hence Iξ(Zζ)=Iξ(X)∩Zζ=Xξ∩Zζ.
Thus Iξ(Zζ)=Iξ(Y) for ξ<ζ, and
Iζ(Zζ)=Xζ. So 1.4(4) also holds.
Thus X is a (κ,λ,δ,A)-good space.
∎
So, instead of Theorem 1.6, it is enough to prove Theorem 2.4 below.
Theorem 2.4**.**
If κ<λ are regular cardinals with
κ<κ=κ, λκ=λ, and there is a κ+- strongly unbounded function on λ,
then for each δ<κ++ there is
a κ-complete κ+-c.c poset P of cardinality λ such that
in VP we have 2κ=λ and
there is a (κ,λ,δ,Lκδ)-good poset.
So, assume that κ, λ and δ satisfy the hypothesis of Theorem
2.4. In order to construct the required poset P, first
we need to recall some notion from [6, Section 1].
Orbits
If α≤β are ordinals let
[TABLE]
We say that I is an ordinal interval iff there are
ordinals α and β with I=[α,β).
Write I−=α and I+=β.
If I=[α,β) is an ordinal interval let E(I)={ενI:ν<cf(β)} be a cofinal closed subset
of I having order type cf(β) with α=ε0I and put
[TABLE]
provided β is a limit ordinal,
and let E(I)={α,β′}
and put
[TABLE]
provided β=β′+1 is a successor ordinal.
Define {In:n<ω} as follows:
[TABLE]
Put I=⋃{In:n<ω}.
Note that I is a cofinal tree of intervals in the sense defined in [6].
So, the following conditions are
satisfied:
- (i)
For every I,J∈I, I⊂J or
J⊂I or I∩J=∅.
2. (ii)
If I,J are different elements of I with
I⊂J and J+ is a limit ordinal, then I+<J+ .
3. (iii)
In partitions [0,δ) for each n<ω.
4. (iv)
In+1 refines In for each n<ω.
5. (v)
For every α<δ there is an I∈I
such that I−=α.
Then, for each α<δ we define
[TABLE]
and for each α<δ and n<ω we pick
[TABLE]
Proposition 2.5**.**
Assume that ζ<δ is a limit ordinal. Then, there is
an interval
[TABLE]
such that ζ is a limit point of E(J(ζ)).
If cf(ζ)=κ+, then J(ζ)∈In(ζ) and
J(ζ)+=ζ.
Proof.
If there is an I∈In(ζ) with I+=ζ
then J(ζ)=I. If there is no
such I, then ζ is a limit point of E(I(ζ,n(ζ)−1)), so J(ζ)=I(ζ,n(ζ)−1).
Assume now that cf(ζ)=κ+. Then
ζ∈E(I(ζ,n(ζ)−1)),
but ∣E(I(ζ,n(ζ)−1))∩ζ∣≤κ, so ζ can not be a limit point of E(I(ζ,n(ζ)−1)). Therefore, it has a predecessor
ξ in E(I(ζ,n(ζ)−1)), i.e
[ξ,ζ)∈In(ζ), and so
J(ζ)=[ξ,ζ) and
J(ζ)∈In(ζ).
∎
If cf(J(ζ)+)∈{κ,κ+}, we denote by
{ϵνζ:ν<cf(J(ζ)+)} the
increasing enumeration of E(J(ζ)), i.e.
ϵνζ=ενJ(ζ) for
ν<cf(J(ζ)+).
Now if ζ<δ, we define the basic
orbit of ζ (with respect to I) as
[TABLE]
We refer the reader to [6, Section1]
for some fundamental facts and examples on basic orbits.
In particular, we have that α∈o(β) implies
o(α)⊂o(β).
If ζ∈Lκδ,
we define the extended orbit of ζ by
[TABLE]
Observe that if
J(ζ)∈In(ζ)−1 then o(ζ)=o(ζ).
The underlying set of our poset will consist of blocks.
The following set
B below serves as the index set of our blocks:
[TABLE]
Let
[TABLE]
and
[TABLE]
for ζ∈Lκδ.
The underlying set of our poset will be
[TABLE]
To obtain a (κ,λ,δ,Lκδ)-good poset
we take Y=BS and
[TABLE]
Define the functions π:X⟶δ
and ρ:X⟶λ by the formulas
[TABLE]
Define
[TABLE]
Finally we define the orbits of the elements of X as
follows:
[TABLE]
Observe that \operatorname{o^{*}}(x)\in\bigl{[}{\pi(x)}\bigr{]}^{\leq{{\kappa}^{+}}} and
[TABLE]
To simplify our notation, we will write o(x)=o(π(x))
and o(x)=o(π(x)).
Forcing construction
Let Λ∈I and \{x,y\}\in\bigl{[}{X}\bigr{]}^{2}. We say
that Λ* separates x from y* if
[TABLE]
Let \mathcal{F}:\bigl{[}{\lambda}\bigr{]}^{2}\longrightarrow{{\kappa}^{+}} be a
κ+-strongly unbounded function.
Define
[TABLE]
as follows:
[TABLE]
Observe that
[TABLE]
for all \{x,y\}\in\bigl{[}{X}\bigr{]}^{2}.
Definition 2.6**.**
Now, we define the poset P=⟨P,≤⟩ as
follows: ⟨A,⪯,i⟩∈P iff
- (P1)
A\in\bigl{[}{X}\bigr{]}^{{<{\kappa}}};
2. (P2)
⪯ is a partial order on
A such that
x⪯y implies x=y or π(x)<π(y);
3. (P3)
if x⪯y and
πB(x)=S, then x=y;
4. (P4)
\operatorname{i}:\bigl{[}{A}\bigr{]}^{2}\longrightarrow A\cup\{{\text{\rm undef}}\} such that
for each \{x,y\}\in\bigl{[}{A}\bigr{]}^{2} we have
[TABLE]
5. (P5)
for each \{x,y\}\in\bigl{[}{A}\bigr{]}^{2} if x and y are
⪯-incomparable but ⪯-compatible, then
[TABLE]
6. (P6)
If {x,y}∈[A]2 with x≺y, and
Λ∈I separates x
from y, then there is
z∈A such that x≺z≺y and π(z)=Λ+.
The ordering on P is the extension: ⟨A,⪯,i⟩≤⟨A′,⪯′,i′⟩
iff A′⊂A, ⪯′=⪯∩(A′×A′), and
i′⊂i.
For p∈P write p=⟨Ap,⪯p,ip⟩.
To complete the proof of Theorem 2.4 we will use the following lemmas which will be proved later:
Lemma 2.7**.**
P* is
κ-complete.*
Lemma 2.8**.**
P*
satisfies the κ+-c.c.*
Lemma 2.9**.**
(a)
For all x∈X, the set
[TABLE]
is dense in P.
(b)
If x∈X, α<π(x) and ζ<κ,
then the set
[TABLE]
is dense in P
Since λ<κ=λ , the cardinality of P is λ.
Thus, Lemma 2.7 and Lemma 2.8 above guarantee
that forcing with P preserves cardinals and 2κ=λ in the generic extension.
Let G⊂P be a generic filter.
Put
A=⋃{Ap:p∈G},
i=⋃{ip:p∈G} and
⪯=⋃{⪯p:p∈G}.
Then A=X by Lemma 2.9(a).
We claim that ⟨X,⪯⟩ is a (κ,λ,δ,Lκδ)-poset.
Recall that we put Xζ={ζ}×κ for ζ∈δ∖Lκδ and
Xζ={ζ}×λ for ζ∈Lκδ.
Then the poset ⟨X,⪯⟩, the partition {Xζ:ζ<δ}, the function i
and Y=δ×κ clearly satisfy conditions 2.1(a,b) and
2.2(d,e,f) by the definition of the poset P.
Finally condition 2.1(c) holds by Lemma 2.9(b).
So to complete the proof of Theorem 2.4 we need to prove Lemmas 2.7, 2.8 and 2.9.
Since κ is regular, Lemma 2.7 clearly
holds.
Proof of Lemma 2.9.
(a)
Let p∈P be arbitrary. We can assume that x∈/Ap.
Let Aq=Ap∪{x}, ⪯q=⪯p∪{⟨x,x⟩}, and define i′⊃i such that i′{a,x}=undef for a∈Ap.
Then q=⟨Aq,⪯q,iq⟩∈Dx and q≤p.
(b) Let p∈P be arbitrary. By (a) we can assume that x∈Ap.
Write β=π(x). Let K be a finite subset of [α,β) such that α∈K and
I(γ,n)+∈K∪[β,δ) for
γ∈K and n<ω. For each γ∈K pick
bγ∈({γ}×(κ∖ζ))∖Ap. So π(bγ)=γ.
Let Aq=Ap∪{bγ:γ∈K},
[TABLE]
We let iq{y,z}=ip{y,z} if \{y,z\}\in\bigl{[}{A_{p}}\bigr{]}^{2},
iq{bγ,bγ′}=bγ if γ,γ′∈K
with γ<γ′, iq{bγ,z}=bγ if
γ∈K and x⪯pz, and iq{bγ,z}=undef otherwise.
Let q=⟨Aq,⪯q,iq⟩. Next we check q∈P.
Clearly (P1),(P2),(P3) and (P5) hold for q.
(P4) also holds because
if y∈Ap
and γ∈K then either bγ⪯qy or they are ⪯q-incompatible.
To check (P6) it is enough to observe that if Λ separates bγ and y, then
z=bΛ+ meets the requirements of (P6).
By the construction, q≤p.
Finally q∈Ex,α,ζ because b_{\alpha}\in A_{q}\cap\big{(}\{{\alpha}\}\times({\kappa}\setminus{\zeta})\big{)}
and bα⪯qx.
∎
The rest of the paper is devoted to the proof of Lemma 2.8.
Proof of Lemma 2.8.
Assume that ⟨rν:ν<κ+⟩⊂P with rν=rμ for ν<μ<κ+.
In the first part of the proof, till Claim 2.16, we will find ν<μ<κ+ such that
rν and rμ are twins in a strong sense, and
rν
and rμ form a good pair (see Definition 2.15).
Then, in the second part of the proof, we will show that if {rν,rμ} is a good pair, then rν
and rμ are compatible in P.
Write rν=⟨Aν,⪯ν,iν⟩ and
Aν={xν,i:i<σν}.
Since we are assuming that κ<κ=κ, by thinning
out ⟨rν:ν<κ+⟩ by means of standard combinatorial
arguments, we can assume the following:
- (A)
σν=σ for each ν<κ+.
2. (B)
{Aν:ν<κ+} forms a Δ-system with kernel A△.
3. (C)
For each ν<μ<κ+ there is an isomorphism
hν,μ:⟨Aν,⪯ν,iν⟩⟶⟨Aμ,⪯μ,iμ⟩ such that
for every i,j<σ the following holds:
- (a)
hν,μ↾A△=id,
2. (b)
hν,μ(xν,i)=xμ,i,
3. (c)
πB(xν,i)=πB(xν,j) iff πB(xμ,i)=πB(xμ,j),
4. (d)
πB(xν,i)=S iff πB(xμ,i)=S,
5. (e)
if \{x_{{\nu},i},x_{{\nu},j}\}\in\bigl{[}{{A_{\vartriangle}}}\bigr{]}^{2} then xν,i=xμ,i, xν,j=xμ,j and
iν{xν,i,xν,j}=iμ{xμ,i,xμ,j},
6. (f)
π(xν,i)∈o(xν,j) iff π(xμ,i)∈o(xμ,j) ,
7. (g)
π(xν,i)∈o(xν,j) iff π(xμ,i)∈o(xμ,j),
8. (h)
π(xν,i)∈o∗(xν,j) iff π(xμ,i)∈o∗(xμ,j),
9. (i)
π(xν,k)∈f{xν,i,xν,j} iff
π(xμ,k)∈f{xμ,i,xμ,j}.
Note that in order to obtain (C)(e) we use condition (P5) and the fact that
∣f{x,y}∣≤κ for all x=y.
Also, we may assume the following:
- (D)
There is a partition σ=K∪∗F∪∗D∪∗M such that for each ν<μ<κ+:
- (a)
∀i∈K xν,i∈A△ and so xν,i=xμ,i. A△={xν,i:i∈K}.
2. (b)
∀i∈F xν,i=xμ,i but πB(xν,i)=πB(xμ,i)=S.
3. (c)
∀i∈D xν,i∈/A△,
πB(xν,i)=S and π(xν,i)=π(xμ,i).
4. (d)
∀i∈M πB(xν,i)=S and π(xν,i)=π(xμ,i).
2. (E)
If π(xν,i)=π(xν,j) then \{i,j\}\in\bigl{[}{K\cup F}\bigr{]}^{2}\cup\bigl{[}{D\cup{M}}\bigr{]}^{2}.
It is well-known that if σ<κ=κ<κ then the
following partition relation holds:
[TABLE]
Hence we can assume:
- (F)
π(xν,i)≤π(xμ,i)
for each i∈σ and ν<μ<κ+.
For i∈σ let
[TABLE]
Claim 2.10**.**
(a) If i∈D∪M, then the sequence ⟨π(xν,i):ν<κ+⟩ is strictly increasing, cf(δi)=κ+ and \mboxsup(J(δi))=δi. Moreover
for
every ν<κ+ we have
π(xν,i)<δi .
(b) If {i,j}∈[M]2 and xν,i⪯νxν,j, then xν,i=xν,j.
Proof.
If i∈D∪M, then
(F) and (D)(c-d) imply that the sequence {π(xν,i):ν<κ+}
is strictly increasing. Hence cf(δi)=κ+
and π(xν,i)<δi
for i∈D∪M.
Thus
Proposition 2.5
implies \mboxsup(J(δi))=δi.
Thus (a) holds.
(D)(d) and condition (P3) imply (b).
∎
We put
[TABLE]
Since π′′A△={δi:i∈K} we have π′′A△⊂Z0.
Then, we define Z as the closure of Z0 with respect
to I:
[TABLE]
Observe that
[TABLE]
By Claim 2.10(a),
the sequence ⟨π(xν,i):ν<κ+⟩ is strictly increasing
for i∈D∪M.
Since ∣Z∣<κ, and ∣o∗(xν,k)∣≤κ for xν,k∈BS∩A△, we can assume that
- (G)
π(xν,i)∈/o∗(xν,k) for xν,k∈BS∩A△ and i∈D∪M.
Our aim is to prove that there are ν<μ<κ+ such that the forcing
conditions rν and rμ are compatible. However, since we are
dealing with infinite forcing conditions, we will need to add new elements to
Aν∪Aμ in order to be able to define the infimum of pairs of
elements {x,y} where x∈Aν∖Aμ and y∈Aμ∖Aν. The following definitions will be useful to
provide the room we need to insert the required new elements.
Let
[TABLE]
and
[TABLE]
Assume that i∈σ1∪σ2. Let
[TABLE]
Since ∣Z∣<κ≤cf(δi), the ordinal ξi is defined and
δi>ϵξiJ(δi).
Then, if i∈σ1 we put
[TABLE]
and if i∈σ2 we put
[TABLE]
For i∈σ2,
since
γ(δi)<δi and δi=lim{π(xν,i):ν<κ+}
by Claim 2.10(a) for all i∈D∪M,
we can assume that
- (H)
π(xν,i)∈J(δi)∖γ(δi), and so π(xν,i)∈/Z,
for all i∈D∪M.
We will use the following
fundamental facts.
Claim 2.11**.**
If xν,i⪯νxν,j then δi≤δj.
Proof.
xν,i⪯νxν,j implies π(xν,i)≤π(xν,j) by (P2).
∎
Claim 2.12**.**
Assume i,j∈σ. If xν,i⪯νxν,j then either
δi=δj or there is a∈A△∩BS with xν,i⪯νa⪯νxν,j.
Proof.
Assume that i,j∈K and
δi=δj. By Claim 2.11, we have δi<δj. Since i∈F∪M and
xν,i⪯νxν,j
imply xν,i=xν,j
and so δi=δj, we
have that i∈D, and so π(xν,i)<δi, \mboxcf(δi)=κ+ and J(δi)+=δi by
Proposition 2.5 .
Since δi<δj,
we have δi<γ(δj)<π(xν,j) by (H), and so
J(δi) separates
xν,i from xν,j.
By (P6), we infer
that there is an a=xν,k∈Aν such that
π(a)=δi and xν,i⪯νa⪯νxν,j.
Since xν,k=xν,j, we have xν,k∈BS, and so k∈K∪D.
But as π(xν,k)=δi∈Z we obtain k∈/D by (H), and so k∈K, which implies a=xν,k∈A△∩BS.
∎
Claim 2.13**.**
If xν,i∈A△∩BS
and xν,j∈Aν are compatible but incomparable in rν, then
xν,k=iν{xν,i,xν,j}∈A△∩BS.
Proof.
First, (P2) implies xν,k∈BS.
Since
π(xν,k)=π(iν{xν,i,xν,j})∈f{xν,i,xν,j}=o∗(xν,i)∩o∗(xν,j)⊂o∗(xν,i) by (P5), and xν,i∈A△∩BS, we have k∈/D∪M by (G).
Thus k∈K, and so xν,k∈A△.
Hence xν,k=iν{xν,i,xν,j}∈A△∩BS.
∎
Claim 2.14**.**
Assume that xν,i
and xν,j are compatible but incomparable in rν. Let
xν,k=iν{xν,i,xν,j}. Then either xν,k∈A△ or
δi=δj=δk.
Proof.
Assume xν,k∈A△, i.e. k∈K. If
δk=δi, we infer that there is b∈A△∩BS
with xν,k⪯νb⪯νxν,i by Claim
2.12.
So
xν,k=iν{b,xν,j} and thus xν,k∈A△ by Claim 2.13,
contradiction.
Thus δi=δk, and similarly
δj=δk.
∎
Definition 2.15**.**
{rν,rμ} is a good pair iff
for all \{i,j\}\in\bigl{[}{F}\bigr{]}^{2} with δi=δj and
cf(δi)=κ+ we have
[TABLE]
Claim 2.16**.**
There are ν<μ<κ+ such that the pair {rν,rμ} is good.
Proof.
Let
[TABLE]
Since F is a κ+-strongly unbounded function on λ
we can find
ν<μ<κ+ such that for all
\{i,j\}\in\bigl{[}{F}\bigr{]}^{2} with δi=δj and
cfδi=κ+ we have
[TABLE]
Hence (▲ ‣ 2.15) holds.
∎
To finish the proof of Lemma 2.8 we will show that
[TABLE]
So, assume that {rν,rμ} is a good pair.
Write
δxν,i=δxμ,i=δi.
If s=xν,i write s∈K iff i∈K. Define s∈F, s∈M, s∈D similarly.
In order to amalgamate conditions rν and rμ, we will use a
refinement of the notion of amalgamation given in [6, Definition
2.4].
Let
A′={xν,i:i∈F∪D∪M}. For x∈(Aν∖Aμ)∪(Aμ∖Aν) define the twin x′ of x in a natural way:
x′=hν,μ(x) for x∈Aν∖Aμ, and
x′=hν,μ−1(x) for x∈Aμ∖Aν.
Let rk:⟨A′,⪯ν↾A′⟩⟶θ be an
order-preserving injective function for some ordinal
θ<κ,
and for x∈A′ let
[TABLE]
Since
cf(γ(δx))=κ
and ∣A′∣<κ we have
[TABLE]
For x∈A′ let
[TABLE]
and put
[TABLE]
So, for every x∈A′, yx∈BS with π(yx)<π(x).
Define functions g:Y⟶Aν and gˉ:Y⟶Aμ as follows:
[TABLE]
where x′ is the “twin” of x in Aμ.
Now, we are ready to start to define the common
extension r=⟨A,⪯,i⟩ of rν and rμ. First, we define
the universe A as
[TABLE]
Clearly, A satisfies (P1). Now, our purpose is to define
⪯.
Extend the definition of g as follows: g:A⟶Aν is a
function,
[TABLE]
We introduce
two relations on Ap∪Aq∪Y as follows:
[TABLE]
Then, we put
[TABLE]
The following claim is well-known and straightforward.
Claim 2.17**.**
⪯ν,μ=⪯↾(Aν∪Aμ)* is the
partial order on Aν∪Aμ generated by ⪯ν∪⪯μ.*
The following straightforward claim
will be used several times in our arguments.
Claim 2.18**.**
If x⪯z then g(x)⪯νg(z).
Sublemma 2.19**.**
⪯* is a partial
order on Aν∪Aμ∪Y.*
Proof.
We should check that ⪯ν is transitive, because it is trivially reflexive and antisymmetric.
So
let s⪯t⪯u. We should show that s⪯u.
Since x⪯z implies g(x)⪯νg(z), we have
g(s)⪯νg(t)⪯νg(u) and so
[TABLE]
If ⟨s,u⟩∈(Y×A)∪(Aν×Aν)∪(Aμ×Aμ),
then \eqrefeq:gsgr implies s⪯R1u or s⪯νu or s⪯μu, which implies s⪯u by
(★ ‣ 2).
So we can assume that s∈Aν (the case s∈Aμ is similar), and so
u∈Y or u∈Aμ.
Case 1**.**
u∈Aμ.
If t∈Aν∪Aμ, then s⪯ν,μt⪯ν,μu, and so s⪯ν,μu by Claim
2.17. So s⪯u.
Assume that t∈Y. Then s⪯R2t, and so
there is a∈A△ such that g(s)⪯νa⪯νg(t). Since t⪯u implies g(t)⪯νg(u),
we have g(s)⪯νa⪯νg(u), and so s⪯R2u. Thus s⪯u.
Case 2**.**
u∈Y.
If t∈Y, then s⪯R2t, and so
there is a∈A△ such that g(s)⪯νa⪯νg(t). Since t⪯u implies g(t)⪯νg(u),
we have g(s)⪯νa⪯νg(u), and so s⪯R2u. Thus s⪯u.
Assume that t∈Aν∪Aμ. Then t⪯R2u, and so there is
a∈A△ such that g(t)⪯νa⪯νg(u).
Then g(s)⪯νa⪯νg(u), and so s⪯R2u. Thus s⪯u.
∎
So, by the previous Sublemma 2.19 and by the construction,
(P2) and (P3) hold for ⪯.
Next
define the function \operatorname{i}:\bigl{[}{A}\bigr{]}^{2}\longrightarrow A\cup\{\text{\rm undef}\}
as follows:
[TABLE]
and for \{s,t\}\in\bigl{[}{A}\bigr{]}^{2}\setminus(\bigl{[}{A_{\nu}}\bigr{]}^{2}\cup\bigl{[}{A_{\mu}}\bigr{]}^{2})
such that s and t are ⪯-compatible, put
i{s,t}=i{s,ys}=i{t,ys}=ys if s∈A′
and t=s′, and otherwise
consider the element
[TABLE]
and let
[TABLE]
Let
[TABLE]
if s and t are not ⪯-compatible.
If s and t are compatible, then so are g(s) and g(t)
because x⪯y implies g(x)⪯νg(y) by Claim 2.18.
Moreover iν{s,t}=iμ{s,t} for \{s,t\}\in\bigl{[}{{A_{\vartriangle}}}\bigr{]}^{2}
by condition (C)(e),
so the definition above is meaningful, and gives a function i.
Claim 2.20**.**
If v∈A△ and s∈A, then
π(v)∈o∗(g(s)) iff π(v)∈o∗(s).
Proof.
If s∈Aν∪Aμ then g(s)=s or g(s)=s′, and so
π(v)∈o∗(g(s)) iff π(v)∈o∗(s) by (C)(b) and (C)(h).
Consider now the case s=yx∈Y.
Then
π(s)∈E(J(δx))∩[γ(δx),γ(δx)), and so
[TABLE]
We distinguish the following two cases.
Case 1**.**
π(x)<δx.
If x∈BS then γ(δx)<π(x)<δx
by (H),
and so
[TABLE]
If x∈/BS then x∈M and
γ(δx)<π(x)<δx
by (H), and so
[TABLE]
Case 2**.**
π(x)=δx.
Then x∈F and so
[TABLE]
so o∗(s)∩π(s)=o∗(x)∩π(s).
So in both cases o∗(s)∩π(s)=o∗(x)∩π(s). Also, note that
as v∈A△, we have that
π(v)∈/(γ(δx),δx),
and hence if v∈o∗(g(s)) then π(v)<π(s). So,
π(v)∈o∗(x)=o∗(g(s)) iff π(v)∈o∗(s).
∎
Claim 2.21**.**
If \{s,t\}\in\bigl{[}{A}\bigr{]}^{2}, v∈A△ and
π(v)∈f{g(s),g(t)} then π(v)∈f{s,t}.
Proof.
We should distinguish two cases.
Case 1**.**
f{s,t}=o∗(s)∩o∗(t).
Since
f{g(s),g(t)}=o∗(g(s))∩o∗(g(t))
we have π(v)∈o∗(g(s))∩o∗(g(t)).
Since π(v)∈o∗(g(s)) implies π(v)∈o∗(s)
and π(v)∈o∗(g(t)) implies π(v)∈o∗(t)
by Claim 2.20, we have π(v)∈f{s,t}.
Case 2**.**
\operatorname{f}\{s,t\}=o(s)\cup\big{\{}{\epsilon}^{\pi(s)}_{\zeta}:\zeta<F\{\rho(s),\rho(t)\}\big{\}}.
We can assume that s∈Aν∖Aμ and t∈Aμ∖Aν.
Then s,t∈F, δ′=δs=δt has cofinality κ+
and so g(s),g(t)∈F and δg(s)=δg(t)=δ′
and so
[TABLE]
Since π′′A△∩(γ(δ′),δ′)=∅,
(△ ‣ 2) implies
[TABLE]
But, by (▲ ‣ 2.15)
[TABLE]
and so π(v)∈f{s,t}.
∎
Sublemma 2.22**.**
⟨A,⪯,i⟩* satisfies
(P4) and (P5).*
Proof.
Let \{s,t\}\in\bigl{[}{A}\bigr{]}^{2} be a pair of ⪯-incomparable and
⪯-compatible
elements.
Case 1**.**
\{s,t\}\in\bigl{[}{A_{\nu}}\bigr{]}^{2}. (The case \{s,t\}\in\bigl{[}{A_{\mu}}\bigr{]}^{2} is similar)
Since ⪯ν⊂⪯, we have iν{s,t}⪯s,t,
so to check (P4) we should show that x⪯s,t implies
x⪯iν{s,t}.
We can assume that x∈/Aν.
If x∈Y, then x⪯R1s and
x⪯R1t, i.e. g(x)⪯νg(s),g(t) and so
g(x)⪯νiν{g(s),g(t)}=iν{s,t}=g(iν{s,t}), and so x⪯R1iν{s,t}.
Thus x⪯iν{s,t}.
If x∈Aμ∖Aν, then x⪯R2s and
x⪯R2t, i.e. g(x)⪯νa⪯νg(s) and g(x)⪯νb⪯νg(t)
for some a,b∈A△. Then c=iν{a,b}∈A△, and so
g(x)⪯νc⪯νiν{g(s),g(t)}=iν{s,t}=g(iν{s,t}), and so x⪯R2iν{s,t}.
Thus x⪯iν{s,t}.
Finally
(P5) holds in Case 1 because rν satisfies (P5).
Case 2**.**
\{s,t\}\notin\bigl{[}{A_{\nu}}\bigr{]}^{2}\cup\bigl{[}{A_{\mu}}\bigr{]}^{2}.
To check (P4) we should prove that
i{s,t} is the greatest common lower bound of
s and t in ⟨A,⪯⟩.
Assume first that s and t are not twins. Note that by Claim 2.18,
g(s) and g(t) are ⪯ν-compatible.
Write v=iν{g(s),g(t)}.
Case 2.1**.**
v∈A△, and so i{s,t}=v.
Since v=g(v)⪯νg(s) and v∈A△, we have v⪯R2s.
Similarly v⪯R2t. Thus v is a common lower bound of s and t.
To check that v is
the greatest lower bound of s,t in ⟨A,⪯⟩
let w∈A, w⪯s,t. Then
g(w)⪯νg(s),g(t).
Thus g(w)⪯νiν{g(s),g(t)}=v.
Since v∈A△,
g(w)⪯νv implies w⪯R2v. Thus w⪯v. Thus (P4) holds.
To check (P5)
observe that g(s) and g(t) are incomparable in Aν.
Indeed, g(s)⪯νg(t) implies v=g(s)∈A△ and so
g(s)⪯νg(t) implies s⪯R2t, which contradicts our assumption
that s and t are ⪯-incomparable.
Thus, by applying (P5) in rν,
[TABLE]
Thus π(v)∈f{s,t} by Claim 2.21, and so (P5)
holds.
Case 2.2**.**
v∈/A△, and so i{s,t}=yv.
If g(s) and g(t) are
⪯ν-comparable then δg(s)=δg(t), because otherwise
we would infer from Claim 2.12 that
s,t are ⪯-comparable, which is
impossible.
Now assume that
g(s) and g(t) are
⪯ν-incomparable.
If δv<δg(s), then there is a∈A△∩BS
with v⪯νa⪯νg(s) by Claim 2.12. Thus v=iν{a,g(t)} and so v∈A△
by Claim 2.13.
Thus δv=δg(s), and similarly δv=δg(t).
Hence we have
[TABLE]
in both cases.
Thus
[TABLE]
If s,t∈F and cf(δv)=κ+, by condition (▲ ‣ 2.15), we deduce that
E(J(δv))∩γ(δv)⊂f{s,t}, and so as
π(yv)<γ(δv), we have π(yv)∈f{s,t}. Otherwise,
[TABLE]
Then as v=iν{g(s),g(t)}, we have π(v)<π(g(s)),π(g(t)), hence
π(yv)<π(s),π(t) and thus π(yv)∈f{s,t}.
Thus (P5) holds.
To check (P4)
first we show that yv⪯s,t. Indeed g(v)⪯νg(s) implies
yv⪯R1s. We obtain yv⪯R1t similarly.
Let w⪯s,t.
Assume first that
δg(w)<δv.
Since w⪯s,t we have g(w)⪯νg(s),g(t) by Claim 2.18
and hence g(w)⪯νiν{g(s),g(t)}=v. By Claim 2.12 there is a∈A△
such that g(w)⪯νa⪯νv.
Thus w⪯R2yv.
Assume now that
δg(w)=δv.
Then, we have that w∈Y. To check this fact,
assume on the contrary that w∈Aν∪Aμ. So, we have δw=δg(w)=δv=δg(s)=δg(t).
Note that if s∈Y, then
π(s)∈[γ(δw),γ(δw)), which contradicts the
assumption that w⪯s. So s∈/Y, and analogously t∈/Y.
Assume that w∈Aν. As w⪯s,t and
[γ(δv),J(δv)+)∩Z=∅, it follows that s,t∈Aν,
which was excluded. Analogously, w∈Aμ implies s,t∈Aμ.
Therefore, w=yz for some z∈A′.
Then z⪯νg(s) and z⪯νg(t),
and so z⪯νiν{g(s),g(t)}=v.
Thus yz⪯R1yv.
If s and t are twins, then s∈A′ implies that i{s,t}=ys and we can proceed as above in Case 2.2.
So we proved Sublemma 2.22.
∎
Sublemma 2.23**.**
⟨A,⪯,i⟩*
satisfies (P6).*
Proof.
Assume that \{s,t\}\in\bigl{[}{A}\bigr{]}^{2}, s⪯t and Λ
separates s from t, i.e,
[TABLE]
We should find v∈A
such that s⪯v⪯t and π(v)=Λ+.
Note that since s⪯t, we have δg(s)≤δg(t) by Claim 2.11.
We can assume that
\{s,t\}\notin\bigl{[}{A_{\nu}}\bigr{]}^{2}\cup\bigl{[}{A_{\mu}}\bigr{]}^{2}
because rν and rμ satisfy (P6).
Case 1**.**
δg(s)<δg(t).
As g(s)⪯νg(t), there is
a∈A△∩BS with g(s)⪯νa⪯νg(t)
by Claim 2.12.
Case 1.1**.**
π(a)∈Λ.
Thus Λ separates a from g(t).
Applying (P6) in rν for a and g(t) and Λ we obtain b∈Aν
such that a⪯νb⪯νg(t) and π(b)=Λ+.
Note that as π(a)∈Λ,a∈A△ and π(b)=Λ+, we have that π(b)∈Z.
Thus b∈A△ by (H).
Thus g(s)⪯νb⪯νg(t) implies s⪯R2b⪯R2t, and so s⪯b⪯t.
Case 1.2**.**
π(a)∈/Λ.
If Λ+=π(a), then we are done because
g(s)⪯νa⪯νg(t) implies s⪯a⪯t.
So we can assume that Λ+<π(a).
Since rν and rμ satisfy (P6) and Λ separates s from a,
we can assume that s∈/Aν∪Aμ.
Hence s=yg(s) and
Λ separates g(s) from a because
π(s)∈J(δg(s))⊂Λ.
(If Λ⊊J(δg(s)), then Λ−<π(s)<Λ+
is not possible.)
Thus there is b∈Aν such that g(s)⪯νb⪯νa and π(b)=Λ+.
Since δg(s)∈Z0, we have π(b)∈Z, and so b∈A△
by (H).
Thus s=yg(s)⪯R1b⪯R2t, and so s⪯b⪯t.
Case 2**.**
δg(s)=δg(t).
We will see that this case is not possible.
Case 2.1**.**
s∈Aν.
As s⪯t and [γ(δs),J(δs)+)∩Z=∅
we have that t∈/Aμ.
Since s∈Aν, s⪯t and δs=δg(t)
we have t∈/Y, and so t∈Aν,
which was excluded.
By means of a similar argument, we can show that s∈Aμ
is also impossible.
Case 2.2**.**
s=yg(s).
Then π(s)∈E(J(δg(s))) and so
Λ−<π(s)<Λ+ implies
J(δg(s))⊂Λ.
But then π(t)≤Λ+, so
Λ can not separate s from t.
Thus (P6) holds.
Thus we proved Sublemma 2.23.
∎
Thus we proved that r is a common extension of rν and rμ.
This completes the proof of Lemma 2.8, i.e. P satisfies
κ+-c.c.
∎