This paper demonstrates that in certain models of set theory, the entire extender sequence can be defined from its restriction to the first uncountable ordinal, leading to insights about the structure of mice and models where V=HOD.
Contribution
It proves the definability of the extender sequence from initial segments in models with short extenders and establishes conditions under which the universe is equal to HOD.
Findings
01
The extender sequence is definable from its restriction to leph_1 in models with short extenders.
02
Models with a Woodin limit of Woodin cardinals satisfy V=HOD.
03
Various local and generic extension versions of the definability result are established.
Abstract
Let M be a short extender mouse. We prove that if E∈M and M satisfies "E is a countably complete short extender whose support is a cardinal θ and Hθ⊆Ult(V,E)", then E is in the extender sequence EM of M. We also prove other related facts, and use them to establish that if κ is an uncountable cardinal of M and κ+M exists in M then (Hκ+)M satisfies the Axiom of Global Choice. We prove that if M satisfies the Power Set Axiom then EM is definable over the universe of M from the parameter X=EM↾ℵ1M, and M satisfies "every set is OD{X}". We also prove various local versions of this fact in which M has a largest cardinal, and a version for generic extensions of M. As a consequence, for example, the minimal…
Equations226
EM is Δ2⌊M⌋({\mathbbmm})-definable.
EM is Δ2⌊M⌋({\mathbbmm})-definable.
Ult(M,E)∣νE=M∣νE.
Ult(M,E)∣νE=M∣νE.
wk+1H(q,α)=defThk+1H(α∪{q,pkH}).
wk+1H(q,α)=defThk+1H(α∪{q,pkH}).
wk+1H(q)=def{wk+1H(q↾i,qi)}i<lh(q)
wk+1H(q)=def{wk+1H(q↾i,qi)}i<lh(q)
wk+1H=defwk+1H(pk+1H).
wk+1H=defwk+1H(pk+1H).
Hˉ=cHullk+1H(θ∪{pkH,q}),
Hˉ=cHullk+1H(θ∪{pkH,q}),
γ∈/Hullk+1H(γ∪{pkH,x,r\{γ}}).
γ∈/Hullk+1H(γ∪{pkH,x,r\{γ}}).
q=(q0,q1,…,qm−1),
q=(q0,q1,…,qm−1),
ui,r∈Hullk+1H(γi∪{pkH,q↾i}),
ui,r∈Hullk+1H(γi∪{pkH,q↾i}),
ui,r∈Hi=defHullk+1H((η+1)∪{pkH,q↾i})
ui,r∈Hi=defHullk+1H((η+1)∪{pkH,q↾i})
η∈/Hullk+1H(η∪{pkH,q↾i}).
η∈/Hullk+1H(η∪{pkH,q↾i}).
Hi⊊Hi′=Hullk+1H(γi∪{pkH,q↾(i+1)}),
Hi⊊Hi′=Hullk+1H(γi∪{pkH,q↾(i+1)}),
ρ>ρk+1W=γ=lgcd(W∣ρ)
ρ>ρk+1W=γ=lgcd(W∣ρ)
W=Ultk(J,F).
W=Ultk(J,F).
η∈/Hullk+1W((γ+1)∪{pkW,pk+1W\ρ}),
η∈/Hullk+1W((γ+1)∪{pkW,pk+1W\ρ}),
Hγ=Hullk+1H(γ∪{pk+1H})
Hγ=Hullk+1H(γ∪{pk+1H})
Wγ=Hullk+1Wγ(κ∪{η,x})
Wγ=Hullk+1Wγ(κ∪{η,x})
lh(EαT)≤lh(EβT) for all α+1<β+1<lh(T),
lh(EαT)≤lh(EβT) for all α+1<β+1<lh(T),
ν(EαT)≤ν(EβT) for all α+1<β+1<lh(T).
ν(EαT)≤ν(EβT) for all α+1<β+1<lh(T).
ψπ:Ult(M∣(μ+)M,FM)→Ult(N∣(κ+)N,FN)
ψπ:Ult(M∣(μ+)M,FM)→Ult(N∣(κ+)N,FN)
ρm+1M=ω<κ=cr(E)<τ=ρmM=ρn+1M.
ρm+1M=ω<κ=cr(E)<τ=ρmM=ρn+1M.
U=Ultm(M,E) is wellfounded and (m,ω1+1)-iterable,
U=Ultm(M,E) is wellfounded and (m,ω1+1)-iterable,
Mˉ=cHullmM({t})
Mˉ=cHullmM({t})
Uˉ=Ultm−1(Mˉ,Eˉ).
Uˉ=Ultm−1(Mˉ,Eˉ).
P=((Mˉ,m−1,θˉ),(Uˉ,m−1),θˉ).
P=((Mˉ,m−1,θˉ),(Uˉ,m−1),θˉ).
M′=cHullmM(γ∪{t′})◃M,
M′=cHullmM(γ∪{t′})◃M,
π′:Mˉ→M′
π′:Mˉ→M′
π′↾θˉ=π↾θˉ=ψ↾θˉ.
π′↾θˉ=π↾θˉ=ψ↾θˉ.
πα:MαT→MαU
πα:MαT→MαU
cr(iβαT)<i0βT(γˉ) for all β∈(−1,α)T
cr(iβαT)<i0βT(γˉ) for all β∈(−1,α)T
Peer Reviews
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
Full text
The definability of the extender sequence E from E↾ℵ1 in L[E]
We prove that if E∈M and M⊨“E is a countably complete short extender
whose support is a cardinal θ and Hθ⊆Ult(V,E)”,
then E is in the extender sequence EM of M.
We also prove other related facts,
and use them to establish that if κ is an uncountable cardinal
of M and (κ+)M exists in M then (Hκ+)M satisfies the Axiom of Global Choice.
We then prove that if M satisfies the Power Set Axiom
then EM is definable over the universe
of M from the parameter
X=EM↾ℵ1M, and therefore M satisfies
“Every set is ODX”. We also prove various
local versions of this fact in which M has a largest cardinal,
and a version for generic extensions of M.
As a consequence, for example, the minimal proper class mouse with
a Woodin limit of Woodin cardinals models “V=HOD”.
This adapts to many other similar examples.
We also describe a simplified approach to Mitchell-Steel fine structure, which does away with the parameters un.
1 Introduction
Let M be a mouse. Write EM for the extender sequence of M, not
including the active extender FM of M. Write ⌊M⌋ for the universe of M.
Write \mathbbmmM=M∣ℵ1M. Write PS for the Power Set Axiom.
We consider here the following questions:
–
Given E∈M such that M⊨“E is an extender”, is E∈EM?
2. –
(Steel) Suppose M⊨ZFC. Does M⊨“There is X⊆ℵ1
such that V=HODX”?
3. –
Is EM definable over ⌊M⌋,
possibly from some (small) parameter?
The main theorem of the paper is the following, which answers Steel’s question above positively,
in fact with X=\mathbbmmM.
Theorem 1.0**.**
Let M be a (0,ω1+1)-iterable premouse satisfying PS and \mathbbmm=\mathbbmmM.
Then
[TABLE]
Therefore if ⌊M⌋⊨ZFC then ⌊M⌋⊨“V=HOD\mathbbmm” and M⊨ZFC.111Note that
by writing “M⊨ZFC” we mean the structure (⌊M⌋,∈,EM),
and so the assumption that ⌊M⌋⊨ZFC does not trivially imply M⊨ZFC.
The first proof we give of this theorem, in §3,
will actually
yield a more general and local version,
in which the mouse can have a largest cardinal, but in which
case we must allow somewhat higher complexity in the definition of EM
from the parameter \mathbbmmM. We will also give a variant
proof in §4,
which uses the same main idea, but is a little simpler,
and is in some ways more general, but in other ways less.
Related results have been known for some time.
Kunen proved that L[U] satisfies “U is the unique normal measure”,
and therefore satisfies “V=HOD”.
Recall that Mn is the minimal proper class mouse with n Woodin cardinals.
Steel proved [4] that for n≤ω, EMn is definable over
⌊Mn⌋ without
parameters.222He in fact showed that Mn
is its own “core model” (this must be defined appropriately). The author proved similar results for larger, sufficiently self-iterable mice in
[7] and [9]. The proofs of these earlier
results depended on the mice in question being sufficiently self-iterable. But
non-meek mice typically fail to have such self-iterability. To prove Theorem 1, we use
a different approach, which avoids any use of self-iterability,
and is more focused on condensation properties.
We easily get the following corollary:
Corollary**.**
Let M be a (0,ω1+1)-iterable premouse.
Suppose M satisfies PS+“Every countable segment of me is (ω,ω1+1)-iterable”.
Then EM is (lightface)Δ2M-definable and
⌊M⌋⊨“Every set is OD”.333Here and elsewhere,
for premice modelling PS, we say that x∈ODM iff
there is α<ORM such that {x}
is definable from ordinal parameters over (Hα)M.
A natural variant of Steel’s question mentioned above
is whether the same holds but with X∈RM.
We do not know the answer here in general, but
in a separate paper [5],
we will extend the results and methods here
to answer the question affirmatively for tame mice.
We will also establish some structural facts regarding HOD⌊M⌋
for arbitrary (short extender) mice M modelling PS.444These facts,
however, leave the full analysis of HOD⌊M⌋ very much open,
in particular in the case of L[x] for a cone of reals x.
To prove the more local version of Theorem 1 above
we will use certain extender maximality properties of EM,
Theorems 1
and 1 below, which are refinements of results from [7].
Their proofs are very similar.
Theorem 1.0** (Steel, Schlutzenberg).**
Let M be an (0,ω1+1)-iterable premouse. Let E∈M
be such that M⊨“E is a short, total, countably complete extender”,
νE is a cardinal of M and
HνEM⊆Ult(M,E).
Then (the trivial completion of)E is in EM.
Remark 1.0**.**
Steel first proved that E∈EM under the assumptions of 1
together with the added assumptions
that M⊨PS+“νE is regular” and E coheres EM below νE;
that is,
[TABLE]
The author then generalized Steel’s proof to obtain
1.
Note that if M⊨“E is a normal measure”, then νE=(cr(E)+)M, so the
requirement that HνEM⊆Ult(M,E) holds automatically,
and therefore E∈EM (given M is iterable).
Theorem 1.0**.**
Let M be a (0,ω1+1)-iterable premouse. Let E,R∈M and τ∈ORM be such that
τ is a cardinal of M, R is a premouse and ρωR=τ and M⊨“E is a short
extender,
Hτ⊆Ult(M,E) and R◃Ult(M,E)”.
Then R◃M.
Slightly less general versions of 1 and 1
were obtained by the author in 2006. Prior to this, Woodin had conjectured
that if M is a mouse, κ is uncountable in M and (κ+)M exists,
then L(P(κ)M)⊨AC.
Woodin’s conjecture follows immediately from the following corollary
to the preceding theorems.
Steel noticed that corollary follows from
1 combined with an argument of Woodin’s.555
The corollary appeared first in [7]. It can now be deduced trivially
from 1. However, we will give its original proof (from [7]),
as this constitutes a significant part of the proof of 1,
and so it serves as a useful warm-up.
Corollary 1.0**.**
Let M be a (0,ω1+1)-iterable
premouse and κ∈ORM be such that M⊨“κ is uncountable”
and (κ+)<ORM.
Then M∣(κ+)M is definable from parameters over H(κ+)MM.
The extender maximality theorems proven here are refinements
of results obtained by the author in [7].
The inductive condensation stack argument
in §3 was obtained in 2015,
and presented by the author in the Oberseminar für Mengenlehre
at the Institut für Mathematische Logik und Grundlagenforschung,
Universität Münster, in Spring 2016, and also at the
1st Irvine conference on descriptive inner model theory
and hod mice, in July 2016.
The direct condensation stack argument in §4 was obtained in 2019.
In §5 we also describe a simplification to Mitchell-Steel fine structure,
making do without the parameters un.
This simplification was observed by the author in 2012/13,
while visiting John Steel at UC Berkeley.
One could just use the standard fine structure,
but it simplifies certain definitions, and
we will officially make use of it here and in the future.
1.1 Conventions and Notation
Most non-standard conventions, in particular in
connection with premice, extenders, fine structure, iteration trees and phalanxes,
are as in [9, §1.1].
However, there are two main differences.
Firstly, in this paper we use the term premouse slightly differently:
as in [9] we use Mitchell-Steel indexing;
however, we allow
extenders of superstrong type in the extender sequence E+M of a premouse M.
There are some small changes that this introduces, as explained in [8, Remark 2.44***].
Secondly, we adopt a simplified version of Mitchell-Steel fine structure,
explained in §5, which avoids the parameters
un.
By 5, this change actually has no impact
on the fine structural notions
such as pk, k-soundness, etc.
Because of the change, we use the notation Hullk+1M(X) and cHullk+1M(X)
as in 5.1,
not [9].
For a structure M, ⌊M⌋ denotes the universe of M.
Let N be a premouse and E=EN.
We write ⌊N⌋ for the universe of N,
and \mathbbmeN=E↾ω1N and \mathbbmmN=N∣ω1N.
If N is passive and α=ORN,
then JαE denotes N,
and when working inside N, JE also denotes N.
And J(P) denotes the rudimentary closure of P∪{P}.
Let n<ω. We say that N satisfies (n+1)-condensation
iff N is n-sound and whenever H is (n+1)-sound and π:H→N is
n-lifting (see [6, Definition 2.1])
and ρn+1H≤cr(π), then either H⊴N
or, letting ρ=ρn+1H, then N∣ρ is active with extender E and
H◃Ult(N∣ρ,E). (See [6, Theorem 4.2***].) We say N satisfies ω-condensation
iff it satisfies (n+1)-condensation for all n<ω.
We say that N is an ω-premouse iff N is ω-sound and
ρωN=ω; in this case we let deg(N) denote the least n such that
ρn+1N=ω. An ω-mouse is an (ω,ω1+1)-iterable ω-premouse.
If N is an ω-mouse, we write ΣN for the unique (ω,ω1+1)-strategy for N.
For α<ORN, recall that α is a cutpoint of N iff
for all E∈E+N,
if cr(E)<α then lh(E)≤α.
For an extender E, tE and τE denote the Dodd parameter
and Dodd projectum of E respectively, if they are defined.
2 Extender maximality
In this section we prove Theorems 1
and 1. The proofs are refinements of less general results proved in
[7].
Toward these proofs, we begin with a lemma which helps us to find sound hulls of
premice; the proof is basically as in [9, Lemma 3.1***],
but here we use the fact that condensation
follows from normal iterability in order to reduce our assumptions.
Definition 2.1**.**
Let k<ω, let H be k-sound, q∈[ρ0H]<ω and α∈ORH,
with α≤min(q) if q=∅.
The (k+1)-solidity witness for (H,q,α),
(or just for (q,α)), is
[TABLE]
Letting q={q0,…,qlh(q)−1} with qi>qi+1,
the (set of all) (k+1)-solidity witnesses for (H,q)
(or just for q)
is
[TABLE]
where q↾i={q0,…,qi−1}.
The (set of all) (k+1)-solidity witnesses for H
is
[TABLE]
Note that in the preceding definition, we are not assuming that the solidity witnesses
in consideration are in H.
Definition 2.2**.**
Let k<ω, let H be (k+1)-sound, q∈C0(H), θ<ρ0H,
[TABLE]
π:Hˉ→H be the uncollapse and π(qˉ)=q. We say that (θ,q) is
(k+1)-self-solid (for H) iff Hˉ is k+1-sound and
ρk+1Hˉ=θ and
pk+1Hˉ=qˉ.
Let x∈C0(H) and r∈[ρ0H]<ω. We say that r is an rΣk+1H({x})-generator
iff for every γ∈r, we have
[TABLE]
Lemma 2.2**.**
Let k<ω and let H be (k+1)-sound and (k,ω1+1)-iterable.
Let r∈H and
θ≤ρk+1H be a cardinal of H. Then there is q∈H such
that:
–
(θ,q)* is (k+1)-self-solid for H,*
2. –
pk+1H=q\min(pk+1H),
3. –
r∈Hullk+1H(θ∪{pkH,q}), and
4. –
Hˉ=cHullk+1H(θ∪{pkH,q})⊴H.
Proof.
We may assume H is countable and θ<ρk+1H. We will define m<ω and
[TABLE]
with qi>qi+1 for i+1<m. Let p=pk+1H. We start with q↾lh(p)=p. We define
qi for i≥lh(p) by induction on i, with qi<ρk+1H.
We simultaneously define an H-cardinal
γi, with γlh(p)=ρk+1H
and θ≤γi≤qi−1 for i>lh(p), and
[TABLE]
where ui is the set of (k+1)-solidity witnesses for (H,q↾i). Now let i≥lh(p), and let
q↾i, γi be given. If γi=θ then we set m=i, so
q=q↾i and we are done. So suppose γi>θ. Let η<γi be least such that
η>θ and η is not a cardinal of H and
[TABLE]
and
[TABLE]
Let qi=min(OR\Hi) and let γi=cardH(qi)=cardH(η).
Clearly
[TABLE]
so it suffices to see that ui+1∈Hi′. Note that the transitive collapse Wi of Hi
is (equivalent to) the (k+1)-solidity witness for (q↾i,qi), so it suffices to see that Wi∈Hi′.
For this it suffices to see that Wi◃H, since then Wi is the least segment W of H
such that ORW≥qi and ρωW=γi=lgcd(H∣qi).
Let ρ=qi and γ=γi and W=Wi. Let π:W→H be the uncollapse. Then
π(pk+1W\ρ)=q↾i and W is ρ-sound and cr(π)=ρ and
[TABLE]
(we have ρk+1W≥γ because W∈H). So by condensation as stated in [6, Theorem 4.2***], either (a) W◃H or (b)
letting J◃H be least such that qi≤ORJ and ρωJ=γ,
then ρk+1J=γ<ρkJ and there is a type 1 extender F over J
with cr(F)=γ and
Since γi+1<γi, the construction terminates successfully.
Finally, the fact that Hˉ⊴H (where Hˉ is defined in the statement of the theorem)
follows from condensation.
∎
Related calcuations also give the following:
Lemma 2.2**.**
Let k<ω and let H be (k+1)-sound and (k,ω1+1)-iterable. Suppose ρ=ρk+1H=(κ+)H>ω and κ is an H-cardinal.
For γ<ρ let
[TABLE]
and Wγ be the transitive collapse of Hγ.
Then:
(i)
For all sufficiently large γ∈(κ,ρ),
either:
–
Wγ◃H, or
2. –
(κ+)Wγ=ρωWγ=γ, H∣γ is active with E666Note then that cr(E)<κ
and E is H-total. and
Wγ◃Ult(H,E).
2. (ii)
For cofinally many γ<ρ, we have Wγ◃H
and ρk+1Wγ=κ.
Proof.
For γ<ρ, say that γ is a generator iff γ∈/Hγ.
We say that a generator is a limit generator iff it is a limit of generators,
and is otherwise a successor generator.
Note that the set of generators above κ is club in ρ.
Let γ>κ be a generator. Then note that Wγ∈H and
γ=(κ+)Wγ and hence, either ρk+1Wγ=κ
or ρk+1Wγ=γ; moreover, if γ is a successor generator
then ρk+1Wγ=κ, since then
[TABLE]
for some η<γ and some x.
Now let η0 be the least generator γ>κ such that
wk+1H∈Hγ.
We claim that the conclusion of (i) holds for all generators γ>η0. We proceed by
induction on γ.
First suppose that γ is a limit generator. Then by induction,
for eventually all successor generators γ′<γ, we have
Wγ′◃H and γ′=(κ+)Wγ′ and
Wγ′ projects to κ. It follows that Wγ′∈Hγ,
so Wγ′∈Wγ, which implies that ρk+1Wγ=γ,
and therefore Wγ is (k+1)-sound. So the conclusion for Wγ follows
from (k+1)-condensation.
Now suppose that γ is a successor generator. Then there is a largest generator
η<γ, and we have κ<η0≤η<γ,
and Wγ projects to κ.
So using
condensation as stated in [6, Theorem 4.2***] as in the proof of 2,
we get Wγ◃H.
Part (ii) now easily follows;
in fact its conclusion holds for every sufficiently large successor generator.
∎
Remark 2.2**.**
Let M be an m-sound premouse.
Recall that a (putative) iteration tree on M is m-maximal
given that (i) T satisfies the monotone length condition
[TABLE]
and for each α+1<lh(T), (ii) γ=predT(α+1)
is least such that cr(EαT)<ν(EαT),
(iii)
Mα+1∗T⊴MγT is as large as possible, and
(iv) k=degT(α+1) is as large as possible (with k≤degT(γ)
if Mα+1∗T=MγT) subject to (iii).
Definition 2.3**.**
Let M be an m-sound premouse.
An essentially m-maximal tree on M
satisfies the requirements of m-maximality,
except that we drop the monotone length condition,
replacing it with montone ν condition, that is, that
[TABLE]
Remark 2.3**.**
It is easy to see that, for example, (m,ω1+1)-iterability
is equivalent to essential-(m,ω1+1)-iterability.
Definition 2.4**.**
Let π:C0(M)→C0(N) be
Σ0-elementary between premice M,N of the same type.
If M,N are passive then ψπ denotes π.
If M,N are active, μ=cr(FM) and κ=cr(FN), then
[TABLE]
denotes the embedding induced by the Shift Lemma from π.
So in both cases, π⊆ψπ and ψπ is fully elementary.
Now we say that π is:
–
ν-low iff M,N are type 3 and ψπ(νM)<νN,
2. –
ν-preserving iff, if M,N are type 3 then ψπ(νM)=νN, and
3. –
ν-high iff M,N are type 3 and ψπ(νM)>νN.
Remark 2.4**.**
Suppose π,M,N are as above and M,N are type 3.
It is easy to see that if π is rΣ2-elementary then π is ν-preserving,
and if π is rΣ1-elementary then π is non-ν-low.
Moreover, one can show that if π=π0 is a ν-preserving
neat k-embedding, then the copying construction with π preserves
tree order, and for each α, πα is a ν-preserving
neat degT(α)-embedding. (Here if MαT
is type 3 and ρ0(MαT)<lh(EαT)<OR(MαT)
then we copy EαT to EαU=ψπα(EαT).)
We will deduce Theorems 1 and 1 from the following:
Theorem 2.4**.**
Let N be a (0,ω1+1)-iterable pm, F∈N and μ,σ∈ORN,
t˙∈Vω and W be such that:
–
σ* is an N-cardinal,*
2. –
F* is a short N-extender
with support σ∪t˙,
weakly amenable to N, coded as a subset of N∣σ,
such that N⊨“F is countably complete”,*
3. –
W=Ult(N,F), μ=cr(F)<σ and HσN⊆W.
Then (i)W∣(σ+)W=N∣∣(σ+)W and if t˙=∅ then (ii)F∈E+N.
Proof.
We may assume that N=J(R) where F is definable from parameters over R
and ρωR=σ. Say that F is rΣn+1R({r}).
We may also assume inductively that all segments of R
satisfy the theorem.
Let n≪m<ω and
M=cHullm+1R({s})
where (ω,s) is (m+1)-self-solid for R
and r∈rg(πMR) where πMR:M→R is the uncollapse.
Let πMR(E)=F. So E is an M-extender over generators τ∪t˙,
where either τ<ρ0M and πMR(τ)=σ,
or τ=ρ0M and ρ0R=σ. And
E is rΣn+1M-definable,
M is (m+1)-sound, n+10<m and
[TABLE]
Other relevant properties of (R,F) also reflect to (M,E).
Moreover,
[TABLE]
by the countable completeness of F in N and the (ω,ω1+1)-iterability of R.
Now τ<ORM. For suppose τ=ORM.
Since ρn+10M=τ, therefore M is passive.
If τ=(κ+)M, i.e. κ is the largest cardinal of M,
then we have U∣(κ+)M=M∣(κ+)M=M (by condensation for M),
but then E∈U, which is impossible. So τ>(κ+)M.
Then E↾η∈M for all η<τ (since ρn+10M=τ),
so by induction (with conclusion (i) of the theorem), U∣τ=M∣τ=M, so again, E∈U, a contradiction.
Let t be (m,ω)-self-solid for M,
and such that letting
[TABLE]
and π:Mˉ→M be the uncollapse, then r,s∈rg(πMR∘π). Let π(tˉ)=t, etc, and Eˉ=π−1(E), etc.
So Eˉ is defined over Mˉ from tˉ just as E is over M from t,
and the relevant properties of (M,E,U) reflect to (Mˉ,Eˉ,Uˉ), where
[TABLE]
Let θ be the largest M-cardinal ≤τ such that
M∣τ=U∣τ.777We will show that θ=τ.
Let π(θˉ)=θ if θ<ρ0M,
and otherwise θˉ=ρ0Mˉ.
So θˉ has the same defining property with respect to Mˉ,Uˉ.
Define the phalanx (see [9, §1.1] for the notation)
[TABLE]
Claim 1.
P* is (ω1+1)-iterable.*
Proof.
We will lift trees on P to essentially m-maximal trees on U,
which by 2 and line (2) suffices.
Let ψ:Uˉ→U be the Shift Lemma map.
Let θ′=supπ‘‘θˉ.
Case 1.
θ′<θ.
Let γ=cardM(θ′), so γ<θ.
Let t′ be
such that (γ,t′) is m-self-solid for M,
with
[TABLE]
and π:M′→M be the uncollapse,
such that t∈rg(π).
Let
[TABLE]
be π′=π−1∘π.
So
[TABLE]
Note that ORM′<θ, so M′◃U.
We can use (π′,ψ) to lift trees T on P to essentially m-maximal
trees U on U.
In case θ is a limit cardinal of M then everything here is routine (and we actually get m-maximal trees
on U). So assume that θ=(γ+)M.
Most of the details of the copying process are routine,
but we explain enough that we can point out how the wrinkles are dealt with.
Let π(γˉ)=γ.
For α<lh(T) with α>0,
we say that rootT(α)=0 if MαT is above Uˉ,
and rootT(α)=−1 if above Mˉ.
Let α<lh(T). If rootT(α)=0
then the copy map
[TABLE]
is produced routinely. Suppose rootT(α)=−1.
If (−1,α]T does not drop in model and
[TABLE]
(note we might have γˉ=cr(i−1,αT)), then [0,α]U does not drop in model or degree and
[TABLE]
and πα is produced in the obvious manner via the Shift Lemma.
Otherwise, (0,α]U drops in model, and
[TABLE]
again produced in the obvious manner. We copy extenders using these maps.
There is a wrinkle when
predT(α+1)=−1 and cr(EαT)=γˉ,
so consider this case.
We have then cr(EαU)=γ.
Because
[TABLE]
and
[TABLE]
we get Mα+1∗T=M, and Mα+1∗U=U (not M′),
and M′◃U∣θ. Now if EαU is not of superstrong type
then
[TABLE]
and
[TABLE]
and things are standard. However, if EαU is of superstrong type,
then
[TABLE]
so when we lift Eα+1T, we get
lh(Eα+1U)<lh(EαU).
However,
[TABLE]
Now we claim that EαT is also superstrong,
and therefore ν(EαT)=λ(EαT)
and ν(EαU)=λ(EαU), and then it follows that
[TABLE]
as required for the monotone ν-condition.
So suppose EαT is not superstrong.
So ν(EαT)<λ(EαT), so
[TABLE]
which implies that EαT=F(MαT) and
πα is ν-low. In particular, πα is not rΣ1-elementary,
so is not a near [math]-embedding. Let j=rootT(α)∈{−1,0}.
By the proof that the copying construction propagates near embeddings
(see [3]), [j,α]T does not drop in model,
and so Mˉ,Uˉ are active. But because Uˉ=Ultm−1(Mˉ,Eˉ)
and
[TABLE]
we have γˉ=cr(FUˉ),
and then similarly, as θˉ≤λ(E0T),
it easily follows that j=−1. But then cr(ijαT)≤γˉ
and θˉ≤λ(E0T), so γˉ=cr(F(MαT)), contradiction.
So ν(EαT)≤ν(Eα+1T), as desired.
This is the only situation in which the monotone length condition
can fail. We leave the remaining details of the lifting process to the reader.
Case 2.
π‘‘θˉ* is unbounded in θ.*
In this case we do not see how to produce a single map lifting Mˉ,
and instead produce a sequence of maps. Note that θ is a limit cardinal of M
(by the case hypothesis we have an rΣmM-singularization
of θ, and if θ=(γ+)M this routinely
implies that ρmM<θ, a contradiction),
and so θˉ is a limit cardinal of Mˉ.
For each Mˉ-cardinal γ<θˉ,
let (Mγ′,σγ) be such that
Mγ′◃M∣θ and
[TABLE]
is a near (m−1)-embedding and
[TABLE]
and
[TABLE]
we get such pairs by taking appropriate hulls much as in the previous case.
Now for each γ we have Mγ′◃U.
So we can use (⟨σγ⟩γ<θˉ,ψ)
to lift trees on P to m-maximal trees on U.
This is much as in the previous
case, but this time when cr(EαT)=γ<θˉ,
then we define Qα+1=i0,α+1U(Mγ′)
and define πα+1 via the Shift Lemma from σγ and πα.
We get the monotone length condition here, because
[TABLE]
The details are left to the reader.∎
Using the claim, we can now complete the proof. We get a successful comparison (T,U)
of (Mˉ,P). Note that all extenders used in the comparison
have length >θˉ.
Standard fine structural arguments show that bU is above Uˉ
and both bT,bU do not drop in model,
[TABLE]
and degT(∞)=m−1=degU(∞).
So θˉ≤cr(iU), so
[TABLE]
and since lh(E0T)>θˉ, therefore
[TABLE]
But if θˉ<τ then because HτMˉ⊆Uˉ,
we get
[TABLE]
which contradicts the choice of θˉ. So θˉ=τ,
which with line (3) gives the statement of conclusion (i)
of the theorem but with Mˉ instead of N. However, this statement
is preserved by π,πMR, so part (i) for N follows.
Assuming also that t˙=∅, so Eˉ is generated by τ,
then standard arguments show that Eˉ is just the (μ,τ)-extender
derived from iT, and therefore that in fact Eˉ∈EMˉ.
But this reflects back to N, giving part (ii).
∎
Theorem 2 directly implies 1.
For 1 note that we may replace the given extender
with a sub-extender with generators of the form τ∪t˙,
and then appeal to 2.
∎
Let N be a (0,ω1+1)-iterable premouse and
μ,δ,κ∈N. Then:
–
If N⊨“μ* is a normal measure” then μ∈EN.*
2. –
If N⊨“δ* is Woodin” then N⊨“δ is Woodin via extenders in
EN”.*
3. –
If N⊨PS+“κ* is strong” then N⊨“κ is strong via extenders
in EN”.*
We next prove a finer variant of Theorem 2.
However, we do not actually need the variant in later sections of the paper.
Definition 2.5**.**
Let M be an active premouse, F=FM and κ=cr(F).
We say F is of superstrong type
iff iFM(κ) is the largest cardinal of M.
We say a premouse N is below superstrong
iff no E∈E+N is of superstrong type.
Recall the Dodd projectum and parameter τE and tE of a short extender E;
see [2] or [9, §2] for background.
The most important fact we use in this section regarding this notion
is the following:
Fact 2.5** (Steel).**
Let M be a 1-sound, (0,ω1+1)-iterable
premouse which is below superstrong.
Then every E∈E+M is Dodd-sound.
Because of the “below superstrong” restriction above, Theorem 2
below is similarly restricted.
Note that 2 is for Mitchell-Steel indexing.
An analogous theorem has been proven by Zeman for mice with Jensen indexing,
without the superstrong restriction (see [11]).
Moreover, we believe that Steel’s proof for Mitchell-Steel indexing
generalizes so as to allow superstrongs,
but this has not been published.888For the generalization of the other standard
fine structural facts, such as the solidity of the standard parameter,
the proof “below superstrong” adapts to the superstrong case
with very little modification. However, for the proof of Dodd-soundness,
the proof requires significant extra work.
So we believe that Theorem 2
actually holds without the superstrong restriction.
Note that in 2, we allow E itself
to ostensibly be of “superstrong type”, but then it follows
that t=∅ and E∈E+M, so in fact,
E is not of such type.
Definition 2.6**.**
Let M be a premouse and E a short extender, weakly amenable to M.
Let U=Ult0(M,E) (we don’t assume U is wellfounded).
Let τ=τE and t=tE (the Dodd projectum and parameter of E). We say that E↾(τ∪t) is amenably rΣm+1M
iff τ<ρ0M and (τ+)U is wellfounded and U∣(τ+)U⊆M,
and the standard coding of E as an amenable subset of U∣(τ+)U
is rΣm+1M. Here the coding consists of tuples (ξ,αξ,Eξ) where
ξ<(κ+)M and Eξ is the natural coding of the extender fragment
[TABLE]
as a subset of M∣τ999That is, represent t with a finite set of integers,
and αξ is the least α such that Eξ∈U∣(αξ+ω).
(By the usual proof (see [1, §2]), Eξ∈U and the αξ’s are cofinal in (τ+)U.)
Theorem 2.6**.**
Let m<ω and let M be an (m+1)-sound, (m,ω1+1)-iterable
premouse which is below superstrong. Let E be a short Msq-extender weakly amenable to M
with
κ=cr(E)<ρmM(we actually assume more below).
Let U=Ultm(M,E).
Let τ=τE and t=tE. Suppose that:
–
E↾(τ∪t)* is amenably rΣm+1M(hence,
(τ+)U is wellfounded).*
2. –
τ≤ρm+1M* and τ is an M-cardinal,*
3. –
HτM⊆U.
Then (i)U∣(τ+)U=M∣∣(τ+)U
and (ii) if E is Dodd-solid101010That is,
E↾(α∪(t\(α+1)))∈U for each α∈t. then E∈E+M.
Proof.
Let j:M→U be the ultrapower map.
If U∣∣τ=M∣∣τ then let θ=τ,
and otherwise let λ be least such
that U∣λ=M∣λ and let θ=cardM(λ).
So θ is an M-cardinal and θ≤τ.
Note that if E is Dodd-solid then E is Dodd-sound.
(For suppose (κ+)M<τ.
As E↾(τ∪t) is amenably
rΣm+1M and τ≤ρm+1M,
then E↾(α∪t)∈M
for each α<τ. But HτM⊆U,
so E↾(α∪t)∈U.)
Let e∈M<ω be such that:
θ,τ∈e.
2. 2.
If C0(M) has largest cardinal Ω then Ω∈e.
3. 3.
The amenable coding of E↾(τ∪t)
(described in 2.6)
is rΣm+1M({e}).
4. 4.
If θ<τ then λ∈e
where λ is least such that U∣λ=M∣λ.
5. 5.
If (τ+)U<(τ+)M
then (τ+)U∈e.
6. 6.
If (τ+)U=(τ+)M
but U∣(τ+)U=M∣∣(τ+)M then λ∈e
where λ is least such that U∣λ=M∣λ.
7. 7.
If E is Dodd-solid then there are a,f∈e
such that a∈[τ]<ω and [a∪t,f]EM,m is the (finite) set of Dodd-solidity witnesses (for t).
8. 8. 111111This condition is only relevant at the very end of the proof,
and its motivation will only become clear there; the reader can ignore it until that point.
If E is Dodd-solid (hence Dodd-sound)
and θ=τ and
[TABLE]
and U∣λ=M∣∣λ but M∣λ is active with an extender F such that κ<cr(F),
then there are a,f∈e with a∈[τ]<ω and
such that
[TABLE]
Let Mˉ=cHullm+1M({pmM,q}) and π:Mˉ→M be the uncollapse,
where q
is such that
(ω,q) is (m+1)-self-solid for M
and e∈rg(π)
(q exists by 2).
Let π(qˉ)=q, π(θˉ)=θ, etc.
So Mˉ is (m+1)-sound with ρm+1Mˉ=ω and qˉ=pm+1Mˉ.
Let Eˉ↾τˉ∪tˉ be defined over Mˉ from eˉ
as E↾τ∪t is defined over M from e.
Then the usual proof that Σ1-substructures of premice are premice121212As
Σ1 includes
a constant symbol for the largest initial segment of the active extender.
and some similar considerations show that most of the facts reflect to Mˉ,Eˉ, etc,
and in particular:
1’.
Eˉ↾τˉ∪tˉ is
a weakly amenable extender over Mˉ
with κˉ=cr(Eˉ)<ρmMˉ.
Let
[TABLE]
2. 2’.
Eˉ is generated by τˉ∪tˉ.
3. 3’.
If M has largest cardinal Ω then Mˉ has largest cardinal Ωˉ.
4. 4’.
θˉ,τˉ are Mˉ-cardinals, HτˉMˉ⊆Uˉ
and Mˉ∣θˉ=Uˉ∣θˉ.
5. 5’.
If θ<τ then Mˉ∣(θˉ+)Mˉ=Uˉ∣(θˉ+)Uˉ,
and λˉ is least such that Mˉ∣λˉ=Uˉ∣λˉ.
6. 6’.
If θ=τ and (τ+)U<(τ+)M then (τˉ+)Uˉ<(τˉ+)Mˉ
and π((τˉ+)Uˉ)=(τ+)U.
7. 7’.
If θ=τ and (τ+)U=(τ+)M then (τˉ+)Uˉ=(τˉ+)Mˉ.
8. 8’.
If θ=τ and U∣(τ+)U=M∣∣(τ+)U then Uˉ∣(τˉ+)Uˉ=Mˉ∣∣(τˉ+)Uˉ.
9. 9’.
If θ=τ and U∣(τ+)U=M∣∣(τ+)U then
τˉ<λˉ<(τˉ+)Uˉ and λˉ is least
such that Uˉ∣λˉ=Mˉ∣λˉ.
10. 10’.
If E is Dodd-solid then Eˉ is Dodd-solid with respect to tˉ.
That is,
for each α∈tˉ, we have
[TABLE]
11. 11’.
If E is Dodd-solid
(hence Dodd-sound) and U,M,λ,F
are as in condition 8,
then λˉ=(τˉ+)Uˉ and Mˉ∣λˉ
is active with Fˉ and the Dodd-soundness witness
[TABLE]
(We do not yet know that Uˉ is wellfounded. And because ρm+1Mˉ=ω,
it does not yet seem clear that if E is Dodd-sound then Eˉ is Dodd-sound;
however, we will eventually see that this is true.)
Let jˉ:Mˉ→Uˉ the ultrapower map.
Let ψ:Uˉ→U be the Shift Lemma map.
Define the phalanx P=((Mˉ,m,θˉ),(Uˉ,m),θˉ).
Claim 1.
Uˉ* is wellfounded and P is (m,ω1+1)-iterable.*
Proof.
The argument is mostly similar to that in the proof of 2.
We will lift m-maximal trees T on P to essentially m-maximal trees on
M. For this we will find embeddings from Mˉ and Uˉ into segments of M with appropriate agreement.
As before, in one case we only see how to find an infinite sequence of embeddings from Mˉ
into various segments of M, and use of all these together as base copy maps.
We will initially find such a system of maps inside U, and then deduce that there is also such a system in M via the elementarity of j.
We first make some general observations that will lead finding
the system of embeddings in U.
Let R◃M. Note that M satisfies condensation
with respect to premice embedded into R;
in particular, M⊨“For every s<ω and every premouse S∈R
such that S is (s+1)-sound and π:S→R is s-lifting and
and cr(π)≥ρs+1S, either (i) S◃R
or (ii) α=defcr(π)=ρs+1S and R∣α is active
and S◃Ult(R∣α,FR∣α)”.
Therefore U satisfies the same statement regarding its proper segments.
Let Mκ=cHullm+1M(κ∪{q}).
Let σκ:Mˉ→Mκ and πκ:Mκ→M be the natural maps
and πκ(qκ)=q.
Note that Mκ is sound and Mκ∈M. So ρm+1Mκ=κ≤cr(πκ).
By condensation, Mκ◃M.
Now τ is a U-cardinal with κ<τ≤j(κ).
Working in U, let
[TABLE]
with r∈OR[j(Mκ)]<ω chosen such that
U⊨“(τ,r) is (m+1)-self-solid for j(Mκ)
and letting ϱτ:U′→j(Mκ) be the uncollapse,
then j(qκ),t∈rg(ϱτ)”.
Such an r exists by the elementarity of j
and by 2.
(Note that U⊨“j(Mκ) is wellfounded”;
the transitive collapse U′ is computed inside U, where it is well-defined.)
Note that if τ=j(κ) then t=∅ and U′=j(Mκ) and r=j(qκ).
And if τ<j(κ) then ρm+1U′=τ,
so U′◃j(Mκ) by condensation in U.
In fact, U′◃U∣(τ+)U, and we assumed that U∣(τ+)U is wellfounded,
so U′ is wellfounded.
Let ψ:Uˉ→j(Mκ) be the Shift Lemma map.
So ψ is rΣ0-elementary.
Now rg(ψ)⊆rg(ϱτ),
because if131313Here for a premouse
R, fτ,rR is the partial function
f:C0(R)2→C0(R) given by
f(a′,t′)=τR(r,a′,t′).
[TABLE]
where τ is an rΣm term and q∈C0(Mˉ)
and a∈τˉ<ω,
then
[TABLE]
so
[TABLE]
so ψ(x)∈rg(ϱτ).
So define ψ′:Uˉ→U′ by ψ′=ϱτ−1∘ψ.
Then ψ′ is m-lifting,
because if φ is rΣm+1
and Uˉ⊨φ(x) then easily
[TABLE]
so U⊨“U′⊨φ(ψ′(x))”,
so U′⊨φ(ψ′(x)). Also ψ′↾τˉ=π↾τˉ.
Also ψ′ is c-preserving; if m=0 and M has largest cardinal Ω,
this follows easily from commutativity and the fact that
we put Ω∈rg(π),
and if m=0 and M has no largest cardinal then it is because
then for any M-cardinal λ, we have M∣λ≼1M by condensation,
and hence, κ<max(q) (as κ∈rg(π)),
and so Mˉ,Mκ have largest cardinals Ωˉ,Ωκ
respectively, with π(Ωˉ)=πκ(Ωκ)=cardM(max(q)).
For η<θ,
let
[TABLE]
and πη:Mη→M be the uncollapse
and ση:Mˉ→Mη the natural map,
so πη∘ση=π.
Since η<θ≤τ≤ρm+1M,
we have Mη∈M. Note that if η is an M-cardinal
then Mη is (m+1)-sound with
η=ρm+1Mη
and pm+1Mη=ση(qˉ)\η,
so Mη◃M∣θ.
Now as before, we consider two cases.
Case 3.
π‘‘θˉ* is bounded in θ.*
Let η=supπ‘‘θˉ.
We have Mη, etc, as above.
Note that either:
–
η* is a limit cardinal of M (hence the comments above apply), or*
2. –
M∣∣η* has largest cardinal ξ
where ξ is an M-cardinal and ξ∈rg(π),
and*
[TABLE]
because
rg(π)=Hullm+1M({q}) is cofinal in η; therefore,
ρm+1Mη=ξ and pm+1Mη=ση(qˉ)\ξ.
It follows that Mη is sound, and of course cr(πη)≥η.
Since η<θ≤ρm+1M, condensation (as stated in [6])
gives Mη◃M∣θ. Note that
ση↾θˉ=π↾θˉ and
ση∈M∣θ.
Since M∣θ=U∣θ, therefore Mη◃U∣θ and ση∈U∣θ.
Note that Mη◃C0(U′) as η<τ.
Now ση↾θˉ=π↾θˉ=ψ′↾θˉ
and ση,Uˉ,U′∈U, with Uˉ∈HCU, and moreover,
U∣((ORU′)+)U is wellfounded. So by absoluteness,
in U there is some c-preserving m-lifting embedding
ψ:Uˉ→U′
with ψ↾θˉ=ση↾θˉ.
So U⊨φ+(Mˉ,Uˉ),
where φ+(Mˉ,Uˉ) asserts “There are proper segments M∗ and U∗ of me,
with M∗◃C0(U∗),
and there are c-preserving m-lifting embeddings
[TABLE]
with π∗↾θˉ=ψ∗↾θˉ”.
So by elementarity, M⊨φ+(Mˉ,Uˉ).
Let M∗,U∗,π∗,ψ∗ witness this in M.
These embeddings are enough to copy m-maximal trees on P
to essentially m-maximal trees on M.
The point of the requirement that M∗◃U∗ is as follows.
Suppose that
θˉ=(κˉ+)Mˉ. Then when iterating P, extenders G with cr(G)=κˉ
apply to Mˉ. Let κ∗=π∗(κˉ) and G∗ be the lift of G.
Then
G∗ will measure all subsets of κ∗ in U∗.
Because M∗◃C0(U∗),
we can define a copy map
[TABLE]
as usual;
this suffices.
Although the lifted tree can fail the monotone length condition,
it will be essentially m-maximal;
this works much as in 2.
Case 4.
π‘‘θˉ* is unbounded in θ.*
Then θ is a limit cardinal of M,
because θ is an M-cardinal ≤ρm+1M
and there is an
rΣm+1M-definable cofinal partial map
ω→supπ‘‘θˉ.
For each M-cardinal μ<θ we have Mμ,σμ∈M∣θ=U∣θ.
We have Mμ,σμ,U′∈U∣(τ+)U.
Let C be the set of Mˉ-cardinals <θˉ.
Working in U, let T be the tree searching for
ψ,U and
a sequence ⟨Mμˉ,σμˉ⟩μˉ∈C
such that:
–
U◃U∣(j(κ)+)U**
2. –
ψ:Uˉ→U*
is c-preserving m-lifting,*
3. –
U∣ψ(μˉ)⊴Mμˉ◃U.
4. –
σμˉ:Mˉ→Mμˉ*
is c-preserving m-lifting,*
5. –
σμˉ↾(μˉ+1)⊆ψ.
Now U⊨“T is illfounded”;
in fact U⊨“T∩J(U′) is illfounded”,
because
ψ′,U′,⟨Mμ,σμ⟩μ exist,
and U∣(τ+)U
is wellfounded and models ZFC−.
Now T=j(TM) for some TM∈M,
so M⊨“TM is illfounded”.
But then letting U,ψ,⟨Mμˉ,σμˉ⟩μˉ∈C
witness this, these objects allow us to lift m-maximal trees on P
to m-maximal trees on M (here when we use an extender G with cr(G)=γˉ<θˉ,
we apply it to Mˉ, and our next lifting map is of the form
[TABLE]
where μˉ=(γˉ+)Mˉ and
where i is the upper ultrapower map,
and φ is defined as usual using σμˉ.).
This completes both cases, and hence, the proof that P is iterable.
∎
We have Mˉ∣θˉ=Uˉ∣θˉ. So comparison of (P,M) uses only
extenders indexed above θˉ. So by the claim, there is a successful such
comparison (U,T).
Claim 2.
We have:
M∞U=M∞T, bU,bT do not
drop in model or degree, bU is above Uˉ and iU∘jˉ=iT.
2. 2.
θˉ=τˉ, so θ=τ.
3. 3.
Uˉ∣(τˉ+)Uˉ=Mˉ∣∣(τˉ+)Uˉ,
so U∣(τ+)U=M∣∣(τ+)M.
4. 4.
If E is Dodd-solid then Eˉ∈E+Mˉ, so E∈E+M.
Proof.
Because Mˉ is (m+1)-sound and ρm+1Mˉ=ω, standard
arguments give part 1.
Part 2: Suppose that θˉ<τˉ. Then since
HτˉMˉ⊆Uˉ, we have (θˉ+)Uˉ=(θˉ+)Mˉ.
But then since bU is above Uˉ and does not drop,
[TABLE]
contradicting the choice of θ (and hence θˉ).
Part 3: Much as in part 2,
but now with τˉ=θˉ, so cr(iU)≥τˉ. The conclusion that U∣(τ+)U=M∣∣(τ+)U
follows from the reflection between Mˉ and M discussed earlier.
Part 4: If Eˉ∈EMˉ,
note that Eˉ∈E(C0(Mˉ)), since τˉ<ρ0Mˉ;
it easily follows then that E=π(Eˉ), just by the elementarity of π.
Similarly if Eˉ=FMˉ then E=FM by elementarity.
So we just need to see that Eˉ∈E+Mˉ, assuming that E is Dodd-solid.
If t=∅
then this follows from the ISC
as in the proof of the ISC for pseudo-mice.
Suppose instead that E is Dodd-solid (hence Dodd-sound) and t=∅.
So as discussed earlier, Eˉ is Dodd-solid with respect to tˉ.
Since Mˉ is 1-sound and iterable, by 2
and as in [9, §2], we can analyse the Dodd-structure of the extenders used in T,
decomposing them into Dodd-sound extenders.
As there, there is exactly one extender
G=EαT used along bT, G has a largest generator γ,
and γ=iU(max(tˉ)), and there is a unique β≤Tα
such that the Dodd-core D of G is in E+(MβT),
τD≤τˉ,
and that if β<Tα,
then letting ε+1=succT(β,α),
then Mε+1∗T=MβT∣lh(D),
and letting k=iε+1,α∗T, then cr(k)≥τD and
[TABLE]
and
[TABLE]
Note that ρ1(MβT∣lh(D))≤τD≤τˉ.
Suppose D=FMβT.
Then β=0, as otherwise τˉ<lh(E0T)≤ρ1(MβT∣lh(D)),
contradiction.
So D∈EMˉ. Since τˉ is an Mˉ-cardinal,
therefore τD=τˉ, so
[TABLE]
so E=D, as desired.
Now suppose instead that D=FMβT.
Then again β=0, since otherwise τˉ≤λ(E0T)<τD, contradiction.
So D=FMˉ. We claim that α=0, so G=D
is Dodd-sound, and it follows then (as in [9]) that
U is trivial and we are done.
So suppose 0<Tα; so (0,α]T does not drop in model.
Let F∗ be the first extender used along (0,α]T.
So τˉ≤νF∗. Note that
[TABLE]
where G′ is the active extender of Ult0(Mˉ,F∗↾τˉ).
Therefore Uˉ is the iterate of Mˉ given by the tree T′
which uses exactly two extenders,
E0T′=F∗↾τˉ and E1T′=G′. It follows that T=T′, U is trivial,
E0T=F∗, νE0T=τˉ,
[TABLE]
and E1T=G=G′.
So E0T=FMˉ (as κˉ=cr(E1T)=cr(D) and D=FMˉ),
so
[TABLE]
Mˉ∣λˉ is active with E0T,
and κˉ<cr(E0T). It follows that E0T=Fˉ from
property 11’ above. But then by that property,
[TABLE]
Also tˉ=k(tD\cr(E0T))
and
[TABLE]
But then D∈Mˉ, contradiction.
∎
This completes the proof of the theorem.
∎
3 Inductive condensation stack: E from E↾ω1
In this section we prove Theorem 1.
We first give the proofs of some older results, as their methods are then used in the proof
of 1.
The first is an observation due to Jensen.
Fact 3.0** (Jensen).**
Let N be a premouse of height κ>ω,
where κ is regular.
Let P be a sound premouse such that N⊴P,
ρωP=κ, and ω-condensation
holds for P. Let Q be likewise.
Then P⊴Q or Q⊴P.
Proof.
Suppose not. Taking a hull of V, it is easy to
find Pˉ,Qˉ such that Pˉ⋬Qˉ⋬Pˉ
and fully elementary maps
π:Pˉ→P and σ:Qˉ→Q
and κˉ
such that
[TABLE]
and π(κˉ)=κ=σ(κˉ).
So by condensation, either
(i)
Pˉ⊴M∣κ
and Qˉ⊴M∣κ, or
2. (ii)
M∣κˉ is active
and Pˉ⊴U and Qˉ⊴U where U=Ult(M∣κˉ,FM∣κˉ).
In either case, it follows that either Pˉ⊴Qˉ
or Qˉ⊴Pˉ, a contradiction.
∎
A slight adaptation gives:
Fact 3.0**.**
Let M be a (0,ω1+1)-iterable premouse with no
largest proper segment.
Let κ>ω be a regular cardinal of M.
Let P∈M be a sound premouse such that M∣κ⊴P,
ρωP=κ, and ω-condensation
holds for P. Then P◃M.
Proof.
Use the proof above with Q⊴M such that P∈Q and ρωQ=κ.
∎
A slight refinement of this argument gives:
Fact 3.0**.**
Let M be a (0,ω1+1)-iterable premouse.
Let κ>ω be a regular cardinal of M.
Let P∈M be a (n+1)-sound premouse such that M∣κ⊴P,
ρn+1P=κ, and (n+1)-condensation holds for P.
Then P◃M.
The second ingredient is an argument of Woodin’s,
which is used in the proof of
Corollary 1 below.
Steel noticed that
1
follows from Theorem 1 combined with Woodin’s argument.
We have that M is (0,ω1+1)-iterable,
κ is uncountable in M and (κ+)M<ORM.
We want to see that
M∣(κ+)M is definable from parameters over H=(Hκ+)M.
There are two cases.
Case 1.
M* has no cutpoint
in [κ,(κ+)M).*
Then there are unboundedly many
γ<(κ+)M indexing an M-total extender. So by
1,
given a premouse P∈H such that M∣κ⊴P and ρωP=κ, we have
[TABLE]
iff there is E∈H such that P◃Ult(M∣κ,E)
and H⊨“E is a countably complete short extender”.
So M∣(κ+)M is definable over H from the parameter M∣κ,
which suffices.
Case 2.
Otherwise (M has a cutpoint γ0∈[κ,(κ+)M)).
The proof in this case is due to Woodin, and was found earlier.
Let X be the set of all H∈HCM
such that there is P◃M∣(κ+)M and π∈M
such that π:H→P is elementary.
Since (κ+)M<ORM, we have X∈M and X is essentially a subset of ω1M in M.
So X∈H.
Let P∈M be a sound premouse such that M∣γ0⊴P,
γ0 is a cutpoint of
P and ρωP≤γ0. Then we claim that (i) P◃M iff (ii)
[TABLE]
it follows that M∣(κ+)M is definable over
H
from the parameter (X,M∣γ0), which suffices.
Now (i) implies (ii) by definition. So suppose (ii) holds. Let
P∈Q◃M, with
ρωQ≤γ0.
Working in M, let Y≼Q be countable, with P∈Y.
The transitive collapses Pˉ of Y∩P and Qˉ of Y are in X,
so can be compared in V.
But Pˉ∣γˉ0=Qˉ∣γˉ0 where γˉ0
is a cutpoint of both Pˉ,Qˉ, and Pˉ,Qˉ are sound and project ≤γˉ0.
So standard calculations give that Pˉ⊴Qˉ, so P⊴Q.∎
Woodin’s argument above makes use of the parameter
X. We can actually replace this parameter with \mathbbmmM:
Lemma 3.0**.**
Let N be an (0,ω1+1)-iterable premouse with no largest proper segment. Let M◃N and
H∈HCN and π:H→M be elementary
with π∈N. Then there is
Mˉ◃N∣ω1N
and
an elementary πˉ:H→Mˉ with πˉ∈N.
Proof.
Let M◃P◃N be such that π∈P.
Let q∈(ORP)<ω be
such that (ω,q) is 1-self-solid for P and such that
[TABLE]
Let
[TABLE]
Then by 2, Pˉ◃N∣ω1N. Let σ:Pˉ→P be the uncollapse.
Then σ(H)=H. Let σ(πˉ)=π and σ(Mˉ)=M. Then Mˉ◃Pˉ and
πˉ:H→Mˉ elementarily, so we are done.
∎
Similarly:
Lemma 3.0**.**
Let N be a (0,ω1+1)-iterable premouse. Let M◃N and
H∈HCN and m<ω and π:H→M be an m-lifting ((weak, near)m-embedding
respectively)*
with π∈N. Then there is
Mˉ◃N∣ω1N
and
an m-lifting ((weak, near)m-embedding respectively*)* πˉ:H→Mˉ with
πˉ∈N.*
Proof.
Consider the case that N=J(M)
and π:H→M. Then there is k<ω and x∈M such that π is rΣkM({x}). Argue
as in the proof of 3, but at degree n instead of 1,
with n>k+m+5.
∎
Woodin’s argument above is abstracted into the following definition:
Definition 3.1**.**
Let M be a (0,ω1+1)-iterable premouse satisfying “ω1 exists”, with no largest proper
segment.
Then cssM (countable substructures) denotes the set of all H∈HCM such that for
some P◃M,
there is π∈M such that π:H→P is elementary. (So by
3, cssM is definable over \mathbbmmM, uniformly in M.)
Let P,Q∈M be sound premice. Working in M,
say that P is \mathbbmmM-verified
iff every countable elementary substructure of P is in cssM,
and say that Q is an (\mathbbmmM,P)-lower part premouse
iff P⊴Q, P is a cutpoint of Q, Q projects to P and Q is \mathbbmmM-verified.
Working over M, the stack of all (\mathbbmmM,P)-lower part premice
is denoted Lp\mathbbmmM(P).
Note that Lp\mathbbmmM(P) is definable over ⌊M⌋ from
\mathbbmmM,P; the fact that it forms a
stack follows from the proof of 1.
In order to prove Theorem 1, it easily suffices to prove
that if M is passive, (0,ω1+1)-iterable and satisfies ZFC−+“ω1 exists”,
then EM is definable over ⌊M⌋ from EM↾ω1M,
uniformly in M.
We will in fact prove a stronger fact, Theorem 3 below, making do
with less than ZFC−.
We may assume that M has a largest cardinal θ.
The proof breaks into different cases,
depending on the nature of M above θ.
Clearly the cases are not mutually exclusive (Case (c)1
is in fact subsumed by Case (c)4); the
cases describe situations in which certain methods of proof work.
Definition 3.2**.**
Let M be a premouse. Let κ<θ be cardinals of M.
We say that κ is Hθ-strong in M
iff there is E∈M such that M⊨“E is a countably complete short extender”
and cr(E)=κ and HθM⊆Ult(M,E).
Definition 3.3**.**
A premouse M is eventually trivial
iff M=Jα(R) for some R◃M and α>0.
Remark 3.3**.**
In the theorem statement below, in each case we specify
definability classes Γ,Λ.
The case specification is Γ⌊M⌋({M∣θ}), meaning that there is a Γ
formula φ
such that for any (0,ω1+1)-iterable premouse M satisfying “ω1 exists and θ is
the largest cardinal”, the case hypothesis holds of M iff ⌊M⌋⊨φ(M∣θ).
In the given case, the definition of EM is Λ⌊M⌋({M∣θ}).
(The fact that the case specification is definable is obviously used in
defining M∣θ from
\mathbbmmM over ⌊M⌋.)
Definition 3.4**.**
Let M be a passive premouse with a largest cardinal θ≥ω1M.
We say that M is tractable iff either (i) θ is regular in M,
or (ii) θ is a cutpoint of M, or (iii) M has no cutpoint in [θ,ORM),
or (iv) cofM(θ)>ω, or (v) M⊨“θ is not a limit of cardinals which are Hθ-strong”,
or (vi) cofΣ2⌊M⌋(ORM)>ω,
or (vii) [cofΣ1⌊M⌋(ORM)>ω and M is eventually trivial].
Theorem 3.4**.**
Let M be a passive (0,ω1+1)-iterable premouse satisfying “ω1 exists”.
Then:
(a)
If M is tractable then
EM is
Σ4⌊M⌋({\mathbbmmM}), uniformly in such M.
2. (b)
If ⌊M⌋⊨PS then EM is Σ2⌊M⌋({\mathbbmmM}),
uniformly in such M.
3. (c)
In fact, suppose that M has largest cardinal θ and either:
θ* is regular in M; and let
(Γ,Λ)=(Π1,Σ1), or*
2. 2.
θ* is a cutpoint of M; let
(Γ,Λ)=(Π2,Σ2), or*
3. 3.
M* has no cutpoint in [θ,ORM);
let (Γ,Λ)=(Π3,Σ2), or*
4. 4.
cofM(θ)>ω; let
(Γ,Λ)=(Π1,Σ1), or
5. 5.
M⊨“θ* is not a limit of Hθ-strong cardinals”; let (Γ,Λ)=(Σ3,Σ1), or*
6. 6.
cofΣ2⌊M⌋(ORM)>ω*;*141414By
cofΣn⌊M⌋(ORM),
we mean the least ordinal μ such that there is a total
unbounded function f:μ→ORM which is Σn⌊M⌋-definable.
Note that this is standard Σn, not rΣn.let
(Γ,Λ)=(Π5,Σ4), or
7. 7.
cofΣ1⌊M⌋(ORM)>ω* and M is
ev. trivial;
let
(Γ,Λ)=(Π3∧Σ3,Σ3).*
Then EM is Λ⌊M⌋({M∣θ}), and the case specification
is Γ⌊M⌋({M∣θ}), both uniformly in such M.
Parts (a)
and (b) follow immediately from part (c)
by an easy induction on M-cardinals.
Part (c): We split into the cases given in the statement of this part.
In each case we will give a characterization of EM and leave to the reader the verification
of the precise degree of definability. Note that for the definability of the case specification,
we use 1 to determine, for
example,
whether or not θ is a cutpoint of M.
Case 1.
θ* is regular in M.*
By 3,
working in M,
given any premouse P, we have P◃M
iff there is a sound premouse Q and n<ω such that
P◃Q and ρn+1Q=θ
and M∣θ⊴Q and Q satisfies (n+1)-condensation.
And EM is the stack of all structures of the form Sm(P)
for such P and m<ω.
Case 2.
θ* is a cutpoint of M.151515
The case specification is Π2 because θ is a cutpoint of M
iff for all E,H∈M, if M⊨“H=HθM
and E is a pre-extender with H⊆Ult(M,E)”
then M⊨“E is not countably complete”;
if ⌊M⌋ is admissible then Π1 suffices for the case specification,
because we can replace the requirement that M⊨“E is not countably complete”
with the requirement that “M⊨Ult(M∣(κ+)M,E) is illfounded”,
where κ=cr(E).*
Use the proof of Corollary 1, or an obvious adaptation thereof if
M=J(R),
combined with 3 and 3.
Let P∈M and n<ω be such that P is a sound premouse, M∣θ⊴P,
ρn+1P=θ, and P satisfies (n+1)-condensation. We claim that P◃M; clearly
this suffices. If θ is regular in M we can use the proof of Case (c)1,
so suppose otherwise; in particular, θ is a limit cardinal of M.
We prove that P◃M using a phalanx comparison.
Let Q◃M and x∈Q and m<ω be such that P is rΣmQ({x});
in particular, ORP≤ORQ. We must show that P⊴Q.
Suppose not; note that the fact that P⋬Q is first-order over Q (in the parameter x).
So we may assume that x=∅ (increasing m if needed).
Let m+n+5<k<ω and let Qˉ=cHullk+1Q(∅).
Then Qˉ◃M. Let Pˉ be defined over Qˉ as P is over Q.
Let π:Qˉ→Q be the uncollapse, and π(θˉ)=θ.
Then Pˉ is (n+1)-sound and ρn+1Pˉ=θˉ,
Qˉ is ω-sound and ρk+1Qˉ=ω,
Pˉ∣θˉ=Qˉ∣θˉ, and θˉ is a cardinal of both models.
Define the phalanx
P=((Qˉ,k,θˉ),(Pˉ,n),θˉ).
By the following claim, a standard comparison argument (comparing P with Qˉ) shows that
Pˉ⊴Qˉ,
so P⊴Q, a contradiction, completing the proof.
Claim 3.
P* is (ω1+1)-iterable.*
Proof.
Let σ:Pˉ→P be π↾Pˉ.
Then σ↾θˉ=π↾θˉ.
Let η=supπ‘‘θˉ.
Then η<θ because cofM(θ)>ω.
Because θ is a limit cardinal of M,
so is η.
Let
[TABLE]
and π′:P′→P be the uncollapse.
Then P′ is (n+1)-sound, ρn+1P′=η
and
[TABLE]
For clearly ρn+1P′≤η. Using that k>n+m+5, note that
P′ is (n+1,q)-solid. We have P′∣η=M∣η and P′∈M,
and as η is an M-cardinal, therefore
ρn+1P′=η
and q=pn+1P′.
So we can apply (n+1)-condensation, and note then that P′◃M.
Let σ′:Pˉ→P′ be the natural factor map. Then σ′ is a near n-embedding,
and σ′↾θˉ=π↾θˉ. Using (π,σ′), one can
lift normal trees on P to normal trees on Qˉ, completing the proof.
∎
Case 5.
M⊨“θ is not a limit of cardinals which are
Hθ-strong”.
This is almost the same as the previous case; we leave it to the reader.
The remaining cases are more subtle than the previous ones.
We (may) now make the:
Assumption 1**.**
θ is a limit cardinal of M and M has a cutpoint in
[θ,ORM).
This must of course
be incorporated appropriately into the
Σ4({M∣θ}) (in case (c)6)
and Σ3({M∣θ}) (in case (c)7)
definitions one forms from the arguments to follow.
But given the definability (Σ,Λ)
established for cases (c)1 and (c)3,
this is no problem. (Note here that in case (c)7,
Mdoes have a cutpoint ≥θ, so the Π3
complexity of asserting the non-existence of a cutpoint is not
relevant in this case.)
Case 6.
cofΣ2⌊M⌋(ORM)>ω.
Work in M and let P be a premouse. Say that P is good
iff
P is sound,
M∣θ⊴P and
ρωP=θ.
Say that P is excellent iff
–
P* is good,*
2. –
M* and Lp\mathbbmmM(P) have the same universe, and*
3. –
1-condensation holds for every Q◃Lp\mathbbmmM(P).
By the case hypothesis,
M has no largest proper segment,
so with Assumption 1,
it follows that there are cofinally many excellent N◃M.
Therefore it suffices to prove the following claim:
Claim 4.
Let P,Q∈M be excellent. Then either P⊴Q or Q⊴P.
Proof.
We may assume Q◃M and ORQ is a cutpoint of M, so Lp\mathbbmmM(Q)=M.
Define ⟨Pn,Qn⟩n<ω as follows.
Let P0=P and Q0=Q. Given Pn,Qn, let Qn+1 be the least N◃M such that N is
good, Qn◃N and Pn∈N.
Given Pn,Qn+1, let Pn+1 be the least R◃Lp\mathbbmmM(P)
such that R is good, Pn◃R and Qn+1∈R.
Let P=stackn<ωPn and Q=stackn<ωQn.
Note that
P and Q have the same universe U
(but ostensibly may have different extender sequences).
We have ORU<ORM by our case hypothesis, as
⟨Pn,Qn⟩n<ω is Σ2⌊M⌋({P,Q}).161616
It seems that Σ1 is not in general enough,
because to ensure that, for example, Pn◃Lp\mathbbmmM(P),
requires a ∀-quantifier in order to deal with arbitrary countable
substructures of Pn; note that if cofM(θ)>ω,
one can dispense with this quantifier, however,
as one can code the substructures via bounded subsets of θ.
Now P is definable over U from the parameter P,
and likewise Q over U from Q; in fact,
[TABLE]
(Clearly cofinally many segments of P satisfy the requirements
for premice in Lp\mathbbmmU(P); but if R is some premouse satisfying
these requirements then working in U, we can run the same proof as before
to see that R◃Lp\mathbbmmU(P).)
Also, U has largest cardinal θ, so Lp\mathbbmmM(P)∣ORU
and M∣ORU are both passive.
So letting P+=J(P) and Q+=J(Q), we have P+◃Lp\mathbbmmM(P)
and Q+◃M and (because P,Q are definable from parameters over U),
[TABLE]
Also because ORU has cofinality ω,
definably over U from parameters, we have
[TABLE]
We claim that there is
an M-cardinal γ<θ such that
[TABLE]
(“Hull” denotes the uncollapsed hull),
and the transitive collapses
Pˉ+,Qˉ+
are 1-sound and such that ρ1Pˉ+=γ=ρ1Qˉ+.
For recalling that θ is a limit cardinal of M, let γ<θ be an M-cardinal
large enough
that, defining H,J as above, we have
[TABLE]
(recall w1P+,w1Q+ are the 1-solidity witnesses for P+,Q+).
Then because γ is an M-cardinal and w1P+∈H,
we easily have that ρ1Pˉ+=γ and Pˉ+ is 1-sound, and likewise for
Qˉ+. And because
[TABLE]
and P+,Q+ have the same
universe, we have J⊆H. Similarly H⊆J, giving line (4).
By 1-condensation for P+,Q+ (a requirement of excellence), and because ρ1Pˉ+=γ=ρ1Qˉ+
is an M-cardinal, we have Pˉ+◃M and Qˉ+◃M.
By line (4), ORPˉ+=ORQˉ+. Therefore Pˉ+=Qˉ+.
It easily follows that P=Q, giving the claim.
∎
Case 7.
cofΣ1⌊M⌋(ORM)>ω* and M is eventually trivial.*
A simplification of the argument in the previous case shows that the collection of all R◃M
such that M=Jα(R) for some α>0, is Π2⌊M⌋({M∣θ}).
Regarding the complexity of the case specification,
it is Σ3⌊M⌋ to assert “M is eventually trivial”,
as it is equivalent to
[TABLE]
(as if M is not eventually trivial then M is closed under sharps).
This completes all cases and hence, the proof of the theorem.
∎
Definition 3.5**.**
Let M be a transitive structure.
Let \mathbbmm∈M be a premouse with ⌊\mathbbmm⌋=HCM.
The inductive condensation stack of M above \mathbbmm
is the stack of premice in M,
extending \mathbbmm, satisfying the inductive definition used in the proof of 3.
Of course, the inductive condensation stack S could have
ORS<ORM. But if M is a (0,ω1+1)-iterable tractable premouse
and m=M∣ω1M then M=S.)
Remark 3.5**.**
In Case (c)3 of the preceding proof,
it appeared that we used 1
for extenders E generated by θ∪t for some finite set t of generators
(in order that we can represent arbitrary segments R◃M∣(θ+)M).
Actually, it suffices to consider only extenders
E such that νE=θ (and HθM⊆Ult(M,E) etc).
For we claim that (under the case hypothesis) there are unboundedly many β<ORM
such that M∣β is active with an extender E such that νE=θ; clearly this suffices.
For let Q◃M be such that ρωQ=θ
and let α be least such that α>ORQ and M∣α is active with extender F
and κ=cr(F)<θ. We claim that νF=θ.
So suppose that θ<νF.
Easily by the ISC, θ is the largest cardinal of M∣α.
So F is type 2. Let E=F↾θ and let
[TABLE]
be the standard factor map. So cr(π) is the least generator γ
of F with γ≥θ.
Suppose γ=θ.
It follows easily that θ is a limit cardinal of M and Ult(M,E),
so
[TABLE]
By the ISC, κ is then <θ-strong in M, hence likewise in Ult(M,E).
Therefore κ is <π(θ)-strong in Ult(M,F).
But then again by the ISC, there are unboundedly many ξ<(θ+)Ult(M,F)
indexing an extender G with cr(G)=κ, contradicting the minimality of F.
Now suppose γ>θ. Then because
[TABLE]
we have γ=lh(E) and π(γ)=lh(F).
But E∈E(Ult(M,F)), so by reflection,
there are unboundedly many ξ<lh(E) such that M∣ξ is active
with an extender G with cr(G)=κ,
and so the same holds of π(lh(E))=lh(F),
again contradicting the minimality of F.
Remark 3.5**.**
Let M be passive, (0,ω1+1)-iterable, satisfying “ω1 exists”
and θ=lgcd(M). We sketch, in a further case,
the identification of M from parameter M∣θ over ⌊M⌋.
However, here we do not
know whether the case specification itself is uniformly definable
over ⌊M⌋ as above. Say that M
is
rΣ1-bounded
iff
Hull1M(α∪{x})
is bounded in ORM for every α<ρ1M and x∈M.
Suppose that M is 1-sound and ρ1M>ω, and
M is eventually trivial, or
M is notrΣ1-bounded.
Then M is definable from M∣θ over ⌊M⌋.
To see this, we argue much as in the last two cases of 3.
We may make Assumption 1.
If M is
eventually trivial things are easier (using then either the argument
from Case (c)7 of 3 if
cofΣ1⌊M⌋(ORM)>ω, or
a variant of the argument to follow otherwise),
so we leave this case to the reader, and suppose otherwise. So
M is closed under sharps and has no largest proper segment.
The difference to Case (c)6 of 3 is that now, when we
define P,Q,
we might have ⌊M⌋=⌊P⌋=⌊Q⌋.
Let P∈M be good (good defined as before).
Say that P is excellent iff P satisfies
the conditions of excellence from before, and letting P∗=Lp\mathbbmmM(P),
then P∗ is 1-sound, ρ1P∗>ω,
P∗ is not rΣ1-bounded, 1-condensation holds for P∗,
and for all R⊴P∗, if
[TABLE]
then for all sufficiently
large γ<ρ,
[TABLE]
(so 1-condensation applies to the uncollapse map). By 2, all
sufficiently large Q◃M are excellent; we take Q such.
Let P∈M be excellent. We claim that ρ1M=ρ1P∗.
For suppose ρ1M>ρ1P∗. Let α∈[ρ1P∗,ρ1M) be large
enough
that
[TABLE]
is unbounded in ORM (using non-rΣ1-boundedness)
and P,p1P∗∈H. Then P′∈H for cofinally many P′◃P∗.
For given η0,η1∈H∩ORM such that
there is a good P′◃P∗ with η0≤ORP′ and P′∈M∣η1,
then the least good P′′◃P∗ such that η0≤ORP′′, is in H
(in order to ensure that the selected P′′◃P∗,
one can restrict their attention to all countable elementary
substructures of P′′ which appear in some reasonable segment of M;
because M is closed under sharps, there are plenty of very closed segments). It
follows that
[TABLE]
But P∗ is 1-sound and ⌊P∗⌋=⌊M⌋, so M=H,
contradicting the fact that
α<ρ1M. So ρ1M≤ρ1P∗
and the converse is likewise.
The rest is much like the last part of the argument used in Case (c)6,
but if P=P∗ and Q=M, there is a wrinkle.
In this case, choose α<ρ1M=ρ1P∗ such that
[TABLE]
by arguing as in the previous paragraph,
and such that the transitive collapses Pˉ,Qˉ of the hulls are 1-sound (using
2 and excellence if ρ1M=(κ+)M).
Then by 1-condensation we get Pˉ=Qˉ, so P=Q.
Corollary 3.5**.**
Let M be a (0,ω1+1)-iterable premouse satisfying either PS or ZFC−+“ω1 exists”.
Suppose that either:
\mathbbmmM* is (ω,ω1+1)-iterable in M,171717If
ORM=ω2M then this statement should be interpreted as “There is an (ω,ω1)-strategy
Σ for M∣ω1M such that for every tree T via Σ of length ω1,
there is a T-cofinal branch”. or*
2. 2.
\mathbbmmM* is built by the181818Here
one can naturally impose various other restrictions on the construction,
but it should be uniquely specified somehow. maximal fully backgrounded
L[E]-construction of M using background extenders E∈EM such that νE is an
M-cardinal.*
Then EM is definable over
⌊M⌋ without parameters, so if ⌊M⌋⊨ZFC then ⌊M⌋⊨“V=HOD”.
Proof.
Part 1 follows from 3.
For part 2, note that by 1,
if E∈M then we have that (i) E∈EM and νE is an M-cardinal iff (ii)
M⊨“E is a countably complete
extender, νE is a cardinal and HνE⊆Ult(V,E)”. So the
L[E]-construction using these background extenders is definable over ⌊M⌋ without
parameters, so \mathbbmmM is likewise definable.
∎
Recall that Mwlim is the least proper class mouse with a Woodin limit of Woodins.
Part 2 of the previous corollary gives:
Corollary 3.5**.**
⌊Mwlim⌋⊨“V=HOD”.
There are of course many variants of this corollary. Using the background construction of [6]
in place of the background construction used above,
one gets that ⌊M⌋⊨“V=HOD”
where M is, for example, the least proper class mouse with a λ
which is a limit of Woodins and strong cardinals.
4 Direct condensation stacks in M[G]
In this section we prove the following theorem, using
a variant of the inductive condensation stack:
Theorem 4.0**.**
Let M be a (0,ω1+1)-iterable premouse satisfying PS.
Let θ<ORM be a regular cardinal of M
and P∈M∣θ
be a poset. Let G be (M,P)-generic.
Then EM is definable over M[G]
from the parameter M∣θ.
Proof.
Work in M[G].
It suffices to give a definition of M∣(η+)M
from the parameter M∣θ, uniformly in M-regular cardinals
η≥θ.
Note that the Jensen stack over M∣η is exactly M∣η+,
and this structure satisfies standard condensation facts.
Say that a premouse P is excellent iff
M∣θ⊴P, ORP=η, the Jensen stack P+
over P has height η+, P+ satisfies standard condensation facts,
and there is Q∈P∣θ and a (P,Q)-generic filter h
such that P+[h] has universe Hη+.
Clearly the following claim completes the proof:
Claim 5.
M∣η* is the unique excellent premouse.*
Proof.
Clearly N=M∣η is excellent (with N+=M∣η+),
as witnessed by P,g.
So let R also be excellent, as witnessed by Q,h.
Define a sequence ⟨Nn,Rn⟩n<ω
as follows. Let N0=N and R0=R.
Given Nn,Rn, let Nn+1 be the least N′
such that Nn◃N′◃N+
and ρωN′=η and Rn,h∈N′[g];
then let Rn+1 be the least R′ such that Rn◃R′◃R+
and ρωR′=η and Nn+1,g∈R′[h].
Let Nω=stackn<ωNn and N=J(Nω),
and Rω,R likewise. Then
N◃N+ and R◃R+.
Note that
Nω[g] and Rω[h] have the same universe U,
and Nω,Rω are both definable from parameters
over U (via the Jensen stack). Hence, J(Nω[g])
and J(Rω[h]) and N[g] and R[h]
all have the same universe U=J(U).
Now N,R both satisfy
standard 1-condensation facts.
Let γ<θ be a cardinal of the models N,N[g],R[h],R
such that P,Q have cardinality
≤γ in N,R respectively.
Subclaim 1.
For all x∈U
there is q∈[ORU]<ω
such that the hulls H,H′,J,J′ all contain the same ordinals, where
[TABLE]
[TABLE]
and moreover, P∈H, Q∈J, x∈H′=J′,
and the transitive collapses C,D of H,J
respectively are sound.
Assuming the subclaim, let π:C→H and σ:D→J be the uncollapses.
Then by 1-condensation, C◃N∣θ
and D◃R∣θ, and hence C=D (as N∣θ=R∣θ and ORC=ORD),
and π↾OR=σ↾OR.
But then N=P and N=P, as desired.
Proof of Subclaim.
Use a simple variant of the proof of 2
to choose q, running an algorithm much as there, but simultaneously
for both models N,R,
and using the Σ1-definability of the Σ1-forcing relation
to see that H,H′ contain the same ordinals (and likewise J,J′),
and choosing elements of q large enough to ensure
that H′=J′ and P∈H etc. We leave the details to the reader.
(Here is some more of a sketch: Given q↾i
and γi much as in the proof of 2,
first select some qi′ satisfying the requirements
much as before with respect to N (hence
with γi<qi′<(γi+)U),
and with qi′ large enough that
P∪{P}⊆ the relevant hulls
of N (note this condition holds
trivially unless γi<θ)
and x,Nω,Rω,g,h are in the relevant hulls of U.
Then choose qi with qi′<qi<(γi+)U
and much as before with respect to R.
In this manner it is easy to arrange that qi works.)
This completes the proof of the subclaim, claim and theorem.
∎
∎
∎
Definition 4.1**.**
Let M be a transitive structure satisfying PS.
Work in M.
Let P be a premouse with ORP regular.
For a regular cardinal η≥ORP, define η-excellent premice
(relative to P,η) as in the proof above
(there we have P=M∣θ).
The direct condensation stack
of M above P is the stack S of all η-excellent premice,
for all such η, as far as this is a well-defined stack.
Remark 4.1**.**
As a special case of the previous theorem,
we get a shorter proof that if a mouse M satisfies PS,
then EM is definable over ⌊M⌋ from the parameter M∣ω1M.
Note that the proof also easily adapts to the case that M
has a largest cardinal λ, assuming that λ is M-regular.
However, for the singular case (most importantly cofM(λ)=ω)
we need the earlier methods.
5 A simplified fine structure
In [1], Mitchell-Steel fine structure is introduced,
which makes use of the parameters un.
We introduce a simplified fine structure here which avoids
the parameters un, and show that in fact,
the two fine structures are equivalent (we get the same notions of soundness etc).
Definition 5.1**.**
Let N be a premouse. Given X⊆N, Hullk+1N(X) denotes
the substructure of N whose elements are
those z∈N such
that there is x∈X<ω and an rΣk+1 formula
φ such that z is the unique z′∈N such that
N⊨φ(x,z′). And cHullk+1N(X) denotes its transitive collapse.
Also let Thk+1N(X) be the
rΣk+1 theory191919That is, the pure theory, in the language of
[1]. of N in parameters in X.
Definition 5.2** (Minimal Skolem terms).**
Let
φ be an
rΣk+1 formula of
n+1<ω free variables. The minimal Skolem term associated
to φ is denoted mτφ, and
has n variables.
Let R be a k-sound premouse with ρkR>ω. Let
q∈[ORR]<ω with
[TABLE]
and if q=∅ then ρk≤min(q).
We define the
partial function
[TABLE]
If k=0 then mτφ,qR is just the usual
Skolem function associated to φ (such that the graph of
mτφR is uniformly rΣ1R). (Note q=∅ in this
case.)
Suppose k>0. Let
x∈C0(R)n. If C0(R)⊨¬∃yφ(x,y), then
mτφ,qR(x) is undefined.
Suppose C0(R)⊨∃yφ(x,y). Let τφ be the basic Skolem term associated
to φ (see [1, 2.3.3]). For β<ρkR, let
(τφ)β be defined over R as in the proof of [1, 2.10],
with q as chosen above. Let β0 be the
least β such that
(τφ)β(x) is defined. Define
[TABLE]
Lemma 5.2**.**
The graph of mτφ,qR is
rΣk+1R({q}), recursively uniformly in φ,R,q(for R,q as in
5.2).
Given rΣk+1 formulas
φ,ψ0,…,ψn−1, with φ of n free
variables and ψi of ni+1 free variables, the relation
over C0(R),
[TABLE]
is rΣk+1({q}), uniformly in R,q as in 5.2, and
moreover, there is a recursive
function passing from φ,ψ0,…,ψn−1 to an
rΣk+1 formula for ϱ.
Therefore minimal Skolem terms are effectively closed under composition.
That is, there is a recursive function passing from φ,ψ to
ϱ,
such that for all relevant
R,q, we have
[TABLE]
In the following lemma, the standard Skolem terms are as in [1];
for example, tφR(x) is the R-least y such that C0(R)⊨φ(x,y).
The main thing is to see that H3⊆H2. For this, see the
proof of [1, 2.10], combined with (for example) the observation that
if x∈X<ω and y∈H2 and R⊨∃z<Ryφ(q,x,y), then there is z∈H2 such that z<Ry and
R⊨φ(q,x,z); this is by 5. Applying this
observation finitely many times shows that tφR(q,x)∈H2.∎
Definition 5.3**.**
For k<ω, the terminology k-u-sound, k-u-solid,
etc, mean just what k-sound, k-solid,
etc, mean in [1].202020In this notation, “k” is a variable but
“u” is just a symbol. The symbol “u” indicates that the un’s are being used in the definition.
Definition 5.4**.**
For N a premouse, define qk=qkN and
k-q-solidity and
k-q-soundness for k∈[0,ω), recursively as follows.
We also define k-q-universality in the obvious manner.
Suppose q0,…,qk have been defined and
N is k-q-sound and k-u-sound.
Now if k≥1 then suppose by induction that
[TABLE]
Let qk+1 be the <lex-least
q∈[OR]<ω such that212121In our notation, Thk+1 refers to pure
rΣk+1 theories, but by [1, §2], it would make no difference
in the definition of qk+1 (or ρk+1) whether we use pure or
generalized theories.
[TABLE]
For q,v∈N with q∈[OR]<ω, and for
α∈q, the (k+1)-solidity witness for ((q,v),N) at
α, is
[TABLE]
We say (q,v) is
(k+1)-solid for N iff wαN(q,v)∈N for each α∈q.
We say N is (k+1)-q-solid iff (qk+1,qk) is
(k+1)-solid for N.
We say
N is (k+1)-q-sound iff N is (k+1)-q-solid and
[TABLE]
In general we define
Ck+1q(N)=cHullk+1N(ρk+1N∪{qk+1,qk}).
The theorem below establishes the equivalence between standard Mitchell-Steel fine structure
(u-soundness, etc) and the fine structure introduced here (q-soundness, etc).
In part 3 we show that the parameters provided by ukNautomatically get into the relevant hulls.
Theorem 5.4**.**
Let k<ω. Let N be a premouse. Then:
(a)
N* is k-q-sound iff N is
k-u-sound.*
If N is k-u-sound and ω<ρkN then:
piN=qiN* for all i≤k.*
2. 3.
Let X⊆N,
let M=cHullk+1N(X∪{qkN}) and
π:M→N the uncollapse. Then M is a k-u-sound premouse and π is a
near k-u-embedding such that
(i)
if ρkM<ρ0M then π(ρkM)≥ρkN,
2. (ii)
for all i≤k and all
α∈qiM,
[TABLE]
3. 4.
pk+1N=qk+1N* and N is
(k+1)-u-solid iff
(k+1)-q-solid, (k+1)-u-universal iff (k+1)-q-universal,
(k+1)-u-sound iff
(k+1)-q-sound.*
Proof.
We prove the proposition by induction on k. For k=0 it is easy. Assume
k>0 and the lemma holds at all k′<k. Parts (a) and
2 are trivial by induction (by part
4). So consider part 3.
Let H=rg(π).
Note
that X∪{qkN}⊆H and if x∈H and
y∈Hullk+1N({x}) then
y∈H. Now we prove:
Claim 6.
Let i≤k. Then qiN∈H and if i<k and ρiN<ρ0N then
ρiN∈H.
Proof.
We prove the claim by induction on i.
It is trivial for i=0 and i=k
(since q0N=∅ and we put qkN∈H directly). Suppose 0<i<k and the claim holds for all i′<i.
We show qiN∈H. So assume n=lh(qiN)>0.
Note that qiN is the unique q∈[OR]<ω such
that
(i)
N=HulliN((min(q)+1)∪{qi−1N}) and
2. (ii)
(q,qi−1N) is
i-solid for N and
3. (iii)
lh(q)=n.
Now each of these statements are
rΣk+1({qkN}). For statement (i), if i>1, this is because by
induction,
[TABLE]
so by
5, (i) is equivalent to “∀x∈N there is
β∈(min(q)+1)<ω and an rΣi formula φ such that
x=mτφ,(qi−1N,qi−2N)(β,q)”. If i=1 then it is
similar. So qiN∈H, as required.
Now if i<k and ρiN<ρ0N then by induction, ρiN is the least ρ with
[TABLE]
So as above and in the proof of 5, if
ρiN<ORN then ρiN∈H.222222That is, it seems we don’t get a
uniform definition of ρk−1N here, but we do get some ρ∈H such
that N=HulliN(ρ∪{qiN,qi−1N}), and then if ρ=ρiN,
we can get a smaller such ρ′∈H, and so on.
∎
In the next claim it is more important that
qkN∈H.
Claim 7.
If φ is rΣk+1 and x∈H and N⊨∃yφ(x,y) then ∃y∈H such that N⊨φ(x,y).
Proof.
Let q={qkN,qk−1N}. Since q∈H and
N=HullkN(ρkN∪{q}), 5
applies and yields the claim.
∎
We have H=HulliN(H)
for each i≤k+1. Therefore by induction, M is (k−1)-sound, π is a
near (k−1)-embedding, and so on. Combined with Claim
6, this also gives that if ρk−1M<ρ0M then
π(ρk−1M)=ρk−1N, and if ρk−1M=ρ0M then
ρk−1N=ρ0N. By this and Claim 7 it is easy
enough to see that: ρkM is the least ρ such that either
ρ=ρ0M or π(ρ)≥ρkN; and
[TABLE]
and π is
rΣk+1 elementary. To see that qkM=π−1(qkN), we
therefore just need that (π−1(qkN),qk−1M) is k-solid for M. For
this it suffices to know that M has the appropriate generalized solidity
witnesses; see [10]. But this follows from the fact that N has
generalized solidity witnesses for (qkN,qk−1N) in rg(π), which
follows from Claim 7. Also, the elementarity of π then
guarantees that 33(ii) holds for i=k.
Part 4 follows easily from part 3
(by part 3, the parameters provided by ukN
already get into the relevant hulls).
∎
Bibliography11
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] William J. Mitchell and John R. Steel. Fine structure and iteration trees , volume 3 of Lecture Notes in Logic . Springer-Verlag, Berlin, 1994.
2[2] E. Schimmerling. Combinatorial principles in the core model for one woodin cardinal. Annals of Pure and Applied Logic , 74, 1995.
3[3] E. Schimmerling and J. R. Steel. Fine structure for tame inner models. J. Symbolic Logic , 61(2):621–639, 1996.
4[4] Ralf Schindler. Core models in the presence of Woodin cardinals. J. Symbolic Logic , 71(4):1145–1154, 2006.
5[5] F. Schlutzenberg. Ordinal definability in L [ 𝔼 ] 𝐿 delimited-[] 𝔼 L[\mathbb{E}] . To appear.
6[6] F. Schlutzenberg. A premouse inheriting strong cardinals from V 𝑉 V . To appear. See ar Xiv:1506.04116.
7[7] F. Schlutzenberg. Measures in mice . Ph D thesis, 2007. Phd Thesis. See ar Xiv:1301.4702.
8[8] F. Schlutzenberg and N. Trang. The fine structure of operator mice. To appear. See ar Xiv:1604.00083.