This paper investigates club principles and the nonsaturation of the nonstationary ideal on regular uncountable cardinals, aiming to improve existing results by constructing towers of various lengths to demonstrate nonsaturation.
Contribution
It extends previous work by considering non-normal ideals and constructing towers of length possibly greater than ^+ to witness nonsaturation.
Findings
01
Established new conditions for nonsaturation of ideals.
02
Constructed towers of length exceeding ^+ in certain models.
03
Improved bounds related to club principles and nonstationary ideals.
Abstract
We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a (non necessarily normal) ideal J extending the nonstationary ideal on a regular uncountable (non necessarily successor) cardinal κ, our goal being to witness the nonsaturation of J by the existence of towers (of length possibly greater than κ+).
Peer Reviews
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 Topology and Set Theory · Rings, Modules, and Algebras · Mathematical and Theoretical Analysis
Full text
TOWERS AND CLUBS
Pierre MATET
Abstract
We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a (non necessarily normal) ideal J extending the nonstationary ideal on a regular uncountable (non necessarily successor) cardinal κ, our goal being to witness the nonsaturation of J by the existence of towers (of length possibly greater than κ+).
We will show that by modifying the proofs of some well-known results concerning non-saturation of the nonstationary ideal NSκ, one may obtain towers in (P(κ)/NSκ,⊆) or/and (P(κ)/NSκ,⊇). Since these proofs usually involve one form or another of Club, we are led to revisit a number of results concerning this principle and its (many) variants.
2 DIAMOND LITE
2.1 Ideals and density
Let us first recall some definitions and facts that will be needed later. We start with ideals.
DEFINITION 2.1**.**
For a set A and a cardinal ρ, we set Pρ(A)={a⊆A:∣a∣<ρ} and [A]ρ={a⊆A:∣a∣=ρ}.
Throughout the paper κ will denote a regular uncountable cardinal.
DEFINITION 2.2**.**
By an ideal onκ we mean a nonempty collection J of subsets of κ such that
•
κ∈/J.
•
κ⊆J ;
•
P(A)⊆J for all A∈J.
•
A∪B∈J whenever A,B∈J.
Given an ideal J on κ, we let J+=P(κ)∖J, J∗={A⊆κ:κ∖A∈J}, and J∣A={B⊆κ:B∩A∈J} for each A∈J+. J is prime if J+=J∗, and nowhere prime if J∣A is prime for no A∈J+.
J is κ-complete if ⋃Q∈J for every Q∈Pκ(J). For a cardinal ρ and Y⊆P(κ), J is Y-ρ-saturated if there is no Q⊆J+ with ∣Q∣=ρ such that A∩B∈Y for any two distinct members A,B of Q.
J is ρ-saturated if it is J-ρ-saturated.
J is subnormal if J⊆K for some normal ideal K on κ.
DEFINITION 2.3**.**
We let Iκ and NSκ denote, respectively, the noncofinal ideal on κ and the nonstationary ideal on κ.
We let Cκ denote the collection of all closed unbounded subsets of κ.
For A⊆κ, we let acc(A)={α∈κ∖{0}:sup(A∩α)=α}.
DEFINITION 2.4**.**
Given a cardinal θ, Eθκ (respectively, E<θκ, E≥θκ) denotes the set of all α∈acc(κ) with cf(α)=θ (respectively, cf(α)<θ, cf(α)≥θ).
DEFINITION 2.5**.**
Let S be a stationary subset of κ. For γ∈E≥ω1κ, Sreflects atγ if S∩γ is stationary in γ.
REMARK 2.6*.*
If S⊆Eθκ reflects at γ, then cf(γ)>θ.
We next turn to density numbers and meeting numbers.
DEFINITION 2.7**.**
Given two cardinals τ≤σ with 1≤τ and ω≤σ, d(τ,σ) (respectively, m(τ,σ)) denotes the least cardinality of any X⊆[σ]τ with the property that for any e∈[σ]τ, there is x∈X with x⊆e (respectively, ∣x∩e∣=τ).
REMARK 2.8*.*
Thus d(τ,σ)= the cofinality of the poset ([σ]τ,⊇).
DEFINITION 2.9**.**
Given two infinite cardinals τ≤σ, MADτ,σ denotes the collection of all Q⊆[σ]τ such that
•
∣a∩b∣<τ for any two distinct members a,b of Q ;
•
for any c∈[σ]τ, there is a∈Q with ∣a∩c∣=τ.
FACT 2.10**.**
([21], [27], [29])* Let τ≤σ be two infinite cardinals. Then the following hold :*
(i)
σ≤d(τ,σ)≤στ.
2. (ii)
d(τ,σ)=σ* if and only if cf(σ)=cf(τ) and d(τ,χ)≤σ for any cardinal χ with τ≤χ<σ.*
3. (iii)
Suppose that χ<τ≤σ<χτ for some cardinal χ. Then d(τ,σ)=στ.
4. (iv)
d(τ,χ)≤d(τ,σ)* for any cardinal χ with τ≤χ≤σ.*
5. (v)
d(τ,σ+)=max{d(τ,σ),σ+}.
6. (vi)
Suppose that σ is a limit cardinal with cf(σ)=cf(τ). Then d(τ,σ)=sup{d(τ,χ):τ≤χ<σ}.
7. (vii)
If σ<τ+cf(τ), then d(τ,σ)=max{d(τ,τ),σ}.
8. (viii)
d(τ,σ)≥∣Q∣* for all Q∈MADτ,σ.*
9. (ix)
If d(τ,τ)<d(τ,σ), then ∣Q∣=d(τ,σ) for all Q∈MADτ,σ.
10. (x)
d(τ,σ)=max{d(τ,τ),m(τ,σ)}*.
*
DEFINITION 2.11**.**
Shelah’s Strong Hypothesis (SSH) asserts that pp(χ)=χ+ for every singular cardinal χ.
Let ρ be an uncountable strong limit cardinal, and σ≥ρ be a cardinal. Then there is α<ρ such that for any infinite cardinal τ with α≤τ≤ρ, d(τ,σ) equals σ if α≤cf(τ), and d(cf(τ),σ) otherwise.
2. (ii)
Suppose that ρ<κ is an uncountable strong limit cardinal, and κ is a limit cardinal. Then we may find χ<ρ with the following property : If τ is a regular cardinal with χ≤τ<ρ, then d(τ,σ)<κ for every cardinal σ with τ≤σ<κ.
2.2 J’enlève le haut
Our starting point is a result of Gregory on diamond star. The following guessing principles were introduced by Jensen [20].
DEFINITION 2.14**.**
Given a κ-complete ideal J on κ, ♢κ∗[J] (respectively, ♢κ−[J]) asserts the existence of tαi⊆α for i<α<κ such that {α<κ:∃i<α(tαi=A∩α)} lies in J∗ (respectively, J+) for every A⊆κ.
♢κ[J] asserts the existence of sα⊆α for α<κ such that {α<κ:sα=A∩α} lies in J+ for every A⊆κ.
REMARK 2.15*.*
(i)
If ♢κ∗[J] holds, then so does ♢κ∗[K] for any κ-complete ideal K on κ extending J.
2. (ii)
♢κ∗[J]⇒♢κ−[J].
3. (iii)
♢κ[J]⇒♢κ−[J].
FACT 2.16**.**
(i)
([25], [30])* Suppose that either κ is a successor cardinal, or J is normal. Then ♢κ−[J]⇒♢κ[J].*
2. (ii)
(Folklore)* If ♢κ[J] holds, then J is not Iκ-2κ-saturated.*
Gregory’s result [18] asserted that if κ=ν+=2ν, then ♢κ∗[NSκ∣Eθκ] holds for any regular infinite cardinal θ with νθ=ν. It was later strengthened by Shelah ([40], [42]) and others ([38], [27]). Its present form (not necessarily the final one) reads as follows.
FACT 2.17**.**
Suppose that κ=ν+=2ν, and let θ be a regular infinite cardinal less than ν such that d(θ,ν)=ν. Then ♢κ∗[NSκ∣Eθκ] holds.
Let us discuss the requirement that d(θ,ν)=ν. By Facts 2.10 (x) and 2.12, under SSH, it reduces to the condition that d(θ,θ)≤ν (which will be satisfied if κ is large enough) and θ=cf(ν). On the other hand, if there is a strong limit cardinal τ with θ<τ<κ, and θ is large enough, then by Fact 2.13, d(θ,ν)=ν will hold. So there are many cases when the condition d(θ,ν)=ν is satisfied. But what can be said when it is not ? Shelah has the following answer.
FACT 2.18**.**
([47])* Suppose that κ=ν+=2ν, and let θ be a regular infinite cardinal less than κ with θ=cf(ν). Then ♢κ[J] holds for any κ-complete ideal on κ extending NSκ∣Eθκ.*
Notice that the result also applies to ideals that are not normal. Of course if ♢κ[K] holds for some normal ideal on κ, then so does ♢κ[J] for any κ-complete ideal J on κ included in K. So the ideals that would not be covered if the result were only stated for normal ideals are those that are not subnormal. The following result provides a description of these ideals.
FACT 2.19**.**
([3])* Given a κ-complete ideal J on κ, the following are equivalent :*
(i)
J* is not subnormal.*
2. (ii)
There is a partition ⟨Sα:α<κ⟩ of κ∖{0} into stationary sets Sα with Sα∩(α+1)=∅ such that J extends the κ-complete ideal generated by NSκ∪{Sα:α<κ}.
Let us return to Shelah’s result. How does it look like if we go further and remove the remaining cardinal arithmetic hypothesis ? This paper originated in our desire to prove the following.
CONJECTURE 2.20**.**
Suppose that κ=ν+, and let θ be a regular infinite cardinal less than κ with θ=cf(ν). Then no κ-complete ideal on κ extending NSκ∣Eθκ is Iκ-κ+-saturated.
Why only κ+ ? Just to play it safe, since 2κ would not be suitable (Foreman and Magidor [11] showed that if V=L and σ Cohen subsets of ω1 are added, where σ≥κ++, then in the extension, NSκ is κ++-saturated).
2.3 J’enlève le bas
DEFINITION 2.21**.**
Given a κ-complete ideal J on κ, ♣κ[J]) asserts the existence of sα⊆α with supsα=α for α∈acc(κ) such that {α∈acc(κ):sα⊆A}∈J+ for all A∈[κ]κ.
The principle ♣κ∗[J] asserts the existence of sδi⊆α with supBαi=α for i∈α∈acc(κ) such that {α<κ:∃i<α(sαi⊆A)}∈J∗ for all A∈[κ]κ.
♣ω1[NSω1] is usually denoted by ♣ and known as Ostaszewski’s guessing principle.
It is easy to see that if J extends NSκ, then ♢κ[J] (respectively, ♢κ∗[J]) implies ♣κ[J] (respectively, ♣κ∗[J]). By a result of Devlin (see [35]), ♢ω1[NSω1] follows from CH + ♣. This easily generalizes.
OBSERVATION 2.22**.**
Given a κ-complete ideal J on κ extending NSκ, the following are equivalent :
(i)
♢κ[J]* holds.*
2. (ii)
♣κ[J]* holds and 2<κ=κ.*
Proof. By the proof of Observation 3.4 below.
□
The starred version is established by a similar argument.
OBSERVATION 2.23**.**
Given a κ-complete ideal J on κ extending NSκ, the following are equivalent :
(i)
♢κ∗[J]* holds.*
2. (ii)
♣κ∗[J]* holds and 2<κ=κ.*
Observation 2.23 improves a result of [13] that asserts that if κ=ν+ and τ is a regular infinite cardinal less than ν such that d(τ,σ)≤ν for every cardinal σ with τ≤σ<ν, then for any S∈NSκ+∩P(Eτκ), ♢κ∗[NSκ∣S] holds just in case ♣κ∗[NSκ∣S] holds and 2<κ=κ.
The consistency of ♣ with the negation of the Continuum Hypothesis (and therefore with the negation of ♢ω1[NSω1]) has been established by Shelah [41].
DEFINITION 2.24**.**
Given a κ-complete ideal J on κ, ♣κev[J] asserts the existence of sα⊆α with supsα=α for α∈acc(κ) such that {α∈acc(κ):∃β<α(sα∖β⊆A)}∈J+ for all A∈[κ]κ.
Obviously, ♣κ[J]⇒♣κev[J]. The principle ♣ω1ev[NSω1] is denoted by ♣w in [12], and by ♣1 in [8] where its consistency with the negation of ♣ is established.
It is known (see [7], [12]) that for any S∈NSκ+, ♣κ[NSκ+∣S] holds if and only if there is sα⊆α with supsα=α for α∈acc(κ) such that {α∈S∩acc(κ):sα⊆A)}=∅ for all A∈[κ]κ. This works also for the eventual-guessing variant.
OBSERVATION 2.25**.**
Given S∈NSκ+, the following are equivalent :
(i)
♣κev[NSκ+∣S].
2. (ii)
There is sα⊆α with supsα=α for α∈acc(κ) such that for any A∈[κ]κ, {α∈S∩acc(κ):∃β<α(sα∖β⊆A)}=∅.
Proof. (i) → (ii) : Trivial.
(ii)→ (i) : Let ⟨sα:α∈acc(κ)⟩ be as in (ii), and suppose toward a contradiction that (i) fails. Then there must be A∈[κ]κ and C∈Cκ∩P(acc(κ)) such that (sα∖β)∖A=∅ whenever α∈C∩S and β<α. Set B={min(A∖α):α∈C}. We may find α∈S∩acc(κ) and β<α such that sα∖β⊆B⊆A. But then C is cofinal in α, and consequently α∈C. Contradiction.
□
REMARK 2.26*.*
Assuming GCH in V, Baumgartner [2] has constructed a cofinality-preserving generic extension in which there is Si∈[κ]κ for i<κ+ such that ∣Si∩Sj∣<ℵ0 whenever i<j<κ+. In this extension, ♣κev[NSκ∣Eθκ] must fail for every regular infinite cardinal θ<κ, since it is well-known (see e.g.[12]) that ♣κev[NSκ∣Eθκ] implies the existence of X⊆[κ]θ with ∣X∣=κ such that for any A∈[κ]κ, there is x∈X with x⊆A.
Garti [14] observed that it follows from ♣ that NSω1 is not Iω1-ω2-saturated. An easy modification of his proof yields the following.
OBSERVATION 2.27**.**
Let J be a κ-complete ideal on κ such that ♣κev[J] holds, and ρ be an infinite cardinal such that Iκ is not ρ-saturated. Then J is not Iκ-ρ-saturated.
Proof. Let sα⊆α with supsα=α for α∈acc(κ) be such that for any A∈[κ]κ, SA∈J+, where
SA={α∈acc(κ):∃β<α(sα∖β⊆A)}.
Pick Ai∈[κ]κ for i<ρ so that ∣Ai∩Aj∣<κ whenever i<j<ρ. We claim that ∣SAi∩SAj∣<κ whenever i<j<ρ. Suppose otherwise, and fix i<j<κ such that ∣SAi∩SAj∣=κ. Inductively define αξ∈SAi∩SAj and γξ∈sαξ∩Ai∩Aj for ξ<κ so that γξ>sup{αη:η<ξ}. Then {γξ:ξ<κ} is a size κ subset of Ai∩Aj. Contradiction.
□
Let us now introduce the kind of towers we will be working with.
DEFINITION 2.28**.**
Given an ideal J on κ, Y⊆P(κ) and an ordinal δ, a descending (respectively, ascending) (J,Y)-tower of lengthδ is a sequence ⟨Aα:α<δ⟩ such that
•
Aα∈J+ for all α<δ ;
•
Aβ∖Aα∈Y (respectively, Aα∖Aβ∈Y) and Aα∖Aβ∈J+ (respectively, Aβ∖Aα∈J+) whenever α<β<δ.
A descending (respectively, ascending) (J,Y)-tower is maximal if there is no descending (respectively, ascending) (J,Y)-tower properly extending it.
OBSERVATION 2.29**.**
Let τ≥2 be a cardinal such that there exists a descending (respectively ascending) (J,Y)-tower of length τ. Then J is not Y-τ-saturated.
Proof. Let ⟨Aα:α<τ⟩ be an ascending (J,Y)-tower. For α<τ, set Sα=Aα+1∖Aα. Then clearly {Sα:α<τ}⊆J+. Furthermore Sγ∩Sα⊆Aγ+1∖Aα whenever γ<α<τ. Descending towers are handled in a similar way.
□
DEFINITION 2.30**.**
We let Depth([κ]κ,↗) (respectively Depth([κ]κ,↘)) denote the least ordinal η such that there is no ascending (respectively, descending) (Iκ,Iκ)-tower of length η.
THEOREM 2.31**.**
Let J be a κ-complete ideal on κ extending NSκ, and η be an infinite ordinal less than Depth([κ]κ,↘) (respectively Depth([κ]κ,↗)). Suppose that ♣κev[J] holds. Then there exists a descending (respectively, ascending) (J,Iκ)-tower of length η.
Proof. Select sα⊆α with supsα=α for α∈acc(κ) such that
{α:∃β<α(sα∖β⊆A)}∈J+
for all A∈[κ]κ. For A∈[κ]κ, let SA denote the set of all α∈acc(κ) such that sup(A∩α)=α>sup(sα∖A). Notice that SA∈J+. Now let ⟨Ai:i<η⟩ be an ascending (Iκ,Iκ)-tower. Fix i<j<η, and pick δ<κ so that Ai∖δ⊆Aj. Then SAi∖(δ+1)⊆SAj, and consequently ∣SAi∖SAj∣<κ. Moreover, SAj∖Ai⊆SAj∖SAi. Thus ⟨SAi:i<δ⟩ is an ascending (J,Iκ)-tower. The descending case is left to the reader.
□
Thus ♣κev[J] transmutes almost disjoint families of subsets of κ into almost disjoint families of sets in J+ of the same power, and descending (respectively, ascending) (Iκ,Iκ)-towers into descending (respectively, ascending) (J,Iκ)-towers of the same length.
2.4 Depths
To give some background to Theorem 2.31, in this subsection we discuss the existence of ascending (respectively, descending) towers.
DEFINITION 2.32**.**
Given f,g∈κκ , f<∗g means that
∣{α<κ:f(α)≥g(α}∣<κ.
DEFINITION 2.33**.**
We let bκ denote the least cardinality of any F⊆κκ with the property that there is no g∈κκ such that f<∗g for all f∈F.
REMARK 2.34*.*
By an argument that goes back to Rothberger, there exist fα∈κκ for α<bκ such that
•
fα<∗fβ for α<β<bκ ;
•
there is no g∈κκ such that fα<∗g for all α∈bκ.
Notice that it follows that bκ is regular.
FACT 2.35**.**
([1])* bκ is the least cardinality of any F⊆Cκ such that for any A∈[κ]κ, there is C∈F with ∣A∖C∣=κ.*
OBSERVATION 2.36**.**
(i)
bκ* is the least cardinality of any F⊆Cκ such that for any D∈Cκ, there is C∈F with ∣D∖C∣=κ.*
2. (ii)
There is a maximal descending (Iκ,Iκ)-tower of length bκ consisting of closed unbounded subsets of κ.
3. (iii)
Let S∈NSκ+ be such that NSκ∣S is not σ-saturated, where σ is an infinite cardinal less than or equal to bκ. Then NSκ∣S is not Iκ-σ-saturated.
Proof. (i) : Let F⊆Cκ with 0<∣F∣<bκ. By Fact 2.35, there must be A∈[κ]κ such that ∣A∖C∣<κ for all C∈F. Set D=acc(A).
Then clearly, D∈Cκ. Moreover, ∣D∖C∣<κ for all C∈F.
(ii) : By Fact 2.35, we may find Di∈Cκ for i<bκ such that for any A∈[κ]κ, there is i<bκ with ∣A∖Di∣=κ. We inductively define Ci∈Cκ as follows. Set C0=D0. Now suppose that i>0 and Cj has been constructed for each j<i. By (i), there is H∈Cκ such that ∣H∖Cj∣<κ for all j<i. We let Ci=H if i is a limit ordinal, and Ci=H∩acc(Ci−1) otherwise. It is easy to see that ⟨Ci:i<bκ⟩ is a descending (Iκ,Iκ)-tower.
(iii) : Select Aα∈(NSκ∣S)+ for α<σ such that Aβ∩Aα∈NSκ∣S whenever β<α<σ. For β<α<σ, pick Cβα∈Cκ such that (Aβ∩S)∩(Aα∩S)∩Cβα=∅. For each α<σ, there is by (i) Dα∈Cκ such that ∣Dα∖Cβα∣<κ for all β<α. Then clearly, ∣(Aβ∩S∩Dβ)∩(Aα∩S∩Dα)∣<κ whenever β<α<σ.
□
OBSERVATION 2.37**.**
(i)
Let J be a κ-complete ideal on κ. If there is a descending (J,J)-tower of length δ, where δ≤κ, then there is a descending (J,{∅})-tower of length δ.
2. (ii)
Let J be a normal ideal on κ. If there is a descending (J,J)-tower of length δ, where δ≤κ+, then there is a descending (J,Iκ)-tower of length δ.
3. (iii)
Let J=NSκ∣S for some S∈NSκ+. If there is a descending (J,J)-tower of length δ, where δ≤bκ, then there is a descending (J,Iκ)-tower of length δ.
Proof. We prove (iii) and leave the similar proofs of (i) and (ii) to the reader. Thus suppose that J=NSκ∣S, where S∈NSκ+, and ⟨Ai:i<δ⟩ is a descending (J,J)-tower of length δ, where 0<δ≤κ. We recursively define Bi∈J+∩P(Ai∩S) with Ai∖Bi∈J for i<δ as follows. Put B0=A0. Now suppose that i>0, and Bj has been constructed for every j<i. For each j<i, pick Cji∈Cκ so that (Ai∖Bj)∩S∩Cji=∅. By Fact 2.35, there must be Di∈Cκ such that ∣Di∖Cji∣<κ for all j<i. We set Bi=Ai∩S∩Di. Notice that given j<i, Bi∖Bj⊆Di∖Cji, and therefore ∣Bi∖Bj∣<κ. Furthermore, Bj∖Bi⊆(Aj∖Ai)∖(Aj∖Bj), and consequently Bj∖Bi∈J+.
□
OBSERVATION 2.38**.**
Let J be a κ-complete ideal on κ, and σ be a cardinal with 2≤σ≤κ. Then the following are equivalent :
(i)
J* is not σ-saturated.*
2. (ii)
There is a descending (J,{∅})-tower of length σ.
3. (iii)
There is an ascending (J,{∅})-tower of length σ.
Proof. (ii) → (i) and (iii) → (i) : By Observation 2.29.
(i) → (ii) and (iii) : Let Si∈J+ for i<σ be such that Si∩Sj∈J whenever j<i<σ. For i<σ, set Ti=Si∖(⋃j<iSj). Now we can define an ascending (J,{∅})-tower ⟨Ai:i<σ⟩ by Ai=⋃j≤iTj, and a descending (J,{∅})-tower ⟨Bi:i<σ⟩ by Bi=⋃i≤k<σTk.
□
OBSERVATION 2.39**.**
(i)
Let J be a κ-complete ideal on κ, δ be a nonzero ordinal, and ⟨Ai:i<δ⟩ be a maximal ascending (J,Y)-tower, where Y⊆P(κ). Then δ is a successor ordinal.
2. (ii)
Let J be a κ-complete, nowhere prime ideal on κ, δ be a nonzero ordinal, and ⟨Ai:i<δ⟩ be a maximal descending (J,Y)-tower, where Y is a subset of P(κ) closed under subsets. Then δ is not a successor ordinal.
Proof. (i) : Suppose otherwise. Put Aδ=⋃i<δAi. Then ⟨Aj:j≤δ⟩ is an ascending (J,Y)-tower. Contradiction.
(ii) : Suppose otherwise, and let δ=ξ+1. Then Aξ can be written as the disjoint union of two members of J+, say B0 and B1. Put Aδ=B0. Then ⟨Aj:j≤δ⟩ is a descending (J,Y)-tower. Contradiction.
□
OBSERVATION 2.40**.**
Let J be a κ-complete ideal on κ, and σ be a cardinal with 2≤σ≤κ such that J is not σ-saturated. Then the following hold :
(i)
Suppose σ≥ω. Then there is a maximal descending (J,{∅})-tower of length σ.
2. (ii)
There is a maximal ascending (J,{∅})-tower of length δ, where δ equals σ if σ<ω, and σ+1 otherwise.
Proof. Use (the proof of) Observations 2.38 and 2.39.
□
OBSERVATION 2.41**.**
Let J be a normal ideal on κ that is not κ-saturated. Then there is a maximal descending (J,J)-tower of length κ.
Proof. We use an argument that can be found in [49]. Pick a partition ⟨Aα:α<κ⟩ of κ into members of J+. Set B0=⋃0>α<κ(Aα∩(α+1)), and Bα=Aα∖(α+1) for 0<α<κ. Put Si=⋃α≥iBα for each i<κ. Now let S⊆κ be such that S∖Si∈J. for all i<κ. For each α<κ, we may find Cα∈J∗ such that S∩Bα∩Cα=∅. Then
S∩△α<κCα=⋃α<κ(S∩(Bα∩△α<κCα))⊆1,
and therefore S∈J. Thus ⟨Si:i<κ⟩ is a maximal descending (J,J)-tower.
□
Let J be a normal ideal on κ that is not κ+-saturated. Then there is a descending (J,J)-tower of length κ+.
Proof. Pick Aα∈J+ for α<κ+ such that Aβ∩Aα∈J whenever β<α<κ+. For κ≤α<κ+, select a bijection jα:κ→α and put Bα=△i<κ(κ∖Ajα(i)). Note that ∣Aβ∩Bα∣<κ for all β<α.
Claim 1. Let κ≤β<κ+. Then Aβ∖Bβ∈J.
Proof of Claim 1. Suppose otherwise. Define f:Aβ∖Bβ→κ by f(ξ)= the least i<ξ such that ξ∈Ajβ(i). There must be H∈J+∩P(Aβ∖Bβ) such that f is constant on H. This contradiction completes the proof of the claim.
Claim 2. Let κ≤β<α<κ+. Then Bβ∖Bα∈J+.
Proof of Claim 2. Clearly, Aβ∖(Bβ∖Bα) is a subset of (Aβ∖Bβ)∪(Aβ∩Bα) which by Claim 1 lies in J. Hence Bβ∖Bα∈J+, which completes the proof of the claim.
Claim 3. Let κ≤β<α<κ+. Then Bα∖Bβ∈J.
Proof of Claim 3. Suppose otherwise. Define g:Bα∖Bβ→κ by g(ξ)= the least i<ξ such that ξ∈Ajβ(i). We may find G∈J+∩P(Bα∖Bβ) and i<κ such that g takes the constant value i on G. Let k<κ be such that jβ(i)=jα(k). Then ξ≤k for all ξ∈G. This contradiction completes the proof of the claim and that of the proposition.
□
REMARK 2.43*.*
Suppose that in the proof above, the family {Aα:α<κ+} has the additional property that for any K∈J+, there is α with K∩Aα∈J+. Then our (J,J)-tower ⟨Bβ:κ≤β<κ+⟩ is maximal. To see this, recall that ∣Bβ∩Aα∣<κ whenever α<β and κ≤β<κ+. It follows that if W⊆κ is such that W∖Bβ∈J whenever κ≤β<κ+, then W∈J.
DEFINITION 2.44**.**
Depth(κκ) denotes the least ordinal η such that there is no increasing sequence ⟨fi:i<η⟩ in (κκ,<∗).
DEFINITION 2.45**.**
Depth(Cκ) denotes the least ordinal δ such that there is no sequence ⟨Ci:i<δ⟩ such that
•
Ci∈Cκ ;
•
Ci+1⊆acc(Ci) ;
•
∣Ci∖Cj∣<κ for all j<i.
OBSERVATION 2.46**.**
Depth(κκ)* (respectively, Depth(Cκ)) is not the successor of a successor ordinal.*
Proof. For the first inequality see the proof of Observation 2.36 (ii). To establish the second one, let ⟨Ci:i<δ⟩ be such that
•
Ci∈Cκ ;
•
Ci+1⊆acc(Ci) ;
•
∣Ci∖Cj∣<κ for all j<i.
For S⊆κ, let eS:o.t.(S)→S be the increasing enumeration of S. For i<δ, define fi∈κκ by fi(α)=eCi(α+1). Now fix i<δ. Then for any β<κ, eCi(β)≤eacc(Ci)(β). Hence for each α<κ,
fi(α)<eCi(α+ω)≤eacc(Ci)(α+1)≤fi+1(α).
Given i+1<j<δ, we may find ξ<η<κ such that Cj∖Ci+1⊆ξ and o.t.(Ci+1∩η)=η=o.t.(Cj∩η). Then clearly,
fi(α)<fi+1(α)≤fj(α)
whenever η≤α<κ.
For the last inequality, given an increasing sequence ⟨fi:i≤δ⟩ in (κκ,<∗), let
D denote the set of all α∈acc(κ) such that
•
fδ(β)<α for all β<α ;
•
ωα=α.
Now for each i<δ, set
Ci={α+ωfi(α)⋅γ:α∈D and γ<fi(α)<fδ(α)}.
It is not difficult to see that
•
Ci∈Cκ ;
•
Ci+1⊆acc(Ci) ;
•
∣Ci∖Cj∣<κ for all j<i.
□
DEFINITION 2.48**.**
For f∈κκ, let Mf={(α,β)∈κ×κ:β≥f(α)} and mf={(α,β)∈κ×κ:β≤f(α)}.
REMARK 2.49*.*
Since f⊆mf∩Mf, we have {mf,Mf}⊂[κ×κ]κ.
PROPOSITION 2.50**.**
Let f,g∈κκ be such that f<∗g. Then the following hold :
(i)
∣Mg∖Mf∣<κ, and moreover ∣Mf∖Mg∣=κ.
2. (ii)
∣mf∖mg∣<κ, and moreover ∣mg∖mf∣=κ.
Proof. Let γ<κ be such that f(α)<g(α) for all α≥γ. Then the following is readily checked :
By Theorem 2.31, Fact 2.47 and Corollary 2.51, ♣ω1ev[NSω1] implies the existence of a descending (respectively, ascending) (NSω1,Iω1)-tower of length bω1. Let us mention in this connection that by a result of Baumgartner and Tall [49], ♢ω1[NSω1] (and hence ♣ω1ev[NSω1]) + 2ℵ1>ℵ2 + PS is consistent, where PS asserts the following :
For any family F of less than 2ℵ1 many stationary subsets of ω1 with the property that △α<ω1f(α)∈NSω1+ for all f:ω1→F, there is a stationary subset T of ω1 such that ∣T∖S∣<κ for every S∈F.
Notice that it is immediate from Fact 2.35 that PS implies bω1=2ℵ1.
REMARK 2.53*.*
Suppose that the GCH holds in V, and let τ and σ be two regular cardinals with κ+≤τ<σ. Put Q=({0}×τ)∪({1}×σ). For q,r∈Q, let q<r just in case either q=(0,α) and r=(0,β), where α<β<τ, or q=(1,γ) and r=(1,δ), where γ<δ<σ. Notice that τ= the least size of any unbounded subset of Q. Furthermore Q is well-founded. Hence by a result of Cummings and Shelah [5], there is a κ-closed, κ+-cc notion of forcing P such that in VP,
•
bκ=τ.
•
There are fq∈κκ for q∈Q such that
(a)
for any g∈κκ, there is q∈Q with g<∗fq ;
2. (b)
for q,r∈Q, q<r if and only if fq<∗fr.
Thus in VP, Depth(κκ)>σ.
REMARK 2.54*.*
Gitik observes that there is a natural forcing (let P be the set of all (c,F) such that c is a closed subset of κ of size less than κ, and F∈Pκ(Cκ), with the obvious ordering) that adds C∈Cκ such that ∣C∖D∣<κ for every D in (Cκ)V. It can be iterated to any length, which tends to indicate that there is no nontrivial upper bound for Depth(Cκ).
2.5 Interdependent depths
Let us next discuss the following result of Shelah.
Let us consider a concrete situation where Fact 2.55 can be applied. In [33] Merimovich constructs from large large cardinals a number of models where GCH massively fails. To be specific let us choose a model VP in which there are an inaccessible cardinal θ and C in Cθ consisting of infinite cardinals such that for any infinite cardinal τ<θ, 2τ equals σ+3 if there is σ∈acc(C) such that σ≤τ<σ+3, and τ+ otherwise. As pointed out by Gitik to the author, it can be arranged that in VP , bσ+=2σ for every σ∈acc(C). Now working in VP, let ρ∈acc(C) be a singular cardinal of uncountable cofinality, and let ⟨ρi:i<cf(ρ)⟩ be an increasing, continuous sequence of singular cardinals in acc(C) with supremum ρ. Then pp(ρ)=2ρ=ρ+3. Hence by Lemma 9.2.9 in [19], there must be D∈Ccf(ρ) and a function f from D to the set of all regular infinite cardinals below ρ such that
•
tcf(∏f/J)=ρ+3, where J denotes the noncofinal ideal on C ;
•
for any i∈D,
ρi<f(i)≤ppcf(ρ)(ρi)≤2ρi=ρi+3.
Let I be the nonstationary ideal on C. Then by Lemma 3.17 of [19], tcf(∏f/I)=tcf(∏f/J)=ρ+3. Hence by Fact 2.55, Depth(Cρ+)>2(ρ+).
The interpretation is that Depth(Cρ+) depends on the Depth(Cρi+)’s . But what about bρ+ in such a situation ? Does it also depend on the bρi+’s ?
3 J’ENLEVE TOUT
3.1 Fromage ou dessert
Let us return to our starting point, when κ=ν+, θ is a regular cardinal less than ν, and J is a κ-complete ideal on κ extending NSκ∣Eθκ. We just saw that if ♣κev[J] holds, then there is a descending (respectively, ascending) (J,Iκ)-tower of length bκ. But what if ♣κev[J] fails ? To address this problem, we could weaken our club principle in a number of ways. We could for instance allow several guesses instead of just one.
DEFINITION 3.1**.**
Given a κ-complete ideal J on κ and a cardinal τ with 1≤τ<κ, ♣κ−/τ[J] asserts the existence of Bδi⊆δ with supBδi=δ for δ∈acc(κ) and i<τ such that
{δ∈acc(κ):∃i<τ(Bδi⊆W)}∈J+
for any W∈[κ]κ.
♣κ−[J] asserts the existence of Bδi⊆δ with supBδi=δ for δ∈acc(κ) and i<δ such that
{δ∈acc(κ):∃i<δ(Bδi⊆W)}∈J+
for any W∈[κ]κ.
Note that ♣κev[J]⇒♣κ−[J]. Furthermore, if Eτκ∈J∗, then ♣κev[J]⇒♣κ−/τ[J].
OBSERVATION 3.2**.**
(i)
Let ⟨Bδi:δ∈acc(κ)⟩ witness that ♣κ−/τ[J] holds, where J is a κ-complete ideal on κ, and τ a cardinal with 1≤τ<κ. Then for any W∈[κ]κ, there is i<τ such that {δ∈acc(κ):Bδi⊆W}∈J+.
2. (ii)
Let ⟨Bδi:δ∈acc(κ)⟩ witness that ♣κ−[J] holds, where J is a normal ideal on κ. Then for any W∈[κ]κ, there is i<κ such that {δ∈acc(κ)∖(i+1):Bδi⊆W}∈J+.
OBSERVATION 3.3**.**
(i)
Suppose that ♣κ−/τ[J] holds, where J is a κ-complete ideal on κ, and τ a cardinal with 1≤τ<κ, and let ρ be a cardinal such that cf(ρ)>τ and Iκ is not ρ-saturated. Then J is not Iκ-ρ-saturated.
2. (ii)
Suppose that ♣κ−[J] holds, where J is a normal ideal on κ, and let ρ be a cardinal such that cf(ρ)>κ and Iκ is not ρ-saturated. Then J is not Iκ-ρ-saturated.
Proof. By Observation 3.2 and the proof of Observation 2.27.
□
OBSERVATION 3.4**.**
Given a κ-complete ideal J on κ extending NSκ, the following are equivalent :
(i)
♢κ−[J]* holds.*
2. (ii)
♣κ−[J]* holds and 2<κ=κ.*
Proof. (i) → (ii) : Use Fact 2.16 (ii).
(ii)→ (i) : Let Bδi⊆δ with supBδi=δ for δ∈acc(κ) and i<δ be such that {δ∈acc(κ):∃i<δ(Bδi⊆W)}∈J+ for any W∈[κ]κ. For η<κ, define χη:P(η)→η2 by : χ(η)(a)(ξ)=1 if and only if ξ∈a. Select a bijection F:⋃η<κη2→κ. For δ∈acc(κ) and i<δ, put
sδi=⋃η<κ(⋃{a⊆η:F(χη(a))∈Bδi}).
Given A⊆κ, let D be the set of all δ∈acc(κ) such that sup{F(χζ(A∩ζ)):ζ≤α}<δ for all α<δ. Note that D belongs to NSκ∗ and hence to J∗. Now suppose that δ∈D and i<δ are such that Bδi⊆{F(χη(A∩η)):η<κ}.
Claim.sδi∩δ=A∩δ.
Proof of the claim.
⊆ : Let α∈sδi∩δ. We may find η<κ and a⊆η such that α∈a and F(χη(a))∈Bδi. Then clearly, F(χη(a))=F(χη(A∩η)), and therefore a=A∩η. Hence, α∈A∩δ.
⊇ : Let α∈A∩δ. There must be γ∈Bδi such that γ>sup{F(χζ(A∩ζ)):ζ≤α}. Let η<κ be such that γ=F(χη(A∩η)). Since η>α, we have that α∈A∩η. It follows that α∈sδi, which completes the proof of the claim and that of the observation.
□
There is another way to weaken ♣κev[J]. Instead of guessing eventually, we could content ourselves with guessing cofinally. But then we need an extra condition on our guess Bδ, otherwise we would achieve success too easily with Bδ=δ.
DEFINITION 3.5**.**
Given a κ-complete ideal J on κ and a cardinal σ<κ, ♣κcof/σ[J] asserts the existence of Bδ∈Pσ(δ) for δ<κ such that {δ:sup(W∩Bδ)=δ}∈J+ for any W∈[κ]κ.
♣κcof[J] asserts the existence of Bδ∈P∣δ∣(δ) for 0<δ<κ such that {δ:sup(W∩Bδ)=δ}∈J+ for any W∈[κ]κ.
Note that if Eθκ∈J∗, where θ+<κ, then ♣κev[J]⇒♣κcof/θ+[J].
We finally settle for a doubly weaker principle.
DEFINITION 3.6**.**
Let σ and τ be two cardinals with σ<κ and 1≤τ<κ, and J be a κ-complete ideal on κ. The principle ♣κcof/σ,−/τ[J] asserts the existence of Bδi∈Pσ(δ) for δ<κ and i<τ such that for any W∈[κ]κ,
{δ<κ:∃i<τ(sup(W∩Bδi)=δ)}∈J+.
♣κcof/σ,−[J] (respectively, ♣κcof,−[J]) asserts the existence of Bδi in Pσ(δ) (respectively, P∣δ∣(δ)) for i<δ<κ such that for any W∈[κ]κ,
{δ<κ:∃i<δ(sup(W∩Bδi)=δ)}∈J+.
It is easy to see that if ♣κcof,−[J] holds, then NSκ∗⊆J+. Notice that if κ=ν+, then ♣κcof/σ,−/ν[J] (respectively, ♣κcof/ν,−[J], ♣κ−/ν[J]) and ♣κcof/σ,−[J] (respectively, ♣κcof,−[J], ♣κ−[J]) are equivalent.
OBSERVATION 3.7**.**
Suppose that κ=ν+ and ♣κcof,−[J] holds. Then the following hold :
(i)
ν>ω.
2. (ii)
E<νκ∈J+, and moreover ♣κcof,−[J∣E<νκ] holds.
3. (iii)
Cκ⊆J+.
Assuming κ is a successor cardinal, ♣κcof,−[NSκ∣S] is denoted by ♣S− in [37] where, building on previous work by Džamonja and Shelah [7], Rinot proves that ♣S− implies that NSκ∣S is not κ+-saturated. Our presentation will closely follow his. We start with the following technical lemma.
LEMMA 3.8**.**
Suppose that κ=ν+, and J is a κ-complete ideal on κ such that ♣κcof,−[J] holds. Then there exist Aδi∈Pν(κ×κ) for δ<κ and i<ν such that for any F:κ→κ,
{δ<κ:∃i<ν∃Z⊆δ(supZ=δ and F∣Z⊆Aδi)}
lies in J+.
Proof. We follow the proof of Lemma 1.5 in [37]. Let Bδ∈Pκ(Pν(δ)) for δ<κ witness that ♣κcof,−[J] holds. Set χ=cf(ν). Let ⟨ξj:j<χ⟩ be an increasing sequence of infinite ordinals with supremum ν, and for each γ∈E=χκ, select Gγj⊆γ×γ for j<χ so that
•
∣Gγj∣≤∣ξj∣ ;
•
Gγk⊆Gγj for all k<j ;
•
⋃j<χGγj=γ×γ.
For δ<κ, let ⟨Aδi:i<ν⟩ be an enumeration of the set
{A:∃B∈Bδ∃j<χ(A=⋃{Gγj:γ∈B∩E=χκ})}.
Now fix F:κ→κ. Put X={γ∈E=χκ:∀α<γ(F(α)<γ)}.
Claim 1. Let γ∈X. Then F∣Y⊆Gγj for some cofinal subset Y of γ and some j<χ.
Proof of Claim 1. Pick a cofinal subset e of γ of order-type cf(γ). Define h:e→χ by h(α)=min{j<χ:(α,F(α))∈Gγj}. Then we may find Y⊆e with
∣Y∣=cf(γ), and j<χ such that h(α)≤j for all α∈Y. Clearly, Y and j are as desired, which completes the proof of the claim.
Using Claim 1, define g:X→χ by g(γ)= the least j such that F∣Y⊆Gγj for some cofinal subset Y of γ. Then we may find j<χ and a size κ subset W of X such that g takes the constant value j on W. Then S∈J+, where S={δ<κ:∃B∈Bδ(sup(W∩B)=δ)}.
Claim 2. Let δ∈S, and let B∈Bδ such that sup(W∩B)=δ. Then there exists a cofinal subset Z of δ such that F∣Z⊆⋃{Gγj:γ∈B∩E=χκ}.
Proof of Claim 2. For each γ∈Z∩B, select a cofinal subset Yγ of γ with F∣Yγ⊆Gγj. Then W=⋃{Yγ:γ∈Z∩B} is as desired,
which completes the proof of the claim and that of the lemma.
□
THEOREM 3.9**.**
Suppose that
•
κ=ν+* ;*
•
J* is a κ-complete ideal on κ such that ♣κcof,−[J] holds ;*
•
τ* is a regular cardinal less than Depth(κκ).*
Then there exists either an ascending (J,Iκ)-tower of length τ, or a descending (J,J)-tower of length τ.
Proof. The proof is a modification of that of Theorem 1.10 in [37]. Select fα∈κκ for α<τ such that fα<∗fβ whenever α<β<τ. Let Aδi∈Pν(κ×κ) for δ<κ and i<ν be as in the statement of Lemma 3.8. For each α<τ, pick iα<ν such that
Sα={δ∈E<νκ:∃W⊆δ(supW=δ and fα∣W⊆Aδiα)}
lies in J+. By thinning out our sequence of functions, we may assume that there is i<ν such that iα=i for all α<τ.
For δ∈E<νκ, put
Dδ={j<δ:∃r((j,r)∈Aδi)}
and
Rδ={r<δ:∃j((j,r)∈Aδi)}.
For δ∈E<νκ and α<τ, define fαδ:Dδ→Rδ by fαδ(j)=min((Rδ∪{κ})∖fα(j)). Finally, for α<β<τ, let
Sαβ={δ∈E<νκ:sup{j∈Dδ:fαδ(j)<fβδ(j)}=δ}.
Claim 1. Let α<β<τ. Then ∣Sα∖Sαβ∣<κ (and hence Sαβ∈J+).
Proof of Claim 1. Suppose not. Put m=sup{j<κ:fα(j)≥fβ(j)}, and pick δ∈Sα∖Sαβ with δ>m. Note that for any j∈Dδ with j>m, we have fα(j)<fβ(j) and hence fαδ(j)≤fβδ(j). Set n=sup{j∈Dδ:fαδ(j)=fβδ(j)}. Since δ∈/Sαβ, we have that n<δ. On the other hand, δ∈Sα, so there is a cofinal subset W of δ with fα∣W⊆Aδi. Now pick j∈W with j>max(n,m). Then (j,fα(j))∈Aδi, and consequently j∈Dδ. Hence fα(j)=fαδ(j)=fβδ(j)≥fβ(j). This contradiction completes the proof of the claim.
Claim 2. Let α<β<γ<τ. Then ∣Sβγ∖Sαγ∣<κ and ∣Sαβ∖Sαγ∣<κ.
Proof of Claim 2. Let k0 (respectively, k1) in κ be such that fα(j)<fβ(j) (respectively, fβ(j)<fγ(j)) for all j greater than k0 (respectively, k1). Then for any j greater than k0 (respectively, k1), fαξ(j)≤fβξ(j) (respectively, fβξ(j)≤fγξ(j)) for all ξ<κ, and consequently Sβγ∖Sαγ⊆k0 (respectively, Sαβ∖Sαγ⊆k1), which completes the proof of the claim.
Since there is no ascending (J,Iκ)-tower of length τ, we may find, for each α<τ, α∗ with α<α∗<τ such that Sαβ∖Sαα∗∈J whenever
α∗<β<τ.
Claim 3. Let α<β<τ. Then Sββ∗∖Sαα∗∈J.
Proof of Claim 3. Pick γ with max(α∗,β∗)<γ<τ. Then
Since there is no descending (J,J)-tower of length τ, we may find γ<τ such that Sγγ∗∖Sββ∗∈J whenever γ<β<τ. Select T∈J+∩P(Sγγ∗) and θ<ν such that ∣Aδi∣=θ for all δ∈T. Inductively define g:θ+→τ∖(γ+1) by : g(ζ) equals γ+1 if ζ=0, and (sup{g(ξ)∗:ξ<ζ})+1 otherwise. Notice that if ξ<ζ<θ+, then {Sg(ξ)g(ξ)∗△Sg(ξ)g(ζ),Sg(ξ)g(ξ)∗△Sγγ∗}⊆J, so we may find Cξζ∈J∗ such that Sg(ξ)g(ζ)∩Cξζ=Sγγ∗∩Cξζ. Set C=⋂{Cξζ:ξ<ζ<θ+}. Then T∩C⊆Sg(ξ)g(ζ) whenever ξ<ζ<θ+. Put
s=(sup⋃ξ<ζ<θ+{j<κ:fg(ξ)(j)≥fg(ζ)(j)})+1,
and pick δ∈T∩C with δ>s. Notice that since δ∈T, we have ∣Rδ∣≤∣Aδi∣<θ+. For each j∈κ∖s, the sequence ⟨fg(ξ)(j):ξ<θ+⟩ is strictly increasing. It follows that for any j∈Dδ∖s, the sequence ⟨fg(ξ)δ(j):ξ<θ+⟩ is nondecreasing, and in fact eventually constant since {fg(ξ)δ(j):ξ<θ+}⊆Rδ∪{κ}. Thus we may find ξj<θ+ such that fg(ξ)δ(j)=fg(ξj)δ(j) whenever ξj<ξ<θ+. Put η=sup{ξj:j∈Dj∖s}, and let η<ξ<ζ<θ+. Then fg(ξ)δ∣(Dj∖s)=fg(ζ)δ∣(Dj∖s). However δ∈Sg(ξ)g(ζ), and consequently sup{j∈Dδ:fg(ξ)δ(j)<fg(ζ)δ(j)}=δ. Contradiction !
□
3.2 Silly meeting
DEFINITION 3.10**.**
Given a regular infinite cardinal θ, and a cardinal ν>θ, we let M(θ,ν)= the least cardinality of any X⊆Pν(ν) with the property that for any e∈[ν]θ, there is x∈X with ∣x∩e∣=θ.
OBSERVATION 3.11**.**
Let θ be a regular infinite cardinal, and ν>θ be a cardinal with cf(ν)=θ. Then M(θ,ν)=cf(ν).
Proof. Select xi∈Pν(ν) for i<cf(ν) such that
•
xj⊆xi for all j<i.
•
⋃i<cf(ν)xi=ν.
Now given e∈[ν]θ, define f:e→cf(ν) by f(α)= the least j such that α∈xj. There must be i<cf(ν) such that ∣f−1(i+1)∣=θ. Then clearly ∣xi∩e∣=θ.
□
FACT 3.12**.**
([37])* Let θ be a regular infinite cardinal less than κ. Suppose that κ=ν+, where cf(ν)=θ. Then there is Bδ⊆Pν(δ)) with ∣Bδ∣≤cf(ν) for δ<κ such that for any A∈[κ]κ,*
{δ<κ:∃B∈Bδ(sup(A∩B)=δ)}∈(NSκ∣Eθκ)∗.
Proof. Using Observation 3.11, for δ∈Eθκ∖ν, pick Bδ⊆Pν(δ) with ∣Bδ∣≤cf(ν) such that for any e∈[δ]θ, there is B∈Bδ with ∣B∩e∣=θ. Given A∈[κ]κ, set C={δ∈acc(κ)∖ν:sup(A∩δ)=δ}. Now fix δ∈C∩Eθκ. Select e⊆A∩δ with supe=δ and o.t.(e)=θ. We may find B∈Bδ such that ∣B∩e∣=θ. Then clearly, sup(B∩A)=δ.
□
REMARK 3.13*.*
It obviously follows that if κ=ν+, where cf(ν)=θ, then ♣κcof,−/cf(ν)[J] holds for any κ-complete ideal J on κ extending NSκ∣Eθκ. For the case when θ=cf(ν)<ν and J=NSκ∣S for some S∈NSκ+∩P(Eθκ), see Theorem 2.6 in [37] which gives a condition in terms of approachability for ♣κcof,−/cf(ν)[J] to hold.
PROPOSITION 3.14**.**
Let θ be a regular infinite cardinal less than κ. Suppose that κ=ν+, where cf(ν)=θ, and J is a κ-complete ideal on κ extending NSκ∣Eθκ. Then for any regular cardinal τ<Depth(κκ), there exists either an ascending (J,Iκ)-tower of length τ, or a descending (J,J)-tower of length τ.
Proof. By Theorem 3.9 and Remark 3.13.
□
3.3 Slow train
We will now give a proof of Fact 2.18. Let us recall the setting : θ<κ is a regular uncountable cardinal, κ=ν+=2ν, where cf(ν)=θ, and J is a κ-complete ideal on κ extending NSκ∣Eθκ. By Remark 3.13, we already know that ♣κcof,−/cf(ν)[J] holds. We need to show that ♣κ[J] holds. Just as Primavesi [36], we are not looking for a concise, beautiful proof. On the contrary, the more steps the better, as we would like to see in slow motion how ♣κcof,−/cf(ν)[J] gradually evolves into ♣κ[J]. The main component of the proof is assertion (i) in the following proposition.
PROPOSITION 3.15**.**
(i)
Suppose that ♣κcof/σ,−/τ[J] holds, where σ is an infinite cardinal with κσ=κ, τ is a cardinal with 1≤τ<κ, and J is a κ-complete ideal on κ. Then ♣κ−/τ[J] holds.
2. (ii)
Suppose that ♣κcof/σ,−[J] holds, where σ is an infinite cardinal with κσ=κ and J is a κ-complete ideal on κ. Then ♣κ−[J] holds.
Proof. (i) : We modify the proof (which we do not understand) of Theorem 3.5 in [36] that asserts that assertion (i) is valid for any ideal of the form NSκ∣S.
Let sγi∈Pσ(γ) for i<τ and γ∈acc(κ) witness that ♣κcof/σ,−/τ[J] holds. Let ⟨vδ:δ<κ⟩ be a one-to-one enumeration of σκ. Define Bad:σ×[κ]κ→P(κ) by Bad(r,A)={δ∈κ:vδ(r)∈/A}. Given r<σ and k:r→[κ]κ, define fk:τ×acc(κ)→Pσ(κ) by
fk(i,γ)={vδ(r):δ∈sγi∖(⋃q<rBad(q,k(q)))}.
Claim. There is k∈⋃r<σr(P(κ)) such that
{γ∈acc(κ):∃i<τ(supfk(i,γ)=γandfk(i,γ)⊆T)}∈J+
for all T∈[κ]κ.
Proof of the claim. Suppose otherwise. For each k∈⋃r<σr([κ]κ), pick Tk∈[κ]κ and Ck∈J∗∩P(acc(κ)) such that for any γ∈Ck and any i<τ, either supfk(i,γ)<γ, or fk(i,γ)∖Tk=∅. Define H:σ→[κ]κ so that H(r)=TH∣r for all r<σ. For r<σ, let ⟨ξβr:β<κ⟩ be the increasing enumeration of H(r). Define F:κ→κ so that vF(β)(r)=ξβr for every β<κ and every r<σ. Notice that F is one-to-one. Inductively define βj<κ for j<κ so that sup{max(βl,F(βl)):l<j}<βj. Put Δ={F(βj):j<κ}. There must be γ∈⋂r<σCH∣r and i<τ such that sup(sγi∩Δ)=γ.
Since ∣sγi∣<σ, we may find r<σ such that
(sγi∖⋃q<rBad(q,H(q))∩Bad(r,H(r))=∅.
Then vδ(r)∈H(r) for any δ∈sγi∖(⋃q<rBad(q,H(q)), and therefore fH∣r(i,γ)⊆H(r). Given α<γ, pick l<j<κ so that {F(βl),F(βj)}⊆sγi and F(βl)≥α. Then vF(βj)(r)=ξβjr≥βj>F(βl)≥α. Now clearly, sγi∩Δ⊆sγi∖Bad(u,H(u)) for all u<κ, so sγi∩Δ⊆sγi∖(⋃q<rBad(q,H(q))). Hence, vF(βj)(r)∈fH∣r(i,γ)∖α. Thus supfH∣r(i,γ)=γ. This contradiction completes the proof of the claim and that of (i).
(ii) : The proof is a straightforward modification of that of (i).
□
Primavesi [36] established that if κτ=κ and ♣κ−/τ[NSκ∣S] holds, where S∈NSκ+, then so does ♣κ[NSκ∣S]. This can be generalized as follows.
PROPOSITION 3.16**.**
Let τ be a cardinal with 1<τ<κ and κτ=κ, and J be a κ-complete ideal on κ extending NSκ. Suppose that ♣κ−/τ[J] holds. Then so does ♣κ[J].
Proof.
The proof is a modification of that of Theorem 6.2.3 in [36]. Thus let sαi⊆α with supsαi=α for α∈acc(κ) and i<τ be such that {α∈acc(κ):∃i<τ(sαi⊆A)}∈J+ for every A∈[κ]κ. Let ⟨eγ:γ<κ⟩ be a κ-to-one enumeration of [τ×κ]τ. For α∈acc(κ) and i<τ, put tαi=⋃γ∈sαi{δ<κ:(i,δ)∈eγ}.
We claim that there is i<τ such that for any A∈[κ]κ, the set of all α∈acc(κ) such that suptαi=α and tαi⊆A lies in J+. Suppose otherwise. Then we may find Ci∈J∗∩P(acc(κ)) and Ai∈[κ]κ for i<τ such that for any i<τ and any α∈Ci, either suptαi=α, or tαi∖Ai=∅. For i<τ, let ⟨aβi:β<κ⟩ be the increasing enumeration of Ai. We inductively define βξ,γξ<κ for ξ<κ as follows. We let β0=γ0=0. Assuming that ξ>0 and βζ and γζ have been constructed for all ζ<ξ, we let βξ= the least β>sup{βζ:ζ<ξ} such that min{aβi:i<τ}≥ξ, and γξ= the least γ>sup{γζ:ζ<ξ} such that eγ={(i,aβξi):i<τ}. Let D be the set of all α∈acc(κ) such that
•
γα=α ;
•
α∈⋂i<τCi ;
•
{δ<κ:(i,δ)∈eγ}⊆α for any γ<α and and any i<τ.
There must be α∈D and i<τ such that sαi⊆{γξ:ξ<κ}. It is readily checked that tαi⊆Ai∩α. Given i<ζ<α, we may find ξ<κ such that γξ∈sαi∖γζ. Since i<ζ≤ξ≤βξ, we have (i,aβξi)∈eβξ, and therefore aβξi∈tαi. Furthermore, ζ≤ξ≤aβξi. Thus suptαi=α. Contradiction.
□
Assertion (i) in the following proposition is due to Rinot [37] in the case when J is a restriction of NSκ.
PROPOSITION 3.17**.**
(i)
Suppose that κ is a successor cardinal, and J is a κ-complete ideal on κ extending NSκ. Then the following are equivalent :
(a)
♢κ[J]* holds.*
2. (b)
♣κcof,−[J]* holds and 2<κ=κ.*
2. (ii)
Suppose that κ is weakly inaccessible, and J is a normal ideal on κ. Then for any infinite cardinal σ<κ, the following are equivalent :
(i)
♢κ[J]* holds.*
2. (ii)
♣κcof/σ,−[J]* holds and 2<κ=κ.*
Proof. (i) : By Observation 2.22 and Propositions 3.15 and 3.16.
(ii) : By Fact 2.16, Observation 3.4 and Propositions 3.15 and 3.16.
□
Proof of Fact 2.18. By Remark 3.13 and Proposition 3.17.
□
Mildenberger [34] showed that for any S∈NSω1+, if CH and ♣κev[NSω1∣S] both hold, then ♢ω1[NSω1∣S] holds (see [24] for more results of this type). This generalizes.
OBSERVATION 3.18**.**
Let θ be a regular infinite cardinal less than κ, and J be a κ-complete ideal on κ extending NSκ∣Eθκ such that ♣κev[J] holds. Then the following hold :
(i)
Suppose that κθ=κ. Then ♣κ[J] holds.
2. (ii)
Suppose that 2<κ=κ. Then ♢κ[J] holds.
Proof. Observe that ♣κ−/θ[J] holds, and appeal to Proposition 3.16 and Observation 2.22.
□
By considering other versions of the club principle, one can obtain variants of Proposition 3.16.
DEFINITION 3.19**.**
Given a cardinal τ with 1≤τ<κ and a κ-complete ideal J on κ, ♣κev/−τ[J] asserts the existence of sαi⊆α with supsαi=α for α∈acc(κ) and i<τ such that ⋃i<τ{α∈acc(κ):∃β<α(sαi∖β⊆A} lies in J+ for all A∈[κ]κ.
OBSERVATION 3.20**.**
Let τ be a cardinal with 1<τ<κ and κτ=κ, and J be a κ-complete ideal on κ extending NSκ. Then the following hold :
(i)
Suppose that ♣κev/−τ[J] holds. Then so does ♣κev[J].
2. (ii)
Suppose that there are sαi⊆α for α∈acc(κ) and i<τ such that ⋃i<τ{α∈acc(κ):sup(sαi∩A)=α}∈J+ for all A∈[κ]κ. Then there are tα⊆α with ∣tα∣≤max(τ,∣sαi∣) for α∈acc(κ) such that {α∈acc(κ):sup(tα∩A)=α}∈J+ for all A∈[κ]κ.
3.4 The case κ=ν+ with ν singular
We start by recalling the definition of covering numbers.
DEFINITION 3.21**.**
Given four cardinals ρ1,ρ2,ρ3,ρ4 with ρ1≥ρ2≥ρ3≥ω and ρ3≥ρ4≥2, cov(ρ1,ρ2,ρ3,ρ4) denotes the least cardinality of any Z⊆Pρ2(ρ1) such that for any a∈Pρ3(ρ1), there is Q∈Pρ4(Z) with a⊆⋃Q.
OBSERVATION 3.22**.**
Let τ, χ and σ be three cardinals such that 1≤τ≤χ<σ<κ and cov(κ,χ+,τ+,2)=κ. Suppose that ♣κcof/σ,−/τ[J] holds, where J is a κ-complete ideal on κ. Then ♣κcof/σ[J] holds.
Proof. The proof is similar to that of Proposition 3.16. Let sαi∈Pσ(α) for i<τ and α∈acc(κ) witness that ♣κcof/σ,−/τ[J] holds. Pick Z⊆Pχ+(κ) such that ∣Z∣=κ and for any a∈Pτ+(κ), there is z∈Z with a⊆z. Let ⟨zγ:γ<κ⟩ be a κ-to-one enumeration of Z. For α∈acc(κ) and i<τ, put tαi=α∩(⋃γ∈sαizγ). Note that ∣tαi∣≤max{∣sαi∣,χ}<σ.
We claim that there is i<τ such that for any A∈[κ]κ, the set of all α∈acc(κ) such that sup(tαi∩A)=α lies in J+. Suppose otherwise. Then we may find Ci∈J∗∩P(acc(κ)) and Ai∈[κ]κ for i<τ such that for any i<τ and any α∈Ci, sup(tαi∩Ai)<α. For i<τ, let ⟨aβi:β<κ⟩ be the increasing enumeration of Ai. We inductively define βξ,γξ<κ for ξ<κ as follows. We let β0=γ0=0. Assuming that ξ>0 and βζ and γζ have been constructed for all ζ<ξ, we let βξ= the least β>sup{βζ:ζ<ξ} such that min{aβi:i<τ}≥ξ, and γξ= the least γ>sup{γζ:ζ<ξ} such that {aβξi:i<τ}⊆zγ. Let D be the set of all α∈acc(κ)∩⋂i<τCi such that ⋃γ<αzγ⊆α=γα. There must be α∈D and i<τ such that sup(sαi∩{γξ:ξ<κ})=α. Given i<ζ<α, we may find ξ<κ such that γξ∈sαi∖γζ. Then clearly ξ<α and zγξ⊆α. Since aβξi∈zγξ, it follows that aβξi∈tαi. Furthermore, ζ≤ξ≤aβξi. Thus sup(tαi∩Ai)=α. Contradiction.
□
FACT 3.23**.**
Suppose that κ=ν+, where ν is singular. Then
cov(ν,ν,(cf(ν))+,2)=cov(κ,χ+,(cf(ν))+,2)
for some cardinal χ<ν.
Proof. Set θ=cov(ν,ν,(cf(ν))+,2). By [44, Observation 5.3 (10) p. 86], there must be a cardinal χ<ν such that θ=cov(ν,χ,(cf(ν))+,2). Then clearly, θ=cov(ν,χ+,(cf(ν))+,2). On the other hand, by [44, Observation 5.3 (2) p. 86], cov(κ,χ+,(cf(ν))+,2)=max{θ,κ}. It remains to observe that by [44, Theorem 5.4 p. 88], θ≥pp(ν).
□
PROPOSITION 3.24**.**
Let θ be a regular infinite cardinal less than κ. Suppose that κ=ν+, where cf(ν)∈ν∖{θ} and cov(ν,ν,(cf(ν))+,2)=κ, and J is a κ-complete ideal on κ extending NSκ∣Eθκ. Then ♣κcof[J] holds.
Proof.♣κcof,−/τ[J] holds by Remark 2.10, and hence so does ♣κcof[J] by Observation 3.22 and Fact 3.23.
□
Note that by results of Shelah ([44, Theorem 5.4 p. 87], [43]), SSH is equivalent to the statement that cov(ν,ν,(cf(ν))+,2)=ν+ for any singular cardinal ν.
3.5 Slow train II
This time we would like to retrace the path leading from Fact 3.12 to Fact 2.17.
DEFINITION 3.25**.**
Given a κ-complete ideal J on κ and a cardinal σ<κ, ♣κcof/σ,∗[J] asserts the existence of Bδi∈Pσ(δ)) for i<δ<κ such that for any A∈[κ]κ,
{δ<κ:∃i<δ(sup(A∩Bδi)=δ)}∈J∗.
We will follow Fuchs and Rinot who established [13] that if κ=ν+=2ν and ♣κcof/ν,∗[NSκ∣S] holds for S∈NSκ+∣Eθκ, where θ is a regular infinite cardinal less than ν such that d(θ,μ)≤ν for any cardinal μ with θ≤μ<ν, then ♢κ∗[NSκ∣S] holds. However we will make an extra stop at ♣κ∗.
PROPOSITION 3.26**.**
Let θ<σ be two infinite cardinals such that cf(θ)=θ, σ<κ, and d(θ,μ)<κ for any cardinal μ with θ≤μ<σ. Further let J be a κ-complete ideal on κ extending NSκ∣Eθκ such that ♣κcof/σ,∗[J] holds. Then ♣κ∗[J] holds.
Proof. Let Bδi∈Pσ(δ)) for i<δ<κ witness that ♣κcof/σ,∗[J] holds. For i<δ<κ, we define Zδi as follows. If ∣Bδi∣<θ, put Zδi=∅. Otherwise let Zδi be a cofinal subset of ([Bδi]θ,⊇) of size d(θ,∣Bδi∣). For δ<κ, set Aδ=⋃{Zδi:i<δ and ∣Bδi∣≥θ}. Note that if δ≥sup{d(θ,μ):θ≤μ<σ}, then ∣Aδ∣≤∣δ∣.
Given A∈[κ]κ, we may find C∈J∗ such that for any δ∈C, there is i<δ with sup(A∩Bδi)=δ. Now fix δ∈C∩Eθκ. Pick i<δ and e⊆A∩Bδi so that supe=δ and o.t.(e)=θ. There must be z∈Zδi such that z⊆e. Then z∈Aδ. Moreover, z⊆A and supz=δ.
□
COROLLARY 3.27**.**
Suppose that κ=ν+, and θ is a regular infinite cardinal less than ν such that d(θ,ν)=ν. Then ♣κ∗[NSκ∣Eθκ] holds.
Proof. Use Fact 3.12.
□
Proof of Fact 2.17. By Observation 2.23 and Corollary 3.27.
□
3.6 More clubbing
Corollary 3.27 can be easily generalized to weakly inaccessible cardinals, but it is not yet clear what these weak generalizations (already considered in [6] and [47]) are good for. The following strengthens a result of Džamonja [6].
OBSERVATION 3.28**.**
There is Bδ⊆{B⊆δ:supB=δ} with ∣Bδ∣≤d(cf(δ),∣δ∣) for δ∈acc(κ) such that for any A∈[κ]κ, there exists C∈Cκ with the property that C⊆{δ∈acc(κ):∃B∈Bδ(B⊆A)}.
Proof. For δ∈acc(κ), pick Aδ⊆[δ]cf(δ) with ∣Aδ∣=d(cf(δ),∣δ∣) such that for any e∈[δ]cf(δ), there is B∈Aδ with B⊆e. Given A∈[κ]κ, let C={δ∈acc(κ):sup(A∩δ)=δ}. Now fix δ∈C. Select e⊆A∩δ such that o.t.(e)=cf(δ) and supe=δ. There must be B∈Aδ such that B⊆e. Then clearly supB=δ, and moreover B⊆A.
□
3.7 Order-type versus cardinality
To conclude this section let us mention the following result of Džamonja and Shelah that yields a variant of ♣κcof where the condition on ∣sα∣ is replaced with one on o.t.(sα).
FACT 3.29**.**
([9])* Suppose that κ=ν+, where ν is regular, and θ and ρ are two regular infinite cardinals with θ<ρ<ν. Suppose further that either θ>ω, or ν≥2ℵ0, and let S∈NSκ+∩P(Eθκ) with the property that S reflects at stationarily many δ∈Eρκ. Then there is sα⊆α for α∈S with o.t.(sα)<ν+ω⋅ρ such that {α∈S:sup(A∩sα)=α}∈NSκ+ for all A∈[κ]κ.*
4 GUESSING GENERALIZED CLUBS
In this section we revisit another result of Rinot where nonsaturation is derived from guessing generalized clubs. Let us start with some definitions.
DEFINITION 4.1**.**
Let σ be an infinite cardinal, and δ be a limit ordinal greater than or equal to σ. A subset C of Pσ(δ) is a generalized club if {x∈Pσ(δ):F‘‘Pω(x)⊆x}⊆C for some F:Pω(δ)→δ.
OBSERVATION 4.2**.**
(i)
If σ=ω, then there is an empty generalized club subset of Pσ(δ).
2. (ii)
If σ>ω, then any generalized club subset of Pσ(δ) is cofinal in (Pσ(δ),⊆).
DEFINITION 4.3**.**
Given an infinite cardinal σ<κ and a κ-complete ideal J on κ, ⋏−(σ,κ,J)) asserts the existence of a cofinal subset Cδi of (Pσ(δ),⊆) for i∈δ∈acc(κ)∖σ such that {δ:∃i<δ(Cδi⊆D)}∈J+ for every generalized club subset D of Pσ(κ).
⋏(σ,κ,J) asserts the existence of a generalized club subset Cδ of Pσ(δ) for δ∈acc(κ)∖σ such that {δ:Cδ⊆D}∈J+ for every generalized club subset D of Pσ(κ).
Note that ⋏(σ,κ,J)⇒⋏−(σ,κ,J)⇒σ>ω. ⋏(σ,κ,NSκ∣S) (respectively, ⋏−(σ,κ,NSκ∣S)) is identical with the principle ⋏(σ,S) (respectively, ⋏−(σ,S)) introduced in [39]. For the associated starred version see [22].
OBSERVATION 4.4**.**
The following are equivalent :
(i)
⋏−(σ,κ,J)* holds.*
2. (ii)
There is a subset Xδi of Pσ(δ) with the property that δ⊆⋃Xδi for i∈δ∈acc(κ)∖σ such that {δ:∃i<δ(Xδi⊆D)}∈J+ for every generalized club subset D of Pσ(κ).
Proof. It suffices to prove that (ii) implies (i) since the other direction is trivial. Thus let Xδi for i∈δ∈acc(κ)∖σ be as in (ii). For δ∈acc(κ)∖σ, select a cofinal subset Zδ of Pσ(δ), and h:δ×δ→Xδi such that α∈h(i,α) for each (i,α)∈δ×δ. Set Cδi={⋃α∈zh(i,α):z∈Zδ}. Now given a generalized club subset D of Pσ(κ), pick F:Pω(κ)→κ such that D′⊆D, where D′={x∈Pρ(δ):F‘‘Pω(x)⊆x}. Then clearly, Cδi⊆D′⊆D for any δ∈acc(κ)∖σ with Xδi⊆D′.
□
COROLLARY 4.5**.**
If ⋏−(σ,κ,J) holds, then so does ⋏−(σ′,κ,J) for every cardinal σ′ with σ≤σ′<κ.
The following is essentially due to Shelah.
OBSERVATION 4.6**.**
Suppose that J extends NSκ, and ♢κ[J] holds. Then for any ucountable cardinal σ<κ, ⋏(σ,κ,J) holds.
Proof. Let ⟨sδ:δ<κ⟩ witness that ♢κ[J] holds. Select a bijection j:Pω(κ)×κ→κ. For δ∈acc(κ), define fδ:Pω(δ)→δ by : fδ(e) equals [math] if {ξ∈δ:j(e,ξ)∈sγ}=∅, and min{ξ∈δ:j(e,ξ)∈sγ} otherwise. Now let σ be a fixed uncountable cardinal less than κ. Set Cδ={x∈Pσ(δ):fδ‘‘Pω(x)⊆x}. Given a generalized club subset D of Pσ(κ) and H∈J∗, pick F:Pω(κ)→κ with {x∈Pω(κ):F‘‘Pω(x)⊆x}⊆D. We may find δ∈H such that F‘‘Pω(δ)⊆δ=j‘‘(Pω(δ)×δ) and sδ={j(e,F(e)):e∈Pω(κ)}∩δ. Then it is readily checked that Cδ⊆D.
□
Rinot [39] established that if κ=ν+, where ν is regular, and S∈NSκ+∩P(Eνκ) is such that ⋏−(σ,κ,NSκ∣S) holds for some σ<κ, then NSκ∣S is not κ+-saturated. This can be extended as follows.
THEOREM 4.7**.**
(i)
Suppose that
•
κ=ν+* ;*
•
σ* is an uncountable cardinal less than ν ;*
•
J* is a κ-complete ideal on κ such that E>σκ∈J∗ and ⋏−(σ,κ,J) holds ;*
•
τ* is a regular cardinal less than Depth(κκ).*
Then there exists either an ascending (J,Iκ)-tower of length τ, or a descending (J,J)-tower of length τ.
2. (ii)
Suppose that
•
κ* is weakly inaccessible ;*
•
σ* is an uncountable cardinal less than κ ;*
•
J* is a normal ideal on κ such that E>σκ∈J∗ and ⋏−(σ,κ,J) holds ;*
•
τ* is a regular cardinal less than Depth(κκ).*
Then there exists either an ascending (J,Iκ)-tower of length τ, or a descending (J,J)-tower of length τ.
Proof. We prove (ii) and leave the similar proof of (i) to the reader. The proof is a modification of that of Theorem 3.4 in [39]. Select fα∈κκ for α<τ such that fα<∗fβ whenever α<β<τ. Let Cδi for i∈δ∈acc(κ)∖σ witness that ⋏−(σ,κ,J) holds.
For δ∈E>σκ, select hδ:δ×δ→Pσ(δ) such that j∈hδ(i,j)∈Cδi for all (i,j)∈δ×δ.
For δ∈E>σκ and α<τ, define fαδ:δ×δ→δ∪{κ} by fαδ(i,j)=min((hδ(i,j)∪{κ})∖fα(j)). Notice that if fα(j)≤fβ(j), then fαδ(i,j)≤fβδ(i,j). Finally, for α<β<τ and i<κ, let
Claim 1. Let α<β<γ<τ and i<κ. Then the following hold :
(i)
∣Sαβi∖Sαγi∣<κ.
2. (ii)
∣Sβγi∖Sαγi∣<κ.
Proof of Claim 1. Pick η<κ so that fα(j)<fβ(j)<fγ(j) whenever η≤j<κ. Let us first show that Sαβi∖(η+1)⊆Sαγi. Given δ∈Sαβi∖(η+1), put A={j<δ:fαδ(i,j)=fβδ(i,j)}∪η. Then clearly, fαδ(i,j)<fβδ(i,j)≤fγδ(i,j) for all j∈δ∖A. Thus {j<δ:fαδ(i,j)=fγδ(i,j)}⊆A, and consequently δ∈Sαγi. Next we show that Sβγi∖(η+1)⊆Sαγi. Given δ∈Sβγi∖(η+1), put B={j<δ:fβδ(i,j)=fγδ(i,j)}∪η. Then clearly, fαδ(i,j)≤fβδ(i,j)<fγδ(i,j) for all j∈δ∖B. Hence {j<δ:fαδ(i,j)=fγδ(i,j)}⊆B, and therefore δ∈Sαγi, which completes the proof of the claim.
Claim 2. There is v:τ→κ such that Sαβv(α)∈J+ whenever α<β<τ.
Proof of Claim 2. Fix α<κ. Set k=(sup{j<κ:fα(j)≥fα+1(j)})+1. Define F:Pω(κ)→κ by :
•
F(e)=0 if e=∅ ;
•
F(e)=ξ+1 if e={ξ} :
•
F(e)=fα(maxe) if ∣e∣=2 ;
•
F(e)=fα+1(maxe) if ∣e∣>2.
Put D={x∈Pσ(κ):F‘‘Pω(x)⊆x}. Note that {fα(ζ),fα+1(ζ)}⊆x whenever x∈D and ζ∈x∖ω. By normality of J, there must be i<κ such that
T={δ∈E>σκ∖max(i+1,k+1):Cδi⊆D}
lies in J+. If δ∈T, then for any j∈δ with j≥max(k,ω), we have that j∈hδ(i,j)∈D, so fαδ(i,j)=fα(j)<fα+1(j)=fα+1δ(i,j). Thus T⊆Sαα+1i. Hence Sα(α+1)i lies in J+, and by Claim 1 so does Sαβi for every β>α, which completes the proof of the claim.
There must be i<κ such that ∣v−1({i})∣=τ. By thinning out our sequence of functions, we may assume that v(α)=i for all α<τ.
Since there is no ascending (J,Iκ)-tower of length τ, we may find, for each α<τ, α∗ with α<α∗<τ such that Sαβi∖Sαα∗i∈J whenever α∗<β<τ.
Claim 3. Let α<β<τ. Then Sββ∗i∖Sαα∗i∈J.
Proof of Claim 3. Pick γ with max(α∗,β∗)<γ<τ. Then
Since there is no descending (J,J)-tower of length τ, we may find γ<τ such that Sγγ∗∖Sββ∗∈J whenever γ<β<τ. Select T∈J+∩P(Sγγ∗i) and θ<σ such that sup{j<δ:∣hδ(i,j)∣=θ}=δ for all δ∈T. Inductively define g:θ+→τ∖(γ+1) by : g(ζ) equals γ+1 if ζ=0, and (sup{g(ξ)∗:ξ<ζ})+1 otherwise.
Notice that if ξ<ζ<θ+, then {Sg(ξ)g(ξ)∗i△Sg(ξ)g(ζ)i,Sg(ξ)g(ξ)∗i△Sγγ∗i}⊆J, so we may find Cξζ∈J∗ such that Sg(ξ)g(ζ)i∩Cξζ=Sγγ∗i∩Cξζ. Set C=⋂{Cξζ:ξ<ζ<θ+}. Then T∩C⊆Sg(ξ)g(ζ)i whenever ξ<ζ<θ+. Put
s=(sup⋃ξ<ζ<θ+{j<κ:fg(ξ)(j)≥fg(ζ)(j)})+1,
and pick δ∈T∩C with δ>s. For ξ<θ+, set Wξ={j<δ:fg(ξ(j)>suphδ(i,j)}.
Claim 4. Let ξ<θ+. Then supWξ<δ.
Proof of Claim 4. Suppose otherwise. Pick ζ with ξ<ζ<θ+. Then κ=fg(ξδ(i,j)≤fg(ζδ(i,j)≤κ, contradicting the fact that δ∈Sg(ξ)g(ζ)i, which completes the proof of the claim.
Set t=(sup⋃ξ<θ+Wξ)+1, u=max(s,t) and Q={j∈δ∖u:∣hδ(i,j)∣=θ}. For j∈Q, ⟨fg(ξ)δ(i,j):ξ<θ+⟩ is a weakly increasing sequence of elements of hδ(i,j), since the sequence ⟨fg(ξ)(j):ξ<θ+⟩ is increasing, so there must be χj<θ+ such that fg(ξ)δ(i,j)=fg(χj)δ(i,j) whenever χj<ξ<θ+. We may find χ<θ+ and M⊆Q with supM=δ such that χj=χ for all j∈M. But now fg(ξ)δ∣({i}×M)=fg(ξ)δ∣({i}×M) whenever χ<ξ<ζ<θ+. Contradiction !
□
Let us now compare our principle for guessing generalized clubs with the principles considered in the previous section (a weak version of club) and the next section (club-guessing). The following extends Theorem 2.1 of [39].
OBSERVATION 4.8**.**
(i)
Suppose that κ is weakly inaccessible and ⋏−(σ,κ,J) holds, where J is a normal ideal on κ such that E≥σκ∈J∗. Then there is a closed unbounded subset Xδ of δ for δ∈E≥σκ such that {δ:sup(Xδ∖Y)<δ}∈J+ for every closed unbounded subset Y of κ.
2. (ii)
Suppose that κ is a successor cardinal and ⋏−(σ,κ,J) holds, where J is a κ-complete ideal on κ such that E≥σκ∈J∗. Then there is a closed unbounded subset Xδ of δ for δ∈E≥σκ such that {δ:Xδ⊆Y}∈J+ for every closed unbounded subset Y of κ.
Proof. We prove (i) and leave the similar proof of (ii) to the reader. Let Cδi for i∈δ∈acc(κ)∖σ witness that ⋏−(σ,κ,J) holds. For i∈δ∈E≥σκ, put Sδi={supx:x∈Cδi∖{∅}}. Note that Sδi⊆δ.
Claim 1. Let Y be a closed unbounded subset of κ. Then {δ∈E≥σκ:∃i<δ(Sδi⊆Y)}∈J+.
Proof of Claim 1. Define F:Pω(κ)→κ by F(e)=min(C∖⋃e), and let D={x∈Pσ(δ):F‘‘Pω(x)⊆x}. Now suppose that i and δ are such that i∈δ∈E≥σκ and Cδi⊆D. Then clearly, supx∈Y for every nonempty x in Cδi. Hence Sδi⊆Y, which completes the proof of the claim.
For i∈δ∈E≥σκ, put Tδi={ξ∈δ∖{0}:sup(ξ∩Tδi)=ξ}. Then clearly, Tδi is a closed unbounded subset of δ. Furthermore, {δ∈E≥σκ:∃i<δ(Tδi⊆Y)}∈J+ for any closed unbounded subset Y of κ.
Claim 2. There is i<κ such that {δ:Tδi∖Y⊆i+1}∈J+ for every closed unbounded subset Y of κ.
Proof of Claim 2. Suppose otherwise. For i<κ, pick Yi∈NSκ∗ and Wi∈J∗∩P(E≥σκ) such that (Tδi∖Yi)∖(i+1)=∅ whenever i∈δ∈Wi. Set Y=△i<κYi and W=△i<κWi. We may find δ∈W and i<δ such that Tδi⊆Y. Then δ∈Wi, and moreover Yδi∖(i+1)⊆Yi∖(i+1)⊆Y. This contradiction completes the proof of the claim and that of the observation.
□
OBSERVATION 4.9**.**
Suppose that ⋏−(σ,κ,J) holds, where J is a κ-complete ideal on κ such that E≥σκ∈J∗. Then NSκ∗∩J=∅.
Proof. By the proof of Observation 4.8.
□
OBSERVATION 4.10**.**
Suppose that ⋏−(σ,κ,J) holds and Eθκ∈J∗, where θ is an infinite cardinal with θ+<κ. Then ♣κcof/ρ,−[J] holds, where ρ=max{σ,θ+}.
Proof. Let Cδi for i∈δ∈acc(κ)∖σ witness that ⋏−(σ,κ,J) holds. For δ∈Eθκ∖σ, pick an increasing sequence ⟨δj:j<θ⟩ with supremum δ, and h:δ×θ→δ such that δj∈h(i,j)∈Cδi for every (i,j)∈δ×θ. Set sδi=⋃j<θh(i,j) for every i<δ. Now given A∈[κ]κ, define F:Pω(κ)→κ by F(e)=min(A∖∪e), and put D={x∈Pσ(δ):F‘‘Pω(x)⊆x}. Then clearly, sup(A∩sδi)=δ whenever δ∈Eθκ∖σ and i<δ are such that Cδi⊆D.
□
The following is yet another indication of the strength of ⋏−.
OBSERVATION 4.11**.**
Given a regular uncountable cardinal σ<κ, the following hold :
(i)
Suppose that ⋏(σ,κ,NSκ∣S) holds, where S∈NSκ+∩P(E<σκ). Then there is a stationary subset X of Pσ(κ) such that
•
{supx:x∈X}=S* ;*
•
the sup-function is one-to-one on X.
2. (ii)
Suppose that ⋏−(σ,κ,NSκ∣S) holds, where S∈NSκ+∩P(E<σκ). Then there is a stationary subset X of Pσ(κ) such that
•
{supx:x∈X}=S* ;*
•
∣{x∈X:supx=α}∣≤∣α∣* for all α∈S.*
Proof. We prove (i) and leave the similar proof of (ii) to the reader. Let ⟨Cδ:δ∈acc(κ)∖σ⟩ witness that ⋏(σ,κ,NSκ∣S) holds. We define xδ for δ∈S as follows. Given δ∈S, select eδ⊆δ so that o.t.(eδ)=cf(δ) and supeδ=δ. Inductively define xδn∈Cδ for n<ω so that
•
xδ0=eδ ;
•
xδn∪sup(xδn∩κ)⊆xδn+1.
Finally, X={⋃n<ωxδn:δ∈S} is as desired.
□
COROLLARY 4.12**.**
Suppose that ⋏−(σ,κ,NSκ∣S) holds, where σ is a regular uncountable cardinal less than κ, and S∈NSκ+∩P(E<σκ). Then cov(κ,σ,σ,2)=κ.
Notice that in the other direction, the following is known.
FACT 4.13**.**
([17], [32])* Let S∈NSκ+∩P(E<σκ). Suppose that there is a stationary subset X of Pσ(κ) such that*
•
{supx:x∈X}⊆S* ;*
•
the sup-function is one-to-one on X (respectively, ∣{x∈X:supx=α}∣≤∣α∣ for all α∈S).
Then ♣κcof/σ[NSκ∣S] (respectively, ♣κcof/σ,−[NSκ∣S]) holds.
5 GITIK-SHELAH ON NONSATURATION
We are looking for another result on ideal nonsaturation where towers might be involved. A natural candidate is the following result of Gitik and Shelah.
FACT 5.1**.**
([17])* Suppose that max(ω2,θ+)<κ, where θ is a regular infinite cardinal. Then NSκ∣Eθκ is not κ+-saturated.*
REMARK 5.2*.*
Notice that in general the conclusion will not remain valid if NSκ∣Eθκ is replaced with NSκ∣S for some stationary subset S of Eθκ (see [17]).
The result was already revisited by Krueger [23], and we will follow his reading.
5.1 Club-guessing
We start with an easy generalization of Shelah’s club guessing principle (see [17]).
Throughout Subsections 5.1 - 5.4, θ and ρ will denote two regular infinite cardinals with θ<ρ<κ.
PROPOSITION 5.3**.**
Let K be a κ-complete ideal on κ extending NSκ∣Eθκ. Then there is cα⊆E≥ρκ∩α with supcα=α for α∈Eθκ∩acc(E≥ρκ) such that {α∈Eθκ∩acc(E≥ρκ):cα⊆C}∈K+ for every C∈Cκ.
Proof. The proof follows that of Hirata given in [48]. For each β∈acc(κ), select a cofinal subset dβ of β of order-type cf(β). Given α∈Eθκ∩acc(E≥ρκ) and D∈Cκ∩P(acc(κ)), we inductively define xα,nD⊆D with ∣xα,nD∣<ρ for n<ω as follows :
•
xα,0D={sup(D∩γ):γ∈dα} ;
•
xα,n+1D={sup(D∩γ):∃β∈xα,nD∩E<ρκ(γ∈dβ)}.
Finally, we let xαD=(⋃n<ωxα,nD)∖{0}.
Claim. There is D∈Cκ∩P(acc(κ)) such that {α∈Eθκ∩acc(E≥ρκ):xαD⊆C}∈K+ for every C∈Cκ.
Proof of the claim. Suppose otherwise. Inductively define Cξ∈Cκ∩P(acc(κ)) and Hξ∈K∗ for ξ<ρ such that
•
Cξ+1⊆Cξ ;
•
Hξ+1∩{α∈Eθκ∩acc(E≥ρκ):xαCξ⊆Cξ+1}=∅.
Select α in Eθκ∩acc(E≥ρκ)∩⋂ξ<ρCξ∩⋂ξ<ρHξ. Since the map ξ→sup(Cξ∩γ) is nonincreasing for every γ<κ, and ∣xα,nCξ∣<ρ for all ξ<ρ and all n<ω, we may inductively define ξn for n<ω so that
•
ξn≤ξn+1 ;
•
xα,nCξ=xα,nCξn for ξn≤ξ<ρ.
Set ξ=sup{ξn:n<ω}. Then xαCξ=xαCξ+1⊆Cξ+1. This contradiction completes the proof of the claim.
So it remains to observe the following. Let α∈Eθκ∩acc(E≥ρκ)∩acc(D) be such that xαD⊆acc(D). Then xα,0D is cofinal in α, and hence so are xαD and xαD∖acc(xαD). Furthermore for any n<ω and any β∈xα,nD∩E<ρκ, β lies in acc(D) and therefore in acc(xα,n+1D). It follows that xαD∖acc(xαD)⊆E≥ρκ.
□
5.2 Strong guessing
Let J be a κ-complete ideal on κ extending NSκ∣Eθκ. By Proposition 5.3, for any A∈J+∩P(Eθκ∩acc(E≥ρκ)), we may find cαA,J⊆E≥ρκ∩α for α∈A such that
•
for any α∈A, supcαA,J=α and o.t.(cαA,J)=θ ;
•
{α∈A:cαA,J⊆C}∈J+ for every C∈Cκ.
PROPOSITION 5.4**.**
Let J be a κ-complete ideal on κ extending NSκ∣Eθκ. Suppose that there is no descending (J,Iκ)-tower of length bκ. Then for any A∈J+∩P(Eθκ∩acc(E≥ρκ)), there is B∈J+∩P(A) such that
{α∈A:∃β<α(cαA,J∖β⊆C)}∈(J∣B)∗
for every C∈Cκ.
Proof. We follow the proof of Claim 2.1 in [17]. Fix A∈J+∩P(Eθκ∩acc(E≥ρκ)). Let Φ:Cκ→J+∩P(A) be defined by Φ(C)={α∈A:∃β<α(cαA,J∖β⊆C)}. Notice that
•
Φ(D)⊆Φ(C) for all D∈Cκ∩P(C) ;
•
∣Φ(D)∖Φ(C)∣<κ for all D∈Cκ such that ∣D∖C∣<κ.
Now suppose toward a contradiction that for any B∈J+∩P(A), there is C∈Cκ such that B∖Φ(C)∈J+. We inductively define Ci∈Cκ for i<bκ so that for j<i<bκ, Φ(Cj)∖Φ(Ci)∈J+ and ∣Φ(Ci)∖Φ(Cj)∣<κ. We put C0=κ. Now suppose that i>0, and Cj has been constructed for every j<i. By Observation 2.36 (i), we may find D∈Cκ such that ∣D∖Cj∣<κ for all j<i. By assumption, there must be H∈Cκ such that Φ(D)∖Φ(H)∈J+. We let Ci=D∩H. Finally, ⟨Φ(Ci):i<bκ⟩ is a descending (J,Iκ)-tower of length bκ, which yields the desired contradiction.
□
5.3 Club-guessing ideals
DEFINITION 5.5**.**
Given a κ-complete ideal J on κ extending NSκ∣Eθκ, we let XJ denote the collection of all B⊆κ such that either B∈J, or B∈J+ and there is dα⊆E≥ρκ∩α for α∈B∩Eθκ∩acc(E≥ρκ) such that
•
for any α∈B∩Eθκ∩acc(E≥ρκ), supdα=α and o.t.(dα)=θ ;
•
{α∈B∩Eθκ∩acc(E≥ρκ):∃β<α(dα∖β⊆C)}∈(J∣B)∗ for every C∈Cκ.
OBSERVATION 5.6**.**
(i)
Let B∈XJ. Then P(B)⊆XJ.
2. (ii)
Let A,B∈XJ. Then A∪B∈XJ.
REMARK 5.7*.*
Suppose that there is no descending (J,Iκ)-tower of length bκ. Then by Proposition 5.4, XJ∩P(H)∩J+=∅ for any H∈J+.
PROPOSITION 5.8**.**
Let J be a normal ideal on κ with Eθκ∈J∗. Suppose that there is no descending (J,Iκ)-tower of length bκ, and no ascending (J,Iκ)-tower of length κ+. Then κ∈XJ.
Proof. The proof is a modification of that of Lemma 2 in [17]. Let T denote the collection of those ascending (J,Iκ)-towers that have all their members in XJ. Given T,W∈T, put T<W just in case W is a proper extension of T. By Zorn’s Lemma, (T,<) has a maximal element, say T=⟨Bη:η<δ⟩.
Case 1 :δ is a successor ordinal, say δ=ξ+1.
Claim 1.κ∖Bξ∈J.
Proof of Claim 1. Suppose otherwise. Then by Remark 5.7, we may find R in XJ with R∈J+∩P(κ∖Bξ). Set Bδ=Bξ∪R and W=⟨Bγ:γ≤δ⟩. Then by Observation 5.6, W∈T, and moreover T<W. This contradiction completes the proof of the claim.
It follows from the claim and Observation 5.6 that κ∈XJ.
Case 2 :δ is a limit ordinal.
Put σ=cf(δ), and let ⟨δi:i<σ⟩ be an increasing sequence of ordinals with supremum δ. For i<σ, set Ki=Bδi+1. Then it is simple to see that ⟨Ki:i<σ⟩ is also a maximal element of T. Note that σ≤κ. Set H0=K0∖1, and for each i with 0<i<σ, Hi=Ki∖((⋃j<iKj)∪(i+1)). Notice that Hm∩Hn=∅ whenever m<n<σ.
Claim 2. Let i<σ. Then Hi∈J+.
Proof of Claim 2. This is obvious for i=0. For i>0, it suffices to observe that
(Bδi+1∖Bδi)∖⋃j<i(Bδj+1∖Bδi)⊆Hi,
which completes the proof of the claim.
For each i<σ, Hi∈XJ by Observation 5.6, so we may find dαi⊆E≥ρκ∩α for α∈Hi∩Eθκ∩acc(E≥ρκ) such that
•
for any α∈Hi∩Eθκ∩acc(E≥ρκ), supdαi=α and o.t.(dαi)=θ ;
•
{α∈Hi∩Eθκ∩acc(E≥ρκ):∃β<α(dαi∖β⊆C)}∈(J∣Hi)∗ for every C∈Cκ.
Put A=⋃i<σHi.
Claim 3.A∈XJ.
Proof of Claim 3. For α∈A, set cα=dαi, where α∈Hi. Now let C∈Cκ. For each i<σ, we may find Di∈J∗ such that for any α∈Di∩Hi∩Eθκ∩acc(E≥ρκ), there is β<α such that cα∖β⊆C. Put D={α<κ:∀i∈σ∩α(α∈Di)}. Notice that D∈J∗ by normality of J. Clearly, Hi∩D⊆Di for all i<σ. It follows that for any α∈D∩A∩Eθκ∩acc(E≥ρκ), there is β<α such that cα∖β⊆C, which completes the proof of the claim.
Claim 4.κ∖A∈J.
Proof of Claim 4. Suppose not. We proceed as in the proof of Claim 1. By Remark 5.7, there must be R∈XJ such that R∈J+∩P(κ∖A). Set Kδ=A∪R and W=⟨Ki:i≤σ⟩. Now for each i≤σ, Ki∖A⊆i+1, and therefore ∣Ki∖A∣<κ. By Observation 5.6, it follows that W∈T. However, T<W. This contradiction completes the proof of the claim.
By Claim 4 and Observation 5.6, κ∈XJ.
□
5.4 Full reflection
DEFINITION 5.9**.**
Given a stationary subset S of κ, and a stationary subset T of E≥ω1κ, Sreflects fully inT if there is G∈Cκ such that S reflects at every γ∈G∩T.
OBSERVATION 5.10**.**
Let σ<κ be a regular uncountable cardinal, and S be a stationary subset of κ that reflects fully in Eσκ. Then for any regular cardinal τ with σ≤τ<κ, S reflects fully in Eτκ.
FACT 5.11**.**
([23])* Suppose that κ is either weakly inaccessible, or the successor of a singular cardinal. Then for any regular uncountable cardinal χ<κ, and any stationary subset S of κ, S reflects fully in E≥χκ if and only if there are C∈Cκ and η<κ such that C∖S has no closed subset of order-type η.*
THEOREM 5.12**.**
Let S be a stationary subset of Eθκ that reflects fully in E≥ρκ. Suppose that either θ>ω, or ρ≥ω2. Then, setting J=NSκ∣S, there is either a descending (J,Iκ)-tower of length bκ, or an ascending (J,Iκ)-tower of length κ+.
Proof. We closely follow the proof of Lemma 3 in [17]. Suppose that the conclusion fails. Then by Proposition 5.4, there is cα⊆E≥ρκ∩α for α∈S∩acc(E≥ρκ) such that
•
for any α∈S∩acc(E≥ρκ), supcα=α and o.t.(cα)=θ ;
•
{α∈S∩acc(E≥ρκ):∃β<α(cα∖β⊆C)}∈J∗ for any C∈Cκ.
Pick G∈Cκ such that S reflects at every γ∈G∩E≥ρκ.
Case 1 :θ>ω.
Inductively define Cn∈Cκ for n<ω as follows. Set C0=G∩acc(E≥ρκ). Now suppose that Cn has been constructed. There must be H∈Cκ with the property that for any α∈H∩S∩acc(E≥ρκ), there is β<α such that cα∖β⊆acc(Cn). Put Cn+1=acc(Cn)∩H. Finally, set C=⋂n<ωCn and α=min(C∩S). Since α∈⋂n<ωCn+1, we may find η<α such that cα∖η⊆⋂n<ωacc(Cn). Pick γ∈cα∩⋂n<ωacc(Cn). Then γ∈E≥ρκ. Moreover, Cn∩γ is a closed unbounded subset of γ for every n<ω. Hence C∩γ is a closed unbounded subset of γ, and therefore (C∩S)∩γ=∅, which contradicts the minimality of α.
Case 2 :θ=ω.
In the same spirit as in Case 1, we define Cξ∈Cκ for ξ<ω1 so that
•
C0=G∩acc(E≥ρκ) ;
•
Cζ⊆Cξ for all ζ<ξ ;
•
for any α∈Cξ+1∩S, there is β<α such that cα∖β⊆acc(Cξ).
Set C=⋂ξ<ω1Cξ and α=min(C∩S). Since α∈⋂ξ<ω1Cξ+1 and o.t.(cα)=ω, there must be η<α such that cα∖η⊆⋂ξ<ω1acc(Cξ). Pick γ∈cα∩⋂ξ<ω1acc(Cξ). Then cf(γ)≥ρ>ω1, and moreover C∩γ is a closed unbounded subset of γ. Hence (C∩S)∩γ=∅. Contradiction.
□
Full reflection is a sufficient condition, but in general not a necessary one, as the following shows.
FACT 5.13**.**
([23])* Suppose that one of the following conditions holds :*
•
κ* is weakly inaccessible.*
•
κ=ν+, where ν is singular.
•
κ=ν+, where ν is regular and □ν holds.
Then any stationary subset T of κ has a stationary subset S with the property that for every regular uncountable cardinal σ<κ, S does not reflect fully in Eσκ.
5.5 Good points
Let A be an infinite set of regular cardinals such that ∣A∣<minA and supA<κ, and I be an ideal on A such that {A∩a:a∈A}⊆I.
DEFINITION 5.14**.**
We let ∏A=∏a∈Aa. For f,g∈∏A, we let f<Ig if {a∈A:f(a)≥g(a)}∈I.
DEFINITION 5.15**.**
Let f=⟨fα:α<κ⟩ be an increasing, cofinal sequence in (∏A,<I). An infinite limit ordinal δ<κ is a good point for f if there is a cofinal subset X⊆δ, and Zξ∈I for ξ∈X such that fβ(a)<fξ(a) whenever β<ξ are in X and a∈A∖(Zβ∪Zξ).
We let G(f) denote the set of good points for f.
FACT 5.16**.**
(i)
(Folklore)* If δ∈G(f), then cf(δ)<supA.*
2. (ii)
([4], [28])* Let δ<π be an infinite limit ordinal such that I is cf(δ)-complete. Then δ∈G(f).*
The following is due to Shelah.
FACT 5.17**.**
For i=0,1, let fi=⟨fαi:α<κ⟩ be an increasing, cofinal sequence in (∏A,<I). Then G(f0)△G(f1)∈NSκ.
Proof. Let D be the set of all δ∈acc(κ) with the property that for any ξ<δ, there are β,γ<δ such that fξ0<Ifβ1 and fξ1<Ifγ0. Let us show that D∩G(f0)=D∩G(f1). Thus fix i<1 and δ∈D∩G(fi). Let X⊆δ and Zξ∈I for ξ∈X witness that δ is a good point for fi. Define two increasing sequences ⟨βj:j<cf(δ)⟩ and ⟨γj:j<cf(δ)⟩ so that
([26])* Suppose that there exists an increasing, cofinal sequence f=⟨fα:α<κ⟩ in (∏A,<I). Then there exists an increasing, cofinal sequence g=⟨gα:α<κ⟩ in (∏A,<I) such that for any regular cardinal σ with ∣A∣<σ<supA, and any ordinal η with σ≤η<σ+, the following holds. For any β∈Eσ+3κ, and any closed unbounded subset C of β, there is a closed subset H of C of order-type η with H⊆G(g).*
PROPOSITION 5.19**.**
Let f=⟨fα:α<κ⟩ be an increasing, cofinal sequence in (∏A,<I), and σ be a regular cardinal with ∣A∣<σ<supA. Then, setting J=NSκ∣(G(f)∩Eσκ), there is either a descending (J,Iκ)-tower of length bκ, or an ascending (J,Iκ)-tower of length κ+.
Proof. Set ρ=σ+3, and let g=⟨gα:α<κ⟩ be as in the statement of Fact 5.18.
Claim. Let γ∈E≥ρκ. Then G(f)∩Eσκ∩γ is stationary in γ.
Proof of the claim. Let C be a closed unbounded subset of γ. Then we may find β∈Eρκ∩(γ+1) such that C∩β is cofinal in β. There must be a closed subset H of C∩β of order-type σ+1 with H⊆G(g). Then maxH∈C∩G(f)∩Eσκ, which completes the proof of the claim.
Note that by the claim, G(g)∩Eσκ is stationary in κ. By Fact 5.17, so is G(f)∩Eσκ, and moreover NSκ∣(G(g)∩Eσκ)=J. The desired conclusion is now immediate from Theorem 5.12.
□
5.6 Robustness of Diamond
Unlike Club (see e.g. [8]), Diamond is remarkably robust, in the sense that a small modification in its definition will often yield an equivalent principle. For a striking example of this, consider the following result which was first established by Primavesi [36] for any J of the form NSω1∣S.
OBSERVATION 5.20**.**
Given a κ-complete ideal J on κ extending NSκ, the following are equivalent :
(i)
♢κ[J]* holds.*
2. (ii)
There is sα⊆α for α<κ such that {α:sα=C∩α}∈J+ for all C∈Cκ.
Proof. (i) → (ii) : Trivial.
(ii) → (i) : The proof is a modification of that of Theorem 3.0.10 in [36]. Let ⟨sα:α<κ⟩ be as in (ii).
Claim 1.♣κ[J] holds.
Proof of Claim 1. For α∈acc(κ), put tα=sα∖acc(sα). Now fix A∈[κ]κ. Put C=A∪acc(A),
D={α∈acc(κ):sup((C∖acc(C))∩α)=α}
and S={α<κ:sα=C∩α}. Clearly for any α∈D∩S, tα⊆C∖acc(C)⊆A, and moreover suptα≥sup((C∖acc(C))∩α)=α, which completes the proof of the claim.
Claim 2.2<κ=κ.
Proof of Claim 2. Let τ be an infinite cardinal less than κ. Put c=acc(κ)∩τ, and for any a⊆τ∖acc(κ), Ca=c∪a∪(κ∖τ) and Ta={α<κ:sα=Ca∩α}. Then clearly, sα∩(τ∖acc(κ))=a for all α∈Ta. It follows that 2τ≤κ, which completes the proof of the claim.
Finally, by Claims 1 and 2 and Observation 2.22, ♢κ[J] holds.
□
The starred version is established in the same way :
OBSERVATION 5.21**.**
Given a κ-complete ideal J on κ extending NSκ, the following are equivalent :
(i)
♢κ∗[J]* holds.*
2. (ii)
There is sαi⊆α for i<α<κ such that {α:∃i<α(sαi=C∩α)}∈J∗ for all C∈Cκ.
Not so surprisingly, the situation is different with Club. Suppose for instance that κ=ν+, where ν is singular, and J is a normal κ+-saturated ideal on κ (by work of Foreman [10], this is consistent relative to a huge cardinal). Then by Observation 2.27, ♣κev[J] fails. However by Proposition 5.3, we may find sα⊆α with supsα=α for α∈acc(κ) such that {α:sα⊆C}∈J+ for all C∈Cκ.
6 Embarrassing questions
In this section we attempt to probe the depth of the author’s ignorance. Unfortunately, as will shortly be seen, no lower bounds were found.
QUESTION 6.1**.**
Let J be a normal ideal on κ that is not κ+-saturated. Does there then exist an ascending (J,J)-tower of length κ+ ?
QUESTION 6.2**.**
Does ♢κ[J] imply the existence of a descending (respectively, ascending) (J,J)-tower of length 2κ ?
Is it always true that any nontrivial club-like principle for J implies some degree of nonsaturation for J ? Let us consider the following test case. For a κ-complete ideal J on κ extending NSκ, and a cardinal σ with 2≤σ≤κ, let ♣κev,σ[J] assert the existence of sα⊆α with supsα=α for α∈acc(κ) with the property that for any f:κ→σ, there is i<σ such that
{α∈acc(κ):∃β<α((sα∖β)∩f−1({i})=∅)}∈J+.
♣κev,2[NSω1] is the principle ♣w2 studied in [12]. Notice that ♣κev,σ[J] gets weaker as σ increases.
OBSERVATION 6.3**.**
Suppose that J is normal and ♣κev,κ[J] holds. Then J is not prime.
Proof. Suppose otherwise. Let sα⊆α for α∈acc(κ) witness that ♣κev,κ[J] holds. By a standard argument we may find S⊆κ such that T={α∈acc(κ):sα=S∩α} lies in J∗. Notice that ∣S∣=κ. Select f:κ→κ so that for any i<κ, ∣f−1({i})∣=κ, and moreover ∣f−1({i})∖S∣≤1. Now fix i<κ. Then clearly sup(f−1({i})∩sα)=α for any α∈T such that sup(f−1({i})∩α)=α. Contradiction.
□
QUESTION 6.4**.**
Does ♣κev,2[J] imply that J is not κ-saturated ?
7 Turrology / Clubology
We think that behind each result on nonsaturation, there is a tower (respectively, a club). If we do not see it right away, it does not mean that it is not there, just that more research is needed to find it. It is our opinion that such research is socially useful, as there should be a tower (respectively, a club) for everyone, not just for higher-ups.
Acknowledgements. The author would like to thank Assaf Rinot for fruitful discussions. He is deeply indebted to Moti Gitik for his contribution to this paper.
Bibliography49
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] B. BALCAR and P. SIMON, Disjoint refinement , in : Handbook of Boolean Algebras (J.D. Monk and R. Bonnet, eds.), vol. 2, North-Holland, 1989, pp. 333-388.
2[2] J.E. BAUMGARTNER, Almost disjoint sets, the dense set problem and the partition calculus , Annals of Mathematical Logic 10 (1976), 401-439.
3[3] J.E. BAUMGARTNER, A.D. TAYLOR and S. WAGON, Structural properties of ideals, Dissertationes Mathematicae CXCVII, Warszawa, 1982.
4[4] J. CUMMINGS, M. FOREMAN and M. MAGIDOR, Squares, scales and stationary reflection , Journal of Mathematical Logic 1 (2001), 35-98.
5[5] J. CUMMINGS and S. SHELAH, Cardinal invariants above the continuum , Annals of Pure and Applied Logic 75 (1995), 251-268.
6[6] M. DŽAMONJA, On club-like principles on regular cardinals above ℶ ω subscript ℶ 𝜔 \beth_{\omega} , Acta Universitatis Carolinae - Mathematica et Physica 42 ( 2001), 27-32.
7[7] M. DŽAMONJA and S. SHELAH, Saturated filters at successors of singulars, weak reflection and yet another weak club principle , Annals of Pure and Applied Logic 79 (1996), 289-316.
8[8] M. DŽAMONJA and S. SHELAH, Similar but not the same : various versions of ♣ ♣ \clubsuit do not coincide , Journal of Symbolic Logic 64 (1999), 180-198.