datatype=bibtex]Ref.bib
Towers and gaps at uncountable cardinals
Vera Fischer
UniversitÀt Wien,
Kurt Gödel Research Center for Mathematical Logic, Wien, Austria
[email protected]
http://www.logic.univie.ac.at/$\sim$vfischer/
,Â
Diana Carolina Montoya
UniversitÀt Wien,
Kurt Gödel Research Center for Mathematical Logic, Wien, Austria
[email protected]
http://www.logic.univie.ac.at/$\sim$montoyd8/
,Â
Jonathan Schilhan
UniversitÀt Wien,
Kurt Gödel Research Center for Mathematical Logic, Wien, Austria
[email protected]
 andÂ
DĂĄniel T. Soukup
UniversitÀt Wien,
Kurt Gödel Research Center for Mathematical Logic, Wien, Austria
[email protected]
http://www.logic.univie.ac.at/$\sim$soukupd73/
Abstract.
Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either p(Îș)=t(Îș) or there is a (p(Îș),λ)-gap of club-supported slaloms for some λ<p(Îș). While the existence of such gaps is unclear, this is a promising step to lift Malliaris and Shelahâs proof of p=t to uncountable cardinals. We do analyze gaps of slaloms and, in particular, show that p(Îș) is always regular; the latter extends results of Garti. Finally, we turn to club variants of p(Îș) and present a new model for the inequality p(Îș)=Îș+<pclâ(Îș)=2Îș. In contrast to earlier arguments by Shelah and Spasojevic, we achieve this by adding Îș-Cohen reals and then successively diagonalising the club-filter; the latter is shown to preserve a Cohen witness to p(Îș)=Îș+.
2010 Mathematics Subject Classification:
03E05, 03E17
1. Introduction
The classical tower and pseudo-intersection numbers (t and p, respectively) have played a significant role in the study of cardinal characteristics of the continuum and special subsets of the reals. The cardinal t is the minimum size of a tower of subsets of Ï i.e., a ââ-decreasing sequence of subsets of Ï with no infinite pseudo-intersection, and p is the minimum size of a base for a filter on Ï with no infinite pseudo-intersection.
It was unknown for a long time whether these two cardinals coincide. Rothberger proved in [Rot39] and [Rot48] that pâ€t and also that if p=â”1â then t=â”1â as well. Results from the years after Rothbergerâs paper suggest that the consistency of p<t seemed plausible to many set-theorists working in the area. Hence, the groundbreaking result of Malliaris and Shelah [MS16] came with considerable surprise: the cardinals t and p are provably equal.
Meanwhile, recent years have seen an increased interest in the study of the combinatorics of the generalized Baire spaces ÎșÎș, when Îș is an uncountable regular cardinal. This fruitful new area of research provided extensions of classical results from the Îș=Ï case often requiring the development of completely new machinery to do so. Striking new inequalities were proved as well between cardinal invariants of ÎșÎș which are known to fail in the classical setting.
Thus a natural question becomes: Does Malliaris and Shelahâs result mentioned above lift to the uncountable?
The goal of the current paper is the study of the higher analogues of the tower and pseudo-intersection numbers. We start with some basic definitions.
Definition 1.1**.**
Let Îș be a regular uncountable cardinal.
- (1)
Let F be a family of subsets of Îș. We say that F has the strong intersection property (in short, SIP) if for any subfamily FâČâF of size <Îș, the intersection âFâČ has size Îș.
2. (2)
We say that AâÎș is a pseudo-intersection of F if AââF for all FâF.111As usual, AââF means that AâF has size <Îș.
3. (3)
A tower T is a ââ-well-ordered family of subsets of Îș with the SIP that has no pseudo-intersection of size Îș.
In the countable case, any ââ-well-ordered family of infinite sets has the SIP. However, for uncountable Îș, the SIP requirement is necessary as there are countable ââ-decreasing families of subsets of Îș with no pseudo-intersection of size Îș.222E.g., consider a partition of Îș into sets {Xnâ:n<Ï} and look at T={âmâ„nâXmâ:nâÏ}.
Definition 1.2** (The pseudo-intersection and tower number).**
- (1)
The pseudo-intersection number for Îș, denoted by p(Îș), is defined as the minimal size of a family Fâ[Îș]Îș which has the SIP but no pseudo-intersection of size Îș.
2. (2)
The tower number for Îș, denoted by t(Îș), is defined as the minimal size of a tower Tâ[Îș]Îș of subsets of Îș.
3. (3)
pclâ(Îș) is the minimal size of a family F of club subsets of Îș with no pseudo-intersection of size Îș.
4. (4)
tclâ(Îș) the minimal size of a tower T of club subsets of Îș.
Note that
in the definition of pclâ(Îș) and tclâ(Îș), there is no need to assume the SIP as any family of clubs has the strong intersection property. For higher analogues of p and t which do not require the SIP property see Section 6.1 of our Appendix.
The study of the above cardinal invariants was initiated by Garti [Gar11] and one of the results which motivated the work on this project is the following:
Theorem 1.3**.**
[Gar11]**
Let Îș be an uncountable cardinal such that Îș<Îș=Îș.
- (1)
If p(Îș)=Îș+, then t(Îș)=Îș+.
2. (2)
If cf(2Îș)â{Îș+,Îș++}, then p(Îș)=t(Îș).
3. (3)
cf(p(Îș))î =Îș.
Related consistency results also appear in the very recent paper of Ben-Neria and Garti [BG19].
Structure of the paper:
The current paper is structured as follows. In Section 2 we introduce a natural higher analogue of the notion of a gap which gives an interesting analogue of a theorem of Malliaris-Shelah, which is central to the proof of p=t. More precisely, we work with club-supported gaps of slaloms333Note that there are no real gaps of function in ÎșÎș. Indeed, there is no infinite <â-decreasing sequence of functions in ÎșÎș when Îșâ„cf(Îș)>Ï. (see Definition 2.5) and prove:
Theorem 1.4**.**
Let Îș be a regular cardinal such that Îș<Îș=Îș. Either p(Îș)=t(Îș) or there is a λ<p(Îș) and club-supported (p(Îș),λ)-gap of slaloms.
In Section 3, we study the possible sizes of gaps of slaloms which
leads in particular to the following result (see Corollary 3.4):
Theorem 1.5**.**
For any uncountable, regular Îș, p(Îș) is regular.
Additionally, we consider a higher analogue of Martinâs Axiom
(see Definition 3.11) and its effect on certain club-supported gaps of slaloms (see Theorem 3.12).
In Section 4, we look at the relation of p(Îș) and its restriction to the club filter, pclâ(Îș). Apart from showing that pclâ(Îș)=tclâ(Îș)=b(Îș) (see Observation 4.2), we prove:
Theorem 1.6**.**
(GCH) For any regular uncountable Îș<λ, where Îș=Îș<Îș, there is a Îș-closed, Îș+-cc forcing extension in which p(Îș)=Îș+<pclâ(Îș)=λ=2Îș.
Moreover, we extend the above result to a certain class of Îș-complete filters on Îș (see Theorem 4.10). The consistency of p(Îș)<b(Îș)(=pclâ(Îș)) is originally due to Shelah and SpasojeviÄ [SS02], however our techniques significantly differ from theirs: We add Îș-Cohen reals and then successively diagonalise the club-filter while preserving a Cohen witness to p(Îș)=Îș+. We conclude the paper with a list of interesting remaining open questions and a short appendix containing proofs and related results that did not quite fit in earlier sections.
1.1. Notation, terminology and preliminaries
We aimed our paper to be self contained.
For a function fâÎșÎș, we say that CâÎș is f-closed if for any ΟâC and ζ<Ο, f(ζ)<Ο. Note that for any f, there are f-closed clubs (since Îș is regular). For a club CâÎș, we let succCâ denote the function
[TABLE]
In forcing arguments, smaller conditions are stronger.
One of the main tools in the study of p has been Bellâs theorem: for any Ï-centered poset P and for any collection D of <p-many dense subsets of P, there is a filter GâP that meets each element of D. A higher
analogue of Bellâs theorem has been given by Schilhan in [Sch17].
Definition 1.7** (Directed and Îș-specially centered posets).**
A subset CâP is called Îș-directed, if given Dâ[C]<Îș, there is a condition qâP such that qâ€p for every pâD.
A poset P is Îș-centered if there exists a sequence {CÎłâ:Îł<Îș} of Îș-directed subsets of P so that P=âÎł<ÎșâCÎłâ.
Assume P is <Îș-closed and Îș-centered, say P=âÎł<ÎșâCÎłâ where all CÎłâ are Îș-directed. Say that P is Îș-centered with canonical lower bounds if there is a function f=fP:Îș<ÎșâÎș such that whenever λ<Îș and (pαâ:α<λ) is a decreasing sequence with pαââCγαââ, then there is pâCÎłâ with pâ€pαâ for all α<λ and Îł=f(γαâ:α<λ).
For convenience of the reader, we state the higher analogue of Bells theorem mentioned above, as it appears an important tool in the analysis of p(Îș) and t(Îș).
Theorem 1.8**.**
Let Îș<Îș=Îș.
Assume P is a Îș-centered poset with canonical lower bounds and below every pâP, there is a Îș-sized antichain. Then for any collection D of <p(Îș)-many dense subsets of P, there is a filter GâP that meets each element of D.
1.2. Acknowledgments
The authors would like to thank the Austrian Science Fund (FWF) for the generous support through START Grant Y1012-N35 (Fischer, Montoya and Schilhan ), Grant I4039 (Fischer) and Grant I1921 (Soukup). The last author was also supported by NKFIH OTKA-113047.
2. On p(Îș),t(Îș) and gaps
In their seminal work, Malliaris and Shelah [MS16] proved that the classical cardinal invariants p and t coincide, answering a longstanding open problem. By now, various interpretations of their proof surfaced (see [Roc14, Fre16, CM17, Sch17, Ulr18])
and we shall outline an argument for p=t to motivate our results presented here.
First, we need two notions of gaps. Let yËâ=(yαâ:α<λ),xË=(xÎČâ:ÎČ<Îș) be sequences from ÏÏ. We say that (yËâ,xË) is a pre-gap if for every Îł<α<λ and ÎŽ<ÎČ<Îș,
[TABLE]
Definition 2.1** (Tight gaps).**
We call (yËâ,xË) a (λ,Îș)-tight gap if it is a pre-gap and for any zâÏÏ:
[TABLE]
Definition 2.2** (Peculiar gaps).**
A pre-gap (yËâ,xË) is a (λ,Îș)-peculiar gap if for all Aâ[Ï]Ï and zâÏA,
[TABLE]
In other words, a peculiar gap is a pre-gap which is tight everywhere.
We give a short outline of the proof of p=t. We shall inductively aim to build a tower from a witness to p using the following notion.
Definition 2.3**.**
Let A be a family of subsets of Ï with the SIP and let B be an ââ-decreasing sequence of subsets of Ï, such that every element of B has infinite intersection with all AâA (write Bâ„A). We say that B is a pseudo-parallel of A if there is a pseudo-intersection of B that has infinite intersection with all elements of A.
Lemma 2.4**.**
- (1)
(Malliaris, Shelah **[MS16]**) If A={Aαâ:α<Îș} is not a pseudo-parallel of B={BÎČâ:ÎČ<p} for Îș<p, then there exists either a tower of length p or a (p,Îș)-peculiar gap.
2. (2)
(Shelah **[She09*]**) If there is a (p,Îș)-peculiar gap, then there is a tower of length p.
*
Let (Aαâ)α<pâ be a family of subsets of Ï witnessing p that is additionally closed under finite intersections. Define a sequence of sets Bαâ as follows. Let B0â=A0â and suppose we have constructed BÎČâ={Bαâ:α<ÎČ} for some ÎČ<p such that BÎČââ„A. If ÎČ is a successor ordinal η+1 put BÎČâ=Bηââ©AÎČâ. Then BÎČ+1ââ„A. If ÎČ is a limit ordinal and BÎČâ is a pseudo-parallel of A, take B be a witness for this property and put BÎČâ=Bâ©AÎČâ.
Then, we have the following cases: either it is possible to carry the construction along p-many steps, in which case the family {Bαâ:α<p} is a tower of length p; or there is some ordinal ÎČ<p (which we can assume is regular) such that the family BÎČâ={Bαâ:α<ÎČ} is not a pseudo-parallel of A. Then, by Lemma 2.4, there is a tower of size p, which finishes the proof.
The following results are motivated by the question whether p(Îș)=t(Îș) holds for an uncountable cardinal Îș. Theorem 2.7 below is a generalized version of Lemma 2.4 (1) for uncountable cardinals.
Definition 2.5** (Slaloms).**
- (1)
Suppose that Dâ[Îș]Îș is a <Îș-closed filter. A D-supported slalom is a map u:Xâ[Îș]<Îșâ{â
} so that XâD. We also say that u is an X-based slalom.
2. (2)
If u is a D-supported slalom, then
let set(u)=âΟâdom(u)âu(Ο).
3. (3)
Whenever u,v are D-supported slaloms and for all but <Îș many Οâdomuâ©domv, u(Ο)âv(Ο), we write uââv.
Definition 2.6**.**
(Gaps of D-supported slaloms) A D-supported (ÎŒ,λ)-gap of slaloms is a pair of two sequences (uÎłâ)Îł<ÎŒâ and (vαâ)α<λâ of D-supported slaloms so that
- (1)
for any Îł<ÎłâČ<ÎŒ and α<αâČ<λ,
[TABLE]
2. (2)
there is no D-supported slalom w so that for all Îł<ÎŒ and α<λ,
[TABLE]
With this, we are ready to state our main theorem.
Theorem 2.7**.**
Let Îș be a regular cardinal such that
Îș<Îș=Îș. Either p(Îș)=t(Îș) or there is a λ<p(Îș) and club-supported (p(Îș),λ)-gap of slaloms.
Proof.
Suppose that (Aαâ)α<p(Îș)â is a family with the SIP but no pseudo-intersection. Let EÎłâ denote a pseudo-intersection for (Aαâ)αâ€Îłâ for Îł<p(Îș). Further, suppose that p(Îș)<t(Îș).
Claim 2.8**.**
There is a club XâÎș so that for all Îł<p(Îș) and almost all ΟâÎș,
[TABLE]
Proof.
For each Îł, let XÎłâ be the set of accumulation points of EÎłâ. Then XÎłâ is a club in Îș and for all ΟâÎș, EÎłââ©[Ο,sXÎłââ(Ο))î =â
.
Since p(Îș)<t(Îș)â€tclâ(Îș)=pclâ(Îș) (see Observation 4.2), we can find a single club X that is a pseudo-intersection of (XÎłâ)Îł<p(Îș)â.
â
Let us try and build sequences {Bαâ}α<p(Îș)â, {Yαâ}α<p(Îș)â so that for each ÎČ<p(Îș),
- (1)
YÎČâ is a club,
2. (2)
BÎČâââBαâ and YÎČâââYαâ for all α<ÎČ,
3. (3)
BÎČâââAÎČâ, and
4. (4)
for all Îł<p(Îș) such that ÎČâ€Îł,
[TABLE]
We could not succeed in constructing such a sequence of length p(Îș), as otherwise {Bαâ}α<p(Îș)â would be a tower of length p(Îș)<t(Îș) without pseudo-intersection. First, note that the SIP is still preserved at any intermediate stage.
Claim 2.9**.**
The sequence
{Bαâ}α<λâ has the SIP.
Proof.
Suppose that Iâ[λ]<Îș. Then Y=âÏâIâYÏâ is a club and for any Îłâp(Îș)âsupI, the set âΟâYâEÎłââ©[Ο,sXâ(Ο)) has size Îș and is a pseudo-intersection to {BÏâ}ÏâIâ.
â
Moreover, we can only fail at some limit step ÎČ<p(Îș) along the construction. Indeed, if ÎČ<p(Îș) and both BÎČâ and YÎČâ have been already constructed we can put BÎČ+1â=BÎČââ©AÎČ+1â and YÎČ+1â=YÎČâ.
Fix this ÎČ where the induction must fail and lets try to approximate BÎČâ and see what goes wrong. First, take some pseudo-intersection club Z to the sequence {Yαâ}α<ÎČâ.
Lemma 2.10**.**
There is a ââ-increasing sequence of slaloms
[TABLE]
so that domuÏâ=ZÏâ is a club such that for all Ï and all α<ÎČ
[TABLE]
The intuition is that each slalom uÎłâ gives an approximation for BÎČâ by set(uÎłâ) which satisfies condition (4) with this fixed Îł.
Proof.
The sequence is constructed inductively. Suppose we have defined {ZÏâ}ÎČâ€Ï<Îłâ and {uÏâ}ÎČâ€Ï<Îłâ for some Îłâp(Îș)âÎČ. We will try to force to find the next slalom uÎłâ.
Let ZÎłââ be a club, which is a pseudointersection of {ZÏâ}ÎČâ€Ï<Îłâ and consider the poset PÎłâ consisting of all triples (Μ,Y,n) such that
- (1)
dom(Μ)â[ZÎłââ]<Îș is closed and nâÎș,
2. (2)
âΟâdom(Μ)
[TABLE]
3. (3)
Y=Y0ââȘY1ââ[Îł]<Îș
where Y0ââ[ÎČ,Îł) and
Y1ââÎČ, and
4. (4)
if ΟâZÎłââân then
[TABLE]
and
[TABLE]
The extension relation is defined as follows: (ÎŒ,X,m)â€(Μ,Y,n) iff ÎŒâΜ, XâY, mâ„n and for all Οâdom(ÎŒ)âdom(Μ):
[TABLE]
Observation 2.11**.**
For any pair (Μ,Y) which satisfies condition (1)-(3) above and almost all nâÎș, (Μ,Y,n)âPÎłâ.
Proof.
Using the facts that âŁY0ââŁ<Îș, âŁY1ââŁ<Îș and uÏâ(Ο)â[Ο,sXâ(Ο)) we can find n(Y0â,Y1â)âÎș such that for each ΟâZÎłââân(Y0â,Y1â),
[TABLE]
Moreover, by the hypothesis on {Bαâ}α<ÎČâ for each ÏâY1â,
âΟâYÏââEÎłââ©[Ο,sXâ(Ο))ââBÏâ. However ZÎłââââYÏâ for each ÏâY1â and EÎłâââAÎČâ. Thus we can find m(Y1â)âÎș such that for each ΟâZÎłâââm(Y1â) we have
[TABLE]
Now, any n>max{η,m(Y1â),n(Y0â,Y1â),maxdom(Μ)} works.
â
Claim 2.12**.**
The poset PÎłâ is Îș-specially centered.
Proof.
Indeed, by Îș<Îș=Îș, Îș-centerdness holds if <Îș-many conditions with the same first coordinate are compatible. In the latter case, we can apply the above observation to see that such conditions do have common lower bounds.
â
Claim 2.13**.**
The poset PÎłâ is <Îș-closed with canonical lower bounds.
Proof.
If {piâ}i<jâ is a decreasing
sequence of conditions, where j<Îș and piâ=(Μiâ,Yiâ,niâ) then
let Μâ=âi<jâΜiâ,Y=âi<jâYiâ and n=supi<jâniâ. Now extend Μâ to Μ by defining
[TABLE]
This triple (Μ,Y,n) is in PÎłâ and defines the canonical lower bound.
â
For each ÏâÎł the set DÏâ={(Μ,Y,n)âPÎłâ:ÏâY} is dense. Indeed, given
Ï and (Μ,Y,n)âPÎłâ we can find a large enough nâ above n so that (Μ,YâȘ{Ï},nâ) extends (Μ,Y,n). Furthermore:
Claim 2.14**.**
For each ηâÎș the set
Dη={(Μ,Y,n)âPÎłâ:âζ>η(ζâdom(Μ))} is dense in PÎłâ.
Proof.
For any ζ>max(η,n), we can define ÎŒâΜ on the set domΜâȘ{ζ} by
[TABLE]
Then (Ό,Y,n) belongs to Dη and extends (Μ,Y,n).
â
By the generalized Bellâs theorem, there is a filter GâPÎłâ intersecting all the above dense sets. Thus, we can finally define
[TABLE]
Observe that ZÎłâ=domuÎłâ is a club subset of ZÎłââ and hence a pseudo-intersection of all the other ZÎČâ for ÎČ<Îł.
â
Note how set(uÎłâ) is a reasonable candidate for BÎČâ (with ZÎłâ playing the role of YÎČâ):
Observation 2.15**.**
set(uÎłâ)* is almost contained in AÎČâ and all Bαâ for α<ÎČ, and also satisfies condition (4) for a particular Îł.*
Finally, let us take a pseudo-intersection club for (ZÎłâ)ÎČâ€Îł<p(Îș)â which we shall call Z again to ease notation. Now, we define
[TABLE]
for α<ÎČ and ΟâZ. In turn, for all Îł<ÎłâČ,α<αâČ and almost all ΟâZ,
[TABLE]
Finally, if there is a club YÎČââZ and w(Ο)â[Ο,sXâ(Ο)) for ΟâYÎČâ so that for all Îł,α and almost all ΟâYÎČâ,
[TABLE]
then BÎČâ=set(w) would extend {Bαâ}α<ÎČâ. Since this is impossible (the construction of the B-sets failed at step ÎČ), we must have produced a (p(Îș),ÎČ)-gap of club-supported slaloms.
â
3. On the sizes of gaps of slaloms
Naturally, Theorem 2.7 prompts us to study the existence of (λ1â,λ2â)-peculiar gaps more closely. In fact, to prove p(Îș)=t(Îș), it would suffice to show that there are no D-supported (p(Îș),λ)-gaps of slaloms supported for some filter D. We could not prove this yet, however, building on [She09], we shall present some weaker statements.
Propositions 3.1 together with Theorem 2.7 show that p(Îș) is regular. The results
in this section show that in a certain sense there are no club-supported gaps of slaloms which are small on both sides. However
in Proposition 3.6 we show that there are short decreasing sequences of slaloms with no lower bound. Finally, in Theorem 3.13, we see how generalized forms of MA effect the existence of gaps.
Proposition 3.1**.**
Suppose Îș=Îș<Îșâ€Î»1â,λ2â are regular cardinals and that there is a club-supported (λ1â,λ2â)-gap of slaloms. Then p(Îș)â€max{λ1â,λ2â}.
Proof.
Let (uαâ:α<λ1â) and (vÎČâ:ÎČ<λ2â) be a club-supported (λ1â,λ2â)-gap of slaloms and assume λ2â<p(Îș). We can assume all the slaloms are defined on a common club C (by taking a pseudo-intersection for all the domains). We shall find a single w that fills the gap on a club set using the generalized version of Bellâs theorem (see Theorem 1.8).
We define a Îș-specially centered poset Q as follows. Conditions in Q are triples q=(sq,Ï1qâ,Ï2qâ) where
- (1)
sq is a partial slalom defined some closed, bounded subset of C,
2. (2)
Ïiqââ[λiâ]<Îș for i=1,2, and
3. (3)
for any αâÏ1qâ,ÎČâÏ2qâ and η>maxdoms, uαâ(η)âvÎČâ(η).
The order on Q is defined as follows: We say pâ€q if and only if spâsq, ÏipââÏiqâ and for all ηâdom(sp)âdom(sq),
[TABLE]
Claim 3.2**.**
Q* is a Îș-closed, Îș-specially centered forcing notion of size λ2â.*
Proof.
For a fixed closed and bounded sâC, any subset of Qsâ={qâQ:sq=s} has a canonical lower bound. So the partition
[TABLE]
witnesses the claim.
â
Claim 3.3**.**
For each η<Îș, α<λ1â and ÎČ<λ2â the following sets are dense in Q:
- (1)
Dηâ={qâQ:η<maxdomsq}, and
2. (2)
Eα,ÎČâ={qâQ:αâÏ1qâ,ÎČâÏ2qâ}.
Proof.
Fix qâQ, η<Îș and α<λ1â, ÎČ<λ2â.
Let qâČ=(sâČ,Ï1qââȘ{α},Ï2qââȘ{ÎČ}) so that domsâČ=domsâȘ{ÎŒ} and for any αâČâÏ1qââȘ{α} and ÎČâČâÏ2qââȘ{ÎČ}, if η>ÎŒ then uαâČâ(η)âvÎČâČâ(η). Moreover, pick ÎŒ to be above η and define sâČ(ÎŒ)=âαâÏ1qââuαâ(ÎŒ). Then qâČ is a condition extending q and qâČâDηââ©Eα,ÎČâ, as desired.
â
By Theorem 1.8, we can take a filter GâQ which intersects all the dense sets {Dηâ}η<ÎșââȘ{Eα,ÎČâ}(α,ÎČ)âλ1âĂλ2ââ.
Then D=â{domsq:qâG} is a club and
[TABLE]
is a slalom with domain D.
Fix any (α,ÎČ)â(λ1â,λ2â) and pick
qâEα,ÎČââ©G. Then for any η>maxdomsq, we have uαâ(η)ââw(η)ââvÎČâ(η) and so
[TABLE]
which finishes the proof.
â
Corollary 3.4**.**
p(Îș)* is regular.*
Proof.
This follows immediately from Theorem 2.7 and Proposition 3.1. Indeed, if p(Îș)=t(Îș) then we are done since the latter is regular. Otherwise, there is a (p(Îș),λ1â)-gap of slaloms with λ1â<p(Îș). If p(Îș) is singular of cofinality λ0â then we can shrink the left-hand side of the original (p(Îș),λ1â)-gap and get a (λ0â,λ1â)-gap of slaloms. This however, contradicts Proposition 3.1.
â
Yet another bound on the sizes of gaps is the following.
Proposition 3.5**.**
Suppose that Îș is a regular, uncountable cardinal.
If λ<b(Îș) then there is no club-supported (Îș,λ)-gap of slaloms on Îș.
Proof.
Let λ<b(Îș). Suppose that uË=(uαâ:α<Îș) and vË=(vΟâ:Ο<λ) are sequences of club-supported slaloms on Îș, uË is increasing, vË is decreasing and uαâââvΟâ for all α<Îș,Ο<λ.
Let Cαâ=domuαâ. For any club C which is a subset of the diagonal intersection Îα<ÎșâCαâ, we can define a slalom wCâ on C by
[TABLE]
It is clear that uαâââwCâ for any α<Îș.
Given a fixed Ο<λ, there is a club DΟâ so that ÎČâDΟâ and α<ÎČ implies that uαâ(ÎČ)âvΟâ(ÎČ). The family {DΟâ:Ο<λ} must have a pseudo-intersection D since λ<b(Îș)=pclâ(Îș).
Finally, let w=wCâ where C=Dâ©Îα<ÎșâCαâ. Now, for any α<Îș and Ο<λ, uαâââwââvΟâ
and so uË,vË is not a gap.
â
In particular, we proved that any Îș-sequence of club-supported slaloms on Îș has an upper bound. There is an interesting asymmetry here, as there are short decreasing sequences of slaloms without lower bounds.
Proposition 3.6**.**
Suppose that Îș=Îș<Îș is a regular, uncountable cardinal.
- (1)
There is a ââ-decreasing, Îș-sequence of club-supported slaloms on Îș that has no lower bound supported on a stationary set.
2. (2)
For any regular Îșâ€Î», there is Îș-specially centered poset P which introduces a decreasing λ-sequence of club-supported slaloms on Îș with no lower bound supported on a club.
Proof.
(1) The case λ=Îș will be instructive to understand the more general argument of (2). We define the decreasing sequence of slaloms vË=(vÎČâ:ÎČ<Îș) with the following properties
- (1)
vαâ:Îșâ[Îș]<Îșâ{â
},
2. (2)
for any α<ÎČ<Îș and η>ÎČ, vαâ(η)âvÎČâ(η),
3. (3)
for any limit ÎČâÎș, âα<ÎČâvαâ(ÎČ)=â
.
The construction is done in Îș steps: at step ÎČ, we define vαâ(ÎČ) for α<ÎČ and vÎČââŸÎČ+1. If ÎČ is a limit ordinal, then we make sure that the sequence of sets {vαâ(ÎČ):α<ÎČ} is strictly decreasing with empty intersection. We can pick vÎČââŸÎČ+1 arbitrarily, for example, vÎČâ(η)={0} for all ηâ€ÎČ.
If ÎČ=α+1 then again we make sure that {vαâČâ(ÎČ):αâČâ€Î±} is strictly decreasing and we can pick vÎČâ(η)={0} for all ηâ€ÎČ.
Finally, given such a sequence vË, assume that w:Sâ[Îș]<Îșâ{â
} and wââvαâ for all α<Îș. If S is stationary then we can find a limit ÎČâS so that α<ÎČ implies that w(ÎČ)âvαâ(ÎČ). In turn, âα<ÎČâvαâ(ÎČ)î =â
and this contradiction finishes the proof.
(2) For a general λ<p(Îș), we will force as follows. Define P to be the set of conditions of the form p=(sαpâ)αâÏpâ so that Ïpâ[λ]<Îș and there is some ÎŒp<Îș such that sαpâ:ÎŒpâ[Îș]<Îșââ
.
Extension in P works as follows: pâ€q if
- (1)
ÏpâÏq,
2. (2)
for any αâÏq, sαpââsαqâ, and
3. (3)
for any α<ÎČâÏq and ηâÎŒpâÎŒq,
[TABLE]
The following should be straightforward to check:
- (a)
P is Îș-specially centered;
2. (b)
Dηâ={pâP:ηâ€ÎŒp} is dense in P;
3. (c)
Eαâ={pâP:αâÏp} is dense in P.
So, we can take a generic filter GâP and define
[TABLE]
Observe that if α<ÎČ<λ and α,ÎČâÏp for some pâG then for any ηâ„ÎŒp, vÎČâ(η)âvαâ(η). So, (vαâ)α<λâ is a decreasing sequence of slaloms.
Now, suppose that wË is a P-name for a slalom defined on a club and pâ©wËââvαâ for all α<λ. Take an elementary submodel MâșH(Ξ) of size Îș0â<Îș with all relevant parameters in M. Also, assume that M<Îș0ââM.
Construct a decreasing sequence of conditions (pΟâ)Ο<Îș0ââ in M, so that
- (1)
for any Ο<Mâ©Îș, there is ζ<Îș0â and ΎζââMâ©ÎșâΟ with pζââ©ÎŽÎ¶ââdomwË and ÎŒpζââ„Ο too,
2. (2)
there is some Ο0â<Ο1â<⊠with ηnââMâ©Îș so that pΟnâââ© for all ηâ„ηnâ, wË(η)âvnâ(η).
So, we arranged that supΟ<Îș0ââηpΟâ=Mâ©Îș and any lower bound q for the sequence (pΟâ)Ο<Îș0ââ will force that ÎŽ=Mâ©ÎșâdomwË and wË(ÎŽ)âvnâ(ÎŽ) for all n<Ï. However, we can find a lower bound q such that qâ©ân<Ïâvnâ(ÎŽ)=â
. This contradiction finishes the proof.
â
We wonder if (2) above can be proved without forcing but using λ<p(Îș). We now define another kind of gap notion for slaloms:
Definition 3.7**.**
Let (uαâ:α<λ) and (vÎČâ:ÎČ<ÎŒ) be two sequences of slaloms based on the same club set CâÎș. We say that {(uαâ:α<λ),(vÎČâ:ÎČ<ÎŒ)} is a (λ,ÎŒ)-tight gap of slaloms if the following hold:
- (1)
For all α<αâČ<λ,ÎČ<ÎČâČ<ÎŒ and almost all Ο in C,
[TABLE]
2. (2)
If w is a C-supported slalom such that âÎČ<ÎŒ(wââvÎČâ), then there is α<λ such that wââuαâ.
3. (3)
If w is a C-supported slalom such that âα<λ(uαâââw), then there is ÎČ<ÎŒ such that vÎČâââw.
Question 3.8**.**
Clearly, if {(uαâ:α<λ),(vÎČâ:ÎČ<ÎŒ)} is a (ÎŒ,λ)-tight gap of slaloms, then it is a gap. Do these notions coincide?
For the following result, we will use a higher analogue of Martinâs axiom relativized to a certain class of posets.
In order to do this, we will use the following definitions and results of S. Shelah (see Section 2.2 in [BGS18]).
Definition 3.9**.**
Let Îș be an uncountable cardinal and Q be a forcing notion. We say that Q is stationary Îș+-Knaster if for every {piâ:i<Îș+}âQ there exists a club EâÎș+ and a regressive function f on Eâ©SÎșÎș+â such that for any i,jâEâ©SÎșÎș+â, if
f(i)=f(j) then piâ and pjâ are compatible.
Note that if a poset is stationary Îș+-Knaster then it is Îș+-cc.
Definition 3.10**.**
Let Îș be an uncountable cardinal. A forcing notion Q satisfies the (âÎșâ)-property, and we say it is Îș-good-Knaster, if the following conditions hold:
- (1)
Q is stationary Îș+-Knaster.
2. (2)
Any countable decreasing sequence of conditions in Q has a greatest lower bound.
3. (3)
Any two compatible conditions in Q have a greatest lower bound.
4. (4)
Q is <Îș-closed.444In the original definition of Shelah, the requirement is
somewhat weaker, i.e. that Q is Îș-strategically closed.
Finally, we can define our forcing axiom.
Definition 3.11**.**
Let Îș be an uncountable cardinal. We say that MA(Îș-good-Knaster) holds if and only if for all posets Q in the class Îș-good-Knaster and every collection D of dense sets of Q of size <2Îș there is a filter on Q intersecting all the sets in D.
In the following, we will exploit the consistency of MA(Îș-good-Knaster) stated below.
Theorem 3.12**.**
Assume GCH. Let Îș be a regular cardinal such that Îș<Îș=Îș and λ>Îș such that λ<Îș=λ. Then, there is a cardinal preserving generic extension in which 2Îș=λ and MA(Îș-good-Knaster) holds.
The proof is presented in the Appendix.
We now prove that MA(Îș-good-Knaster) implies the non-existence of certain kinds of tight gaps of slaloms.
Theorem 3.13**.**
Suppose that λ is a cardinal so that cf(λ)>Îș, λ<Îș=λ and that MA(Îș-good-Knaster) holds. Then there is no tight (λ,Îș+)-gap of slaloms based on a fixed club set CâÎș.
Proof.
Suppose towards a contradiction that there is a (λ,Îș+)-tight gap of slaloms {(uαâ:α<λ),(vÎČâ:ÎČ<Îș+)} based on (without loss of generality) Îș and define the following forcing notion Q. Conditions in Q are pairs p=(sË,Ï) where:
ÏâÎș+ and âŁÏâŁ<Îș.
sË=(siâ)iâÏâ is a sequence of partial slaloms with common domain, a fixed ordinal ηpâ<Îș.
If iâÏ, Οâηpâ, then siâ(Ο)âviâ(Ο).
If iâ=sup(Ï), then iâ>âŁÏâŁ.
A condition q=(tË,Ï) is said to extend the condition p=(sË,Ï) if:
ÏâÏ.
For all iâÏ, tiââsiâ.
For all i<iâČâÏ and Οâηqââηpâ, tiâ(Ο)âtiâČâ(Ο).
For all jâÏâÏ and iâÏ such that j<i, there is Οâηqââηpâ such that viâ(Ο)âtjâ(Ο).
We want to use our assumption of MA(Îș-good-Knaster) for this poset and some (to define) collection of dense sets.
Claim 3.14**.**
Q* is stationary Îș+-Knaster and <Îș-closed.*
Proof.
Suppose X={pαâ:α<Îș+} is a sequence of conditions in Q. We want to show that there is a club EâÎș+ and a regressive function f:Eâ©SÎșÎș+ââX such that, if f(i)=f(j) then piâ and pjâ are compatible.
First, we use the pigeonhole principle and the Î-system lemma in order to assume, without loss of generality that for all Îł<Îș+ the following hold:
ηpâ=η<Îș.
âŁÏÎłââŁ=λâ<Îș.
ÏÎłââ©ÏÎłâČâ=Ï”.
If ÏÎłâ={iÎł,lâ:l<λâ} (increasingly ordered), then slÎłâ=sÎłââ for all l<λâ. Here and throughout the proof slÎłâ denotes siÎł,lââ.
The sequence iÎł,lâ is strictly increasing in the first coordinate, for lâ/Ï”.
Given Îł<ÎłâČ<Îș+, we now claim that pÎłâ=(ÏÎłâ,sËÎłâ) and pÎłâČâ=(ÏÎłâČâ,sËÎłâČâ) are compatible. If true, we can then define E=Îș+ and f:SÎșÎș+ââÎș+ to be the constant function with value [math] and we get the stationary Îș+-Knaster condition.
To prove the claim, choose an ordinal ζâ„η such that, for each Οâ„ζ:
[TABLE]
is â-decreasing (this is possible because the iÎł,lâ are increasing and the way the vâs are arranged).
Moreover, we can choose ζ so that for all Οâ„ζ, âŁviÎłâČ,λâââ(Ο)âŁ+λâ>âŁviÎł,λâââ(Ο)âŁ.
Define a condition q=(tË,Ï) as follows: Ï=ÏÎłââȘÏÎłâČâ and tË=(tjâ)jâÏâ.
Put ζ=dom(tiâ) for all i and recall the enumeration of ÏÎłâ and ÏÎłâČâ we have fixed above.
We consider the following cases:
If jâÏ”, i.e j=iÎł,lâ for l<âŁÏ”âŁ, then define partial slalom tjâ as follows:
[TABLE]
If j=iÎł,lâ, for âŁÏ”âŁâ€l<λâ, then define partial slalom tjâ as follows:
[TABLE]
If j=iÎłâČ,lâ, for âŁÏ”âŁâ€l<λâ, define analogously as in the item above, i.e.
[TABLE]
Then qâ€pÎłâ and qâ€pÎłâČâ.
â
It remains to prove that the poset Q has properties (2), (3) and (4) from Definition 3.10. Note Let {pαâ}α<Îłâ be a <-decreasing sequence of conditions in Q, where pαâ=(sËαâ,Ïαâ). Then there is a canonical lower bound p=(sË,Ï) where Ï=âα<ÎłâÏαâ (which is still a set of size <Îș+) and sË is defined as follows: sË is a sequence of partial slaloms (siâ)iâÏâ with domain η=supα<Îłâηαâ<Îș such that siâ(Ο)=âα<Îłâsiαâ(Ο) when siαâ(Ο) is defined (i.e. when iâÏαâ). This implies that properties (2) and (4) hold. Property (3) hods, as if p=(sË,Ï) and q=(tË,Ï) are compatible, then a canonical lower bound r=(uË,Μ) has the form Μ=ÏâȘÏ, while the third and fourth conditions in the definition of our poset determine how r must be defined.
Since by hypothesis MA(Îș-good-Knaster) holds, there is a generic GâQ intersecting the following dense sets. Let iâÎș+ and η<Îș.
[TABLE]
The generic G adds, first of all an unbounded subset of Îș+, given by ÎŁGâ=â{Ïpâ:pâG}. Also, it generically adds Îș+-many slaloms {wGiâ:iâÎŁGâ}, where wGiâ=â{sipâ:pâG and (sËpâ)iâ=sipâ}. These slaloms satisfy that for all i<jâÎŁGâ and for almost all ΟâÎș wGiâ(Ο)âwGjâ(Ο).
Moreover, we have that for all i<jâÎŁGâ and for almost all ΟâÎș
[TABLE]
Now, using the hypothesis that {(uαâ:α<λ),(vÎČâ:ÎČ<Îș+)} is a (Îș+,λ)-tight gap of slaloms, given iâÎŁGâ, we can find α(i)<λ such that, for almost all ΟâÎș wGiâ(Ο)âuα(i)â(Ο).
Let αâ=sup{α(i):iâÎŁGâ}. Then for each iâÎŁGâ we can find ηiâ<Îș such that for all Ο>ηiâ:
[TABLE]
Again, using the pigeonhole principle, we can assume without loss of generality that ηiâ=ηâ. Then we can pick a condition p=(Ï,sË)âG so that jâÏ where jâÎŁGâ and âŁjâ©ÎŁGââŁâ„Îș and ηpâ>ηâ.
Since âŁÏâŁ<Îș, we can choose iâÎŁGââ©(jâÏ) and q=(Ï,tË)â€p for which iâÏ. Then, by the definition of the forcing Q, there is ηpâ€Î¶<ηqâ such that viâ(ζ)âti(ζ)=wGiâ(ζ). But then we get viâ(ζ)âwGiâ(ζ)âuαââ(ζ)âviâ(ζ) which is a contradiction.
â
4. On p(Îș) and pclâ(Îș)
The definitions of p(Îș) and t(Îș) invoke all Îș-complete filters (resp. towers) on Îș, without giving any additional structural information. Thus it makes sense to first consider smaller classes of filters that may be better understood. One natural way of classifying Îș-complete filters is to consider larger filters in which they simultaneously embed. This leads to the following definition:
Definition 4.1**.**
Let F be a Îș-complete filter on Îș. Then
[TABLE]
and
[TABLE]
whenever these are defined.
Note that pFâ(Îș) is defined exactly when F has no pseudointersection. One of the most interesting examples is pclâ(Îș)=pCâ(Îș) where C is the club filter on Îș. Our goal in this section is to study to study the relationship of p(Îș) to pclâ(Îș). We start by some straightforward observations.
Observation 4.2**.**
Let F be a Îș-complete filter on Îș such that pFâ is defined, then
- (1)
Îș+â€p(Îș)â€pFâ,
2. (2)
whenever tFâ is defined, pFââ€tFââ€t(Îș),
3. (3)
pclâ(Îș)=tclâ(Îș)=b(Îș).
Proof.
(1) and (2) follow immediately from the definitions. (3) has been shown in [Sch19]. Let us recall the argument. First note that pclâ(Îș) as well as tclâ(Îș) are defined. To see that they are equal, let λ=pclâ(Îș) and suppose that (Cαâ:α<λ) is a family of clubs in Îș with no pseudointersection of size Îș. Build a sequence (Dαâ:α<λ) of clubs so that DÎČâ is club and a pseudointersection of EÎČâ={Dαâ:α<ÎČ}âȘ{Cαâ:αâ€ÎČ} (note the closure of a pseudointersection is still a pseudointersection). This is possible, since EÎČâ is a family of clubs of size <pclâ(Îș). Now (Dαâ:α<λ) is a witness for tclâ(Îș)=λ. To see that pclâ(Îș)=b(Îș) consider the map the sends a function fâÎșÎș to Cfâ={α<Îș:fâČâČαâα} and the map sending a club C to succCâ.
â
The consistency of p(Îș)<b(Îș) was first shown in [SS02].
The argument for showing that p(Îș) stays small in the generic extension, relies on the following theorem which is the main result of the mentioned paper.
Theorem 4.3**.**
If Îșâ€ÎŒ<t(Îș) then 2ÎŒ=2Îș.
This theorem mirrors the situation at Ï. In order to keep p(Îș) smaller than ÎŒ one only needs to ensure that 2ÎŒ will be strictly larger than 2Îș in the generic extension. Using counting of names it can be seen that this will usually not be a problem (starting with an appropriate ground model). Thus starting from GCH, having regular targets ÎŒ<λ for p(Îș) and b(Îș), we first use Cohen forcing to ensure that 2ÎŒ=λ+ and then we increase b(Îș) to λ with Hechler forcing and simultaneously diagonalize Îș-complete filters of size <ÎŒ. In this extension 2ÎŒ>2Îș and we have ensured that p(Îș) does not blow up.
We will present a more natural approach that amounts to showing that certain witnesses for p(Îș) can be preserved while increasing b(Îș). This approach leaves more freedom for cardinal arithmetic. On the other hand, up until now, we only know how to apply it for a construction resulting in a model with p(Îș)=Îș+.
Let us introduce the forcing used to increase b(Îș) (i.e. pclâ(Îș)) or pFâ(Îș) more generally for certain classes of F. This poset has been used greatly in the past.
Definition 4.4**.**
Let F be a base for a Îș-complete filter on Îș. The forcing M(F) consists of conditions (a,F) where aâ[Îș]<Îș and FâF. The order is defined by (b,E)â€(a,F) iff EâF and bâaâF.
Fact 4.5**.**
M(F)* is Îș-closed and Îș+-cc (in fact Îș-centered with cannonical lower bounds).*
In what follows, C will always refer to the collection of clubs from a specific model, which should always be clear from context.
Our approach, that we announced earlier, will consist of showing that a <Îș support iteration of M(C) will not add a pseudointersection to a previously added collection of (more than Îș many) Cohen reals. As a warm up and an introduction to the argument we will first show that this the case when forcing with M(C) once.
Theorem 4.6**.**
Let Îș be uncountable regular and Îș<Îș=Îș. Suppose âšyαâ:α<Îș+â© is a sequence of Cohen reals added over V and that c is a M(C) generic over V[yËâ]. Then in V[yËâ][c], the filter generated by {yαâ:α<Îș+} has no pseudointersection.
We write CÎș+â for the <Îș-support product of Îș+ many copies of 2<Îș, the forcing for adding a Îș-Cohen real. Let us first check that,
Lemma 4.7**.**
Whenever âšyαâ:α<Îș+â© is a CÎș+â generic sequence, then {yαâ:αâÎș+} has the SIP in any further extension by Îș-closed forcing.
Proof.
Let Îâ[Îș+]<Îș be in any extension of VCÎșâ by a Îș-closed forcing notion. Then ÎâV. By genericity over V we may show that âαâÎâyαâ is unbounded in Îș. More precisely, let pâCÎș+â and ΔâÎș be arbitrary. Let ÎŽ>supiâdompâ(lthp(i)) and extend p to q such that q(i)(ÎŽ)=1 for every iâÎ.
â
Proof of Theorem 4.6.
In V[yËâ] assume xË is a M(C) name for an element of [Îș]Îș. Consider the set
[TABLE]
Then XâV[âšyαâ:α<ÎŽâ©] for some ÎŽ<Îș+. We want to show that xË[c]î ââyÎŽâ. First recall that yÎŽâ is in fact Cohen over V[âšyαâ:ÎŽî =α<Îș+â©]. Thus for the proof we may simply assume that XâV and show that xË[c]î âây where y is Cohen over V and c is M(C) generic over V[y].
Suppose in V[y] that (a,C) is an arbitrary condition in M(C). We have that aâV and there is some name CËâV so that â©âCË is clubâ in Cohen forcing and CË[y]=C.
Now suppose that sâ2<Îș is an arbitrary condition in Cohen forcing. Now let us define two decreasing sequences {pi0â:i<Îș} and {pi1â:i<Îș} in Cohen forcing such that the following holds:
p00â=p01â=s,
if âpi0â=f0â and âpi1â=f1â then f0â1â({1})â©f1â1â({1})=sâ1({1}),
the sets C~0={α:âi(pi0ââ©Î±âCË)} and C~1={α:âi(pi1ââ©Î±âCË)} are clubs.
The sequences pËâ0 and pËâ1 are simply interpreting sequences for CË below s. But we additionally ensure that the sets defined by âpi0â and âpi1â are disjoint up to their common initial part s. Call these sets y0âÎș and y1âÎș
Let C~=C~0â©C~1. Recall that C~ will still be club in V[y]. Thus there is bâ[C~]<Îș and α>supdom(s) so that minb>a and (aâȘb,α)âX. As âpi0â and âpi1â define disjoint sets there is at least one jâ2 so that α is not in yj. Say wlog j=0. Now we can extend s to some t=pi0â for some i such that pi0ââ©bâCË, αâdom(t) and t(α)=0.
Thus by genericity we shown that back in V[y] we can extend (a,C) to (aâȘb,CâČ) so that (aâȘb,CâČ)â©Î±âxË but αâ/y. Now by genericity of c we know that xË[c]î âây.
â
Now we are going to consider the more general case of iterating M(C) many times with <Îș-support. For an ordinal i we will write M(C)iâ for the i-length <Îș-support iteration of M(C).
Theorem 4.8**.**
(GCH) For any regular uncountable Îș<λ, where Îș=Îș<Îș, there is a Îș-closed, Îș+-cc forcing extension in which p(Îș)=Îș+<pclâ(Îș)=λ=2Îș.
Proof.
We are going to first add Îș+ many (Îș-)Cohen reals âšyαâ:α<Îș+â© and then iteratively diagonalize the club filter for λ many steps. Thus the poset that we are using is P=CÎș+ââMË(C)λâ, where MË(C)λâ is a CÎș+â name for the <Îș-support iteration of M(C) of length λ. This forcing notion is Îș-closed, has the Îș+-cc and forces 2Îș=λ by a counting argument. Also it is clear that VPâšpclâ(Îș)=λ. Thus we are left with showing that VPâšp(Îș)=Îș+.
Let us make some remarks on the notation that we will use.
We will assume that conditions in M(C)λâ always have the form (aË,q), where
aË=âšaiâ:iâIâ©, Iâ[λ]<Îș, aiââ[Îș]<Îș,
q is a function with domq=I and q(i) is a M(C)iâ name for a club for every iâI.
A pair (aË,q) as above is naturally interpreted as the condition âšaËiâ,q(i)â©iâIâ.
Similarly we will assume that conditions in CÎș+ââMË(C)λâ have the form (p,aË,qËâ), where
pâCÎș+â
aËâV,
qËâ is a CÎș+â name for an object as above.
It is easy to see, using Îș-closure, that conditions of this form are dense in P.
A nice M(C)λâ-name xË for an element of P(Îș) has the form
[TABLE]
where Aαâ is an antichain in M(C)λâ (thus has size â€Îș) and for every (aË,q)âAαâ and iâdomq, q(i) is a nice M(C)iâ-name. Thus we define nice M(C)iâ-names for subsets of Îș inductively on iâλ.
It is well known that for any M(C)λâ-name yËâ for a subset of Îș, there is a nice name xË so that â©yËâ=xË.
By induction on nice names we see that, âŁtrcl(xË)âŁâ€Îș. Namely, assume this is known for nice M(C)iâ-names for every i<j. Let xË be a nice M(C)jâ-name. Then xË=âα<ÎșâAαâĂ{αË} where each Aαâ is a set of M(C)jâ conditions of size at most Îș. For each condition (aË,p)âAαâ, âŁdompâŁ<Îș. For each iâdom(p), p(i) is a nice M(C)iâ-name which, by assumption, has transitive closure of size at most Îș.
Claim 4.9**.**
{yαâ:αâÎș+}* has no pseudointersection after forcing with M(C)λâ.*
Proof.
In VCÎș+â=V[yËâ], let xË be a nice M(C)λâ name for an element of [Îș]Îș. Then there is Îł<Îș+, such that xËâV[âšyαâ:αâÎș,αî =Îłâ©]. We will show that xË can not be almost contained in yÎłâ. Without loss of generality we may assume that xËâV and that we are adding a single Cohen real y=yÎłâ over V (by putting V[âšyαâ:αâÎș,αî =Îłâ©] as the new ground model) and then we are forcing with M(C)λâ in V[y].
Now suppose that (p,aË,qËâ)â©xËâΔâyËâ, where (p,aË,qËâ)âCâMË(C)λâ and ΔâÎș. Let y be C generic over V with p in the generic filter. Define yâČâ2Îș so that yâČ(i)=p(i)=y(i) for iâdomp and yâČ(i)=1ây(i) for iâÎșâdomp. It is well known that yâČ is also generic over V with p in itâs generic filter. Moreover V[y]=V[yâČ]=:W. But note that q:=qËâ[y]î =qËâ[yâČ]=:qâČ is very much possible. Still in W, (aË,q) and (aË,qâČ) are compatible. Namely we may define r:domqâW by putting r(i) a M(C)iâ name for q(i)â©qâČ(i). By induction we see that for any iâdomq,
[TABLE]
and that
[TABLE]
Thus indeed r(i) is a M(C)iâ name for a club, so (aË,r) is a condition and (aË,r)â€(aË,q),(aË,qâČ). Now let (bË,s)â€(aË,r) and ÎŽâÎșâΔ so that
[TABLE]
Since yâ©yâČâΔ, ÎŽâ/y or ÎŽâ/yâČ. Say ÎŽâ/y. Then whenever G is M(C)λâ generic over W with (bË,s)âG, W[G]âšxË[G]âΔî ây. At the same time, (p,aË,qËâ) is in the corresponding CâM(C)λâ generic over V. This gives a contradiction. Similarly when ÎŽâ/yâČ.
â
â
Analyzing the proof of the above result, we see that this result can be extended to a more general class of filters.
Theorem 4.10**.**
(GCH) For any regular uncountable Îș<λ, where Îș=Îș<Îș, there is a Îș-closed, Îș+-cc forcing extension in which p(Îș)=Îș+<pFâ(Îș)=λ=2Îș for any Îș-complete filter F on Îș that is ordinal definable over H(Îș+).
We say that F is ordinal definable over H(Îș+) if there is a formula Ï in the language of set theory and finitely many ordinals α0â<âŻ<αnâ1â<Îș+ so that
[TABLE]
For example, C is ordinal definable over H(Îș+).
Proof.
Let âšÏΟâ(x,αËΟâ):ΟâÎș+â© enumerate all formulas in one free variable x and parameters αË=(α0â,âŠ,αkâ)â(Îș+)<Ï in the language {â}.
As before we first add Îș+ many Cohen reals using CÎș+â. Then in VCÎș+â we define an iteration âšPiâ,QËâiâ:i<λ⩠with Qiâ=âΟ<Îș+âM(FΟâ) where
[TABLE]
if this defines a Îș-complete filter (in VPiâ) or
[TABLE]
else.
Again we consider conditions in Pλâ, as pairs (aË,q) where domaâ[Îș+â
λ]<Îș, aÎș+â
i+Οââ[Îș]<Îș and q is a function with domain doma so that q(Îș+â
i+Ο) is a Piâ name for an element of FΟâ. Similarly we define the notion of nice names.
It is crucial to note that Pλâ only depends on the model VCÎș+â and not on the particular set of generic Cohen reals. Then using the same argument as before we see that p(Îș)=Îș+ in VCÎș+ââPËλâ.
Now suppose F is ordinal definable over H(Îș+) in VCÎș+ââPËλâ and pFâ(Îș) is defined. Say F is defined by ÏΟâ. Let BâF with âŁBâŁ<λ. Then there is i<λ so that BâVCÎș+ââPËiâ. Moreover we find jâ„i so that (H(Îș+)jâ,â)âŒ(H(Îș+)λâ,â), where H(Îș+)jâ={xâH(Îș+):xâVCÎș+ââPËjâ}. To see this just note that âŁH(Îș+)iââŁ<λ for every i<λ. Thus we can find the <λ many required Skolem-witnesses over H(Îș+)iâ in H(Îș+)S(i)â for some S(i)<λ. Applying S recursively Îș+ many times, by taking suprema at limits, yields the desired situation (since no new elements of H(Îș+) are introduced in limits of cofinality Îș+). In VCÎș+ââPËjâ, FΟâ is a Îș-complete filter on Îș with BâFΟâ and Qjâ adds a pseudointersection to B.
â
Theorem 4.11**.**
(p(Îș)=2Îș) Let P be a collection of Îș+-cc forcing notions, each of size â€2Îș and âŁPâŁâ€2Îș. Then there is a tower which is indestructible by any PâP.
Lemma 4.12**.**
Let p(Îș)=λ. There is a map Ï:2<λâ[Îș]Îș so that for each fâ2λ, âšÏ(fâŸÎ±):α<λ⩠is a tower and Ï(sâą0)â©Ï(sâą1)=â
for every sâ2<λ.
Proof.
See the proof of Theorem 7 in [SS02].
â
Proof of Theorem 4.11.
Let Ï be as in Lemma 4.12 and λ=2Îș. Recall that if P is Îș+-cc then we can assume that all P names for elements of [Îș]Îș are of size at most Îș. Enumerate all triples âšPαâ,pαâ,xËαâ:α<λ⩠where PαââP, pαââPαâ and xËαâ is a P name for an element of [Îș]Îș. We recursively define fâ2λ as follows:
Given sαââ2α, let y0â=Ï(sâą0) and y1â=Ï(sâą1). As y0ââ©y1â=â
we have that pαââ©xËαââây0ââ§xαââây1â is impossible. Thus for some iâ2 we have that there is qαââ€pαâ so that qαââ©xËαâî ââyiâ. Let sα+1â=sâąi. At limits we let sαâ=âΟ<αâsΟâ. Finally f:=âα<λâsαâ.
The tower defined by f is as required. Namely given PâP, pâP and xË a P-name for an unbounded subset of Îș, say (P,p,xË)=(Pαâ,pαâ,xËαâ), we have that qαââ€pαâ forces that xË is not almost contained in Ï(sαâ).
â
5. Questions and problems
Here, we collect some of the natural open problems that occurred during our project. Most notably:
Question 5.1**.**
Is p(Îș)=t(Îș) for any infinite Îș?
Maybe something easier would be the following.
Question 5.2**.**
Does p(Îș)=t(Îș) hold for a measurable or (weakly) compact cardinal Îș?
To approach this problem, one might try to answer the following.
Question 5.3**.**
Suppose that there is a (p(Îș),λ)-gap of club-supported slaloms for some λ<p(Îș). Is there a tower of size p(Îș) necessarily?
It also remains open if the notion of gaps and tight gaps are the same for club-supported slaloms.
In addition to the club filter, one may define pUâ for any sub-collection Uâ[Îș]Îș.
Question 5.4**.**
Suppose that Îș is a measurable cardinal with a <Îș-closed, normal ultrafilter U. Does pUâ<pclâ?
Even for Îș=Ï, it would be interesting to construct a (large) collection of ultrafilters (UΟâ)ΟâIâ so that the corresponding cardinals pUΟââ are all distinct.
6. Appendix
6.1. Other higher analogues of p and t
Imposing the SIP property ensures that p(Îș) and t(Îș) fall into the interval [Îș+,2Îș]. Unpublished work Brian and Verner examines another generalization of the pseudo-intersection and tower numbers to Îș. Consider the cardinals pâ(Îș) and tâ(Îș) defined below:
pâ(Îș)=min{âŁFâŁ:F is a family with the finite intersection property and no pseudo-intersection of size Îș}.
tâ(Îș)=min{âŁTâŁ:T is a well-ordered family of subsets of Îș without pseudo-intersection of size Îș}.
Here the finite intersection property refers to the fact that for any finite sub-family FâČâF, âFâČ has size Îș.
Proposition 6.1** (Brian-Verner).**
If Îș is a cardinal with uncountable cofinality, then pâ(Îș)=tâ(Îș)=â”0â.
If Îș is an uncountable cardinal with cf(Îș)=Ï, then tâ(Îș) is uncountable.
If Îș is an uncountable cardinal with cf(Îș)=Ï, then pâ(Îș)=Ï1â.
6.2. Consistency of MA(Îș-good-Knaster)
Finally, we present the proof of the generalized Martinâs Axiom for posets with property (âÎșâ) that we applied in Section 3. The proof is based on the following iteration theorem but otherwise resembles the classical proof of Martinâs Axiom.
Theorem 6.2**.**
(Shelah, 1976; see [She17]).
Let Îș be an uncountable cardinal and (Pαâ,QËâαâ:α<ÎŽ) be a <Îș-support iteration such that for every α<ÎŽ:
[TABLE]
Then PÎŽâ is stationary Îș+-Knaster.
Proof of Theorem 3.13.
We define a <Îș-support iteration (Pαâ,QËâαâ:α<λ) such that for all α<λ:
â©QËâαâ is has the property (âÎșâ).
â©âŁQËâαââŁ<λ.
Since by theorem 6.2 the poset P=Pλâ is stationary Îș+-Knaster condition and it is <Îș-closed,
P preserves cardinals. Also, since λ is regular and λÎș=λ, we have âŁPαââŁâ€Î».
Define QËâαâ by induction on α<λ as follows. Fix a bookkeeping function Ï:λâλĂλ such that Ï(α)=(ÎČ,Îł) implies ÎČâ€Î±. If we have defined QËâÎČâ for all ÎČ<α and Ï(α)=(ÎČ,Îł), we can look at the Îł-th PÎČâ-name QËâ in VPÎČâ for a poset of size <λ with the property (âÎșâ). Define Qαâ=QËâ.
First, we will show that that
VPâšMAÎș(Îș-good-Knaster<λâ)â§2Îș=λ, where MA(Îș-good-Knaster<λâ) is the restriction of MA(Îș-good-Knaster) to posets of cardinality stricly smaller than λ.
Let RË be a P-name for a poset with property (âÎșâ) such that â©PââŁRËâŁ<λ and let DË be a P-name for family of <λ-many dense subsets of R. Then, using the Îș+-cc, we can find ÎČ<λ such that both RË and DË belong to VPÎČâ. We can choose then, Îł<λ so that R is the Îł-th name in VPÎČâ for a poset with property (âÎșâ). Hence, in the model VPÏ(ÎČ,Îł)+1â, the generic for R intersects all dense sets in D.
The argument above is enough to obtain the full MA(Îș-good-Knaser) in VP:
Claim 6.3**.**
If R is Îș-good-Knaster poset in VP and D is a collection of <λ-many dense sets in R, then there is RâČâR of cardinality <λ
which is also Îș-good-Knaster such that the sets in D are dense in RâČ.
Proof.
Given a dense set DâD, there exists a maximal antichain ADââD and using the stationary Îș+-Knaster condition, this antichain has size at most Îș. Consider then, the poset S generated by the set of antichains {ADâ:DâD} and has size <λ (because λ<Îș=λ). Now, consider the closure of S under properties (2), (3) and (4) in Definition 3.10 and notice that this process does not increase its size. Call the resulting poset RâČ and note that it has the desired size and it is an element of the class Îșâgood-Knaster. Finally, if HâRâČ is a generic intersecting all the dense sets in D, we can extend it to a filter GâH, GâR meeting all sets in D.
â
â
There have been other attempts to get higher analogues of Martinâs axiom at Îș=â”1â. Specifically, let us mention one due to Baumgartner (see also [SS82, She78]):
Definition 6.4** (Baumgartnerâs axiom [Bau83]).**
Let P be a partial order satisfying the following conditions:
P is countably closed.
P is well-met.
P is â”1â-linked.
Then if Îș<2â”1â and {Dαâ:α<Îș} is a collection of dense sets of P, then there exists a generic filter GâP intersecting all sets Dαâ.
Baumgartner also proved that the former axiom is consistent with 2â”0â=â”1â and 2â”1â=Îș, where Îșâ„â”1â is regular.