This paper refines the hierarchy of large cardinals related to Ramseyness by incorporating -indescribability, establishing new hierarchies of ideals, and providing generic embedding characterizations.
Contribution
It introduces a strict linear refinement of Feng's Ramsey hierarchy using -indescribability ideals and analyzes their containment and equivalence properties.
Findings
01
Established a hierarchy of normal ideals from Ramseyness and -indescribability.
02
Proved the eventual equality of ideals obtained from different -indescribability degrees.
03
Provided generic elementary embedding characterizations of the new large cardinal notions.
Abstract
A subset S of a cardinal κ is Ramsey if for every function f:[S]<ω→κ with f(a)<mina for all a∈[S]<ω, there is a set H⊆S of cardinality κ which is \emph{homogeneous} for f, meaning that f↾[H]n is constant for each n<ω. Baumgartner proved \cite{MR0384553} that if κ is a Ramsey cardinal, then the collection of non-Ramsey subsets of κ is a normal ideal on κ. Sharpe and Welch \cite{MR2817562}, and independently Bagaria \cite{MR3894041}, extended the notion of Πn1-indescribability where n<ω to that of Πξ1-indescribability where ξ≥ω. We study large cardinal properties and ideals which result from Ramseyness properties in which homogeneous sets are demanded to be Πξ1-indescribable. By iterating Feng's Ramsey operator \cite{MR1077260} on the various…
Equations175
[κ]<κ⊆NSκ⊆R([κ]<κ)⊆R(NSκ)⊆R2([κ]<κ)⊆R2(NSκ)⊆⋯.
[κ]<κ⊆NSκ⊆R([κ]<κ)⊆R(NSκ)⊆R2([κ]<κ)⊆R2(NSκ)⊆⋯.
Πξ1(κ)={X⊆κ∣X is not Πξ1-indescribable}
Πξ1(κ)={X⊆κ∣X is not Πξ1-indescribable}
[κ]<κ⊆NSκ⊆Π11(κ)⊆R([κ]<κ)
[κ]<κ⊆NSκ⊆Π11(κ)⊆R([κ]<κ)
R2([κ]<κ)⊆R2(NSκ)⊆R2(Π11(κ))⊆⋯.
Rω(Πβ1(κ))=Rω(Πβ+n1(κ)).
Rω(Πβ1(κ))=Rω(Πβ+n1(κ)).
{Rm(Πβ+n1(κ))∣m,n<ω and β<κ}
{Rm(Πβ+n1(κ))∣m,n<ω and β<κ}
I+={X⊆κ∣X∈/I}
I+={X⊆κ∣X∈/I}
I∗={X⊆κ∣κ∖S∈I}
I∗={X⊆κ∣κ∖S∈I}
A={X⊆κ∣(∃B∈[A]<ω)X⊆⋃B}.
A={X⊆κ∣(∃B∈[A]<ω)X⊆⋃B}.
J+⊆I0∪I1+
J+⊆I0∪I1+
⟺I0∪I1⊆J
⟺J+⊆I0+∩I1+.
f(α)={10if α∈X0<ω∪X1<ωotherwise
f(α)={10if α∈X0<ω∪X1<ωotherwise
S=⟨Sα1,…,αn∣n<ω∧(α1,…,αn)∈[S]n⟩
S=⟨Sα1,…,αn∣n<ω∧(α1,…,αn)∈[S]n⟩
h({ξ})={f({ξ})sup(C∩ξ)if x∈S∩Cif x∈S∖C
h({ξ})={f({ξ})sup(C∩ξ)if x∈S∩Cif x∈S∖C
∃X0,…,Xkφ(X0,…,Xk)
∃X0,…,Xkφ(X0,…,Xk)
∀X0,…,Xkφ(X0,…,Xk)
∀X0,…,Xkφ(X0,…,Xk)
ζ<ξ⋀φζ
ζ<ξ⋀φζ
ζ<ξ⋁φζ
ζ<ξ⋁φζ
Πξ1(κ)={X⊆κ∣X is not Πξ1-indescribable}
Πξ1(κ)={X⊆κ∣X is not Πξ1-indescribable}
Πξ1(κ)={X⊆κ∣X is weakly Πξ1-indescribable}.
Πξ1(κ)={X⊆κ∣X is weakly Πξ1-indescribable}.
S={ξ<κ∣ξ∈Rα(Πβ1(ξ))}
S={ξ<κ∣ξ∈Rα(Πβ1(ξ))}
{ξ<κ∣(∀n<ω)ξ∈Πn1(ξ)+}
{ξ<κ∣(∀n<ω)ξ∈Πn1(ξ)+}
T={ξ<κ∣(∀β<ξ)S∩ξ∈Πβ1(ξ)+}
T={ξ<κ∣(∀β<ξ)S∩ξ∈Πβ1(ξ)+}
N⊨“(κ,∈,R)⊨φ”
N⊨“(κ,∈,R)⊨φ”
N⊨“(∀ξ∈S)(ξ,∈,R∩ξ)⊨¬φ”.
N⊨“(∀ξ∈S)(ξ,∈,R∩ξ)⊨¬φ”.
M⊨“(∀ξ∈S)(ξ,∈,R∩ξ)⊨¬φ”.
M⊨“(∀ξ∈S)(ξ,∈,R∩ξ)⊨¬φ”.
N⊨“(∀ξ∈j(S))(ξ,∈,j(R)∩ξ)⊨¬φ” ,
N⊨“(∀ξ∈j(S))(ξ,∈,j(R)∩ξ)⊨¬φ” ,
T={ξ<κ∣(∀β<ξ)S∩ξ∈Rα(Πβ1(ξ))+}
T={ξ<κ∣(∀β<ξ)S∩ξ∈Rα(Πβ1(ξ))+}
κ∖T={ξ<κ∣(∃β<ξ)S∩ξ∈Rα0+1(Πβ1(ξ))}
κ∖T={ξ<κ∣(∃β<ξ)S∩ξ∈Rα0+1(Πβ1(ξ))}
E={ξ<κ∣S∩ξ∈Rα0+1(Πβ01(ξ))∧ξ>β0}⊆κ∖T
E={ξ<κ∣S∩ξ∈Rα0+1(Πβ01(ξ))∧ξ>β0}⊆κ∖T
C={ξ<κ∣H∩ξ∈Rα0(Πβ01(ξ))+}
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.
Full text
A refinement of the Ramsey hierarchy via indescribability
Brent Cody
Virginia Commonwealth University,
Department of Mathematics and Applied Mathematics,
1015 Floyd Avenue, PO Box 842014, Richmond, Virginia 23284, United States
A subset S of a cardinal κ is Ramsey if for every function f:[S]<ω→κ with f(a)<mina for all a∈[S]<ω, there is a set H⊆S of cardinality κ which is homogeneous for f, meaning that f↾[H]n is constant for each n<ω. Baumgartner proved [Bau75] that if κ is a Ramsey cardinal, then the collection of non-Ramsey subsets of κ is a normal ideal on κ. Sharpe and Welch [SW11], and independently Bagaria [Bag19], extended the notion of Πn1-indescribability where n<ω to that of Πξ1-indescribability where ξ≥ω. We study large cardinal properties and ideals which result from Ramseyness properties in which homogeneous sets are demanded to be Πξ1-indescribable. By iterating Feng’s Ramsey operator [Fen90] on the various Πξ1-indescribability ideals, we obtain new large cardinal hierarchies and corresponding nonlinear increasing hierarchies of normal ideals. We provide a complete account of the containment relationships between the resulting ideals and show that the corresponding large cardinal properties yield a strict linear refinement of Feng’s original Ramsey hierarchy. We also show that, given any ordinals β0,β1<κ the increasing chains of ideals obtained by iterating the Ramsey operator on the Πβ01-indescribability ideal and the Πβ11-indescribability ideal respectively, are eventually equal; moreover, we identify the least degree of Ramseyness at which this equality occurs. As an application of our results we show that one can characterize our new large cardinal notions and the corresponding ideals in terms of generic elementary embeddings; as a special case this yields generic embedding characterizations of Πξ1-indescribability and Ramseyness.
Key words and phrases:
Ramsey, indescribable, large cardinal, generic embedding
2000 Mathematics Subject Classification:
03E35, 03E55
2010 Mathematics Subject Classification:
Primary 03E55; Secondary 03E02, 03E05
The author would like to thank Sean Cox, Victoria Gitman and Chris Lambie-Hanson for many detailed conversations related to the topics of this work. Specifically, the author thanks Victoria Gitman for suggesting the proofs of Theorem 2.10 and Theorem 4.1. Additionally, the author thanks Joan Bagaria, Philip Welch and the anonymous referee for their helpful comments.
1. Introduction
In his work on decidability problems, Ramsey [Ram29] proved his famous combinatorial theorem which states that if m,n<ω and f:[ω]m→n is a function then f has an infinite homogeneous setH⊆ω, meaning that f↾[H]m is constant. The investigation of analogues of Ramsey’s theorem for uncountable sets begun by Erdős, Hajnal, Tarski, Rado and others (see [ET43], [ER52], [ER56] and [EH58]), quickly led to the definition of many large cardinal notions including weak compactness, Ramseyness, measurability and strong compactness (see [Kan03, Section 7] for an account of the emergence of certain large cardinal axioms from the theory of partition relations). We say that κ>ω is a Ramsey cardinal if for every function f:[κ]<ω→2 there is a set H⊆κ of size κ which is homogeneous for f, meaning that f↾[H]n is constant for all n<ω.111See [Git11] for additional motivation and an explanation of how Ramsey cardinals fit into the large cardinal hierarchy. The study of Ramsey-like properties of uncountable cardinals has been a central concern of set theorists working on large cardinals and infinitary combinatorics, with renewed interest in recent years (see [Bau77], [Mit79], [Fen90], [SW11], [Git11], [GW11], [CG15], [HS18], [SNW19], [CGH] and [HL]). In this article, we study Ramsey-like properties of uncountable cardinals in which homogeneous sets are demanded to have degrees of indescribability: for example, a cardinal κ is 1-Πn1-Ramsey where n<ω if and only if every function f:[κ]<ω→2 has a Πn1-indescribable homogeneous set H⊆κ. Among other things, we show that hypotheses of this kind and their generalizations lead to a strict refinement of Feng’s [Fen90] original Ramsey hierarchy: we isolate large cardinal hypotheses which provide strictly increasing hierarchies between Feng’s Πα-Ramsey and Πα+1-Ramsey cardinals for all α<κ.
Baumgartner showed (see [Bau75] and [Bau77]) that in many cases large cardinal properties can be viewed as properties of subsets of cardinals and not just of the cardinals themselves. Recall that for S⊆κ where κ is a cardinal, a function f:[S]<ω→κ is regressive if f(a)<mina for all a∈[S]<ω. It is well-known (see [Bau77, Section 4] or [Git07, Lemma 2.42]) that κ is a Ramsey cardinal if and only if for every regressive function f:[κ]<ω→κ there is a set H⊆κ of size κ which is homogeneous for f. A set S⊆κ is Ramsey if every regressive function f:[S]<ω→κ has a homogeneous set H⊆S of size κ.222Let us point out here that several authors, including Baumgartner [Bau77] and Feng [Fen90], use a different definition of Ramsey set which is equivalent to ours (see Proposition 2.8 below): in [Bau77], a set S⊆κ is Ramsey if for every club C⊆κ and every regressive function f:[S]<ω→κ there is a set H⊆S∩C of size κ which is homogeneous for f. This leads naturally to the consideration of large cardinal ideals: for example, Baumgartner showed that if κ is a Ramsey cardinal then the collection of non-Ramsey subsets of κ is a nontrivial normal ideal on κ called the Ramsey ideal. Similarly, a set S⊆κ is Πn1-indescribable if for all A⊆Vκ and all Πn1 sentences φ, if (Vκ,∈,A)⊨φ then there is an α∈S such that (Vα,∈,A∩Vα)⊨φ, and the collection Πn1(κ) of non–Πn1-indescibable subsets of κ is a normal ideal on κ when κ is Πn1-indescribable. Baumgartner proved that a cardinal κ is Ramsey if and only if κ is pre-Ramsey,333Pre-Ramseyness is defined below in Section 2.3. κ is Π11-indescribable and the union of the Π11-indescribability ideal on κ and the pre-Ramsey ideal on κ generate a nontrivial ideal444An ideal on κ is nontrivial if it is not equal to the entire powerset of κ. which equals the Ramsey ideal; furthermore, reference to these ideals cannot be removed from this characterization because the least cardinal which is both pre-Ramsey and Π11-indescribable is not Ramsey. Thus, Baumgartner’s work shows that consideration of large cardinal ideals is, in a sense, necessary for certain results.
Generalizing the definition of Ramseyness, Feng [Fen90] defined the Ramsey operatorR as follows. Given an ideal I⊇[κ]<κ on κ, we define an ideal R(I) on κ by letting S∈/R(I) if and only if for every regressive function f:[S]<ω→κ there is a set H∈I+ homogeneous for f. It is easy to see that I⊆R(I) and that I⊆J implies R(I)⊆R(J) for all ideals I,J⊇[κ]<κ on κ. Feng proved that if κ is a regular cardinal and I⊇[κ]<κ is an ideal on κ, then R(I) is a normal ideal on κ.555Feng used a different definition of R(I) which is equivalent to ours when either I⊇NSκ or I=[κ]<κ (see Theorem 2.10 below). Notice that κ is a Ramsey cardinal if and only if κ∈/R([κ]<κ), and in this case R([κ]<κ) is the Ramsey ideal on κ. Building on Baumgartner’s work [Bau77] on the ineffability hierarchy below a completely ineffable cardinal, Feng showed that one can iterate the Ramsey operator to obtain an increasing chain of ideals on κ corresponding to a strict hierarchy of large cardinals as follows. Define I−2κ=[κ]<κ and I−1κ=NSκ. For n<ω let Inκ=R(In−2κ). Let Iα+1κ=R(Iακ). If α is a limit ordinal let Iακ=⋃ξ<αIξκ. It may at first appear strange that Feng’s definition of Inκ refers to NSκ for odd n<ω. We will return to this issue below in Remark 1.1 after introducing some notation which clarifies this issue and which will be important for the rest of the paper. In Feng’s terminology,666We tend to avoid Feng’s terminology because his “Πα-Ramsey” notation may create confusion with notation we employ for Ramsey properties defined using the Πξ1-indescribability ideals. a cardinal κ is Πα-Ramsey if and only if κ∈/Iακ and κ is completely Ramsey if and only if κ∈/Iακ for all α. Generalizing a result of Baumgartner, Feng proved that Imκ⊇Πm+11(κ) for 1≤m<ω, and as a consequence the axioms “∃κ(κ is Πn-Ramsey)” form a strictly increasing hierarchy. Using canonical functions, which were introduced by Baumgartner [Bau77] in his study of the ineffability hierarchy, Feng proved that this hierarchy of large cardinal axioms can be extended to obtain a strictly increasing hierarchy of axioms of the form “∃κ(κ is Πα-Ramsey)”. Moreover, Feng gave characterizations of the Πn-Ramsey cardinals for n<ω in terms of indescribability ideals, which are similar to Baumgartner’s above mentioned characterization of Ramseyness in that they use generalizations of pre-Ramseyness and the reference to ideals in the characterizations cannot be removed.
We introduce some notation that differs slightly from Feng’s and which simplifies the presentation of our results. For an ideal I⊇[κ]<κ we define Rα(I) for all ordinals α as follows. Let R0(I)=I. Assuming Rα(I) has been defined let Rα+1(I)=R(Rα(I)). If α is a limit ordinal, let Rα(I)=⋃ξ<αRξ(I). Feng’s increasing chain of ideals can then be written as
[TABLE]
Remark 1.1**.**
Notice that Rω([κ]<κ)=Rω(NSκ), and thus Rα([κ]<κ)=Rα(NSκ) for α≥ω.
Sharpe and Welch [SW11, Definition 3.21] extended the notion of Πn1-indescribability of a cardinal κ where n<ω to that of Πξ1-indescribability where ξ<κ+ by demanding that the existence of a winning strategy for a particular player in a certain finite game played at κ implies that the same player has a winning strategy in the analogous game played at some cardinal less than κ. Later, Bagaria [Bag19, Definition 4.2] gave an alternative definition of the Πξ1-indescribability of a cardinal κ for ξ<κ using the indescribability of rank-initial segments of the set-theoretic universe by certain sentences in an infinitary logic. In what follows we will use Bagaria’s definition since it seems easier to work with in this context. Bagaria extended the definitions of the classes of Πn1 and Σn1 formulas to define the natural classes of Πξ1 and Σξ1 formulas for all ordinals ξ. For example, a formula is Πω1 if it is of the form ⋀n<ωφn where each φn is Πn1 and it contains finitely-many free second order variables.777See Section 2.4 below or [Bag19] for details. A set S⊆κ is said to be Πξ1-indescribable if for all A⊆Vκ and all Πξ1 sentences φ, if (Vκ,∈,A)⊨φ then there is some α∈S such that (Vα,∈,A∩Vα)⊨φ. Furthermore, Bagaria showed that when ξ>0, if κ is Πξ1-indescribable then the collection
[TABLE]
is a nontrivial normal ideal on κ. As a matter of notational convenience we let Π−11(κ)=[κ]<κ.
In this article we study ideals of the form Rα(Πβ1(κ)) for ordinals α,β<κ and the corresponding hierarchy of large cardinals, which provides a strict refinement of Feng’s original hierarchy.888We restrict the values of α and β for which we consider Rα(Πβ1(κ)) to be less than κ because, as explained in Section 2.4, for Bagaria’s version of indescribability, if the Πβ1-indescribability ideal Πβ1(κ) is nontrivial then β<κ, and if α≥κ and β<κ then Rα(Πβ1(κ))=Rα([κ]<κ) by Theorem 1.2 and Corollary 7.5. Thus, apparently, consideration of the ideals Rα(Πβ1(κ)) for α≥κ and β<κ is redundant given Feng’s work on Rα([κ]<κ). For α,β<κ we say that κ is α-Πβ1-Ramsey if κ∈/Rα(Πβ1(κ)). We show that, even though κ being α-Πβ1-Ramsey may be equivalent to κ being α-Πβ′1-Ramsey for some β<β′<κ (see Theorem 1.2 below), by choosing β’s appropriately, hypotheses of the form “∃κ (κ is α-Πβ1-Ramsey)” for β<κ yield a strict hierarchy of hypotheses between “∃κ (κ is Πα-Ramsey)” and “∃κ (κ is Πα+1-Ramsey)”. In order to prove this hierarchy result, it seems that a careful analysis of the corresponding ideals is required (see Remark 7.3 and Figure 4 below). This seems to be a natural sequel to Feng’s work, given that he included Rn(NSκ) in his hierarchy and when κ is inaccessible the Π01-indescribability ideal Π01(κ) equals NSκ.
As a first observation, it is not hard to see that the ideals Rn(Π11(κ)) for n<ω fit into Feng’s increasing chain (1) as expected:
[TABLE]
However, since the Ramseyness of a cardinal κ can be expressed by a Π21 sentence over Vκ, it follows that the least Ramsey cardinal is not Π21-indescribable and hence it is not true in general that Π21(κ)⊆R([κ]<κ). We give a complete account of the nonlinear structure consisting of ideals Rα(Πβ1(κ)) for α,β<κ under the containment relations ⊆ and ⊊.
After reviewing the relevant results of Baumgatner, Feng and Bagaria in Section 2 and after establishing some basic properties of the ideals Rα(Πβ1(κ)) in Section 3, we prove our first reflection result in Section 4 concerning the ideals Rα(Πβ1(κ)) for α,β<κ. It follows from a result of Baumgartner [Bau75, Theorem 4.1] that if κ is a Ramsey cardinal then the set of cardinals less than κ which are Πn1-indescribable for all n is in the Ramsey filter on κ. We generalize this result by proving that for all α<κ, if κ∈/Rα+1([κ]<κ) (i.e. κ is Πα+1-Ramsey in Feng’s terminology) then the set of ξ<κ such that ξ∈/Rα(Πβ1(ξ))for allβ<ξ is in the filter dual to Rα+1([κ]<κ). Hence “∃κ(κ∈/Rα+1([κ]<κ))” is strictly stronger than “∃κ∀β<κ (κ∈/Rα(Πβ1(κ)))”.
In Section 5, we prove a technical lemma which is fundamental for the rest of the paper and which establishes an ordinal γ(α,β) which suffices to express the fact that a set S⊆κ is in Rα(Πβ1(κ))+ using a Πγ(α,β)1 sentence over Vκ. This lemma provides a generalization of a result of Sharpe and Welch [SW11, Remark 3.17] which states that “S∈Rα([κ]<κ)+” is a Π2⋅(1+α)1 property.
In Section 6, we give a full account of the nonlinear containment structure of the ideals Rm(Πβ1(κ)) for m≤ω and β<κ (see Figure 1 below). We derive several corollaries from this result. For example, we provide characterizations of the large cardinal property κ∈/Rm(Πβ1(κ)) which are analogous to Baumgartner’s characterization of Ramseyness discussed above. As a consequence, κ∈/Rm(Πβ1(κ)) implies κ is Πβ+2m1-indescribable, and moreover the ideal Rm(Πβ1(κ)) equals the ideal generated by the Πβ+2m1-indescribability ideal and a generalization of the pre-Ramsey ideal (see Corollary 6.2 below). Furthermore, we prove that “∃κ(κ∈/Rm(Πβ+11(κ))” is strictly stronger than “∃κ(κ∈/Rm(Πβ1(κ))” and that the large cardinal axioms associated to the ideals Rm(Πβ1(κ)) fit into a linear strict hierarchy when the ideals are nontrivial. Furthermore, in analogy with the fact quoted in Remark 1.1 above, we show that if κ∈/Rω(Πβ1(κ)) then for all n<ω,
[TABLE]
Let us point out that the proof of this result is substantially different from the observations made in Remark 1.1 since the relevant ideals
[TABLE]
do not form an increasing chain. Another way of phrasing this result is that at the ω-th level of the Ramsey hierarchy, the ideal chains ⟨Rα(Πβ1(κ))∣α<κ⟩ and ⟨Rα(Πβ+n1(κ))∣α<κ⟩ become equal.
In Section 7, we extend these results to the ideals Rα(Πβ1(κ)) for ω<α<κ and β∈{−1}∪κ. That is, we provide a complete account of the containment relationships between ideals of the form Rα(Πβ1(κ)). As a culmination of these results, given β0<β1 in {−1}∪κ we isolate the precise location in the Ramsey hierarchy at which the ideal chains ⟨Rα(Πβ01(κ))∣α<κ⟩ and ⟨Rα(Πβ11(κ))∣α<κ⟩ become equal by proving the following theorem (see Figure 3 below for an illustration of this result). In what follows, Π−11(κ)=[κ]<κ and Π01(κ)=NSκ.
Theorem 1.2**.**
Suppose β0<β1 are in {−1}∪κ and let σ=ot(β1∖β0). Define α=σ⋅ω. Suppose κ∈Rα(Πβ11(κ))+ so that the ideals under consideration are nontrivial. Then α is the least ordinal such that Rα(Πβ01(κ))=Rα(Πβ11(κ)).
Furthermore, we prove that the large cardinal hypotheses of the form “∃κκ∈/Rα(Πβ1(κ))” provide a strict linear refinement of Feng’s original hierarchy up to Πκ-Ramseyness (see Theorem 7.7 and Figure 4 below).
Finally, in Section 8, as an application of our results we provide characterizations of the ideals Rα(Πβ1(κ)) for α,β<κ in terms of generic elementary embeddings. As a special case, this also yields generic embedding characterizations of Πξ1-indescribability and Ramseyness.
2. Preliminaries
Here we describe some notation that will be used throughout the paper and some results from the literature. We cover some results of Baumgartner (from [Bau75] and [Bau77]) and Feng [Fen90] which serve as motivation for our results. Then we give a brief account of Bagaria’s extension [Bag19] of Πn1-indescribability to Πξ1-indescribability where ξ can be any ordinal.
2.1. Definitions and Notation
Given an ideal I on a cardinal κ we let
[TABLE]
be the corresponding collection of positive sets and we let
[TABLE]
be the filter dual to I. For notational convenience, and in order to avoid double negations, in what follows we will often write X∈I+ instead of X∈/I. If A⊆P(κ) is a collection of subsets of κ then we write A to denote the ideal on κ generated by A:
[TABLE]
An ideal I on κ is called nontrivial if I=P(κ)
We will be concerned with showing that certain large cardinal ideals are obtained by taking the ideal generated by a union of some other large cardinal ideals. We will make repeated use of the following simple remark, which was used implicitly by Baumgartner (see the proof of Theorem 4.4 in [Bau77]).
Remark 2.1**.**
Suppose I0, I1 and J are ideals on κ. In order to prove that J=I0∪I1, part of what we must show is that J⊇I0∪I1, or in other words J+⊆I0∪I1+. Notice that we may obtain a chain of equivalences directly from the definitions involved:
[TABLE]
In what follows, in order to prove that the property J+⊆I0∪I1+ (or equivalently the property J⊇I0∪I1) holds for various ideals, we will prove J+⊆I0+∩I1+ and include a reference to this remark.
2.2. Baumgartner’s ineffability hierarchy
Let us review a few results due to Baumgartner using slightly different notation than [Bau75] and [Bau77]. Suppose κ>ω is a cardinal and S⊆κ. We say that S=⟨Sα∣α∈S⟩ is a (1,S)-sequence999Such sequences are sometimes called S-lists (see [Wei12] or [HLN19]). However, we prefer Baumgartner’s terminology because we will need to distinguish (1,S)-sequences from Feng’s (ω,S)-sequences (see Section 2.3). if for each α∈S we have Sα⊆α. Given a (1,S)-sequence S=⟨Sα∣α∈S⟩, a set H⊆S is homogeneous for S if for all α,β∈H with α<β we have Sα=Sβ∩α.
Given an ideal I⊇[κ]<κ on κ we define another ideal I(I) by letting S∈I(I)+ if and only if for every (1,S)-sequence S there is a set H⊆S in I+ such that H is homogeneous for S. A set S⊆κ is ineffable if S∈I(NSκ)+. Baugartner showed that when κ is an ineffable cardinal the collection I(NSκ) of non-ineffable subsets of κ is a normal ideal on κ, which we call the ineffability ideal on κ. Notice that I can be viewed as a function mapping ideals to ideals, which we call the ineffability operator.
Baumgartner [Bau75, Theorem 5.3] gave several characterizations of ineffability in terms of partition properties. Given a set S⊆κ, a function f:[S]2→κ is said to be regressive if f(a)<mina for all a∈[S]2. A set H⊆S is homogeneous for a function f:[S]2→κ if f↾[H]2 is constant.
Theorem 2.2** (Baumgartner).**
Let κ be a cardinal and S⊆κ. The following are equivalent.
(1)
S* is ineffable.*
2. (2)
For every regressive function f:[S]2→κ there is a set H⊆S stationary in κ which is homogeneous for f.
3. (3)
κ* is regular and for every function f:[S]2→2 there is a set H⊆S stationary in κ which is homogeneous for f.*
Now suppose that \vec{I}=\langle I_{\alpha}\mid\text{\alpha\leq\kappa is an uncountable cardinal}\rangle is a sequence such that each Iα⊇[α]<α is an ideal on α and Iα=P(α) when α is a singular cardinal. We define an ideal I0(I) on κ by letting S∈I0(I)+ if and only if for every (1,S)-sequence S and every club C⊆κ there is an α∈S∩C for which there is a set H⊆S∩C∩α in Iα+ homogeneous for S. When no confusion will arise, as in the case where the nontrivial ideals Iα have a uniform definition, we write I0(Iκ) instead of I0(I).
For example, let \vec{J}=\langle J_{\alpha}\mid\text{\alpha\leq\kappa is a cardinal}\rangle be defined by letting Jα=NSα when α is regular and Jα=P(α) when α is singular. A set S⊆κ is subtle if S∈I0(NSκ)+=I0(J)+.101010Baumgartner showed that S∈I0(NSκ)+ is equivalent to the more often used definition of subtlety of a set S given in Theorem 2.3 (4). We use the stated definition of subtlety of S for ease of presentation. Futhermore, Baumgartner proved that if κ is a subtle cardinal then I0(NSκ) is a normal ideal on κ, which we call the subtle ideal on κ. We refer to I0 as the subtle operator. Recall that every ineffable set is subtle, the least subtle cardinal is not Π11-indescribable and, as shown by Baumgartner [Bau75, Theorem 4.1], the existence of a subtle cardinal is strictly stronger than the existence of a cardinal which is Πn1-indescribable for all n<ω.
As another example, let \vec{J}=\langle J_{\alpha}\mid\text{\alpha\leq\kappa is a cardinal}\rangle be a sequence of ideals defined by letting Jα=Π11(α) when α is Π11-indescribable and Jα=P(α) otherwise. Then I0(Π11(κ))=I0(J) and a set S is in I0(Π11(κ))+ if and only if for every (1,S)-sequence S and every club C⊆κ there is an α∈S∩C for which there is a set H⊆S∩C∩α in Π11(α)+which is homogeneous for S.111111Note that the set H being in Π11(α)+ implies α is Π11-indescribable.
Baumgartner showed [Bau75, Theorem 5.1] that subtlety can be characterized using partition properties.
Theorem 2.3** (Baumgartner).**
Let κ be a cardinal and S⊆κ. The following are equivalent.
(1)
S* is subtle, that is, S∈I0(NSκ)+.*
2. (2)
For every regressive function f:[S]2→κ and every club C⊆κ there is a regular cardinal α≤κ and a set H⊆S∩C∩α stationary in α which is homogeneous for f.
3. (3)
For every function f:[S]2→2 and every club C⊆κ there is a regular cardinal α≤κ and a set H⊆S∩C∩α stationary in α which is homogeneous for f.
4. (4)
For every (1,S)-sequence S and every club C⊆κ there is a set {α0,α1}∈[S∩C]2 which is homogeneous for S.
The following theorem, perhaps one of the most noteworthy of [Bau75], shows that in order to have a full understanding of certain large cardinals, one must consider large cardinal ideals. Taking n=0 in the following theorem, one can easily see that a cardinal κ is ineffable if and only if it is subtle, Π21-indescribable and additionally the subtle ideal and the Π21-indescribable ideal generate a nontrivial ideal which equals the ineffability ideal; moreover, reference to these ideals cannot be removed from this characterization.
Theorem 2.4** (Baumgartner).**
Suppose κ is a cardinal and n<ω. Then κ∈I(Πn1(κ))+ if and only if both of the following hold.
(1)
κ∈I0(Πn1(κ))+* and κ∈Πn+21(κ)+.*
2. (2)
The ideal generated by I0(Πn1(κ))∪Πn+21(κ) is nontrivial and equals I(Πn1(κ)).
Moreover, reference to the ideals in the above characterization cannot be removed because the least cardinal κ such that κ∈I0(Πn1(κ))+ and κ∈Πn+21(κ)+ is not in I(Πn1(κ))+.
In his second article [Bau77] on ineffability properties, Baumgartner iterated the ineffability operator I and defined an increasing chain of ideals as follows. Define I0(NSκ)=NSκ and Iα+1(NSκ)=I(Iα(NSκ)). If α is a limit ordinal let Iα(NSκ)=⋃ξ<αIξ(NSκ). Since the ideals Iα(NSκ) form an increasing chain and there are only 2κ subsets of κ, there must be an α<(2κ)+ such that Iα(NSκ)=Iα+1(NSκ). A cardinal κ is completely ineffable if when α is the least ordinal such that Iα(NSκ)=Iα+1(NSκ) the ideal Iα(NSκ) is nontrivial. Baumgartner introduced canonical function in order to prove [Bau77, Theorem 3.7] that if β<κ+ and κ∈Iβ(NSκ)+ (i.e. Iβ(NSκ) is a nontrivial ideal) then for all α<β the containment Iα(NSκ)⊊Iα+1(NSκ) is proper.
Remark 2.5**.**
Although Baumgartner briefly mentions the ideals Im(Πn1(κ)) in [Bau77] (see the discussion following Corollary 3.5), they, as well as ideals of the form Iα(Πn1(κ)) for ordinals α>1, seem to be otherwise absent from both [Bau75] and [Bau77].
2.3. Baumgartner’s result on the Ramsey ideal and Feng’ s Ramsey hierarchy
Recall from Section 1, that Feng [Fen90] defined the Ramsey operator R, which is analogous to the ineffability operator I, and iterated R in order to define completely Ramsey cardinals.
As noted by Feng [Fen90, Definition 2.1], it is easy to see that if I⊆J are ideals on κ then R(I)⊆R(J). Although it will not be used in what follows, let us show that under reasonable assumptions one obtains proper containment R(I)⊊R(J).
Proposition 2.6**.**
If [κ]<κ⊆I⊊J are nontrivial ideals on κ such that R(I)+∩J=∅ and for all X∈I+ there exist X0,X1∈I+ such that X=X0⊔X1, then R(I)⊊R(J).
Proof.
Suppose I⊊J are as in the statement of the lemma. Let us show that R(I)=R(J). Choose X∈R(I)+∩J. Since X∈I+, there exist X0,X1∈I+ such that X=X0⊔X1. Notice that X0,X1∈J since X0,X1⊆X∈J. Define a function f:[X]<ω→2 by
[TABLE]
Since X∈R(I)+ there is a homogeneous set for f in I+. However, it is straightforward to show that if H⊆X is homogeneous for f, then H is either a subset of X0 or a subset of X1, and is therefore in J. Thus X∈R(J).
∎
Let us define another operator R0 which is analogous to I0. Suppose that \vec{I}=\langle I_{\alpha}\mid\text{\alpha\leq\kappa is a cardinal}\rangle is a sequence such that each Iα⊇[α]<α is an ideal on α. Recall that for a set S⊆κ a function f:[S]<ω→κ is regressive if f(a)<min(a) for all a∈[S]<ω. We define an ideal R0(I) on κ by letting S∈R0(I)+ if and only if for every regressive function f:[S]<ω→κ and every club C⊆κ there is an α∈S∩C for which there is a set H⊆S∩C∩α in Iα+ which is homogeneous for f, meaning that f↾[H]n is constant for each n<ω. As before (see the discussion after Theorem 2.2), many of the ideals Iα will be understood to be trivial, and when no confusion will arise, as in the case where the ideals Iα have a uniform definition, we write R0(Iκ) instead of R0(I). Baumgartner defined a set S⊆κ to be pre-Ramsey if and only if S∈R0([κ]<κ)+. Thus, pre-Ramseyness is to Ramseyness as subtlety is to ineffability.
Feng [Fen90, Theorem 2.3] gave a characterization of Ramseyness which resembles the definition of ineffability. Suppose S⊆κ. For each n<ω and for all increasing sequences α1<⋯<αn taken from S suppose that Sα1,…,αn⊆α1. Then we say that
[TABLE]
is an (ω,S)-sequence. A set H⊆S is said to be homogeneous for an (ω,S)-sequences S if for all 0<n<ω and for all increasing sequences α1<⋯<αn and β1<⋯<βn taken from H with α1≤β1 we have Sα1⋯αn=Sβ1⋯βn∩α1.
The following theorem is essentially due to Feng (see [Fen90, Theorem 2.2 and Theorem 2.3]), with the exception of clause (4) which appears in [SW11, Theorem 3.2].
Theorem 2.7** (Feng).**
Let κ be a regular cardinal and suppose I is an ideal on κ such that I⊇NSκ. For S⊆κ the following are equivalent.
(1)
Every function f:[S]<ω→2 has a homogeneous set H∈P(S)∩I+.
2. (2)
For all γ<κ, every function f:[S]<ω→γ has a homogeneous set H∈P(S)∩I+.
3. (3)
Every structure A in a language of size less than κ with κ⊆A has a set of indiscernibles H∈P(S)∩I+.
4. (4)
S∈R(I)+, that is, for every regressive function f:[S]<ω→κ there is a set H∈P(S)∩I+ which is homogeneous for f.
5. (5)
For every club C⊆κ, every regressive function f:[S]<ω→κ has a homogeneous set H∈P(S∩C)∩I+.
6. (6)
For all (ω,S)-sequences S there is a set H∈P(S)∩I+ which is homogeneous for S.
Proposition 2.8**.**
Suppose I⊇[κ]<κ is an ideal on a regular cardinal κ. Then clauses (4), (5) and (6) of Theorem 2.7 are equivalent.
Proof.
The equivalence of (5) and (6) is due to Feng [Fen90, Theorem 2.3]. It is easy to see that (5) implies (4). Let us show that (4) implies (5).121212The author would like to thank the anonymous referee for this argument as well as Victoria Gitman for an earlier version. Suppose (4) holds and fix a regressive function f:[S]<ω→κ and a club C⊆κ. First, let us argue that ∣S∩C∣=κ. Suppose ∣S∩C∣<κ and let α=sup(S∩C). Define g:S∖(α+1)→κ by letting g(ξ) be the greatest element of C which is less than ξ. Notice that g is regressive. Now let G:[S]<ω→κ be any regressive function with G({ξ})=g(ξ) for ξ∈S∖(α+1). By (4), there is a homogeneous set H∈P(S)∩I+ for G, but then since G↾[H]1 is constant, it follows that g is constant on the unbounded set H, but this contradicts the fact that C is unbounded. Thus ∣S∩C∣=κ. To prove (5) we must show that there is a homogeneous set H∈P(S∩C)∩I+ for f. Let us define another function h:[S∩C]<ω→κ by letting
[TABLE]
and for n>1 let h↾[S∩C]n=f↾[S∩C]n. Then h is regressive, and using (4), there is a homogeneous set H∈P(S)∩I+ for h. Using an argument similar to the above argument for ∣S∩C∣=κ, we see that ∣H∩(S∖C)∣<κ and hence H∩C∈I+. Since h↾[S∩C]<ω=f↾[S∩C]<ω, it follows that H∩C is homogeneous for f, yielding (5).
∎
We will need the next easy consequence of Proposition 2.8.
Corollary 2.9**.**
Suppose κ is a cardinal, I⊇NSκ is an ideal on κ and S∈R(I)+. Then every (1,S)-sequence S=⟨Sα∣α∈S⟩ has a homogeneous set H⊆S in I+.
Proof.
Let S∗ be any (ω,S)-sequence extending S. Since S∈R(I)+ there is a set H⊆S in I+ which is homogeneous for S∗. Clearly H is also homogeneous for S.
∎
In order to prove a certain reflection result (see Theorem 4.1 below), we will use a characterization of Ramsey sets which is given in terms of elementary embeddings; the analogue of this characterization for Ramsey cardinals is essentially due to Michell [Mit79] and was further explored by Gitman [Git11]. Recall that a transitive set M⊨ZFC− of size κ with κ∈M is called a weak κ-model. If M is a weak κ-model we say that an M-ultrafilter U on κ is weakly amenable if for every sequence ⟨Xα∣α<κ⟩ in M of subsets of κ, the set {α<κ∣Xα∈U} is an element of M. An M-ultrafilter U on κ is countably complete if whenever ⟨An∣n<ω⟩ is a sequence of elements of U, possibly external to M, it follows that ⋂n<ωAn=∅. Taking S=κ in the following theorem one obtains Mitchell’s characterization of Ramsey cardinals [Git11, Proposition 2.8(3)].
Theorem 2.10** (Mitchell).**
Suppose κ is a regular cardinal and S⊆κ. Then S∈R([κ]<κ)+ (i.e. S is a Ramsey set) if and only if for every A⊆κ there is a weak κ-model M with A,S∈M for which there exists a weakly amenable countably complete M-ultrafilter U on κ with S∈U.
Proof.
Since the proof of this theorem is a straightforward modification of arguments appearing in [Git07] and [Git11], we provide a brief sketch together with citations to more detailed arguments.131313The author would like to thank Victoria Gitman for a helpful conversation regarding this argument.
Suppose S is Ramsey. Fix A⊆κ. We follow the argument in [Git11, Section 4], which is also given in more detail in [Git07, Chapter 2]. First we argue that there is a set H∈[κ]κ of good indiscernibles for (Lκ[A,S],A,S) (recall that a set of indiscernibles H⊆κ for (Lκ[A,S],A,S) is good if for all γ∈I, γ is a cardinal, (Lγ[A,S],A,S)≺(Lκ[A,S],A,S) and I∖γ is a set of indiscernibles for (Lκ[A,S],A,S,ξ)ξ∈γ). Using the argument for [Git07, Lemma 2.43], it follows that there is a club C⊆κ and a regressive function h:[C]<ω→κ such that any homogeneous set for h is a set of good indiscernibles for (Lκ[A,S],A,S). Since S is Ramsey, it follows that S∩C is Ramsey, and thus the regressive function h:[S∩C]<ω→κ has a homogeneous set H∈P(S∩C)∩[κ]κ. Using the fact that H is a good set of indiscernibles for (Lκ[A,S],A,S), and by following the argument for [Git07, Theorem 2.35, pp. 104–114], one can construct a weak κ-model M with A,S∈M for which there is a weakly amenable countably complete M-ultrafilter U on κ such that a set X∈P(κ)M is in U if and only if there exists α<κ with H∖α⊆X (see [Git07, Lemma 2.44.12] for this characterization of U). Since H⊆S∩C, it follows that S∈U.
Conversely, suppose that for every A⊆κ there is a weak κ-model M with A,S∈M for which there is a weakly amenable countably complete M-ultrafilter U on κ with S∈U. To see that S is Ramsey, fix a regressive function f:[S]<ω→κ. We follow the proof of [Git11, Theorem 3.10]. Let M be a weak κ-model with f∈M and let U be a weakly amenable countably complete M-ultrafilter with S∈U. Using the weak amenability of U we can define the product ultrafilters Un on P(κn)M for all n<ω as follows. Let U0=U. Given Un let Un+1 be the ultrafilter on κn×κ defined by X∈Un+1 if and only if X∈P(κn×κ)M and {α∈κn∣{ξ<κ∣α⌢ξ∈X}∈U}∈Un. Since S∈U, it follows by induction that Sn∈Un for all n<ω. For each n<ω, let jUn:M→Nn be the ultrapower of M by Un and let fn=f↾[S]n. Recall that for each n<ω, the critical point of jUn is κ and X∈Un if and only if (κ,jU(κ),…,jUn−1(κ))∈jUn(X) (see [Git07, Lemma 2.33]). Fix n<ω. By elementarity jUn(fn) is regressive and hence jUn(fn)(κ,jU(κ),…,jUn−1(κ))=η<κ. Thus Hn′={α∈Sn∣fn(α)=η}∈Un. By [Git11, Proposition 2.5], there is a set Hn∈U such that for all increasing sequences α1<⋯<αn from Hn we have (α1,…,αn)∈Hn′. Thus, Hn is homogeneous for fn. Notice that H=⋂n<ωHn must have size κ because if H were bounded, say H⊆α<κ, then the set (κ∖α)∩⋂n<ωHn would be empty, which is impossible by countable completeness since κ∖α∈U. Since H is homogeneous for f we have established S∈R([κ]<κ).
∎
Theorem 2.10 naturally leads to the following characterization of R([κ]<κ) due to Mitchell in terms of elementary embeddings (see [Git11] for more information).
Theorem 2.11** (Mitchell).**
A set S⊆κ is Ramsey, or, in other words, S∈R([κ]<κ)+, if and only if for every A⊆κ there is a weak κ-model M with A,S∈M and there is an elementary embedding j:M→N such that
(1)
The critical point of j is κ.
2. (2)
N* is transitive.*
3. (3)
P(κ)M=P(κ)N**
4. (4)
Whenever ⟨An∣n<ω⟩ is a sequence of elements of P(κ)M which is possibly external to M and κ∈j(An) for all n<ω, then ⋂n<ωAn=∅.
5. (5)
κ∈j(S).
Baumgartner [Bau77, Theorem 4.4] gave a characterization of Ramsey cardinals which is similar to his characterization of ineffable cardinals (Theorem 2.4 above): κ is Ramsey if and only if it is pre-Ramsey, Π11-indescribable and additionally the pre-Ramsey ideal and the Π11-indescribability ideal generate a nontrivial ideal which equals the Ramsey ideal; moreover, reference to these ideals cannot be removed from this characterization. Feng [Fen90, Theorem 4.8] generalized Baumgartner’s characterization of Ramseyness. Taking m=1 and n=0 in the following theorem yields Baumgartner’s result.
Theorem 2.12** (Feng).**
Suppose κ is a cardinal and let I−1=[κ]<κ and I0=NSκ. Let 1≤m<ω and n∈{−1,0}. Then κ∈Rm(In)+ if and only if both of the following hold.
(1)
κ∈R0(Rm−1(In))+* and κ∈Πn+2m1(κ)+.*
2. (2)
The ideal generated by R0(Rm−1(In))∪Πn+2m1(κ) is nontrivial and equals Rm(In).
Moreover, reference to the ideals in the above characterization cannot be removed because the least cardinal κ such that κ∈R0(Rm−1(In))+ and κ∈Πn+2m1(κ)+ is not in R(In)+.
Feng [Fen90, Theorem 5.2] also proved that the Πα-Ramsey cardinals form a hierarchy which is strictly increasing in consistency strength.
Theorem 2.13** (Feng).**
Let ⟨fα∣α<κ+⟩ be a sequence of canonical functions on a regular uncountable cardinal κ.141414See [Bau77] and [Fen90] for the definition and relevant facts concerning canonical sequences of functions. If κ is Πα+1-Ramsey and α<κ+, then \{\gamma<\kappa\mid\text{\gammais\Pi_{f_{\alpha}(\gamma)}-Ramsey}\} is in the Πα+1-Ramsey filter on κ.
2.4. Transfinite indescribability
Sharpe and Welch [SW11, Definition 3.21] introduced a version of Πξ1-indescribability for ξ≥ω which is defined in terms of the existence of winning strategies in certain finite games. Inedpendently, Bagaria [Bag19, Section 4] defined a natural notion of Πξ1-formula for ξ≥ω using infinitary logic, and then gave a definition of Πξ1-indescribability in terms of rank initial segments of the set theoretic universe. As mentioned in Section 1, it is not difficult to see that Sharpe-Welch notion of the Πξ1-indescribability of a cardinal κ is equivalent to Bagaria’s notion for ξ<κ. For the reader’s convenience, we summarize Bagaria’s definition, which we will use throughout the paper.
Definition 2.14** (Bagaria).**
In what follows all quantifiers which are explicitly displayed are of second order. For any ordinal ξ, we say that a formula is Σξ+11 if it is of the form
[TABLE]
where φ(X0,…,Xk) is Πξ1. And a formula is Πξ+11 if it is of the form
[TABLE]
where φ(X0,…,Xk) is Σξ1.
If ξ is a limit ordinal, we say that a formula is Πξ1 if it is of the form
[TABLE]
where φζ is Πζ1 for all ζ<ξ and the infinite conjunction has only finitely-many free second-order variables. And we say that a formula is Σξ1 if it is of the form
[TABLE]
where φζ is Σζ1 for all ζ<ξ and the infinite disjunction has only finitely-many free second-order variables.
Definition 2.15** (Bagaria).**
Suppose κ is a cardinal. A set S⊆κ is Πξ1-indescribable if for all subsets A⊆Vκ and every Πξ1 sentence φ, if (Vκ,∈,A)⊨φ then there is some α∈S such that (Vα,∈,A∩Vα)⊨φ.
Remark 2.16**.**
As pointed out by Bagaria, it is clear from the definition that if κ is Πξ1-indescribable then ξ<κ. When we write κ∈Πξ1(κ)+, this indicates that κ is Πξ1-indescribable, and hence it should be understood that ξ<κ.
There is a natural normal ideal associated to the Πξ1-indescribability of a cardinal. The following result is due to Bagaria [Bag19], and independently Brickhill and Welch (see [BW, Lemma 3.21] and [Bri, Lemma 4.3.7]).
Proposition 2.17** (Bagaria; Brickhill-Welch).**
If κ is a Πξ1-indescribable cardinal where ξ<κ then the collection
[TABLE]
is a nontrivial normal ideal on κ.
In some cases, it will be convenient to work with a weak version of Πξ1-indescribability.
Definition 2.18**.**
A set S⊆κ is weakly Πξ1-indescribable if for all A⊆κ and all Πξ1 sentences φ, if (κ,∈,A)⊨φ then there is an α∈S such that (α,∈,A∩α)⊨φ.
Remark 2.19**.**
It is easy to check that if κ is inaccessible a set S⊆κ is weakly Πξ1-indescribable if and only if it is Πξ1-indescribable, and hence
[TABLE]
Next, we show that one of Baumgartner’ s fundamental technical lemmas from [Bau75] can be extended from Πn1-indescribability to Bagaria’ s notion of Πξ1-indescribability. The following lemma also extends a result of Brickhill and Welch [BW, Theorem 5.3] concerning their notion of γ-ineffability, where the γ-ineffability of κ is equivalent under the assumption V=L to κ∈I(Πγ1(κ))+ for γ<κ.
Lemma 2.20**.**
Suppose S⊆κ and for every (1,S)-sequence S=⟨Sα∣α∈S⟩ there is a B∈Q such that B is homogeneous for S. If Q⊆⋂ξ∈{−1}∪βΠξ1(κ)+ where β<κ, then S is a Πβ+11-indescribable subset of κ. (Notice that if β=η+1 is a successor ordinal, the result states that if Q⊆Πη1(κ)+ where η<κ, then S is a Πη+21-indescribable subset of κ.)
Proof.
The case in which β<ω is due to Baumgartner (see [Bau75, Lemma 7.1] for the case in which 1≤β<ω and the discussion after Theorem 7.2 in [Bau75] for the case in which β=0). Notice that the assumption that every (1,S)-sequence S=⟨Sα∣α∈S⟩ has a homogeneous set H∈⋂ξ∈{−1}∪βΠξ1(κ)+ implies that κ is inaccessible, and hence, in order to show that κ is Πβ+11-indescribable, it suffices to show that κ is weakly Πβ1-indescribable.
First, let us consider the case in which β is a limit ordinal. Suppose (κ,∈,A)⊨∀X(⋁ξ<βφξ) where φξ is Σξ1 for ξ<β. Suppose for all α∈S there is an Sα⊆α such that (α,∈,A∩α)⊨⋀ξ<β¬φξ[Sα]. By assumption there is a B∈Q which is homogeneous for S=⟨Sα∣α∈S⟩. Let X=⋃α∈BSα. Then for some ζ<β we have (κ,∈,A)⊨φζ[X]. Since B∈⋂ξ∈{−1}∪βΠξ1(κ)+, there is an α∈B such that (α,∈,A∩α)⊨φζ[X∩α]. Since B is homogeneous for X we see that X∩α=Sα and thus (α,∈,A∩α)⊨φζ[Sα], a contradiction.
When β=η+1 is a successor ordinal the argument is very similar to Baumgartner’s argument for [Bau75, Lemma 7.1]. We must show that if Q⊆Πη1(κ)+ then S is a Πη+21-indescribable subset of κ. Suppose (κ,∈,A)⊨∀X∃Yψ(X,Y) where ψ(X,Y) is a Πη1 formula. Further suppose that for each α∈S there is an Sα⊆α such that (α,∈,A∩α,Sα)⊨∀Y¬ψ(Sα,Y). This defines a (1,S)-sequence S=⟨Sα∣α∈S⟩. By assumption there is a B∈Q which is homogeneous for S. Let X=⋃α∈BSα. Then there is a Y⊆κ such that (κ,∈,A,X,Y)⊨ψ(X,Y). Since B is Πη1-indescribable, there is an α∈B such that (α,∈,A∩α,X∩α,Y∩α)⊨ψ(X∩α,Y∩α). Since X∩α=Xα, this is a contradiction.
∎
3. Basic properties of the ideals Rα(Πβ1(κ))
In this section we begin our study of the ideals Rα(Πβ1(κ)) obtained from iterating Feng’s Ramsey operator on Bagaria’s Πβ1-indescribability ideals. The following straightforward lemmas will be used in Section 6 and Section 7 below to prove that a proper containment holds between two particular ideals.
Recall that if Sξ is a stationary subset of ξ for all ξ in some set S⊆κ which is stationary in κ, then ⋃ξ∈SSξ is stationary in κ. The next lemma shows that the analogous fact is true for the ideals Rα(Πβ1(κ)).
Lemma 3.1**.**
Suppose α<κ and β∈{−1}∪κ. Further suppose S∈Rα(Πβ1(κ))+ and for each ξ∈S let Sξ∈Rα(Πβ1(ξ))+. Then ⋃ξ∈SSξ∈Rα(Πβ1(κ))+.
Proof.
Suppose α=0. Fix A⊆Vκ and let φ be a Πβ1(κ) sentence such that (Vκ,∈,A)⊨φ. Since S∈Πβ1(κ)+, there is a ξ∈S such that (Vξ,∈,A∩Vξ)⊨φ. Now since Sξ∈Πβ1(ξ)+, there is a ζ∈Sξ such that (Vζ,∈,A∩Vζ)⊨φ. Hence ⋃ξ∈SSξ∈Πβ1(κ)+.
If α is a limit and the result holds for all ordinals less than α, it can easily be checked that the result holds for α using the fact that Rα(Πβ1(κ))=⋃ζ<αRζ(Πβ1(κ)).
Now suppose α>0 is a successor ordinal and the result holds for α−1, let us show that it holds for α. Fix a regressive function f:[⋃ξ∈SSξ]<ω→κ. For each ξ∈S there is a set Hξ⊆Sξ in Rα−1(Πβ1(ξ))+ homogeneous for f↾[Sξ]<ω. Since S∈Rα(Πβ1(κ))+, it follows by Corollary 2.9 that the (1,S)-sequence H=⟨Hξ∣ξ∈S⟩ has a homogeneous set H⊆S in Rα−1(Πβ1(κ))+. By our inductive hypothesis, ⋃ξ∈HHξ∈Rα−1(Πβ1(κ))+. It will suffice to show that ⋃ξ∈HHξ is homogeneous for f. Suppose α,β∈[⋃ξ∈HHξ]n. By the homogeneity of H, it follows that there is a ξ∈H such that α,β∈[Hξ]n. Since Hξ is homogeneous for f↾[Sξ]<ω, we have f(α)=f(β).
∎
Recall that if κ is a weakly compact cardinal, then the set of non–weakly compact cardinals less than κ is a weakly compact subset of κ. The next lemma shows that the corresponding fact is true for the ideals Rα(Πβ1(κ)).
Lemma 3.2**.**
For all α<κ and all β∈{−1}∪κ, if κ∈Rα(Πβ1(κ))+ then the set
[TABLE]
is in Rα(Πβ1(κ))+.
Proof.
Let κ be the least counterexample. In other words, κ is the least cardinal such that κ∈Rα(Πβ1(κ))+ and S={ξ<κ∣ξ∈Rα(Πβ1(ξ))}∈Rα(Πβ1(κ)). Then the set κ∖S is in Rα(Πβ1(κ))∗ and hence also in Rα(Πβ1(κ))+. For each ζ∈κ∖S, by the minimality of κ, the set Sζ=S∩ζ is in Rα(Πβ1(ζ))+. Thus, by Lemma 3.1, the set S=⋃ζ∈κ∖SSζ is in Rα(Πβ1(κ))+, a contradiction.
∎
4. A first reflection result
Baumgartner showed [Bau75, Theorem 4.1] that if κ is a subtle cardinal then the set
[TABLE]
is in the subtle filter. Since Ramsey cardinals are subtle, Baumgartner’ s result shows that the existence of a Ramsey cardinal is strictly stronger than the existence of a cardinal that is Πn1-indescribable for every n<ω. Our next goal will be to show that the existence of a Ramsey cardinal is strictly stronger than the existence of a cardinal κ which is Πβ1-indescribable for all β<κ; the proof is implicit in [Bag19] and is obtained by combining the methods of [Bag19], [Git11] and [Jec03, Theorem 17.33 and Exercise 17.29]. In order to prove this result we will use the elementary embedding characterization of Ramseyness due to Mitchell [Mit79] (see Theorem 2.11 above) and further explored by Gitman [Git11] and Sharpe-Welch [SW11].
Theorem 4.1**.**
If S∈R([κ]<κ)+, then the set
[TABLE]
is in R([κ]<κ)∗.
Proof.
151515The author would like to thank Victoria Gitman for suggesting this proof.
Suppose S is Ramsey. To show that T∈R([κ]<κ)∗ we must show that there is a set A⊆κ such that whenever M is a weak κ-model with A,T∈M and whenever j:M→N is an elementary embedding satisfying properties (1)–(4) from Theorem 2.11, then it must be the case that κ∈j(T). Take A=S. Since S is Ramsey, by Theorem 2.11, we may let M be a weak κ-model with S,T∈M and suppose j:M→N is an elementary embedding satisfying properties (1)–(4) from Theorem 2.11 such that κ∈j(S). To show that κ∈j(T) we must show that for every β<κ we have N⊨S∈Πβ1(κ)+. Suppose not, that is, suppose that for some fixed β<κ, N thinks S is not a Πβ1-indescribable subset of κ. Since N thinks κ is strongly inaccessible, it follows that N thinks S is not weaklyΠβ1-indescribable. Thus, there is an R∈P(κ)N and a Πβ1 sentence φ such that
[TABLE]
and
[TABLE]
Now, for each ξ<κ we have R∩ξ∈M because P(κ)M=P(κ)N. Furthermore, since j is elementary and crit(j)=κ, it follows that for each ξ∈S we have M⊨ “(ξ,∈,R∩ξ)⊨¬φ.” Since S,R∈M we see that
[TABLE]
By elementarity
[TABLE]
but this is a contradiction since κ∈j(S).
∎
Next we show that Theorem 4.1 can, in a sense, be pushed up the Ramsey hierarchy.
Theorem 4.2**.**
For all ordinals α<κ, if S∈Rα+1([κ]<κ)+ then the set
[TABLE]
is in Rα+1([κ]<κ)∗.
Proof.
Let us proceed by induction on α. If α=0, the result follows directly from Theorem 4.1.
Suppose α=α0+1 is a successor ordinal and the result holds for ordinals less than α. Let us show it holds for α. Suppose not. Then S∈Rα0+2([κ]<κ)+ and the set
[TABLE]
is in Rα0+2([κ]<κ)+. Since Rα0+2([κ]<κ) is a normal ideal on κ, there is a fixed β0<κ such that the set
[TABLE]
is in Rα0+2([κ]<κ)+. We will define a (1,E)-sequence S=⟨Eξ∣ξ∈E⟩. Without loss of generality, by intersecting with a club, we can assume that every element of E is closed under Gödel pairing. For each ξ∈E, let fξ:[S∩ξ]<ω→ξ be a regressive function such that no homogeneous set for fξ is in Rα0(Πβ01(ξ))+. Let Eξ code fξ as a subset of ξ in a sufficiently nice way. Since E∈Rα0+2([κ]<κ)+, there is a set X∈P(E)∩Rα0+1([κ]<κ)+ homogeneous for E. Let F=⋃ξ∈Xfξ and notice that F:[S]<ω→κ is a regressive function and F↾[S∩ξ]<ω=fξ for all ξ∈X. Since S∈Rα0+2([κ]<κ)+ there is an H∈Rα0+1([κ]<κ)+ homogeneous for F. By our inductive assumption, the set
[TABLE]
is in Rα0+1([κ]<κ)∗ and since X∈Rα0+1([κ]<κ)+ it follows that X∩C∈Rα0+1([κ]<κ)+. Choose an ordinal ξ∈X∩C. Then H∩ξ∈Rα0(Πβ01(ξ))+ and since H is homogeneous for F and ξ∈X we see that H∩ξ is homogeneous for fξ. This contradicts the fact that fξ:[S∩ξ]<ω→ξ has no homogeneous set in Rα0(Πβ01(ξ))+.
Suppose α is a limit ordinal, the result holds for ordinals less than α and, for the sake of contradiction, the result is false for α. Suppose S∈Rα+1([κ]<κ)+ and the set
[TABLE]
is in Rα+1([κ]<κ)+. Since Rα+1([κ]<κ) is a normal ideal and α<κ is a limit ordinal, there are fixed α0<α and β0<κ such that the set
[TABLE]
is in Rα+1([κ]<κ)+. The rest of the argument is essentially the same as that of the successor case. ∎
Since we will refer to it later, let us state the following corollary which asserts that “∃κκ∈Rα+1([κ]<κ)+” is strictly stronger than “∃κ (∀β<κ) κ∈Rα(Πβ1(κ))+”.
Corollary 4.3**.**
For all ordinals α<κ, if κ∈Rα+1([κ]<κ)+ then the set
[TABLE]
is in Rα+1([κ]<κ)∗.
5. Describing degrees of Ramseyness
In order to prove that certain relationships hold between ideals of the form Rα(Πβ1(κ)), we will need to know what ξ will suffice to be able to express the fact that a set S⊆κ is in Rα(Πβ1(κ))+ using a Πξ1 sentence. The following lemma is a generalization of a result of Sharpe and Welch [SW11, Remark 3.17], which states that “X∈Rα([κ]<κ)+” is a Π2⋅(1+α)1 property.
Lemma 5.1** (The case β=−1 is due to Sharpe and Welch).**
Suppose β is an ordinal. For each ordinal α, if α>ω let α=αˉ+mα where αˉ is the greatest limit ordinal which is less or equal to α and mα<ω. Define an ordinal γ(α,β) by
[TABLE]
Then, for all ordinals α, there is a Πγ(α,β)1 sentence φ such that for all cardinals δ with max(α,β)<δ and all sets X⊆δ we have
[TABLE]
Proof.
First we consider the case in which α<ω. If α=0 then the result holds because there is a Πβ+11 sentence φ such that if β<δ and X⊆δ then X∈R0(Πβ1(δ))+=Πβ1(δ)+ if and only if (Vδ,∈,X)⊨φ (see [Bag19]). Assume 0<α<ω and the result holds for the ordinal α−1<ω. Then there is a Πβ+2α−11 sentence ψ such that whenever max(α,β)<δ and X⊆δ we have X∈Rα−1(Πβ1)+ if and only if (Vδ,∈,X)⊨ψ. By definition of the Ramsey operator, for any relevant δ and X⊆δ, we have X∈Rα(Πβ1(δ))+ if and only if for every regressive function f:[X]<ω→δ there is a set H∈Rα−1(Πβ1(δ))+ homogeneous for f. Thus there is a Πβ+2α+11 sentence φ (namely, the sentence “∀f∃Hψ”) such that X∈Rα(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨φ.
Suppose α<κ is a limit ordinal and the result holds for all ordinals η<α. By definition of the Ramsey hierarchy, for all relevant δ we have Rα(Πβ1(δ))=⋃ξ<αRξ(Πβ1(δ)), and thus, for sets X⊆δ we have
[TABLE]
For each ξ<α there is a Πγ(ξ,β)1 sentence φξ such that X∈Rξ(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨φξ. Since the sequence ⟨γ(ξ,β)∣ξ<α⟩ is strictly increasing and γ(ξ,β)<β+α for all ξ<α, it follows that there is a Πβ+α1 sentence φ such that X∈Rα(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨φ for all relevant δ and X.
Suppose α=αˉ+mα>ω is a successor ordinal and the result holds for all ordinals less than α. Notice that mα≥1 since αˉ is a limit ordinal. Suppose mα=1. By our inductive hypothesis there is a Πβ+αˉ1 sentence ψ such that for all relevant δ and X⊆δ we have X∈Rαˉ(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨ψ. By definition of the Ramsey operator, for all relevant δ and X⊆δ we have X∈Rαˉ+1(Πβ1(δ))+ if and only if for every regressive function f:[X]<ω→κ there is a set H∈Rαˉ(Πβ1(δ))+ homogeneous for f. This implies that there is a Πβ+αˉ+21 sentence φ such that for all relevant δ and X⊆δ we have X∈Rαˉ+1(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨φ. Now, suppose mα>1 and assume the result holds for the ordinal αˉ+mα−1. Then for all relevant δ and X⊆δ there is a Πβ+αˉ+2(mα−1)1 sentence ψ such that X∈Rαˉ+mα−1(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨ψ. For all relevant δ and X⊆δ we have X∈Rαˉ+mα(Πβ1(δ))+ if and only if for every regressive function f:[X]<ω→κ there is a set H∈Rαˉ+mα−1(Πβ1(δ))+ homogeneous for f. Since H∈Rαˉ+mα−1(Πβ1(δ))+ is expressible by a Πβ+αˉ+2(mα−1)1 sentence ψ over (Vδ,∈,H), it follows that there is a Πβ+αˉ+2mα1 sentence φ such that X∈Rαˉ+mα(Πβ1(δ))+ if and only if (Vδ,∈,X)⊨φ.
∎
6. Indescribability in finite degrees of Ramseyness
Next we prove that for 0<m<ω and β<κ, the ideal Rm(Πβ1(κ)) is obtained by using a generating set consisting of the pre-Ramsey operator applied to the ideal Rm−1(Πβ1(κ)) one-level down in the Ramsey hierarchy together with the ideal Rm−1(Πβ+21(κ)). This result also gives more information about the ideals Rm([κ]<κ) considered by Feng [Fen90, Theorem 4.8].
Theorem 6.1**.**
For all 0<m<ω and all β∈{−1}∪κ, if κ∈Rm(Πβ1(κ))+ then
[TABLE]
Proof.
We proceed by induction on m. For the base case of the induction in which m=1, we will show that for all β∈{−1}∪κ we have
[TABLE]
Fix β∈{−1}∪κ and let I=R0(Πβ1(κ))∪Πβ+21(κ). We will show that X∈I+ if and only if X∈R(Πβ1(κ))+.
Suppose X∈I+ and X∈R(Πβ1(κ)). Let f:[X]<ω→κ be a regressive function and suppose that every homogeneous set for f is not Πβ1-indescribable. This can be expressed by a Πβ+21 sentence φ over (Vκ,∈,X,f), and thus the set
[TABLE]
is in Πβ+21(κ)∗. Since X∈/I, X is not the union of a set in R0(Πβ1(κ)) and a set in Πβ+21(κ), and since X=(X∩C)∪(X∖C), it follows that X∩C∈/R0(Πβ1(κ)). Thus, by definition of R0(Πβ1(κ)), there is a ξ∈X∩C with ξ>β such that there is a set H⊆X∩C∩ξ which is Πβ1-indescribable in ξ and homogeneous for f. This contradicts ξ∈C.
Now suppose X∈R(Πβ1(κ))+. By Remark 2.1, it suffices to show that X∈R0(Πβ1(κ))+ and X∈Πβ+21(κ)+. To see that X∈Πβ+21(κ)+ notice that every (1,X)-sequence X=⟨Xξ∣ξ∈X⟩ has a homogeneous set in Πβ1(κ)+, and thus by Lemma 2.20, X is Πβ+21-indescribable. Let us show X∈R0(Πβ1(κ))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. Since R(Πβ1(κ)) is a normal ideal it follows that X∩C∈R(Πβ1(κ))+ and thus there is a set H⊆X∩C which is Πβ1-indescribable in κ and homogeneous for f. The fact that H is Πβ1-indescribable can be expressed by a Πβ+11 sentence φ over (Vκ,∈,H). Since X∩C∈Πβ+21(κ)+, it follows that there is a ξ∈X∩C with ξ>β such that (Vξ,∈,H∩ξ)⊨φ and hence H∩ξ⊆X∩C∩ξ is Πβ1-indescribable in ξ and homogeneous for f. Thus X∈R0(Πβ1(κ))+.
For the inductive step, suppose that for all k<m and all β∈{−1}∪κ we have
[TABLE]
Fix β∈{−1}∪κ. Let us argue that
[TABLE]
Let I=R0(Rm−1(Πβ1(κ)))∪Rm−1(Πβ+21(κ)). We will show that X∈I+ if and only if X∈Rm(Πβ1(κ))+.
Suppose X∈I+. For the sake of contradiction suppose that X∈Rm(Πβ1(κ)). Then there is a regressive function f:[X]<ω→κ such that every homogeneous set for f is in Rm−1(Πβ1(κ)). By Lemma 5.1, the fact that every homogeneous set for f is in Rm−1(Πβ1(κ)) can be expressed by a Πβ+2m1 sentence φ over (Vκ,∈,X,f). Thus the set C={α<κ∣(Vα,∈,X∩α,f∩Vα)⊨φ} is in Πβ+2m1(κ)∗. Let us show that our inductive assumption implies that Πβ+2m1(κ)⊆Rm−1(Πβ+21(κ)). From our inductive assumption, it follows that
[TABLE]
Thus C∈Πβ+2m1(κ)∗⊆Rm−1(Πβ+21(κ))∗. Since X∈I+, X is not the union of a set in R0(Rm−1(Πβ1(κ))) and a set in Rm−1(Πβ+21(κ)), and since X=(X∩C)∪(X∖C), it follows that X∩C∈/R0(Rm−1(Πβ1(κ))). Thus, by definition of R0(Rm−1(Πβ1(κ))), there is a ξ∈X∩C with ξ>β and an H⊆X∩C∩ξ in Rm−1(Πβ1(ξ))+ homogeneous for f. But, this contradicts ξ∈C.
Suppose X∈Rm(Πβ1(κ))+. By Remark 2.1, it suffices to show that X∈Rm−1(Πβ+21(κ))+ and X∈R0(Rm−1(Πβ1(κ))+. Since X∈Rm(Πβ1(κ))+, every regressive function f:[X]<ω→κ has a homogeneous set H∈Rm−1(Πβ1(κ))+. From our inductive assumption it follows that
[TABLE]
and thus, every regressive function f:[X]<ω→κ has a homogeneous set H∈Rm−2(Πβ+21(κ))+. In other words, X∈Rm−1(Πβ+21(κ))+. It remains to show that X∈R0(Rm−1(Πβ1(κ))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. Since Rm(Πβ1(κ)) is a normal ideal it follows that X∩C∈Rm(Πβ1(κ))+ and thus every (1,X∩C)-sequence has a homogeneous set in Rm−1(Πβ1(κ))+ (by Theorem 2.10). From our inductive assumption we see that every element of Rm−1(Πβ1(κ))+ is Πβ+2m−21-indescribable, and thus, by Lemma 2.20, X∩C is Πβ+2m1-indescribable. Since X∩C∈Rm(Πβ1(κ))+ there is a set H⊆X∩C in Rm−1(Πβ1(κ))+ which is homogeneous for f. By Lemma 5.1, the fact that H∈Rm−1(Πβ1(κ))+ can be expressed by a Πβ+2m−11 sentence φ over (Vκ,∈,H). Since X∩C is Πβ+2m1-indescribable we see that there is a ξ∈X∩C such that (Vξ,∈,H∩ξ)⊨φ, in other words, H∩ξ⊆X∩C∩ξ and H∩ξ∈Rm−1(Πβ1(ξ))+. Thus X∈R0(Rm−1(Πβ1(κ)))+.
∎
The next corollary generalizes a result of Feng [Fen90, Theorem 4.8] and indicates precisely the degree of indescribability that can be derived from a given finite degree of Ramseyness.
Corollary 6.2**.**
For all 0<m<ω and all β∈{−1}∪κ, if κ∈Rm(Πβ1(κ))+ then
[TABLE]
Proof.
Fix β∈{−1}∪κ. If m=1 the result follows directly from Theorem 6.1. Now suppose 1≤m<ω and the result holds for m, let us show that it holds for m+1. By Theorem 6.1, we have
[TABLE]
By our inductive assumption we see that
[TABLE]
From Theorem 6.1 it follows that R0(Rm−1(Πβ+21(κ)))⊆R0(Rm(Πβ1(κ))) and hence
[TABLE]
Thus the result holds for m+1.
∎
As in Baumgartner’s characterization of ineffability [Bau75, Section 7] in terms of the subtle ideal and the Π21-indescribability ideal, and as in Baumgartner’s characterization of Ramseyness [Bau77, Theorem 4.4 and Theorem 4.5] in terms of the pre-Ramsey and Π11-indescribability ideals, the next corollary demonstrates that large cardinal ideals are, in a sense, necessary for certain results.
Corollary 6.3**.**
For all 0<m<ω and all β∈{−1}∪κ we have κ∈Rm(Πβ1(κ))+ if and only if both of the following properties hold.
(1)
κ∈R0(Rm−1(Πβ1(κ)))+* and κ∈Πβ+2m1(κ)+.*
2. (2)
The ideal generated by R0(Rm−1(Πβ1(κ)))∪Πβ+2m1(κ) is nontrivial and equals Rm(Πβ1(κ)).
Moreover, reference to the ideals in the above characterization cannot be removed because the least cardinal κ such that κ∈R0(Rm−1(Πβ1(κ)))+ and κ∈Πβ+2m1(κ)+ is not in Rm(Πβ1(κ))+.
Proof.
The characterization of κ∈Rm(Πβ1(κ))+ follows directly from Corollary 6.2. For the additional statement, let us show that if κ∈Rm(Πβ1(κ))+ then there are many cardinals ξ<κ such that ξ∈R0(Rm−1(Πβ1(ξ)))+ and ξ∈Πβ+2m1(ξ)+. Suppose κ∈Rm(Πβ1(κ))+. Since
[TABLE]
it follows that κ∈R0(Rm−1(Πβ1(κ)))+ and κ∈Πβ+2m1(κ)+. Now κ∈R0(Rm−1(Πβ1(κ)))+ is Π11-expressible over Vκ and thus the set
[TABLE]
is in Π11(κ)∗⊆Πβ+2m1(κ)∗⊆Rm(Πβ1(κ))∗.
Furthermore, by Corollary 4.3, we see that the set
[TABLE]
is in R1([κ]<κ)∗⊆Rm(Πβ1(κ))∗. Therefore, C0∩C1∈Rm(Πβ1(κ))∗.
∎
In fact, essentially the same proof shows that the additional statement in Corollary 6.3 can be improved.
Corollary 6.4**.**
Suppose 0<m<ω and β∈{−1}∪κ. If κ∈Rm(Πβ1(κ))+ then the set
[TABLE]
is in Rm(Πβ1(κ))∗.
The following two corollaries of Theorem 6.1 show that the assumption “∃κ(κ∈Rm(Πβ+11(κ))+)” is strictly stronger than “∃κ(κ∈Rm(Πβ1(κ))+)”. In other words, each row of Figure 1 yields a strict hierarchy of large cardinals assuming the ideals are nontrivial.
Corollary 6.5**.**
Suppose 0<m<ω, β∈{−1}∪κ and κ∈Rm(Πβ1(κ))+. If S∈Rm^(Πβ^1(κ))+ where β^+2m^+1≤β+2m then the set
[TABLE]
is in Rm(Πβ1(κ))∗.
Proof.
By Lemma 5.1, the fact that S∈Rm^(Πβ^1(κ))+ is expressible by a Πβ^+2m^+11 sentence φ over (Vκ,∈,S). Since β^+2m^+1≤β+2m we have Πβ^+2m^+11(κ)⊆Πβ+2m1(κ), and by Corollary 6.2, since κ∈Rm(Πβ1(κ))+ we have Πβ+2m1(κ)⊆Rm(Πβ1(κ)), and thus the set
[TABLE]
is in Πβ^+2m^+11(κ)∗⊆Rm(Πβ1(κ))∗.
∎
Corollary 6.6**.**
For all 0<m<ω and all β∈{−1}∪κ, if κ∈Rm(Πβ+11(κ))+ then the set
[TABLE]
is in Rm(Πβ+11(κ))∗.
Now let us show that the containments of the ideals from Theorem 6.1 as illustrated in Figure 1 are proper when the ideals involved are nontrivial.
Theorem 6.7**.**
Suppose 0<m<ω and β<κ.
(1)
If κ∈Rm(Πβ+11(κ))+ then Rm(Πβ1(κ))⊊Rm(Πβ+11(κ)).
2. (2)
If κ∈Rm(Πβ1(κ))+ then Rm−1(Πβ+21(κ))⊊Rm(Πβ1(κ)).
Proof.
The containments follow from Theorem 6.1, so we only need to show the properness of the containments.
For (1), let S={ξ<κ∣ξ∈Rm(Πβ1(ξ))}. Then S∈Rm(Πβ1(κ))+ by Lemma 3.2. Furthermore, by Corollary 6.6, S∈Rm(Πβ+11(κ)). Thus Rm(Πβ1(κ))⊊Rm(Πβ+11(κ)).
For (2), let S={ξ<κ∣ξ∈Rm−1(Πβ+21(ξ))}. By Lemma 3.2 we see that S∈Rm−1(Πβ+21(κ))+. From Corollary 4.3, it follows that κ∖S∈Rm([κ]<κ)∗ and since Rm([κ]<κ)⊆Rm(Πβ1(κ)), this implies S∈Rm(Πβ1(κ)).
∎
The next corollary, which follows directly from Theorem 6.1, shows that iterating the Ramsey operator on an indescribability ideal Πβ+n1(κ) infinitely many times leads to the same ideal, no matter what n<ω was initially chosen (see Figure 2).
Corollary 6.8**.**
The following hold.
(1)
If κ∈Rω([κ]<κ)+, then for all n<ω we have
[TABLE]
2. (2)
For all limit ordinals β<κ, if κ∈Rω(Πβ1(κ))+, then for all n<ω we have
[TABLE]
Note that, although Corollary 6.8 is an easy consequence of Theorem 6.1, its proof is substantially different from that of the observation Rω([κ]<κ)=Rω(NSκ) made above in Remark 1.1, because the ideals involved do not fit into a chain.
Remark 6.9**.**
Let us point out an easy consequence of Corollary 6.8 which will serve as motivation for some of the results in Section 7 (see Remark 7.3). The previous corollary easily implies that when ω≤α<κ and β<κ, the assertion κ∈Rα(Πβ1(κ))+ is equivalent to κ∈Rα(Πβ+n1(κ))+ for all n<ω. In other words, for ω≤α<κ, κ being α-Πβ1-Ramsey is equivalent to κ being α-Πβ+n1-Ramsey for all n<ω.
7. Indescribability in infinite degrees of Ramseyness
We now proceed to extend some of the results of Section 6 to the ideals Rα(Πβ1(κ)) for α>ω.
Lemma 7.1**.**
For all ordinals α,β<κ the following hold.
(1)
If α is a successor ordinal then Πβ+α1(κ)⊆Rα(Πβ1(κ)).
2. (2)
If α is a limit ordinal or if α=0 then ⋃ξ<β+αΠξ1(κ)⊆Rα(Πβ1(κ)).
Proof.
Fix an ordinal β<κ. We proceed by induction on α. Clearly the result holds for α=0, since ⋃ξ<βΠξ1(κ)⊆Πβ1(κ). The case in which α is a limit is trivial.
For the successor step of the induction, let us argue that Rα+1(Πβ1(κ))+⊆Πβ+α+11(κ)+, assuming the result holds for α. Suppose X∈Rα+1(Πβ1(κ))+. Then every regressive function f:[X]<ω→κ has a homogeneous set H∈Rα(Πβ1(κ))+. By our inductive hypothesis, Rα(Πβ1(κ))+⊆⋂ξ<β+αΠξ1(κ)+. Thus, by Lemma 2.20, it follows that X∈Πβ+α+11(κ)+.
∎
Among other things, the next theorem shows that Lemma 7.1 (1) can be improved when α is a successor ordinal which is not an immediate successor of a limit ordinal.
Theorem 7.2**.**
Suppose κ is a cardinal, α<κ is a limit ordinal and β∈{−1}∪κ. For all m<ω, if κ∈Rα+m+1(Πβ1(κ))+ then
[TABLE]
Proof.
For the base case, let m=0. Let I=R0(Rα(Πβ1(κ)))∪Πβ+α+11(κ). We will show that X∈Rα+1(Πβ1(κ))+ if and only if X∈I+.
Suppose X∈Rα+1(Πβ1(κ))+. By Remark 2.1, it suffices to show that X∈Πβ+α+11(κ)+ and X∈R0(Rα(Πβ1(κ)))+. By Lemma 7.1, we have X∈Πβ+α+11(κ)+. Let us show that X∈R0(Rα(Πβ1(κ)))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. By assumption there is a set H∈Rα(Πβ1(κ))+ homogeneous for f. By Lemma 5.1, the fact that H∈Rα(Πβ1(κ))+ can be expressed by a Πβ+α1 sentence φ over (Vκ,∈,H), and since X∩C∈Πβ+α+11(κ)+, there is a ξ∈X∩C with ξ>α,β such that (Vξ,∈,H∩ξ)⊨φ, and hence H∩ξ∈Rα(Πβ1(ξ))+. Thus, X∈R0(Rα(Πβ1(κ)))+.
Now suppose X∈I+. We argue that X∈Rα+1(Πβ1(κ))+. Let f:[X]<ω→κ be a regressive function. Suppose that every homogeneous set H for f is in Rα(Πβ1(κ)). By Lemma 5.1, this can be expressed by a Πβ+α+11 sentence φ over (Vκ,∈,f). This implies that the set C={ξ<κ∣(Vξ,∈,f∩Vξ)⊨φ} is in Πβ+α+11(κ)∗. Since X∈I+, it follows that X is not the union of a set in R0(Rα(Πβ1(κ))) and a set in Πβ+α+11. Since X=(X∩C)∪(X∖C) and X∖C∈Πβ+α+11(κ), we see that X∩C∈R0(Rα(Πβ1(κ)))+. Hence there is a ξ∈X∩C with ξ>α,β for which there is a set H⊆X∩C∩ξ in Rα(Πβ1(ξ))+ homogeneous for f. This contradicts ξ∈C.
For the inductive step, we suppose
[TABLE]
and show
[TABLE]
Let I=R0(Rα+m(Πβ1(κ)))∪Πβ+α+2m+11(κ).
Suppose X∈Rα+m+1(Πβ1(κ))+. By Remark 2.1, it suffices to show that X∈Πβ+α+2m+11(κ)+ and X∈R0(Rα+m(Πβ1(κ)))+. By our inductive hypothesis Q:=Rα+m(Πβ1(κ))+⊆Πβ+α+2m−11(κ)+, and thus by Lemma 2.20 we have X∈Πβ+α+2m+11(κ)+. Let us show that X∈R0(Rα+m(Πβ1(κ)))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. Since X∈Rα+m+1(Πβ1(κ))+ there is a set H∈Rα+m(Πβ1(κ))+ homogeneous for f. By Lemma 5.1, the fact that H∈Rα+m(Πβ1(κ))+ can be expressed by a Πβ+α+2m1 sentence φ over (Vκ,∈,H). Since X∩C∈Πβ+α+2m+11(κ)+, there is a ξ∈X∩C with ξ>α+m,β, for which H∩ξ∈Rα+m(Πβ1(ξ))+. Thus X∈R0(Rα+m(Πβ1(κ)))+.
Conversely, suppose X∈I+. Let f:[X]<ω→κ be a regressive function. Suppose that every set which is homogeneous for f is in Rα+m(Πβ1(κ)). By Lemma 5.1, this can be expressed by a Πβ+α+2m+11 sentence φ over (Vκ,∈,f). Thus the set C={ξ<κ∣(Vξ,∈,f∩Vξ)⊨φ} is in Πβ+α+2m+11(κ)∗. Since X∈I+, it follows that X is not the union of a set in R0(Rα+m(Πβ1(κ))) and a set in Πβ+α+2m+11(κ), and since X∖C∈Πβ+α+2m+11(κ), we see that X∩C∈R0(Rα+m(Πβ1(κ)))+. Hence there is a ξ∈X∩C with ξ>α+m,β such that there is a set H⊆X∩C∩ξ in Rα+m(Πβ1(ξ))+ homogeneous for f. This contradicts ξ∈C.
∎
Remark 7.3**.**
We would like to use Theorem 7.2 to prove an analogue of Corollary 6.6, which would say that the strength of the hypothesis “∃κκ∈Rα(Πβ1(κ))” increases as β increases. However, there is an added complication, as illustrated in Corollary 6.8 and Remark 6.9, which is that even if β0<β1<κ, it may be that κ∈Rα(Πβ01(κ)) is equivalent to κ∈Rα(Πβ11(κ)), if α is large enough. Thus, in order to show that the hypotheses κ∈Rα(Πβ1(κ)) form a hierarchy as β increases, we will need to determine at what α do the hypotheses κ∈Rα(Πβ01(κ)) and κ∈Rα(Πβ11(κ)) become equivalent.
Remark 7.4**.**
Using Theorem 7.2, it is possible to formulate a characterization of κ∈Rα+m+1(Πβ1(κ))+ in terms of the relevant ideals along the lines of Corollary 6.3 above. Moreover, one can show that reference to the ideals in such a characterization is, in fact, necessary. We leave the details to the reader.
Let us prove Theorem 1.2 mentioned in Section 1. That is, we will show that for any two ordinals β0<β1<κ, the two increasing chains of ideals ⟨Rα(Πβ01(κ))∣α<κ⟩ and ⟨Rα(Πβ11(κ))∣α<κ⟩ are eventually equal, and we determine the precise index at which the equality begins (see Figure 3 for an illustration of this result).
Theorem 1.2**.**
Suppose β0<β1 are in {−1}∪κ and let σ=ot(β1∖β0). Define α=σ⋅ω. Suppose κ∈Rα(Πβ11(κ))+ so that the ideals under consideration are nontrivial. Then α is the least ordinal such that Rα(Πβ01(κ))=Rα(Πβ11(κ)).
Proof.
First, let us show Rα(Πβ01(κ))=Rα(Πβ11(κ)). Since β0<β1, it is clear that Rα(Πβ01(κ))⊆Rα(Πβ11(κ)). Let us show that Rα(Πβ01(κ))⊇Rα(Πβ11(κ)). If σ=ot(β1∖β0)=n is finite then α=ω and the result follows from Corollary 6.8 since Rω(Πβ01(κ))=Rω(Πβ0+n1(κ)). Suppose σ=ot(β1∖β0)≥ω. Then α=σ⋅ω is a limit of limits. Let us show that Rξ(Πβ11(κ))⊆Rα(Πβ01(κ)) for each limit ξ<α. Fix a limit ordinal ξ<α. For ordinals ζ<α we define i(ζ) to be the least i<ω such that ζ<σ⋅i. Notice that if we let γ be the greatest limit ordinal which is less than or equal to σ then β1=β0+σ≤β0+γ+2m+1<β0+σ⋅2 for some odd natural number 2m+1<ω. Now, by Theorem 7.2, we have
[TABLE]
Applying the Ramsey operator ξ times to (1) yields
[TABLE]
Since i(γ)+i(ξ)<ω it follows that γ+m+1+ξ=γ+ξ<σ⋅i(γ)+σ⋅i(ξ) must be less than α. Thus Rξ(Πβ11(κ))⊆Rα(Πβ01(κ)).
Next, let us show that if α^<α then Rα^(Πβ01(κ))⊊Rα^(Πβ11(κ)). If σ=ot(β1∖β0) is finite, in which case α=ω, then the result follows from Theorem 6.7. On the other hand, if σ is infinite, then α=σ⋅ω>ω and α is a limit of limits. Let αˉ be a limit ordinal with α^<αˉ+1<α. It suffices to show that Rαˉ+1(Πβ01(κ))⊊Rαˉ+1(Πβ11(κ)). Let
[TABLE]
Since κ∈Rα(Πβ11(κ))+, it follows from Lemma 3.2 that S∈/Rαˉ+1(Πβ01(κ)). Furthermore, by Lemma 5.1, the fact that S∈/Rαˉ+1(Πβ01(κ)) is Πβ0+αˉ+21-expressible over Vκ and so the set C=κ∖S is in Πβ0+αˉ+21(κ)∗.
By Theorem 7.2, Πβ0+σ+αˉ+11(κ)⊆Rαˉ+1(Πβ11(κ)). Since αˉ<α=σ⋅ω, it follows that β0+αˉ+2<β0+σ+αˉ+1 and thus Πβ0+αˉ+21(κ)⊆Rαˉ+1(Πβ11(κ)). This implies that C∈Rαˉ+1(Πβ11(κ))∗ and thus S∈Rαˉ+1(Πβ11(κ)).
∎
Corollary 7.5**.**
If κ∈Rκ([κ]<κ)+ then for all β0,β1<κ, assuming the ideals involved are nontrivial, we have
[TABLE]
As a direct corollary of Theorem 1.2 we derive the following, which is the analogue of Theorem 6.7 (1) for the ideals Rα(Πβ1(κ)) when α>ω.161616Below we will derive the analogue of Theorem 6.7 (2) for α>ω as a consequence of Theorem 7.8.
Corollary 7.6**.**
Suppose β0<β1 are in {−1}∪κ. If α<ot(β1∖β0)⋅ω and κ∈Rα(Πβ11(κ))+, then Rα(Πβ01(κ))⊊Rα(Πβ11(κ)).
Next, we show that for ω≤α<κ and β0<β1<κ, the hypothesis κ∈Rα(Πβ11(κ))+ implies that there are many ξ<κ which satisfy ξ∈Rα(Πβ01(ξ))+, assuming β0 and β1 are far enough apart. Thus, the hypotheses of the form κ∈/Rα(Πβ1(κ)) provide a strictly increasing refinement of Feng’s original hierarchy (see Figure 4).
Theorem 7.7**.**
Suppose β0<β1 are in {−1}∪κ and α<ot(β1∖β0)⋅ω. If κ∈Rα(Πβ11(κ))+ then the set
[TABLE]
is in Rα(Πβ11(κ))∗.
Proof.
Suppose α is a successor. That is, α=αˉ+m+1 where αˉ is a limit ordinal and m<ω. Since κ∈Rα(Πβ11(κ))+ and β0<β1 we have κ∈Rα(Πβ01(κ))+, which is expressible by a Πβ0+αˉ+2(m+1)1 sentence φ by Lemma 5.1. Since α=αˉ+m+1<ot(β1∖β0)⋅ω it follows that β0+αˉ+2(m+1)<β1+αˉ+2m+1.171717This is because ot(β1∖β0)⋅ω is a limit ordinal, and thus adding any finite number of copies of ot(β1∖β0) to β0+αˉ+2(m+1) will produce an ordinal which is less than β1. Now by Theorem 7.2, we see that Πβ1+αˉ+2m+11(κ)⊆Rα(Πβ11(κ)), and thus, the set
[TABLE]
is in Rα(Πβ11(κ))∗.
The fact that the result holds for successors easily implies that it holds for limits.
∎
Next we use Theorem 7.2 to show that, if substantial care is taken, Theorem 6.1 can, in a sense, be extended to the ideals Rα(Πβ1(κ)) for α>ω.
Theorem 7.8**.**
Suppose κ is a cardinal, ω<α<κ is a successor ordinal and β<κ is an ordinal such that κ∈Rα(Πβ1(κ))+. Let δ be the greatest ordinal such that ωδ≤α, let m,n<ω and γ<ωδ be the unique ordinals such that α=ωδm+γ+n+1 where γ is a limit ordinal.
(1)
If m=1 and γ=0 then
[TABLE]
2. (2)
Otherwise, if m>1 or γ>0, then
[TABLE]
Proof.
We proceed by induction on α. The base case is α=ω+1. In this case m=1, γ=0 and n=0, so it suffices to show that
We show that the result holds for α assuming it holds for all smaller successor ordinals. Suppose α=ωδm+γ+n+1 as in the statement of the theorem.
Let us show that (1) holds. Assume m=1 and γ=0. If n=0 then the result follows directly from Theorem 7.2. Suppose n≥1. Let
[TABLE]
To prove that (1) holds we will show that X∈Rωδ+n+1(Πβ1(κ))+ if and only if X∈I+.
Suppose X∈Rωδ+n+1(Πβ1(κ))+. By Remark 2.1, it will suffice to show that X∈R0(Rωδ+n(Πβ1(κ)))+ and X∈Rn(Πβ+ωδ+11(κ))+. By assumption, every regressive function f:[X]<ω→κ has a homogeneous set in Rωδ+n(Πβ1(κ))+. By our inductive hypothesis we have
[TABLE]
Thus every regressive function f:[X]<ω→κ has a homogeneous set in Rn−1(Πβ+ωδ+11(κ))+, in other words, X∈Rn(Πβ+ωδ+11(κ))+. Now let us show that X∈R0(Rωδ+n(Πβ1(κ))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. Since X∈Rωδ+n+1(Πβ1(κ))+, there is a set H∈Rωδ+n(Πβ1(κ))+ homogeneous for f. The fact that H∈Rωδ+n(Πβ1(κ))+ is expressible over (Vκ,∈,H) by a Πβ+ωδ+2n1 sentence φ. Since X∩C∈Rωδ+n+1(Πβ1(κ))+ and, by Theorem 7.2, Rωδ+n+1(Πβ1(κ))+⊆Πβ+ωδ+2n+11(κ)+, it follows that there is a ξ∈X∩C such that H∩ξ∈Rωδ+n(Πβ1(ξ))+. Hence X∈R0(Rωδ+n(Πβ1(κ)))+.
Conversely, suppose X∈I+. Let f:[X]<ω→κ be a regressive function. For the sake of contradiction, let us assume that every homogeneous set for f is in Rωδ+n(Πβ1(κ)). By Lemma 5.1, this is expressible over (Vκ,∈,X,f) by a Πβ+ωδ+2n+11 sentence φ. Hence the set
[TABLE]
is in Πβ+ωδ+2n+11(κ)∗. By Corollary 6.2, we have Πβ+ωδ+2n+11(κ)∗⊆Rn(Πβ+ωδ+11(κ))∗, and so C∈Rn(Πβ+ωδ+11(κ))∗. Since X∈I+ it follows that X is not the union of a set in R0(Rωδ+n(Πβ1(κ)) and a set in Rn(Πβ+ωδ+11(κ)). Furthermore, since X=(X∩C)∪(X∖C) and X∖C∈Rn(Πβ+ωδ+11(κ)), it follows that X∩C∈R0(Rωδ+n(Πβ1(κ))+. This implies that there is a ξ∈X∩C for which there is a set H⊆X∩C∩ξ in Rωδ+n(Πβ1(ξ))+ homogeneous for f. This contradicts the fact that ξ∈C. This establishes that (1) holds.
To show that (2) holds, suppose m>1 or γ>0. Let
[TABLE]
We will prove that X∈Rωδm+γ+n+1(Πβ1(κ))+ if and only if X∈I+.
Suppose X∈Rωδm+γ+n+1(Πβ1(κ))+. This implies that every regressive function f:[X]<ω→κ has a homogeneous set in Rωδm+γ+n(Πβ1(κ))+. We will show that
[TABLE]
If n≥1 then by applying our inductive hypothesis to the successor ordinal α′=ωδm+γ+n<α, we obtain
[TABLE]
and thus (∗ ‣ 7) holds. If n=0, to prove (∗ ‣ 7) we must show that
[TABLE]
Choose Z∈Rωδ(m−1)+γ(Πβ1(κ)). Then there is a successor ordinal η+k+1<γ, where η is a limit ordinal and k<ω, such that Z∈Rωδ(m−1)+η+k+1(Πβ+ωδ1(κ)). By our inductive hypothesis applied to the successor ordinal α′=ωδm+η+k+1<α, we have
[TABLE]
and thus Z∈Rωδ(m−1)+η+k+1(Πβ1(κ))⊆Rωδm+γ(Πβ1(κ)). This establishes (∗ ‣ 7), which implies that every regressive function f:[X]<ω→κ has a homogeneous set in Rωδ(m−1)+γ+n(Πβ+ωδ1(κ))+, and hence X∈Rωδ(m−1)+γ+n+1(Πβ1(κ))+.
Next, let us show that X∈R0(Rωδm+γ+n(Πβ1(κ)))+. Fix a regressive function f:[X]<ω→κ and a club C⊆κ. Since X∈Rωδm+γ+n+1(Πβ1(κ))+, there is a set H∈Rωδm+γ+n(Πβ1(κ))+ homogeneous for f. By Lemma 5.1, the fact that H∈Rωδm+γ+n(Πβ1(κ))+ can be expressed over (Vκ,∈,X,f,H) by a Πβ+ωδm+γ+2n+11 sentence φ. Since X∩C∈Rωδm+γ+n+1(Πβ1(κ))+ and, by Theorem 7.2,
[TABLE]
it follows that there is a ξ∈X∩C such that H∩ξ∈Rωδm+γ+n(Πβ1(ξ))+. This implies that X∈R0(Rωδm+γ+n(Πβ1(κ)))+. By Remark 2.1, this suffices to show that X∈I+.
Conversely, suppose X∈I+. Fix a regressive function f:[X]<ω→κ. For the sake of contradiction, suppose every homogeneous set for f is in Rωδm+γ+n(Πβ1(κ)). This can be expressed over (Vκ,∈,X,f) by a Πβ+ωδm+γ+2n+11 sentence φ. Hence, the set
[TABLE]
is in Πβ+ωδm+γ+2n+11(κ)∗. Since, by Theorem 7.2, it follows that Πβ+ωδm+γ+2n+11(κ)⊆Rωδ(m−1)+γ+n+1(Πβ+ωδ1(κ)), it follows that C∈Rωδ(m−1)+γ+n+1(Πβ+ωδ1(κ))∗. Since X=(X∩C)∪(X∖C) is not the union of a set in R0(Rωδm+γ+n(Πβ1(κ))) and a set in Rωδ(m−1)+γ+n+1(Πβ+ωδ1(κ)), it follows that X∩C∈R0(Rωδm+γ+n(Πβ1(κ)))+. This implies that there is a ξ∈X∩C for which there is a set H⊆X∩C∩ξ in Rωδm+γ+n(Πβ1(ξ))+ homogeneous for f. This contradicts ξ∈C. This establishes (2).
∎
An argument similar to that of Theorem 6.7 can be used to show that the ideal containments suggested by the statement of Theorem 7.8 are proper.
Theorem 7.9**.**
Under the hypotheses of Theorem 7.8, the following hold.
(1)
If m=1 and γ=0 then
[TABLE]
2. (2)
If m>0 or γ>0 then
[TABLE]
Proof.
Since the containment follow easily from Theorem 7.8, it remains to show the properness of the containments.
For (1), let S={ξ<κ∣ξ∈Rn(Πβ+ωδ+11(κ))}. By Lemma 3.2, S∈Rn(Πβ+ωδ+11(κ))+. By Corollary 4.3, it follows that κ∖S∈Rn+1([κ]<κ)∗⊆Rωδ+n+1([κ]<κ)∗⊆Rωδ+n+1(Πβ1(κ))∗. Thus S∈Rωδ+n+1(Πβ1(κ))∖Rn(Πβ+ωδ+11(κ)).
The argument for (2) is similar.
∎
8. Generic embeddings
By considering properties of generic ultrapowers obtained by forcing with large cardinal ideals, we obtain characterizations of such ideals in terms of generic elementary embeddings. In what follows we obtain generic embedding characterizations of Πβ1-indescribable as well as Ramsey subsets of cardinals. It should not be hard to find small embedding [HLN19] characterizations of Πβ1-indescribable sets which resemble our generic embeddings. However, it is not clear whether the characterization of Ramsey sets in Theorem 8.4 below can be rephrased in terms of small embeddings. Thus, the following question of [HLN19] remains open: can one characterize Ramsey cardinals using small embeddings?
Before providing a motivating example, let us recall a few basic facts about generic ultrapowers. If κ is a regular uncountable cardinal and I is an ideal on κ and S∈I+ then I↾S={X⊆κ∣X∩S∈I} is an ideal on κ extending I and notice that S∈(I↾S)∗. We write P(κ)/I to denote the usual atomless181818We write P(κ)/I when we really mean P(κ)/I−{[∅]}. boolean algebra obtained from I. If G is (V,P(κ)/I)-generic then we let UG be the canonical V-ultrafilter obtained from G extending the dual filter I∗. The appropriate version of Łos’s Theorem can be easily verified, and thus we obtain a canonical generic elementary embedding j:V→Vκ/UG in V[G] where j(x)=[α↦x]U. If I is a normal ideal then the generic ultrafilter UG is V-normal and the critical point of the corresponding, possibly illfounded, generic ultrapower j:V→Vκ/UG⊆V[G] is κ. When I is a normal ideal, the corresponding generic ultrapower embedding j is wellfounded on the ordinals up to κ+. See [Jec03, Lemma 22.14] or [For10, Section 2] for more details.
Definition 8.1**.**
When we say there is a generic elementary embedding j:V→M⊆V[G] we mean that there is some forcing poset P such that whenever G is (V,P)-generic then, in V[G], there are definable classes M, E and j such that j:(V,∈)→(M,E)⊆V[G] is an elementary embedding, where (M,E) is possibly not wellfounded.
The following proposition is an easy application of generic ultrapowers obtained by forcing with P(κ)/NSκ.
Proposition 8.2** (Folklore).**
Suppose κ>ω is a regular cardinal. The following are equivalent.
(1)
S⊆κ* is stationary.*
2. (2)
There is a generic elementary embedding j:V→M⊆V[G] with critical point κ such that κ∈j(S).
It is natural to wonder: to what extent can Proposition 8.2 be generalized from the nonstationary ideal to other natural ideals, such as ideals associated to certain large cardinals?
Proposition 8.3**.**
Suppose κ is a cardinal, β<κ is an ordinal and S⊆κ. The following are equivalent.
(1)
S* is Πβ1-indescribable.*
2. (2)
There is a generic elementary embedding j:V→M⊆V[G] with critical point κ such that κ∈j(S) and for all A∈Vκ+1V and all Πβ1 sentences φ we have
[TABLE]
Proof.
Suppose S is Πβ1-indescribable. Let G⊆P(κ)/(Πβ1(κ)↾S) be generic over V and let j:V→M:=Vκ/G be the corresponding generic ultrapower embedding. Since S∈G we have κ∈j(S). Fix A∈Vκ+1V and fix a Πβ1 sentence φ such that ((Vκ,∈,A)⊨φ)V. Since the set
[TABLE]
is in the filter Πβ1(κ)∗, it follows that S∩C∈(Πβ1(κ)↾S)∗⊆G, and thus κ∈j(C). This implies ((Vκ,∈,A)⊨φ)M.
Conversely, suppose j:V→M is a generic elementary embedding satisfying (2). Let us show that S is Πβ1-indescribable. Fix an A∈Vκ+1V and a Πβ1 sentence φ such that ((Vκ,∈,A)⊨φ)V. By elementarity and by (2), there is some ξ∈S such that ((Vξ,∈,A∩Vξ)⊨φ)V, thus S is Πβ1-indescribable.
∎
Let us show that the ideals Rm(Πβ1(κ)) can be characterized in terms of generic elementary embeddings. Taking m=1 and β=−1 in the following theorem yields a characterization of the Ramsey ideal and of Ramsey cardinals.
Theorem 8.4**.**
Suppose κ is a cardinal, 1≤m<ω, β∈{−1}∪κ and S⊆κ. The following are equivalent.
(1)
S∈Rm(Πβ1(κ))+**
2. (2)
There is a generic elementary embedding j:V→M with critical point κ such that κ∈j(S) and the following properties hold.
(a)
For all A∈Vκ+1V and all Πβ+2m1 sentences φ we have
[TABLE]
2. (b)
For all regressive functions f:[S]<ω→κ in V we have
[TABLE]
Proof.
Suppose S∈Rm(Πβ1(κ))+. Let G⊆P(κ)/(Rm(Πβ1(κ))↾S) be generic over V and let j:V→M:=Vκ/G be the corresponding generic ultrapower. Since S∈G we have κ∈j(S). By Corollary 6.2, we have
[TABLE]
Since Πβ+2m1(κ)∗⊆Rm(Πβ1(κ))∗⊆G it follows, by an argument similar to that in the proof of Proposition 8.3, that (a) holds. Fix a regressive function f:[S]<ω→κ in V. Since S∈Rm(Πβ1(κ))+ there is a set H∈P(S)∩Rm−1(Πβ1(κ))+∩V which is homogeneous for f. Clearly H=j(H)∩κ and f=j(f)∩(κ×κ) are in M, and M thinks that H is homogeneous for f. By Lemma 5.1 the fact that H∈Rm−1(Πβ1(κ))+ is expressible by a Πβ+2m1 sentence over Vκ, and thus by (a) we see that M⊨ “H∈Rm−1(Πβ1(κ))+”.
Conversely, suppose (2) holds. Fix a regressive function f:[S]<ω→κ in V. For the sake of contradiction suppose that in V, every subset of S which is homogeneous for f is in the ideal Rm−1(Πβ1(κ)). By Lemma 5.1, this can be expressed by a Πβ+2m1 sentence over Vκ, thus by (2)(a), M thinks that every homogeneous set for f is in the ideal Rm−1(Πβ1(κ)). This contradicts (2)(b).
∎
Using Lemma 5.1 and Theorem 7.2, an argument similar to that of Theorem 8.4 gives a generic embedding characterization of certain ideals of the form Rα(Πβ1(κ)) for α>ω.
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AHKZ 77] F. G. Abramson, L. A. Harrington, E. M. Kleinberg, and W. S. Zwicker. Flipping properties: a unifying thread in the theory of large cardinals. Ann. Math. Logic , 12(1):25–58, 1977.
2[Bag 19] Joan Bagaria. Derived topologies on ordinals and stationary reflection. Trans. Amer. Math. Soc. , 371(3):1981–2002, 2019.
3[Bau 75] J. E. Baumgartner. Ineffability properties of cardinals. I. pages 109–130. Colloq. Math. Soc. János Bolyai, Vol. 10, 1975.
4[Bau 77] James E. Baumgartner. Ineffability properties of cardinals. II. In Logic, foundations of mathematics and computability theory (Proc. Fifth Internat. Congr. Logic, Methodology and Philos. of Sci., Univ. Western Ontario, London, Ont., 1975), Part I , pages 87–106. Univ. Western Ontario Ser. Philos. Sci., Vol. 9. Reidel, Dordrecht, 1977.
5[Bri] Hazel Brickhill. Generalising the Notions of Closed Unbounded and Stationary Set . Thesis (Ph.D.)–University of Bristol.
6[BW] Hazel Brickhill and Philip D. Welch. Generalisations of stationarity, closed and unboundedness and of Jensen’s □ □ \Box . ( preprint ).
7[CG 15] Brent Cody and Victoria Gitman. Easton’s theorem for Ramsey and strongly Ramsey cardinals. Ann. Pure Appl. Logic , 166(9):934–952, 2015.
8[CGH] Erin Carmody, Victoria Gitman, and Miha Habič. A Mitchell-like order for Ramsey and Ramsey-like cardinals. ( to appear in Fundamenta Mathematicae ).