In 1978 Magidor [37] constructed the first forcing that changes the cofinality of a cardinal to an uncountable value without collapsing cardinals. His initial assumption was a sequence of normal measures on , increasing in the Mitchell order — in modern terms, the top row of a coherent sequence with . We present the forcing twice: first as a cone of the forcing of Chapter 5, where all of its properties are inherited for free; then in Magidor’s original direct form, which is the version used in applications. We then explain why the Mitchell-order hypothesis suffices here, in contrast with the Radin forcing , and discuss the optimality of that hypothesis.
6.1 Magidor forcing as a cone of
Fix a coherent sequence of measures with and , where (Definition 5.1.1). Recall the splitting of Lemma 5.3.1: the sets are pairwise disjoint and . In particular .
Definition 6.1.1 (Gitik, p. 1419).
The Magidor forcing associated with is the cone i.e. the forcing (Definitions 5.2.1–5.2.3) below the displayed condition, with the induced orders and .
Since the ‘s are disjoint, every point appearing in a stem of a condition in carries a well-defined index, namely : ordinal entries (case (3a) of Definition 5.2.1) are the points of index , and a pair is a point of index . A stem is therefore nothing but a finite increasing sequence of indexed points together with measure-one sets — which is exactly the shape of Magidor’s original conditions.
Lemma 6.1.2 (Canonical refinement).
Every condition of has a direct extension such that
- the top measure-one set of satisfies , and
- for every pair in the stem of , .
Proof. Both shrinkings are legitimate for : for (2), apply Lemma 5.3.1 at instead of — the set lies in for each , and ; intersecting finitely many measure-one sets stays in the intersection. For (1) there is nothing to do beyond the cone condition itself.
The point of the refinement is this: below , any point inserted into the block of a pair lies in , hence has index . So the block below a stem point of index only ever acquires points of index — a self-similar, downward-nested structure governed entirely by the indices. Magidor’s original definition builds this in from the start by recording the index of each stem point explicitly.
6.2 Magidor’s original definition
Let and let be a sequence of normal measures on , increasing in the Mitchell order . (Such a sequence exists iff ; it is the top row of any coherent sequence with .) For , choose a function representing in the ultrapower by : Such functions exist precisely because means . We write .
The functions allow the measures below a point to be decoded: for -almost all , the objects are normal measures on which cohere with the ‘s exactly as the ‘s cohere among themselves. This is the content of the next lemma, due to Magidor.
; the good sets).
For , the following sets belong to : and .
Proof sketch. Both statements are Łoś computations in . For , the defining clauses of read ” are normal ultrafilters over ”, i.e. ” are normal ultrafilters over ”, which hold in since the ‘s for are elements of by the choice of the representing functions. Similarly, the clause defining at reads , again true in . We leave the verification of the details as an exercise.
For , the measures () on are the exact analogue of the sequence of Chapter 5 — obtained here by explicit decoding rather than by coherence. We can now define the forcing, following Magidor [37]; our notation follows the restatement by Fuchs.
Definition 6.2.2 (Neighbor functions).
For a finite define and by the nearest neighbors of inside , to the left and to the right.
).
The Magidor forcing consists of pairs such that
- is a finite subset of , and ;
- for all , , and is strictly increasing;
- for all , if then , and if then ;
- if with and , then .
The ordering is defined by ( stronger) iff
- ;
- for all ;
- for all .
We write (direct extension) iff and .
Thus is the stem: a finite increasing sequence of points, each tagged with its index , chosen from the good set . Clause (3) says that a measure-one set at an unused index is measured by — the -th measure on , where is the nearest stem point above ; if there is none, the ambient measure is used. Clause (4) guarantees that a new point inserted at index lands in the interval determined by its stem neighbors, so that remains strictly increasing. Note that, in parallel with the rest of these notes, means “stronger than”; Magidor’s and Gitik’s papers use the opposite convention. In some presentations one additionally fixes an ordinal and requires all stem points to exceed (the “forcing above ”); this freedom is useful in iteration arguments but plays no role here.
Definition 6.2.4.
Let be generic over . The Magidor sequence is
Lemma 6.2.5.
The Magidor sequence is defined on all of , strictly increasing, continuous at limit ordinals, and cofinal in . In particular its range is a closed unbounded subset of of order type (for a limit ordinal).
Proof sketch. Totality is a density argument: given and , with , any above the current stem values below yields a stronger condition — the side conditions of Definition 6.2.3 hold by clauses (3) and (4) for . Monotonicity is built into clause (2). Cofinality: for with no stem point above, is unbounded in , so values at index are forced unboundedly high. Continuity at a limit : if , then for every the set is measure one for the normal ultrafilter over , hence unbounded in ; inserting points at larger and larger indices below therefore forces . A continuous strictly increasing function has closed range, and a strictly increasing function on has range of order type .
Exercise 6.2.6.
Spell out the correspondence between and the cone of Definition 6.1.1: given a condition with , describe the associated condition of whose stem pairs are with , where the are the appropriate shrinkings of the ‘s. Show that the values of the Magidor sequence are exactly the pair coordinates appearing in stems of the generic for the cone, and conclude (using Lemma 3.1.3 and Lemma 6.2.5) that is club in and computes in the extension.
6.3 The main theorem
).
Let and let be a -increasing sequence of normal measures on . Set . Then:
- has the Prikry property, and is -closed;
- has the -chain condition;
- preserves all cardinals and adds no bounded subsets of ;
- .
Proof. All parts are inherited from the coherent-sequence forcing of Chapter 5 via the cone presentation of Section 6.1. Extend to a coherent sequence with (possible since ; see the discussion after Definition 5.1.1). The cone is a subordering of , so the transfer theorem Theorem 5.3.2 applies to it directly:
- The Prikry property is the -version of Lemma 2.4.4, and the -closure of is that of Lemma 2.4.3 — in the cone the argument only simplifies, since measure-one sets consist of ordinals.
- The -c.c. is Lemma 2.4.1: conditions are finite sequences of objects from of size after fixing the stem, so any two conditions with the same stem are compatible.
- Cardinal preservation now follows by the standard argument of Theorem 2.4.5: the -c.c. preserves cardinals , and the Prikry property together with -closure of shows no new bounded subsets of are added, preserving cardinals .
- By Lemma 6.2.5, is continuous and cofinal, so . Since and no bounded subsets of are added, . (Equivalently, in the cone presentation, the order-type analysis of Theorem 3.2.5 gives directly.)
Exercise 6.3.2 (guided).
Prove parts (1) and (2) of Theorem 6.3.1 directly from Definition 6.2.3, without passing through . Hints: for the closure of , intersect fewer than many measure-one sets index by index (each is -complete and there are only many indices); for the Prikry property, imitate the proof of Lemma 2.4.4 with the stem in place of — the relevant partition argument takes place, for each stem point , inside the measures for .
6.4 Why Mitchell order suffices: comparison with
It is worth pausing on exactly why Magidor forcing runs on the cheap hypothesis , while the parallel cofinality change via requires a measure sequence of length in — already length costs a μ-measurable cardinal (Definition 1.6.3), and length costs much more (Lemma 1.5.1).
- The measures concentrate on ordinals. Every measure used in — the ‘s, the decoded measures — is an ultrafilter over an ordinal, and measure-one sets consist of ordinals. In , by contrast, a measure-one set consists of pairs , i.e. of elements of carrying their own measure sequences.
- Stem points do not spawn nested blocks of new measure sequences. Inserting a point at index into a Magidor stem commits us to nothing below except the measures for , all of which are decoded from the ambient functions — the recursion bottoms out at ordinals. In , inserting imports the whole sequence , whose own measure-one sets again consist of pairs, and so on; this is why the membership had to be certified by a constructing embedding (Definition 1.4.2).
- The strength accounting. A -increasing sequence of length over exists as soon as — pure Mitchell order, no extenders; by Mitchell’s core model theory [43], the assertion "" is equiconsistent with its forcing consequences. The measure sequences of Chapter 1 live strictly higher: μ-measurability is the weakest large cardinal property requiring extenders not equivalent to normal ultrafilters (Section 1.6).
So Magidor forcing is the optimal-strength route to : nothing beyond the canonical inner-model content of "" is used.
6.5 Optimality of the hypotheses
Remark 6.5.1 (stated without proof).
The conclusion of Theorem 6.3.1 is optimal in two senses.
- Bounded subsets are unavoidable over the core model. Mitchell [45] showed: if the ground model is the core model , then any cardinal-preserving extension changing the cofinality of to an uncountable must add new bounded subsets of . Thus the combination “cardinal preservation + no new bounded subsets + ” necessarily requires a prepared ground model: such models were constructed by Mitchell [44] using inner model techniques, and by a pure forcing construction of Gitik [13].
- The assumption is necessary. By Mitchell’s analysis of the core model for sequences of measures [43], changing the cofinality of to while preserving cardinals requires in the core model. Hence Magidor’s hypothesis is exactly the consistency strength of the conclusion.
Compare the discussion after Theorem 3.2.5: the Radin club itself adds bounded subsets of below every pair coordinate, in line with Mitchell’s theorem — avoiding them is a matter of preparing the ground model, not of choosing a cleverer forcing.
Notes
The cone presentation of Section 6.1 is Gitik’s, from the paragraph on p. 1419 of the Handbook chapter: “If , then can be split… , above the condition is then the Magidor forcing for changing cofinality of to .” Lemma 6.1.2 makes explicit the refinement implicit in that identification. Section 6.2 presents Magidor’s original definition from [37]; our notation follows the restatement in Fuchs’ paper (where the forcing is defined with an additional parameter , the “forcing above ”, and in his notation). Lemma 6.2.1 is Magidor’s observation that the sets are of measure one; Lemma 6.2.5 records the standard properties of the Magidor sequence. Theorem 6.3.1 is the main theorem of [37]; the inheritance proof given here is available because of the coherent-sequence approach of Mitchell [42, 43] presented in Chapter 5. Remark 6.5.1 summarizes Mitchell [44, 45] and Gitik [13], as cited in Gitik’s discussion following Theorem 5.12 of the Handbook chapter.
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:
- [13] Moti Gitik. Changing cofinalities and the nonstationary ideal. Israel Journal of Mathematics, 56(3):280–314, 1986.
- [37] Menachem Magidor. Changing cofinality of cardinals. Fundamenta Mathematicae, 99(1):61–71, 1978.
- [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.
- [44] William J. Mitchell. Indiscernibles, skies, and ideals. In Axiomatic Set Theory (Boulder, Colo., 1983), volume 31 of Contemporary Mathematics, pages 161–182. American Mathematical Society, Providence, 1984.
- [45] William J. Mitchell. Applications of the covering lemma for sequences of measures. Transactions of the American Mathematical Society, 299(1):41–58, 1987.
Additional reference for the presentation of Section 6.2:
- Gunar Fuchs. On sequences generic in the sense of Magidor. The Journal of Symbolic Logic, 79(4):1286–1314, 2014.