We extend prior results of Cody-Eskew, showing the consistency of GCH with the statement that for all regular cardinals κ≤λ, where κ is the successor of a regular cardinal, there is a rigid saturated ideal on Pκλ. We also show the consistency of some instances of rigid saturated ideals on Pκλ where κ is the successor of a singular cardinal.
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
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications
Full text
More rigid ideals
Monroe Eskew
Kurt Gödel Research Center
University of Vienna
25 Währinger Strasse
1090 Wien, Austria.
Abstract.
We extend the results of [1], showing the consistency of GCH with the statement that for all regular cardinals κ≤λ, where κ is the successor of a regular cardinal, there is a rigid saturated ideal on Pκλ. We also show the consistency of some instances of rigid saturated ideals on Pκλ where κ is the successor of a singular cardinal.
1. Introduction
A structure is said to be rigid if it has no nontrivial automorphisms. It follows from the principle Martin’s Maximum (MM) that the boolean algebra P(ω1)/NS is rigid.111See [6], [9], [12]. An important component of this argument is that, under MM, this boolean algebra satisfies the ω2-c.c., or in other words NSω1 is saturated. Saturated ideals are a way for small cardinals to mimic some properties of very large cardinals, by being the critical points of elementary embeddings between relatively rich transitive models that come about via relatively mild forcing.222See [4] for background. The idea for rigidity in this context is to arrange that the forcing codes information into the manipulation of sufficiently absolute properties, which correlate to the details of the embedding, so that only one embedding can exist.
We will call an ideal I over a set X rigid when the quotient boolean algebra P(X)/I is rigid. In [1], Brent Cody and the author showed that it is possible to have rigid saturated ideals on other successor cardinals κ=μ+, by forcing an analogue of Martin’s Axiom. In these models, we have 2μ>κ, and so we also investigated whether one can have rigid saturated ideals with GCH. We were able to construct models of GCH with saturated rigid ideals on cardinals of the form κ=μ+, where μ is regular and uncountable, by having the ideal code information about manipulating the stationarity of subsets of μ. This technique is not possible for μ=ω, since the notion of stationarity trivializes there. Here, we introduce a different coding method that solves the case μ=ω and allows for a global result, which is not obviously achievable with the method of [1].
Theorem 1**.**
If ZFC is consistent with a huge cardinal, then there is a model of ZFC+GCH in which for every pair of regular cardinals κ≤λ, where κ is the successor of a regular cardinal μ, there is a normal κ-complete ideal I on Pκλ such that P(Pκλ)/I is rigid, λ+-c.c., and has a μ-closed dense subset.
Addressing the case of successors of singulars, we have:
Theorem 2**.**
Suppose θ is a huge cardinal and ν<θ is regular and uncountable. Then there is a forcing extension in which for some θ′<θ, Vθ′⊨ ZFC + GCH + “There is a singular cardinal μ of cofinality ν such that for every regular λ≥κ=μ+ there is a normal κ-complete ideal I on Pκλ such that P(Pκλ)/I is rigid and λ+-c.c.”
In Section 2, we introduce a certain restricted product of Lévy collapses which is rigid, preserves GCH, and changes a Mahlo cardinal into the successor of a chosen regular cardinal. We prove Theorem 1 in Section 3. In Section 4, we prove Theorem 2 and discuss why it is hard to combine the conclusions of the two theorems into one model.
The full generality of the following lemma is only applied in Section 4, but we state it here because its interest extends beyond the present topics.
Lemma 3**.**
Suppose κ is a regular uncountable cardinal, P is κ-c.c., Q is κ-strategically closed, and A˙ is a P-name for a structure of size κ in a language L˙. Suppose G⊆P is generic and that in V[G], S is a set of symbols, T is a set of sentences in L′=L∪S, and ∣T∣<κ. If Q forces over V[G] that there is an expansion A′ of A to the language L′ such that A′⊨T, then this is already true in V[G].
We note the following corollaries. Suppose κ,P,Q are as above.
(1)
In VP, Q cannot change the Σ11 theory of structures of size ≤κ with a language of size <κ.
2. (2)
In VP, Q preserves κ-c.c. partial orders.
3. (3)
In VP, Q preserves stationary subsets of κ.
4. (4)
If T is a tree of size ≤κ in VP and it has a cofinal branch in VP×Q, then it has a cofinal branch in VP.
5. (5)
If A is a rigid structure of size ≤κ in a language of size <κ in VP, then A is rigid in VP×Q.
We may assume that the domain of A is forced to be κ.
In VP let L′′ be the subset of L′ that is mentioned in T; we have ∣L′′∣<κ. In VP×Q, let A′′=A′↾L′′. In this extension, there is a club C⊆κ such that A′′↾α≺A′′ for all α∈C.
Let ⟨s˙i:i<δ<κ⟩ be a sequence of P-names for the elements of S˙∩L˙′′, and for each i<δ, let X˙i be a P×Q-name for the interpretation of si in A′. Let X˙ be a P×Q-name for a subset of κ which canonically codes ⟨Xi:i<δ⟩.
Let C˙ be a P×Q-name for the club C above. Let σ witness the strategic closure of Q.
Let (p00,q00) force some ordinal α00 to be in C˙, and decide whether 0∈X˙. Suppose we have a ⟨(p0i,q0i),α0i:i<j⟩ such that the p0i’s form an antichain, the q0i’s are a descending sequence following σ, the α0i’s are increasing, and (p0i,q0i) forces α0i∈C˙ and decides whether 0∈X˙. If the p0i’s do not form a maximal antichain, pick p0j,q0j,α0j such that for all i<j, p0j⊥p0i and α0j>α0i, q0j is a lower bound to the q0i’s following σ, and (p0j,q0j)⊩α0j∈C˙. If the antichain is maximal, let A0={p0i:i<j}, let q0 be a lower bound to the chain of q0i’s chosen according to σ, and let α0=supi<j(α0j+1). By the chain condition, this will occur at some j<κ.
Continue in this way, getting a sequence of maximal antichains in P, ⟨Ai:i<κ⟩, a descending sequence in Q that follows σ, ⟨qi:i<κ⟩, and an increasing continuous sequence of ordinals ⟨αi:i<κ⟩, such that for all i and all p∈Ai, (p,qi) decides whether i∈X˙, and if i is a limit, then (1,qi)⊩αi∈C˙.
Let G⊆P be generic. For each i<κ, there is a unique pi∈Ai∩G. Let
[TABLE]
We claim that interpreting the symbols si according to Y produces an expansion B of A that satisfies T.
There is a club of limit ordinals D⊆κ such that for all β∈D, αβ=β and β is closed under our coding scheme, in the sense that Y∩β codes a sequence ⟨Yiβ:i<δ⟩ of interpretations for ⟨si↾β:i<δ⟩. For such β, we have that (1,qβ)⊩A′′↾β≺A′′, and thus that A′′↾β⊨T. Since (pi,qβ) decides whether i∈X˙ for all i<β, qβ⊩QV[G]X˙∩β=Y∩β, and thus qβ⊩QV[G]B↾β=A′′↾β. Since ⟨B↾β:β∈D⟩ forms an elementary chain, B⊨T.
∎
2. A rigid collapse
This section is devoted to a proof of the following:
Theorem 4**.**
Suppose κ is a Mahlo cardinal and μ<κ is regular.
Then there is a μ-closed, κ-c.c. partial order RC⊆Vκ
forcing κ=μ+, and whenever G⊆RC is generic over V,
then in V[G], G is the unique filter which is RC-generic over V.
Let us start with a few well-known forcing facts. If P and Q are partial orders with maximum elements 1P and 1Q respectively, a map π:P→Q is called a projection if π(1P)=1Q, π is order-preserving, and π has the property that whenever q≤π(p), there is p′≤p such that π(p′)≤q. A map e:P→Q is called an embedding if it is order- and antichain-preserving. An embedding is regular if it preserves maximal antichains and dense if its range is a dense subset of the codomain. For every partial order P, there is a complete boolean algebra B(P) and a dense embedding d:P→B(P).
Lemma 5**.**
Suppose π:P→Q is a projection. If H⊆Q, we write P/H for π−1[H].
(1)
If G is P-generic over V and H=π[G], then H is Q-generic over V, and G is P/H-generic over V[H].
2. (2)
If H is Q-generic over V, and G is P/H-generic over V[H], then G is P-generic over V.
Lemma 6**.**
If d:P→Q is a dense embedding, then G is P-generic over V iff d[G] is Q-generic over V.
For a set of ordinals X and an ordinal α, we use [X]α to denote the collection of subsets of X of ordertype α.
Suppose V⊆W are models of set theory. We define the following
Σ1 statement about parameters in V:
[TABLE]
Informally, this says that there is a large subset of κ in W which
splits every μ-sized set from V by excluding arbitrarily large pieces of it from V.
In cases where the inner model in question is clear from context,
we will drop the third parameter and just write Spl(μ,κ).
Clearly, if V and W have the same [κ]μ, then W⊨¬Spl(μ,κ,V).
Lemma 7**.**
Suppose μ<κ are regular.
Then Col(μ,<κ) forces Spl(μ,κ).
Proof.
Let G⊆Col(μ,<κ) be generic. In V[G], define A={α<κ:⋃G(α,0)=0}. Let p∈Col(μ,<κ), α<μ, and x∈[κ]μ∩V be
arbitrary. Since ∣p∣<μ, there is y⊆x∖supp(p) of ordertype α. We can construct q≤p such
that for all β∈y, q(β,0)=0. Therefore, the set of conditions forcing witnesses to
Spl(μ,κ) is dense, so the desired statement is forced.
∎
Lemma 8**.**
Suppose ν<μ<κ are regular and α<ν<κ for all
α<κ. Then:
(1)
⊩Col(ν,<κ)¬Spl(μ,κ).
2. (2)
⊩Col(μ,<κ)¬Spl(ν,κ).
Proof.
(2) holds since Col(μ,<κ) does not change [κ]ν.
For (1), let A˙ be a Col(ν,<κ)-name for a set in [κ]κ.
Suppose q∈Col(ν,<κ) forces that for all x∈[κ]μ∩V,
there is y∈[x]ν∩V
that is disjoint from A˙. Let B be the set of α<κ such that there is some pα≤q such that pα⊩αˇ∈A˙. Let C∈[κ]κ be such that {pα:α∈C} forms a
Δ-system with root r≤q. Let x∈[C]μ, and suppose s≤r decides some y∈[x]ν to be disjoint from
A˙.
Since ∣supp(s)∣<ν,
there is some α∈y such that pα is compatible with s, so s
does not force that yˇ∩A˙=∅, a contradiction. Thus,
¬Spl(μ,κ) is forced.
∎
Recall that a set of ordinals X is Easton when for all regular cardinals κ, sup(κ∩X)<κ. Below, a superscript E above a product will indicate that we take all partial functions with Easton support.
Lemma 9**.**
Suppose κ is Mahlo. Let X⊆κ be a set of regular cardinals such that for some regular μ<κ,
μ+∈/X.
Then the partial order
[TABLE]
is κ-c.c. and forces ¬Spl(μ+,κ).
Proof.
We establish the κ-c.c. using Δ-systems.
Let {pα:α<κ}⊆P.
For each α<κ, there is β<κ such that
[TABLE]
Let βα denote the least such β, and
let C⊆κ be a club closed under the function α↦βα.
Note that for all α<κ and for all regular β<κ, there is γ<β such that
pα↾β∈P↾γ.
Since κ is Mahlo, there is a γ∗<κ and a stationary S⊆C such that
for all α∈S, pα↾α∈P↾γ∗.
Since ∣P↾γ∗∣<κ, there is a stationary S′⊆S
and p∗∈P↾γ∗ such that pα↾α=p∗ for all
α∈S′. If α<β are in S′, then pβ↾dompα=p∗,
so pα and pβ are compatible.
Now note that
[TABLE]
and P1 is μ++-closed.
Let G1⊆P1 be generic and work in V[G1]. Suppose q⊩P0V[G1]A˙∈[κ]κ. When possible, let pα≤q be such that pα⊩α∈A˙.
Let ⟨αi:i<κ⟩ enumerate the set of α for which pα is defined.
Since each condition in P0 has size <μ,
we can find a stationary S⊆κ∩cof(μ) such that {pαi:i∈S} forms a Δ-system with root r≤q as above.
As in the proof of Lemma 8, for every y∈[S]μ and every s≤r,
s⊮{αi:i∈y}∩A˙=∅, since ∣s∣<μ.
This shows that P0 forces ¬Spl(μ+,κ,V[G1]) over V[G1].
Since ([κ]μ+)V=([κ]μ+)V[G1], P forces ¬Spl(μ+,κ,V).
∎
Suppose κ is Mahlo and μ<κ is regular. We define the rigid collapse RC of κ to μ+ as a projection of a product of Lévy collapses. Let Reg denote the class of regular cardinals.
Let
[TABLE]
P can be viewed as the set of partial functions p:κ3→κ such that:
(1)
{α:(∃β)(∃γ)(α,β,γ)∈domp} is an Easton set of regular cardinals contained in [μ,κ).
2. (2)
(∀α)∣{β:(∃γ)(α,β,γ)∈domp}∣<α.
3. (3)
(∀α)(∀β){γ:(α,β,γ)∈domp}∈[α]<α.
4. (4)
(∀α)(∀β)(∀γ)p(α,β,γ)<β.
Enumerate quadruples of ordinals by putting α<β when maxα<maxβ, or if not, α is lexicographically less than β. For every infinite cardinal α, this enumeration has ordertype α. Let f:κ→κ4 be the restriction of this enumeration to κ.
A generic filter G for P, or any suborder, is determined by the collection
[TABLE]
and thus by a subset of κ via f.
We want to define RC so that it absorbs other versions itself where we alter the choice of the cardinal μ but keep κ the same. In order to arrange this, we divide the regular cardinals below κ into countably many pieces as follows.
Let A0 be the set:
[TABLE]
For n>0, let An be the set:
[TABLE]
We will inductively define iterations P0∗⋯∗Pn which are the images of commuting projections from the respective P↾⋃m≤nAm. Let P0=P↾A0.
Let ⟨αi:i<κ⟩ enumerate the singular cardinals of cofinality μ in (μ,κ) in increasing order.
Suppose G0⊆P0 is generic over V. Let X0 be the subset of κ that codes G0 via f as above. Let
B1={αi++:i∈X0}×κ2⊆A1, and let P1=P↾B1.
Claim 10**.**
In V[G0], the map p↦p↾B1 is a projection from P to P1.
Proof.
Suppose q≤p↾B1. Then q=p′↾B1 for some p′ such that p′(α,β,γ)=p(α,β,γ) whenever (α,β,γ)∈B1∩domp.
Let d=domp′∖domp, and define p′′=p∪(p′↾d).
Then p′′≤p, and p′′↾B1=q.
∎
Claim 11**.**
If i∈/X0, then ⊩P1V[G0]¬Spl(αi++,κ,V).
Proof.
If i∈/X0, then the same argument for the previous claim shows that in V[G0], there is a projection
π:P↾A1∖({αi++}×κ2)→P1.
Lemma 9 implies that any generic extension by P↾(κ∖{αi++})×κ2 satisfies ¬Spl(αi++,κ,V).
If G1 is P1-generic over V[G0], then a further forcing gives a generic H⊆P↾(κ∖{αi++})×κ2 over V.
Since Spl(αi++,κ,V) is a Σ1 property of parameters from V, ¬Spl(αi++,κ,V) holds in V[G0][G1].
∎
Claim 12**.**
Whenever G0∗G1 is P0∗P1-generic over V, and G0′∗G1′∈V[G0∗G1] is also
P0∗P1-generic over V, then G0=G0′.
Proof.
Suppose otherwise. Let X0 and X0′ be the subsets of κ corresponding to G0 and G0′ respectively.
There must be some ordered quadruple (α,β,γ,δ)∈G0′∖G0, and thus some
i∈X0′∖X0. By the definition of P1 and Lemma 7, V[G0′∗G1′]⊨Spl(αi++,κ,V). But by the previous claim, V[G0∗G1]⊨¬Spl(αi++,κ,V).
This is impossible, as Spl(αi++,κ,V) is Σ1 in parameters from V, and V[G0′∗G1′]⊆V[G0∗G1].
∎
Now we simply continue this process ω many times. Suppose that we have sequences
⟨Pj:j<n⟩,
⟨Xj:j<n⟩, and
⟨Bj:1≤j≤n⟩,
such that for m<n,
(1)
Xm is a (P0∗⋯∗Pm)-name for the subset of κ which codes the generic Gm
for Pm via f, and Bm+1 is a name for {αi+m+2:i∈Xm}×κ2⊆Am+1.
2. (2)
It is forced by P0∗⋯∗Pm−1 that Pm=P↾Bm, and p↦p↾Bm is a projection.
We extend these properties to sequences of length n+1 using the same argument as in Claim 10.
Now we define RC as a limit of this sequence. The elements of RC are just the elements of P↾⋃n<ωAn, but their ordering is different. We put p≤RCq when for each n,
[TABLE]
The ordering extends the superset ordering on P.
Note that this only defines a preorder since we may have distinct conditions p,q∈P↾⋃n<ωAn such that for all n,
⟨p↾A0,…,pˇ↾B˙n⟩⊩P0∗⋯∗Pnpˇ↾B˙n+1=qˇ↾B˙n+1. As usual, we may take the quotient by the equivalence relation defined by p∼q when p≤q≤p. Modulo this equivalence relation, we have for each n, RC↾⋃m≤nAm is isomorphic to a dense subset of P0∗⋯∗Pn.
We want to show that the identity map from P↾⋃n<ωAn to RC is a projection. Suppose q≤RCp.
As before, let d=domq∖domp,
and define p′=p∪(q↾d) so that p′≤Pp.
We must have p′↾A0=q↾A0⊇p↾A0.
It follows by induction that for each n>0,
⟨q↾A0,…,qˇ↾B˙n⟩⊩P0∗⋯∗Pnpˇ′↾B˙n+1=qˇ↾B˙n+1⊇pˇ↾B˙n+1,
and thus p′ is equivalent to q in RC.
To show rigidity, suppose G⊆RC is generic over V, and G′∈V[G] is also RC-generic over V.
Let n be least such that G↾An=G′↾An.
As above, there is i∈Xn′∖Xn.
Suppose p∈G forces i∈/Xn. Then there is a projection
[TABLE]
A further forcing yields a filter H⊆P↾(κ∖{αi+n+2})×κ2,
which is generic over V, and such that V[G]⊆V[H]. By Lemma 9,
V[H]⊨¬Spl(αi+n+2,κ,V), and so must V[G′]. But by the construction and Lemma 7,
V[G′]⊨Spl(αi+n+2,κ,V), a contradiction.
To complete the proof of Theorem 4, we only need to show μ-closure.
Lemma 13**.**
Any directed subset of RC of size <μ has an infimum.
Proof.
Suppose ν<μ and ⟨pi:i<ν⟩ is such a set.
Let d be the set of (α,β,γ)∈⋃i<νdompi such that there are no i<j<ν with pi(α,β,γ)=pj(α,β,γ). Let p∗=⋃i<νpi↾d. We show by induction on n<ω that p∗↾⋃m≤nAm=infi<ν(pi↾⋃m≤nAm) in RC. For n=0, this is true since the functions pi↾A0 for all i<ν all agree on the points in common to their domains.
Suppose this is true for n. Let G⊆P0∗⋯∗Pn be generic with ⟨p∗↾A0,…,pˇ∗↾B˙n⟩∈G. By induction, ⟨pi↾A0,…,pˇi↾B˙n⟩∈G for all i<ν, so by directedness, {pi↾Bn+1:i<ν} is a set of pairwise compatible partial functions on Bn+1.
No two pi,pj can disagree at a point in Bn+1,
so Bn+1⊆d. Therefore ⋃i<νpi↾Bn+1=p∗↾Bn+1, and this is evidently the greatest lower bound of the pi↾Bn+1 for i<ν. As G was arbitrary, the desired statement is forced at n+1.
∎
If G⊆RC is generic, then P/G is equivalent to P↾κ3∖(A0∪⋃n≥1Bn).
Therefore we have:
Proposition 14**.**
If G⊆RC is generic, then P/G is μ-directed-closed.
The rigidty of RC is relatively robust:
Lemma 15**.**
Suppose ∣Q∣<κ. If G⊆RC is generic and H⊆Q is generic over V[G], then in V[G][H], G is still the only filter which is RC-generic over V.
Proof.
Suppose the contrary. If G′∈V[G][H] were another RC-generic filter, then there would be some regular ν<κ such that V[G′]⊨Spl(ν,κ,V) and V[G]⊨¬Spl(ν,κ,V). Let A˙ be a P-name in V[G] for a set forced to witness Spl(ν,κ,V). Since ∣Q∣<κ, there is B∈V[G] of size κ and p∈H such that p⊩Bˇ⊆A˙. However, B also witnesses Spl(ν,κ,V), since for any x∈[κ]ν∩V and any α<ν, there is y∈[x]α∩V such that A˙H∩y=∅, and thus B∩y=∅. Contradiction.
∎
The construction above of P, An, Xn, Bn, Pn, and RC were relative to parameters μ and κ, so let us indicate this by writing P(μ,κ), RC(μ,κ), etc., and let us write Q(μ,κ) for P(μ,κ)↾⋃n<ωAn(μ,κ).
We would like to record some useful facts about projections between different rigid collapses:
Lemma 16**.**
Suppose μ<κ≤λ<δ are regular and λ is inaccessible.
(1)
There is a projection
σ:RC(μ,δ)→RC(μ,κ)×Q(λ,δ)
2. (2)
If π:RC(μ,δ)→RC(μ,κ) is given by the first coordinate of the output of σ, and X⊆RC(μ,δ) is a directed set of size <μ, then π(infX)=infπ[X].
Proof.
Note that for each n and all regular cardinals α<β<γ, An(α,γ)∩Vβ=An(α,β), so we write Anα for the class ⋃β∈OrdAn(α,β).
The map σ is defined by σ(p)=(p↾κ3,p↾⋃n<ωAnλ). The second coordinate works because ⋃n<ωAnλ⊆A0μ. (The fact that λ is inaccessible ensures that A0λ⊆A0μ.)
For the first coordinate, the key point is that the enumeration of quadruples of ordinals was canonical.
We show by induction on restrictions to the sets Anμ that
(a)
p≤RC(μ,δ)q implies p↾κ3≤RC(μ,κ)q↾κ3, and
2. (b)
p≤RC(μ,κ)q↾κ3 implies p∪q↾(δ3∖κ3)≤RC(μ,δ)q.
The base case is clear since the ordering restricted to A0μ is just the superset relation. Suppose this is true for partial functions whose domains are contained in ⋃m<nAmμ.
Suppose first p,q∈P(μ,δ)↾⋃m≤nAmμ, and p≤RC(μ,δ)q. We must show p↾κ3≤RC(μ,κ)q↾κ3. If p⊇q, then we are done, so the only situations to worry about are the points (α,β,γ)∈domq∩Anμ∩κ3 such that p(α,β,γ)=q(α,β,γ). For such a point, it must be the case that some value of p↾⋃m<nAmμ forces some ordinal j to be not in Xn−1, where α=αj+n+1. This is determined by the enumeration of quadruples of ordinals, and the increasing enumeration of the singular cardinals of cofinality μ, both of which have the property that the enumeration up the rank κ is an initial segment of the one up to rank δ. Thus, it is information in p∩Vκ that decides α is excluded from Xn−1, and the same data decide the same result in RC(μ,κ). We conclude that p↾κ3≤RC(μ,κ)q↾κ3, and (a) follows by induction. The same argument shows (b), and together these imply that p↦p↾κ3 is a projection from RC(μ,δ) to RC(μ,κ).
To show (2), let X⊆RC(μ,δ) be a directed set of size <μ. The proof of Lemma 13 shows that infX is given by ⋃X∖B, where B={(α,β,γ,δ):(∃p,q∈X)p(α,β,γ)=q(α,β,γ)}. π[X] is also directed, and thus has an infimum in RC(μ,κ) defined by the same operation, ⋃π[X]∖B. Thus,
π(infX)=(⋃X∖B)↾κ3=⋃p∈Xp↾κ3∖B=infπ[X].
∎
Suppose P is a partial order and Q˙ is a partial order in VP. The termspace forcing, T(P,Q˙) is the collection of P-names for elements of Q (in Hθ, where θ is regular and P,Q˙∈Hθ), ordered by q˙1≤q˙0 iff 1⊩Pq˙1≤q˙0. It is easy to see that if Q˙ is forced to be κ-closed, then T(P,Q˙) is κ-closed. This idea is due to Laver, and we show now a slight generalization of the main lemma which Laver proved about this notion.
Lemma 17**.**
Suppose π:P→R is a projection, and Q˙ is an R-name for a partial order. Then Q˙ can be interpreted as a P-name, and the identity map is a projection from P×T(R,Q˙) to P∗Q˙.
Proof.
Suppose (p0,q˙0)∈P×T(R,Q˙), and (p1,q˙1)≤P∗Q˙(p0,q˙0). Find p2≤p1 and an R-name q˙2 such that p2⊩q˙1=q˙2. Then build an R-name q˙3 such that π(p2)⊩q˙3=q˙2 and r⊩q˙3=q˙0 whenever r⊥π(p2). Then (p2,q˙3)≤P∗Q˙(p1,q˙1), since whenever H is generic for P with p2∈H, then q˙3π[H]=q˙2π[H]=q˙1H. Furthermore, 1⊩Rq˙3≤q˙0. For let G be generic for R. If π(p2)∈/G, then q˙3G=q˙0G. If π(p2)∈G, then we can do further forcing to produce H generic for P, with G=π[H]. Since p2⊩q˙3=q˙2=q˙1≤q˙0, it must already be true in V[G] that q˙3G≤q˙0G.
∎
Shioya [11] showed that if κ is regular and P is a κ-c.c. partial order of size ≤κ, then for every δ such that δ<κ=δ, there is a dense embedding d:Col(κ,<δ)→T(P,Col˙(κ,<δ)). The same argument shows the following for our Easton products of Lévy collapses:
Lemma 18**.**
Assume GCH, κ is regular, and R is a κ-c.c. partial order of size ≤κ. Then for every regular δ≥κ, there is a dense embedding d:Q(κ,δ)→T(R,Q˙(κ,δ))
We also need the following folklore result:333See [2].
Lemma 19**.**
If κ is a regular cardinal and P is a κ-closed partial order forcing ∣P∣=κ, then there is a dense embedding d:Col(κ,∣P∣)→P.
Corollary 20**.**
Suppose μ<κ≤λ<δ are regular, κ is Mahlo, and λ is inaccessible. Suppose ∣P∣<κ and σ is a P×RC(μ,κ)-name for a projection from Col(κ,λ) to some partial order R˙, which is forced to be λ-c.c.
Then there is a projection
Combining these gives us a projeciton π2 from the codmain of π1 to
[TABLE]
Finally, in V(P×RC(μ,κ))∗R˙, there is a projection π3:Q(λ,δ)→RC(λ,δ). Applying this to the last term above yields the desired projection.
∎
A close examination of the construction of the above projection reveals:
Proposition 21**.**
Suppose that in the hypotheses of the previous corollary, P is ν-distributive, for some ν≤μ. If G is generic for the image of the projection, then the quotient forcing RC(μ,δ)/G is ν-directed-closed.
3. Saturated rigid ideals
Let us recall some basic facts about saturated ideals, proof of which can be found in [4]. An ideal I on Z⊆P(λ) is normal when for all sequences ⟨Aα:α<λ⟩⊆I, the diagonal union, ∇α<λ:={z:(∃α)α∈z∈Aα}, is in I as well. Least upper bounds in the boolean algebra P(Z)/I are given by diagonal unions. Therefore, if P(Z)/I has the λ+-chain condition—synonymously, I is saturated—then P(Z)/I is a complete boolean algebra. Whenever G⊆P(Z)/I is generic, then the generic ultrapower VZ/G is well-founded and closed under λ-sequences from V[G]. (I is called precipitous it always yields well-founded generic ultrapowers.)
A cardinal κ is called huge if it is the critial point of an elementary embedding j:V→M, where M is a transitive class such that Mj(κ)⊆M. A cardinal is called almost-huge when we only require M<j(κ)⊆M. We will need the following facts about almost-huge embeddings, which can be found in [8]:
Lemma 22**.**
Suppose κ is almost-huge, witnessed by an embedding sending κ to δ. Then there is an elementary j:V→M with the following properties:
(1)
The embedding is generated by a tower of measures T⊆Vδ, which we will call a (κ,δ)-tower.
The fact that T generates such an embedding is equivalent to a first-order property of (Vδ,∈,T).
2. (2)
critj=κ, j(κ)=δ, and M<δ⊆M.
3. (3)
supj[δ]=j(δ)<δ+.
The following is proven by standard reflection arguments:
Proposition 23**.**
If κ is huge, then there is an unbounded set A⊆κ such that for every α<β in A, there is an (α,β)-tower.
Lemma 24**.**
Suppose μ<κ≤λ<δ, P and R˙ are as in the hypothesis of Lemma 20. Suppose additionally there is a (κ,δ)-tower and (P×RC(μ,κ))∗R˙ preserves the regularity of some γ∈[κ,λ]. Then there is a projection
[TABLE]
and whenever G is generic for the righthand side, then in V[G] there is a normal κ-complete ideal I on Pκγ such that P(Pκγ)/I≅(P×RC(μ,δ))/G.
Proof.
In VP×RC(μ,κ), there is a dense embedding d:Col(κ,λ)→Col(κ,λ)×(R∗Col˙(γ,λ)). Combining this with the projection of Lemma 20 gives the desired projection.
Suppose
[TABLE]
is generic over V.
We may force further to produce G^ that is P×RC(μ,δ)-generic and projects to G∗h0∗(h1×H). If j:V→M is an almost-huge embedding generated by a (κ,δ)-tower, then we may extend the embedding to j:V[G]→M[G^]. By the δ-c.c. of RC(μ,δ), M[G^]<δ∩V[G^]⊆M[G^].
G^ absorbs a generic h⊆Col(κ,λ)V[G] that projects to h0∗h1. Since Col(δ,j(λ))M[G^] is δ-directed closed, and j[h] is a directed subset of size <δ, we can take a lower bound q∗∈Col(δ,j(λ))M[G^]. Since M[G^]⊨2j(λ)<j(δ), and j(δ)<(δ+)V, we can build a generic h^ for Col(δ,j(λ))M[G^] in V[G^] below q∗. This projects to an M[G^]-generic h^0∗h^1⊆j(R)∗Col˙(j(γ),j(λ)), and thus we may extend the embedding again to j:V[G∗h0∗h1]→M[G^∗h^0∗h^1].
For each regular α∈(λ,δ), let mα=infj[H↾α3]. The proof of Lemma 13 shows that mα is given by ⋃{j(p):p∈H↾α}∖B, where B is the set of coordinates where there is some disagreement between two of the partial functions. Thus we may assume mα=mβ↾j(α)3 for α<β. Since M[G^∗h^0]⊨RC(j(λ),j(δ)) is j(δ)-c.c., and j(δ)<(δ+)V, we can enumerate all maximal antichains of this partial order in V[G^] as ⟨Aα:α<δ⟩. For each Aα, there is a regular βα<δ such that Aα⊆RC(j(λ),j(βα))M[G^∗h^0]. We may assume the βα’s are increasing. We can inductively build a descending chain ⟨qα:α<δ⟩⊆RC(j(λ),j(δ))M[G^∗h^0] such that:
(1)
For each α, qα∈RC(j(λ),j(βα))M[G^∗h^0].
2. (2)
For each α, qα⊇mβα, and qα≤r for some r∈Aα.
3. (3)
For α<α′, qα⊆qα′.
Suppose the construction has proceeded up to ξ. For each i<ξ, mβξ↾βi3=mβi⊆qi, and thus qξ′:=⋃i<ξqi∪mβξ is a condition. Find some r∈Aα compatible with qξ′, and let qξ⊇qξ′ be stronger than r. In the end, this generates a filter H^ which is generic over M[G^∗h^0∗h^1] and includes j[H]. Thus we can extend the embedding to j:V[G∗h0∗(h1×H)]→M[G^∗h^0∗(h^1×H^)].
In V[G∗h0∗(h1×H)], we define a normal ideal I by X∈I iff ⊩j[γ]∈/j(X). The map e:[X]I↦∣∣j[γ]∈j(X)∣∣ is easily seen to be an embedding of P(Pκγ)/I into B(G∗h0∗(h1×H)P×RC(μ,δ)). Since the latter is δ-c.c. and δ=γ+, I is saturated. Let ⟨Aα:α<γ⟩ be a maximal antichain in P(Pκγ)/I. Then it is forced that j[γ]∈j(∇α<γAα), so by the definition of diagonal unions it is forced that for some α<γ, j[γ]∈j(Aα). Thus e is a regular embedding.
If U⊆P(Pκγ)/I is generic over V[G∗h0∗(h1×H)], then there is an elementary embedding i:V[G∗h0∗(h1×H)]→N, where N is transitive. By further forcing, we obtain an extension of the ground-model embedding j as above, and we have an elementary embedding k:N→M[G^∗h^0∗(h^1×H^)] defined by k([f]U)=j(f)(j[γ]). The definition of e guarantees that k is elementary, and clearly j(x)=k(i(x)) for all x∈V[G∗h0∗(h1×H)].
Since μ is fixed by j and δ=(μ+)N=i(κ)=j(κ), we have crit(k)>δ. Therefore, whenever U⊆P(Pκγ/I) is generic and we proceed to produce j and k, we have i(G)=j(G)=G^ as above, so no further forcing is needed to get a generic for G∗h0∗(h1×H)P×RC(μ,δ). Furthermore, for every condition p in the quotient forcing, a generic U can be taken yielding a generic G^ with p∈G^. If [X]I forces p∈G^, then e([X]I)≤p. Thus e is a dense embedding, and the conclusion follows.
∎
Suppose θ is huge, and let A⊆θ be as in Proposition 23. Let κ be the first inaccessible limit point of A, and let ⟨αi:i<κ⟩ be the increasing enumeration of the closure of A∩κ∪{ω}.
We define the following Easton-support iteration P=⟨Pi,Q˙i:i<κ⟩. As usual, P0 is the trivial partial order. Let P1=Q0=RC(ω,α1). If i is a successor ordinal, let Pi+1=Pi∗Q˙i=Pi∗RC˙(αi,αi+1).
If i<κ is a limit ordinal, then αi is singular. Let λi be the first inaccessible in (αi,αi+1). Let Qi˙ be a Pi-name for Col(αi+,λi)×RC(λi,αi+1).
The following are easy to see:
(1)
If i is a successor, Pi is αi-c.c., and P/Pi is αi-closed.
2. (2)
If i is a limit, Pi is λi-c.c., and P/Pi is αi+-closed.
3. (3)
P preserves the inaccessbility of κ.
4. (4)
P forces that the set of infinite cardinals below κ is {αi:i<κ}∪{αi+:i<κ is a limit}.
Let i<j<κ be successor ordinals.
Since ∣Pi−1∣<αi, it preserves the existence of an (αi,αj)-tower. In VPi−1, the forcing Pj/Pi−1 takes the form:
[TABLE]
where ∣Q∣<αi, R˙ is forced to be αi-closed and λ-c.c., γ≤λ is forced to be regular, and λ<αj is inaccessible in the ground model. (If i−1 is a limit, Q=Col(αi−1+,λi−1), and Q is trivial otherwise. If j−1 is a limit, then γ=αj−1+ and λ=λj−1; otherwise γ=λ=αj−1.) Thus Lemma 24 applies, and Pj forces that there is a normal αi-complete ideal I on Pαiγ with quotient algebra equivalent to (Q×RC(αi−1,αj))/G, where G is the generic for Pj/Pi−1.
Suppose that, in VPj, there is a nontrivial automorphism of P(Pαiγ)/I. Let V′=VPi−1. Forcing with P(Pαiγ)/I and applying the automorphism would produce a Q×RC(αi−1,αj)-extension of V′ with two distinct generics, g×G and g′×G′. Since Q is contained in the projection of the forcing to Pj/Pi−1, we have g=g′. Lemma 15 implies that V′[g][G] has only one filter which is RC(αi−1,αj)V′-generic over V′[g], so G=G′, contradicting the assumption.
Lemma 3 implies that the αj-closed quotient forcing P/Pj preserves that the αj-sized boolean algebra P(Pαiγ)/I is αj-c.c. and rigid.
Finally, Proposition 21 justifies the claim that P(Pαiγ)/I is equivalent to a ν-closed forcing, where ν=αi−1+ if i is a limit, and ν=αi−1 otherwise. Cutting the universe at κ produces a model of Theorem 1.
∎
We would have a bit of an easier time if we did not concern ourselves with saturated ideals on Pκλ, for λ successor of singular. We could just let Qi be RC(αi+,αi+1) at limit i, and use a simpler version of Lemma 16.
4. Successors of singulars
It is a well-known theorem of Laver [10] that the supercompactness of a cardinal κ can be made indestructible under κ-directed-closed forcing. An examination of his proof reveals the following more specific result, which we will use:
Theorem 25** (Laver).**
Suppose κ is supercompact. There is an iteration I=⟨Ii,J˙i:i<κ⟩⊆Vκ with the following property: Whenver G⊆I is generic over V, Q is a κ-directed-closed forcing in V[G] of size ≤λ, and H⊆Q is generic over V[G], then in V[G∗H], there is a normal κ-complete ultrafilter U on Pκλ such that jU(G)↾(κ+1)=G∗H, and jU(I)/(G∗H) is λ+-closed.
Start in a model V′ in which θ is huge and ν<θ is regular and uncountable. Let A⊆θ be as in Proposition 23. Let μ>ν be such that Vθ⊨μ is supercompact, and let η be the first inaccessible limit point of A above μ. Let ⟨αi:i<η⟩ be the increasing enumeration of the closure of {μ}∪(A∖μ)∩η. First force with Laver’s partial order over V′ to obtain a model V=V′[G]. This preserves all the (α,β)-towers for α<β from A∖(μ+1).
Next, we define an Easton-support iteration, P=⟨Pi,Q˙i:i<η⟩. Let Q0=RC(μ,α1). If i is a successor ordinal, let Q˙i be a Pi-name for RC(αi,αi+1). If i is a limit ordinal, let λi be the first inaccessible in (αi,αi+1), and let Qi˙ be a Pi-name for Col(αi+,λi)×RC(λi,αi+1).
Suppose λ is forced to be a regular cardinal in (μ,η) after this iteration, let i be least such that αi>λ. Put κ=α1 and δ=αi. It suffices to prove that there is a Pi-name for an δ-c.c. forcing Q˙ such that Pi∗Q˙ forces cf(μ)=ν, and Pi∗Q˙ forces that there is a normal, κ-complete, rigid, saturated ideal on Pκλ. For then, since Q is δ-c.c. and P/Pi is δ-closed in Pi, P/Pi adds no subsets of λ over VPi∗Q˙ by Easton’s Theorem, and Lemma 3 shows that the saturation and rigidity of the ideal is preserved by P/Pi.
By Lemma 24, Pi forces that there is a normal κ-complete ideal Iλ on Pκλ such that P(Pκλ)/Iλ≅B(RC(μ,δ)/Pi). We use the following to analyze what happens to our ideal after further forcing:
If I is a κ-complete precipitous normal ideal on Z⊆P(λ) and P is κ-c.c. Let Iˉ denote the ideal generated by I in VP, and let j denote the generic ultrapower embedding associated to forcing with P(Z)/I. There is an isomorphism
[TABLE]
defined by ι(p,X˙)=(1,j(p)˙)∧∣∣j[λ]∈j(X˙)∣∣.
Let Hi be Pi-generic over V, and let H=Hi↾RC(μ,κ). By Laver’s Theorem, let U be a μ-complete normal ultrafilter on Pμκ in V[H] such that jU(G)↾(μ+1)=G∗H. We force with the Radin forcing Qν derived from U in V[H] to change the cofinality of μ to ν. Let us describe some of the important details of this forcing, which can be found in [7]:
(1)
Qν can be written as ⋃i<μXi, where each Xi consists of pairwise compatible elements. Thus Qν is κ-c.c.
2. (2)
Qν preserves that μ is a limit cardinal and that ν is regular.
3. (3)
Qν is definable from the ultrafilter U. More specifically, Qν is constructed from a sequence u of μ-complete measures on Vμ, of length ν, each derived from the ultrapower embedding jU. The first nontrivial measure of u is u(1)={X⊆Vμ:μ∈jU(X)}.
4. (4)
Qν adds a club C⊆μ of ordertype ν, with the property that whenever X∈u(1), there is some β<μ such that C∖β⊆X.
5. (5)
The generic filter for Qν can be recovered from C.
Although the forcing Pi/H adds subsets of κ and thus makes U no longer an ultrafilter on Pμκ, Pi/H adds no subsets of μ nor Qν-names for subsets of μ.
By item (1) above, Theorem 26 implies that forcing with Qν over V[Hi] preserves the saturation of Iλ. For it suffices to show that if G∗ is generic for P(Pκλ)/Iλ and j:V[Hi]→M⊆V[Hi][G∗] is the generic ultrapower embedding, then j(Qν) is j(κ)-c.c. in V[Hi][G∗]. Since the property of being the union of μ many sets of pairwise-compatible elements is upwards-absolute, this follows.
Let us argue that rigidity is preserved.
Let e:Qν→B(P(Pκλ)/Iλ∗j(Qν)˙) be the restriction of the isomorphism ι to Qν. Let K⊆Qν be generic. We have that P(Pκλ)/Iˉλ≅B(P(Pκλ)/Iλ∗j(Qν)˙)/e[K]. If there were a nontrivial automorphism of P(Pκλ)/Iˉλ in V[Hi][K], then we would have a forcing extension of V by RC(μ,δ)∗j(Qν)˙ with two distinct generics, H^0∗K^0 and H^1∗K^1, such that V[H^0∗K^0]=V[H^1∗K^1].
Now, since μ is below the critical point of the generic embedding j, the club C⊆μ associated to K is the same as those associated to both K^0 and K^1, by the way the isomorphism ι is defined. H^0 and H^1 determine generic ultrapowers j0,j1 of V associated to the ideal Iλ. If H^0=H^1, then j0(Qν)=j1(Qν), and thus K^0=K^1 since these are definable from C and the forcing j0(Qν). So we must have H^0=H^1.
Let β<δ be such that H^0 includes a generic for Col(β,<δ) and H^1 does not, so that V[H^0]⊨Spl(β,δ,V), and V[H^1]⊨¬Spl(β,δ,V). Both j0(Qν) and j1(Qν) are determined by normal ultrafilters U^0,U^1 on Pμδ that live in V[H^0],V[H^1] respectively. Recall that V=V′[G], where G⊆Vμ is generic for Laver’s partial order. If i0:V[H^0]→N0 and i1:V[H^1]→N1 are the respective ultrapower embeddings, then by Laver’s Theorem, we have that i0(G)↾(μ+1)=H^0, and i1(G)↾(μ+1)=H^1. Let N0=N0′[i0(G∗H^0)] and N1=N1′[i1(G∗H^1)]. Since the tail-ends of the respective iterations are sufficiently closed, we have that N0⊨Spl(β,δ,N0′[G]) and N1⊨¬Spl(β,δ,N1′[G]).
Let s0,s1 be surjections from μ to β such that s0∈V[H^0] and s1∈V[H^1]. We have that β=ot(i0(s0[μ]))=ot(i1(s1[μ])). Therefore, if u0 and u1 are the measure sequences associated to j0(Qν),j1(Qν) respectively, then have that
[TABLE]
and
[TABLE]
Now, both s0 and s1 are in V[H^0∗K^0]. Since μ has uncountable cofinality in this model, there is a club D⊆μ such that for all α∈D, s0[α]=s1[α]. Therefore, there is a point α∈D∩C and a γ<α+ such that V[H^0]⊨Spl(γ,α+,V′[G↾α]) and V[H^1]⊨¬Spl(γ,α+,V′[G↾α]). But since V[H^0] and V[H^1] have the same P(α+), this is a contradiction. This completes the proof of Theorem 2.
The conclusion of Theorem 1 does not hold in the model of Theorem 2 constructed above. This is because it is at odds with the use of Radin forcing. Recall that the weak square principle at κ, abbreviated □κ∗, asserts that there is a sequence ⟨Cα:α<κ+⟩ such that:
(1)
Each Cα is a collection of club subsets of α, and ∣Cα∣≤κ.
2. (2)
If C∈Cα, and β∈limC, then C∩β∈Cβ.
If μ is inaccessible in some inner model with the same μ+, as in the proof of Theorem 2, then it is easy to show that □μ∗ holds. The following proposition shows that the conclusion of Theorem 1 implies that □μ∗ fails for every singular μ. The argument is essentially the same as that for Theorem 10.1 in [3], but with slightly different hypotheses, and has nothing to do with rigidity.
Proposition 27**.**
Suppose κ=μ+, μ is regular, and λ>κ is a strong limit cardinal of cofinality <μ. If there is a κ-complete normal ideal I on Pκλ′, where λ′>λ, such that P(Pκλ′)/I is μ-strategically-closed, then □λ∗ fails.
Proof.
Assume to the contrary that there exists such an ideal and a □λ∗-sequence C=⟨Cα:α<λ+⟩. Since λ is a strong limit, we can assume that if C∈Cα, and D⊆C is club in α and has size <λ, then D∈Cα.
Let G⊆P(Pκλ′)/I be generic, and let j:V→M⊆V[G] be the associated embedding. Let γ=(λ+)V. Since j(κ)>λ′, M⊨∣γ∣=μ, and by the strategic closure, M⊨cf(γ)=μ. Let δ=supj[γ]<j(γ), and let C∈j(C)δ have ordertype μ. Since μ<crit(j), and V and V[G] share the same <μ-sequences, j[γ] is <μ-closed. Thus D=C∩j[γ] is club in δ and thus a member of j(C)δ. If α<γ is such that j(α) is a limit point of D, then D∩j(α)∈j(Cα), and it is also in V since it has size <μ. If we take d∈V such that j(d)=D∩j(α), then d∈Cα. If E=j−1[D], then E is a club subset of γ in V[G] such that for every α∈limE, E∩α∈Cα.
In V, let ⟨α˙i:i<μ⟩ name the increasing enumeration of E. Using the strategic closure of P(Pκλ′)/I, we build a tree of height cf(λ)+1 of conditions that make incompatible decisions about initial segments of E. Suppose inductively that for some η≤cf(λ), we have ordinals iσ and ξσ and conditions pσ, indexed by sequences σ∈λ<η, such that:
(1)
For each σ∈λ<η, ⟨pσ↾γ:γ∈domσ⟩ is a descending sequence conforming to the strategy witnessing the strategic closure of P(Pκλ′)/I.
2. (2)
If domσ<domσ′, then ξσ<ξσ′.
3. (3)
If σ=σ′ and their domains are the same successor ordinal, then ξσ=ξσ′.
4. (4)
For ζ+1<η, σ∈λζ, and β<λ, pσ⌢β⊩α˙iσ=ξˇσ⌢β, and pσ⌢β decides E∩ξσ⌢β.
For each σ∈λη, we can take a lower bound pσ to ⟨pσ↾γ:γ<η⟩. Since λ+ is regular, there is iσ<μ such that the possible values for α˙iσ forced below pσ are unbounded in λ+. Choose an antichain ⟨pσ⌢β:β<λ⟩ of conditions below pσ that make distinct decisions ξσ⌢β for α˙σ, all above supτ∈λ<ηξτ, also deciding E∩ξσ⌢β, and conforming to the strategy witnessing strategic closure.
Let β∗=supσ∈λ<cf(λ)ξσ<λ+. For each σ∈λcf(λ), pσ forces that β∗ is a limit point of E, and so pσ⊩E˙∩β∗∈Cˇβ∗. But there are λcf(λ)>λ distinct decisions, contradicting that ∣Cβ∗∣≤λ.∎
Bibliography12
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Brent Cody and Monroe Eskew, Rigid ideals , to appear in Israel Journal of Mathematics.
2[2] James Cummings, Iterated forcing and elementary embeddings , Handbook of set theory (Matthew Foreman and Akihiro Kanamori, eds.), vol. 2, Springer, Dordrecht, 2010, pp. 775–883.
3[3] James Cummings, Matthew Foreman, and Menachem Magidor, Canonical structure in the universe of set theory. II , Ann. Pure Appl. Logic 142 (2006), no. 1-3, 55–75.
4[4] 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.
5[5] by same author, Calculating quotient algebras of generic embeddings , Israel J. Math. 193 (2013), no. 1, 309–341.
6[6] Matthew Foreman, Menachem Magidor, and Saharon Shelah, Martin’s maximum, saturated ideals and nonregular ultrafilters. Part I , Ann. of Math. 127 (1988), no. 1, 1–47.
7[7] Moti Gitik, Prikry-type forcings , Handbook of set theory (Matthew Foreman and Akihiro Kanamori, eds.), vol. 2, Springer, Dordrecht, 2010, pp. 1351–1447.
8[8] Akihiro Kanamori, The higher infinite , Springer-Verlag, Berlin, 2003.