So far we have used the Radin forcing to change cofinalities: by Theorem 3.3.2, if then is singularized in the extension. For applications to cardinal arithmetic one needs the opposite: force with while keeping regular, or even measurable. A basic theme in such applications is to arrange a particular pattern of the power function over the Radin club (sometimes adding Cohen subsets or collapsing cardinals in between its points) and then to cut the universe at — constructions of this type were used by Foreman–Woodin [12], Cummings [9] and Merimovich [40]. In this chapter we isolate the two hypotheses on that make this possible: a repeat point (preserving measurability) and large cofinality of (preserving regularity). Throughout, is a -sequence with , as supplied by Lemma 1.5.1, and is generic.

4.1 Repeat points

Definition 4.1.1 (Gitik, Definition 5.14).

An ordinal is called a repeat point for if for every with and every , there is a such that . Equivalently, : the measures from on produce no new sets.

The point of the definition is that below a repeat point, the forcings and are essentially the same: the conditions coincide up to replacing the top pair by , and the families of measure-one sets and agree. So a generic may be viewed as a generic subset of .

Proposition 4.1.2 (Gitik).

Suppose and . Then the set of repeat points for is unbounded in (indeed contains a club between and ). Consequently, has a repeat point for unboundedly many .

Proof. The family consists of subsets of , and there are only many of these. Given , each appears for the first time at some stage with ; set . Then and , since , and by construction no measure with contains a set absent from all , . So is a repeat point above . Applying this to the tails gives the second assertion.

4.2 Preserving measurability

Theorem 4.2.1 (Gitik, Theorem 5.15).

If is a repeat point for and is generic, then remains measurable in .

Proof. Let be a constructing embedding for , with . As observed above, we may view as a generic subset of . Work in and define, for an -name of a subset of : Thus measures by forcing ” enters ” inside , using a condition of obtained by inserting the pair with its block below the top pair .

is well defined. Suppose some forces . Then in , Since , in particular , so by the definition of the -sequence; also . Hence the triple is addible to this condition, and for every , so the definition of does not depend on the choice of the name or of the condition in .

Exercise 4.2.2.

Show that is a -complete ultrafilter on extending . (Hint: ultrafilterness uses genericity — some condition in decides — together with the well-definedness computation; -completeness uses that the relevant filters are -complete and that direct extensions decide bounded meets.)

Normality of . Suppose forces "". Then in , for some , Working in , construct by a diagonal intersection (in the sense of Definition 1.3.1) over the many relevant lower parts, so that: whenever for some a condition forces , then the same condition with replaced by forces it as well.

Back in , let We claim is dense in below . Given any stronger condition , the condition of (computed in ) is stronger than the displayed condition above, hence forces ; some stronger condition decides the value, say . By the uniform property of , replacing by still decides , so and is stronger than .

Pick below . There is such that and then by the definition of . Hence is normal, and is measurable in .

Remark (Gitik). The ultrafilter defined above extends , but its ultrapower embedding does not extend that of ; instead it extends a certain iterated ultrapower embedding using ultrafilters of between and . Similar arguments show that the degree of strongness, and even of supercompactness, of the embedding can be preserved. Note the contrast with Chapter 3: preserving measurability costs a repeat point, which by Lemma 1.5.1 and Proposition 4.1.2 requires a long sequence ( under ), while changing the cofinality of to already works at length .

4.3 Fat trees

For regularity we need a strengthening of the Prikry property (Lemma 2.4.4) in the spirit of the tree formulation of Prikry forcing: to land in a dense open set, one should only have to specify which measures are used and measure-one sets in them — not which points are picked.

Definition 4.3.1 (Gitik, Definition 5.16).

Let be a sequence of ultrafilters over for some . A tree with levels is called -fat iff (1) for every , ; (2) for every non-maximal (), there is an such that .

Definition 4.3.2 (Gitik).

Let be -fat and let be a maximal branch of . A sequence is called a sequence of -measure one if for every with of the form we have .

Let , and write for the top pair . Let be indices with , and for each let be an -fat tree, a maximal branch of , and a sequence of -measure one. We denote by the condition obtained from by inserting, for each , the sequence between and — an ordinal point is inserted as an ordinal, a pair as the triple — and then shrinking all blocks in the unique minimal way required by Definition 2.2.1 (each block is cut down to avoid for the preceding entry ).

Lemma 4.3.3 (Gitik, Lemma 5.17).

Let be a dense open subset of and . Then there are ; indices ; and for , -fat trees , such that: for every sequence with a maximal branch of , there are sequences of -measure one with

Remark (Gitik, Remark 5.18). Roughly, the meaning is this: in order to get into we need to specify certain ultrafilters (or , below ) and measure-one sets in them; then any choice of points from these sets puts us into .

Proof. The proof is a refinement of that of Lemma 2.4.4, and we use the notation set up there (, , , diagonal intersections). We treat the case ; the general case is obtained by applying the same argument inside the block of each triple of the stem, as in the reduction in Lemma 2.4.4. So we need and a -fat tree of some finite height such that for every maximal branch of there is a sequence of -measure one with .

If already has a direct extension in , take such an extension and . Assume this is not the case. For each finite sequence with , split into two parts according to whether a one-step extension has a direct extension in : for “direct extension” includes the freedom to shrink the block of the new triple, i.e. for some and . For each choose the side with , set , and let be the diagonal intersection; set and . As in Lemma 2.4.4 we get:

If now for some the condition has a direct extension in , we finish at height : fix with , for each fix a direct extension of (where for ordinals and for pairs), and let be the diagonal intersection ; then for each , so by openness for all , and we take with the one-level tree whose level is .

Otherwise we pass to two-step extensions: replacing by , define as above and let consist of those for which there are and a set , , such that for every the condition has a direct extension in . Define the ‘s, ‘s, and as before. If for some a direct extension of is in , then by there is such that for every the condition has a direct extension in ; and then for with we have , so every has the same property for some . We finish with a two-level tree, as above.

Continue in the same fashion. At stage we have sets , , , and the -dimensional version of : If for some a direct extension of is in , we finish: take from and let (the diagonal intersection of the ‘s), so that works by openness of .

Suppose, towards a contradiction, that the process does not stop at any . Set then (the intersection is in by -completeness), and by our assumption no direct extension of lies in . Pick with . Then , since the stem entries of lie in . But by the construction at stage , the existence of such a means the process was supposed to stop at stage . Contradiction.

4.4 Preserving regularity

Theorem 4.4.1 (Gitik, Theorem 5.19).

If , then remains regular (and hence inaccessible) in .

Proof. Cardinals are preserved by Theorem 2.4.5, and is a strong limit in , so it is enough to show that is not singularized. Suppose and is an -name such that the weakest condition forces . Let ; we find a forcing ” is bounded in ”. For consider Clearly is dense (decide the value of and append an ordinal above it).

For every with , apply Lemma 4.3.3 to this condition and ; we are interested only in the last tree , and only when , i.e. the tree hanging at the top pair. This is a -fat tree of some finite height; denote it by . For every non-maximal node of there is with ; set Since has at most many nodes and , we have . Then (there are many ‘s), and finally pick above every , . Consider Then : in , at the pair , the condition reads ” is -fat” for all and ; but fixes pointwise, so , and is -fat with successor measures taken from , all of which lie in since .

For every , let be the set given by Lemma 4.3.3 applied to and , and let .

Claim. Let and suppose some appears in . Then .

Proof of Claim. Suppose not: let be as above with for some , and write Set . By the definition of , the tree is -fat. Since , we can choose, level by level, a maximal branch through this tree lying inside : at each non-maximal node the successor set lies in some and hence meets . By Lemma 4.3.3 and the remark following it, there is with of the form where and each is (for ordinals) or for some (for pairs). Since , , and because .

On the other hand and are compatible: , so the entries of come from and are addible to above ; hence is a common extension. But it must force both (via ) and (via ). Contradiction.

Finally, every condition below can be extended to one as in the Claim: shrink the measure-one sets into and append a pair from (possible since and every set in meets ). Hence the conditions forcing ” is bounded in ” are dense below , and since was arbitrary, the weakest condition forces that is not cofinal in .

Corollary 4.4.2 (Gitik, Remark 5.20).

The converse of Theorem 4.4.1 fails: by Theorem 4.2.1, if has a repeat point then remains measurable — hence regular — in , while e.g. a sequence of length may have .

Exercise 4.4.3.

Let and generic. Determine the order type of the Radin club in . (Hint: combine Lemma 3.1.2 with Theorem 4.4.1 — a club in a regular must have order type ; contrast with Theorem 3.3.2.)


Notes

Definition 4.1.1, Theorem 4.2.1, Definition 4.3.1, Lemma 4.3.3 and Theorem 4.4.1 are Gitik’s Definition 5.14, Theorem 5.15, Definition 5.16, Lemma 5.17 and Theorem 5.19, respectively; Corollary 4.4.2 is his Remark 5.20, and the remark after Lemma 4.3.3 is his Remark 5.18. In Theorem 4.2.1 we have used factorization (Lemma 2.4.2) where Gitik phrases the density argument in terms of the forcing ; the content is the same. The observation that regularity preservation is the key to applications in cardinal arithmetic — arranging a pattern of the power function along and cutting the universe at — is Gitik’s, with references to Foreman–Woodin [12], Cummings [9] and Merimovich [40]. In Chapter 5 we will see that all of these results have cheaper analogues: coherent sequences of measures allow the same conclusions from Mitchell-order hypotheses alone.

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:

  • James Cummings. A model in which GCH holds at successors but fails at limits. Transactions of the American Mathematical Society, 329(1):1–39, 1992.
  • [12] Matthew Foreman and W. Hugh Woodin. The generalized continuum hypothesis can fail everywhere. Annals of Mathematics (2), 133(1):1–35, 1991.
  • [40] Carmi Merimovich. A power function with a fixed finite gap everywhere. The Journal of Symbolic Logic, 72:361–417, 2007.