The forcing of Chapter 2 is defined from a -sequence of ultrafilters, and producing long such sequences costs serious large cardinal strength (Lemma 1.5.1): already length needs a μ-measurable cardinal. It was Mitchell’s insight [42] that the embedding is not really needed: all the combinatorics of the forcing only ever uses the sequence of measures together with a coherence property, and coherent sequences exist already at the level of Mitchell order. This lowers the hypotheses to optimal ones and yields equiconsistency results; it also gives a uniform treatment of Magidor’s forcing [37], which we take up in Chapter 6. In this chapter we define coherent sequences, build the forcing on them, and explain why every theorem of Chapters 2–4 transfers to it.

5.1 Coherent sequences of measures

).

A coherent sequence of measures is a function with domain of the form for an ordinal (the length of ) and a function (the order of ), such that for every : (1) is a normal ultrafilter over ; (2) (coherence) if is the ultrapower embedding, then where and .

So is a sequence of normal measures organized by Mitchell order, and coherence says that each measure knows exactly the part of the sequence below it: in the ultrapower by , the sequence up to is itself, and the measures on are precisely for . In particular is the Mitchell order of as computed with the measures of , and the existence of a coherent sequence with follows from — no extenders needed.

Convention. Note that the measures are ultrafilters over the ordinal , not over ; this is the classical setting of the Mitchell order, and it is what makes Magidor forcing fall out directly in Chapter 6. (Via a coding of by the two presentations are interchangeable; cf. the convention of Chapter 2.)

Replacing by . Suppose now that and . Over we use the sequence in the role that played in Chapters 1–4. A set consists of ordinals only — there are no more pairs carried inside measure-one sets. But whenever has , the sequence is available and can play the role of ; it is determined uniquely by and , which is why the conditions of the forcing below need not carry the measure sequences around.

This is where Chapter 1 becomes dispensable: the hierarchy of Definition 1.4.2 was needed because a pair drawn from a measure-one set had to be certified as itself coming from an embedding (so that the recursion could continue below ); here coherence certifies every at once, as the following lemma shows.

Lemma 5.1.2 (Coherence implies addability).

Let be coherent, and . Then

Proof. Let . By coherence, the -th measure on in is itself; in particular . By Łoś, the displayed set lies in iff in , belongs to the -th measure on of , i.e. iff . But (since and ), and by hypothesis.

Compare this with the addability lemma for (Lemma 1.4.6): there, the conclusion came from the definition of a -sequence (membership of initial segments in ); here it is one line of coherence. Iterating Lemma 5.1.2 over (using -completeness and the splitting of Lemma 5.3.1 below) gives the exact substitute for addability: every can be shrunk, staying in , so that every with satisfies .

5.2 The forcing

Fix a coherent sequence with and . For an ordinal or a pair we write .

Definition 5.2.1 (Gitik, Definition 5.22).

is the set of finite sequences such that: (1) ; (2) ; (3) for every with , either (3a) is an ordinal and , or (3b) for some with and ; (4) for every , (4a) , and (4b) if then .

Definition 5.2.2 (Gitik, Definition 5.23).

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), for every , , with : (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 .

Definition 5.2.3 (Gitik, Definition 5.24).

is a direct extension of , written , iff and (same stem, shrunken measure-one sets).

These are verbatim the definitions of (Definitions 2.2.12.2.3), with the measure sequences and deleted from the conditions: a triple becomes a pair , the sequence being recovered from as . As always, our means stronger, the reverse of Gitik’s convention.

5.3 Splitting and the transfer theorem

Lemma 5.3.1 (Gitik; the splitting).

Suppose . For each let . Then the ‘s are pairwise disjoint and .

Proof. Disjointness is immediate since is a function. For , let ; by coherence , so . By Łoś, iff in , , which is exactly what coherence gives.

Theorem 5.3.2 (Gitik, p. 1419).

All the results of Chapters 2–4 are valid with replacing : the -c.c. (Lemma 2.4.1), factorization (Lemma 2.4.2), the closure of (Lemma 2.4.3), the Prikry property (Lemma 2.4.4), cardinal preservation (Theorem 2.4.5), the club and its order-type analysis with the resulting cofinality classification (Lemmas 3.1.2Theorem 3.3.2), and the preservation results of Chapter 4 (Theorems 4.2.1 and 4.4.1, the latter under the evident reformulation: ). The proofs require only trivial changes.

Proof (translation guide). The proofs of Chapters 2–4 use the ambient embedding only through three features of the measure sequences, each of which coherence supplies directly:

  1. Membership in . Whenever a point was drawn from a measure-one set, we used to know that the construction could be continued below . For , the continuation below uses , which needs no certification.
  2. Addability. Every use of “shrink so that for every pair in ” (Lemma 1.4.6) is replaced by Lemma 5.1.2 and its iterated form.
  3. Ultrapower computations. Statements evaluated in via "" (e.g. in the proof of the Prikry property) become Łoś computations in , with coherence providing the agreement .

With these substitutions the arguments go through word for word; in fact they simplify, since measure-one sets consist of ordinals only.

Exercise 5.3.3 (guided).

Carry out the translation in detail for the Prikry property: state and prove the -version of Lemma 2.4.4. (Hint: the sets and the three cases of the proof are unchanged; wherever the original proof picks a pair addible to a condition, apply the iterated form of Lemma 5.1.2.)

Corollary 5.3.4 (Gitik, p. 1419).

Suppose . Above the condition , the forcing is the Magidor forcing for changing the cofinality of to ; it preserves cardinals, adds no bounded subsets of , and forces from the hypothesis alone.

Proof. By Lemma 5.3.1, , so the displayed object is a condition; below it, every pair in a stem has , hence carries its assigned measure sequence of length . That this forcing is exactly Magidor’s forcing of [37] is the subject of Chapter 6; the preservation and cofinality claims are instances of Theorem 5.3.2 together with Theorem 3.2.5.


Notes

Definition 5.1.1, Definitions 5.2.1–5.2.3, Lemma 5.3.1, Theorem 5.3.2 and Corollary 5.3.4 correspond to Gitik’s Definition 5.21, Definitions 5.22–5.24, and the discussion on p. 1419 (“all the results of the previous section are valid in the present context with replacing … the proofs require only trivial changes”). Coherent sequences were introduced by Mitchell [43]; the observation that Radin forcing can be built on them — replacing the embedding — is Mitchell’s [42], and its main advantage is the reduction of the initial hypotheses, which also yields equiconsistency results. Magidor’s forcing [37] was originally defined directly from a Mitchell-increasing sequence of measures; Corollary 5.3.4 is Gitik’s way of recovering it inside . Lemma 5.1.2 is the coherence substitute for addability that makes the transfer literal rather than heuristic. Merimovich’s extender-based Radin forcing [39], which combines the present construction with the extender-based Prikry forcing of Gitik’s Section 3, is discussed briefly in Chapter 7.

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:

  • [37] Menachem Magidor. Changing cofinality of cardinals. Fundamenta Mathematicae, 99(1):61–71, 1978.
  • [39] Carmi Merimovich. Extender-based Radin forcing. Transactions of the American Mathematical Society, 355(5):1729–1772, 2003.
  • [42] William J. Mitchell. How weak is a closed unbounded ultrafilter? In Logic Colloquium ‘80 (Prague, 1980), volume 108 of Studies in Logic and the Foundations of Mathematics, pages 209–230. North-Holland, Amsterdam, 1982.
  • [43] William J. Mitchell. The core model for sequences of measures. I. Mathematical Proceedings of the Cambridge Philosophical Society, 95(2):229–260, 1984.