This paper introduces split principles, revealing their deep connections to large cardinal properties and classical combinatorial objects, and establishing correspondences with splitting numbers at uncountable cardinals.
Contribution
It presents the split principles and explores their relationships with large cardinals, combinatorial objects, and splitting numbers, providing new insights into set theory.
Findings
01
Split principles are tightly connected to large cardinal properties.
02
Correspondences between split principles and splitting numbers are established.
03
The paper links split principles to classical combinatorial objects like Aronszajn and Souslin trees.
Abstract
We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects such as Aronszajn trees, Souslin trees or square principles. We exhibit correspondences between certain split principles and splitting numbers at uncountable cardinals.
Equations56
dα={γ<τ∣α∈xγ}.
dα={γ<τ∣α∈xγ}.
xγ={α<κ∣γ∈dα}.
xγ={α<κ∣γ∈dα}.
f(γ)=the least α≥γ such that b∩γ=dα∩γ.
f(γ)=the least α≥γ such that b∩γ=dα∩γ.
β∈b⟺Aβ− is bounded in κ(⟺Aβ+ is unbounded in κ.)
β∈b⟺Aβ− is bounded in κ(⟺Aβ+ is unbounded in κ.)
gx(αξx)={γ(x)fxγ(x)(αξ−1x)ifξ=0orξis a limit ordinal,ifξis a successor ordinal
gx(αξx)={γ(x)fxγ(x)(αξ−1x)ifξ=0orξis a limit ordinal,ifξis a successor ordinal
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 · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
Full text
Split Principles, large cardinals, splitting families, and split ideals
Gunter Fuchs
and
Kaethe Minden
Abstract.
We introduce a hierarchy of split principles and show that it parallels the hierarchy of large cardinals. In the typical case, a cardinal being large is equivalent to the corresponding split principle failing. As examples, we show how inaccessibility, weak compactness, subtlety, almost ineffability and ineffability can be characterized. We also consider two-cardinal versions of these principles. Some natural notions in the split hierarchy correspond to apparently new large cardinal notions. Such split principles come with certain ideals, and one of the split principles characterizing a version of κ being λ-Shelah gives rise to a normal ideal on Pκλ. We also investigate the splitting numbers and the ideals induced by these split principles, and the relationship to partition relations.
The research of the first author has been supported in part by PSC-CUNY grant 69656-00-47.
1. Introduction
A version of the split principle was first considered by Fuchs, Gitman, and Hamkins in the course of their work on [FGH17], the intended use being the construction of ultrafilters with certain properties. Later, the first author observed that the split principle is an “anti-large-cardinal axiom” which characterizes the failure of a regular cardinal to be weakly compact. In the present paper, we consider several versions of the principle that provide simple combinatorial characterizations of the failure of various large cardinal properties.
The split principles for κ say that there is a sequence d=⟨dα∣α<κ⟩ that “splits” every subset A of κ that’s large into two subsets of A that are also large, meaning that there is one ordinal β such that for many α∈A, we have that β belongs to dα, but also, for many α∈A, it is the case that β belongs to α∖dα. By varying the meanings of “large”, we obtain a host of natural split principles. Interestingly, in the two-cardinal version, some very natural split principles give rise to what appear to be entirely new large cardinal notions.
In Section 2, we introduce the orignial split principle in detail, and we show that if the notions of largeness used are reasonable (namely, the largeness of the sets split into is determined by a tail of the sets), then the failure of the split principle at κ says that the corresponding splitting number is larger than κ. The notion of splitting number and splitting family here is the obvious generalization to arbitrary κ of the well-known concepts at ω.
We then show that the nonexistence of a κ-list that splits unbounded subsets of a regular cardinal κ into unbounded sets is equivalent to the weak compactness of κ, or equivalently, that the corresponding splitting number is greater than κ.
We then show that the nonexistence of a sequence that splits stationary subsets of a regular cardinal into various classes (anything between the class of nonempty sets and the class of stationary subsets) characterizes its ineffability, and a regular cardinal κ is almost ineffable if and only if there is no sequence that splits unbounded subsets into nonempty subsets. This latter characterization does not correspond to a statement about splitting numbers in any obvious way. We also obtain a characterization of subtle cardinals.
In Section 3, we consider split principles asserting the existence of lists that split subsets of Pκλ. The nonexistence of a sequence that splits unbounded subsets of Pκλ into unbounded is a large cardinal concept which we call wild ineffability and which is situated somewhere between mild and almost ineffability. Interestingly, we don’t know where it lies - it may be equivalent to one of those large cardinal notions. We characterize wild ineffability in terms of delayed coherence properties of Pκλ-lists, showing that the concept is a natural one, and we show that it is implied by the partition property Part(κ,λ)<3. We give split principle characterizations of the two cardinal versions of almost ineffability and ineffability as before. Versions of the split principle which postulate that functions F:λ⟶λ can be split allow us to characterize versions of κ being λ-Shelah. We call the one corresponding to the failure of the functional split principle splitting unbounded sets into unbounded sets wild Shelahness. Again this seems to give rise to an entirely new large cardinal notion.
Finally, in Section 4, we introduce the Pκλ-ideals of sets on which the split principles hold (and thus, where the corresponding large cardinal properties fail), and show that the ideal associated to the functional split principle is strongly normal. A lot of our analysis of Pκλ split principles and the ideals they give rise to is closely related to prior work of Donna Carr ([Car81, Car87]) as well as DiPrisco and Zwicker ([DZ80]).
2. Splitting subsets of κ
Let κ be a cardinal.
We shall use the terminology of [Wei10], and refer to a sequence of the form ⟨dα∣α<κ⟩ as a κ-list if for all α<κ, dα⊆α.
Definition 2.1**.**
Let A and B be families of subsets of κ. The principle Splitκ(A,B) says that there is a κ-list d that splits A into B, meaning that for every A∈A, there is a β<κ such that both Aβ,d+=Aβ+={α∈A∣β∈dα} and Aβ,d−=Aβ−={α∈A∣β∈α∖dα} are in B. In this case, we also say that β splits A into B with respect to d.
We abbreviate Splitκ(A,A) by Splitκ(A) .
The collections of all unbounded, all stationary and all κ-sized subsets of κ are denoted by unbounded, stationary and [κ]κ respectively.
The idea is that A and B are collections of “large” sets, and Splitκ(A,B) says that there is one κ-list that can split any set that’s large in the sense of A into two disjoint sets that are large in the sense of B, in the uniform way described in the definition. There is a very close connection to the concept of splitting families, which can be made explicit after considering a wider range of split principles, in which we drop the assumption that the sequence is a κ-list.
Definition 2.2**.**
Let κ and τ be cardinals, and let A and B be families of subsets of κ. The principle Splitκ,τ(A,B) says: there is a sequence d=⟨dα∣α<κ⟩ of subsets of τ such that for every A∈A, there is an ordinal β<τ such that the sets A~β+=A~β,d+={α∈A∣β∈dα} and A~β−=A~β,d−={α∈A∣β∈/dα} belong to B. Such a sequence is called a Splitκ,τ(A,B) sequence.
If A=B, we don’t mention B in the notation. Thus, Splitκ,τ(A,A) is Splitκ,τ(A).
In this context, a family F⊆P(κ) is an (A,B)-splitting family for κ if for every A∈A, there is an S∈F such that both A∩S and A∖S belong to B. The (A,B)-splitting number, denoted sA,B(κ) is the least size of an (A,B)-splitting family. We write sA(κ) for sA,A(κ). s(κ) stands for s[κ]κ(κ).
Of course, s=s(ω) is a well-known cardinal characteristic of the continuum. Several authors have considered the generalization s(κ), for uncountable κ, see [Suz93], [Zap97]. Note that for regular κ, unbounded=[κ]κ. We’ll only use [κ]κ when κ is singular.
We will first explore the relation between the two types of split principles introduced so far.
Observation 2.3**.**
Let κ be a cardinal, and let A and B be collections of subsets of κ such that for all B⊆κ and all β<κ, B∈B iff B∖β∈B (“B is independent of initial segments”). Then Splitκ,κ(A,B) is equivalent to
Splitκ(A,B).
Proof.
If e is a Splitκ(A,B)-sequence, clearly it is also a Splitκ,κ(A,B)-sequence.
For the other direction, let d be a Splitκ,κ(A,B) sequence. Define the κ-list e by eα=dα∩α. It follows that e is a Splitκ(A,B) sequence, because if A∈A and β<κ is such that A~β,d+ and A~β,d− are in B by Splitκ,κ(A,B), then Aβ,e+=A~β,d+∖(β+1), and similarly, Aβ,e−=A~β,d−∖(β+1). It follows from our assumption on B that Aβ,e+ and Aβ,e− are in B. ∎
Note that unbounded, stationary and [κ]κ all are independent of initial segments. The following lemma says that the split principles can be viewed as statements about the sizes of the corresponding splitting numbers.
Lemma 2.4**.**
Let κ and τ be cardinals, and let A, B be families of subsets of κ. Then Splitκ,τ(A,B) holds iff sA,B(κ)≤τ.
Note: In other words, sA,B(κ) is the least τ such that Splitκ,τ(A,B) holds.
Proof.
For the direction from right to left, if S={xα∣α<τ} is an (A,B)-splitting family for κ, then we can define a sequence ⟨dα∣α<κ⟩ of subsets of τ by setting
[TABLE]
Then d is a Splitκ,τ(A,B) sequence, because if A∈A, then there is a β<τ such that both A∩xβ and A∖xβ belong to B, but A\cap x_{\beta}={\tilde{A}}^{+}_{\beta,\vec{d}}\ and A\setminus x_{\beta}={\tilde{A}}^{-}_{\beta,\vec{d}}\ so we are done.
Conversely, if d is a Splitκ,τ(A,B) sequence, then for each γ<τ, we define a subset xγ of κ by
[TABLE]
Then S={xγ∣γ<τ} is an (A,B)-splitting family for κ, because if A∈A, then there is a β<τ such that both A~β,d+ and A~β,d− are in B, but as before, A~β,d+=A∩xβ and A~β,d−=A∖xβ. ∎
What this proof shows is that if X⊆κ×λ is a set and we let, for β<λ, be Xβ={α<κ∣⟨α,β⟩∈X} be the horizontal section at height β, and for α<κ, Xα={β<λ∣⟨α,β⟩∈X} be the vertical section at α, then ⟨Xα∣α<κ⟩ is a Splitκ,λ(A,B) sequence iff ⟨Xβ∣β<λ⟩ is an (A,B)-splitting family.
Corollary 2.5**.**
If B is independent of initial segments, then Splitκ(A,B) holds iff sA,B(κ)≤κ.
Observation 2.6**.**
Let κ be a cardinal, and let A,A′,B,B′ be collections of subsets of κ. If A⊆A′ and B′⊆B, then sA,B(κ)≤sA′,B′(κ).
Proof.
Under the assumptions stated, every (A′,B′)-splitting family is also (A,B)-splitting.
∎
We are now ready to characterize inaccessible cardinals by split principles. The equivalence 1⟺5 follows from work of Motoyoshi.
Lemma 2.7**.**
Let κ be an uncountable regular cardinal. The following are equivalent:
(1)
κ* is inaccessible.*
2. (2)
Splitκ,τ(stationary,nonempty)* fails for every τ<κ. Equivalently, sstationary,nonempty(κ)≥κ.*
3. (3)
Splitκ,τ(stationary)* fails for every τ<κ. Equivalently, sstationary(κ)≥κ.
*
4. (4)
Splitκ,τ(unbounded,nonempty)* fails for every τ<κ. Equivalently, sunbounded,nonempty(κ)≥κ.*
5. (5)
Splitκ,τ(unbounded)* fails for every τ<κ. Equivalently, sunbounded(κ)≥κ.*
It follows that for any collection B with stationary⊆B⊆nonempty, these conditions are equivalent to the failure of Splitκ,τ(stationary,B), and similarly for any B with unbounded⊆B⊆nonempty, they are equivalent to the failure of Splitκ,τ(unbounded,B).
Moreover, (2), (4) are equivalent to κ being inaccessible even if κ is not assumed to be regular (not even to be a cardinal).
Proof.
The equivalence (1)⟺(5) follows from previously known results as follows. According to [Suz93], it was shown in [Mot92] that for an uncountable regular cardinal κ, κ is inaccessible iff s(κ)≥κ (see [Zap97, Lemma 3] for a proof). By Lemma 2.4, this is equivalent to saying that for no τ<κ does Splitκ,τ(unbounded) hold.
However, we will give a self-contained proof here.
The implications (2)⟹(3) and (2)⟹(4)⟹(5) are trivial.
To prove (1)⟹(2), let κ be inaccessible, and let τ<κ. Let d=⟨dα∣α<κ⟩ be a sequence of subsets of τ. We will show that d does not split stationary subsets of κ into nonempty sets. Since 2τ<κ, it follows that there is a stationary set S⊆κ and a set e⊆τ such that for all α∈S, dα=e. Let β<τ. Then S~β+={α∈S∣β∈e} and S~β−={α∈S∣β∈/e}, so one of these is S and the other is ∅. So β does not split S into nonempty sets.
To show (5)⟹(1), suppose κ is not inaccessible. Since κ is assumed to be regular, it follows that there is a τ<κ such that 2τ≥κ. Let d=⟨dα∣α<κ⟩ be a sequence of distinct subsets of τ. By 5, d is not a Splitκ,τ(unbounded) sequence. Hence, there is an unbounded set U⊆κ such that no β<τ splits U into unbounded sets. So, for every β<τ, exactly one of Uβ+ and Uβ− is bounded. Let ξβ<κ be such that the bounded one is contained in ξβ. Let ξ=supβ<τξβ. Then ξ<κ, since κ is regular, and we claim that for ξ<γ<δ with γ,δ∈U, it follows that dγ=dδ. For if β<τ and Uβ− is bounded, then, since γ∈U∖ξβ, it follows that γ∈Uβ+, which means that β∈dγ, and for the same reason, β∈dδ. And if Uβ+ is bounded, then it follows that β∈/dγ and β∈/dδ. So dγ=dδ, a contradiction.
A similar argument shows the final implication, (3)⟹(1). Assume κ were not inaccessible. Let τ<κ be such that 2τ≥κ. Let d=⟨dα∣α<κ⟩ be a sequence of distinct subsets of τ. By 3, d is not a Splitκ,τ(stationary) sequence. Hence, there is a stationary set S⊆κ such that no β<λ splits S into stationary sets. So, for every β<τ, exactly one of Sβ+ and Sβ− is nonstationary. Let Cβ be a club in κ, disjoint from the nonstationary one of the two. Let T=S∩⋂β<τCβ. This is a stationary set, and we claim that for γ<δ are both in T, it follows that dγ=dδ. For if β<τ and Sβ− is nonstationary, then, since γ∈S∩Cβ, it follows that γ∈Sβ+, which means that β∈dγ, and for the same reason, β∈dδ. And if Sβ+ is nonstationary, then it follows that β∈/dγ and β∈/dδ. So dγ=dδ, a contradiction.
The claim about families B with stationary⊆B⊆nonempty follows from the equivalence of 2. and 3, and the claim about B with unbounded⊆B⊆nonempty follows from the equivalence of 4. and 5.
For the last claim, it suffices to show that 4. implies that κ is regular. But this is obvious, since if ⟨ξα∣α<cf(κ)⟩ is cofinal in κ, then {ξα∣α<cf(κ)} (viewed as a collection of subsets of κ) is an (unbounded,nonempty)-splitting family. So sunbounded,nonempty(κ)≤cf(κ), so Splitκ,cf(κ)(unbounded,nonempty) holds. So it has to be the case that cf(κ)=κ.
∎
Recall that a regular cardinal κ is weakly compact if κ is inaccessible and the tree property TP(κ) holds at κ, which states that every κ-tree has a cofinal branch, where a κ-tree is a tree of height κ all of whose levels have size less than κ.
We will show that a regular cardinal κ is weakly compact if and only if Splitκ(unbounded) fails, for example. Toward this end, we will first define the analogue of the tree property for κ-lists.
Definition 2.8**.**
A κ-list d=⟨dα∣α<κ⟩ has a cofinal branch, or has a κ-branch, so long as there is
a b⊆κ such that for all γ<κ there is an α≥γ such that
dα∩γ=b∩γ.
We say that the branch property BP(κ) holds if every κ-list has a cofinal branch.
Given a κ-list d=⟨dα∣α<κ⟩, for each α<κ let dαc:α⟶2 denote the characteristic function of dα. The sequential tree corresponding to the κ-list is given by
Td={dαc↾β∣β≤α<κ},
and the tree ordering is set inclusion. As is customary, we refer to a function
b:κ⟶2 as a (cofinal) branch through Td if for all γ<κ, b↾γ∈Td, which means that for every γ<κ, there is an α≥γ such that
b↾γ=dαc↾γ.
Observation 2.9**.**
A κ-list d has a cofinal branch if and only if the corresponding tree Td has a cofinal branch.
It turns out that for regular κ, the properties of a κ-list of splitting unbounded sets and having a cofinal branch are complementary.
Theorem 2.10**.**
Let κ be regular, and let d be a κ-list. The following are equivalent:
(1)
d* is a Splitκ(unbounded) sequence.*
2. (2)
d* does not have a cofinal branch.*
Proof.
(1)⟹(2): Assume towards a contradiction that d has a cofinal branch b⊆κ, and that d splits unbounded sets. We will first define a function f:κ⟶κ as follows:
[TABLE]
Note that f is weakly increasing, thus letting A=f‘‘κ, A is unbounded in κ. So there is β<κ which splits A (with respect to d), i.e., both of the sets
Aβ+={f(γ)∈A∣β∈df(γ)} and Aβ−={f(γ)∈A∣β∈f(γ)∖df(γ)}
are unbounded in κ. There are two cases.
Case 1: β∈/b. Since Aβ+ is unbounded, we may choose f(γ)∈Aβ+ satisfying f(γ)>f(β). By the weak monotonicity of f, it follows that γ>β. Then β∈df(γ) by the definition of Aβ+ and it follows that
β∈df(γ)∩γ=b∩γ,
contradicting the assumption that β∈/b.
Case 2: β∈b. We may run a similar argument to the previous case in order to obtain a contradiction. In this case, we use that Aβ− is unbounded to choose f(γ)∈Aβ− satisfying f(γ)>f(β), so that γ>β, and get the contradiction that β∈/df(γ) while β∈b∩γ=df(γ)∩γ.
\neg(1)$$\implies$$\neg(2): Assume that d does not split unbounded sets. We will show that then d has a cofinal branch. Let A⊆κ be unbounded such that no β<κ splits A (with respect to d). Thus, for each β<κ, exactly one of Aβ+ or Aβ− is bounded in κ, since A=Aβ+∪Aβ− (so since A is unbounded, it can’t be that both Aβ+ and Aβ− are bounded). Now we may define our branch b⊆κ as follows:
[TABLE]
To see that this works, note that for each β<κ there is a least ξβ<κ such that either:
[TABLE]
Letting γ<κ be arbitrary, using the fact that κ is regular, there is an α∈A such that
α>supβ<γξβ.
It follows that b∩γ=dα∩γ.
To see this, let β<γ. We have two cases.
Case 1: β∈b. Then Aβ− is bounded, so for all δ∈A∖ξβ, β∈dδ, so β∈dα, since α∈A∖ξβ.
Case 2: β∈/b. Then Aβ+ is bounded, so β∈/dα, since α∈A∖ξβ.
So we have reached the desired contradiction that b is a cofinal branch. ∎
Corollary 2.11**.**
Let κ be regular. Then Splitκ(unbounded) holds iff there is a sequential tree T⊆<κ2 of height κ that has no cofinal branch.
Note that a sequential tree T⊆<κ2 of height κ without a cofinal branch is not necessarily an Aronszajn tree, as it doesn’t even have to be a κ-tree – T may have levels of size κ. But if κ is inaccessible, then such a T is Aronszajn.
Proof.
For the direction from right to left, let T be a sequential tree T⊆<κ2 of height κ that has no cofinal branch. For each α<κ, let sα be a node at the α-th level of T, i.e., a sequence sα:α⟶2 with sα∈T. Let dα be the sequence sα, viewed as a subset of α, i.e., dα={γ<α∣sα(γ)=1}. In other words, sα=dαc. Then Td⊆T, and so, since T does not have a cofinal branch, Td has no cofinal branch, which means, by Observation 2.9, that d has no cofinal branch, and this is equivalent to saying that d splits unbounded sets, by Theorem 2.10. So Splitκ(unbounded) holds.
For the converse, let d be a Splitκ(unbounded)-sequence. By Theorem 2.10, d has no cofinal branch. So by Observation 2.9, Td does not have a cofinal branch, so Td is as wished. ∎
2.1. Weakly compact cardinals
Definition 2.12**.**
An uncountable cardinal κ is weakly compact so long as κ is inaccessible and κ has the tree property, meaning that every κ-tree has a branch of size κ.
We shall use the previous result to show that the split principle can be used to characterize weakly compact cardinals.
Corollary 2.13**.**
Let κ be a regular cardinal. Then Splitκ(unbounded) if and only if κ is not weakly compact. (This is true for κ=ω as well, if we consider ω to be weakly compact, which is not standard.)
Proof.
We shall show both directions of the equivalence separately.
⟹: Assuming Splitκ(unbounded), we have to show that κ is not weakly compact. If κ is not inaccessible, then we are done, so let’s assume it is. By Corollary 2.11, there is a sequential tree T⊆<κ2 of height κ with no cofinal branch. Since κ is inaccessible, T is a κ-tree, and thus, κ does not have the tree property, so κ is not weakly compact.
⟸: Let κ fail to be weakly compact. We split into two cases.
Case 1: κ is not inaccessible. Then by 2.7, there is a τ<κ such that Splitκ,τ(unbounded) holds. This clearly implies that Splitκ,κ(unbounded) holds, and, since unbounded is independent of initial segments, this is equivalent to Splitκ(unbounded).
Case 2: κ is inaccessible but not weakly compact. Then TP(κ) fails, and this is witnessed by a sequential tree T on <κ2 that has no cofinal branch. Thus, κ-Split holds, by Corollary 2.11.
∎
So a regular cardinal κ is weakly compact iff Splitκ(unbounded) fails. Since this is equivalent to saying that Splitκ,κ(unbounded) fails, this can be equivalently expressed by saying that s(κ)>κ, by Lemma 2.4. This latter characterization of weak compactness was shown in [Suz93].
It should be noted, however, before moving on to larger large cardinals, that what we really showed with our proof of Theorem 2.10 is that κ-Split is equivalent to the failure of something seemingly stronger than every κ-list having a cofinal branch, namely the failure of the strong branch property, which we define below.
Definition 2.14**.**
Let d=⟨dα∣α<κ⟩ be a κ-list. A cofinal branch b⊆κ is a strong branch of d so long as there are is an unbounded U⊆κ such that for each γ<κ, there is α>γ such that for all δ∈U with δ>α we have that
dδ∩γ=b∩γ. In this case we say that the unbounded set Uguides the cofinal branch b.
If every κ-list has a strong branch, we say SBP(κ) holds.
Indeed the argument in the beginning of the proof of Theorem 2.10 shows that if a κ-list has a cofinal branch, then that branch is a strong branch (and it is not necessary to assume that κ is regular here). The unbounded set verifying strongness is the range of the function f in that proof. Trivially, every strong branch is a branch, and so, these concepts are equivalent for κ-lists. The situation will turn out to be less clear when dealing with Pκλ-lists, as we will do in Section 3.
2.2. Ineffable cardinals
Definition 2.15**.**
Let A be a family of subsets of κ. A κ-list d=⟨dα∣α<κ⟩ has an A branch iff there is a set b⊆κ and a set A∈A such that for all α∈A, we have that
dα=b∩α. Keeping with tradition, a stationary branch is called an ineffable branch, and an unbounded branch is called an almost ineffable branch. κ is A-ineffable if κ is regular and every κ-list has an A branch.
Using this language, it is clear that by our definition, stationary-ineffable cardinals are exactly ineffable cardinals, and unbounded-ineffable ones are called almost ineffable cardinals.
We say that κ has the ineffable branch property, or IBP(κ) holds, if every κ-list has an ineffable branch.
We have the following string of implications: IBP(κ)⟹SBP(κ)⟹BP(κ). In particular, ineffable cardinals are weakly compact.
We start by giving a general and uniform characterization of A-ineffability.
Theorem 2.16**.**
Let κ be a cardinal, A a family of subsets of κ and d a κ-list. Then the following are equivalent:
(1)
d* is a Splitκ(A,nonempty)-sequence.*
2. (2)
d* has no A branch.*
Thus, a regular, uncountable cardinal κ is A-ineffable if and only if Splitκ(A,nonempty) fails. In particular, κ is ineffable if and only if Splitκ(stationary,nonempty) fails, and κ is almost ineffable if and only if Splitκ(unbounded,nonempty) fails.
Proof.
(1)⟹(2): Suppose B is an A branch for d. Let A∈A be such that for all α∈A, dα=B∩α. Let β be such that both Aβ+ and Aβ− are nonempty. Let γ∈Aβ+ and δ∈Aβ−. Then β∈γ, γ∈A, β∈dγ and dγ=B∩γ, so β∈B. On the other hand, β∈δ, δ∈A, β∈/dδ and dδ=B∩δ, so β∈/B. This is a contradiction.
(2)⟹(1): We show the contrapositive. So assuming d is not a Splitκ(A,nonempty)-sequence, we have to show that it has an A branch. Let A∈A be such that no β splits A into nonempty sets. So for every β<κ, it’s not the case that both Aβ+ and Aβ− are nonempty. Set
[TABLE]
It follows that for every α∈A, dα=B∩α (and hence that B is an A branch). To see this, let α∈A, and let β<α. If β∈B, then Aβ+=∅, so Aβ−=∅. It follows that β∈dα (because if we had β∈/dα, it would follow that α∈Aβ−). And if β∈/B, then Aβ+=∅. Since β∈α and α∈A, it follows that β∈/dα, because if we had β∈dα, then it would follow that α∈Aβ+=∅. This shows that dα=B∩α, as claimed.
∎
This general theorem on the failure of splitting into nonempty sets allows us to characterize subtle cardinals as well, after introducing an additional concept.
Definition 2.17**.**
Let A,B⊆P(κ) be families of subsets of κ, and let A⊆κ be a fixed subset of κ. Then we write A↾A for A∩P(A), i.e., for the family of sets in A that are contained in A.
We let
[TABLE]
Note that if a κ-list d witnesses that Splitκ(A↾A,B) holds, then the values of dα for α∈κ∖A are irrelevant, and hence it makes sense to restrict d to A, call it an A-list, and view Splitκ(A↾A,B) as postulating the existence of a splitting A-list. Note also that if A⊆B⊆κ and Splitκ(A↾B,B) holds, then so does Splitκ(A↾A,B), since A↾A⊆A↾B. If I⊆P(X) is an ideal, then we write I+ for the collection of I-positive sets, i.e., P(X)∖I. We write I∗ for the dual filter associated to I, which consists of the complements of sets in I.
Observation 2.18**.**
Let A,B⊆P(κ) be families of subsets of κ. Suppose that A=I+, for some ideal I on κ, and that B is closed under supersets. Then I(Splitκ(A,B)) is an ideal.
Proof.
We have already pointed out that I(Splitκ(A,B)) is closed under subsets. Now suppose X,Y∈I(Splitκ(A,B)). Let d, e be X,Y-lists witnessing that Splitκ(A↾X,B), Splitκ(A↾Y,B) holds, respectively. Let f=d∪e↾(Y∖X). Then f is a Splitκ(A↾(X∪Y),B)-list: let Z∈A, Z⊆X∪Y. Then it must be the case that Z∩X or Z∩Y is in I+, because otherwise Z=(Z∩X)∪(Z∩Y) would be the union of two members of I. If Z∩X∈I+, then Z∩X∈A↾X, and so, there is a β<κ such that both (Z∩X)β,d+ and (Z∩X)β,d− are in B. Since f↾X=d, it follows that (Z∩X)d,β+⊆Zβ,e+ and (Z∩X)β,d−⊆Zβ,e−, so, since B is closed under supersets, Zβ,e+ and Zβ,e− are in B. If Z∩X is in I, then Z∩(Y∖X)∈I+, then we can argue similarly, replacing Z∩X with Z∩(Y∖X). This means that I is closed under unions and is thus an ideal as desired. ∎
We will explore split ideals more in the Pκλ-context, in Section 4.
Let’s now characterize when κ is subtle. Recall that by definition, a regular cardinal κ is subtle iff for every κ-list d and every club C⊆κ, there are α<β in C such that dα=dβ∩α.
Lemma 2.19**.**
A regular cardinal is subtle iff I(Splitκ([κ]2,nonempty)) contains no club, i.e., iff for every club C⊆κ, Splitκ([κ]2↾C,nonempty) fails.
Proof.
Let κ be subtle, and suppose Splitκ([κ]2↾C,nonempty) held for some club C⊆κ. Let d be a C-list witnessing this. The proof of Theorem 2.16 then relativizes to C and shows that d has no [κ]2↾C branch. This means that there is no two-element subset of C on which d coheres, contradicting our assumption that κ is subtle.
Vice versa, if κ is not subtle, then there is a club C and a C-list d such that d does not cohere on any two-element subset of C, i.e., d has no [κ]2↾C-branch, and again, by (a relativized version of) Theorem 2.16,
this is equivalent to Splitκ([κ]2↾C,nonempty).
∎
Note that the family of nonempty subsets of κ is not independent of initial segments, and so Observation 2.3 does not apply, and we do not know that Splitκ(A,nonempty) is equivalent to Splitκ,κ(A,nonempty). The latter is equivalent to sA,nonempty(κ)>κ. If every A∈A has at least two elements, then Splitκ,κ(A,nonempty) holds, as witnessed by the (A,nonempty)-splitting family {{α}∣α∈κ}, while Splitκ(A,nonempty) characterizes the failure of κ being A-ineffable. The following theorem will allow us to characterize ineffability by split principles that can be expressed as statements about splitting numbers.
Theorem 2.20**.**
Let κ be a regular cardinal. The following are equivalent.
For (4)⟹(1), let d be a κ-list. We have to find an ineffable branch. Since d is not a Splitκ(stationary) sequence, it follows that there is a stationary set S⊆κ such that for no β<κ do we have that both Sβ+=Sβ,d+ and Sβ−=Sβ,d− are stationary in κ. But clearly, one of them is. For each β<κ let Cβ be club in κ and disjoint from the nonstationary one of Sβ+ and Sβ−. Let C=△β<κCβ. Let T=S∩C. Then d coheres on the stationary set T, because if γ<δ both are members of T, then for ξ<γ, it follows that γ,δ∈Cξ, so if Sξ− is nonstationary, then γ,δ∈Sξ+, which means that ξ∈dγ and ξ∈dδ. And if Sξ+ is nonstationary, then γ,δ∈Sξ− and it follows that ξ∈/dγ and ξ∈/dδ. So dγ=dδ∩γ. Thus, b=⋃α∈Tdα is an ineffable branch.
The statements about the splitting numbers follow because the families we are splitting into are independent of initial segments.
∎
3. Splitting subsets of Pκλ
We may generalize the split principles to the context of Pκλ-lists, and assume for the present section that κ is regular and that λ>κ is a cardinal. Pκλ-lists are sequences of the form ⟨dx∣x∈Pκλ⟩ satisfying dx⊆x for each x∈Pκλ.
We use Jech’s approach to stationary subsets of Pκλ. Thus, a set U⊆Pκλ is called unbounded if for every x∈Pκλ, there is a y∈U with x⊆y. A set C⊆Pκλ is club if it is unbounded and closed under unions of increasing chains of length less than κ, and a set S⊆Pκλ is stationary iff it intersects every club subset of Pκλ, see [Jec03, Def. 8.21]. If f:[λ]n⟶Pκλ, for some n<ω, or f:[λ]<ω⟶Pκλ, then we write Cf for the set {x∈Pκλ∣∀a∈[x]<ω∩dom(f)f(a)⊆x}. It was shown by Menas [Men74, Thm. 1.5] that for every club subset C of Pκλ, there is a function f:[λ]2⟶Pκλ such that Cf∖{∅}⊆C. Since Cf is itself club, the club filter on Pκλ is generated by the sets of the form Cf, and as a result, a subset S of Pκλ is stationary iff it intersects every set of the form Cf.
Definition 3.1**.**
Let κ be regular and λ>κ be a cardinal. Let A and B be families of subsets of Pκλ. The principle SplitPκλ(A,B) says that there is a Pκλ-list d=⟨dx∣x∈Pκλ⟩ that splits A into B, meaning that for every A∈A, there is a β<λ such that both Aβ,d+=Aβ+={x∈A∣β∈dx} (note that β∈dx⟹β∈x) and Aβ,d−=Aβ−={x∈A∣β∈x∖dx} are in B. We write SplitPκλ(A) for SplitPκλ(A,A).
Following Carr’s notation, for x∈Pκλ, let x={y∈Pκλ∣x⊆y}.
We will also use generalized two-cardinal versions of the split principles, where we do not insist that the sequences are Pκλ-lists, as follows. As with the original split principle, these have a close connection to splitting families and splitting numbers.
Definition 3.2**.**
Let κ be regular, λ>κ a cardinal, and τ a cardinal. Let A and B be families of subsets of Pκλ. Define SplitPκλ,τ(A,B) as before, i.e., it says that there is a sequence d=⟨dx∣x∈Pκλ⟩ of subsets of τ that splits A into B, meaning that for every A∈A, there is a β<τ such that both A~β+=A~β,d+={x∈A∣β∈dx} and A~β−=A~β,d−={x∈A∣β∈/dx} are in B.
Similarly, define that a collection S of subsets of Pκλ is an (A,B)-splitting family for Pκλ, if for every A∈A there is an S∈S such that A∩S and A∖S are in B (S splits A into B). The splitting number sA,B(Pκλ) is the smallest cardinality of an (A,B)-splitting family.
The following lemma says that the generalized split principles on Pκλ can be viewed as statements about the sizes of the corresponding splitting numbers.
Lemma 3.3**.**
Let κ<λ be cardinals, τ a cardinal, and let A, B be families of subsets of Pκλ. Then SplitPκλ,τ(A,B) holds iff sA,B(Pκλ)≤τ.
Note: In other words, sA,B(Pκλ) is the least τ such that SplitPκλ,τ(A,B) holds.
Proof.
For the direction from right to left, if S={Sα∣α<τ} is an (A,B)-splitting family for Pκλ, then we can define a sequence ⟨dx∣x∈Pκλ⟩ of subsets of τ by setting
[TABLE]
Then d is a SplitPκλ,τ(A,B) sequence, because if A∈A, then there is a β<τ such that both A∩Sβ and A∖Sβ belong to B, but A∩Sβ=A~β,d+ and A∖Sβ=A~β,d−, so we are done.
Conversely, if d is a SplitPκλ,τ(A,B) sequence, then for each γ<τ, we define a subset Sγ of Pκλ by
[TABLE]
Then S={Sγ∣γ<τ} is an (A,B)-splitting family for Pκλ, because if A∈A, then there is a β<τ such that both A~β,d+ and A~β,d− are in B, but as before, A~β,d+=A∩Sβ and A~β−=A∖Sβ. ∎
The following are the families of subsets of Pκλ we will mostly be working with as our collections A and B with split principles and splitting numbers.
Definition 3.4**.**
•
unbounded is the set of unbounded subsets of Pκλ (note that “unbounded” is not the same as “not bounded” - the more correct term would be “cofinal”, but “unbounded” is the commonly accepted term. So U⊆Pκλ is unbounded iff for every x∈Pκλ there is a y∈Pκλ with x⊆y.)
•
covering is the set of A⊆Pκλ such that ∪A=λ, i.e., for every ξ<λ, there is an x∈A with ξ∈x (note that in the space κ rather than Pκλ, not bounded, unbounded and covering are equivalent).
•
stationary is the collection of stationary subsets of Pκλ.
•
nonempty is the collection of nonempty subsets of Pκλ.
Observation 3.5**.**
Let τ≤κ≤λ be cardinals, and let A and B be collections of subsets of κ such that for all B⊆κ and all β<τ, B∈B iff B∩{β}∈B (“B is independent of initial segments”). Then SplitPκλ,τ(A,B) is equivalent to the existence of a SplitPκλ(A,B)-sequence d of subsets of τ.
Proof.
If d is a SplitPκλ,τ(A,B)-sequence, then the Pκλ-list e defined by ex=dx∩x is a sequence of subsets of τ that is a SplitPκλ(A,B)-sequence.
This is because if A∈A and β<τ is such that A~β,d+ and A~β,d− are in B, then Aβ,e+∩{β}=A~β,d+∩{β}, and similarly, Aβ,e−∩{β}=A~β,d−∩{β}. It follows from our assumption on B that Aβ,e+ and Aβ,e− are in B. ∎
Note that unbounded and stationary are independent of initial segments, while covering and nonempty are not.
Observation 3.6**.**
Let A,B⊆P(κ), and let B be closed under supersets (i.e., if B∈B and B⊆C⊆Pκλ, then C∈B). Then every SplitPκλ(A,B)-sequence is a SplitPκλ,λ(A,B)-sequence.
Proof.
Let d be a SplitPκλ(A,B)-sequence. For any A∈A and any β<λ, Ad,β+=A~d,β+ and Ad,β−⊆A~d,β−. So since B is closed under supersets, it follows that d is a SplitPκλ,λ(A,B)-sequence. ∎
Observation 3.7**.**
Let A,B⊆P(κ) such that B⊆covering. Then the principle SplitPκλ,λ(A,B) implies SplitPκλ(A,nonempty).
Proof.
Let d be a SplitPκλ,λ(A,B) sequence. Let ex=dx∩x, for x∈Pκλ. We show that d is a SplitPκλ(A,nonempty) sequence: let A∈A. Let β<λ be such that A~β+ and A~β− both are in B. In particular, both of these sets are covering. So let x∈A~β+ and let y∈A~β−. Then x∈A, and β∈dx∩x=ex, so x∈Aβ,e+, and y∈A, and β∈y∖dy=y∖ey, so y∈Aβ,e−.
∎
The terminology introduced in the next definition follows [Wei10]. It is the concept corresponding to sequential binary trees from the previous section.
Definition 3.8**.**
A forest on Pκλ is a set F⊆{x2∣x∈Pκλ} such that for every f∈F, if x⊆dom(f), then f↾x∈F, and such that for every x∈Pκλ, there is an f∈F such that x=dom(f). A cofinal branch through F is a function B:λ⟶2 such that for every x∈Pκλ, B↾x∈F.
In [Jec73], forests were referred to as binary (κ,λ)-messes, and cofinal branches through forests were called solutions to binary messes. Clearly, there is an obvious way to assign forests to lists.
Definition 3.9**.**
Given a Pκλ-list d=⟨dx∣x∈Pκλ⟩, for each x∈Pκλ let dxc:x→2 denote the characteristic function of dx.
By closing these characteristic functions downward, we may consider the forest Fd corresponding to the Pκλ-list d, defined by
Fd={dxc↾y∣y⊆x∈Pκλ}.
Below we define several types of branches for Pκλ-lists, similar to our treatment of κ-lists. Some of our terminology is inspired by work of DiPrisco, Zwicker and Carr. We introduce the notion of wild ineffability here, which appears to be new.
Definition 3.10**.**
Let d=⟨dx∣x∈Pκλ⟩ be a Pκλ-list.
A set B⊆λ is a cofinal branch through d so long as for all x∈Pκλ, there is some y∈Pκλ with y⊇x such that
dy∩x=B∩x.
The branch propertyBP(κ,λ) holds iff every Pκλ-list has a cofinal branch, and κ is mildly λ-ineffable iff BP(κ,λ) holds (the origin of mild ineffability is [DZ80]).
A cofinal branch B is guided by a set U⊆Pκλ if for all x∈Pκλ there is a y⊇x such that for all z⊇y with z∈U,
dz∩x=B∩x.
A cofinal branch B is strong if it is guided by an unbounded set.
If every Pκλ-list has a strong branch, then the strong branch propertySBP(κ,λ) holds, and we say that κ is wildlyλ-ineffable.
An almost ineffable branch through d is a subset B⊆λ such that there is an unbounded set U⊆Pκλ such that for all x∈U, dx=B∩x. If every Pκλ-list has an almost ineffable branch, then AIBP(κ,λ) holds, and κ is almost λ-ineffable.
An ineffable branch through d is a subset B⊆λ which comes with a stationary set S⊆Pκλ such that for all x∈S,
dx=B∩x.
If every Pκλ-list has an ineffable branch, then IBP(κ,λ) holds, and κ is λ-ineffable.
In general, if A is a family of subsets of Pκλ and B⊆λ, then we say that B is an A branch of d if there is a set A∈A such that for all x∈A, dx=B∩x.
If F=Fd is the forest corresponding to d, then we refer to a function B:λ⟶2 as a (cofinal, strong, almost ineffable, ineffable) branch of F if the set {α<λ∣B(α)=1} is a (cofinal, strong, almost ineffable, ineffable) branch through d.
Observation 3.11**.**
Let d be a Pκλ-list, and let B⊆λ. If B is an ineffable branch then it is an almost ineffable branch. If it is an almost ineffable branch, then it is a strong branch. If it is a strong branch, then it is a cofinal branch. So we have the following string of implications: IBP(κ,λ)⟹AIBP(κ,λ)⟹SBP(κ,λ)⟹BP(κ,λ).
3.1. Split characterizations of two cardinal versions of ineffability
The next goal is to establish characterizations of the classical two cardinal versions of ineffability and almost ineffability. First, let us state a very general theorem.
Theorem 3.12**.**
Let κ≤λ be cardinals, A a family of subsets of Pκλ and d a Pκλ-list. Then the following are equivalent:
(1)
d* is a SplitPκλ(A,nonempty)-sequence.*
2. (2)
d* has no A branch.*
Proof.
(1)⟹(2): Suppose B is an A branch for d. Let A∈A be such that for all x∈A, dx=B∩x. Let β<λ be such that both Aβ+ and Aβ− are nonempty. Let x∈Aβ+ and y∈Aβ−. Then β∈x, x∈A, β∈dx and dx=B∩x, so β∈B. On the other hand, β∈y, y∈A, β∈/dy and dy=B∩y, so β∈/B. This is a contradiction.
(2)⟹(1): We show the contrapositive. So assuming d is not a SplitPκλ(A,nonempty)-sequence, we have to show that it has an A branch. Let A∈A be such that no β<λ splits A into nonempty sets. So for every β<λ, it is not the case that both Aβ+ and Aβ− are nonempty. Set
[TABLE]
It follows that for every x∈A, dx=B∩x (and hence that B is an A branch). To see this, let x∈A, and let β∈x. If β∈B, then Aβ+=∅, so Aβ−=∅. It follows that β∈dx (because if we had β∈/dx, it would follow that x∈Aβ−). And if β∈/B, then Aβ+=∅. Since β∈x and x∈A, it follows that β∈/dx, because if we had β∈dx, then it would follow that x∈Aβ+=∅. This shows that dx=B∩x, as claimed.
∎
The following lemma is an immediate consequence.
Lemma 3.13**.**
Let κ≤λ.
(1)
κ* is almost λ-ineffable iff SplitPκλ(unbounded,nonempty) fails.*
2. (2)
κ* is λ-ineffable iff SplitPκλ(stationary,nonempty) fails.*
It turns out that the characterization of ineffability by the failure of split principles of the form SplitPκλ(stationary,B) is very robust.
Theorem 3.14**.**
Let κ be regular and uncountable, and λ≥κ be a cardinal.
Let d be a Pκλ-list. The following are equivalent:
(1)
d* is a SplitPκλ(stationary) sequence.*
2. (2)
d* is a SplitPκλ(stationary,unbounded) sequence.*
3. (3)
d* is a SplitPκλ(stationary,covering) sequence.*
4. (4)
d* is a SplitPκλ(stationary,nonempty) sequence.*
5. (5)
d* has no ineffable branch.*
In general, these are equivalent to saying that d is a SplitPκλ(stationary,B) sequence whenever stationary⊆B⊆nonempty.
Proof.
(1)⟹(2)⟹(3)⟹(4) is immediate, because every stationary set is unbounded, every unbounded set is covering, and every covering set is nonempty.
For (5)⟹(1),
we prove the contrapositive, i.e., assuming d does not split stationary sets into stationary sets, we show that d has an ineffable branch.
Let S⊆Pκλ be a stationary set such that for each β<λ, not both Sβ+ and Sβ− are stationary in Pκλ. Since S∩{β}=Sβ+∪Sβ−, this means that exactly one of them is stationary (for each β). Define
[TABLE]
Let Cβ be club in Pκλ and disjoint from the nonstationary one of Sβ+ and Sβ−. Let D=△β<λCβ={x∈Pκλ∣∀β∈xx∈Cβ}. Then D is club, and so, E=S∩D is stationary. But d coheres with B on E: let x∈E. We have to show that B∩x=dx. So let β∈x. Then x∈Cβ. If β∈B, then Sβ+ is stationary, so Cβ∩Sβ−=∅, and so, x∈Sβ+ (since β∈x), which means that β∈dx. And if β∈/B, then Sβ− is stationary, and it follows that x∈Sβ−, so β∈/dx. This shows that B is an ineffable branch.
∎
As an immediate consequence, we get:
Lemma 3.15**.**
If κ is regular and uncountable, and λ≥κ is a cardinal, then the following are equivalent:
(1)
κ* is λ-ineffable.*
2. (2)
SplitPκλ(stationary)* fails.*
3. (3)
SplitPκλ(stationary,unbounded)* fails.*
4. (4)
SplitPκλ(stationary,covering)* fails.*
5. (5)
SplitPκλ(stationary,nonempty)* fails.*
In general, these are equivalent to saying that SplitPκλ(stationary,B) fails whenever stationary⊆B⊆nonempty.
The previous two facts go through in more generality:
Theorem 3.16**.**
Let κ be regular and uncountable, and λ≥κ be a cardinal.
Let d be a Pκλ-list, and let I be a normal ideal on Pκλ. The following are equivalent:
(1)
d* is a SplitPκλ(I+) sequence.*
2. (2)
d* is a SplitPκλ(I+,nonempty) sequence.*
3. (3)
d* has no I+ branch.*
In general, these are equivalent to saying that d is a SplitPκλ(I+,B) sequence whenever I+⊆B⊆nonempty.
Proof.
(1)⟹(2) is immediate, and (2)⟹(3) follows from Theorem 3.12.
For (3)⟹(1),
we prove the contrapositive, i.e., assuming d does not split I-positive sets into sets in I+, we show that d has an I+ branch.
Let S∈I+ be such that for each β<λ, not both Sβ+ and Sβ− are in I+.
Note that {β}∈I∗: this is because {β} is club, and the club filter is the minimal normal filter (see [Car81]), and I∗ is a normal filter.
It follows that for each β<κ, S∩{β}∈I+ (this is equivalent to saying that S∩{β}∈/I). To see this, suppose instead we had S∩{β}∈I. As Pκλ∖{β}∈I also (S∩{β})∪(Pκλ∖{β})∈I, but S is a subset of that, so S∈I, a contradiction.
Since S∩{β}=Sβ+∪Sβ−, this means that exactly one of Sβ+, Sβ− is in I+ (for each β) - we know that not both of them are in I+. If neither of them were in I+, then both would be in I, but then their union would also be in I.
Define
[TABLE]
We show that B is an I branch as follows. Let Cβ be in I∗ and disjoint from the one of Sβ+ and Sβ− that’s in I. By normality, D=△β<λCβ={x∈Pκλ∣∀β∈xx∈Cβ} is in I∗, and so, E=S∩D is in I+. But d coheres with B on E: let x∈E. We have to show that B∩x=dx. So let β∈x. Then x∈Cβ. If β∈B, then Sβ+ is in I+, Cβ∩Sβ−=∅, and so, x∈Sβ+ (since β∈x), which means that β∈dx. And if β∈/B, then Sβ− is in I+, and it follows that x∈Sβ−, so β∈/dx. This shows that B is an I+ branch.
∎
It turns out that the failure of split principles of the form SplitPκλ(unbounded,B) is less robust. We have seen that if B=nonempty, the principle characterizes almost ineffability. The following theorem explores the other extreme, B=unbounded.
Theorem 3.17**.**
Let d be a Pκλ-list. Then d is a SplitPκλ(unbounded) sequence iff d does not have a strong branch.
Proof.
We will show each direction of the implication separately.
⟹:
Towards a contradiction, assume B is a strong branch through d, guided by the unbounded set U⊆Pκλ. Now define a function f so that for all x∈Pκλ, f(x)⊇x, f(x)∈U and for all z⊇f(x), if z∈U then dz∩x=B∩x.
Consider the unbounded set A=f‘‘Pκλ⊆U, and let β split A into unbounded sets, with respect to d.
Suppose that β∈B. Now we may choose y∈Aβ− such that y⊇f({β}), since Aβ− is unbounded. Then y∈U, and by the definition of f({β}) we have that dy∩{β}=B∩{β}. Since β∈B, this means that β∈dy, but since y∈Aβ−, β∈/dy, a contradiction. The case β∈/B works similarly by picking some y⊇f({β}) with y∈Aβ+.
⟸: We will show the contrapositive.
So suppose d=⟨dx∣x∈Pκλ⟩
does not split unbounded sets.
We claim that d has a strong branch. Since d does not split unbounded sets, there is an unbounded A⊆Pκλ such that for each β<λ, exactly one of Aβ+ and Aβ− is unbounded in Pκλ. Define a strong branch B⊆λ by setting
[TABLE]
We claim that B is a strong branch, guided by the unbounded set A. To see this, fix x∈Pκλ. For each element β<λ of x, note that there has to be a yβ∈Pκλ such that either for all z⊇yβ, if z∈A then β∈dz; or for all z⊇yβ, if z∈A then β∈/dz. The former holds if Aβ− is not unbounded, and the latter holds if Aβ+ is not unbounded. Since one of those statements has to be true, yβ is defined for each β<λ. Let y=⋃β∈xyβ. Since κ is regular, y∈Pκλ. Pick z⊇y such that z∈A. Now B∩x=dz∩x as desired.
∎
Corollary 3.18**.**
The following are equivalent:
(1)
SplitPκλ(unbounded)* fails.*
2. (2)
κ* is wildly λ-ineffable.*
3. (3)
Every forest on Pκλ has a strong branch.
Proof.
(1) and (2) are obviously equivalent.
For (3)⟹(1), assume the contrary, and let d be a Pκλ-list that splits unbounded sets into unbounded sets. Then its forest Fd does not have a strong branch, by Theorem 3.17. This contradicts the assumption that every forest on Pκλ has a strong branch.
For (1)⟹(3), given a forest F, for every x∈Pκλ choose a function fx∈F with dom(fx)=x, and let dx={γ∈x∣fx(γ)=1}. Then d is a Pκλ-list, and since Pκλ-Split fails, d does not split unbounded sets, so that by Theorem 3.17, d has a strong branch. Letting B be the characteristic function of this strong branch, it follows that B is a strong branch of Fd, and since Fd⊆F, B is also a strong branch of F. ∎
However, the exact relationship between the existence of a strong branch and a cofinal branch for Pκλ-lists remains somewhat unclear.
Question 3.19**.**
Can there be a Pκλ-list that has a cofinal branch but no strong branch?
Still, in light of the previous corollary, the concept of a strong branch comes up naturally in the context of split principles. Since its exact relationship to the concept of a cofinal branch is somewhat mysterious, we want to take some time to elaborate on it. First, the existence of strong branches through Pκλ-lists can be formulated as coherence properties.
Observation 3.20**.**
Let d be a Pκλ-list.
(1)
d* has an ineffable branch if there is a stationary set S⊆Pκλ such that for all x,y∈S with x⊆y, dx=dy∩x.*
2. (2)
d* has an almost ineffable branch if there is an unbounded set U⊆Pκλ such that for all x,y∈U with x⊆y, dx=dy∩x.*
3. (3)
d* has a strong branch if there is an unbounded set U⊆Pκλ such that for all x∈Pκλ, there is a y⊇x such that for all z0,z1⊇y with z0,z1∈U, dz0∩x=dz1∩x.*
We may now see that wild ineffability can be viewed as expressing a delayed coherence property of Pκλ-lists, removing all mention of the existence of strong branches.
Definition 3.21**.**
Let’s call a function f:Pκλ⟶Pκλ a delay function if for all x∈Pκλ we have that x⊆f(x). Let’s say that a Pκλ-list dcoheres on a set U⊆Pκλ with delay function f if for all x and all z0,z1⊇f(x) with z0,z1∈U we have that dz0∩x=dz1∩x. If a Pκλ-list coheres on U with delay function id, then let’s say that it coheres immediately on U. A continuous delay function is a delay function f such that for some function g:λ⟶λ, f(x)=x∪g‘‘x.
Using this vocabulary, κ is almost λ-ineffable if every Pκλ-list coheres immediately on an unbounded set, it is λ-ineffable if every Pκλ-list coheres immediately on a stationary set, and it is wildly λ-ineffable if it coheres on an unbounded set with some delay function.
Actually, an analysis of the proof of Theorem 3.17 shows that κ is λ-wildly ineffable, then every Pκλ-list coheres on an unbounded set with a delay function of the form f(x)=x∪⋃α∈xg(α), where g:λ⟶Pκλ. Observe that if d coheres on a stationary set S⊆Pκλ with such a delay function, then it has an ineffable branch, because the set Cg={x∣∀α∈xg(α)⊆x} is club, and so, S∩Cg is stationary, but if x⊆y with x,y∈S∩Cg, then f(x)⊆x⊆y, so dx=dx∩x=dy∩x.
We have explored SplitPκλ(unbounded,B) for B=unbounded and B=nonempty. It turns out that the case B=covering characterizes continuously delayed coherence.
Lemma 3.22**.**
Let κ≤λ be cardinals, and let d be a Pκλ-list. The following are equivalent:
(1)
SplitPκλ(unbounded,covering).
2. (2)
d* does not cohere on an unbounded set with a continuous delay function.*
Proof.
(1)⟹(2): Suppose there were a set B⊆λ such that for some unbounded U and some f:λ⟶λ, we’d have that for every x and every y∈U with x∪f‘‘x⊆y, B∩x=dy∩x - this is equivalent to continuously delayed coherence on an unbounded set. Let β split U into covering sets. Let x∈Uβ+, y∈Uβ− be such that f(β)∈x, f(β)∈y. Let a={β}. Then b:=a∪f‘‘a={β,f(β)}⊆x∈U, so B∩a=dy∩a, and since x∈Uβ+, it follows that β∈dx, so β∈B. But also, b⊆y∈U, and since y∈Uβ−, it follows that β∈/dy, and B∩a=dy∩a, i.e., β∈/B, a contradiction.
(2)⟹(1): We show the contrapositive. So assuming d doesn’t split unbounded sets into covering sets, we have to prove coherence with continuous delay. Let U be an unbounded set that is not split into covering sets by any β<λ, wrt. d. Then for each β<λ, it’s not the case that both Uβ+ and Uβ− cover λ. So there is an f(β)<λ such that
(a)
for every x∈U with f(β)∈x, x∈/Uβ+, OR
2. (b)
for every x∈U with f(β)∈x, x∈/Uβ−.
Note that these two cases are mutually exclusive, because there is an x∈U with {β,f(β)}⊆x, and if x∈/Uβ+, since β∈x, it follows that β∈/dx, and so, x∈Uβ−. So exactly one of the two holds. Let
[TABLE]
We claim that for every x, and every y∈U with x∪f‘‘x⊆y, it follows that B∩x=dy∩x (and this implies that d coheres on U with delay function x↦x∪f‘‘x). To see this, let β∈x. If β∈B, then it follows from the definition of B that y∈/Uβ−. But since β∈x⊆y and y∈U, this implies that β∈dy. On the other hand, if β∈/B, then we’re not in case (b) above, so we’re in case (a). So y∈Uβ+, so β∈dy.
∎
Definition 3.23**.**
Let f:Pκλ⟶Pκλ, and let U=⟨Ux∣x∈Pκλ⟩ be a sequence of subsets of Pκλ. Define the f-diagonal intersection of U as
[TABLE]
Observation 3.24**.**
Suppose B is a cofinal branch for the Pκλ-list d. For x∈Pκλ, let
[TABLE]
Then B is a strong branch iff there is a delay function f such that U=△x∈PκλfUx is unbounded.
Proof.
From right to left, if f and U are as stated, then U is an unbounded set that guides B, because for any x, if z⊇f(x) is in U, then z∈Ux, and so, B∩x=dz∩x.
Vice versa, if B is strong and U′ is an unbounded set that guides B, then we can define a delay function f:Pκλ⟶Pκλ such that for every x∈Pκλ, and for every z⊇f(x) with z∈U′, dz∩x=B∩x. It follows that U′⊆△x∈PκλfUx, because if z∈U′ and x is such that f(x)⊆z, then by the property of f, dz∩x=B∩x, that is, z∈Ux. So since U′ is unbounded, so is △fU. ∎
Digressing briefly, we want to explore a connection to Pκλ-partition properties, see [Kan03, p. 346] for an overview.
For a natural number n and a subset X⊆Pκλ, write [X]⊆n for the set
[TABLE]
and say that Part(κ,λ)n holds if for every partition function F:[Pκλ]⊆n⟶2, there is an unbounded set H⊆Pκλ that’s homogeneous for F, meaning that F↾[H]⊆n is constant. Part(κ,λ) is just Part(κ,λ)2.
We give some relevant known results on Part(κ,λ) below.
If κ is almost λ<κ-ineffable, then Part(κ,λ) holds.
2. (2)
If κ is mildly λ<κ-ineffable and cov(Mκ,λ)>λ<κ, then Part(κ,λ) holds.
3. (3)
If Part(κ,22λ<κ) holds, then κ is λ-compact.
The following has a precursor in [Car81, Thm. 2.2], which shows that if Part(κ,λ)3 holds, then κ is mildly λ-ineffable.
Theorem 3.26**.**
Part(κ,λ)3* implies that every Pκλ-list has a strong branch (i.e., that κ is wildly λ-ineffable, or SplitPκλ(unbounded) fails).*
Proof.
The proof of [Car81, Thm. 2.2], in which it was pointed out that the assumption implies that κ is inaccessible, works here as well. Let d be a Pκλ-list, and define a partition F:[Pκλ]⊆3⟶2 by setting, for x⊊y⊊z,
[TABLE]
Let H be an unbounded subset of Pκλ that is homogeneous for F.
We first show that H cannot be 1-homogeneous. Suppose it were. Fix x∈H. Then, for any y0,y1∈H with x⊊y0⊊y1, dy0∩x=dy1∩x. Let κˉ be the cardinality of P(x). Then κˉ<κ, since κ is inaccessible. But there is a sequence ⟨yα∣α<κˉ+⟩ with x⊊y0 and yα⊊yβ for all α<β<κˉ+, because κˉ+<κ and κ is regular. This is a contradiction, because for all such α,β, we would have that dyα∩x=dyβ∩x, giving us κˉ+ distinct subsets of x.
Thus, H is 0-homogeneous. Set
[TABLE]
It follows that:
[TABLE]
Proof of (1). The inclusion from right to left is clear, by definition of B. For the converse suppose α∈B∩x. Let x′⊊y′, x′,y′∈H, with α∈dy′∩x′. Pick z∈H with y∪y′⊊z. Then α∈dy′∩x′=dz∩x′, so α∈dz∩x, since α∈x. So α∈dz∩x=dy∩x, as claimed. \qed(\refeqn:Coherence)
It follows that B is a strong branch, as verified by H. To see this, let x∈Pκλ be given. Find x′∈H with x⊆x′, and let x⊊t, t∈H. We claim that for every u∈H with t⊆u, B∩x=du∩x. But this is immediate, since x′⊊u and x′,u∈H, so by (1), B∩x′=du∩x′, which implies that B∩x=du∩x, since x⊆x′. ∎
One approach to generalizing the theory of ideals on κ to Pκλ involved working with the ordering
[TABLE]
instead of set inclusion - this was spearheaded by Donna Carr (see [Kan03] for the history). This leads to a natural weakening of the partition properties, namely, for n∈ω and a subset X⊆Pκλ, write [X]<n for the set
{{a0,a1,…,an−1}∣a0<a1<…<an−1∈X},
and say that Part(κ,λ)<n holds if for every function F:[Pκλ]<n⟶2, there is an unbounded set H⊆Pκλ that’s homogeneous for F, meaning that F↾[H]n is constant. It is easy to see that the proof of the previous theorem actually shows the following corollary; one just has to replace every instance of “⊊” in the proof with “<”.
Corollary 3.27**.**
Part(κ,λ)<3* implies that every Pκλ-list has a strong branch (i.e., that κ is wildly λ-ineffable, or SplitPκλ(unbounded) fails).*
Still we are left wondering about the status of wild ineffability as a new large cardinal notion; a negative answer to
Question 3.19 would imply that wild ineffability and mild ineffability are the same.
Finally, towards characterizing mild ineffability and strong compactness, we need a slight variation of the split principle.
Definition 3.28**.**
Let F be a set of functions from Pκλ to Pκλ, and let B be a family of subsets of Pκλ. Then SplitPκλ(F,B) is the principle saying that there is a Pκλ-list d such that for every function f∈F, there is a β<λ such that both fβ+={x∣β∈x∧β∈df(x)} and fβ−={x∣β∈x∧β∈/df(x)} belong to B.
Let delay-functions be the set of delay functions from Pκλ to Pκλ, i.e., the set of functions f:Pκλ⟶Pκλ such that for all x∈Pκλ, x⊆f(x).
Theorem 3.29**.**
Let κ be regular and λ≥κ be a cardinal. Then the following are equivalent:
So κ is mildly ineffable iff SplitPκλ(delay-functions,B) fails, for some (equivalently, all) B with stationary⊆B⊆nonempty. It follows that κ is strongly compact iff these equivalent conditions hold for every λ.
Proof.
(1)⟹(2): Suppose SplitPκλ(delay-functions,nonempty) held. Let d witness this. Since κ is mildly λ-ineffable, d has a cofinal branch B⊆λ. There is then a delay function f:Pκλ⟶Pκλ such that for every x∈Pκλ, B∩x=df(x)∩x. By SplitPκλ(delay-functions,nonempty), let β be such that both fβ+ and fβ− are nonempty. Let x0,x1 be such that x0∈fβ+ and x1∈fβ−. This means that β∈df(x0) and β∈/df(x1). Note that by definition, β∈x0,x1. But df(x0)=B∩x0, so β∈B, while on the other hand, df(x1)=B∩x1, so β∈/B, a contradiction.
(2)⟹(3)⟹(4)⟹(5) is trivial.
(5)⟹(1): To prove that κ is mildly λ-ineffable, let d be a Pκλ-list. We have to find a cofinal branch. Since SplitPκλ(delay-functions,stationary) fails, d is not a SplitPκλ(delay-functions,stationary) sequence. This means that there is a delay function f on Pκλ that is not split into stationary sets by any β<λ with respect to d. As in previous arguments, this means that exactly one of fβ+ and fβ− is stationary (note that {β} is the disjoint union of fβ+∪fβ−). So for every β<λ, there is a club set Cβ in Pκλ that’s disjoint from the nonstationary one of fβ+ and fβ−. Let
[TABLE]
Let D=△β<λCβ. To see that B is a cofinal branch, let x∈Pκλ be given. Let x⊆x′∈D. We claim that B∩x=df(x′)∩x. This completes the proof, since x⊆x′⊆f(x′). So let β∈x. Then β∈x′, and so, x′∈Cβ. If β∈B, then fβ+ is stationary, so Cβ∩fβ−=∅. But again, since β∈x′, it follows that x′∈fβ+, so that β∈df(x′). If β∈/B, then fβ+∩Cβ=∅, and since β∈x′, it follows that x′∈fβ−, so β∈/df(x′).
The point about the failure of SplitPκλ(delay-functions,B) follows now, because (2) implies the failure of SplitPκλ(delay-functions,B), and this implies (5).
The claim about κ being strongly compact now follows because it is easy to see that κ is mildly λ-ineffable iff every binary (κ,λ)-mess is solvable (see [Car81, Thm. 1.4, p. 35]), and Jech showed in [Jec73, 2.2, p. 174] that every binary (κ,λ)-mess is solvable iff κ is λ-compact.
∎
3.2. Split characterizations of two cardinal versions of Shelah cardinals
We will now introduce versions of the split principle whose failure can capture variants of the notion of κ being λ-Shelah. This large cardinal notion was introduced by Carr (see [Car81]).
Definition 3.30**.**
Let A⊆Pκλ, A,B⊆P(Pκλ). Then we write A↾A:=A∩P(A).
A functionalA-list is a sequence f=⟨fx∣x∈A⟩ of functions fx:x⟶x. A functional A-list splits a set X⊆Pκλ into B↾A if there is a pair ⟨β,δ⟩∈λ×λ such that the sets
[TABLE]
are in B↾B. The principle A-SplitPκλf(A,B) says that there is an A-list that splits every X∈A↾A into B↾A.
Given a functional A-list f, a function F:λ⟶λ is a
•
cofinal branch for f if for every x∈Pκλ, there is a y∈Pκλ with x⊆y, such that fy↾x=F↾x.
•
strong branch for f if there is an unbounded set U⊆A such that for every x∈Pκλ, there is a y∈Pκλ with x⊆y, such that for every z∈U with y⊆z, fz↾x=F↾x, and in this case, we say that F is guided by U.
•
almost ineffable branch for f if for unboundedly many x, fx=F↾x.
•
ineffable branch for f if for stationarily many x, fx=F↾x.
A is λ-Shelah if every functional A-list has a cofinal branch, and κ is called λ-Shelah if Pκλ is λ-Shelah. A is wildly λ-Shelah if every functional A-list has a strong branch, and κ is wildly λ-Shelah if Pκλ is wildly λ-Shelah.
Note that fx(β)=δ can be equivalently expressed by saying that ⟨β,δ⟩∈fx, so the concept of a splitting functional list is a direct generalization of a splitting list.
It was shown in [Car81] that κ is (almost) λ-ineffable iff every functional Pκλ-list has an (almost) ineffable branch. So moving from Pκλ-lists to functional Pκλ-lists does not make a difference for these concepts. Obviously, the logical relationship between these various types of branches for functional Pκλ-lists is as for regular Pκλ-lists, see Observation 3.11. As a consequence, if κ is almost λ-ineffable, then it is wildly λ-Shelah, and this implies λ-Shelahness and wild λ-ineffability.
It was shown in [Car81] that the ideal corresponding to the failure of the Shelah property is normal, while the non-mildly ineffable ideal is equal to the ideal of the non-unbounded sets (assuming the corresponding large cardinal property).
Theorem 3.31**.**
Let A⊆Pκλ.
A functional A-list f splits all unbounded subsets of A iff it does not have a strong branch.
Proof.
We show both implications separately.
⟹:
Towards a contradiction, assume F is a strong branch through the A-list f, guided by the unbounded set U⊆A. Let g:Pκλ⟶U be so that for all x∈Pκλ, g(x)⊇x and for all z⊇g(x) with z∈U, fz↾x=F↾x. Let ⟨β,δ⟩ split U~=range(g) with respect to f.
If F(β)=δ, then we choose y∈U~β,δ− with y⊇g({β}). Then fy(β)=F(β)=δ, but since y∈U~β,δ−, fy(β)=δ, a contradiction. If F(β)=δ, then we instead choose y∈U~β,δ+ with y⊇g({β}) and get the same contradiction.
⟸: We will show the contrapositive.
So suppose f is a functional A-list that does not split unbounded sets.
There is then an unbounded U⊆Pκλ such that for each ⟨β,δ⟩∈λ×λ, exactly one of U⟨β,δ⟩+ and U⟨β,δ⟩− is unbounded in Pκλ. Define F⊆λ×λ by setting
[TABLE]
We claim that U guides F, making it a strong branch.
To see this, fix x∈Pκλ. For each pair ⟨β,δ⟩∈x×x, there has is a y⟨β,δ⟩∈Pκλ such that either for all z⊇y⟨β,δ⟩ with z∈U we have that fz(β)=δ, or for all z⊇y⟨β,δ⟩ with z∈U, fz(β)=δ. The former holds if Uβ− is not unbounded, and the latter holds if Uβ+ is not unbounded. Let y=⋃⟨β,δ⟩∈x×xy⟨β,δ⟩, and pick z⊇y with z∈U.
Now F∩(x×x)=fz∩(x×x): From right to left, suppose ⟨β,δ⟩∈x×x and fz(β)=δ. Then for all z′⊇z with z′∈U, fz′(β)=δ, because z′⊇z⊇y⟨β,δ⟩. So U⟨β,δ⟩+ is unbounded, and hence, ⟨β,δ⟩∈F. Vice versa, if ⟨β,δ⟩∈F∩(x×x), then Uβ,δ+ is unbounded, and hence, for all z′⊇y⟨β,δ⟩ with z′∈U, fz′(β)=δ (because the alternative would be that for all z′⊇y⟨β,δ⟩ with z′∈U, fz′(β)=δ, but that would mean that U⟨β,δ⟩+ is not unbounded). So since z⊇y⟨β,δ⟩ and z∈U, fz(β)=δ, as claimed.
This implies that F is a function, and hence that it is a strong branch in the functional sense.
∎
Lemma 3.32**.**
Let κ be regular. κ is wildly λ-Shelah iff SplitPκλf(unbounded) fails. It follows that κ is supercompact iff SplitPκλf(unbounded) fails, for all λ.
Proof.
It follows by [Car81] and [Mag74] that κ is supercompact iff κ is λ-Shelah for all λ iff κ is almost λ-ineffable for all λ iff κ is λ-ineffable for all λ. Moreover, [Car81, p. 52, Cor. 1.4] shows that if κ is almost λ-ineffable, then every functional Pκλ-list has an almost ineffable branch, and if κ is λ-ineffable, then every functional Pκλ-list has an ineffable branch. In particular, if κ is almost λ-ineffable, then it is wildly λ-Shelah. It follows from all of this that the failure of SplitPκλf(unbounded) for every λ characterizes the supercompactness of κ.
∎
In order to characterize when κ is λ-Shelah, we need a modification of the functional split principles similar to the modification that was needed in order to characterize mild ineffability.
Definition 3.33**.**
Let F be a set of functions from Pκλ to Pκλ, and let B be a family of subsets of Pκλ. Then SplitPκλf(F,B) is the principle saying that there is a functional list f such that for every function g∈F, there is a pair ⟨β,δ⟩∈λ×λ such that both g⟨β,δ⟩+={x∣β∈x∧fg(x)(β)=δ} and g⟨β,δ⟩−={x∣β∈x∧fg(x)(β)=δ} belong to B.
Lemma 3.34**.**
Let κ be regular and λ≥κ be a cardinal. The following are equivalent:
It follows that κ is supercompact iff these conditions hold for arbitrarily large λ.
Proof.
The proof of 3.29 goes through with minor modifications. By [Car81, p. 63, Cor. 2.1], κ is supercompact iff κ is λ-Shelah, for every λ.
∎
4. Split ideals
In the study of Pκλ-combinatorics, it has proven fruitful to investigate ideals associated to various large cardinal properties. This was done, for example, for the ideal NInκ,λ of non-ineffable subsets of Pκλ, the ideal NAInκ,λ of non-almost-ineffable subsets and the ideal NMIκ,λ of non-mildly-ineffable subsets of Pκλ in [Car81]. It was shown there that if κ is mildly λ-ineffable, then NMIκ,λ is equal to the ideal Iκ,λ of non-unbounded subsets of Pκλ, and that the other ideals are normal ideals if κ has the corresponding large cardinal property.
Since the split principles characterize the failure of a large cardinal property, they allow us to define such ideals in a natural way.
Since some of the large cardinal properties sprouting from our investigation of split principles, such as wild ineffability, appear to be new, it seems worthwhile to investigate these ideals.
Definition 4.1**.**
Let A,B⊆P(Pκλ) be families of subsets of Pκλ, and let A⊆Pκλ. Then we write A↾A for A∩P(A), i.e., for the family of sets in A that are contained in A. We let
[TABLE]
In the more natural cases, I(SplitPκλ(A,B)) is an ideal - this is the case if A=I+, for an ideal I on Pκλ. The proof of Observation 2.18 goes through.
We will first work with the principle SplitPκλ(unbounded), whose failure characterizes the wildly ineffable cardinals.
Lemma 4.2**.**
I(SplitPκλ(unbounded))* is a κ-complete ideal containing Iκ,λ.*
Proof.
Clearly, Iκ,λ⊆I(SplitPκλ(unbounded)), since a non-unbounded set has no unbounded subsets. To see that it is an ideal, first observe that if Y∈I(SplitPκλ(unbounded)) and X⊆Y, then X∈I(SplitPκλ(unbounded)), because if d is a Y-list that splits every unbounded subset of Y, then d↾X is an X-list that splits every unbounded subset of X. Second, we show κ-completeness. Thus, let κˉ<κ and let ⟨Xγ∣γ<κˉ⟩ be a sequence of sets in I(SplitPκλ(unbounded)). For each γ<κˉ, let ⟨dxγ∣x∈Xγ⟩ be a sequence which splits every unbounded subset of Xγ. Let X=⋃γ<κˉXγ. We have to show that there is an X-list that splits every unbounded subset of X, and to achieve this, we amalgamate the lists dγ by letting, for x∈X, ν(x) be least such that x∈Xν(x), and by setting
[TABLE]
for x∈X. We claim that d splits every unbounded subset of X. To see this, let Y⊆X be unbounded. Then for some γ<κˉ,
the set Yˉ={x∈Y∣ν(x)=γ} is unbounded, because the ideal of non-unbounded sets is κ-complete. Since dγ splits every unbounded subset of Xγ, and since Yˉ is an unbounded subset of Xγ, there is a β that splits Yˉ with respect to dγ. But dγ↾Yˉ=d↾Yˉ, so β splits Yˉ with respect to d. ∎
Our lack of knowledge about the relationship between mild ineffability and wild ineffability is reflected by some open questions about the split ideal. It was shown in [Car81] that if κ is mildly λ-ineffable, then NMIκ,λ=Iκ,λ. We do not know whether this is true of the split ideal, and we do not know whether the split ideal is normal, assuming that κ is wildly λ-ineffable.
The ideal corresponding to wild λ-Shelahness, on the other hand, is normal, like the one corresponding to λ-Shelahness. The latter was shown by Carr, and her proof generalizes very directly.
Recall that
an ideal I on Pκλ is normal if for every sequence ⟨Xν∣ν<λ⟩ of members of I, the diagonal union
[TABLE]
belongs to I.
Theorem 4.3**.**
κ* is wildly λ-Shelah iff I:=I(SplitPκλf(unbounded)) is a normal proper ideal on Pκλ.*
Proof.
The direction from right to left is trivial, since if I is a proper ideal, then SplitPκλf(unbounded) fails, which implies that κ is wildly λ-Shelah, by Theorem 3.31.
For the substantial forward direction, assume that κ is wildly Shelah. According to [Car81, Lemma 2.2], to show that I is a normal proper ideal on Pκλ it suffices to show that (0) I is a proper ideal, (1) I is closed under subsets, (2) if X∈I and Y∈Iκ,λ, then X∪Y∈I and (3) I is closed under diagonal unions.
(0) is clear by our assumption that κ is wildly λ-Shelah. (1) is obvious, as in Lemma 4.2. (2) is clear because if X∈I and Y is not unbounded, then we can let f be a functional X-list splitting every unbounded subset of X, and extend it arbitrarily to a functional X∪Y-list f′. If A⊆X∪Y is unbounded, then A=(A∩X)∪(A∩Y), so one of A∩X and A∩Y is unbounded, as the non-unbounded sets form an ideal. Clearly then, A∩X is unbounded, so split by f, and hence, A is split by f′.
The crucial point is (3), the closure of I under diagonal unions. So let ⟨Xν∣ν<λ⟩ be a sequence with Xν∈I for all ν<λ. Fix, for every such ν, a functional Xν-list ⟨fxν∣x∈Xν⟩ that splits every unbounded subset of Xν, and let X′=▽ν<λXν. That is, for x∈Pκλ, x∈X iff there is ν∈x such that x∈Xν. For x∈X′, let γ(x)∈x such that x∈Xγ(x). We follow the proof of [Car81, Thm. 2.3] closely here.
Let {0}={x∈Pκλ∣0∈x}. Let X=X′∩{0}={x∈X∣0∈x}. It suffices to show that X∈I, since then it follows by (2) that X′=X∪(X∖{0})∈I, as X∖{0}∈Iκ,λ.
For every x∈Pκλ, let ⟨αξx∣ξ<otp(x)⟩ be the monotone enumeration of x. Since for every x∈X we have 0∈x, it follows that α0x=0. We amalgamate the functional lists fν into one functional X-list g by defining gx:x⟶x, for x∈X, as follows.
[TABLE]
for ξ<otp(x). Assuming that X is not in I, the functional split ideal on Pκλ, no functional X-list splits all unbounded subsets of X, so Theorem 3.31 implies that every functional X-list has a strong branch. Let G:λ⟶λ be a strong branch for g, guided by the unbounded set U⊆X. Let γ=G(0), and define F:λ⟶λ by F(ξ)=G(ξ+1).
We claim that
F is a strong branch for fγ, guided by U∩Xγ.
To see this, let x∈Pκλ. Set x′=x∪{0}∪{ξ+1∣ξ∈x}. Let y∈Pκλ with x′⊆y be such that for all z∈U with y⊆z, G↾x′=gz↾x′. Since 0∈x′, it follows that gz(0)=G(0)=γ. So for every ξ∈x, we have that ξ,ξ+1∈x′, so F(ξ)=G(ξ+1)=gz(ξ+1)=fzγ(ξ). Note that since U is unbounded, there are such z (meaning z∈U with y⊆z), and for every such z, since gz(0)=G(0)=γ=γ(z), it follows that z∈Xγ. So U∩Xγ is unbounded.
We have reached a contradiction, since we assumed that fγ splits all unbounded subsets of Xγ, which implies, by Theorem 3.31, that it does not have a strong branch. ∎
Definition 4.4**.**
Let I be an ideal on Pκλ.
I is strongly normal iff every function f:X⟶Pκλ such that X∈I+ and for every x∈X, f(x)<x, it follows that there is a y such that f−1‘‘{y}∈I+.
Using methods from [Car87], it is not hard to improve the previous theorem as follows, assuming λ<κ=λ.
Theorem 4.5**.**
Suppose κ is wildly λ-Shelah, where λ<κ=λ. Then I:=I(SplitPκλf(unbounded)) is a strongly normal ideal on Pκλ.
Note: It was shown in [Joh90] that if κ is λ-Shelah and cf(λ)≥κ, then λ<κ=κ.
Proof.
First, let’s write NShκ,λ for the ideal of subsets X of Pκλ that are not λ-Shelah. Clearly then, NShκ,λ⊆I, since if X⊆Pκλ is not λ-Shelah, then SplitPκλf(unbounded↾X) holds, or else, X would be wildly λ-Shelah, and hence λ-Shelah. As a result, the same relation holds between the dual filters associated with these ideals: NShκ,λ∗⊆I∗.
Fix a bijection φ:Pκλ⟶λ. It was shown in [Car87, Prop. 3.4] that if κ is λ-Shelah and λ=λ<κ it follows that the sets A={x∈Pκλ∣x∩κis an inaccessible cardinal} and
B={x∈Pκλ∣φ‘‘(Pκx(x))=x} (where κx=∣x∩κ∣) belong to NShκ,λ∗. It follows that they belong to I∗.
Using these facts, the proof of [Car87, Thm. 3.5] goes through, to show the claim. Namely, given X∈I+ (i.e., a set X⊆Pκλ that is wildly λ-ineffable) and a function f:X⟶Pκλ such that for all x∈X, f(x)<x, we have to show that there is a y∈Pκλ such that f−1‘‘{y}∈I+. Let X1=X∩B, and note that X1∈I+. Define g:X1⟶λ by g(x)=φ(f(x)). Then g(x)∈x, and hence g is regressive. Since I is normal, by Theorem 4.3, there is an α<λ such that g−1‘‘{α} is in I+. But g−1‘‘{α}=f−1‘‘{φ−1(α)}, so we are done. ∎
Bibliography15
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Car 81] Donna Carr. Ineffability properties of P κ λ subscript 𝑃 𝜅 𝜆 P_{\kappa}\lambda . Ph D thesis, Mc Master University, 1981.
3[DZ 80] Carlos A. Di Prisco and William S. Zwicker. Flipping properties and large cardinals. Fundamenta Mathematicae , CIX:31–36, 1980.
4[FGH 17] Gunter Fuchs, Victoria Gitman, and Joel David Hamkins. Incomparable ω 1 subscript 𝜔 1 \omega_{1} -like models of set theory. Mathematical Logic Quarterly , 63(1-2):66–76, 2017.
5[Jec 73] Thomas Jech. Some combinatorial problems concerning uncountable cardinals. Annals of Mathematical Logic , 5:165–198, 1973.
6[Jec 03] Thomas Jech. Set Theory: The Third Millenium Edition, Revised and Expanded . Springer Monographs in Mathematics. Springer, 2003.
7[Joh 90] C. A. Johnson. Some partition relations for ideals on 𝒫 κ λ subscript 𝒫 𝜅 𝜆 \mathcal{P}_{\kappa}\lambda . Acta Mathematica Hungarica , 56(3-4):269–282, 1990.
8[Kan 03] Akihiro Kanamori. The Higher Infinite . Springer Monographs in Mathematics. Springer, second edition, 2003.