This paper characterizes tall cardinals within extender models under the assumption of no inner models with Woodin cardinals, linking tallness to strong and measurable limit of strong cardinals.
Contribution
It provides a new characterization of tall cardinals in extender models assuming no inner models with Woodin cardinals, connecting tallness to known large cardinal properties.
Findings
01
Tall cardinals are characterized as either strong or measurable limits of strong cardinals in certain extender models.
02
The characterization holds under the assumption of no inner model with a Woodin cardinal.
03
The work advances understanding of the structure of large cardinals in extender models.
Abstract
Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of λ-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal κ is a tall cardinal if and only if it is either a strong cardinal or a measurable limit of strong cardinals.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of λ-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal κ is a tall cardinal if and only if it is either a strong cardinal or a measurable
limit of strong cardinals.
Key words and phrases:
Tall cardinals, Strong cardinals, Extender models, Core model
2010 Mathematics Subject Classification:
Primary 03E55. Secondary 03E45.
*∗*The author is funded by the European Research Council (grant
agreement ERC-2018-StG 802756) as a postdoctoral fellow at Bar-Ilan
University.
*‡*The author is funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under
Germany’s Excellence Strategy EXC 2044 390685587, Mathematics Münster: Dynamics - Geometry
Structure.
1. Introduction
Tall cardinals appeared in varying contexts as hypotheses in the work of Woodin and Gitik but they were only named as a distinct type of large cardinal by Hamkins in [3].
Definition 1.1**.**
Let α be an ordinal and κ a cardinal. We say that κ is α-tall iff there is an elementary embedding j:V→M such that the following holds:
a)
crit(j)=κ,
2. b)
j(κ)>α,
3. c)
κM⊆M.
We say that κ is a tall cardinal iff κ is α-tall for every ordinal α.
One can compare this notion with that of strong cardinals.
Definition 1.2**.**
Let α be an ordinal and κ a cardinal. We say that κ is α-strong iff there is an elementary embedding j:V→M such that the following holds:
a)
crit(j)=κ,
2. b)
j(κ)>α,
3. c)
Vα⊆M.
We say that κ is a strong cardinal iff κ is α-strong for every ordinal α.
In this paper, working under the hypothesis that there is no inner model with a Woodin cardinal, we present a characterization of λ-tall cardinals in ‘extender models’ (see Definition 2.5) that are ‘self-iterable’ (see Definition 3.10).
Given a cardinal κ, if κ is α-strong then κ is α-tall, and the existence of a strong cardinal is equiconsistent with the existence of a tall cardinal (see [3]). We will prove that the following equivalence holds in extender models:
Corollary A**.**
Suppose that there is no inner model with a Woodin cardinal, V is an extender model of the form L[E] which is iterable. Then given a cardinal κ the following equivalence holds: κ is a tall cardinal iff κ is either a strong cardinal or a measurable limit of strong cardinals.
Remark 1.3*.*
In contrast to Corollary A, Hamkins in [3, Theorem 4.1] adapted Magidor’s results in [6] to prove that it is consistent (assuming the consistency of ZFC plus a strong cardinal) that there is a model of ZFC where there exists a cardinal κ such that κ is a tall cardinal which is neither a strong cardinal nor a limit of strong cardinals. Hence the equivalence from Corollary A does not hold in such model.
An extender111For an introduction to the theory of extender we recommend [5]. is a means of encoding elementary embeddings of models of (fragments of) ZFC in a set-size object. There are various ways to represent extenders.
Extenders are a generalization of measures, in particular, notions such as a ‘critical point’ which are used in the context of measures can also be used when talking about extenders.
Extender models are a generalization of Gödel’s constructible universe that can accommodate large cardinals. In general, given a predicate E, which can be a set or a proper class, L[E] is the smallest inner model222An inner model is a transitive proper class that models ZF. closed under the operation x↦E∩x. Inner models of the form L[E] can be stratified using the J-hierarchy:
•
J∅E=∅,
•
Jα+1E:=rudE({JαE}∪JαE),
•
JγE:=⋃ξ<γJξE for γ a limit ordinal,
•
L[E]=⋃ξ∈ORJξE
where rudE is the closure under rudimentary functions333See [13] for the definition of rudE. and the function x↦E∩x.
We are interested in the special case where E is such that E:OR→V and for every ordinal α, either Eα=∅ or Eα is a partial extender (see Definition 2.5). That is, E is a ‘sequence of extenders’.
Convention**.**
There are different ways of organizing sequences of extenders, we will use Jensen’s λ-indexing (see Remark 2.3).
Definition 1.4**.**
Suppose V is an extender model of the form L[E]. Given a cardinal κ we define444Note that our definitions of O(κ) and o(κ) are not standard, because we do not only consider extenders which are total, but also consider partial extenders. For this reason, our definitions differ from those in other references such as [14] and [1]. o(κ):=otp({β∣crit(Eβ)=κ}) and O(κ):=sup{β∣crit(Eβ)=κ}.
Our main result, Theorem A, is a level-by-level version of Corollary A. The statement of Theorem A uses the notion of μ-stable premouse which is introduced in Definition 3.11.
Theorem A**.**
Suppose that there is no inner model with a Woodin cardinal and that the universe V is an iterable extender model L[E]. Let κ<μ be regular cardinals. Suppose further that L[E]∣μ is μ-stable above κ. Then κisμ-tall iff
[TABLE]
We prove Theorem A in Section 4. The rest of this introduction gives a technical overview of our proof of Theorem A.
In order to prove Theorem A we will need some results from core model theory. Specifically, we shall need the core model K below a Woodin cardinal. This model is an extender model555See [12] for an example where K is not an extender model. that generalizes the covering, absoluteness, and definability properties of L. The following result due to Jensen and Steel guarantees that such a model exists.
Theorem 1.5**.**
([4]) There are Σ2 formulae ψK(v) and ψΣ(v) such that, if there is no inner model with a Woodin cardinal, then
(i)
K={v∣ψK(v)}* is an inner model satisfying ZFC,*
2. (ii)
ψKV=ψKV[g], and ψΣV=ψΣV[g]∩V, whenever g is V-generic over a poset of set size,
3. (iii)
For every singular strong limit cardinal κ, κ+=(κ+)K,
4. (iv)
{v∣ψΣ(v)}* is an iteration strategy for K for set-sized iteration trees, and moreover the unique such strategy,*
5. (v)
K∣ω1* is Σ1 definable over Jω1(R).*
We now describe our strategy for proving Theorem A. One direction is due to Hamkins (see Theorem 4.26 and Theorem 4.27), so we start from the assumption that κ and μ are cardinals such that μ>κ, κ is μ-tall and j witnesses that κ is μ-tall. Note that this implies that κ is measurable and that μ<j(κ).
We now consider two cases. Either κ is a limit of cardinals β such that o(β)>μ, in which case we get the second alternative of the direction we are proving using Lemma 4.23.
So, suppose that κ is not a limit of cardinals β such that o(β)>μ, and then we work towards proving that o(κ)>μ.
As a first step, we combine Lemma 4.12 and Theorem 4.15 to obtain that j is an iteration map coming from an iteration tree T on L[E] such that j=π0,∞T. This is Lemma 4.17. We will spend the main part of the proof of Theorem A analyzing the iteration tree T.
We shall prove that o(κ)>μ by contradiction. That is, we shall start with the assumption that o(κ)≤μ. Then, we will find Θ and β∗ such that β∗<κ≤Θ≤μ and τ∈(β∗,Θ] implies o(τ)<Θ (see Lemma 3.24). Using the upper bounds that we obtain in Section 3 we shall finally prove that j(κ)=π0,∞T(κ)≤Θ≤μ, which will contradict the fact that μ<j(κ)=π0,∞T(κ).
The following is essentially a reformulation of Theorem A which we also prove in Section 4.
Theorem B**.**
Suppose there is no inner model with a Woodin cardinal and L[E] is an extender model that is self-iterable. Let κ, μ be ordinals such that κ<μ and μ is a regular cardinal.
If L[E]∣μ is μ-stable above κ, then (κ is μ-tall)L[E] iff
[TABLE]
It follows that if L[E] is weakly iterable and L[E]∣μ is μ-stable above κ, then (κ is μ-tall)L[E] iff (1) holds.
2. Preliminaries
In this section we summarize the notation that will be used in this paper. We follow closely the notation used in [14].
Definition 2.1**.**
We say that M:=⟨JαE,∈,E↾α,Eα⟩ is an acceptable J-structure iff M is a transitive amenable structure and for every ξ<α and τ<αω if (P(τ)∩Jξ+1E)∖JξE=∅, then there is f:τ→JξE surjective such that f∈Jξ+1E.
Acceptablity is a strong form of GCH. We can define fine structure for acceptable J-structures. Let M be an acceptable J-structure. We shall write (see [14, Chapter 2] ):
•
ht(M) for the ordinal M∩OR,
•
ρn(M) for the n-th projectum of M,
•
PnM for the set of good parameters (i.e., for the set of parameters witnessing ρn(M) is the n-th projectum),
•
pnM for the n-th standard parameter of M (i.e, the least element of PnM where least refers to the canonical well-order of [OR]<ω),
•
hMn,p for the canonical Σ1 Skolem function of Mn,p,
•
h~Mn for the good uniformly Σ1(n−1)(M) function with two parameters which is the result of iterated composition of the Skolem functions of the i-th reducts.
Definition 2.2**.**
Let M=⟨JαA,∈,F⟩ be an acceptable J-structure. We say that M is a coherent J-structure iff there is an αˉ<α
•
F is a whole extender666See [14, p.42] for the definition of extender and [14, p. 53] for the definition of whole extender. in JαˉA where αˉ<α,
•
JαˉA⊨‘‘crit(F) is the largest cardinal”
•
JαA=Ult0(JαˉA,F).
Given β<α we define M∣β:=⟨JβA,∈,E↾ωβ⟩ and M∣∣β:=⟨JβA,∈,E↾ωβ,Eωβ⟩777Depending on the reference M∣∣β and M∣β may have their roles switched. We stick to the notation in [14]..
We say that M:=⟨JαE,∈,E↾ωα,Eωα⟩ is a premouse iff
•
E is a set of triples ⟨ν,x,y⟩ for ν≤α such that, setting
[TABLE]
the structure M∣∣ν is coherent whenever Eων=∅.
•
For every ν≤α, if Eων=∅, then Eων is weakly amenable w.r.t. M∣∣ν.
•
M∣∣ν is sound for every ν<α.
Remark 2.3* (Indexing).*
Notice that implicitly in our definition of a premouse we use λ-indexing, also called Jensen indexing, which means that extenders are indexed at the successor of the image of their critical point under the ultrapower map, i.e., if M is a premouse, EβM=∅, N=Ult0(M∣∣β,EβM) and πEβM:M∣∣β→N is the ultrapower map, then β=πEβM(crit(EβM))+N.
Definition 2.4**.**
Let F be an extender over a premouse M. We denote by λ(F) the image of the critical point of F under the ultrapower map, i.e. if πF:M→Ult0(M,F) is the ultrapower map, we let λ(F)=πF(crit(F)).
Definition 2.5**.**
We say that L[E] is an extender model iff L[E] is a proper class premouse.
3. Upper bounds for the images of ordinals under iteration maps
In this section we define iteration trees888The reader interested in the intuition behind the definition of iteration trees is refered to [7]. and prove general facts about upper bounds for the images of ordinals under iteration maps.
Definition 3.1**.**
A tree T=⟨θ,≤T⟩ on an ordinal θ is an iteration tree iff
a)
[math] is the root of T and each successor ordinal α<θ has an immediate T-predecessor predT(α)<α;
b)
if α<θ is a limit ordinal, then α=sup{ξ<α∣ξ<Tα}
If T⊆θ is an iteration tree, given α<β elements of T we write
(α,β]T={γ∣α<Tγ≤Tβ} and similarly for (α,β)T, [α,β]T.
Definition 3.2**.**
Let M be a sound premouse and θ∈OR. We say that T is an iteration tree T on M with lh(T)=θ iff T is a 6-tuple999When M is a proper class premouse we allow ηα=OR, and formally we use ηα=∅.:
[TABLE]
satisfying:
(a)
T is an iteration tree.
2. (b)
Each Mα is a premouse and M0=M.
3. (c)
⟨πα,β∣α≤Tβ⟩ is a commutative system of partial maps, where πα,β:Mα→Mβ.
4. (d)
Setting ξα=predT(α+1), we have ηα≤ht(Mξα) and for every β<θ there are only finitely many α such that ξα<Tβ and ηα<ht(Mξα).
5. (e)
D⊆θ and α∈D iff ηα<ht(Mξα).
6. (f)
If α+1<θ, setting κα:=crit(EναMα) and τα:=κα+Mα∣∣να, we have τα=κα+Mξα∣∣ηα, EMα↾τα=EMξα↾τα, and
[TABLE]
7. (g)
If α<θ is a limit ordinal, then ⟨Mα,πβ,α∣β<α⟩ is the direct limit of the diagram ⟨Mβ,πβˉ,β∣βˉ≤Tβ<Tα⟩.
Given an iteration T, we denote the objects from the above definition related to T by MαT, ναT, ηαT,DT,TT. We shall often write T instead of TT. We also set:
•
EαT:=EναMαT (the extender used to form Mα+1T),
•
καT:=crit(EαT),
•
λαT:=λ(EαT),
•
ταT:=((καT)+)MαT∣∣ναT and
•
DT:={α+1∣ηαT<ht(MξαT)}.
If in addition lh(T)=γ+1 for some γ∈OR, we write
•
M∞T for the last model MγT in the iteration tree T,
•
[0,γ]T is called the main branch of T, and
•
if β∈lh(T) and β<Tγ, we let πβ,∞T:=πβ,γT.
We say that T is a normal iteration tree iff
•
νβ<να whenever β,α∈lh(T) and β<α;
•
ξα= the least ξ∈B such that κα<λξ;
•
ηα= the maximal η≤ht(Mξα) such that τα=κα+MξαT∣∣η.
Remark 3.3*.*
We stress that the maps πβˉ,βT are partial functions.
Fact 3.4**.**
If T is a normal iteration tree on a premouse M, then the inductive application of the coherency condition yields:
•
MαT∣νβ=MβT∣νβ* whenever β≤α.*
•
If β<α, then νβ is a successor cardinal in MαT, but not a cardinal in MβT when νβT∈MβT.
Convention**.**
In this paper all iteration trees that we will encounter are normal iteration trees. In what follows when we write iteration tree we mean normal iteration tree.
Definition 3.5**.**
Let M be a premouse and T an iteration tree on M such that lh(T) is a limit ordinal. We say that b is a cofinal wellfounded branch through T iff
•
b is a branch through TT cofinal in lh(T),
•
DT∩b is finite,
•
the direct limit along b is well-founded.
Remark 3.6*.*
As we work under the hypothesis that there is no inner model with a Woodin cardinal, it follows that if T is an iteration tree on a premouse M and lh(T) is a limit ordinal then T has at most one cofinal wellfounded branch through T (see [14][Corollary 9.4.7], [11][Theorem 6.10]). In order to simplify notation we will avoid mentioning iteration strategies in our definition of iterability but we warn the reader that this is not how iterability is usually defined. In general, we would need a strategy to choose cofinal branches at limit stages, see [14][p. 290]. For the reader familiar with iteration strategies, as we work under the hypothesis that there is no inner model with a Woodin cardinal, the strategy of any premouse we encounter will always choose the unique cofinal wellfounded branch.
Definition 3.7** (Normal iterability).**
Let α be a limit ordinal or the proper class OR. We say that M is normaly α-iterable iff for any normal iteration tree T on M of length <α the following holds:
(a)
If T is of limit length, then there is a cofinal wellfounded branch b through T.
2. (b)
If T is of successor length γ and γ+1<α and ν≥sup{ναT∣α<γ} is such that EνMγ−1T=∅, then T has a normal extension T′ of length γ+1 with νγ−1T′:=ν. In other words, setting νγ−1T=ν, the ultrapower Ult∗(Mξγ−1T′T′∣∣ηγ−1T′,Eνγ−1T′MγT′) is well founded, where ηγ−1T′ and ξγ−1T′ are determined by the rules of normal iteration trees.
When α=OR and M is normaly OR-iterable we shall omit OR and write that M is normaly iterable.
We shall also need a stronger notion of iterability .
Definition 3.8**.**
Let M be a premouse and n∈ω. We say that T=⟨Tk∣k≤n⟩ is a stack of normal iteration trees on M iff T0 is an iteration tree on M00=M and for every k<n,M0k◃M∞Tk−1 and Tk is a normal iteration tree on M0k.
Definition 3.9** (Iterability for stacks of normal trees).**
Let M be a premouse. We say that M is iterable iff
(a)
If T=⟨Tk∣k≤n⟩ is a stack of iteration trees on M, then M∞Tn is normaly iterable.
2. (b)
If T=⟨Tn∣n∈ω⟩ is a stack of iteration trees on M such that for each n∈ω, M∞Tn is normaly iterable, then for all sufficiently large n∈ω we have that DTn∩bTn=∅, where bTn is the main branch of T so that τn:M0n→M∞Tn=M0n+1 is defined for all n sufficiently large. Moreover, the direct limit of the M0n’s under the τn’s is wellfounded.
Definition 3.10** (Self-iterability).**
If L[E] is an extender model, we say that L[E] is self-iterable iff the following sentence in the language {∈,E˙} holds:
[TABLE]
The following definition is a slight variation of the notion of stable premouse defined in [4].
Definition 3.11**.**
Let M be a premouse and μ a regular cardinal and κ∈μ. If M∩OR≤μ we say that M is μ-stable above κ iff one of the following holds:
(1)
M∩OR<μ, or
2. (2)
M∩OR=μ and one of the following holds:
(a)
(There is no largest cardinal)M, or
2. (b)
There is γ<μ such that (γ is the largest cardinal ∧cf(γ)<κ)M, or
3. (c)
There is γ<μ such that (γ is the largest cardinal ∧cf(γ)≥κ)M and there is no β such that EβM is a total measure on M with critical point cfM(γ).
The next lemma shows that given a regular cardinal μ, under very general conditions the ultrapower of a premouse M of height ≤μ by an extender F with λ(F)<μ, has height ≤μ.
Lemma 3.12**.**
Let μ be a regular cardinal and M a sound101010Soundness implies that M=hMn(ρn(M)∪{pn,M}) for all n∈ω. premouse such that M∩OR≤μ. Let κ<α≤μ and F be such that:
•
F* is an extender over M∣∣α and α is the largest ordinal ≤μ with this property.*
•
Ultn(M∣∣α,F)* is well founded, where n is the largest k≤ω such that crit(F)<ρk(M).*
•
λ(F)<μ.
•
(κ≤crit(F)∧crit(F)+ exists)M∣∣α.
Suppose further that if α=μ and there is γ<α such that
[TABLE]
and (cf(γ)≥κ)M∣∣α,
then (crit(F)=cf(γ))M∣∣α.
Then
[TABLE]
Moreover if α<μ the above inequality is strict and if α=μ then equality holds.
Proof.
We split the analysis into two cases: α<μ and α=μ and the second case splits further into two subcases.
∙ Suppose α<μ. Notice that for n>0 the set
[TABLE]
has cardinality ≤∣α∣.
Therefore
[TABLE]
which implies Ultn(M∣∣α,F)∩OR<μ.
∙ Suppose α=μ. Since M is sound, ρω(M)=μ and n=ω. Let iF:M→Ult0(M,F) be the ultrapower map derived from F.
We split this case into two subcases:
▶ Suppose there is γ such that (γ is the largest cardinal)M:
Claim 3.13**.**
If iF(γ)<μ, then Ult0(M,F)∩OR≤μ
Proof.
For a contradiction suppose that iF(γ)<μ and that there is ξ∈Ult0(M,F) such that ξ≥μ. The ultrapower map iF is cofinal in Ult0(M,F), therefore there is β∈μ such that iF(β)≥ξ≥μ. Let
[TABLE]
The formula ∃hφ(β,γ,h) is Σ1 and therefore it is preserved by iF and
[TABLE]
Fix h∈Ult0(M,F) which witnesses (2). As φ(iF(β,iF(γ)),h) is Σ0 and Ult0(M,F) is transitive it follows that φ(iF(β,iF(γ)),h) holds in V. Therefore h is a surjection from iF(γ) onto iF(β). As iF(γ)<μ and iF(β)>μ this contradicts our hypothesis that μ is a cardinal.
∎
Next we verify iF(γ)=supξ<γ(ξ).
Let ζ∈iF(γ) and let f∈M, a∈λ(F)<ω be such that f:crit(F)→γ and [a,f] represents ζ in the ultrapower of M by F. From the hypothesis in our lemma, if cfM(γ)≤κ or cfM(γ)>κ in both cases we have cfM(γ)=crit(F).
Then (i) or (ii) below must hold:
(i)
cfM(γ)>crit(F) implies that there is ξ<γ such that sup(ran(f))<ξ,
2. (ii)
cfM(γ)<crit(F) implies that there is ξ<γ such that {u∈crit(F)∣a∣∣f(u)∈ξ}∈Fa.
Thus we can find ξ<γ such that [a,f]∈iF(ξ)∈iF(γ). Hence iF(γ)=supξ<γiF(ξ).
Claim 3.14**.**
Given ξ<γ, it follows that
[TABLE]
Proof.
From our hypothesis that λ(F)<μ, since γ is the largest cardinal of M, it follows that ∣λ(F)∣M≤γ.
From our hypothesis that crit(F)+M exists in M, it follows that crit(F)+≤γ.
Notice that ξ<γ and δ<γ imply ∣ξcrit(F)∣M≤γ.
∎
Therefore from the above claim and the regularity of μ we have:
[TABLE]
▶ Suppose (there is no largest cardinal)M. Since iF is cofinal in Ult0(M,F) it will be enough to verify that iF(ξ)<μ for all ξ<μ. Given ξ<μ, similarly as in the proof of Claim 3.14 we get that ∣iF(ξ)∣≤max{(∣ξcrit(F)∣)M,crit(F)+M,∣λ(F)∣}<μ.
∎
Using induction and Lemma 3.12 we can obtain the following:
Lemma 3.15**.**
([4, Lemma 4.8])
Let μ be a regular cardinal in V, κ an ordinal such that κ<μ and M is a sound premouse that is μ-stable above κ. Let T be an iteration tree on M such that lh(T)<μ and, for all β+1<lh(T), crit(EβT)≥κ. Then β∈lh(T) implies MβT∩OR≤μ.
Definition 3.16**.**
Given a premouse M, μ∈M∩OR and a normal iteration tree
[TABLE]
on M, we say that T lives on M∣μ iff
[TABLE]
such that M0U=M∣μ, TT=TU and ⟨νβU∣β<θ⟩=⟨νβT∣β<θ⟩ is a normal iteration tree on M∣μ.
We will denote U by T↾(M∣μ) and call it the restriction of T to M∣μ.
Remark 3.17*.*
In Definition 3.16 the sequence ⟨ηβU∣β∈BU⟩ is determined by the other parameters in U and the requirement that U is normal.
Lemma 3.18**.**
Let μ be a regular cardinal, κ an ordinal such that κ<μ and M be a proper class premouse. Suppose that M∣μ is μ-stable above κ. Let T be an iteration tree on M that lives on M∣μ and for all β+1∈lh(T) we have crit(EβT)≥κ and lh(T)<μ. Let U=T↾M∣μ. Then for all β∈lh(T), the following holds:
(a)β
If DT∩[0,β]T=∅, then
–
π0,βT(μ)* is defined,*
–
π0,βT(μ)=supγ<μ(π0,βT(γ))=μ**
–
MβT∣μ=MβU.
(b)β
If DT∩[0,β]T=∅, then MβT=MβU.
Proof.
We proceed by induction. Suppose β∈lh(T) and (a)γ and (b)γ holds for all γ<β. We split the analysis into two cases, β is a successor ordinal or β is a limit ordinal.
∙ Suppose β=δ+1 for some ordinal δ. We again need to divide into two subcases based on whether DT∩[0,β]T is empty or not.
▶ Suppose DT∩[0,β]T=∅. Then π0,βT(μ) is defined. Recalling our notation from Definition 3.2, ξδT=predT(β) and ηδT is the largest ordinal such that EδT is a total extender over MξβTT∣∣ηδT.
As DT∩[0,β]T=∅, it follows that MξδTT is a proper class and MβT is the Σ0-ultrapower of MξδTT by EδT.
Hence, given ζ<πξδ,δT(μ), there are a∈lh(EδT)<ω and f∈MξδTT, f:(crit(EδT))∣a∣→μ such that [a,f]EδT represents ζ in Ult0(MξδTT,EδT).
As μ is a regular cardinal there is Υ<μ such that sup(ran(f))<Υ<μ and therefore ζ<πξδ,βT(Υ)<πξδ,βT(μ).
By our induction hypothesis we have
[TABLE]
Therefore,
[TABLE]
and by Lemma 3.15 applied to U↾β+1 for all γ<μ we have πξδ,βU(γ)<μ.
Thus for γ=Υ we have ζ<πξδ,βT(Υ)<μ.
Therefore,
[TABLE]
and
[TABLE]
▶ Suppose DT∩[0,β]T=∅. We need to further subdivide into two subcases depending on whether DT∩[0,ξδT] is empty or not.
⋆
If DT∩[0,ξδT]T=∅, then β∈DT and by induction hypothesis we have MξδTT∣μ=MξδTU and EδT is not a total extender on MξδTT.
As MξδTT is an acceptable J-structure, it follows that
[TABLE]
Hence, if ηδT≥μ, it follows that EδT is a total extender on MξδT and β∈DT, which is a contradiction as we are assuming that β∈DT.
Therefore ηδT<μ, ηδT=ηδU and by our induction hypothesis
[TABLE]
Then
[TABLE]
⋆
If DT∩[0,ξδT]T=∅, then by our induction hypothesis MξδTT=MξδTU, so
[TABLE]
∙ Suppose β is a limit ordinal. Again, we divide into two subcases based on whether DT∩[0,β]T is empty or not.
▶ Suppose DT∩[0,β]T=∅. Given γ<π0,βT(μ), we have that ζ<γ iff there are βˉ∈[0,β)T and ζˉ<γˉ<μ=π0,βˉT(μ) such that πβˉ,βT(ζˉ)=ζ and πβˉ,βT(γˉ)=γ.
By a cardinality argument it follows that γ<μ. Therefore π0,βT(μ)≤μ and
[TABLE]
▶ Suppose DT∩[0,β]T=∅, let ζ be the largest element in DT∩[0,β]T. Then by induction hypothesis
[TABLE]
∎
Remark 3.19*.*
Given a proper class premouse L[E] and a regular cardinal μ such that L[E]∣μ is μ-stable above κ, our next result, Lemma 3.20, gives a sufficient condition on iteration trees T on L[E] for T to live on L[E]∣μ.
Lemma 3.20**.**
Let μ be a regular cardinal. Suppose M is a proper class premouse and T is a finite 111111This lemma remains true if we drop the hypothesis that T is finite. iteration tree on L[E] such that for all β+1∈lh(T) we have crit(EβT)>κ and lh(T)<μ. Suppose further that L[E]∣μ is μ-stable above κ.
If for all β∈lh(T) we have νβT<μ, then T lives on M∣μ.
Proof.
We define recursively an iteration tree U on M∣μ such that lh(U)≤lh(T) as follows: If U∣β is defined, β∈T, MβU∩OR≥νβT and MβU∣∣νβT=MβT∣∣νβT, then we let νβU=νβT, otherwise we let νβU be undefined and lh(U)=β.
Suppose β∈lh(T), β+1<lh(T) and β<lh(U), we will verify that β+1<lh(U).
▶ If DT∩[0,β]T=∅, by Lemma 3.18 applied to T↾β+1 we have MβT∣μ=MβU.
Hence νβT<μ=MβU∩OR and MβU∣∣νβT=MβT∣∣νβT.
▶ If DT∩[0,β]T=∅, then by Lemma 3.18 applied to T↾β+1 we have MβT=MβU.
Therefore νβT∈MβU∩OR and MβU∣∣νβT=MβU∣∣νβT. ∎
Remark 3.21*.*
(a)
Suppose that V is an extender model L[E], λ is a cardinal and T is an iteration tree on L[E] such that supα∈lh(T)ναT<λ+. Then by Lemma 3.20 for μ:=λ++L[E] we have that T lives on L[E]∣μ. Notice that L[E]∣μ and T are in the hypothesis of Lemma 3.15. So in particular if U=T↾(L[E]∣μ) is the restriction of T to L[E]∣μ, then for all β∈lh(U) it follows that MβU∩OR≤μ.
2. (b)
Our hypotheses on Lemma 3.18 are optimal in the following sense: suppose that μ is a regular cardinal and there is γ<μ such that
[TABLE]
If there is β∈μ such that (crit(Eβ)=cf(γ))L[E] and Eβ is a total measure in cfL[E](γ), then Ult0(L[E]∣μ,Eβ)∩OR>μ.
3. (c)
In Lemma 4.38 we show that we can not drop the hypothesis that L[E]∣μ is μ-stable above κ in the statement of Theorem A. In the proof of Lemma 4.38 we use Remark 3.21 (b).
Lemma 3.22**.**
[8, Lemma 1.1]** Let M=⟨JαE,∈,E,F⟩ be an iterable premouse, where F=∅ . Suppose that for no μ≤M∩OR do we have
[TABLE]
Set κ=crit(F) and let ξ∈(κ,ρ1(M)). Then there is some ν~∈(ξ,ξ+M) with crit(Eν~)=crit(F).
Lemma 3.23**.**
Suppose that V is a proper class premouse L[E] that is iterable. Let κ<μ be cardinals. Then
[TABLE]
Moreover,
[TABLE]
Proof.
Notice that if X⊆OR, then otp(X)≤sup(X). From this general fact it follows that o(κ)>μ implies O(κ)>μ. For the other direction we split the analysis into two cases.
▶ Suppose first that μ is a limit cardinal and O(κ)>μ. We will verify that o(κ)>μ. For that we show that given a regular cardinal χ<μ such that κ<χ the following holds:
[TABLE]
Let α>χ be such that crit(Eα)=κ and let M=JαL[E]. Then ρ1(M)≥χ.
Given ξ<χ, by Lemma 3.22 there is ξ~∈(ξ,ξ+M) such that crit(Eξ~M)=κ. As ξ was arbitrary the equality in (3) follows.
Thus (3) holds for any regular cardinal χ such that κ<χ<μ. Therefore
[TABLE]
Then otp({β<μ∣crit(Eβ)=κ})≥μ. Notice that
[TABLE]
where ⊕ represents the ordinal sum. As O(κ)>μ we have
[TABLE]
Therefore o(κ)≥μ+1>μ.
▶ Suppose μ=θ+ and suppose O(κ)>μ. Fix α such that α>μ with crit(EαM)=κ and consider M=JαL[E]. We have ρ1(M)≥μ and given ξ∈(κ,μ), by Lemma 3.22, there is ξ~∈(ξ,ξ+M) such that crit(Eξ~M))=κ. Hence
For the second part, suppose o(κ)=μ, then O(κ)≤μ, otherwise by the first part we would have o(κ)>μ. Hence O(κ)=μ. For the other direction again we split the analysis into two cases:
▶ Suppose O(κ)=μ and μ is a limit cardinal. Given χ a regular cardinal, such that κ<χ<μ we have by the first part of the lemma that o(κ)>χ. Hence o(κ)≥μ and thus o(κ)=μ.
▶ Suppose O(κ)=μ and μ=θ+ for some cardinal θ. Since μ is a regular cardinal it follows that o(κ)=μ.
∎
Lemma 3.24**.**
Suppose V is an extender model L[E] which is iterable. Let κ and μ be cardinals, such that κ<μ. Suppose that O(κ)≤μ, {α<κ∣O(α)>μ} is bounded in κ and κ<O(κ) 121212For example, when there exists a total measure indexed on E with critical point κ we have κ+<O(κ). . Let
[TABLE]
and
[TABLE]
Then there is no η∈(β∗,Θ] such that O(η)>Θ.
Proof.
Suppose otherwise. Let Eα be such that α>Θ and η:=crit(Eα)∈(β∗,Θ] and let M∗ be the largest initial segment of L[E] where we can apply Eα. Let N:=Ult0(M∗,Eα) and π:M∗→N the ultrapower map.
We split the analysis into two cases and the second case will split into two subcases.
and hence EΘ=∅, as extenders are not indexed at cardinals. Therefore
[TABLE]
and Θ is a limit of ordinals γ such that crit(Eγ)∈(β∗,κ].
Let φ(Θ,β∗,κ) be the following formula:
[TABLE]
Note that φ(Θ,β∗,κ) is a Σ0-formula in the language {∈,E˙}.
We have
[TABLE]
and therefore
[TABLE]
Notice that O(κ)>κ implies Θ≥O(κ)>κ. Hence by Σ1-elementarity of πEα we have:
[TABLE]
Thus, in N, πEα(Θ) is a limit of indexes of extenders with critical points in the interval (β∗,κ]. Notice that as crit(Eα)=Θ then Θ<πEα(Θ). Therefore there is γ such that
Θ<γ<πEα(Θ) and crit(EγN)∈(β∗,κ].
As N∣α=M∗∣α and α=πEα(Θ)+N, it follows that EγN=Eγ.
But Θ<γ and crit(Eγ)∈(β∗,κ] contradict the definition of Θ.
∙ Suppose η<Θ.
We split this case into two subcases (see Figures 2 and 3):
▶ Suppose η<Θ and λ(Eα)≤Θ.
Then
[TABLE]
and by Σ0-elementarity there is a γ∈(α,πEα(Θ)) such that EγN=∅ and
[TABLE]
From (αis a cardinal)N,
it follows that ρ1(JγN)≥α for any γ∈(α,πEα(Θ)).
Since α=λ(Eα)+N and α>Θ, we have that
[TABLE]
it follows by Lemma 3.22 that there is γ′∈(Θ,Θ+N) such that Eγ′N=∅ and crit(Eγ′N)=crit(EγN). As Θ+N≤α and M∗∣α=N∣α, we have Eγ′N=Eγ′, which contradicts the definition of Θ.
▶ Suppose η<Θ and λ(Eα)>Θ.
In this case πEα(Θ)>λ(Eα)>Θ. Then for all γ such that
γ∈(λ(Eα),πEα(Θ)) we have
[TABLE]
Then like in case 2 (i) we can find an extender in the sequence of L[E] that is indexed in the interval (Θ,λ(Eα)) with critical point in the interval (β∗,κ], contradicting the definition of Θ.
∎
4. Equivalence
In this section we prove Theorem A and Theorem B. We will need some results from core model theory before we start with the proofs of Theorems A and B.
Remark 4.1*.*
Suppose there is no inner model with a Woodin cardinal and let K be the core model. If κ is an ordinal and Ξ is a singular strong limit cardinal above κ, then by (iii) of Theorem 1.5
there is β∈Ξ+ such that β is the least ordinal such that EβK is a total measure over K∣Ξ+ with crit(EβK)=cfK(Ξ) and cfK(Ξ)≥κ.
Definition 4.2**.**
Suppose there is no inner model with a Woodin cardinal and let K be the core model. If κ is an ordinal and Ξ is a singular strong limit cardinal above κ we say that W is the * (Ξ+,κ)-stabilization of K* iff
(a)
W=K∣Ξ+ and K∣Ξ+ is Ξ+-stable above κ, or
2. (b)
W=Ult0(K,EβK)∣Ξ+ where β is the least measure indexed in the sequence of K that is total in K∣Ξ+ with crit(EβK)=cfK(Ξ) and cfK(Ξ)≥κ.
Definition 4.3**.**
Let M be a premouse and κ an ordinal such that κ∈M. We say that κ is a * strong cutpoint of M* iff for all α≤M∩OR such that α>κ we have that either EαM=∅ or crit(EαM)>κ.
The following is a slight variation of [4, Proposition 4.4].
Lemma 4.4**.**
[4, Proposition 4.4]** Let Ω be a regular cardinal and κ∈Ω. Suppose that W is Ω-stable above κ, (Ω+1)-iterable, κ is a strong cutpoint of W and W has a largest cardinal.
Then for every sound premouse M such that:
•
M* is (Ω+1)-iterable,*
•
M∩OR<Ω,
•
M∣∣κ=W∣∣κ,
•
κ* is a strong cutpoint of M,*
we have that there are141414These iteration trees are obtained by the so called Comparison Lemma, see [11, Section 3.2] or [14, Lemma 9.1.8]. iteration trees T and U on W and M respectively such that
(a)
for bU the main branch of U we have DU∩bU=∅,
2. (b)
M∞U* is sound,*
3. (c)
M∞U◃M∞T,
4. (d)
for every α∈T and for every β∈U we have ναT,νβU>κ.
The following lemma is standard but we include it for the reader’s convenience.
Lemma 4.5**.**
Suppose there is no inner model with a Woodin cardinal and let K be the core model. Let κ be an ordinal and M a sound iterable premouse. Suppose
•
κ* is a strong cutpoint of K and M,*
•
M∣∣κ=K∣∣κ, and
•
ρω(M)≤κ.
Then M◃K.
Proof.
Let κ be as in the hypotheses of the lemma and let Ξ be a singular strong limit cardinal such that cf(Ξ)>κ. Let W be the (Ξ+,κ)-stabilization of K∣Ξ+.
We can apply Lemma 4.4 to M, W and κ. Let T and U be iteration trees given by Lemma 4.4 where T is on W and U is on M.
Claim 4.6**.**
For all α∈lh(U) we have crit(EαU)≥κ and κ is a strong cutpoint of MαU.
Proof.
We prove the claim by induction on α∈lh(U).
Suppose that α∈lh(U) and that for all β<α we have that κ is a strong cutpoint of MβU and crit(EβU)>κ.
▶ Suppose α is a limit ordinal. Let γ∈[0,α]TU be large enough such that DU∩(γ,α]TU=∅ and hence dom(πγ,αU)=MγU, so πγ,αU is not a partial map but has full domain.
As κ<crit(EβU) for all β<α, it follows that πα,βU(κ)=κ. As κ is a strong cutpoint of MγT it follows, by the Σ1-elementarity of πγ,αU, that κ is a strong cutpoint of MαU. Since ναU>κ, it then follows that crit(EαU)>κ.
▶ Suppose α=γ+1 for some γ∈OR. From our induction hypothesis we have that κ is a strong cutpoint of MξαUU, therefore κ is a strong cutpoint of MξαU∣∣ηαU. By the Σ1-elementarity of πξα,αU↾(MξαU∣∣ηαU) it follows that κ is a strong cutpoint of MαU. As ναU>κ, it follows that crit(EαU)>κ.
∎
Claim 4.7**.**
M=M∞U.
Proof.
Suppose not, and let EαU be the first extender applied to M0U such that α+1∈bU, where bU is the main branch of the iteration tree U. By Claim 4.6 it follows that crit(EαU)>κ.
Let n∈ω be the least such that ρn(M)≤κ. By standard arguments ρn(Mα+1U)=κ, but
[TABLE]
Therefore Mα+1U is not n-sound, which contradicts the fact that every element in bU is sound. Hence U is trivial and M=M∞U.
∎
Notice that if DT∩bT=∅ then W∩OR≥Ξ+ and if DT∩bT=∅ by arguments similar to the proof of Claim 4.7 it follows that M∞T is not sound. In both cases we cannot have M=M∞T as M∩OR<Ξ and M is sound.
Therefore M is a proper initial segment of M∞T.
Claim 4.8**.**
W=M∞T.
Proof.
Suppose E0U=∅. Then ν0T≤M∩OR and ν0T is a successor cardinal in M∞T. On the other hand M=h~Mn(κ∪{pnM})◃M∞T and as M is a proper initial segment of M∞T it follows that
[TABLE]
contradicting that
[TABLE]
Thus, T must be trivial and M∞T=W.
∎
If W=K∣Ξ+ we are done, so suppose W=Ult0(K,EβK)∣Ξ+ where EβK is the least total measure indexed on the sequence EK with critical point cfW(Ξ)≥κ.
As M is a proper initial segment of W and
[TABLE]
it follows that M∩OR<β. As W∣β=K∣β, it follows that M◃K.
∎
Remark 4.9*.*
Theorem 4.10 implies Lemma 4.4 for κ>ℵ2V. We will use Lemma 4.4 and Theorem 4.10 to prove Lemma 4.12.
Theorem 4.10**.**
[2, Lemma 3.5]** If there is no inner model with a Woodin cardinal, K is the core model and κ≥ℵ2V is a K-cardinal, then for every sound iterable mouse M such that M∣∣κ=K∣∣κ and ρω(M)≤κ it holds that
[TABLE]
Definition 4.11**.**
We define the following hypothesis:
[TABLE]
Lemma 4.12** (Steel).**
Assume (Δ). Then V=K.
Proof.
By Theorem 1.5 we can build K, the core model. We prove by induction on the cardinals κ of V that K∣∣κ=L[E]∣∣κ.
Claim 4.13**.**
K∣∣ℵ2=L[E]∣∣ℵ2**
Proof.
Because of acceptability and soundness there are cofinally many α<ω1 such that ρω(L[E]∣∣α)=ω. Fix such an α<ω1, and let M=L[E]∣∣α. We have that M is a sound iterable premouse such that M∣∣ω=K∣∣ω. Hence, by Lemma 4.5 it follows that M◃K.
Thus
[TABLE]
Again by acceptability and soundness there are unboundedly many β<ℵ2 such that ρω(L[E]∣∣β)=ω1. We fix such a β and consider N=L[E]∣∣β.
As K∣ω1=L[E]∣ω1, it follows that N∣ω1=K∣ω1 and as ω1 is a cardinal it follows that N∣∣ω1=K∣∣ω1.
Subclaim 4.14**.**
ω1* is a strong cutpoint of L[E] and K.*
Proof.
We start by verifying this for L[E]. Suppose γ>ω1 and Eγ=∅. Then ω1L[E]∣∣γ=ω1. From (crit(Eγ) is a limit cardinal)L[E]∣∣γ it follows that crit(Eγ)>ω1.
Next we verify it for K. From Claim 4.13 we have K∣∣ω1=L[E]∣∣ω1. Therefore ω1K=ω1. Suppose γ>ω1 and crit(EγK)=∅. Then ω1K∣∣γ=ω1. From (crit(EγK) is a limit cardinal)K∣∣γ it follows that crit(EγK)>ω1. ∎
Thus, by Lemma 4.5 it follows that N◃K. Therefore we have K∣ℵ2=M∣ℵ2. Since extenders are not indexed at cardinals we have Eℵ2K=∅=Eℵ2. Then K∣∣ℵ2=L[E]∣∣ℵ2.
∎
Now suppose κ>ℵ2 is a successor cardinal in V, say κ=μ+ and K∣∣μ=L[E]∣∣μ. Then by Theorem 4.10
for every ξ∈(μ,κ) such that ρω(L[E]∣∣ξ)≤μ we have L[E]∣∣ξ◃K. Thus as there are unboundedly many such ξ below κ it follows that K∣κ=L[E]∣κ. As Eκ=∅=EκK it follows that K∣∣κ=L[E]∣∣κ.
Lastly, suppose κ is a limit cardinal in V and for every cardinal μ<κ we have L[E]∣μ=K∣μ, then L[E]∣κ=K∣κ. As κ is a cardinal, it follows that Eκ=∅=EκK. Therefore K∣∣κ=L[E]∣∣κ.
This concludes the induction and verifies the lemma.
∎
Theorem 4.15**.**
[9, Theorem 2.1]** If there is no inner model151515We have omitted the hypothesis that P(R)⊆M since we start from the hypothesis that there is no inner model with a Woodin cardinal which is stronger than the hypothesis in [9, Theorem 2.1]. with a Woodin cardinal and j:V→M is an elementary embedding and Mω⊆M, then there is an iteration tree T on KV which does not drop along the main branch such that M∞T=KM and j∣K=π0,∞T.
Definition 4.16**.**
Suppose there is no inner model with a Woodin cardinal. Given j:V⟶M an elementary embedding, let T and U be the iteration trees obtained by comparing161616Given two iterable premice M and N the comparison between (or coiteration of) M and N is the process of iterating M and N so that at each sucessor step α+1 the extenders Eα+1T and Eα+1U are the least extender in the sequences of MαT and MαU where there is a disagreement. The last models of these iterations should line up, i.e., M∞T▹M∞U or vice versa. See [11, Section 3.2] or [14, Lemma 9.1.8] . KV and KM respectively. Then we say that T is the iteration tree induced byj.
The next lemma makes it clear how we would like to combine Theorem 4.15 and Lemma 4.12.
Lemma 4.17**.**
Assume (Δ). Suppose that j:V→M and Mω⊆M. Then there is T an iteration tree on L[E] induced by j such that:
(a)
There is no drop along the main branch bT of T.
2. (b)
π0,∞T:M0T⟶M∞T, i.e., dom(π0,∞T)=M0T.
3. (c)
π0,∞T=j.
4. (d)
M∞T=M.
Proof.
Apply Theorem 4.15 to j and M and let T be the iteration tree on K induced by j. Apply lemma 4.12 to obtain K=V and hence π0,∞T=j. Thus T and π0,∞T are as sought.
Let us verify (d). Let ψK(x) be as in Theorem 1.5 such that x∈K if and only if ψK(x). By Lemma 4.12 we have (∀xψK(x))L[E], then by the elementarity of j we have (∀xψK(x))M. Therefore M=KM=M∞T, where we get the last equality by Theorem 4.15.
∎
Lemma 4.18**.**
Let M be a premouse and T be an iteration tree on M. If lh(T)≥ω+1, then (M∞T)ω⊆M∞T.
Proof.
Suppose lh(T)≥ω+1 and b=[0,ω]T is the cofinal branch on ω. Let ⟨κn∣n∈ω∩b⟩ be such that
[TABLE]
where n0 is large enough such that DT∩(n0,ω)T=∅, and for n∈b∩n0 we set κn=∅. Denote κ:=⟨κn∣n∈ω∩b⟩.
Claim 4.19**.**
⟨κn∣n∈ω∩b⟩∈MωT.
Proof.
For a contradiction suppose κ∈MωT, and let m∈ω∩b and x∈MmT such that
[TABLE]
Then
[TABLE]
This is a contradiction since crit(πm,ωT)∈ran(πm,ωT). Therefore κ∈MωT.
∎
The lemma will follow from our next claim:
Claim 4.20**.**
If κ∈M∞T, then κ∈MωT.
Proof.
If lh(T)=ω+1, then M∞T=MωT and there is nothing to do in this case.
Let us assume lh(T)>ω+1. The normality of T implies the following:
[TABLE]
By Fact 3.4, it follows that νωT is a successor cardinal in Mω+1T. Since sup{νmT∣m+1∈(ω∩b)} is clearly a limit cardinal in Mω+1T, we have that the second inequality in (8) is in fact a strict inequality.
Hence if (M∞T)ω⊆M∞T and lh(T)≥ω+1, by Claim 4.20 it follows that κ∈MωT which by Claim 4.19 is a contradiction.
∎
Lemma 4.21**.**
Assume (Δ). If κ<α are ordinals, j:L[E]⟶M witnesses that κ is α-tall, and T is the iteration tree induced by j, then T is finite.
Proof.
Let T be the iteration tree induced by j. Lemma 4.17 implies that
π0,∞T=j and M∞T=M. We have that Mω⊆M as j:V→M witnesses that κ is α-tall. Hence, by Lemma 4.18, T is finite.
∎
Lemma 4.22**.**
Assume (Δ). Let κ be a cardinal. Suppose j:V→M is an elementary embedding such that crit(j)=κ and Mκ⊆M. If T is the iteration tree induced by j, then for α∈lh(T) we have that crit(EαT)≥κ.
Proof.
Suppose for a contradiction that there is an α∈lh(T) such that crit(EαT)<κ. Let πEαT:MαT∣∣ναT→Ult0(MαT∣∣ναT,EαT) be the ultrapower map and ταT=crit(EαT)+MαT∣∣ναT. Since MαT is a premouse, it follows that ran(πEαT↾τα) is cofinal in ναT.
Notice that ταT≤κ. Hence by Mκ⊆M it follows that
[TABLE]
On the other hand by Lemma 4.17 we have M∞T=M and by Fact 3.4,
[TABLE]
This is a contradiction. Therefore for all α∈lh(T) we have crit(EαT)≥κ.
∎
We remind the reader that our definitions of o(κ) and O(κ) are different from the usual ones. For the usual definitions the following lemma would be false.
Lemma 4.23**.**
Assume (Δ). If κ is a measurable cardinal171717The fact that the first part of this lemma holds under much weaker hypothesis is due Schlutzenberg, see [10]. Here we are working with the hypothesis that (Δ) holds which makes it easy to verify the lemma. , then o(κ)>κ+. If μ is a cardinal, cf(μ)>κ and κisμ-strong, then o(κ)>μ.
Proof.
Let j:L[E]→M witness either that κ is measurable or that κ is μ-strong. Because cf(μ)>κ in both cases we have that Mκ⊆M.
Let T be the iteration tree induced by j and let EαT be the first extender applied to M0T such that α+1∈bT, the main branch of T. Since crit(j)=crit(π0,∞T)=κ and T is a normal iteration tree, it follows that crit(EαT)=κ.
Claim 4.24**.**
If j witnesses that κ is μ-strong, then ν0T>μ.
Proof.
Suppose not. Then ν0T≤μ, and since we do not index extenders on cardinals it follows that ν0<μ. Hence,
[TABLE]
Since
[TABLE]
it follows that
[TABLE]
But M∞T=M and M∞T⊨‘‘ν0Tis regular cardinal", which is a contradiction. ∎
▶ Suppose α=0. We split our analysis into two cases depending on whether j witnesses that κ is a measurable cardinal or j witnesses that κ is μ-strong.
Suppose j witnesses that κ is a measurable cardinal. As α=0, it follows that E0T is a total measure over L[E] which implies that ν0T>κ+. Therefore E0T witnesses that O(κ)>κ+. By Lemma 3.23 we have o(κ)>κ+.
Suppose j witnesses that κ is μ-strong. In this case, by Claim 4.24 it follows that E0T witnesses O(κ)>μ. Therefore by Lemma 3.23 it follows that o(κ)>μ.
▶ Suppose we are in the case where α>0.
Claim 4.25**.**
If j witnesses that κ is measurable, then for every γ≥ναT we have ρ1(MαT∣∣γ)>κ+ . If j witnesses that κ is μ-strong, then for every γ≥ναT we have ρ1(MαT∣∣γ)>μ.
Proof.
Suppose j witnesses that κ is a measurable cardinal. By Lemma 4.22 it follows that κ≤crit(E0T)<ν0T. As M0T∣ν0T=MαT∣ν0T it follows that κ+M0T∣ν0T=κ+MαT<ν0T. Since crit(EαT)=κ, α+1∈DT and EαT is the first extender used along the main branch of T, altogether we have that κ+=κ+Mα. Hence κ+<ν0T.
As every initial segment of M0T is sound, it follows that ρ1(M0T∣γ)≥κ+ for any γ≥ν0T. Hence one can verify by induction along the branch (0,α]T that ρ1(MβT∣∣γ)>κ+ for any β∈(0,α]T and any γ≥ν0T.
Next suppose j witnesses that κ is a μ-strong cardinal. Then ναT>ν0T>μ, where the second inequality is Claim 4.24 and we have ρ1(M0T∣∣γ)≥μ for any γ≥ν0T. Again, by induction along (0,α]T one can verify that ρ1(MβT∣∣γ)>μ for any β∈(0,α]T and any γ≥ν0T.
∎
We again split our analysis depending on whether j witnesses that κ is a measurable cardinal or j witnesses that κ is μ-strong.
Suppose j witnesses that κ is a measurable cardinal. By Claim 4.25 we have ρ1(MαT∣∣ναT)≥κ++Mα∣∣ναT, hence we can apply Lemma 3.22 to MαT∣∣ναT and EαT to find EγMαT with crit(EγMαT∣∣ναT)=κ and γ∈(κ+,κ++MαT∣∣ναT). As ν0T>κ++MαT∣∣ναT it follows that EγMαT=Eγ. Therefore O(κ)>κ+ and by Lemma 3.23 we have o(κ)>κ+.
Suppose j witnesses that κ is a μ-strong cardinal. By Claim 4.25 we have ρ1(MαT∣∣ναT)≥μ+Mα∣∣ναT, hence we can apply Lemma 3.22 to MαT∣∣ναT and EαT to find EγMαT with crit(EγMαT∣∣ναT)=κ and γ∈(κ+L[E],μ+MαT∣∣ναT). As ν0T≥μ+MαT∣∣ναT it follows that EγMαT=Eγ. Thus O(κ)>μ which by Lemma 3.23 implies o(κ)>μ. ∎
We now have all the technical tools we need to prove Theorem A. We shall use the following two results due to Hamkins which establish one direction of Theorem A.
(⇒) Since κ is μ-tall, we have that κ is measurable and hence by Lemma 4.23 we also have that o(κ)>κ+.
Suppose that κ>sup({α<κ∣o(α)>μ}). We will verify that o(κ)>μ. Towards a contradiction, suppose that o(κ)≤μ.
By 3.23, sup({β<κ∣o(β)>μ})<κ implies that sup({β<κ∣O(β)>μ})<κ. Let
[TABLE]
and set
[TABLE]
Notice that Θ≤μ: by Lemma 3.23, o(κ)≤μ implies O(κ)≤μ and the definition of β∗ implies that sup({O(β)∣β∗<β<κ})≤μ.
Let j:V→M witnesses the μ-tallness of κ and let T be the iteration tree induced by j. Lemma 4.17 gives that j=π0,∞T and M∞T=KM=M and Lemma 4.21 implies that T is finite.
Let b be the main branch of T. We know by Theorem 4.15 (or Lemma 4.17) that there is no drop along b so we can define
[TABLE]
For Υ∈OR and k∈lh(T) let ψ(k,Υ) denote the following statement:
[TABLE]
Claim 4.28**.**
Let n≤t0. Then νnT<μ and whenever π0,nT(Θ) is defined we have νnT≤π0,nT(Θ)≤μ .
Before we start with the proof of Claim 4.28 we observe that Lemma 3.20 and Claim 4.28 imply that T lives on L[E]∣μ. Our hypothesis that L[E]∣μ is μ-stable above κ together with Lemma 3.15 imply that π0,∞T(κ)≤μ. This give us a contradiction since μ<j(κ)=π0,∞T(κ) and therefore we have o(κ)>μ. Hence Theorem A will follow once we prove Claim 4.28.
We prove this by induction on n≤t0. We start with the base case.
Subclaim 4.29**.**
For n=0, we have that ν0T≤Θ and ν0T<μ.
Proof.
For a contradiction suppose that ν0T>Θ. We will prove that for all k+1<lh(T) we have crit(EkT)>Θ. This will imply that if Ek0T is the first extender applied to M0T with k0+1∈[0,t0]T, then
[TABLE]
which will give us a contradiction.
Suppose ψ(k,Θ) holds. That is,
[TABLE]
As T is normal we have νkT≥ν0T>Θ, and therefore, crit(EkT)≤β∗ or crit(EkT)>Θ. By Lemma 4.22, it follows that crit(EkT)>Θ. Thus given k∈lh(T), ψ(k,Θ) implies crit(EkT)>Θ.
We will verify by induction that ψ(k,Θ) holds for all k∈lh(T). For k=0, Lemma 3.24 implies ψ(0,Θ). Suppose now that k∈lh(T) and ψ(l,Θ) holds for all l≤k. We will prove that ψ(k+1,Θ) holds.
As observed above, ψ(k,Θ) implies crit(EkT)>Θ. By the induction hypothesis, ψ(k,Θ) holds, and hence we have181818Recall ηk+1T is the height of the model we apply EkT to form Mk+1T.
[TABLE]
By induction hypothesis we also have ψ(ξkT,Θ), therefore the following holds:
[TABLE]
Thus by the Σ1-elementarity of πξk+1,kT it follows that ψ(k+1,Θ) holds. This concludes the proof that ψ(k,Θ) holds for all k∈lh(T).
As observed above, this implies that crit(π0,∞T)>Θ, which is a contradiction.
Hence
[TABLE]
and as μ is a cardinal we also have ν0T<μ. This concludes the case n=0 of Claim 4.28 and the proof of subclaim 4.29. ∎
We now perform the inductive step of the proof of Claim 4.28. We shall need to split this into two cases.
▶ Suppose n=k+1 and π0,k+1T(Θ) is not defined. By our induction hypothesis νlT<μ for all l<k+1, hence by Lemma 3.20, the iteration tree T∣(k+2) lives on L[E]∣μ. Therefore by Lemma 3.18,
[TABLE]
where U=(T↾k+2)↾(L[E]∣μ). By Lemma 3.15 we have Mk+1U∩OR≤μ. Therefore νk+1T<μ.
▶ Suppose n=k+1 and π0,k+1T(Θ) is defined.
By our induction hypothesis νlT<μ for all l<k+1, hence by Lemma 3.20 the iteration tree T↾(k+2) lives on L[E]∣μ. Therefore by Lemma 3.18
[TABLE]
Thus we only have to verify that νk+1T≤π0,k+1T(Θ).
From our induction hypothesis we have νξkTT≤π0,ξkTT(Θ). Let τkT=crit(EkT)+Mk+1T∣∣νkT, then
[TABLE]
which implies the following:
[TABLE]
Therefore,
[TABLE]
Suppose for a contradiction that νk+1T>π0,k+1T(Θ). Using Lemma 3.24, one can verify by induction191919We use induction like in case n=0, there may be drops in model along [0,k+1]T but by hypothesis π0,k+1T(Θ) is defined for all m∈[0,k+1]T. along [0,k+1]T that ψ(k+1,π0,k+1T(Θ)) holds. Recall that ψ(k+1,π0,k+1T(Θ)) denotes
[TABLE]
Subclaim 4.30**.**
For l∈lh(T), if k+1<l then
[TABLE]
Proof.
We will verify this by induction, similar to what we did for the case n=0.
We shall start by verifying that k+1<Tk+2. As νk+1T>π0,k+1T(Θ) and ψ(k+1,π0,k+1T(Θ)) holds, we must have, by (12), that crit(Ek+1T)>Θ>νkT. Thus ξk+1T=k+1 and k+1<Tk+2.
Next we verify that ψ(k+2,π0,k+1T(Θ)) holds. As ψ(k+1,π0,k+1T(Θ)) holds, it follows that
[TABLE]
Then by the Σ1-elementarity of πk+1,k+2T it follows that ψ(k+2,π0,k+1T(Θ)) holds. This concludes the base step of this induction.
We now prove the inductive step. Suppose (13) holds for all l such that k+1<l≤m, let us verify that (13) holds for m+1. As T is normal, we have νmT>νkT. By our induction hypothesis ψ(m,π0,k+1T(Θ)) holds and we have only two possibilities: crit(EmT)≤β∗ or crit(EmT)>π0,k+1T(Θ).
The first possibility is excluded by Lemma 4.22, and so it must be true that crit(EmT)>π0,k+1T(Θ).
By (12), crit(EmT)>π0,k+1T(Θ) implies crit(EmT)>νkT. Therefore k+1≤ξmT=predT((m+1)) and thus we have either k+1=ξmT or k+1<ξmT.
If the former is true, then we can appeal to ψ(k+1,π0,k+1T(Θ)), and if the latter is true, then we can appeal to the induction hypothesis, and in either case, we can conclude that ψ(ξmT,π0,k+1(Θ)) holds and
[TABLE]
By Σ1-elementarity of πξmT,m+1T, we have ψ(m+1,π0,k+1T(Θ)). Now if k+1=ξmT, then by the definition of ξmT, we have k+1<Tm+1. On the other hand, if k+1<ξmT, then by the induction hypothesis, k+1<TξmT, and so again we have that k+1<Tm+1. This concludes the inductive step and the induction and verifies Subclaim 4.30.
∎
Given l∈lh(T) such that l≥k+1, we have that ψ(l,π0,k+1T(Θ)) implies crit(ElT)>π0,k+1T(Θ). Therefore Subclaim (4.30) gives that
[TABLE]
Hence
[TABLE]
where the last inequality is given by (11). This contradicts the fact that
[TABLE]
Thus νk+1T≤π0,k+1T(Θ)≤μ. This verifies the case n=k+1. ∎
As observed before the proof of Claim 4.28, we have by Lemma 3.20 and Claim 4.28 that μ<j(κ)=π0,∞T(κ)≤μ which is a contradiction. Thus o(κ)>μ. This concludes the proof of Theorem A.
∎
Definition 4.31**.**
(Hamkins) A cardinal κ is <α-tall if and only if for all β<ακ is β-tall.
Corollary 4.32**.**
Assume (Δ). Suppose that α is a limit cardinal and cf(α)>κ. Then κis<α-tall iff
(⇒) Let ⟨μξ∣ξ<cf(α)⟩ be a cofinal sequence in α. Note that for μ:=μξ++ we are in hypothesis of Theorem A. If for each μξ++>κ we have o(κ)>μξ++ then o(κ)≥α and we are done.
Suppose o(κ)<α. By Lemma 4.23, we have o(κ)>κ+, therefore we will be done if we find B⊆κ such that B is cofinal in κ and for all β∈B we have o(β)≥α.
Fix ξ<cf(α) such that μξ++>o(κ). As κ is α-tall, it follows that κ is μξ++-tall. Applying Theorem A to κ and μξ++, as o(κ)<μξ++, this gives us a set Y⊆κ cofinal in κ such that for all β∈Y we have o(β)>μξ++.
For each ξ<cf(α), let
[TABLE]
Then ⟨Bξ∣ξ<cf(α)⟩ is a sequence of cofinal subsets of κ such that
[TABLE]
From the fact that cf(α)>κ, it follows that the sequence ⟨Bξ∣ξ<cf(α)⟩ is eventually constant, i.e., there is some B⊆κ such that for all sufficiently large ξ<cf(α) we have B=Bξ. We have that B is cofinal in κ and for all β∈B we have o(β)≥α, which verifies the corollary.
∎
Corollary A**.**
Assume (Δ). κis a tall cardinal if and only if
[TABLE]
We will need one further notion of iterability for Theorem B.
Definition 4.33**.**
We say that a premouse M is weakly iterable if every countable premouse Mˉ that elementarily embeds into M is (ω1+1,ω1)-iterable202020See [14, p.309] for the definition of (ω1+1,ω1)-iterable..
The following lemma together with Theorem A imply Theorem B.
Lemma 4.34**.**
Suppose there is no inner model with a Woodin cardinal. Let L[E] be a proper class premouse that is weakly iterable. Then L[E] is self-iterable and L[E]⊨(Δ).
Proof Sketch.
Let T∈L[E] be an iteration on L[E] of limit lenght. By our hypothesis that there is no inner model with a Woodin cardinal it follows that212121M(T) denotes the common part model, see [11, Definition 6.9]. For δ(T)=⋃α∈lh(T)ναT and E:=⋃α∈lh(T)EMαT↾ναT, M(T):=JδE.
[TABLE]
Let η be the least ordinal such that
[TABLE]
and set Q(T):=L[M(T)]∣∣η. Let X be a countable set such that X≺ΣωHΘM, let Xˉ be the Mostowski collapse of X and π:Xˉ→X be the inverse of the Mostowski collapse. For each w∈X we will denote by wˉ the pre-image of w under π.
Since L[E] is weakly iterable, it follows that there exists b a cofinal wellfounded branch of Tˉ such that M∞Tˉ▹Q(b,Tˉ)=Q(T) and such b is unique222222See [11, Definition 6.11] for the definition of Q(b,Tˉ). .
Let G be a Col(ω,ν)-generic over Xˉ, where (ν=∣Tˉ∣)Xˉ. As Xˉ[G]≺Σ11V, it follows that b∈Xˉ[G] and by homogeneity of Col(ω,ν) it follows that b∈X.
Therefore
[TABLE]
∎
Theorem 4.35**.**
Suppose there is no inner model with a Woodin cardinal and L[E] is an extender model that is self-iterable. Let κ, μ be ordinals such that κ<μ and μ is a regular cardinal.
If L[E]∣μ is μ-stable above κ, then (κ is μ-tall)L[E] iff
[TABLE]
In particular, if L[E] is weakly iterable, then (κ is μ-tall)L[E] iff (14) holds.
Proof.
The first part follows from the fact that L[E]⊨(Δ) and Theorem A. The second part follows from Lemma 4.34 and Theorem A.
∎
Corollary 4.36**.**
Suppose there is no inner model with a Woodin cardinal and L[E] is an extender model that is self-iterable. Let κ be an ordinal. Then (κ is tall)L[E] iff
[TABLE]
In particular, if L[E] is weakly iterable, then (κ is tall)L[E] iff (15) holds.
Next we prove that we can not remove the hypothesis that L[E]∣μ is μ-stable above κ in Theorem A. For that we will use the following lemma.
If κ<θ are ordinals and j:V⟶M is an elementary embedding such that κM⊆M and j(κ)≥θ, then
κ isθ-tall.
Proof sketch.
By elementarity of j it follows that j(κ) is measurable in M, let U∈M be a total measure on M with crit(U)=j(κ) and i the ultrapower embedding from U, then i∘j witness that κ is θ-tall.
∎
Lemma 4.38**.**
Suppose (Δ) . Let κ and λ be cardinals. If
(I)
κ<λ,
2. 2.
o(κ)∈[λ,λ+),
3. 3.
for some μ, κ<cf(μ) and
4. 4.
cf(μ)* is a measurable cardinal.*
or
(II)
κ* is a measurable cardinal,*
2. 2.
λ>κ* and cf(λ)=κ,*
3. 3.
κ=sup({β<κ∣o(β)>λ}),
Then κ is λ+-tall.
Proof.
▶ Suppose (I) holds. By Lemma 4.23 there is Eβ a total measure with crit(Eβ)=cf(λ). Consider N=Ult(V,Eβ) and let π be the ultrapower map.
We have π(λ)≥λ+, which implies
[TABLE]
Let EαN be such that α>λ+V and crit(EαN)=κ.
Let W:=Ult(N,EαN) and let i:N→W be the ultrapower map.
It follows that i∘π(κ)≥λ+V and Wκ⊆W.
Hence by Lemma 4.37κ is λ+-tall.
▶ Suppose (II) holds. By Lemma 4.23 there is Eβ a total measure with crit(Eβ)=κ. Consider N=Ult(V,Eβ) and let π:V→N be the ultrapower map.
We have
[TABLE]
Notice that π(λ)>λ+V. By (16) and Lemma 3.22 there is γ∈(λ+V,π(λ)) such that crit(EγN)∈(κ,π(κ)).
If we consider F:=Eγ↾λ+, as cf(λ+V)=λ+V>κ and Nκ⊆N, it follows that W:=Ult(N,F) is κ-closed.
We also have for i:N→W, the ultrapower map, that i∘π(κ)≥λ+V.
Hence by Lemma 4.37κ is λ+-tall.
∎
Remark 4.39*.*
Notice that in Lemma 4.38 setting μ=λ+ it follows that L[E]∣μ is not μ-stable above κ, as λ is the largest cardinal of L[E]∣μ and cf(λ) is a measurable >κ.
5. Acknowledgments
The authors express their gratitude to Tanmay Inamdar for reading earlier versions of this paper and providing many helpful comments and suggestions.
The authors express their gratitude to the referee for a thorough reading and valuable report.
Bibliography14
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1GM [96] Moti Gitik and William J. Mitchell. Indiscernible sequences for extenders, and the singular cardinal hypothesis. Ann. Pure Appl. Logic , 82(3):273–316, 1996.
2GSS [06] Moti Gitik, Ralf Schindler, and Saharon Shelah. PCF theory and Woodin cardinals , page 172–205. Lecture Notes in Logic. Cambridge University Press, 2006.
3Ham [09] Joel D Hamkins. Tall cardinals. Mathematical Logic Quarterly , 55(1):68–86, 2009.
4JS [13] Ronald Jensen and John Steel. K without the measurable. The Journal of Symbolic Logic , 78(3):708–734, 2013.
5Kan [09] Akihiro Kanamori. The higher infinite . Springer Monographs in Mathematics. Springer-Verlag, Berlin, second edition, 2009. Large cardinals in set theory from their beginnings, Paperback reprint of the 2003 edition.
6Mag [76] Menachem Magidor. How large is the first strongly compact cardinal? or A study on identity crises. Ann. Math. Logic , 10(1):33–57, 1976.
7MS [94] D. A. Martin and J. R. Steel. Iteration trees. J. Amer. Math. Soc. , 7(1):1–73, 1994.
8Sch [02] Ralf Schindler. The core model for almost linear iterations. Annals of Pure and Applied Logic , 116(1-3):205–272, 2002.