We now define the forcing itself. Throughout this chapter, is a measure sequence in with and . (Such sequences are supplied by Lemma 1.5.1 under an extender hypothesis, and by Definition 1.6.3 in length .) The forcing carries two orders and : as with Prikry forcing, is used to force, while provides closure. Convention on the order. We write when is stronger than ; this is the reverse of Gitik’s convention.
Convention. We identify an ordinal with the trivial sequence ; with this convention contains the ordinals, and members of measure-one sets are either ordinals or pairs . Recall the notation (Definition 1.4.4) and : for an ordinal , a pair , or a triple , we write . For a triple and a set , we write to mean that the first two coordinates satisfy . Finally, recall from Chapter 1 that every measure occurring in a measure sequence is an ultrafilter on the corresponding ; when below we say that is “a normal measure on ”, this is always shorthand for a normal measure on (typically concentrating on ordinals).
2.1 Two warm-up cases to keep in mind
Before the formal definition, let us describe informally what a condition should look like in the two simplest cases; the notation here is temporary, and everything is defined formally in Section 2.2.
The case . Here with a normal measure on concentrating on ordinals. To singularize we build an -sequence: a condition should consist of a finite increasing sequence of ordinals below — the part of the sequence already chosen — together with a set from which all future points are to be picked. This is exactly the Prikry forcing with ; see Proposition 2.3.1.
The case . Here , where concentrates on pairs with a normal measure on . We would like both measures to participate in generating the generic sequence. A condition carries a measure-one set , and extending it means picking a point and shrinking . If is an ordinal, it is simply appended, as in the Prikry case. If , then can be appended only when ; it then enters the stem together with its own block , , from which all future points below must be chosen. Thus behaves autonomously and starts producing its own Prikry sequence for , while above the process continues as before. Generically this yields a cofinal sequence of order type : many blocks, each of order type . The details are in Example 2.3.2.
2.2 The definition of
Definition 2.2.1 (Gitik, Definition 5.2).
Let be the set of all finite sequences such that (1) and ; (2) ; (3) for every with , either (3a) is an ordinal, or (3b) for some , , and ; (4) for every , (4a) , and (4b) if then .
The sequence is called the stem of the condition, the top, and the measure-one set. Each of the form will give rise to the Radin forcing , with playing the role of .
Definition 2.2.2 (Gitik, Definition 5.3).
Let and be in . We say that is stronger than and write iff (1) ; (2) ; (3) there are such that for every , either (3a) , or (3b) and with ; (4) with as in (3), the following holds for every with and : (4a) if , then , or with and ; (4b) if , then for the least with , is of the form , and (i) if is an ordinal then ; (ii) if then and .
Remark. Clause (4) governs the newly added entries of the stem: (4a) says that entries appended above the last old entry come from the measure-one set of the top, while (4b) says that an entry inserted before must come from the block of the next old entry above it. In particular, an insertion is possible only into the block of a triple. (Recall that our is the reverse of Gitik’s: for him means that is stronger.)
Definition 2.2.3 (Gitik, Definition 5.4).
Let be as above. We say that is a direct extension of and write iff and .
Exercise 2.2.4.
Show that and are partial orders on , and that . Show also that iff is obtained from by shrinking the measure-one set and the blocks of the triples of the stem (in particular, the stems have the same length and the same first coordinates).
2.3 Two examples
Proposition 2.3.1 (Length one is Prikry forcing).
Let be measurable and a normal measure on concentrating on ordinals; set (then by Example 1.6.1(d)). Let be the empty-stem condition whose measure-one set consists of all ordinals below . Then is an isomorphism of onto the Prikry forcing , with corresponding to the Prikry direct extension.
Proof. Every has an ordinal-only stem and : by clause (4a) each stem entry must lie in the measure-one set of , and contains no pairs. Conversely, every Prikry condition is the image of such a , and clause (2) of Definition 2.2.1 matches the requirement that the measure-one set lie above the maximum of the stem. The map is therefore a bijection, and it respects the orders: by clause (4b), an entry inserted below the last old entry must come from the block of a triple among the old entries — and there are none — so stems are only end-extended, with new entries taken from the old measure-one set and a shrunken final set. This is exactly the Prikry order.
Remark. The condition is not the weakest element of : the condition is strictly weaker, and below it there are conditions whose stems contain genuine triples coming from smaller measure sequences; such conditions are incompatible with . By Lemma 2.4.2 below, the forcing below such a condition factors into a smaller Radin forcing times a Prikry tail. So consists of the Prikry part together with side copies of smaller Radin forcings sitting below measurable cardinals .
Example 2.3.2 (Length two, from a μ-measurable cardinal).
Let be μ-measurable (Definition 1.6.3), witnessed by , and let be the derived sequence of length . Then : indeed, concentrates on pairs with measurable and a normal measure on (Exercise 1.6.4), and every such pair is a measure sequence of length , hence belongs to vacuously (Example 1.6.1(d)); so , while concentrates on ordinals.
A condition therefore consists of a finite stem of ordinals and triples (with ), a top , and , which we may take to consist of ordinals and such pairs. Let us analyze the one-step extensions of . An ordinal is appended freely. A pair can be appended only when ; this is a measure-one phenomenon: the set lies in , since in we have iff , and . When , the triple enters the stem with a block , , and from then on all points below must come from : the pair starts its own Prikry sequence for . Above the process continues with the remaining part of .
Let be generic and let be the Radin club (studied systematically in the next chapter). The shape of the generic object is as follows.
Proposition 2.3.3.
In the situation of Example 2.3.2: (a) is a closed unbounded subset of ; (b) a final segment of has order type ; (c) the limit points of are exactly those for which a pair appears in the stem of some ; each such is measurable in , and the points of between two consecutive limit points form a Prikry sequence for the corresponding .
In particular : length still singularizes to cofinality . Changing the cofinality to an uncountable value requires longer sequences and is the subject of the next chapter, where (a)–(c) are proved in full generality.
2.4 Basic structural properties
We turn to the four lemmas on which the whole theory rests: the chain condition, factorization, closure, and the Prikry property; combined, they give cardinal preservation.
Lemma 2.4.1 (Gitik, Lemma 5.5).
satisfies the -c.c.
Proof. Two conditions with the same stem and the same top are compatible: intersect the measure-one sets and the blocks of the stem triples; the intersections remain measure one by completeness of the relevant filters. A stem is a finite sequence of elements of , and since is inaccessible, so there are at most stems. Hence every antichain has size at most .
For the next two lemmas we need some notation. Let and suppose that for some with , is a triple. Set Then and . For and , write .
Lemma 2.4.2 (Gitik, Lemma 5.6; Factorization).
.
Proof. Map to . By clause (4b) of Definition 2.2.2, every entry of inserted below comes from the blocks of the triples among , while by clause (4a) every entry above comes from the blocks of or from the top measure-one set; hence the map is a bijection between the cones. That it respects both and is immediate from the definition of the order.
Lemma 2.4.3 (Gitik, Lemma 5.7).
is -closed.
Proof. Let , , be a chain in the cone with for . Direct extensions do not change the length or the first coordinates of the stem, so only the top measure-one set and the blocks of the stem triples shrink. All of these belong to filters that are -complete for some : the top filter is -complete, and each stem triple occurring in has and . The entrywise intersections therefore remain measure one, and the condition with the common stem and the intersected sets extends every .
The heart of the matter is the Prikry property. The new point, compared with Prikry forcing, is that a condition may be extended by picking elements from different measures of the sequence ; one has to show that different choices cannot decide a statement differently — roughly, that one can pass from one choice of a measure to another while staying with compatible conditions.
More precisely, the proof below has exactly the same architecture as the proof of the Prikry property for Prikry forcing — split the possible one-step extensions into three parts according to whether they can be directly extended to decide or , shrink once by a diagonal intersection, take a decider of minimal length, and derive a contradiction by amalgamating two incompatible decisions — and the reader who knows that proof is encouraged to reconstruct this one. The changes are concentrated in three places:
- a one-step extension may pick its new point from any measure of the sequence, so the three-way split is made separately for each , and the shrunken measure-one set is a union , which lies in but in general in no single ;
- a new entry need not be an ordinal: a pair enters the stem together with its own block, so a direct extension deciding shrinks blocks as well, and these blocks must be synchronized over the measure in use — this is the role of the sets and below;
- an extension may also insert points into the blocks of triples already present in the stem, so in the minimality argument the new entries of a -extension can be scattered relative to the chosen measure; the sets , and the final three-case analysis locate them.
The diagonal intersections themselves are the usual ones (Definition 1.3.1), evaluated in using that fixes pointwise.
Lemma 2.4.4 (Gitik, Lemma 5.8; Prikry property).
satisfies the Prikry property: for every and every statement of the forcing language there is deciding .
Proof. We assume for simplicity that ; the general case is obtained by applying the same argument to each block of the stem, using Lemma 2.4.2. Suppose, towards a contradiction, that no direct extension of decides .
Preparation: one-step extensions. For a finite sequence from , write whenever this is a condition. Let Then . Split into three parts: consists of those for which the corresponding one-step extension has a direct extension forcing , i.e.
- if is an ordinal: for some , and ;
- if : for some and , and it forces ;
is defined identically with in place of , and . Note that : two direct extensions of the same condition are compatible, so no can admit both.
For each choose with and set ; if , set . Now take the diagonal intersection (in the sense of Definition 1.3.1)
Claim 1. .
Proof. For every we have , i.e. in . Since , the finite sequences quantified over in are exactly those of ; and exceeds for every such . Hence , which means .
Set . Then for every , so by upward closure. Put .
Minimal length. By our assumption, no direct extension of decides . Pick an extension deciding with as small as possible; say it forces . Pick with and write . The decider is a direct extension of forcing , so ; in particular and . Since implies for every , we conclude: where if is an ordinal, and for some if .
We will find a set such that forces , contradicting the minimality of .
Shrinking below . Suppose (the case is similar and slightly easier). Take the diagonal intersection of the ‘s:
Claim 2. for every .
Proof. For each with defined, , so in , . Since , the quantification over in ranges exactly over the ‘s of . Hence .
Each lies in (it is the block of a legal condition). Consider the value of the function at the generic point ; this is defined since . By elementarity, for every . Next, the set lies in : indeed , so . Set ; then for every .
Shrinking above . Consider Then for every with : in , , so witnesses . Finally set Then : for it contains , and for it contains .
Three cases. Let and . By the minimality of , no direct extension of decides . Pick with , say . By Definition 2.2.2(3) there is with .
Case 1: . Choose with and (possible: apply Lemma 1.4.5 to ). Since and ‘s index set, gives with Then extends both (the block , the tail set ) and (via , by clause (4a)). But extends a condition forcing and a condition forcing — impossible.
Case 2: and for all . Pick with and (Lemma 1.4.5 again). Since , we have , so Consider . Then : the entries correspond to (since ), and the entries with lie in , hence are insertions into the block of permitted by clause (4b). Also by clause (4a), since . Again this contradicts .
Case 3: and some . Let be the minimal such . Since and , we have .
Subcase 3a: . Write . Then , so and by the minimality of (the entries with lie in ). But and are compatible: intersect the blocks and measure-one sets. This contradicts .
Subcase 3b: , where , . By the definition of , there is with ; hence . Since , Lemma 1.4.5 provides with . Extend by inserting into the block of : the resulting still forces , but now the entry following comes from , and we are back in Subcase 3a. Contradiction.
All cases are impossible; hence some direct extension of decides after all.
Combining the lemmas, we obtain the main preservation theorem.
Theorem 2.4.5 (Gitik, Theorem 5.9).
Let be generic. Then is a cardinal-preserving extension of .
Proof. By induction on . Fix and a cardinal ; we show is preserved below .
Case . By Lemma 2.4.1, has the -c.c., so all cardinals are preserved.
Case . Suppose the stem of contains a triple with , and take the last such . By Lemma 2.4.2, The first factor is a Radin forcing on and preserves all cardinals by the induction hypothesis. In the second factor , so we may argue with in place of . Hence we may assume that every triple in the stem of satisfies ; for simplicity of notation, assume the stem has no triples at all (the general case is identical, working above ).
It suffices to show that no new subsets of are added for any cardinal : a collapse of to some would yield such a new subset (coding the collapsing well-order). So fix () and shrink: . Every extension of has all its stem points above , so by the completeness of the relevant filters, is -closed. Now let be a name with . Using the Prikry property (Lemma 2.4.4) successively and taking lower bounds by -closure, we find a -chain with and such that decides . Then forces to equal a ground model subset of .
Notes
The definition of follows Gitik’s Definitions 5.2–5.4, which in turn follow Woodin’s concrete approach to the forcing originally isolated axiomatically by Radin [48] and Mitchell (see also Cummings–Woodin [10]); we have reversed Gitik’s order convention, so that for us means that is stronger than . Lemmas 2.4.1–2.4.3 and Theorem 2.4.5 are Gitik’s Lemmas 5.5–5.7 and Theorem 5.9; Lemma 2.4.4 is Gitik’s Lemma 5.8, whose proof is the technical heart of the subject. Proposition 2.3.1 makes precise Gitik’s remark that the length- case “is the usual Prikry forcing”; the analysis of one-step extensions in Sections 2.1 and 2.3 is Gitik’s treatment of the case .
References
Main reference:
- Moti Gitik. Prikry-type forcings. In Matthew Foreman and Akihiro Kanamori, editors, Handbook of Set Theory, pages 1351–1447. Springer, Dordrecht, 2010.
Numbering below follows the bibliography of Gitik’s chapter:
- [10] James Cummings and W. Hugh Woodin. A book on Radin forcing. In preparation.
- [48] Lon B. Radin. Adding closed cofinal sequences to large cardinals. Annals of Mathematical Logic, 22(3):243–261, 1982.