Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-18T10:06:28.767Z Has data issue: false hasContentIssue false

The well-foundedness of the Mitchell order

Published online by Cambridge University Press:  12 March 2014

J. R. Steel*
Affiliation:
Department of Mathematics, University of California at Los Angeles, Los Angeles, California 90024, E-mail: steel@math.ucla.edu

Extract

Let EF iff E and F are extenders and E ∈ Ult(V, F). Intuitively, EF implies that E is weaker—embodies less reflection—than F. The relation ⊲ was first considered by W. Mitchell in [M74], where it arises naturally in connection with inner models and coherent sequences. Mitchell showed in [M74] that the restriction of ⊲ to normal ultrafilters is well-founded.

The relation ⊲ is now known as the Mitchell order, although it is not actually an order. It is irreflexive, and its restriction to normal ultrafilters is transitive, but under mild large cardinal hypotheses, it is not transitive on all extenders. Here is a counterexample. Let κ be (λ + 2)-strong, where λ > κ and λ is measurable. Let E be an extender with critical point κ and let U be a normal ultrafilter with critical point λ such that U ∈ Ult(V, E). Let i: V → Ult(V, U) be the canonical embedding. Then i(E) ⊲ U and UE, but by 3.11 of [MS2], it is not the case that i(E) ⊲ E. (The referee pointed out the following elementary proof of this fact. Notice that i ↾ Vλ+2 ∈ Ult(V, E) and XEaXi(E)i(a). Moreover, we may assume without loss of generality that = support(E). Thus, if i(E) ∈ Ult(V, E), then E ∈ Ult(V, E), a contradiction.)

By going to much stronger extenders, one can show the Mitchell order is not well-founded. The following example is well known. Let j: VM be elementary, with VλM for λ = j(crit(j)). (By Kunen, Vλ+1M.) Let E0 be the (crit(j), λ) extender derived from j, and let En+1 = i(En), where i: V → Ult(V, En) is the canonical embedding. One can show inductively that En is an extender over V, and thereby, that En+1En for all n < ω. (There is a little work in showing that Ult(V, En+1) is well-founded.)

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[M74]Mitchell, W. J., Sets constructive from sequences of ultrafilters, this Journal, vol. 39(1974), pp. 5766.Google Scholar
[MS1]Martin, D. A. and Steel, J. R., A proof of projective determinacy, Journal of the American Mathematical Society, vol. 2 (1989), pp. 71125.CrossRefGoogle Scholar
[MS2]Martin, D. A. and Steel, J. R., Iteration trees, Journal of the American Mathematical Society (to appear).Google Scholar