This paper demonstrates the consistency of certain dense ideals on power sets of successor cardinals, exploring their relationship with cardinal arithmetic and combinatorial principles, and addressing open questions in the field.
Contribution
It introduces new consistency results for dense ideals on $ ext{P}_ ext{kappa}( ext{lambda})$ derived from large cardinal assumptions, linking ideals with cardinal arithmetic and combinatorics.
Findings
01
Proves the consistency of normal, fine, $ ext{kappa}$-complete $ ext{lambda}$-dense ideals on $ ext{P}_ ext{kappa}( ext{lambda})$ for successor $ ext{kappa}$.
02
Explores the relationship between dense ideals, cardinal arithmetic, and square principles.
03
Answers open questions posed by Foreman regarding dense ideals and their properties.
Abstract
From large cardinals we show the consistency of normal, fine, κ-complete λ-dense ideals on Pκ(λ) for successor κ. We explore the interplay between dense ideals, cardinal arithmetic, and squares, answering some open questions of Foreman.
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 · Mathematical and Theoretical Analysis
Full text
Dense ideals and cardinal arithmetic
Monroe Eskew
Abstract.
From large cardinals we show the consistency of normal, fine, κ-complete λ-dense ideals on Pκ(λ) for successor κ. We explore the interplay between dense ideals, cardinal arithmetic, and squares, answering some open questions of Foreman.
Most large cardinals are characterizable in terms of elementary embeddings between models of set theory that have a certain amount of agreement with the full universe V. A typical large cardinal is the least ordinal moved by a nontrivial map j:V→M, where M is a transitive class, and the strength of the large cardinal assumption tends to increase as M gets closer to V. Such cardinals are inaccessible and much more. This phenomenon can however be realized at small cardinals when the embedding j:V→M is defined in a forcing extension V[G]. The nature of the forcing adds another dimension to these “generic large cardinals,” and their strength tends to increase as the three models V, M, and V[G] more closely resemble one another.
Here, we consider generic versions of supercompactness at successor cardinals that are optimal in the sense that the forcing poset needed to produce the elementary embedding is of the smallest possible size. We show that relative to a super-almost-huge cardinal, there can exist a successor cardinal κ such that for every regular λ≥κ, there is a normal, fine, κ-complete, λ-dense ideal on Pκ(λ). As far as the author knows, this is the first result exhibiting the consistency of even saturated normal and fine ideals on Pκ(λ) for a fixed successor κ and several values of λ simultaneously. The method used also has immediate application to show the non-absoluteness of some cardinal characteristics of the powerset of a fixed regular cardinal μ, even between models with the same cardinals and same μ-sequences.
Generic large cardinals can have strong influence over the combinatorial structure of the universe in their vicinity. We explore the interplay between dense ideals, cardinal arithmetic, nonregular ultrafilters, and stationary reflection. We answer two open questions posed by Foreman in [7] and provide a “global” counterexample to an old conjecture in model theory. We also show some limitations of dense ideals near singular cardinals, establishing the optimality some aspects of our consistency results. Finally we show that in contrast to traditional supercompactness, the strong forms of generic supercompactness considered here are compatible with Jensen’s principle □.
1. Preliminaries
1.1. Forcing
First we review some essential facts about forcing. We refer the reader to [10] and [13] for background and details.
A partial order P is said to be separative when p≰q⇒(∃r≤p)r⊥q. Every partial order P has a canonically associated equivalence relation ∼s and a separative quotient Ps, which is isomorphic to P if P is already separative. In most cases we will assume our partial orders are separative. For every separative partial order P, there is a canonical complete boolean algebra B(P) with a dense set isomorphic to P.
A map e:P→Q is an embedding when it preserves order and incompatibility. An embedding is said to be regular when it preserves the maximality of antichains. A order-preserving map π:Q→P is called a projection when π(1Q)=1P, and p≤π(q)⇒(∃q′≤q)π(q′)≤p.
Lemma 1.1**.**
Suppose P and Q are partial orders.
(1)
G* is a generic filter for P iff {[p]s:p∈G} is a generic filter for Ps.*
2. (2)
e:P→Q* is a regular embedding iff for all q∈Q, there is p∈P such that for all r≤p, e(r) is compatible with q.*
3. (3)
The following are equivalent:
(a)
There is a regular embedding e:Ps→B(Qs).
2. (b)
There is a projection π:Qs→B(Ps).
3. (c)
There is a Q-name g˙ for a P-generic filter such that for all p∈P, there is q∈Q such that q⊩p∈g˙.
4. (4)
Suppose e:P→Q is a regular embedding. If G is a filter on P let Q/G={q:¬∃p∈G(e(p)⊥q)}. The following are equivalent:
(a)
H* is Q-generic over V.*
2. (b)
G=e−1[H]* is P-generic over V, and H is Q/G-generic over V[G].*
Lemma 1.2**.**
Suppose P and Q are partial orders. B(Ps)≅B(Qs) iff the following holds. Letting G˙,H˙ be the canonical names for the generic filters for P,Q respectively, there is a P-name for a function f˙0 and a Q-name for a function f˙1 such that:
(1)
⊩Pf˙0(G˙)* is a Q-generic filter,*
2. (2)
⊩Qf˙1(H˙)* is a P-generic filter,*
3. (3)
⊩PG˙=f˙1f˙0(G˙)(f˙0(G˙)), and ⊩QH˙=f˙0f˙1(H˙)(f˙1(H˙)).
An isomorphism is given by p↦∣∣pˇ∈f˙1(H˙)∣∣B(Qs).
For a broader notion of “forcing equivalence,” the best that can be said in general is the following:
Lemma 1.3**.**
Suppose P and Q are partial orders.
(1)
If e:P→Q is a regular embedding, and any Q-generic H yields V[H]=V[e−1[H]], then there is a predense set A⊆B(Qs) such that B(Ps)≅B(Qs)↾a for all a∈A.
2. (2)
P* and Q yield the same generic extensions iff for a dense set of p∈P, there is q∈B(Qs) such that B(Ps)↾p≅B(Qs)↾q.*
A partial order P is said to be κ-distributive if for any collection of maximal antichains in P, {Aα:α<β<κ}, there is a maximal antichain A such that A refines Aα for all α<β. P is called (κ,λ)-distributive if the same holds restricted to antichains of size ≤λ. Forcing with P adds adds no new functions from any α<κ to λ iff B(P) is (κ,λ)-distributive.
A strictly stronger property than distributivity is strategic closure. For a partial order P and an ordinal α, we define a game Gα(P) with two players Even and Odd. Even starts by playing some element p0∈P. At successor stages β+1, the next player must play some element pβ+1≤pβ. Even plays at limit stages β if possible, by playing a pβ that is ≤pγ for all γ<β. If Even cannot play at some stage below α, the game is over and Odd wins; otherwise Even wins. We say that P is α-strategically closed if for every p∈P, Even has a winning strategy with first move p. Note that under this definition, every partial order is trivially ω-strategically closed.
A stronger property that κ-strategic closure is κ-closure. P is κ-closed when any descending chain of length less than κ has a lower bound. P is κ-directed closed when any directed set of size <κ has a lower bound.
For any partial order P, the saturation of P, sat(P), is the least cardinal κ such that every antichain in P has size less than κ. Erdős and Tarski [6] proved that sat(P) is always regular. The density of P, d(P), is the least cardinality of a dense subset of P. Clearly sat(P)≤d(P)+ for any P. We say P is κ-saturated if sat(P)≤κ, and P is κ-dense if d(P)≤κ. A synonym for κ-saturation is the κ-chain condition (κ-c.c.).
The properties of distributivity, strategic closure, saturation, and density are robust in the sense that they are absolute between P and B(P) for any separative partial order P, and often inherited by intermediate forcings:
Lemma 1.4**.**
Suppose e:P→Q is a regular embedding and κ is a cardinal.
(1)
If Q is κ-strategically closed, then so is P.
2. (2)
Q* is κ-distributive iff P is κ-distributive and ⊩PQ/G˙ is κ-distributive.*
3. (3)
Q* is κ-saturated iff P is κ-saturated and ⊩PQ/G˙ is κ-saturated.*
4. (4)
Q* is κ-dense iff P is κ-dense and ⊩PQ/G˙ is κ-dense.*
For any forcing P and any P-name X˙ for a set of ordinals, there is a canonically associated complete subalgebra AX˙⊆B(P) that captures X˙. It is the smallest complete subalgebra containing all elements of the form ∣∣αˇ∈X˙∣∣ for α an ordinal. AX˙ has the property that whenever G⊆P is generic, X˙G and G∩AX˙ are definable from each other using the parameters B(P) and its powerset, as computed in the ground model. In this case, we have V[X˙G]=V[G∩AX˙]. See [10, p. 247] for details.
1.2. Ideals
Let Z be any set. An idealI on Z is a collection of subsets of Z closed under taking subsets and pairwise unions. If κ is a cardinal, I is called κ-complete if it is also closed under unions of size less than κ. “Countably complete” is taken as synonymous with “ω1-complete.” I is called nonprincipal if {z}∈I for all z∈Z, and proper if Z∈/I. Hereafter we will assume all our ideals are nonprincipal and proper.
Let X=⋃Z. I is called fine if for all x∈X, {z:x∈/z}∈I. I is called normal if for any sequence ⟨Ax:x∈X⟩⊆I, the “diagonal union”{z:∃x(x∈z∈Ax)} is in I. It is well-known that I is normal iff for any A∈P(Z)∖I and any function f on A such that f(z)∈z for all z∈A, there is an x such that f−1(x)∈/I.
To fix notation, let I∗={Z∖A:A∈I} (the I-measure one sets), I+=P(Z)∖I (the I-positive sets), x^={z:x∈z}, and denote diagonal unions by ∇x∈XAx. Note that ∇x∈XAx=⋃x∈Xx^∩Ax.
The following basic fact seems to have been previously overlooked–see, for example, the hypotheses of several theorems in [7] and [8].
Proposition 1.5**.**
All normal and fine ideals are countably complete.
Proof.
Let I be a normal and fine ideal on Z⊆P(X). If {xα:α<κ} is an enumeration of distinct elements of X, and ⋂α<κx^α∈I∗, then I is κ+-complete. For suppose that {Aα:α<κ}⊆I, but A=⋃α<κAα∈I+. Then by hypothesis, A∩(⋂α<κx^α)∈I+. Let f:A→X be defined by f(z)=xα, where α is the least ordinal such that z∈Aα. By normality, there is some Aα∈I+, a contradiction. So it suffices to find an infinite set {xn:n<ω}⊆X such that ⋂n<ωx^n∈I∗. Since we assume I is proper and nonprincipal, X is infinite. We show that any infinite set of distinct elements of X suffices.
Let {xn:n<ω} be distinct elements of X, and suppose the contrary, that B={z:{xn:n<ω}⊈z}∈I+. By fineness, B∩x^0∈I+. For each z∈B∩x^0, let nz be the largest integer such that {x0,...,xnz}⊆z. Let f:B∩x^0→X be defined by f(z)=xnz. By normality, there is an n such that f−1(xn)∈I+. Then for all z∈f−1(xn), xn+1∈/z. This contradicts fineness.
∎
Proposition 1.6**.**
If I is a normal, fine, κ-complete ideal on Z⊆P(κ), then κ∈I∗.
Proof.
Suppose A={z∈Z:z is not an ordinal}∈I+. Let f:A→κ be such that f(z) is the least α∈z such that α⊈z. Then for some α, f−1(α)∈I+. However, {z:α⊆z}∈I∗ by fineness and κ-completeness.
∎
Proofs of the following facts can be found in [7]. If I is an ideal on Z, say A∼IB if the symmetric difference AΔB is in I. Let [A]I denote the equivalence class of A mod ∼I. The equivalence classes form a boolean algebra under the obvious operations, which we denote by P(Z)/I. Normality ensures a certain amount of completeness of the algebra:
Proposition 1.7**.**
Suppose I is a normal and fine ideal on Z⊆P(X). If {Ax:x∈X}⊆P(Z), then ∇Ax is the least upper bound of {[Ax]I:x∈X} in P(Z)/I.
If we force with this algebra, we get a generic ultrafilter G on Z extending I∗. We can form the ultrapower VZ/G. If this ultrapower is well-founded for every generic G, then I is called precipitous. A combinatorial characterization of precipitousness is given by the following:
Theorem 1.8** (Jech-Prikry).**
I* is a precipitous ideal on Z iff the following holds: For any sequence ⟨An:n<ω⟩⊆P(I+), such that for each n,*
(1)
Bn={[a]I:a∈An}* is a maximal antichain in P(Z)/I,*
2. (2)
Bn+1* refines Bn,*
there is a function f with domain ω such that for all n, f(n)∈An, and ⋂n<ωf(n)=∅.
For an ideal I, the saturation, density, distributivity, and strategic closure of I refers to that of the corresponding boolean algebra. The next proposition is immediate from Theorem 1.8:
Proposition 1.9**.**
If I is an ω1-complete, ω1-distributive ideal, then I is precipitous.
Proposition 1.10**.**
Suppose I is a κ-complete precipitous ideal on Z, and there is no A∈I+ such that I↾A is κ+-complete. Let G be P(Z)/I-generic, and let j:V→M be the associated elementary embedding, where M is the transitive collapse of VZ/G. Then the critical point of j is κ.
Proposition 1.11**.**
Let I be an ideal Z⊆P(X). Then I is normal and fine iff 1⊩P(Z)/I[id]G˙=j[X].
Proposition 1.12**.**
Suppose I is an ideal on Z⊆P(X). If I is κ-complete and κ+-saturated, or if I is normal, fine, and ∣X∣+-saturated, then every antichain in P(Z)/I has a system of pairwise disjoint representatives.
Proof.
If I is κ-complete, and {Aα:α<κ} is an antichain, replace each Aα with Aα∖⋃β<αAβ. If I is normal and fine, and {Ax:x∈X} is an antichain, replace Ax by Ax∩x^∖⋃y=xAy∩y^.
∎
Theorem 1.13**.**
Suppose I is a countably complete ideal on Z, and every antichain in P(Z)/I has a system of pairwise disjoint representatives. Then:
(1)
I* is precipitous.*
2. (2)
P(Z)/I* is a complete boolean algebra.*
3. (3)
If G is generic over P(Z)/I, j:V→M is the associated embedding, and j[λ]∈M, then M is closed under λ-sequences from V[G].
If κ=μ+ and I is a normal, fine, κ-complete ideal on Pκ(λ), then I is not λ-saturated. For otherwise, let j:V→M⊆V[G] be a generic embedding arising from I. Then M⊨∣[id]∣=μ, and [id]=j[λ], so λ has cardinality μ in V[G]. So the smallest possible density of such an ideal is λ.
Suppose M and N are models of ZF−, j:M→N is an elementary embedding, P∈M is a partial order, G is P-generic over M, and H is j(P)-generic over N. Then j has a unique extension j^:M[G]→N[H] with j^(G)=H iff j[G]⊆H.
Lemma 1.15**.**
Suppose M, N are transitive models of ZFC with the same ordinals, and j:M→N is an elementary embedding. Then either j has a critical point, or j is the identity and M=N.
2. Dense ideals from large cardinals
Here we show that it is consistent relative to an almost-huge cardinal that there is a normal, κ-complete, λ-dense ideal on Pκ(λ), where κ is the successor of a regular cardinal μ, and λ≥κ is regular, for many particular choices for μ,λ. We also show that relative to a super-almost-huge cardinal, there can exist a successor cardinal κ such that for every regular λ≥κ, there is a normal, κ-complete, λ-dense ideal on Pκ(λ). This generalizes a theorem of Woodin about the relative consistency of an ℵ1-dense ideal on ℵ1, and has the following additional advantages: (1) An explicit forcing extension is taken, rather than an inner model of an extension. (2) Careful constructions within a model where the axiom of choice fails, as presented in [7], are avoided.
Let us first recall the essential facts about almost-huge cardinals (see [11], 24.11). A cardinal κ is almost-huge if there is an elementary embedding j:V→M with critical point κ, such that M<j(κ)⊆M.
Theorem 2.1**.**
The following are equivalent:
(1)
κ* carries an almost-huge embedding j such that j(κ)=δ.*
2. (2)
δ* is inaccessible, and there is a sequence ⟨Uα:κ≤α<δ⟩ such that:*
(a)
each Uα is a normal, fine, κ-complete ultrafilter on Pκ(α),
2. (b)
for α<β, Uα={A⊆Pκ(α):{z∈Pκ(β):z∩α∈A}∈Uβ}, and
3. (c)
for all α<δ and all f:Pκ(α)→κ such that {z:f(z)≥ot(z)}∈Uα, there is β such that α≤β<δ and {z:f(z∩α)=ot(z)}∈Uβ.
Furthermore, if a system as in (2) is given, the direct limit model and embedding witness the almost-hugeness of κ with target δ.
A system as in (2) will be called an almost-huge tower. Almost-huge towers capture almost-hugeness in a minimal way:
Corollary 2.2**.**
If κ has an almost-huge tower of height δ, and j:V→M is the embedding derived from the tower, then we have δ<j(δ)<δ+, and j[δ] is cofinal in j(δ).
Proof.
For each α<δ, let Mα be the transitive collapse of VPκ(α)/Uα, and let jα:V→Mα and kα:Mα→M be the canonical embeddings, with j=kα∘jα. Since δ is inaccessible, jα(κ)<δ and jα(δ)=δ for each α<δ.
If γ<j(δ), then there are some α,β<δ such that kα(β)=γ. Thus there are only δ ordinals below j(δ). Also, there is η<δ such that jα(η)>β, so j(η)>γ, and thus j[δ] is cofinal in j(δ).
∎
A super-almost-huge cardinal is a cardinal κ such that for all λ≥κ, there is an almost huge tower of height ≥λ. The next result follows from considering the set of closure points under witnesses to property (c) in the tower characterization.
Corollary 2.3**.**
If κ has an almost-huge tower of Mahlo height δ, then for stationary many α<δ, Vα⊨ZFC+κ is super-almost-huge.
There is a vast gap in strength between almost-huge and huge:
Theorem 2.4**.**
If κ is a huge cardinal, then there is a stationary set S⊆κ such that for all α<β in S, α has an almost-huge tower of height β.
Proof.
Suppose j:V→M is an elementary embedding with critical point κ, j(κ)=δ, and Mδ⊆M. Then κ carries an almost-huge tower U of length δ, and U∈M. Let F be the ultrafilter on κ defined by F={X⊆κ:κ∈j(X)}. Let A={α<κ:α carries an almost-huge tower of height κ}. Since κ∈j(A), A∈F. Now let c:κ2→2 be defined by c(α,β)=1 if α carries an almost-huge tower of height β, and c(α,β)=0 otherwise. By Rowbottom’s theorem, let H∈F be homogeneous for c. We claim c takes constant value 1 on H. For if α∈A∩H, then {α,κ}∈[j(A∩H)]2, and j(c)(α,κ)=1.
∎
2.1. Layering and absorption
Definition**.**
We will call a partial order P(μ,κ)-nicely layered when there is a collection L of atomless regular suborders of P such that:
(1)
for all Q∈L, Q is μ-closed and has size <κ,
2. (2)
for all Q0,Q1∈L, if Q0⊆Q1, then ⊩Q0Q1/G˙ is μ-closed, and
3. (3)
for all P-names f˙ for a function from μ to the ordinals, and all Q0∈L, there is an Q1∈L and an Q1-name g˙ such that Q0⊆Q1, and ⊩Pf˙=g˙.
We will say P is (μ,κ)-nicely layered with collapses,(μ,κ)-NLC, when additionally for all α<κ and all Q0∈L, there is Q1∈L such that Q0⊆Q1 and ⊩Q1∣Q1∣=μ.
Proposition 2.5**.**
If L witnesses that P is (μ,κ)-nicely layered, then P is κ-c.c. and ⋃L is dense in P.
Proof.
Suppose that {pα:α<η}⊆P, η≥κ, is a maximal antichain. Let f˙ be a name of a function with domain {0} such that f(0)=α iff pα∈G. There cannot be a regular suborder Q of size <κ and a Q-name g˙ that is forced to be equal to f˙, since such a g˙ would have <κ possible values for its range.
Similarly, let p∈P be arbitrary, and let {pα:α<δ} be a maximal antichain with p=p0. Let f˙ be a name of a function with domain {0} such that f(0)=α iff pα∈G. If Q is a regular suborder and g˙ is a Q-name such that ⊩Pf˙=g˙, then there is some q∈Q forcing g˙(0)=0, so q≤p.
∎
Proposition 2.6**.**
If there exists a (μ,κ)-NLC poset, then α<μ<κ for all μ<κ.
Proof.
Let P be (μ,κ)-NLC with layering L, and let α<κ. If Q∈L collapses α to μ, then we can build a μ-closed tree T⊆Q of height μ such that each level is an antichain of size ≥α. α<μ≤∣T∣<κ.
∎
Lemma 2.7** (Folklore).**
If P is a μ-closed partial order such that ⊩P∣P∣=μ, then B(P)≅B(Col(μ,∣P∣)).
Proof.
Pick a P-name f˙ for a bijection from μ to G˙. We build a tree T⊆P that is isomorphic to a dense subset of Col(μ,∣P∣), and show that it is dense in P. Each level will be a maximal antichain in P. Let the first level T0={1P}. If levels {Tβ:β<α+1} are defined, below each p∈Tα, pick a ∣P∣-sized maximal antichain of conditions deciding f˙(α), and let Tα+1 be the union of these antichains. If {Tβ:β<λ} is defined up to a limit λ, pick for each descending chain b through the previous levels, a ∣P∣-sized maximal antichain of lower bounds to b, and set Tλ equal to the union of these anithchains. It is easy to check that Tλ is a maximal antichain. Let T=⋃α<μTα. To show T is dense, let p∈P. Let q≤p be such that for some α<μ, q⊩f˙(α)=p. q is compatible with some r∈Tα+1. Since r decides f˙(α) and forces it in G˙, r≤p.
∎
Lemma 2.8**.**
Suppose μ<κ are regular, and P is (μ,κ)-NLC. If G is P-generic over V, then there is a forcing R∈V[G] such that R adds a filter H⊆\breakCol(μ,<κ) which is generic over V and such that (Ordμ)V[G]=(Ordμ)V[H].
Proof.
Let L witness the (μ,κ)-NLC property. In V[G], let R be the collection of filters h⊆Col(μ,<α) for α<κ which are generic over V, such that for some Q∈L, V[h]=V[G∩Q]. The ordering is end-extension.
Let h∈R with Q0∈L a witness, and let and α<κ be arbitrary. Let α<β<κ and Q1⊇Q0 in L be such that in V[h], ∣Q1/(G∩Q0)∣=∣β∣, and Q1 collapses β to μ. By the definition and Lemma 2.7, Q1/(G∩Q0) is equivalent in V[h] to Col(μ,β), which is equivalent to the <μ-support product of Col(μ,γ) for α≤γ≤β. The filter G∩Q1 therefore gives a filter h′⊇h on Col(μ,<β+1) that is generic over V, with V[h′]=V[Q1∩G].
Let h∈R with Q0∈L a witness, and let f:μ→Ord in V[G] be arbitrary. By the definition of (μ,κ)-NLC, we can find some Q1⊇Q0 in L such that f∈V[G∩Q1]. By the previous paragraph, we may find Q2⊇Q1 in L equivalent to some Col(μ,<α), and some filter h′⊆Col(μ,<α) generic over V, extending h, and such that V[G∩Q2]=V[h′].
If F is generic over R, let H=⋃h∈Fh. Since Col(μ,<κ) is κ-c.c., H is generic, since any maximal antichain from V intersects some h∈F. By the above arguments, any f:μ→Ord in V[G] is in V[H]. Conversely, any f:μ→Ord in V[H] lives in some V[h] with h∈R, so is in V[G].
∎
2.1.1. The anonymous collapse
Let κ be a regular cardinal whose regularity is preserved by a forcing P. Let A(P) be the complete subalgebra of B(P∗Add(κ)) generated by the canonical name for the Add(κ)-generic set. More precisely, if e:P∗Add(κ)→B(P∗Add(κ)) is the canonical dense embedding, A(P) is completely generated by the elements of the form e(⟨1,{⟨α,1⟩}˙⟩). By [10, p. 247], we have a canonical correspondence between such Add(κ)-generic sets X which come after forcing with κ-preserving posets P, and A(P)-generic filters H. We will move between the two by writing, for example, XH and HX.
In the case that α<μ<κ for all α<κ and P=Col(μ,<κ), denote A(P) by A(μ,κ), and write B(μ,κ) for B(Col(μ,<κ)∗Add(κ)).
Lemma 2.9**.**
If P is (μ,κ)-NLC, and H⊆A(P) is generic over V, then B(P∗Add(κ))/H is κ-distributive in V[H].
Proof.
V[H]=V[XH] for the canonically associated XH⊆κ, and by forcing with B(P∗Add(κ))/H over V[H], we recover a filter G∗XH for P∗Add(κ), generic over V.
If G∗X is P∗Add(κ)-generic over V, then X codes all subsets of μ that live in V[G]. By the definition of (μ,κ)-NLC, every z∈(Ordμ)V[G] occurs in some submodel of the form V[G∩Q], where Q is isomorphic to Col(μ,α) for some α<κ. Thus z∈V[y] for some y⊆μ in V[G], so (Ordμ)V[X]⊇(Ordμ)V[G]. Since Add(κ) adds no μ-sized sets of ordinals, (Ordμ)V[G]=(Ordμ)V[G∗X]⊇(Ordμ)V[X]. Thus B(P∗Add(κ))/H is κ-distributive.
∎
Lemma 2.10**.**
Let V be a countable transitive model of ZFC (or just assume generic extensions are always available), and assume ⊩PVκ is regular. If X⊆κ, the following are equivalent:
(1)
X* is A(P)-generic over V.*
2. (2)
There is G⊆P such that G is generic over V, and X is Add(κ)-generic over V(P0), where P0=Pκ(κ)V[G].
Proof.
If X is A(P)-generic then force with B(P∗Add(κ))/HX over V[X], obtaining G such that G∗X is P∗Add(κ)-generic over V. Then X is Add(κ)-generic over V[G], and since Add(κ)V[G]=Add(κ)V(P0), X is Add(κ)-generic over V(P0).
Suppose G⊆P is generic over V, and X is Add(κ)-generic over V(P0), but not A(P)-generic over V. Then some p∈Add(κ)V(P0) forces this with dom(p)=α<κ, and X↾α=p. Take Y⊆κ such that Y↾α=p that is Add(κ)-generic over the larger model V[G]. Then Y is A(P)-generic over V, and V(P0)[Y] can see this, but this contradicts the property of p. So X was A(P)-generic over V.
∎
Theorem 2.11**.**
For any P that is is (μ,κ)-NLC, there is an isomorphism ι:A(P)→A(μ,κ) such that ι(∣∣α∈X˙∣∣A(P))=∣∣α∈X˙∣∣A(μ,κ) for all α<κ.
Proof.
Let X be A(P)-generic over V. There is a κ-distributive forcing over V[X] to get G such that G∗X is P∗Add(κ)-generic over V. By Lemma 2.8, we can do further forcing to obtain H⊆Col(μ,<κ) generic over V such that (Ordμ)V[H]=(Ordμ)V[G]. By Lemma 2.10, X is also A(μ,κ)-generic over V.
Conversely, every A(μ,κ)-generic X is A(P)-generic. For suppose X is a counterexample. Then there is some (p,q˙)∈Col(μ,<κ)∗Add(κ) such that (p,q˙)⊩X˙ is not A(P)-generic over V. Let Y be any A(P)-generic set, and let P0=P(μ)V[Y]. By the above, Y is A(μ,κ)-generic over V. Thus we can force over V[Y] to get H⊆Col(μ,<κ) such that H∗Y is B(μ,κ)-generic over V. By the homogeneity of the Levy collapse, there is some automorphism π∈V such that p∈π[H]=H′. By the homogeneity of Cohen forcing, there is some automorphism σ in V(P0) such that σ[Y] is a generic Y′ such that Y′↾dom(q˙H′)=q˙H′. Y′ is also A(P)-generic over V. However, (p,q˙)∈H′∗Y′, so we have a contradiction.
This implies that we have a canonical correspondence between A(P)- and A(μ,κ)-generic filters, i.e. definable functions f,g such that for any generic H for A(P), f(H) is the generic for A(μ,κ) computed from XH, and vice versa, and g(f(H))=H. For p∈A(P), put ι(p)=∣∣p∈g(H˙)∣∣A(μ,κ). It is easy to see that ι is a complete embedding. For any q∈A(μ,κ), there is p∈A(P) forces that q∈f(H˙). Thus if H is generic for A(μ,κ) and ι(p)∈H, then p∈g(H), so q∈f(g(H))=H, hence ι(p)≤q. The range of ι is dense, so it is an isomorphism. By the way we construct f and g, ι(∣∣α∈X˙∣∣A(P))=∣∣α∈X˙∣∣A(μ,κ).
∎
This machinery has some interesting applications to the absoluteness of some properties of a given powerset. First, it is easy to see for regular μ<κ such that α<μ<κ for all α<κ, Col(μ,<κ)×Add(μ,λ) is (μ,κ)-NLC for every λ. Thus if X is A(μ,κ)-generic, then for any λ, we may further force to obtain a model which is a (Col(μ,<κ)×Add(μ,λ))∗Add(κ)-generic extension with the same Ordμ. Taking inner models given by such Col(μ,<κ)×Add(μ,λ)-generic sets, we produce many models with the same cardinals and same P(μ), each assigning a different cardinal value for 2μ. For example, if we add ω1 Cohen reals to any model of M of ZFC, this is the same as forcing with Col(ω,<ω1). There is for each uncountable ordinal α∈M, a generic extension with the same reals and same cardinals, in which it appears we have added α many Cohen reals.
By using weakly compact cardinals, we can get even more dramatic examples. If κ is weakly compact, every κ-c.c. partial order captures small sets in small factors. To show this, first consider a partial order P of size κ. We can code P as A⊆κ, and by weak compactness, there is some transitive elementary extension (Vκ,∈,A)≺(M,∈,B). If μ<κ, then any P-name for function f:μ→Ord has an equivalent name τ∈Vκ by the κ-c.c. Since A∈M and M sees A as a regular suborder of B, M thinks that τ is a Q-name for some regular suborder Q of B. By elementarity, Vκ thinks that τ is a Q-name for some regular Q of A. For P of arbitrary size, let τ be a P-name of size <κ, take some regular θ such that P,τ∈Hθ, and take an elementary M≺Hθ with P,τ∈M such that ∣M∣=κ and M<κ⊆M. It is easy to see that M∩P is a regular suborder of P, and so the above considerations apply to show that there is some regular Q⊆P∩M⊆P of size <κ such that τ is a Q-name.
Therefore, if κ is weakly compact and P is κ-c.c., the collection L of all regular suborders of P of size <κ witnesses that P is (ω,κ)-nicely layered. If P also forces κ=ℵ1, then this collection also witnesses that P is (ω,κ)-NLC. To check this, take any Q0∈L, any P-name τ of size <κ, and α<κ. Let H⊆Q0 be generic. Since κ is still weakly compact in V[H], there is some regular Q1⊆P/H of size <κ in V[H] such that the (P/H)-name associated to τ is a Q1-name. Let β≥max{α,∣Q0∗Q˙1∣}. Since P/(Q0∗Q1˙) adds a generic for Col(ω,β), we have Q2∈L extending Q0∗Q˙1 such that Q2∼Col(ω,β).
In particular, if κ is weakly compact, then Col(ω,<κ)∗Q˙, where Q˙ is forced to be c.c.c., is (ω,κ)-NLC. Thus an extremely wide variety of forcing extensions with very different theories can be obtained, each sharing the same reals and same cardinals.
2.1.2. An unfortunate reality
Despite the universality of A(μ,κ), it is difficult to characterize its combinatorial structure. While it absorbs all of the small sets added by a (μ,κ)-NLC forcing, no such forcing completely embeds into it. The reader may opt to skip this section, as later results will not depend it.
To show this, we first isolate two properties of a forcing extension that depend on two regular cardinals μ<κ. The author is grateful to Mohammad Golshani for bringing these properties to his attention.
(1)
Levy(μ,κ):(∃A∈[κ]κ)(∀y∈[κ]μ∩V)y⊈A.
2. (2)
Silver(μ,κ):(∃A∈[κ]κ)(∀X∈[κ]κ∩V)(∃y∈[X]μ∩V)y∩A=∅.
Note that these are both Σ1 properties of the parameters ([κ]μ)V and ([κ]κ)V. For any partial order P, and collection of dense subsets D⊆P(P) the statement, “There is a filter G⊆P that is D-generic,” is also a Σ1 property of P and D. Now the following proposition either holds or fails for a given partial order P and cardinals μ<κ:
[TABLE]
Lemma 2.12**.**
If P is a separative partial order that satisfies (∗)μ,κ, preserves the regularity of κ, and such that d(P↾p)=κ for all p∈P, then P forces Silver(μ,κ).
Proof.
Let {pα:α<κ} be a dense subset of P. Inductively build a dense D⊆{pα:α<κ}, putting pα∈D just in case there is no β<α such that pβ∈D and pβ≤pα. D has the property that for all p∈D, ∣{q∈D:p≤q}∣<κ. Fixing a bijection f:D→κ, we claim that if G⊆P is generic, A=f[G] witnesses Silver(μ,κ). Note that since P is nowhere <κ-dense, A is an unbounded subset of κ. Now let p∈D and X={qα:α<κ}∈[D]κ be arbitrary. There is some B∈[κ]κ such that for all α∈B, p≰qα. For each α∈B, choose rα≤p such that rα⊥qα. By (∗), there is some y∈[B]μ such that {rα:α∈y} has a lower bound r. We have r⊩{qα:α∈yˇ}∩G˙=∅. As p and X were arbitrary, Silver(μ,κ) is forced.
∎
Lemma 2.13**.**
If P is a κ-c.c. separative partial order of size κ satisfying ¬(∗)μ,κ, then some p∈P forces Levy(μ,κ).
Proof.
Suppose X∈[P]κ witnesses ¬(∗)μ,κ. By the κ-c.c., there is some p such that p⊩∣Xˇ∩G˙∣=κ. If y∈[X]μ, then 1⊩yˇ⊈G˙, since otherwise some q is a lower bound to y. Hence p forces that X∩G witnesses Levy(μ,κ).
∎
Lemma 2.14**.**
Suppose μ<κ, μ is regular for all α<κ, αμ<κ. There are two (μ,κ)-NLC partial orders P0 and P1 such that P0 forces Levy∧¬Silver, and P1 forces ¬Levy∧Silver.
Proof.
Let P0 be the Levy collapse Col(μ,<κ), and let P1 be the Silver collapse,
[TABLE]
It is easy to see that P1 satisfies (∗)μ,κ, while P0 fails this property, as witnessed by X=P0. Hence by the previous lemmas, P0 forces Levy(μ,κ), and P1 forces Silver(μ,κ). We must show that the respective negations are also forced.
Let A˙ be a P0-name such that 1⊩A˙∈[κ]κ. Let p∈P be arbitrary, and let γ<κ be such that supp(p)⊆γ. Let X0={α<κ:p⊮α∈/A˙}. For each α∈X0, pick some qα≤p such that qα⊩α∈A˙. By a delta-system argument, let X1∈[X0]κ be such that there is r≤p such that for all α∈X1, qα↾γ=r, and for α=β in X1, (supp(qα)∖γ)∩(supp(qβ)∖γ)=∅. For any q≤r and y∈[X1]μ, q⊮yˇ∩A˙=∅. This is because for such q, there is some α∈y such that (supp(qα)∖γ)∩supp(q)=∅, so q is compatible with qα. Hence r⊩(∃X∈[κ]κ∩V)(∀y∈[X]μ∩V)y∩A˙=∅. As A˙ and p were arbitrary, ¬Silver(μ,κ) is forced.
Now let A˙ be a P1-name such that 1⊩A˙∈[κ]κ, and let p∈P1 be arbitrary. Form X0, {qα:α∈X0}, and X1 like above. We can take a y∈[X1]μ such that ⋃α∈yqα=q∈P1. Then q⊩yˇ⊆A˙, so q forces ¬Levy(μ,κ).
∎
Corollary 2.15**.**
Suppose μ, κ, P0, and P1 are as above. Let G be P0-generic and H be P1-generic over V. Let Q∈V be a partial order. If Q forces Levy(μ,κ), then V[H] has no Q-generic, and if Q forces Silver(μ,κ), then V[G] has no Q-generic. If Q is κ-c.c. and of size κ, then no κ-closed forcing extension of V[G] or V[H] can introduce a generic for Q.
Proof.
Since V[H] satisfies ¬Levy, and Levy is a Σ1 property with parameters in V, no inner model of V[H] containing V can satisfy Levy. Likewise, no inner model of V[G] containing V can satisfy Silver. To see that the non-existence of Q-generics is preserved by κ-closed forcing, suppose that for some such forcing R∈V[G], r⊩RV[G]K˙ is Q-generic over V. Since Q has size κ, we can build a descending sequence {rα:α<κ} below r such that for all q∈Q, there is rα deciding whether q∈K. Let K′={q:(∃α<κ)rα⊩q∈K˙}. Any maximal antichain A∈V contained in Q has size <κ, thus some rα completely decides A∩K. Since rα⊩Aˇ∩K˙=∅, we must have K′∩A=∅, so K′ is Q-generic over V. The argument for κ-closed forcing over V[H] is the same.
∎
Theorem 2.16**.**
Suppose μ<κ are regular and αμ<κ for all α<κ. No (μ,κ)-NLC forcing regularly embeds into A(μ,κ). Further, a generic extension by A(μ,κ) has no generic filters for any κ-c.c. forcing Q such that d(Q↾q)≥κ for all q∈Q.
Proof.
First note that we only need to consider Q such that d(Q↾q)=κ for all q∈Q. For if p∈A(μ,κ) is such that p⊩K˙ is Q-generic, then there would be some q∈B(Q) and some p′≤p such that B(Q)↾q completely embeds into A(μ,κ)↾p′. Since d(A(μ,κ)=κ, this implies B(Q)↾q≤κ.
Let Q be any κ-c.c. forcing such that d(Q↾q)=κ for all q∈Q. For any p∈Q, if (∗) holds for Q↾p, then p⊩Silver, and otherwise for some q≤p, q⊩Levy. Thus ⊩QLevy∨Silver. Suppose K is Q-generic over V, and X is A(μ,κ)-generic over V. There are two further forcings R0,R1 over V[X] that respectively get filters G,H such that V[G][X] is P0∗Add(κ)-generic, and V[H][X] is P1∗Add(κ)-generic. If V[K]⊨Levy, then K∈V[H][X], and if V[K]⊨Silver, then K∈/V[G][X]. Thus V[X] has no Q-generics.
∎
2.2. Construction of a dense ideal
First we will define a useful strengthening of “nicely layered.”
Definition**.**
P* is (μ,κ)-very nicely layered (with collapses) when there is a sequence ⟨Qα:α<κ⟩=L such that:*
(1)
L* witnesses that P is (μ,κ)-nicely layered (with collapses),*
2. (2)
L* is ⊆-increasing,*
3. (3)
every subset of P of size <μ with a lower bound has an infimum, and
4. (4)
there is a system of continuous projection maps πα:P→Qα such that for each α, πα↾Qα=id, and for β<α<κ, πβ=πβ∘πα.
(By continuous, we mean that for any X⊆P, if inf(X) exists, then for all α<κ, inf(πα[X])=πα(inf(X)).)
A typical example is the Levy collapse Col(μ,<κ). In the general case, we will usually abbreviate the action of the projection maps πα(q) by q↾α. In applying clause (3), we will use the next proposition, proof of which is left to the reader.
Proposition 2.17**.**
If P is a partial order such that every descending chain of length <μ has an infimum, then every directed subset of size <μ has an infimum.
Theorem 2.18**.**
Assume κ carries an almost-huge tower of height δ, and let j:V→M be given by the tower. Let μ,λ be regular such that μ<κ≤λ<δ. Suppose ⊩A(μ,κ) “ P˙ is (κ,δ)-very nicely layered and forces δ=λ+.” If X∗H is A(μ,κ)∗P˙-generic, then in V[X][H], there is a normal, κ-complete, λ-dense ideal on Pκ(λ).
Proof.
Let HX be the A(μ,κ)-generic filter computed from X. Let K×C be B(μ,κ)/HX×Col(μ,λ)-generic over V[X][H], and for brevity let W=V[X][H][K][C]. Note that V[X][K]=V[G][X], where G∗X is some Col(μ,<κ)∗Add(κ)-generic filter over V. Let ⟨Qα:α<δ⟩ witness that P is (κ,δ)-nicely layered. By the distributivity of B(μ,κ)/HX in V[X], P and its layers Qα are still κ-closed in V[G][X]. For α<β, the relation ⊩Qα “Qβ/Qα is κ-closed” holds in V[G][X] because in V[X], B(μ,κ)/HX×Qα is κ-distributive. Furthermore, since no sequences of length <μ are added, the forcing given by the definition of Col(μ,λ) is the same between V, W, and intermediate models.
The forcing to get from V[G] to W is equivalent to (Add(κ)×Col(μ,λ))∗P. Let L be the collection of subforcings of the form (Add(κ)×Col(μ,λ))∗Qα for α<δ. This sequence then witnesses the (μ,δ)-NLC property in V[G]. The closure properties are evident, and since the whole forcing has the δ-c.c., functions from μ to ordinals are indeed captured by these factors.
Let P0=P(μ)W, and consider the submodel M(P0). In W, Q0=\breakP(Add(δ))M(P0) has cardinality δ. To show this, let Y⊆δ be Add(δ)-generic over W. By Theorem 2.11, Y is A(μ,δ)-generic over V, and hence over M since (Col(μ,<δ)∗Add(δ))M=(Col(μ,<δ)∗Add(δ))V by the closure of M. Since M[Y] thinks j(δ) is inaccessible, M[Y]⊨∣Q0∣<j(δ), so W[Y]⊨∣Q0∣=δ since j(δ)<(δ+)V. Since W⊨2μ=δ, W and W[Y] have the same cardinals, so W⊨∣Q0∣=δ. Therefore, working in W, we can inductively build a set X^⊆δ that is Add(δ)-generic over M(P0) with X^∩κ=X. By Lemma 2.10, X^ is A(μ,δ)-generic over M[G]. A further forcing produces G′⊇G, such that G′∗X^ is Col(μ,<δ)∗Add(δ)-generic over M, so we have an elementary j^:V[G][X]→M[G′][X^] extending j. By elementarity, for the corresponding filters HX and HX^ on the respective algebras A(μ,κ)V and A(μ,δ)M, we have j[HX]⊆HX^. Hence we can define in W the restricted elementary embedding j^:V[X]→M[X^].
Now we wish to extend j^ to have domain V[X][H]. As in the argument for Lemma 2.9, every element of (Ordμ)W is coded by some element of M and some y⊆μ coded in X^, so M[X^] is closed under <δ-sequences from W. Consequently, H∩Qα and j^[H∩Qα] are in M[X^] for all α<δ. Also, M[X^]⊨ “j^(P) is (δ,j(δ))-very nicely layered.” Each j^[H∩Qα] is a directed set of size μ in M[X^], so it has an infimum mα∈j^(Qα).
Let ⟨Aα:α<δ⟩∈W enumerate the maximal antichains of j^(P) from M[X^]. (There are only δ many because M[X^] thinks this partial order has inaccessible size j(δ) and is j(δ)-c.c.) Inductively define an increasing sequence of ordinals ⟨αi⟩i<δ⊆δ, and a corresponding decreasing sequence of conditions ⟨pi⟩i<δ⊆j^(P) as follows.
Assume as the induction hypothesis that we have defined the sequences up to i, and for all ξ<i and all α<δ, pξ is compatible with mα, and for all ξ<i, there is some a∈Aξ such that pξ≤a. Let qi=infξ<ipξ. This is compatible with all mα because for all α, ⟨pξ∧mα:ξ<i⟩ is a descending chain in j^(P). Let αi≥supξ<iαξ be such that Ai⊆j^(Qαi) and qi∈j^(Qαi). This is possible by the chain condition and because j[δ] is cofinal in j(δ). Choose pi∈j^(Qαi) below qi∧mαi and some a∈Ai. pi is compatible with all mα, because for any α>αi, mα↾j(αi)=mαi. This is because for any α<β<δ,
[TABLE]
The upward closure of the sequence ⟨pi⟩i<δ is a filter H^ which is j^(P)-generic over M[X^]. For all p∈H, j^(p)∈H^ since there is some mα≤j^(p). Thus we get an extended elementary embedding j^:V[X][H]→M[X^][H^]. In W, we define an ultrafilter U over (P(Pκλ))V[X][H]: let A∈U iff j[λ]∈j^(A). Note that j[λ]∈Pj(κ)(j(λ))M[X^][H^]. U is κ-complete and normal with respect to functions in V[X][H]. If f:Pκ(λ)→λ is a regressive function in V[X][H] on a set A∈U, then j^(f)(j[λ])=j(α) for some α<λ, so {z∈A:f(z)=α}∈U.
Now the forcing to obtain U was Q=B(μ,κ)/HX×Col(μ,λ), the product of a κ-dense and a λ-dense partial order. In V[X][H], let e:P(Pκλ)→B(Q) be defined by e(A)=∣∣Aˇ∈U˙∣∣. Let I be the kernel of e. I is clearly a normal, κ-complete ideal. e lifts to a boolean embedding of P(Pκλ)/I into B(Q). Since Q is λ+-c.c., I is λ+-saturated. If ⟨[Aα]:α<λ⟩ is a maximal antichain in Pκ(λ)/I, then ∇Aα is the least upper bound and is in the dual filter to I. e(∇Aα)=∣∣∇Aα∈U˙∣∣=1, and this is the least upper bound in B(Q) to {e(Aα):α<λ}. This is because if there were a generic extension in which all Aα∈/U, then ∇Aα∈/U as well since U is normal with respect to sequences from V[X][H]. Therefore e is a complete embedding, and thus I is λ-dense.
∎
We can also characterize the exact structure of P(Pκλ)/I. First note the following about the ground model embedding j:V→M. M is the direct limit of the coherent system of α-supercompactness embeddings jα:V→Mα for α<δ. Every member of Mα is represented as jα(f)(jα[α]) for some function f∈V with domain Pκ(α). If kα:Mα→M is the factor map such that j=kα∘jα, then the critical point of kα is above α, so kα(x)=kα[x] when Mα⊨∣x∣≤∣α∣. Since M is the direct limit, for any x∈M, there is some α<δ and some f∈V such that
[TABLE]
Let U⊆P(Pκλ)/I be generic over V[X][H], and let jU:V→N be the generic ultrapower embedding. Since e:P(Pκλ)/I→B(Q) is a complete embedding, forcing with B(Q)/e[U] over V[X][H][U] produces a model W as above. Notice that the definition of e and U makes A∈U iff j[λ]∈j^(A). Hence we can define an elementary embedding k:N→M[X^][H^] by k([f])=j^(f)(j[λ]), and we have j^=k∘jU.
What is the critical point of k? Since N⊨μ+=δ, certainly it must be at least δ. Let β be any ordinal. There is some α such that λ≤α<δ and some f∈V such that β=j(f)(j[α]). Let b:λ→α be a bijection in V[X][H]. Then β=j(f)(j^(b)[j[λ]]). Furthermore, j[λ]=k(jU[λ]). Therefore, β=k(jU(f)(jU(b)[jU[λ]])). Thus β∈ran(k), and so k does not have a critical point.
Therefore, N=M[X^][H^]. By the closure of M[X^][H^], the generic K×C for Q is in M[X^][H^]=N⊆V[X][H][U]. So the quotient B(Q)/e[U] is trivial and P(Pκλ)/I≅B(Q)↾q for some q.
The generic embeddings coming from I extend the original almost-hugeness embedding. In particular, j[δ] is cofinal in j(δ). This can also be deduced from the assumption that there is some A∈I∗ of size λ, which of course follows from λ<κ=λ. In contrast, Burke and Matsubara [1] proved that if there is a normal, fine, κ-complete, λ+-saturated ideal on Pκ(λ) and cf(λ)<κ, then it is forced that sup(j[λ+])<j(λ+). It seems to be unknown whether it is consistent to have saturated ideals on Pκ(λ) for successor κ and singular λ, and this result suggests that quite different methods will be needed for an answer.
2.2.1. Minimal generic supercompactness
Generalizing supercompactness, we will say cardinal κ is generically supercompact when for every λ≥κ, there is a forcing P such that whenever G⊆P is generic, there is an elementary embedding j:V→M, where M is a transitive class in V[G], crit(j)=κ, j(κ)>λ, and Mλ∩V[G]⊆M. We note that unlike in the case of non-generic supercompactness, the condition that j[λ]∈M does not imply that M is closed under λ-sequences from V[G]. Whenever a supercompact κ is turned into a successor cardinal by a κ-c.c. forcing, we’ll have that for all λ≥κ, there is a normal, fine, precipitous ideal on Pκ(λ) whose generic embeddings always extend the original supercompactness embedding. But if j:V→M is an embedding coming from a normal ultrafilter on Pκ(λ), then 2λ<κ<j(κ)<(2λ<κ)+. If κ=μ+ in a generic extension V[H], and a further extension gives j^:V[H]→M[H^]⊆V[H][G] extending j, then M[H^] is not closed under λ-sequences from V[H][G]. This is because ∣λ∣=∣j(κ)∣=μ in V[H][G], while M[H^] thinks j(κ) is a cardinal.
Stronger properties of ideals on Pκ(λ) are needed to give genuine generic supercompactness. One such property is λ+-saturation, which is implied by λ-density. We now sketch how to get a model in which there is a successor cardinal κ such that for all regular λ≥κ, there is a normal, κ-complete, λ-dense ideal on Pκ(λ). Start with a super-almost-huge cardinal κ and a regular μ<κ. The first part of the forcing is A(μ,κ). Then we do a proper class iteration, which we prefer to describe instead as an iteration up to an inaccessible δ>κ such that Vδ⊨κ is super-almost-huge.
Let T={α<δ:κ carries an almost-huge tower of height α}. Let C be the closure of T, and let ⟨αβ⟩β<δ be its continuous increasing enumeration. Over VA(μ,κ), let Pδ be the Easton-support limit of the following:
•
Let P0=Col(κ,<α0).
•
If β is zero or a successor ordinal, let Pβ+1=Pβ∗Col(αβ,<αβ+1).
•
If β is a limit ordinal such that αβ is singular, let Pβ+1=Col(αβ+,<αβ+1).
•
If β is a limit ordinal such that αβ is regular, let Pβ+1=Col(αβ,<αβ+1).
It is routine to verify that this iteration preserves the regularity of the members of T, the successors of the singular limit points of T, and the regular limit points of T. Further, the set of non-limit-points of T becomes the set of successors of regular cardinals between κ and δ.
Let X⊆κ be A(μ,κ)-generic over V, and let H⊆Pδ be generic over V[X]. Suppose κ≤λ<δ, and λ is regular in V[X][H]. Then there is some successor ordinal β<δ such that αβ∈T and αβ=λ+. Consider the subforcing A(μ,κ)∗Pβ=(A(μ,κ)∗Pβ−1)∗Col(λ,<αβ). The forcing Pβ is (κ,αβ)-very nicely layered in V[X].
If j:V→Mβ is an almost-huge embedding with critical point κ and j(κ)=αβ, then by Theorem 2.18, there is a normal, κ-complete, λ-dense ideal on Pκ(λ) in V[X][Hβ]. Now note that the tail-end forcing Pβ,δ is αβ-closed. Since λ<κ=λ in V[X][Hβ], no new subsets of Pκ(λ) are added by the tail. The collection {Aα:α<λ} witnessing the λ-density of I retains this property, as this is a local property of the boolean algebra Pκ(λ)/I and {Aα:α<λ}. Normality and completeness of I are likewise preserved.
This method is quite flexible, and can done by iterating collapsing posets other than the Levy collapse, or by using products rather than iterations.
2.2.2. Dense ideals on successive cardinals?
At the time of this writing, it is unknown whether there can exist simultaneously a normal κ-dense ideal on κ and a normal κ+-dense ideal on κ+. The following is the current best approximation.
Suppose ⟨κn:n<ω⟩ is a sequence of cardinals such that for all n, κn carries an almost-huge tower of height κn+1. Such a sequence will be called an almost-huge chain. Obviously, extending this to sequences of length longer than ω requires an extra idea; perhaps we just stack one ω-chain above another, or maybe postulate some relationship between the ω-chains. By Theorem 2.4, such chains occur quite often below a huge cardinal.
Suppose ⟨κn:0<n<ω⟩ is an almost-huge chain, and μ<κ1 is regular. Consider the full-support iteration P of ⟨Pn:n<ω⟩, where P0=A(μ,κ1), and for all n<ω, Pn+1=Pn∗A(κn,κn+1). The stage P1=A(μ,κ1)∗A(κ1,κ2) regularly embeds into A(μ,κ1)∗(Col(κ1,<κ2)∗Add(κ2)). The first two stages here add a normal κ1-dense ideal on κ1 and make κ1=μ+, κ2=μ++. The third stage preserves this since it adds no subsets of κ1. By Lemma 2.9, the quotient forcing Q to get from VP1 to this three-stage extension is κ2-distributive. Now the tail-end forcing P/P1 is κ2-strategically closed. Since Q does not add any plays of the relevant game of length <κ2, P/P1 remains κ2-strategically closed in VP1∗Q, so forcing with it preserves the κ1-dense ideal on κ1. Also, Q remains κ2-distributive in VP, since Q×(P/P1) is κ2-distributive in VP1. It thus remains the case in VP that there is a κ2-distributive forcing adding a normal κ1-dense ideal on κ1.
Similarly, consider VPn for n>1. Pn=Pn−2∗(A(κn−1,κn)∗A(κn,κn+1)). Since ∣Pn−2∣=κn−1 (or μ for n=2), κn retains an almost-huge tower of height κn+1 in VPn−2. Thus the same argument applies: In VPn, there is a κn+1-distributive forcing adding a normal κn-dense ideal on κn, and this remains true in VP. Therefore, we obtain a model in which for all n>0, there is a μ+n+1-distributive forcing adding a normal μ+n-dense ideal on μ+n. By repeating this with a tall enough stack of almost-huge chains, we obtain the consistency of ZFC with the statement, “For all regular cardinals κ, there is a κ++-distributive forcing adding a normal κ+-dense ideal on κ+.”
3. Structural constraints
Saturated ideals have a strong influence over the combinatorial structure of the universe in their vicinity. Phenomena of this type may also be viewed as the universe imposing constraints on the structural properties of ideals. Below are some of the most interesting known results to this effect. Proofs can be found in [7].
(1)
(Tarski) If I is a nowhere-prime ideal which is κ-complete and μ-saturated for some μ<κ, then 2<μ≥κ.
2. (2)
(Jech-Prikry) If κ=μ+, 2μ=κ, and there is a κ-complete, κ+-saturated ideal on κ, then 2κ=κ+.
3. (3)
(Jech-Prikry) If κ=μ+, and there is a κ-complete, κ+-saturated ideal on κ, then there are no κ-Kurepa trees.
4. (4)
(Woodin) If there is a countably complete, ω1-dense ideal on ω1, then there is a Suslin tree.
5. (5)
(Woodin) If there is a countably complete, uniform, ω1-dense ideal on ω2, then 2ω=ω1. (Uniform means that all sets of size <ω2 are in the ideal–equivalent to fineness.)
6. (6)
(Shelah) If 2ω<2ω1, then NSω1 is not ω1-dense.
7. (7)
(Gitik-Shelah) If I is a κ-complete, nowhere-prime ideal, then d(I)≥κ.
We note that result (2) easily generalizes to the following: If κ=μ+, 2μ=κ, and there is a normal, fine, κ-complete, λ+-saturated ideal on Pκ(λ), then 2λ=λ+.
If no requirements are made for the ideal I and the set Z on which it lives, almost no structural constraints on quotient algebras remain. The following strengthens a folklore result, probably known to Sikorski. The argument was supplied by Don Monk in personal correspondence.
Proposition 3.1**.**
Let B be a complete boolean algebra, and let κ be a cardinal such that 2κ≥∣B∣. There is a uniform ideal I on κ such that B≅P(κ)/I.
Proof.
Let κ, B be as hypothesized. By the theorem of Fichtenholz-Kantorovich and Hausdorff (see [10, Lemma 7.7]), there exists a family F of 2κ many subsets of κ such that for any x1,...,xn,y1,...,ym∈F, x1∩...∩xn∩(κ∖y1)∩...∩(κ∖ym) has size κ. F generates a free algebra: closing F under finitary set operations gives a family of sets G such that any equation holding between elements of G expressed as boolean combinations of elements of F holds in all boolean algebras. If we pick any surjection h0:F→B and extend it to h1:G→B in the obvious way, then h1 will be a well-defined homomorphism.
Let Ibd be the ideal of bounded subsets of κ. Since all elements of G are either empty or have cardinality κ, G≅G/Ibd, so h1 has an extension h2 from the algebra generated by G∪Ibd to B, where h2(x)=0 for all x∈Ibd. Finally, by Sikorski’s extension theorem, there is a further extension to a homomorphism h3:P(κ)→B. The kernel of h3 is an ideal I such that P(κ)/I≅B.
∎
3.1. Cardinal arithmetic and ideal structure
A careful examination of the proof of Woodin’s theorem (5) shows that ω2 can be replaced by any ωn, 2≤n<ω. Aside from that, Woodin’s argument is rather specific to the cardinals involved. In [7], Foreman asked (Open Question 27) whether the analogous statement holds one level up:
Question** (Foreman).**
Does the existence of an ω2-complete, ω2-dense, uniform ideal on ω3 imply that 2ω1=ω2?
To answer this, we invoke an easy preservation lemma about ideals under small forcing. If I is an ideal, P is a partial order, and G⊆P is generic, then Iˉ denotes the ideal generated by I in V[G], i.e. {X:(∃Y∈I)X⊆Y}.
Lemma 3.2**.**
Suppose I is a κ-complete ideal on Z⊆P(X), P is a partial order, and G is P-generic.
(1)
If sat(P)≤κ, then Iˉ is κ-complete in V[G].
2. (2)
If d(P)<κ, then d(Iˉ)V[G]≤d(I)V.
Proof.
For (1), let s˙ be a P-name for a sequence of elements of Iˉ of length less than κ. By κ-saturation, let β<κ be such that 1⊩dom(s˙)≤β. For each α<β, let Aα be a maximal antichain such that for p∈Aα, p⊩s˙(α)⊆bˇαp, where bαp∈I. Then B=⋃p,αbαp∈I, and 1⊩⋃s˙⊆Bˇ.
For (2), let D⊆P be a dense set of size less than κ, and let A∈Iˉ+. Then A=⋃d∈D∩G{z:d⊩z∈A˙}. By (1), there is some d∈D such that {z:d⊩z∈A˙}∈/I. This shows that (P(Z)/I)V is dense in (P(Z)/Iˉ)V[G], and the conclusion follows.
∎
Corollary 3.3**.**
If there is a κ+-complete, κ+-dense, uniform ideal on κ++, then 2κ=κ+.
Proof.
Suppose for a contradiction that f:P(κ)→κ++ is a surjection. Let P=Col(ω,κ), and let G be P-generic. Since d(P)=κ, Lemma 3.2 implies that Iˉ is κ+-complete and κ+-dense in V[G]. Furthermore, in V[G], κ+=ω1 and κ++=ω2. Thus Woodin’s theorem implies that V[G]⊨ CH. However, f witnesses the failure of CH, a contradiction.
∎
Another interesting constraint can be derived from the following:
If κ=μ+, λ≥κ is regular, and I is a normal, fine, κ-complete, λ+-saturated ideal on Pκ(λ), then {z:cf(z)=cf(μ)}∈I∗.
Proof.
Let G be a generic ultrafilter extending I∗. Since crit(j)=κ and λ+ is preserved, j(κ)=λ+, and ∣λ∣=μ in V[G]. By Shelah’s theorem, cf(λ)=cf(μ) in V[G] and in the ultrapower M since Mμ∩V[G]⊆M. Since 1⊩[id]=j[λ], Łoś’s theorem gives {z:cf(z)=cf(μ)}∈I∗.
∎
Theorem 3.6**.**
Suppose κ=μ+, and I is a normal, fine, κ+-saturated ideal on κ. Then P(κ)/I is cf(μ)-distributive iff μ<cf(μ)=μ.
Proof.
Suppose P(κ)/I is cf(μ)-distributive, and let {fα:α<δ} be an enumeration of [μ]<cf(μ), where δ is a cardinal. If μ<δ, then for any P(κ)/I-generic G, ([μ]<cf(μ))V is a proper subset of ([μ]<cf(μ))V[G], since j[δ]=j(δ). This contradicts the distributivity of P(κ)/I.
Since P(κ)/I is κ+-saturated, it is cf(μ)-distributive iff it is (cf(μ),κ)- distributive. Let G be P(κ)/I-generic and let M be the generic ultrapower. Let β<cf(μ), and suppose f∈V[G] is a function from β to κ. By Theorem 1.13, f∈M. By Corollary 3.5, M⊨cf(κ)=cf([id])=cf(μ). Thus there is a γ<κ such that ran(f)⊆γ. Observe that j(βγ)=(βγ)M=(βγ)V, since μβ<κ. Hence f∈V.
∎
3.2. Stationary reflection
A stationary subset S of a regular cardinal κ is said to reflect if there is some α<κ of uncountable cofinality such that S∩α is stationary in α. A collection of stationary subsets {Si:i<δ} of κ is said to reflect simultaneously if there is some α<κ if Si∩α is stationary for all i<δ. It is well known that if κ=μ+ and X is a set of regular cardinals below μ, then the statement that every stationary subset of {α<κ:cf(α)∈X} reflects contradicts □μ, and the statement that every pair of stationary subsets of {α<κ:cf(α)∈X} reflect simultaneously contradicts the weaker principle □(κ).
Theorem 3.7**.**
Suppose there is a κ+-complete, κ++-saturated, uniform ideal on κ+n for some n≥2. Then for 2≤m≤n, every collection of κ many stationary subsets of κ+m contained in cof(≤κ) reflects simultaneously.
Proof.
Suppose I is such an ideal and j:V→M⊆V[G] is a generic embedding arising from the ideal. The critical point of j is κ+, and all cardinals above κ+ are preserved. Since I is uniform, and there is a family of κ+n+1 many almost-disjoint functions from κ+n to κ+n, j(κ+n)≥(κ+n+1)V. The first n−1 cardinals in V above κ must map onto the first n−1 cardinals in M above κ. But in M, there are at least n−1 cardinals in the interval (κ,(κ+n+1)V) since all cardinals above κ+ are preserved. Thus if j(κ+n)>(κ+n+1)V, then κ+n+1 would be collapsed. So for 1≤m≤n, j(κ+m)=(κ+m+1)V.
Let {Sα:α<κ} be stationary subsets of κ+m concentrating on cof(≤κ), where 2≤m≤n. By the κ++-chain condition, these sets remain stationary in V[G]. By the above remarks, γ=sup(j[κ+m])<j(κ+m). For each α, j↾Sα is continuous since κ<crit(j). For each α, let Cα be the closure of Sα. In V[G], we can define a continuous increasing function f:Cα→γ extending j↾Sα by sending sup(Sα∩β) to sup(j[Sα∩β]) when β is a limit point of Sα. This shows that j[Sα] is stationary in γ. Now M may not have j[Sα] as an element, but it satisfies that j(Sα)∩γ is stationary in γ. Furthermore, j({Sα:α<κ})={j(Sα):α<κ}, and M sees that these all reflect at γ. By elementarity, the Sα have a common reflection point.
∎
Proposition 3.8**.**
Suppose μ,κ,λ are regular cardinals such that ω<μ<κ=μ+<λ, and I is an ideal on Pκ(λ) as in Theorem 2.18. Then every collection {Si:i<μ} of stationary subsets of λ∩cof(ω) reflects simultaneously.
Proof.
The algebra P(Pκ(λ))/I is isomorphic to B(P×Q), where P is κ-dense and ⊩P‘‘Q is μ-closed.” Forcing with P×Q thus preserves the stationarity of any subset of λ∩cof(ω). If j:V→M⊆V[G] is a generic embedding arising from the ideal, then since j[λ]∈M and M thinks j(λ) is regular, γ=sup(j[λ])<j(λ). The restriction of j to each Si is continuous, and as above we may define in V[G] a continuous increasing function from the closure of Si into γ, showing j[Si] is stationary in γ for each i. Thus M⊨(∀i<μ)j(Si)∩γ is stationary, so by elementarity, the collection reflects simultaneously.
∎
3.3. Nonregular ultrafilters
The computation of the cardinality of ultrapowers is an old problem of model theory. Originally, it was conjectured that if μ,κ are infinite cardinals, and U is a countably incomplete uniform ultrafilter on κ, then ∣μκ/U∣=μκ [3]. It was shown by Donder [5] that this conjecture holds in the core model below a measurable cardinal. A key tool in computing the size of ultrapowers is the notion of regularity:
Definition**.**
An ultrafilter U on Z is called (μ,κ)-regular if there is a sequence ⟨Aα:α<κ⟩⊆U such that for any Y⊆κ of order type μ, ⋂α∈YAα=∅.
Suppose U is a (μ,κ)-regular ultrafilter on Z, witnessed by ⟨Aα:α<κ⟩. For each z∈Z, let βz=ot({α:z∈Aα})<μ. Then for any sequence of ordinals ⟨γz:z∈Z⟩, we have ∣∏γzβz/U∣≥∣∏γz/U∣κ.
Obviously any uniform ultrafilter on a cardinal κ is (κ,κ)-regular. Also, any fine ultrafilter on Pκ(λ) is (κ,λ)-regular, as witnessed by ⟨α^:α<λ⟩. Much can be seen by exploiting a connection between dense ideals and nonregular ultrafilters.
Suppose B is a complete boolean algebra of density κ, where κ is regular. Then there is an ultrafilter U on B such that whenever X⊆B and ∑X∈U, then there is Y⊆X such that ∣Y∣<κ and ∑Y∈U.
Proof.
Let D={dα:α<κ} be dense in B. For any maximal antichain A⊆B, let γA>0 be least such that for all α<γA, there are β<γA and a∈A such that dβ≤dα∧a. Let CA={d∈D↾γA:(∃a∈A)d≤a}. Let F={∑CA:A is a maximal antichain}.
We claim F has the finite intersection property. Let A1,...,An be maximal antichains. We may assume γA1≤...≤γAn. Let dα1≤d0∧a1 for some a1∈A1, where α1<γA1. Let dα2≤dα1∧a2 for some a2∈A2, where α2<γA2. Proceeding inductively, we get a descending chain dα1≥...≥dαn, where each dαi∈CAi. Thus dαn≤∑CA1∧...∧∑CAn.
Let U⊇F be any ultrafilter. If ∑X∈U, then we can find an antichain A that is maximal below ∑X such that (∀a∈A)(∃x∈X)a≤x. Extending A it to a maximal antichain A′, we have ∑CA′∈F. Since ∣CA′∣<κ, the conclusion follows.
∎
If I is an ideal on Z and U′ is an ultrafilter on P(Z)/I, then U′ generates an ultrafilter U⊇I∗ on Z by taking U={X:[X]I∈U′}.
Lemma 3.11**.**
Suppose κ=μ+, λ is regular, and I is a normal and fine, κ-complete, λ-dense ideal on Z⊆Pκ(λ). Then any ultrafilter U⊇I∗ given by Lemma 3.10 is (cf(μ)+1,λ)-regular.
Proof.
Let U′ be an ultrafilter on P(Z)/I given by Lemma 3.10 and let U be the corresponding ultrafilter on Z. By Corollary 3.5, {z:cf(z)=cf(μ)}∈I∗. For such z, choose Az⊆z of order type cf(μ) that is cofinal in z. We will inductively build a sequence of intervals {(xα,yα):α<λ}, each contained in λ, such that yα<xβ when α<β, and such that for all α, {z:Az∩(xα,yα)=∅}∈U.
Suppose we have constructed the intervals up to β. Let λ>xβ>sup{yα:α<β}. For z∈x^β, let yβ(z)∈z be such that Az∩(xβ,yβ(z))=∅. Since I is normal, there is a maximal antichain A of I-positive sets such that for all a∈A, yz(β) is the same for all z∈a. There is some A′⊆A of size <λ such that ∑A′∈U′. Let yβ>xβ be such that for z∈a∈A′, yβ(z)<yβ.
For α<λ, let Xα={z:Az∩(xα,yα)=∅}. Since each Az has order type cf(μ) and the intervals (xα,yα) are disjoint and increasing, each Az cannot have nonempty intersection with all intervals in some sequence of length greater than cf(μ). Thus if s⊆λ and z∈⋂α∈sXα, then ot(s)≤cf(μ).
∎
Lemma 3.12**.**
Suppose I is a λ-dense, κ-complete ideal on Z, and P(Z)/I is a complete boolean algebra. Then any U⊇I∗ given by Lemma 3.10 has the property that for all α<κ, ∣αZ/U∣≤2<λ.
Proof.
Let U′ be an ultrafilter on P(Z)/I given by Lemma 3.10 and let U be the corresponding ultrafilter on Z.
To compute a bound on ∣αZ/U∣ for α<κ, we identify a small subset of αZ and show that it contains representative of every equivalence class modulo U. Let D witness λ-density. Choose an antichain A⊆D of size <λ, and choose f:A→α. There are ∑γ<λλγ⋅αγ=2<λ many choices. Using κ-completeness, let {Bβ:β<α} be pairwise disjoint and such that each [Bβ]I=∑f−1(β). Let gf:Z→α be defined by gf(z)=β if z∈Bβ and gf(z)=0 if z∈/⋃β<αBβ.
Now let g:Z→α be arbitrary. By κ-completeness, A={g−1(β):β<α and g−1(β)∈I+} forms a maximal antichain. Let A′⊆D be a maximal antichain refining A. There is some A′′⊆A′ of size <λ such that ∑A′′∈U′. Let f:A′′→α be defined by f(a)=β iff a≤Ig−1(β). If [B]I=∑A′′, then {z∈B:g(z)=gf(z)}∈I, so g=Ugf.
∎
The following contrasts with the consistency results of Section 2:
Corollary 3.13**.**
Suppose μ is a singular cardinal such that 2cf(μ)<μ, λ is regular, and 2<λ<2λ. Then there is no normal and fine, λ-dense ideal on Pμ+(λ). Furthermore, there is a proper class of such λ.
Proof.
Suppose such an ideal exists, and let U⊇I∗ be given by Lemma 3.10. Then ∣∏μ/U∣≤2<λ, and U is (cf(μ)+1,λ)-regular. Theorem 3.9 implies that ∣∏2cf(μ)/U∣≥2λ, a contradiction.
Assume for a contradiction that α is such that 2<λ=2λ for all regular λ≥α. Let κ=2α. We will show by induction the impossible conclusion that 2β=κ for all β≥α. Suppose that this holds for all γ<β. If β is regular, 2<β=2β by assumption, so 2β=κ. If β is singular, then by [10, Theorem 5.16] 2β=(2<β)cf(β)=κcf(β). If cf(β)<γ<β, then κ=2γ=(2γ)cf(β)=κcf(β).
∎
Corollary 3.14**.**
If κ is singular such that 2cf(κ)<κ, then there is no uniform, κ+-complete, κ+-dense ideal on κ+n for n≥2.
Proof.
Assume I is a uniform, κ+-complete, κ+-dense ideal on κ+n for some n≥2. Define ϕ:P(κ+)→P(κ+n)/I by X↦∣∣κ+∈j(X)∣∣P(κ+n)/I. Let J=kerϕ. ϕ lifts to an embedding of P(κ+)/J into P(κ+n)/I. Since J is clearly normal and κ++-saturated, the embedding is regular, since for a maximal antichain {Aα:α<κ+}, ⊩κ+∈j(∇α<κ+Aα), so it is forced that for some α<κ+, ϕ(Aα) is in the generic filter. Thus J is a normal κ+-dense ideal on κ+. We have 2<κ+<2κ+ by Corollary 3.3, so κ cannot be singular such that 2cf(κ)<κ.
∎
These methods can also be used to deduce more cardinal arithmetic consequences of dense ideals. First we need a few more lemmas:
If κ is regular and U is a (κ+,κ+)-regular ultrafilter, then U is (κ,κ)-regular.
Lemma 3.16**.**
Suppose (L,<) is a linear order such that for all x∈L, ∣{y∈L:y<x}∣≤κ. Then ∣L∣≤κ+.
Corollary 3.17**.**
Suppose there is a κ+-complete, κ+-dense ideal on κ+n, where n≥2. Then for 0≤m≤n, 2κ+m=κ+m+1.
Proof.
Let I be such an ideal, and let U⊇I∗ be given by Lemma 3.10. By Lemma 3.12, ∣κκ+n/U∣≤2κ, which is κ+ by Corollary 3.3. Note that for any cardinal μ, any ultrafilter V on a set Z, and any g:Z→μ+, {[f]V:f<Vg} has cardinality at most ∣μZ/V∣. Thus, applying Lemma 3.16 inductively, we get that ∣(κ+m)κ+n/U∣≤κ+m+1 for all m<ω.
U is (κ+n,κ+n)-regular, so by Theorem 3.15, it is (κ+m,κ+m)-regular for m≤n. Assume for induction that 2κ+r=κ+r+1 for r<m≤n; note the base case m=1 holds. Let {Xα:α<κ+m} witness (κ+m,κ+m)-regularity, and let βz=ot({α:z∈Xα}). By Theorem 3.9 and the above observations, we have:
[TABLE]
∎
We note that if the hypothesis of Corollary 3.17 is consistent, then no cardinal arithmetic above κ+n can be deduced from it, since any forcing which adds no subsets of κ+n will preserve the relevant properties of the ideal.
By combining this technique with the results of Section 2, we can answer the following, which was Open Question 16 from [7]:
Question** (Foreman).**
Is it consistent that there is a uniform ultrafilter U on ω3 such that ωω3/U has cardinality ω3? Is it consistent that there is a uniform ultrafilter U on ℵω+1 such that ωℵω+1/U has cardinality ℵω+1? Give a characterization of the possible cardinalities of ultrapowers.
Theorem 3.18**.**
Assume ZFC is consistent with a super-almost-huge cardinal. Then it is consistent that every regular uncountable cardinal κ carries a uniform ultrafilter U such that ∣ωκ/U∣=κ.
This follows from Section 2 and the next result.
Lemma 3.19**.**
Suppose κ=μ+, GCH holds at cardinals ≥μ, and for all regular λ≥κ, there is a normal and fine, κ-complete, λ-dense ideal on Pκ(λ). Then for every regular λ, there is a uniform ultrafilter U on λ such that ∣μλ/U∣=λ.
Proof.
Let I be a normal and fine, κ-complete, λ-dense ideal on Z=Pκ(λ), where κ=μ+ and λ is regular. Note that ∣Z∣=λ, and every Y⊆Z of size <λ is in I. Let U⊇I∗ be given by Lemma 3.12, so that ∣μZ/U∣≤2<λ. If 2<λ=λ, then ∣μZ/U∣≤λ. Since 2μ=κ and any ultrafilter extending I∗ is (κ,λ)-regular, Theorem 3.9 implies that ∣κZ/U∣>λ, and Lemma 3.16 implies that ∣κZ/U∣≤∣μZ/U∣+. Thus ∣μZ/U∣=λ.
∎
The following extra conclusion can be immediately deduced in the case of μ<ℵω and λ=ρ+, where cf(ρ)=ω. Suppose μ=ωn. Since ∣ωn+1Z/U∣>λ, we cannot have ∣ωmZ/U∣<ρ for any m, since by Lemma 3.16, we would have ∣ωrZ/U∣<ρ for all r<ω. Also, U is (ω,ω)-regular, so Theorem 3.9 implies that ∣ωZ/U∣≥∣ωZ/U∣ω. Thus ∣ωmZ/U∣=λ for all m≤n.
4. Compatibility with square
Solovay [16] showed that □δ fails when δ≥κ and κ is strongly compact. In contrast, we will show (∀δ≥κ)□δ is consistent with the kind of generically supercompact κ constructed in Section 2. The key difference is that nontrivial forcings may be absorbed into the quotient algebras of the ideals in the generic case.
We start with a model given by Section 2, force □, and show that dense ideals still exist. We will use the following variation on Foreman’s duality theorem [8].
Lemma 4.1**.**
Suppose I is a precipitous ideal on Z⊆P(X) and e:P→B(P(Z)/I) is a regular embedding. Suppose that for all generic G⊆B(P(Z)/I), if j:V→M⊆V[G] is the associated embedding and H=e−1[G], there is a filter H^∈V[G] that is j(P)-generic over M and such that j[H]⊆H^. Then there is a P-name for a precipitous ideal J on Z such that B(P∗P(Z)/J˙)≅B(P(Z)/I). Furthermore, J has the same completeness and normality properties as I.
Proof.
Let H be P-generic over V, and let G be B(P(Z)/I)-generic over V with e[H]⊆G. Let j:V→M be the generic ultrapower embedding, and let H^ be as hypothesized. Then j is uniquely extended to j^:V[H]→M[H^]. In V[H], let Q=B(P(Z)/I)/e[H], and let J={X⊆Z:1⊩Q[id]M∈/j^(X)}. Let ι:P∗P(Z)/J˙ be defined by ι(p,X˙)=e(p)∧∣∣[id]∈j^(X˙)∣∣.
It is easy to see that ι is order and antichain preserving. To see that the range of ι is dense, let A∈I+ be arbitrary. Take G with A∈G, so that [id]∈jG(A). If H=e−1[G], then some p∈H forces A∈J+. Let X˙ be a P-name such that p⊩X˙=Aˇ and q⊩X˙=Z whenever q⊥p; this makes sure X˙ is forced to be in J+. Then ι(p,X˙)≤A, since any G with e(p)∧∣∣[id]∈j^(X˙)∣∣∈G must have [id]∈j(A) and thus A∈G.
Suppose H∗Gˉ⊆P∗P(Z)/Iˉ is generic, and let G∗H^=ι[H∗Gˉ]. For A∈J+, A∈Gˉ iff [id]M∈j^(A). If i:V[H]→N=V[H]Z/Gˉ is the canonical ultrapower embedding, then there is an elementary embedding k:N→M[H^] given by k([f]N)=j^(f)([id]M), and j^=k∘i. Thus N is well-founded, so J is precipitous. If f:Z→Ord is a function in V, then k([f]N)=j(f)([id]M)=[f]M. Thus k is surjective on ordinals, so it must be the identity, and N=M[H^]. Since i=j^ and j^ extends j, i and j have the same critical point, so the completeness of J is the same as that of I. Finally, since [id]N=[id]M, I is normal in V iff J is normal in V[H], because j↾X=j^↾X, and normality is equivalent to [id]=j[X].
∎
For a cardinal δ, let Sδ be the collection of bounded approximations to a □δ sequence. That is, a condition is a sequence ⟨Cα:α∈η∩Lim⟩ such that η<δ+ is a successor ordinal, each Cα is a club subset of α of order type ≤δ, and whenever β is a limit point of Cα, Cα∩β=Cβ. For proof of the following lemma, we refer the reader to [4].
Lemma 4.2**.**
For every cardinal δ, Sδ is countably closed and (δ+1)-strategically closed and adds a □δ sequence ⟨Cα:α∈δ+∩Lim⟩=⋃G, where G⊆Sδ is the generic filter. For every regular λ≤δ, there is a Sδ-name for a “threading” partial order Tδλ that adds a club C⊆(δ+)V of order type λ and such that whenever α is a limit point of C, C∩α=Cα. Furthermore, Sδ∗Tδλ has a λ-closed dense subset of size 2δ.
Theorem 4.3**.**
Suppose κ is super-almost-huge and μ<κ is regular. Then there is a μ-distributive forcing extension in which κ=μ+, □λ holds for all cardinals λ≥κ, and for all regular λ≥κ there is a normal, fine, κ-complete, λ-dense ideal on Pκ(λ).
Proof.
By Section 2, we may pass to a μ-distributive forcing extension in which κ=μ+ and for all regular λ≥κ there is a normal, fine, κ-complete, λ-dense ideal on Pκ(λ), and GCH holds above μ. Over this model, force with P, the Easton support product of Sλ where λ ranges over all cardinals ≥κ. For every cardinal λ, P naturally factors into P<λ×P≥λ. Note that if λ≥κ, P≥λ is (λ+1)-strategically closed.
First we show that for each regular λ≥κ, P≥λ is λ+-distributive in VP<λ. Suppose that H0×H1 is (P<λ×P≥λ)-generic, and f:λ→Ord is in V[H0][H1]. Then in V[H1], there is a P<λ-name τ for f. By GCH and the fact that we take Easton support, ∣P<λ∣=λ, so it is λ+-c.c. in V[H1]. Thus τ may be assumed to be a subset of V of size λ. By the strategic closure of P≥λ, τ∈V. Thus f=τH0∈V[H0], establishing the claim.
Next we show that P preserves all regular cardinals. First note that since P is (κ+1)-strategically closed, P cannot change the cofinality of any regular δ to some λ≤κ. If P does not preserve regular cardinals, then in some generic extension V[G], there are λ<δ which are regular in V with κ<λ, such that V[G]⊨cf(δ)=λ. Let H=H0×H1, where H0⊆P<λ and H1⊆P≥λ. By the λ+-c.c. of P<λ, V[H0]⊨cf(δ)>λ, and by the λ+-distributivity of P≥λ in V[H0], V[H]⊨cf(δ)>λ, a contradiction. Since a square sequence is upwards absolute to models with the same cardinals and Sλ regularly embeds into P for all λ≥κ, P forces (∀λ≥κ)□λ.
For each regular λ≥κ, let Zλ=Pκ(λ). We want to show that in VP, for each regular λ≥κ, there is a normal, fine, λ-dense ideal on Zλ. It suffices to show that such an ideal exists in VP<λ, since P≥λ adds no subsets of λ, and ∣Zλ∣=λ. First note that by the strategic closure of P, the dense ideal on κ is unaffected.
Let Q be the Easton support product of Sλ∗Tλμ, where λ ranges over all cardinals. There is a coordinate-wise regular embedding of P into Q. When λ is regular, Q<λ has a dense μ-closed subset of size λ. Hence it regularly embeds into B(Col(μ,λ)). The dense ideal Iλ on Zλ in V has quotient algebra isomorphic to B(R×Col(μ,λ)) for some small R, and so Q<λ regularly embeds into this forcing.
If G⊆P(Zλ)/Iλ is generic, let H be the induced generic for P<λ, and let j:V→M⊆V[G] be the ultrapower embedding. Recall that crit(j)=κ, j(κ)=λ+, λ++ is a fixed point of j, and j[λ]∈M. First note that j[λ]∖j(κ) is an Easton set in M. If j(κ)≤δ≤j(λ) and δ is regular in M, then since ot(j[λ]∩δ)≤λ<δ, sup(j[λ]∩δ)<δ.
For each cardinal δ such that κ≤δ<λ, let ⟨Cαδ:α<δ+⟩ be the □δ sequence and let tδ be the “thread” of order type μ, both given by H↾(Sδ∗Tδμ). By the μ-distributivity of Sδ∗Tδμ, all initial segments of tδ are in V, and since they are small, j(tδ∩α)=j[tδ∩α] for α<δ+, and j is continuous at all limit points of tδ. Let γδ=sup(j[δ+])<j(δ+), and in M consider mδ=⋃α<δ+j(⟨Cαδ:β<α⟩)∪{(γδ,j[tδ])}. Each mδ is a condition in (Sj(δ))M, and the sequence m=⟨mδ:δ∈j[λ]∖κ∩CardM⟩ is a condition in (P<j(λ))M.
M thinks P<j(λ) is j(κ)-strategically closed, and this is true in V[G] as well since these models share the same λ-sequences, and j(κ)=λ+ in V[G]. Since j(λ+)<(λ++)V, P(P<j(λ))M has cardinality λ+ in V[G]. Thus we may use the winning strategy to build a filter H^⊆(P<j(λ))M that is generic over M, with m∈H^. Since m is a lower bound to j(p) for all p∈H, we have j[H]⊆H^.
Therefore, the hypotheses of Lemma 4.1 are satisfied with respect to Iλ, Zλ, and P<λ. Thus we have a P<λ-name for a normal and fine ideal Jλ on Zλ such that B(P<λ∗P(Zλ)/Jλ)˙≅B(P(Zλ)/Iλ). Hence Jλ is λ-dense in V[H].
∎
We note that in the case κ=ω1, P(Zλ)/Jλ≅B(Col(ω,λ)) for all regular λ. But for higher cardinals, Proposition 3.8 shows the quotient algebras must differ from those given by Theorem 2.18. The crux is that the “threading” forcings are left over as regular suborders.
It is not possible to improve this result to get the consistency of, for example, “For all cardinals λ≥ω1, □λ holds and there is a normal, fine, λ-dense ideal on Pω1(λ).” Burke and Matsubara [1] showed that if cf(λ)<κ and there is normal, fine, κ-complete, λ+-saturated ideal on Pκ(λ), then every stationary subset of λ+∩cof(<κ) reflects.
Bibliography16
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Douglas Burke and Yo Matsubara, Ideals and combinatorial properties , J. Symbolic Logic 62 (1997), no. 1, 117–122.
2[2] by same author, The extent of strength in the club filters , Israel J. Math. 114 (1999), 253–263.
3[3] Chen Chun Chang and H. Jerome Keisler, Model theory , third ed., Stud. Logic Found. Math., 73, North-Holland, 1990.
4[4] James Cummings, Matthew Foreman, and Menachem Magidor, Squares, scales and stationary reflection , J. Math. Log. 1 (2001), no. 1, 35–98.
5[5] Hans-Dieter Donder, Regularity of ultrafilters and the core model , Israel J. Math. 63 (1988), no. 3, 289–322.
6[6] Paul Erdős and Alfred Tarski, On families of mutually exclusive sets , Ann. of Math. 44 (1943), no. 2, 315–329.
7[7] Matthew Foreman, Ideals and generic elementary embeddings , Handbook of set theory (Matthew Foreman and Akihiro Kanamori, eds.), vol. 2, Springer, Dordrecht, 2010, pp. 885–1147.
8[8] by same author, Calculating quotient algebras of generic embeddings , Israel J. Math. 193 (2013), no. 1, 309–341.