Fine structure from normal iterability
Abstract
We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its projectum, is an iterate of its core. That is, let m be an integer and let M be an m-sound, (m,ω1+1)-iterable premouse. Then (i) M is (m+1)-solid and (m+1)-universal, (m+1) condensation holds for M, and if m≥ 1 then M is super-Dodd-sound, a slight strengthening of Dodd-soundness. And (ii) if there is x∈ M such that M is the rm+1-hull of parameters in m+1M\x\, then M is a normal iterate of its (m+1)-core C=Cm+1(M); in fact, there is an m-maximal iteration tree T on C, of finite length, such that M=MT∞, and iT0∞ is just the core embedding. Applying fact (ii), we prove that if M is a mouse and W⊂eq M is a ground of M via a strategically σ-closed forcing P∈ W, and if M|1M∈ W (that is, the initial segment of M of height 1M is in W), then the forcing is trivial; that is, M⊂eq W. And if there is a measurable cardinal, then there is a non-solid premouse. The results hold for premice with Mitchell-Steel indexing, allowing extenders of superstrong type to appear on the extender sequence.