This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

An Iteration Theorem for ω1\omega_{1}-preserving Forcings

Andreas Lietz111Institut für Mathematische Logik und Grundlagenforschung, Universität Münster, Einsteinstrasse 62, 48149 Münster, FRG.   222Current address: Institut für Diskrete Mathematik und Geometrie, TU Wien, Wiedner Hauptstrasse 8-10/104, 1040 Wien, AT
This paper is part of the authors PhD thesis.
Abstract

We prove an iteration theorem which guarantees for a wide class of nice iterations of ω1\omega_{1}-preserving forcings that ω1\omega_{1} is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a nice iteration of ω1\omega_{1}-preserving forcings which force SRP\mathrm{SRP} at successor steps and preserves old stationary sets does not collapse ω1\omega_{1}.

1 Introduction

The method of iterated forcing is a powerful yet flexible tool in establishing independence results. Say, the goal is to produce a forcing extension of the universe with a specific property. Frequently, it is the case that it is much easier to find a forcing \mathbb{P}, which solves this problem for “a single instance” or ”all instances in VV”, but may add new “unresolved instances” at the same time. One can then hope to iterate \mathbb{P} up to some closure point, usually a sufficiently large regular cardinal κ\kappa so that the whole iteration is κ\kappa-c.c., so that in end all instances have been dealt with and the full desired property holds. This can only work if the iteration in question preserves the progress of earlier stages up until the end. Theorems which guarantee such a preservation are often called iteration theorems. If the property in question is one about Hω2H_{\omega_{2}} then at the very least it is required that ω1\omega_{1} is preserved or maybe the somewhat stronger property that stationary sets are preserved. We give some examples.

1.1 Iterations of c.c.c. Forcings

The earliest iteration theorem is due to Solovay-Tennenbaum.

Theorem 1.1 (Solovay-Tennenbaum, [ST71]).

Suppose α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a finite support iteration of c.c.c. forcings. Then γ\mathbb{P}_{\gamma} is c.c.c..

A Suslin tree is a tree of height ω1\omega_{1} with no uncountable chains and antichains. Forcing with a Suslin tree TT (with the reverse order) is a c.c.c. forcing and in the forcing extension TT is no longer Suslin. Not being a Suslin tree is a Σ1(ω1)\Sigma_{1}(\omega_{1})-property and so is upwards absolute to forcing extensions preserving ω1\omega_{1}. As c.c.c. forcings preserve ω1\omega_{1}, iterating forcing with Suslin trees produces models in which there are no Suslin tree and hence in which Suslin’s hypothesis holds.

Theorem 1.2 (Solovay-Tennenbaum, [ST71]).

There is a c.c.c. forcing \mathbb{P} so that V``Suslin’s hypothesis"V^{\mathbb{P}}\models``\text{Suslin's hypothesis}".

1.2 Iterations of Proper Forcings

The class of forcings with the countable chain condition is rather small, so not suitable in all cases. Shelah discovered the beautiful notion of proper forcing which is large enough to include both c.c.c. and σ\sigma-closed forcing, but nonetheless all such forcings preserve ω1\omega_{1}.

Definition 1.3 (Shelah,[She98]).

A forcing \mathbb{P} is proper if for any large enough regular θ\theta and any countable XHθX\prec H_{\theta} with X\mathbb{P}\in X, whenever pXp\in\mathbb{P}\cap X then there is some qpq\leq p with

qXˇOrd=Xˇ[G˙]Ord.q\Vdash\check{X}\cap\mathrm{Ord}=\check{X}[\dot{G}]\cap\mathrm{Ord}.

Shelah proved a famous iteration theorem for proper forcings. Though, as finite support iterations of non-c.c.c. forcings usually collapse ω1\omega_{1}, the preferred support in this instance is countable support.

Theorem 1.4 (Shelah,[She98]).

Suppose α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a countable support iteration of proper forcings. Then γ\mathbb{P}_{\gamma} is proper.

An Aronszajn tree TT is a tree of height ω1\omega_{1} with all countable levels and no cofinal branch. For a tree TT of height ω1\omega_{1} and Aω1A\subseteq\omega_{1}, let TAT\upharpoonright A denote the tree with nodes of a level α\alpha of TT with αA\alpha\in A and the tree order inherited from TT. Two trees S,TS,T of height ω1\omega_{1} are club-isomorphic iff there is a club Cω1C\subseteq\omega_{1} so that SCTCS\upharpoonright C\cong T\upharpoonright C as partial orders. Given two Aronszajn trees S,TS,T, Abraham-Shelah discovered a proper forcing (T,S)\mathbb{P}(T,S) which forces SS and TT to be club-isomorphic. Note that the property “S,TS,T are club-isomorphic” is Σ1(S,T,ω1)\Sigma_{1}(S,T,\omega_{1}) and thus upwards-absolute to any ω1\omega_{1}-preserving forcing extension.

Theorem 1.5 (Abraham-Shelah, [AS85]).

There is a proper forcing \mathbb{P} so that

V``Any two Aronszajn trees S,T are club-isomorphic".V^{\mathbb{P}}\models``\text{Any two Aronszajn trees }S,T\text{ are club-isomorphic}".

We remark that Suslin’s hypothesis is an immediate consequence of “any two Aronszajn trees are club-isomorphic”. There provably is an Aronszajn tree which is special, i.e. the union of countably many antichains. Such a tree cannot be club-isomorphic to a Suslin tree.

1.3 Iterations of Semiproper Forcings

Later, Shelah proved another iteration theorem for the even larger class of semiproper forcings.

Definition 1.6 (Shelah, [She98]).

A forcing \mathbb{P} is semiproper if for any large enough regular θ\theta and any countable XHθX\prec H_{\theta} with X\mathbb{P}\in X, whenever pXp\in\mathbb{P}\cap X then there is some qpq\leq p with

qXˇω1=Xˇ[G˙]ω1.q\Vdash\check{X}\cap\omega_{1}=\check{X}[\dot{G}]\cap\omega_{1}.

From now on, we will denote XYXω1=Yω1X\subseteq Y\wedge X\cap\omega_{1}=Y\cap\omega_{1} by XYX\sqsubseteq Y. So for example above we have qXˇXˇ[G˙]q\Vdash\check{X}\sqsubseteq\check{X}[\dot{G}].

Theorem 1.7 (Shelah).

Suppose α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a RCS\mathrm{RCS}-iteration of semiproper forcings. Then γ\mathbb{P}_{\gamma} is semiproper.

Once again, the notion of support had to be changed. In the argument of Theorem 1.7 it is crucial that if α<γ\alpha<\gamma and GαG_{\alpha} is α\mathbb{P}_{\alpha}-generic over VV, then the tail iteration α,ξ,˙βξγ,β<γ\langle\mathbb{P}_{\alpha,\xi},\dot{\mathbb{Q}}_{\beta}\mid\xi\leq\gamma,\beta<\gamma\rangle is still a RCS\mathrm{RCS}-iteration. This can fail for countable support iterations as, unlike proper forcings, semiproper forcings can turn regular cardinals into cardinals of countable cofinality. In fact, Theorem 1.7 fails if RCS\mathrm{RCS}-support is replaced with countable support.

Suppose \mathcal{I} is an ideal on ω1\omega_{1}. An \mathcal{I}-antichain is a set 𝒜𝒫(ω1)\mathcal{A}\subseteq\mathcal{P}(\omega_{1})-\mathcal{I} so that STS\cap T\in\mathcal{I} for any ST𝒜S\neq T\in\mathcal{A}. The ideal \mathcal{I} is saturated if for all \mathcal{I}-antichains 𝒜\mathcal{A} we have |𝒜|ω1|\mathcal{A}|{\leq}\omega_{1}.

Theorem 1.8 (Shelah, see [Sch11] for a proof).

Assume there is a Woodin cardinal. Then there is a semiproper forcing \mathbb{P} so that

V``NSω1 is saturated".V^{\mathbb{P}}\models``\mathrm{NS}_{\omega_{1}}\text{ is saturated}".

If 𝒜\mathcal{A} is a maximal NSω1\mathrm{NS}_{\omega_{1}}-antichain then the sealing forcing 𝒮𝒜\mathcal{S}_{\mathcal{A}} is a natural stationary-set-preserving forcing which turns 𝒜\mathcal{A} into a maximal NSω1\mathrm{NS}_{\omega_{1}}-antichain of size ω1{\leq}\omega_{1} and the statement “𝒜\mathcal{A} is a maximal antichain of size ω1{\leq}\omega_{1}” turns out to be Σ1(𝒜,ω1)\Sigma_{1}(\mathcal{A},\omega_{1}). Now, an instance of the sealing forcing is not semiproper in general, but Shelah shows that when iterating up to a Woodin cardinal and using a sealing forcing only when it is semiproper, it can be arranged that often enough sealing forcings are semiproper that in the end, NSω1\mathrm{NS}_{\omega_{1}} is saturated.

1.4 Iterations of Stationary-Set-Preserving Forcing

So what are the limits of iteration theorems? We have

c.c.cpropersemiproperstationary set preserving.\text{c.c.c}\Rightarrow\text{proper}\Rightarrow\text{semiproper}\Rightarrow\text{stationary set preserving}.

and none of the implications can be reversed. However, while there are always non-c.c.c. proper forcings and non-proper semiproper forcings, consistently the class of semiproper forcings can agree with the class of stationary set preserving forcing, so these two notions are quite close. Nonetheless, there is no analogue of Theorem 1.7 for stationary set preserving forcings. Consistently, a counterexample can be given along the lines of the discussion of Theorem 1.8. In the argument, the Woodin cardinal is used solely to verify that instances of sealing forcing are semiproper often enough, an inaccessible cardinal would suffice otherwise. But a Woodin cardinal is indeed required for the conclusion.

Theorem 1.9 (Steel, Jensen-Steel [JS13]).

Suppose that there is a normal saturated ideal on ω1\omega_{1}. Then there is an inner model with a Woodin cardinal.

So suppose we work in an model without an inner model with a Woodin cardinal, say V=LV=L, and there is an inaccessible cardinal. One could then try to iterate instances of the Sealing forcing along a suitable bookkeeping up to κ\kappa. In light of Theorem 1.9, this cannot result in a forcing extension in which NSω1\mathrm{NS}_{\omega_{1}} is saturated. It follows that the iteration collapses ω1\omega_{1} at some point, yet instances of the sealing forcing are always stationary set preserving.

A much more serious example is due to Shelah.

Theorem 1.10 (Shelah [She98]).

There is a full support iteration

n,˙mnω,m<ω\coloneqq\langle\mathbb{P}_{n},\dot{\mathbb{Q}}_{m}\mid n\leq\omega,m<\omega\rangle

of stationary set preserving forcings so that ω\mathbb{P}_{\omega} collapses ω1\omega_{1}.

In fact, in the above example it does not matter at all which kind of limit is taken, though we want to mention that countable support, RCS\mathrm{RCS} and full support iterations agree on length ω\omega iterations. The first forcing in Shelah’s example is semiproper, but all subsequent forcings are not semiproper in the relevant extension. Semiproper forcing is the correct regularity property for stationary set preserving forcings in terms of iterations in the sense that

  1. 1.

    all semiproper forcings are stationary set preserving,

  2. 2.

    consistently, all stationary set preserving forcings are semiproper and

  3. 3.

    semiproper forcings can be iterated.

We will define the class of respectful forcing which, in a slightly weaker sense, is a regularity property corresponding to the wider class of ω1\omega_{1}-preserving forcings.

1.5 Iterations of ω1\omega_{1}-Preserving Forcings

When iterating ω1\omega_{1}-preserving forcing which kill stationary sets there is another threat to preserving ω1\omega_{1} in the limit as illustrated in the following folklore example: For Sω1S\subseteq\omega_{1} stationary, the club shooting forcing CS(S)\mathrm{CS}(S) is the canonical forcing that shoots a club trough SS. Conditions are closed countable sets cSc\subseteq S ordered by dCS(S)cd\leq_{\mathrm{CS}(S)}c iff d(max(c)+1)=cd\cap(\max(c)+1)=c. If GG is generic for CS(S)\mathrm{CS}(S) then G\bigcup G is a club contained in SS, so ω1S\omega_{1}-S is nonstationary in V[G]V[G], but ω1\omega_{1} is not collapsed, that is ω1V[G]=ω1V\omega_{1}^{V[G]}=\omega_{1}^{V}. Now suppose Snn<ω\langle S_{n}\mid n<\omega\rangle be a partition of ω1\omega_{1} into stationary sets. Let \mathbb{P} be a length ω\omega iteration of the forcings CS(ω1Sn)\mathrm{CS}(\omega_{1}-S_{n}) (it does not matter which limit we take at ω\omega). Then \mathbb{P} must collapse ω1\omega_{1} as in VV^{\mathbb{P}}, ω1V=n<ωSn\omega_{1}^{V}=\bigcup_{n<\omega}S_{n} is a countable union of nonstationary sets and hence must be nonstationary itself. Clearly, this is only possible if ω1V<ω1V\omega_{1}^{V}<\omega_{1}^{V^{\mathbb{P}}}.

The issue here does not stem from a lack of regularity of the forcings we used. In fact, for a stationary set Sω1S\subseteq\omega_{1}, the club shooting CS(S)\mathrm{CS}(S) is SS-proper. The problem is much more that at each step of the iteration, we come back to VV to kill an “old” stationary set. If we avoid the two presented issues of

  1. 1.

    using too many forcings lacking regularity properties and

  2. 2.

    killing old stationary sets

then we can prove an iteration theorem for ω1\omega_{1}-preserving forcings. Without defining respectful forcings, a special case of our main result can be stated as follows.

Theorem 1.11.

Suppose α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a nice iteration of ω1\omega_{1}-preserving forcings so that

  1. (i)(i)

    if α+2<γ\alpha+2<\gamma then α+2``Strong Reflection Principle"\Vdash_{\mathbb{P}_{\alpha+2}}``\text{Strong Reflection Principle}" and

  2. (ii)(ii)

    if α<γ\alpha<\gamma then ˙α\dot{\mathbb{Q}}_{\alpha} is forced to preserve old stationary sets, i.e.

    β<αα+1NSω1V[G˙β]=NSω1V[G˙α]V[G˙β].\forall\beta<\alpha\ \Vdash_{\mathbb{P}_{\alpha+1}}\mathrm{NS}_{\omega_{1}}\cap V[\dot{G}_{\beta}]=\mathrm{NS}_{\omega_{1}}^{V[\dot{G}_{\alpha}]}\cap V[\dot{G}_{\beta}].

Then γ\mathbb{P}_{\gamma} preserves ω1\omega_{1}. Moreover, we have for all α+1γ\alpha+1\leq\gamma

βαγNSω1V[G˙β]=NSω1V[G˙β+1]V[G˙β].\forall\beta\leq\alpha\ \Vdash_{\mathbb{P}_{\gamma}}\mathrm{NS}_{\omega_{1}}\cap V[\dot{G}_{\beta}]=\mathrm{NS}_{\omega_{1}}^{V[\dot{G}_{\beta+1}]}\cap V[\dot{G}_{\beta}].

In fact we will prove something more general which allows, e.g. the preservation of a Suslin tree on the side.

Here, the Strong Reflection Principle is the reflection principle isolated by Todorčević.

Definition 1.12 (Todorčević, [Tod87]).
  1. (i)(i)

    For θ\theta an uncountable cardinal and 𝒮[Hθ]ω\mathcal{S}\subseteq[H_{\theta}]^{\omega} we define

    𝒮={X[Hθ]ωY[Hθ]ω(XYYS)}.\mathcal{S}^{\perp}=\{X\in[H_{\theta}]^{\omega}\mid\forall Y\in[H_{\theta}]^{\omega}(X\sqsubseteq Y\rightarrow Y\notin S)\}.
  2. (ii)(ii)

    The Strong Reflection Principle (SRP\mathrm{SRP}) holds if: Whenever θω2\theta\geq\omega_{2} is regular, aHθa\in H_{\theta} and S[Hθ]ωS\subseteq[H_{\theta}]^{\omega} then 𝒮𝒮\mathcal{S}\cup\mathcal{S}^{\perp} contains a continuous increasing ω1\omega_{1}-chain of countable elementary substructures of HθH_{\theta} containing aa, i.e. there is Xαα<ω1\langle X_{\alpha}\mid\alpha<\omega_{1}\rangle so that for all α<ω1\alpha<\omega_{1}

    1. (X.i)(\vec{X}.i)

      XαHθX_{\alpha}\prec H_{\theta} is countable,

    2. (X.ii)(\vec{X}.ii)

      Xα𝒮𝒮X_{\alpha}\in\mathcal{S}\cup\mathcal{S}^{\perp},

    3. (X.iii)(\vec{X}.iii)

      aX0a\in X_{0},

    4. (X.iv)(\vec{X}.iv)

      XαXα+1X_{\alpha}\in X_{\alpha+1} and

    5. (X.v)(\vec{X}.v)

      if αLim\alpha\in\mathrm{Lim} then Xα=β<αXβX_{\alpha}=\bigcup_{\beta<\alpha}X_{\beta}.

We note that SRP\mathrm{SRP} can always be forced assuming large cardinals.

Theorem 1.13 (Shelah).

Suppose there is a supercompact cardinal. Then there is a semiproper forcing \mathbb{P} so that VSRPV^{\mathbb{P}}\models\mathrm{SRP}.

As a consequence of this, assuming large cardinals, Theorem 1.11 can be understood as a strategic iteration theorem. Consider the following two player game IGγ\mathrm{IG}_{\gamma} of length γ\gamma.

Player II ˙0\dot{\mathbb{Q}}_{0} ˙2\dot{\mathbb{Q}}_{2} ˙ω\dot{\mathbb{Q}}_{\omega}
Player IIII ˙1\dot{\mathbb{Q}}_{1} ˙3\dot{\mathbb{Q}}_{3} ˙ω+1\dot{\mathbb{Q}}_{\omega+1}

Player II plays at all even stages, including limit steps. Player II and IIII cooperate in this way to produce an RCS\mathrm{RCS}-iteration α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle of forcings which do not kill old stationary sets. Player IIII wins iff γ\mathbb{P}_{\gamma} preserves ω1\omega_{1}.

Corollary 1.14.

Suppose there is a proper class of supercompact cardinals. Then for any γ\gamma, Player IIII has a winning strategy for the game IGγ\mathrm{IG}_{\gamma}.

Acknowledgements

The author thanks his PhD advisor Ralf Schindler for many fruitful discussions as well as his guidance and support during the completion of this project.
Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2044 390685587, Mathematics Münster: Dynamics - Geometry - Structure.

2 Notation

First, we fix some notation. We will extensively deal with countable elementary substructures XHθX\prec H_{\theta} for large regular θ\theta. We will make frequent use of the following notation:

Definition 2.1.

Suppose XX is any extensional set.

  1. (i)(i)

    MXM_{X} denotes the transitive isomorph of XX.

  2. (ii)(ii)

    πX:MXX\pi_{X}\colon M_{X}\rightarrow X denotes the inverse collapse.

  3. (iii)(iii)

    δXω1X\delta^{X}\coloneqq\omega_{1}\cap X.

In almost all cases, we will apply this definition to a countable elementary substructure XHθX\prec H_{\theta} for some uncountable cardinal θ\theta. In some cases, the XX we care about lives in a generic extension of VV, even though it is a substructure of HθVH_{\theta}^{V}. In that case, δX\delta^{X} will always mean Xω1VX\cap\omega_{1}^{V}.

We will also sometimes make use of the following convention in order to “unclutter” arguments.

Convention 2.2.

If XHθX\prec H_{\theta} is an elementary substructure and some object aa has been defined before and aXa\in X then we denote πX1(a)\pi_{X}^{-1}(a) by a¯\bar{a}.

We will make use of this notation only if it is unambiguous.

Definition 2.3.

If X,YX,Y are sets then XYX\sqsubseteq Y holds just in case

  1. (i)(i)

    XYX\subseteq Y and

  2. (ii)(ii)

    δX=δY\delta^{X}=\delta^{Y}.

We use the following notions of clubs and stationarity on [Hθ]ω[H_{\theta}]^{\omega}:

Definition 2.4.

Suppose AA is an uncountable set.

  1. (i)(i)

    [A]ω[A]^{\omega} is the set of countable subsets of AA.

  2. (ii)(ii)

    𝒞[A]ω\mathcal{C}\subseteq[A]^{\omega} is a club in [A]ω[A]^{\omega} if

    1. a)a)

      for any X[A]ωX\in[A]^{\omega} there is a Y𝒞Y\in\mathcal{C} with XYX\subseteq Y and

    2. b)b)

      if Ynn<ω\langle Y_{n}\mid n<\omega\rangle is a \subseteq-increasing sequence of sets in 𝒞\mathcal{C} then n<ωYn𝒞\bigcup_{n<\omega}Y_{n}\in\mathcal{C}.

  3. (iii)(iii)

    𝒮[A]ω\mathcal{S}\subseteq[A]^{\omega} is stationary in [A]ω[A]^{\omega} if 𝒮𝒞\mathcal{S}\cap\mathcal{C}\neq\emptyset for any club 𝒞\mathcal{C} in [A]ω[A]^{\omega}.

Next, we explain our notation for forcing iterations.

Definition 2.5.

Suppose =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is an iteration and βγ\beta\leq\gamma. We consider elements of \mathbb{P} as functions of domain (or length) γ\gamma.

  1. (i)(i)

    If pβp\in\mathbb{P}_{\beta} then lh(p)=β\mathrm{lh}(p)=\beta.

  2. (ii)(ii)

    If GG is \mathbb{P}-generic then GβG_{\beta} denotes the restriction of GG to β\mathbb{P}_{\beta}, i.e.

    Gβ={pβpG}.G_{\beta}=\{p\upharpoonright\beta\mid p\in G\}.

    Moreover, G˙β\dot{G}_{\beta} is the canonical \mathbb{P}-name for GβG_{\beta}.

  3. (iii)(iii)

    If GβG_{\beta} is β\mathbb{P}_{\beta}-generic then β,γ\mathbb{P}_{\beta,\gamma} denotes (by slight abuse of notation) the remainder of the iteration, that is

    β,γ={pγpβGβ}.\mathbb{P}_{\beta,\gamma}=\{p\in\mathbb{P}_{\gamma}\mid p\upharpoonright\beta\in G_{\beta}\}.

    ˙β,γ\dot{\mathbb{P}}_{\beta,\gamma} denotes a name for β,γ\mathbb{P}_{\beta,\gamma} in VV.

  4. (iv)(iv)

    If GG is \mathbb{P}-generic and α<β\alpha<\beta then Gα,βG_{\alpha,\beta} denotes the projection of GG onto α,β\mathbb{P}_{\alpha,\beta}.

There will be a number of instances were we need a structure to satsify a sufficiently large fragment of ZFC\mathrm{ZFC}. For completeness, we make this precise.

Definition 2.6.

Sufficiently much of ZFC\mathrm{ZFC} is the fragment ZFC+``ω1 exists"\mathrm{ZFC}^{-}+``\omega_{1}\text{ exists}". Here, ZFC\mathrm{ZFC}^{-} is ZFC\mathrm{ZFC} without the powerset axiom and with the collection scheme instead of the replacement scheme.

3 (𝔹)\diamondsuit(\mathbb{B}) and +(𝔹)\diamondsuit^{+}(\mathbb{B})

We will introduce the combinatorial principle which will parameterize the main iteration theorem. These are generalizations of the principles (ω1<ω)\diamondsuit(\omega_{1}^{{<}\omega}) and +(ω1<ω)\diamondsuit^{+}(\omega_{1}^{{<}\omega}) isolated by Woodin [Woo10] in his study of max\mathbb{Q}_{\mathrm{max}} [Woo10, Section 6.2]. Most results in this Section are essentially due to Woodin and proven in [Woo10, Section 6.2].

Definition 3.1.

Suppose 𝔹ω1\mathbb{B}\subseteq\omega_{1} is a forcing.

  1. (i)(i)

    We say that ff guesses 𝔹\mathbb{B}-filters if ff is a function

    f:ω1Hω1f\colon\omega_{1}\rightarrow H_{\omega_{1}}

    and for all α<ω1\alpha<\omega_{1}, f(α)f(\alpha) is a 𝔹α\mathbb{B}\cap\alpha-filter333We consider the empty set to be a filter..

  2. (ii)(ii)

    Suppose θω2\theta\geq\omega_{2} is regular and XHθX\prec H_{\theta} is an elementary substructure. We say XX is f-slimf\text{{-slim}}444We use the adjective “slim” for the following reason: An f-slimf\text{-slim} XHθX\prec H_{\theta} cannot be too fat compared to its height below ω1\omega_{1}, i.e. δX\delta^{X}. If XYHθX\sqsubseteq Y\prec H_{\theta} and YY is f-slimf\text{-slim} then XX is f-slimf\text{-slim} as well, but the converse can fail. if

    1. (X.i)(X.i)

      XX is countable,

    2. (X.ii)(X.ii)

      f,𝔹Xf,\mathbb{B}\in X and

    3. (X.iii)(X.iii)

      f(δX)f(\delta^{X}) is 𝔹δX\mathbb{B}\cap\delta^{X}-generic over MXM_{X}.

Definition 3.2.

Let 𝔹ω1\mathbb{B}\subseteq\omega_{1} be a forcing. (𝔹)\diamondsuit(\mathbb{B}) states that there is a function ff so that

  1. (i)(i)

    ff guesses 𝔹\mathbb{B}-filters and

  2. (ii)(ii)

    for any b𝔹b\in\mathbb{B} and regular θω2\theta\geq\omega_{2}

    {XHθX is f-slim\displaystyle\{X\prec H_{\theta}\mid X\text{ is }f\text{-slim}\wedge bf(δX)}\displaystyle b\in f(\delta^{X})\}

    is stationary in [Hθ]ω[H_{\theta}]^{\omega}.

+(𝔹)\diamondsuit^{+}(\mathbb{B}) is the strengthening of (𝔹)\diamondsuit(\mathbb{B}) where (ii)(ii) is replaced by:

  1. (ii)+(ii)^{+}

    For any regular θω2\theta\geq\omega_{2}

    {XHθX is f-slim}\{X\prec H_{\theta}\mid X\text{ is }f\text{-slim}\}

    contains a club of [Hθ]ω[H_{\theta}]^{\omega}. Moreover, for any b𝔹b\in\mathbb{B}

    {α<ω1bf(α)}\{\alpha<\omega_{1}\mid b\in f(\alpha)\}

    is stationary.

We say that ff witnesses (𝔹)\diamondsuit(\mathbb{B}), +(𝔹)\diamondsuit^{+}(\mathbb{B}) respectively.

Remark 3.3.

Observe that if ff witnesses (𝔹)\diamondsuit(\mathbb{B}) and 𝔹\mathbb{B} is separative then 𝔹\mathbb{B} can be “read off” from ff: We have 𝔹=α<ω1f(α)\mathbb{B}=\bigcup_{\alpha<\omega_{1}}f(\alpha) and for b,c𝔹b,c\in\mathbb{B}, b𝔹cb\leq_{\mathbb{B}}c iff whenever bf(α)b\in f(\alpha) then cf(α)c\in f(\alpha) as well. Thus, it is usually not necessary to mention 𝔹\mathbb{B}.

We introduce some convenient shorthand notation.

Definition 3.4.

If 𝔹ω1\mathbb{B}\subseteq\omega_{1} is a forcing, ff guesses 𝔹\mathbb{B}-filters and b𝔹b\in\mathbb{B} then

Sbf{α<ω1bf(α)}.S^{f}_{b}\coloneqq\{\alpha<\omega_{1}\mid b\in f(\alpha)\}.

If ff is clear from context we will sometimes omit the superscript ff.

Note that if ff witnesses (𝔹)\diamondsuit(\mathbb{B}), then SbfS^{f}_{b} is stationary for all b𝔹b\in\mathbb{B}. This is made explicit for +(𝔹)\diamondsuit^{+}(\mathbb{B}). This is exactly the technical strengthening over Woodin’s definition of (ω1<ω),+(ω1<ω)\diamondsuit(\omega_{1}^{{<}\omega}),\diamondsuit^{+}(\omega_{1}^{{<}\omega}). Lemma 3.11 shows that this strengthening is natural. Moreover, this implies

(𝔹)(𝔹)()\diamondsuit(\mathbb{B}\oplus\mathbb{C})\Rightarrow\diamondsuit(\mathbb{B})\wedge\diamondsuit(\mathbb{C})

whenever 𝔹,ω1\mathbb{B},\mathbb{C}\subseteq\omega_{1} are forcings and 𝔹\mathbb{B}\oplus\mathbb{C} is the disjoint union of 𝔹\mathbb{B} and \mathbb{C} coded into a subset of ω1\omega_{1}. This becomes relevant in Subsection LABEL:splitwitnessessubsection. Nonetheless, the basic theory of these principles is not changed by a lot.

Definition 3.5.

If ff witnesses (𝔹)\diamondsuit(\mathbb{B}) and \mathbb{P} is a forcing, we say that \mathbb{P} preserves ff if whenever GG is \mathbb{P}-generic then ff witnesses (𝔹)\diamondsuit(\mathbb{B}) in V[G]V[G].

We remark that if ff witnesses +(𝔹)\diamondsuit^{+}(\mathbb{B}) then “\mathbb{P} preserves ff” still only means that ff witnesses (𝔹)\diamondsuit(\mathbb{B}) in VV^{\mathbb{P}}.

Next, we define a variant of stationary sets related to a witness of (𝔹)\diamondsuit(\mathbb{B}). Suppose θω2\theta\geq\omega_{2} is regular. Then Sω1S\subseteq\omega_{1} is stationary iff for any club 𝒞[Hθ]ω\mathcal{C}\subseteq[H_{\theta}]^{\omega}, there is some X𝒞X\in\mathcal{C} with δXS\delta^{X}\in S. ff-stationarity results from restricting to ff-slim XHθX\prec H_{\theta} only.

Definition 3.6.

Suppose ff guesses 𝔹\mathbb{B}-filters.

  1. (i)(i)

    A subset Sω1S\subseteq\omega_{1} is ff-stationary iff whenever θω2\theta\geq\omega_{2} is regular and 𝒞[Hθ]ω\mathcal{C}\subseteq[H_{\theta}]^{\omega} is club then there is some f-slimf\text{-slim} X𝒞X\in\mathcal{C} with δXS\delta^{X}\in S.

  2. (ii)(ii)

    A forcing \mathbb{P} preserves ff-stationary sets iff any ff-stationary set is still ff-stationary in VV^{\mathbb{P}}.

We make use of ff-stationarity only when ff witnesses (𝔹)\diamondsuit(\mathbb{B}). However, with the above definition it makes sense to talk about ff-stationarity in a forcing extension before we know that ff has been preserved. Note that all ff-stationary sets are stationary, but the converse might fail, see Proposition LABEL:noplusprop. We will later see that ff-stationary sets are the correct replacement of stationary set in our context. Most prominently this notion will be used in the definition of the MM++\mathrm{MM}^{++}-variant MM++(f)\mathrm{MM}^{++}(f) we introduce in Subsection LABEL:fmppandrelatedforcingaxiomssection. It will be useful to have an equivalent formulation of ff-stationarity at hand.

Proposition 3.7.

Suppose ff guesses 𝔹\mathbb{B}-filters. The following are equivalent for any set Sω1S\subseteq\omega_{1}:

  1. (i)(i)

    SS is ff-stationary.

  2. (ii)(ii)

    Whenever Dαα<ω1\langle D_{\alpha}\mid\alpha<\omega_{1}\rangle is a sequence of dense subsets of 𝔹\mathbb{B}, the set

    {αSβ<αf(α)Dβ}\{\alpha\in S\mid\forall\beta<\alpha\ f(\alpha)\cap D_{\beta}\neq\emptyset\}

    is stationary.

Proposition 3.8.

Suppose ff guesses 𝔹\mathbb{B}-filters. The following are equivalent:

  1. (i)(i)

    ff witnesses (𝔹)\diamondsuit(\mathbb{B}).

  2. (ii)(ii)

    SbfS^{f}_{b} is ff-stationary for all b𝔹b\in\mathbb{B}.

  3. (iii)(iii)

    For any b𝔹b\in\mathbb{B} and sequence Dαα<ω1\langle D_{\alpha}\mid\alpha<\omega_{1}\rangle of dense subsets of 𝔹\mathbb{B},

    {αSbfβ<αf(α)Dβ}\{\alpha\in S^{f}_{b}\mid\forall\beta<\alpha\ f(\alpha)\cap D_{\beta}\neq\emptyset\}

    is stationary.

We mention a handy corollary.

Corollary 3.9.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). Any forcing preserving ff-stationary sets preserves ff.

Proposition 3.10.

Suppose ff guesses 𝔹\mathbb{B}-filters. The following are equivalent:

  1. (i)(i)

    ff witnesses +(𝔹)\diamondsuit^{+}(\mathbb{B}).

  2. (ii)(ii)

    For any b𝔹b\in\mathbb{B}, SbfS^{f}_{b} is stationary and all stationary sets are ff-stationary.

  3. (iii)(iii)

    If DD is dense in 𝔹\mathbb{B} then

    {α<ω1f(α)D}\{\alpha<\omega_{1}\mid\ f(\alpha)\cap D\neq\emptyset\}

    contains a club and for all b𝔹b\in\mathbb{B}, SbfS^{f}_{b} is stationary.

  4. (iv)(iv)

    All countable XHθX\prec H_{\theta} with fXf\in X and θω2\theta\geq\omega_{2} regular are f-slimf\text{-slim} and moreover for all b𝔹b\in\mathbb{B}, SbfS^{f}_{b} is stationary.

We will now give a natural equivalent formulation of +(𝔹)\diamondsuit^{+}(\mathbb{B}).

Witnesses of +(𝔹)\diamondsuit^{+}(\mathbb{B}) are simply codes for regular embeddings555Regular embeddings, also known as complete embeddings, are embeddings between partial orders which preserve maximal antichains. of 𝔹\mathbb{B} into NSω1+\mathrm{NS}_{\omega_{1}}^{+}.

Lemma 3.11.

The following are equivalent:

  1. (i)(i)

    +(𝔹)\diamondsuit^{+}(\mathbb{B}).

  2. (ii)(ii)

    There is a regular embedding η:𝔹(𝒫(ω1)/NSω1)+\eta\colon\mathbb{B}\rightarrow(\mathcal{P}(\omega_{1})/\mathrm{NS}_{\omega_{1}})^{+}.

The argument above suggests the following definition.

Definition 3.12.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). We define

ηf:𝔹(𝒫(ω1)/NSω1)+\eta_{f}\colon\mathbb{B}\rightarrow(\mathcal{P}(\omega_{1})/\mathrm{NS}_{\omega_{1}})^{+}

by b[Sbf]NSω1b\mapsto[S^{f}_{b}]_{\mathrm{NS}_{\omega_{1}}} and call ηf\eta_{f} the embedding associated to ff.

We will now show that (𝔹)\diamondsuit(\mathbb{B}) is consistent for any forcing 𝔹ω1\mathbb{B}\subseteq\omega_{1}, even simultaneously so for all such 𝔹\mathbb{B}. We will deal with the consistency of +(𝔹)\diamondsuit^{+}(\mathbb{B}) in the next section.

Proposition 3.13.

Assume \diamondsuit. Then (𝔹)\diamondsuit(\mathbb{B}) holds for any poset 𝔹ω1\mathbb{B}\subseteq\omega_{1}.

Corollary 3.14.

Suppose 𝔹ω1\mathbb{B}\subseteq\omega_{1} is a forcing. Then (𝔹)\diamondsuit(\mathbb{B}) holds in VAdd(ω1,1)V^{\mathrm{Add}(\omega_{1},1)}.

In a number of arguments, we will deal with f-slimf\text{-slim} XHθX\prec H_{\theta} that become thicker over time, i.e. at a later stage there will be some f-slimf\text{-slim} XYHθX\sqsubseteq Y\prec H_{\theta}.

Definition 3.15.

In the above case of XYX\sqsubseteq Y, we denote the canonical elementary embedding from MXM_{X} to MYM_{Y} by

μX,Y:MXMY.\mu_{X,Y}\colon M_{X}\rightarrow M_{Y}.

μX,Y\mu_{X,Y} is given by πY1πX\pi_{Y}^{-1}\circ\pi_{X}.

Usually, both XX and YY will be f-slimf\text{-slim}. It is then possible to lift μX,Y\mu_{X,Y}.

Proposition 3.16.

Suppose ff guesses 𝔹\mathbb{B}-filters and X,YHθX,Y\prec H_{\theta} are both f-slimf\text{-slim} with XYX\sqsubseteq Y. Then the lift of μX,Y\mu_{X,Y} to

μX,Y+:MX[f(δX)]MY[f(δX)]\mu_{X,Y}^{+}\colon M_{X}[f(\delta^{X})]\rightarrow M_{Y}[f(\delta^{X})]

exists.

Proof.

As δX=δY\delta^{X}=\delta^{Y}, the critical point of μX,Y\mu_{X,Y} is >δX{>}\delta^{X} (if it exists). As πX1(𝔹)\pi_{X}^{-1}(\mathbb{B}) is a forcing of size ω1MX=δX{\leq}\omega_{1}^{M_{X}}=\delta^{X} and f(δX)f(\delta^{X}) is generic over both MXM_{X} and MYM_{Y}, the lift exists. ∎

We consider the above proposition simultaneously as a definition: From now on μX,Y+\mu_{X,Y}^{+} will refer to this lift if it exists.

Definition 3.17.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). NSf\mathrm{NS}_{f} is the ideal of ff-nonstationary sets, that is

NSf={Nω1N is not f-stationary}.\mathrm{NS}_{f}=\{N\subseteq\omega_{1}\mid N\text{ is not }f\text{-stationary}\}.
Lemma 3.18.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). NSf\mathrm{NS}_{f} is a normal uniform ideal.

3.1 Miyamoto’s theory of nice iterations

For all our intents and purposes, it does not matter in applications how the limit our iterations look like as long as we can prove a preservation theorem about it.

We give a brief introduction to Miyamoto’s theory of nice iterations. These iterations are an alternative to RCS\mathrm{RCS}-itertaions when dealing with the problem described above. In the proof of the iteration theorem for (ff-)proper forcings, one constructs a generic condition qq by induction as the limit of a sequence qnn<ω\langle q_{n}\mid n<\omega\rangle. In case of (ff-)semiproper forcings, the length of the iteration may have uncountable cofinality in VV but become ω\omega-cofinal along the way. In this case, a sequence qnn<ω\langle q_{n}\mid n<\omega\rangle with the desired properties cannot be in VV. The key insight to avoid this issue is that one should give up linearity of this sequence and instead build a tree of conditions in the argument. Nice supports follow the philosophy of form follows function, i.e. its definitions takes the shape of the kind of arguments it is intended to be involved in. The conditions allowed in a nice limit are represented by essentially the kind of trees that this inductive nonlinear constructions we hinted at above produces.

Miyamoto works with a general notion of iteration. For our purposes, we will simply define nice iterations by induction on the length. Successor steps are defined as usual, that is if γ=α,˙βαγ,β<γ\mathbb{P}_{\gamma}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a nice iteration of length γ\gamma and ˙γ\dot{\mathbb{Q}}_{\gamma} is a γ\mathbb{P}_{\gamma}-name for a forcing then α,˙βαγ+1,βγ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma+1,\beta\leq\gamma\rangle is a nice iteration of length γ+1\gamma+1 where γ+1γ˙γ\mathbb{P}_{\gamma+1}\cong\mathbb{P}_{\gamma}\ast\dot{\mathbb{Q}}_{\gamma}.

Definition 3.19 (Miyamoto, [Miy02]).

Let =α,˙αα<γ\vec{\mathbb{P}}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\alpha}\mid\alpha<\gamma\rangle be a potential nice iteration, that is

  1. (.i)(\vec{\mathbb{P}}.i)

    α\mathbb{P}_{\alpha} is a nice iteration of length α\alpha for all α<γ\alpha<\gamma,

  2. (.ii)(\vec{\mathbb{P}}.ii)

    α+1α˙α\mathbb{P}_{\alpha+1}\cong\mathbb{P}_{\alpha}\ast\dot{\mathbb{Q}}_{\alpha} for all α+1<γ\alpha+1<\gamma and

  3. (.iii)(\vec{\mathbb{P}}.iii)

    βα=α\mathbb{P}_{\beta}\upharpoonright\alpha=\mathbb{P}_{\alpha} for all αβ<γ\alpha\leq\beta<\gamma.

A nested antichain in \vec{\mathbb{P}} is of the form

(T,Tnn<ω,sucTnn<ω)(T,\langle T_{n}\mid n<\omega\rangle,\langle\mathrm{suc}^{n}_{T}\mid n<\omega\rangle)

so that for all n<ωn<\omega the following hold666Usually, we identify the nested antichain with TT, its first component and write suc(a)\mathrm{suc}(a) instead of sucTn(a)\mathrm{suc}^{n}_{T}(a) if n,Tn,T are clear from context.:

  1. (i)(i)

    T=n<ωTnT=\bigcup_{n<\omega}T_{n}.

  2. (ii)(ii)

    T0={a0}T_{0}=\{a_{0}\} for some a0α<γαa_{0}\in\bigcup_{\alpha<\gamma}\mathbb{P}_{\alpha}.

  3. (iii)(iii)

    Tnα<γαT_{n}\subseteq\bigcup_{\alpha<\gamma}\mathbb{P}_{\alpha} and sucTn:Tn𝒫(Tn+1)\mathrm{suc}^{n}_{T}\colon T_{n}\rightarrow\mathcal{P}(T_{n+1}).

  4. (iv)(iv)

    For aTna\in T_{n} and bsucTn(a)b\in\mathrm{suc}^{n}_{T}(a), lh(a)lh(b)\mathrm{lh}(a)\leq\mathrm{lh}(b) and blh(a)ab\upharpoonright\mathrm{lh}(a)\leq a.

  5. (v)(v)

    For aTna\in T_{n} and distinct b,bsucTn(a)b,b^{\prime}\in\mathrm{suc}^{n}_{T}(a), blh(a)blh(a)b\upharpoonright\mathrm{lh}(a)\perp b^{\prime}\upharpoonright\mathrm{lh}(a).

  6. (vi)(vi)

    For aTna\in T_{n}, {blh(a)bsucTn(a)}\{b\upharpoonright\mathrm{lh}(a)\mid b\in\mathrm{suc}^{n}_{T}(a)\} is a maximal antichain below aa in lh(a)\mathbb{P}_{\mathrm{lh}(a)}.

  7. (vii)(vii)

    Tn+1={sucTn(a)aTn}T_{n+1}=\bigcup\{\mathrm{suc}^{n}_{T}(a)\mid a\in T_{n}\}.

Abusing notation, we will usually identify TT with

(T,Tnn<ω,sucTnn<ω).(T,\langle T_{n}\mid n<\omega\rangle,\langle\mathrm{suc}^{n}_{T}\mid n<\omega\rangle).

If bsucTn(a)b\in\mathrm{suc}^{n}_{T}(a) then we also write a=predTn(b)a=\mathrm{pred}^{n}_{T}(b). If β<γ\beta<\gamma then pβp\in\mathbb{P}_{\beta} is a mixture of TT up to β\beta iff for all α<β,pα\alpha<\beta,\ p\upharpoonright\alpha forces

  1. (p.i)(p.i)

    p(α)=a0(α)p(\alpha)=a_{0}(\alpha) if α<lh(a0)\alpha<\mathrm{lh}(a_{0}) and a0αGαa_{0}\upharpoonright\alpha\in G_{\alpha},

  2. (p.ii)(p.ii)

    p(α)=b(α)p(\alpha)=b(\alpha) if there are a,bTa,b\in T, n<ωn<\omega with bsucTn(a)b\in\mathrm{suc}^{n}_{T}(a), lh(a)α<lh(b)\mathrm{lh}(a)\leq\alpha<\mathrm{lh}(b) and bαGαb\upharpoonright\alpha\in G_{\alpha},

  3. (p.iii)(p.iii)

    p(α)=𝟙˙αp(\alpha)=\mathbbm{1}_{\dot{\mathbb{Q}}_{\alpha}} if there is a sequence ann<ω\langle a_{n}\mid n<\omega\rangle with an+1sucTn(an)a_{n+1}\in\mathrm{suc}^{n}_{T}(a_{n}), lh(an)α\mathrm{lh}(a_{n})\leq\alpha and anGlh(an)a_{n}\in G_{\mathrm{lh}(a_{n})} for all n<ωn<\omega.

If ξγ\xi\leq\gamma is a limit, and qq is a sequence of length ξ\xi (may or may not be in ξ\mathbb{P}_{\xi}), qq is (T,ξ)(T,\xi)-nice if for all β<ξ\beta<\xi, qββq\upharpoonright\beta\in\mathbb{P}_{\beta} is a mixture of TT up to β\beta.

We refer to [Miy02] for basic results on nested antichains and mixtures. We go on and define nice limits.

Definition 3.20 (Miyamoto, [Miy02]).

Suppose =α,˙αα<γ\vec{\mathbb{P}}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\alpha}\mid\alpha<\gamma\rangle is a potential nice iteration of limit length γ\gamma. Let ¯\bar{\mathbb{P}} denote the inverse limit along \vec{\mathbb{P}}. The nice limit of \vec{\mathbb{P}} is defined as

nicelim()={p¯T a nested antichain of  and p is (T,γ)-nice}.\mathrm{nicelim}(\vec{\mathbb{P}})=\{p\in\bar{\mathbb{P}}\mid\exists T\text{ a nested antichain of }\vec{\mathbb{P}}\text{ and }p\text{ is }(T,\gamma)\text{-nice}\}.

nicelim()\mathrm{nicelim}(\vec{\mathbb{P}}) inherits the order from ¯\bar{\mathbb{P}}.

Finally, if =α,˙αα<γ\vec{\mathbb{P}}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\alpha}\mid\alpha<\gamma\rangle is a potential nice iteration then

α,˙βαγ,β<γ\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle

is a nice iteration of length γ\gamma where γ=nicelim()\mathbb{P}_{\gamma}=\mathrm{nicelim}(\vec{\mathbb{P}}).

The fundamental property of nice iterations is:

Fact 3.21 (Miyamoto,[Miy02]).

Suppose =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a nice iteration and TT is a nested antichain in \mathbb{P}. Then there is a mixture of TT.

Definition 3.22 (Miyamoto,[Miy02]).

Let =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle be a nice iteration. If S,TS,T are nested antichains in \mathbb{P} then STS\angle\ T iff for any n<ωn<\omega and aSna\in S_{n} there is bTn+1b\in T_{n+1} with

lh(b)lh(a) and alh(b)b.\mathrm{lh}(b)\leq\mathrm{lh}(a)\text{ and }a\upharpoonright\mathrm{lh}(b)\leq b.
Fact 3.23 (Miyamoto, [Miy02]).

Let =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle be a nice iteration of limit length γ\gamma. Suppose that

  1. (i)(i)

    TT is a nested antichain in \mathbb{P},

  2. (ii)(ii)

    pp is a mixture of TT and ss\in\mathbb{P},

  3. (iii)(iii)

    rT1r\in T_{1},

  4. (iv)(iv)

    srp[lh(r),γ)s\leq r^{\frown}p\upharpoonright[\mathrm{lh}(r),\gamma) and

  5. (v)(v)

    AγA\subseteq\gamma is cofinal.

Then there is a nested antichain SS in \mathbb{P} with

  1. (a)(a)

    ss is a mixture of SS,

  2. (b)(b)

    If S0={c}S_{0}=\{c\} then lh(r)lh(c)A\mathrm{lh}(r)\leq\mathrm{lh}(c)\in A and clh(r)rc\upharpoonright\mathrm{lh}(r)\leq r and

  3. (c)(c)

    STS\angle\ T.

The following describes the tool we use to construct conditions.

Definition 3.24 (Miyamoto, [Miy02]).

Let =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle be a nice iteration of limit length γ\gamma. A fusion structure in \mathbb{P} is

T,p(a,n),T(a,n)n<ω,aTnT,\langle p^{(a,n)},\ T^{(a,n)}\mid n<\omega,\ a\in T_{n}\rangle

where

  1. (i)(i)

    TT is a nested antichain in \mathbb{P}

and for all n<ωn<\omega and aTna\in T_{n}

  1. (ii)(ii)

    T(a,n)T^{(a,n)} is a nested antichain in \mathbb{P},

  2. (iii)(iii)

    p(a,n)p^{(a,n)}\in\mathbb{P} is a mixture of T(a,n)T^{(a,n)},

  3. (iv)(iv)

    ap(a,n)lh(a)a\leq p^{(a,n)}\upharpoonright\mathrm{lh}(a) and if T0(a,n)={c}T_{0}^{(a,n)}=\{c\} then lh(a)=lh(c)\mathrm{lh}(a)=\mathrm{lh}(c) and

  4. (v)(v)

    for any bsucTn(a)b\in\mathrm{suc}_{T}^{n}(a), T(b,n+1)T(a,n)T^{(b,n+1)}\angle\ T^{(a,n)}, thus p(b,n+1)p(a,n)p^{(b,n+1)}\leq p^{(a,n)}.

If qq\in\mathbb{P} is a mixture of TT then qq is called a fusion of the fusion structure.

Fact 3.25 (Miyamoto, [Miy02]).

Let =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle be a nice iteration of limit length γ\gamma. If qq\in\mathbb{P} is a fusion of a fusion structure

T,p(a,n),T(a,n)n<ω,aTnT,\langle p^{(a,n)},\ T^{(a,n)}\mid n<\omega,\ a\in T_{n}\rangle

and GG is \mathbb{P}-generic with qGq\in G then the following holds in V[G]V[G]: There is a sequence ann<ω\langle a_{n}\mid n<\omega\rangle so that for all n<ωn<\omega

  1. (i)(i)

    a0T0a_{0}\in T_{0},

  2. (ii)(ii)

    anGlh(an)a_{n}\in G_{\mathrm{lh}(a_{n})},

  3. (iii)(iii)

    an+1sucTn(an)a_{n+1}\in\mathrm{suc}_{T}^{n}(a_{n}) and

  4. (iv)(iv)

    p(an,n)Gp^{(a_{n},n)}\in G.

We mention one more convenient fact:

Fact 3.26 (Miyamoto, [Miy03]).

Suppose κ\kappa is an inaccessible cardinal, =α,˙βακ,β<κ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\kappa,\beta<\kappa\rangle is a nice iteration so that

  1. (i)(i)

    |α|<κ|\mathbb{P}_{\alpha}|<\kappa for all α<κ\alpha<\kappa and

  2. (ii)(ii)

    \mathbb{P} preserves ω1\omega_{1}.

Then \mathbb{P} is κ\kappa-c.c..

Miyamoto proves this for so called simple iterations of semiproper forcings. The proof works just as well for nice iterations of semiproper forcings and finally the proof can be made to work with assuming only \mathbb{P} preserves ω1\omega_{1} instead of \mathbb{P} being a semiproper iteration.

4 The Iteration Theorem

The full main theorem we are going to prove is the following.

Theorem 4.1.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}) and =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle is a nice iteration of ff-preserving forcings. Suppose that

  1. (.i)(\mathbb{P}.i)

    α+2SRP\Vdash_{\mathbb{P}_{\alpha+2}}\mathrm{SRP} for all α+2γ\alpha+2\leq\gamma and

  2. (.ii)(\mathbb{P}.ii)

    α``˙α preserves f-stationary sets from β<αV[G˙β]\Vdash_{\mathbb{P}_{\alpha}}``\dot{\mathbb{Q}}_{\alpha}\text{ preserves }f\text{-stationary sets from }\bigcup_{\beta<\alpha}V[\dot{G}_{\beta}].

Then \mathbb{P} preserves ff.

Note that if 𝔹\mathbb{B} is the trivial forcing {𝟙}\{\mathbbm{1}\} and we take ff to be the witness of +(𝔹)\diamondsuit^{+}(\mathbb{B}) with f(α)={𝟙}f(\alpha)=\{\mathbbm{1}\} for all 0<α<ω10<\alpha<\omega_{1}, then we recover the special case mentioned in the introduction.

So what is the basic idea? For the moment, let us assume that ff is the trivial witness of ({𝟙})\diamondsuit(\{\mathbbm{1}\}) above for simplicity. As always, we want to imitate the argument of the mother of all iteration theorems, the iteration theorem for proper forcings. Suppose we have a full support iteration

=n,˙mnω,m<ω\mathbb{P}=\langle\mathbb{P}_{n},\dot{\mathbb{Q}}_{m}\mid n\leq\omega,m<\omega\rangle

and for the moment assume only that

n``˙n preserves ω1".\Vdash_{\mathbb{P}_{n}}``\dot{\mathbb{Q}}_{n}\text{ preserves }\omega_{1}".

We try to motivate some additional reasonable constraints imply \mathbb{P} to be ω1\omega_{1}-preserving. For the moment, we try to consider Shelah’s argument as a game: In the beginning there some countable XHθX\prec H_{\theta} as well as p0Xp_{0}\in X\cap\mathbb{P}. The argument proceeds as follows: In round nn, we have already constructed a (X,n)(X,\mathbb{P}_{n})-semigeneric condition qnnq_{n}\in\mathbb{P}\upharpoonright n and have

qnp˙nnG˙nXˇ[G˙n].q_{n}\Vdash\dot{p}_{n}\upharpoonright n\in\dot{G}_{n}\cap\check{X}[\dot{G}_{n}].

Next, our adversary hits us with a dense subset DD\subseteq\mathbb{P} in XX and we must find p˙n+1Vn\dot{p}_{n+1}\in V^{\mathbb{P}_{n}} and some (X,n+1)(X,\mathbb{P}_{n+1})-semigeneric qn+1q_{n+1} with qn+1n=qnq_{n+1}\upharpoonright n=q_{n} and777Here, we consider p˙n\dot{p}_{n} also as a n+1\mathbb{P}_{n+1}-name.

qn+1p˙n+1Dˇpn+1n+1G˙n+1Xˇ[G˙n+1].q_{n+1}\Vdash\dot{p}_{n+1}\in\check{D}\wedge p_{n+1}\upharpoonright n+1\in\dot{G}_{n+1}\cap\check{X}[\dot{G}_{n+1}].

Our job is to survive this game for ω\omega-many steps. If we have a winning strategy then we can find a (X,)(X,\mathbb{P})-semigeneric condition, so in particular \mathbb{P} preserves ω1\omega_{1}.

Destroying stationarity makes it significantly more difficult to survive the above game: Suppose for example that

p0(0)SˇNSω1p_{0}(0)\Vdash\check{S}\in\mathrm{NS}_{\omega_{1}}

for some SXS\in X with δXS\delta^{X}\in S. Then there is no hope of finding a (X,1)(X,\mathbb{P}_{1})-semigeneric condition qq with qp01q\leq p_{0}\upharpoonright 1. Hence, we must already be careful with what XX we start the game. This leads us to the following definitions.

Definition 4.2.

Suppose θ\theta is sufficiently large and regular, XHθX\prec H_{\theta} is countable. If II is an ideal on ω1\omega_{1}, we say that XX respects II if for all AIXA\in I\cap X we have δXA\delta^{X}\notin A.

Note that all countable XHθX\prec H_{\theta} respect NSω1\mathrm{NS}_{\omega_{1}} and countable YHθY\prec H_{\theta} with fYf\in Y respects NSf\mathrm{NS}_{f} if and only if YY is f-slimf\text{-slim}.

Definition 4.3.

Suppose \mathbb{P} is a forcing and I˙V\dot{I}\in V^{\mathbb{P}} is a name for an ideal on ω1\omega_{1}. For pp in \mathbb{P}, we denote the partial evaluation of I˙\dot{I} by pp by

I˙p{Sω1pSˇI˙}.\dot{I}^{p}\coloneqq\{S\subseteq\omega_{1}\mid p\Vdash\check{S}\in\dot{I}\}.

Back to the discussion, we need to start with an XX so that XX respects I˙p01\dot{I}^{p_{0}\upharpoonright 1} where I˙\dot{I} is a name for the nonstationary ideal. This gives us a shot at getting past the first round. Luckily, there are enough of these XX.

Definition 4.4.

Let AA be an uncountable set with ω1A\omega_{1}\subseteq A and II a normal uniform ideal on ω1\omega_{1}. Then 𝒮[A]ω\mathcal{S}\subseteq[A]^{\omega} is projective II-positive if for any SI+S\in I^{+} the set

{X𝒮δXS}\{X\in\mathcal{S}\mid\delta^{X}\in S\}

is stationary in [A]ω[A]^{\omega}.

Proposition 4.5.

Suppose θ\theta is sufficiently large and regular. Let II be a normal uniform ideal on ω1\omega_{1}. Then

𝒮={X[Hθ]ωXHθ respects I}\mathcal{S}=\{X\in[H_{\theta}]^{\omega}\mid X\prec H_{\theta}\text{ respects }I\}

is projective II-positive.

Proof.

Let 𝒞\mathcal{C} be a club in [Hθ]ω[H_{\theta}]^{\omega} and assume that all elements of 𝒞\mathcal{C} are elementary substructures of HθH_{\theta} and contain II as an element. Let

XXαα<ω1\vec{X}\coloneqq\langle X_{\alpha}\mid\alpha<\omega_{1}\rangle

be a continuous increasing chain of elements in 𝒞\mathcal{C}. Let Xα<ω1XαX\coloneqq\bigcup_{\alpha<\omega_{1}}X_{\alpha} and let

AAαα<ω1\vec{A}\coloneqq\langle A_{\alpha}\mid\alpha<\omega_{1}\rangle

be an enumeration of XIX\cap I. Let Cω1C\subseteq\omega_{1} be the set of α\alpha so that

  1. (C.i)(C.i)

    δXα=α\delta^{X_{\alpha}}=\alpha and

  2. (C.ii)(C.ii)

    Aα\vec{A}\upharpoonright\alpha is an enumeration of XαIX_{\alpha}\cap I

and note that CC is club. Let A=α<ω1IαA=\bigtriangledown_{\alpha<\omega_{1}}I_{\alpha}. As II is normal, AIA\in I. Then CAC-A is a complement of a set in II and for any αCA\alpha\in C-A we have

δXα=αIβ\delta^{X_{\alpha}}=\alpha\notin I_{\beta}

for all β<α\beta<\alpha. Hence Xα𝒮𝒞X_{\alpha}\in\mathcal{S}\cap\mathcal{C}. ∎

Of course, the problem continues. What if we have found a suitable q1q_{1} and now we work in V[G1]V[G_{1}] with q1G1q_{1}\in G_{1}. At the very least, we need that X[G1]X[G_{1}] respects I˙p0[1,2)\dot{I}^{p_{0}\upharpoonright[1,2)}, where I˙\dot{I} is now a 1,2\mathbb{P}_{1,2}-name for the nonstationary ideal. Ensuring this is a matter of being able to pick the right q1q_{1} to begin with. This motivates the following class of forcings.

Definition 4.6.

We say that a forcing \mathbb{P} is respectful if \mathbb{P} preserves ω1\omega_{1} and the following is true: Whenever

  • θ\theta is sufficiently large and regular,

  • XHθX\prec H_{\theta} is countable with X\mathbb{P}\in X,

  • I˙X\dot{I}\in X is a \mathbb{P}-name for a normal uniform ideal and

  • pXp\in\mathbb{P}\cap X

then exactly one of the following holds:

  1. (Res.i)(\mathrm{Res}.i)

    Either there is some (X,)(X,\mathbb{P})-semigeneric qpq\leq p so that

    q``Xˇ[G˙] respects I˙"q\Vdash``\check{X}[\dot{G}]\text{ respects }\dot{I}"

    or

  2. (Res.ii)(\mathrm{Res}.ii)

    XX does not respect I˙p\dot{I}^{p}.

Roughly, this condition states that we can find a \mathbb{P}-generic filter GG with pGp\in G so that XX[G]X\sqsubseteq X[G] respects I˙G\dot{I}^{G} as long as there is no obvious obstruction to it.

Remark 4.7.

If \mathbb{P} is respectful and preserves stationary sets then \mathbb{P} is semiproper. However, the converse is not true in general. Similarly, a respectful ff-stationary set preserving forcing is ff-semiproper, which follows from plugging in a name for NSf\mathrm{NS}_{f} as I˙\dot{I} in the definition of respectfulness.

We require888This excludes the first counterexample due to Shelah, but not yet all the counterexamples of the second kind. now that

n``˙n is respectful"\Vdash_{\mathbb{P}_{n}}``\dot{\mathbb{Q}}_{n}\text{ is respectful}"

for all n<ωn<\omega. We then aim to make sure (assuming p˙n+1\dot{p}_{n+1} is already defined) to find qn+1q_{n+1} in round nn so that in addition to the prior constraints,

qn+1``Xˇ[G˙n+1] respects I˙"q_{n+1}\Vdash``\check{X}[\dot{G}_{n+1}]\text{ respects }\dot{I}"

where I˙\dot{I} is a n+1\mathbb{P}_{n+1} name for the ideal of sets forced to be nonstationary by p˙n+1(n+1)\dot{p}_{n+1}(n+1). Consider I˙\dot{I} as a n\mathbb{P}_{n}-name I¨\ddot{I} for a ˙n\dot{\mathbb{Q}}_{n}-name. By respectfulness, this reduces to avoiding an instance of the “bad case” (Res.ii)(\mathrm{Res}.ii), namely we should make sure that whenever GnG_{n} is n\mathbb{P}_{n}-generic with qnGnq_{n}\in G_{n} then

X[Gn] respects (I¨Gn)pn+1(n+1)X[G_{n}]\text{ respects }\left(\ddot{I}^{G_{n}}\right)^{p_{n+1}(n+1)}

where pn+1=p˙n+1Gn+1p_{n+1}=\dot{p}_{n+1}^{G_{n+1}}. he next key insight is that this reduces to

``X[Gn] respects J{Sω1pn+1(n)SˇNSω1}"``X[G_{n}]\text{ respects }J\coloneqq\{S\subseteq\omega_{1}\mid p_{n+1}(n)\Vdash\check{S}\in\mathrm{NS}_{\omega_{1}}\}"

which we have (almost)999We made sure of this if pn+1p_{n+1} is replaced by pnp_{n} in the definition of JJ, we ignore this small issue for now. already justified inductively, assuming ˙n+1\dot{\mathbb{Q}}_{n+1} only kills new stationary sets: Our final requirement101010It is readily seen that this eliminates the counterexamples of the second kind. is that

n+1``˙n+1 preserves stationary sets which are in V[G˙n]"\Vdash_{\mathbb{P}_{n+1}}``\dot{\mathbb{Q}}_{n+1}\text{ preserves stationary sets which are in }V[\dot{G}_{n}]"

for all n<ωn<\omega. The point is that trivially (I¨Gn)pn+1(n)\left(\ddot{I}^{G_{n}}\right)^{p_{n+1}(n)} only contains sets in V[Gn]V[G_{n}], so all such sets will be preserved by ˙n+1\dot{\mathbb{Q}}_{n+1}. The sets that are killed are then already killed in the extension by ˙nGn\dot{\mathbb{Q}}_{n}^{G_{n}}.
Modulo some details we have shown the following.

Theorem 4.8.

Suppose =n,˙mnω,m<ω\mathbb{P}=\langle\mathbb{P}_{n},\dot{\mathbb{Q}}_{m}\mid n\leq\omega,m<\omega\rangle is a full support iteration so that

  1. (.i)(\mathbb{P}.i)

    n˙n is respectful\Vdash_{\mathbb{P}_{n}}\dot{\mathbb{Q}}_{n}\text{ is respectful} and

  2. (.ii)(\mathbb{P}.ii)

    n+1˙n+1 preserves stationary sets which are in V[G˙n]"\Vdash_{\mathbb{P}_{n+1}}\dot{\mathbb{Q}}_{n+1}\text{ preserves stationary sets which are in }V[\dot{G}_{n}]"

for all n<ωn<\omega. Then \mathbb{P} does not collapse ω1\omega_{1}.

Two issues arise when generalizing this to longer iterations. The first issue is the old problem that new relevant indices may appear along the iteration in the argument, which we deal with by using nice supports. The second problem is that it seemingly no longer suffices that each iterand individually is respectful. For longer iterations, say of length γ\gamma, the argument then requires that

α``˙α,β is respectful"\Vdash_{\alpha}``\dot{\mathbb{P}}_{\alpha,\beta}\text{ is respectful}"

for sufficiently many α<β<γ\alpha<\beta<\gamma. This is problematic as we will not prove an iteration theorem of any kind for respectful forcings111111Indeed it seems that no useful iteration theorem for respectful forcings is provable in ZFC\mathrm{ZFC}, see Subsection LABEL:disrespectfulforcingsubsection.. This is where we take out the sledgehammer.

Definition 4.9.

()(\ddagger) holds if and only if all ω1\omega_{1}-preserving forcings are respectful.

Lemma 4.10.

SRP\mathrm{SRP} implies ()(\ddagger).

Proof.

Let \mathbb{P}, θ\theta, I˙\dot{I}, pp be as Definition 4.6. It is easy to see that (Res.i)(\mathrm{Res}.i) and (Res.ii)(\mathrm{Res}.ii) cannot hold simultaneously. It is thus enough to prove that one of them holds. Let λ\lambda be regular, 2||<λ<θ2^{|\mathbb{P}|}<\lambda<\theta and λX\lambda\in X and consider the set

𝒮={Y[Hλ]ω\displaystyle\mathcal{S}=\{Y\in[H_{\lambda}]^{\omega}\mid YHλ¬(qpq is\displaystyle Y\prec H_{\lambda}\wedge\neg(\exists q\leq p\ q\text{ is }
(Y,)-semigeneric and q``Yˇ[G˙] respects I˙")}.\displaystyle(Y,\mathbb{P})\text{-semigeneric}\text{ and }q\Vdash``\check{Y}[\dot{G}]\text{ respects }\dot{I}")\}.

By SRP\mathrm{SRP}, there is a continuous increasing elementary chain

Y=Yαα<ω1\vec{Y}=\langle Y_{\alpha}\mid\alpha<\omega_{1}\rangle

so that

  1. (Y.i)(\vec{Y}.i)

    ,p,I˙Y0\mathbb{P},p,\dot{I}\in Y_{0} and

  2. (Y.ii)(\vec{Y}.ii)

    for all α<ω1\alpha<\omega_{1}, either Yα𝒮Y_{\alpha}\in\mathcal{S} or there is no YαZHθY_{\alpha}\sqsubseteq Z\prec H_{\theta} with Z𝒮Z\in\mathcal{S}.

Let S={α<ω1Yα𝒮}S=\{\alpha<\omega_{1}\mid Y_{\alpha}\in\mathcal{S}\}.

Claim 4.11.

pSˇI˙p\Vdash\check{S}\in\dot{I}.

Proof.

Let GG be generic with pGp\in G and let I=I˙GI=\dot{I}^{G}. Assume toward a contradiction that SS is II-positive. Note that Yα[G]α<ω1\langle Y_{\alpha}[G]\mid\alpha<\omega_{1}\rangle is a continuous increasing sequence of elementary substructure of HθV[G]H_{\theta}^{V[G]}. Hence there is a club CC of α\alpha so that for αC\alpha\in C

δYα=δYα[G]=α\delta^{Y_{\alpha}}=\delta^{Y_{\alpha}[G]}=\alpha

and thus there is a (Yα,)(Y_{\alpha},\mathbb{P})-semigeneric condition qpq\leq p, qGq\in G. Hence by definition of SS, for any αSC\alpha\in S\cap C, we may find some NαIYα[G]N_{\alpha}\in I\cap Y_{\alpha}[G] so that δYαNα\delta^{Y_{\alpha}}\in N_{\alpha}. By normality of II, there is some II-positive TSCT\subseteq S\cap C and some NN so that N=NαN=N_{\alpha} for all αT\alpha\in T. But then for αT\alpha\in T, we have

α=δYN\alpha=\delta^{Y}\in N

so that TNT\subseteq N. But NIN\in I, contradiction. ∎

Thus if δXS\delta^{X}\in S, then SS witnesses (Res.ii)(\mathrm{Res}.ii) to hold. Otherwise, δXS\delta^{X}\notin S. Note that δYδX=δX\delta^{Y_{\delta^{X}}}=\delta^{X} as YX\vec{Y}\in X. We find that YδXXHλHλY_{\delta^{X}}\sqsubseteq X\cap H_{\lambda}\prec H_{\lambda}. Thus, XHλ𝒮X\cap H_{\lambda}\notin\mathcal{S}, so that there must be some qpq\leq p that is (XHλ,)(X\cap H_{\lambda},\mathbb{P})-semigeneric and

q``(XHλˇ)[G˙] respects I˙".q\Vdash``(\widecheck{X\cap H_{\lambda}})[\dot{G}]\text{ respects }\dot{I}".

This qq witnesses that (Res.i)(\mathrm{Res}.i) holds. ∎

We will get around this second issue by forcing SRP\mathrm{SRP} often along the iteration. Remember that what we really care about is preserving a witness ff of (𝔹)\diamondsuit(\mathbb{B}) along an iteration of ff-preserving forcings, so fix such an ff now. It will be quite convenient to introduce some short hand notation.

Definition 4.12.

Suppose \mathbb{P} is a forcing and pp\in\mathbb{P}. Then we let IpI^{\mathbb{P}}_{p} denote I˙p\dot{I}^{p} where I˙\dot{I} is a \mathbb{P}-name for NSf\mathrm{NS}_{f}. That is

Ip{Sω1pSˇNSf}.I^{\mathbb{P}}_{p}\coloneqq\{S\subseteq\omega_{1}\mid p\Vdash\check{S}\in\mathrm{NS}_{f}\}.
Definition 4.13.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). An ff-ideal is an ideal II on ω1\omega_{1} so that

  1. (i)(i)

    whenever SI+S\in I^{+} and Dii<ω1\langle D_{i}\mid i<\omega_{1}\rangle is a sequence of dense subsets of 𝔹\mathbb{B}, then

    {αSβ<αf(α)Dβ}I+\{\alpha\in S\mid\forall\beta<\alpha\ f(\alpha)\cap D_{\beta}\neq\emptyset\}\in I^{+}
  2. (ii)(ii)

    and SbfI+S^{f}_{b}\in I^{+} for all b𝔹b\in\mathbb{B}.

Recall that NSf\mathrm{NS}_{f} is clearly an ff-ideal and it is normal and uniform by Lemma 3.18.

Proposition 4.14.

Suppose \mathbb{P} is a forcing that preserves ff and pp\in\mathbb{P}. Then IpI^{\mathbb{P}}_{p} is a normal uniform ff-ideal.

We leave the proof to the reader. The next Lemma gives us a criterion that guarantees the relevant witness ff of (𝔹)\diamondsuit(\mathbb{B}) to be preserved. We first introduce the notion of a ff-semigeneric condition.

Definition 4.15.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}), \mathbb{P} is a forcing, θ\theta is sufficiently large and XHθX\prec H_{\theta} is a f-slimf\text{-slim} elementary substructure of HθH_{\theta} with X\mathbb{P}\in X. A condition pp\in\mathbb{P} is called (X,,f)(X,\mathbb{P},f)-semigeneric if pp is (X,)(X,\mathbb{P})-semigeneric and

pXˇ[G˙] is fˇ-slim.p\Vdash\check{X}[\dot{G}]\text{ is }\check{f}\text{-slim}.
Lemma 4.16.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}) and \mathbb{P} is a forcing with the following property: For any sufficiently large regular θ\theta and pp\in\mathbb{P} there is a normal uniform ff-ideal II so that

{X[Hθ]ωXHθ,pXqpq is (X,,f)-semigeneric}\{X\in[H_{\theta}]^{\omega}\mid X\prec H_{\theta}\wedge\mathbb{P},p\in X\wedge\exists q\leq p\ q\text{ is }(X,\mathbb{P},f)\text{-semigeneric}\}

is projective II-positive. Then \mathbb{P} preserves ff.

Proof.

Assume pp\in\mathbb{P}, θ\theta is sufficiently large and regular. Let b𝔹b\in\mathbb{B},

D˙=D˙αα<ω1\vec{\dot{D}}=\langle\dot{D}_{\alpha}\mid\alpha<\omega_{1}\rangle

be a sequence of \mathbb{P}-names for dense subsets of 𝔹\mathbb{B} and C˙\dot{C} a \mathbb{P}-name for a club in ω1\omega_{1}. We will find qpq\leq p so that

qαSbfˇC˙β<αfˇ(α)D˙β.q\Vdash\exists\alpha\in S^{\check{f}}_{b}\cap\dot{C}\forall\beta<\alpha\ \check{f}(\alpha)\cap\dot{D}_{\beta}\neq\emptyset.

By our assumption, there is some normal uniform ff-ideal II so that

{X[Hθ]ωXHθ,pXqpq is (X,,f)-semigeneric}\{X\in[H_{\theta}]^{\omega}\mid X\prec H_{\theta}\wedge\mathbb{P},p\in X\wedge\exists q\leq p\ q\text{ is }(X,\mathbb{P},f)\text{-semigeneric}\}

is projective II-positive. It follows that we can find some countable XHθX\prec H_{\theta} so that

  1. (X.i)(X.i)

    ,p,D˙,C˙X\mathbb{P},p,\vec{\dot{D}},\dot{C}\in X as well as

  2. (X.ii)(X.ii)

    bf(δX)b\in f(\delta^{X})

and some qpq\leq p that is (X,,f)(X,\mathbb{P},f)-semigeneric. If GG is then any \mathbb{P}-generic with qGq\in G, we have

XX[G] is f-slimX\sqsubseteq X[G]\text{ is }f\text{-slim}

and hence δXC˙G\delta^{X}\in\dot{C}^{G} as well as

β<δXf(δX)D˙βG.\forall\beta<\delta^{X}\ f(\delta^{X})\cap\dot{D}^{G}_{\beta}\neq\emptyset.

We also need to resolve a small issue that we glossed over in the sketch of a proof of Theorem 4.8.

Lemma 4.17.

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). Further assume that

  • \mathbb{P} is a respectful, ff-preserving forcing and pp\in\mathbb{P},

  • θ\theta is sufficiently large and regular,

  • XHθX\prec H_{\theta} is countable, respects IpI^{\mathbb{P}}_{p} and ,pX\mathbb{P},p\in X and

  • MX[f(δX)]``D is dense below πX1(p) in πX1()"M_{X}[f(\delta^{X})]\models``D\text{ is dense below }\pi_{X}^{-1}(p)\text{ in }\pi_{X}^{-1}(\mathbb{P})".

Then there are Y,qY,q with

  1. (i)(i)

    XYHθX\sqsubseteq Y\prec H_{\theta} is countable,

  2. (ii)(ii)

    qpq\leq p,

  3. (iii)(iii)

    YY respects IqI^{\mathbb{P}}_{q}, in particular YY is f-slimf\text{-slim} and

  4. (iv)(iv)

    qπY[μX,Y+(D)]q\in\pi_{Y}[\mu_{X,Y}^{+}(D)].

Proof.

We may assume that XX is an elementary substructure of

(Hθ;,)\mathcal{H}\coloneqq(H_{\theta};\in,\unlhd)

where \unlhd is a wellorder of HθH_{\theta}. As \mathbb{P} is respectful and XX respects IpI^{\mathbb{P}}_{p}, there is a (X,)(X,\mathbb{P})-semigeneric condition rpr\leq p so that

r``Xˇ[G˙] respects NSfˇ"r\Vdash``\check{X}[\dot{G}]\text{ respects }\mathrm{NS}_{\check{f}}"

i.e. rr is (X,,f)(X,\mathbb{P},f)-semigeneric. Let GG be \mathbb{P}-generic with rGr\in G. Then X[G]X[G] is f-slimf\text{-slim}. Let Z=X[G]VZ=X[G]\cap V, note that μX,Z+\mu_{X,Z}^{+} exists by Proposition 3.16. Now there is thus some qpq\leq p, qGq\in G with

qπZ[μX,Z+(D)].q\in\pi_{Z}[\mu_{X,Z}^{+}(D)].

Finally, note that qq and YHull(X{q})Y\coloneqq\mathrm{Hull}^{\mathcal{H}}(X\cup\{q\}) have the desired properties. ∎

Proof of Theorem 4.1.

Let =α,˙βαγ,β<γ\mathbb{P}=\langle\mathbb{P}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\alpha\leq\gamma,\beta<\gamma\rangle be an iteration of ff-preserving forcings which preserve old ff-stationary sets and forces SRP\mathrm{SRP} at successor steps. We may assume inductively that α\mathbb{P}_{\alpha} preserves ff for all α<γ\alpha<\gamma. The successor step is trivial, so we may restrict to γLim\gamma\in\mathrm{Lim}. Note that we may further assume that ()(\ddagger) holds in VV, otherwise we could work in V1V^{\mathbb{P}_{1}}. Let pp\in\mathbb{P} and let IIp(0)0I\coloneqq I^{\mathbb{Q}_{0}}_{p(0)}. II is a normal uniform ff-ideal by Proposition 4.14. Now let θ\theta be sufficiently large and regular, XHθX\prec H_{\theta} countable with

  1. (X.i)(X.i)

    ,p,fX\mathbb{P},p,f\in X and

  2. (X.ii)(X.ii)

    XX respects II.

By Proposition 4.5 and Lemma 4.16, it suffices to find qpq\leq p that is (X,,f)(X,\mathbb{P},f)-semigeneric. Note that XX is f-slimf\text{-slim} as II is a ff-ideal. Let

h:ωω×ωh\colon\omega\rightarrow\omega\times\omega

be a surjection with ini\leq n whenever h(n)=(i,j)h(n)=(i,j).
Let δ\delta denote δX\delta^{X}. We will construct a fusion structure

T,p(a,n),T(a,n)aTn,n<ωT,\langle p^{(a,n)},T^{(a,n)}\mid a\in T_{n},\ n<\omega\rangle

in \mathbb{P} as well as names

X˙(a,n),Z˙(a,n)(D˙j(a,n))j<ω,I˙(a,n)aTn,n<ω\left\langle\dot{X}^{(a,n)},\dot{Z}^{(a,n)}\left(\dot{D}_{j}^{(a,n)}\right)_{j<\omega},\dot{I}^{(a,n)}\mid a\in T_{n},n<\omega\right\rangle

so that for any n<ωn<\omega and aTna\in T_{n}

  1. (F.i)(F.i)

    T0={𝟙}T_{0}=\{\mathbbm{1}\}, p(𝟙,0)=pp^{(\mathbbm{1},0)}=p, X˙(𝟙,0)=Xˇ\dot{X}^{(\mathbbm{1},0)}=\check{X}, I˙(𝟙,0)=Iˇ\dot{I}^{(\mathbbm{1},0)}=\check{I},

  2. (F.ii)(F.ii)

    T(𝟙,0)XT^{(\mathbbm{1},0)}\in X is a nested antichain that pp is a mixture of with T0(𝟙,0)={𝟙}T_{0}^{(\mathbbm{1},0)}=\{\mathbbm{1}\},

  3. (F.iii)(F.iii)

    alh(a)Z˙(a,n)=X˙(a,n)Va\Vdash_{\mathrm{lh}(a)}\dot{Z}^{(a,n)}=\dot{X}^{(a,n)}\cap V,

  4. (F.iv)(F.iv)

    (D˙j(a,n))j<ω\left(\dot{D}_{j}^{(a,n)}\right)_{j<\omega} is forced by aa to be an enumeration of all dense subsets of πZ˙(a,n)1(ˇ)\pi_{\dot{Z}^{(a,n)}}^{-1}(\check{\mathbb{P}}) in

    MZ˙(a,n)[f(δ)ˇ],M_{\dot{Z}^{(a,n)}}\left[\widecheck{f(\delta)}\right],
  5. (F.v)(F.v)

    ap(a,n)lh(a)a\leq p^{(a,n)}\upharpoonright\mathrm{lh}(a),

  6. (F.vi)(F.vi)

    lh(a)\mathrm{lh}(a) is not a limit ordinal,

  7. (F.vii)(F.vii)

    alh(a)pˇ(a,n),Tˇ(a,n),G˙lh(a)X˙(a,n)a\Vdash_{\mathrm{lh}(a)}\check{p}^{(a,n)},\check{T}^{(a,n)},\dot{G}_{\mathrm{lh}(a)}\in\dot{X}^{(a,n)},

  8. (F.viii)(F.viii)

    alh(a)I˙(a,n)=Ipˇ(a,n)(lh(a))˙lh(a)a\Vdash_{\mathrm{lh}(a)}\dot{I}^{(a,n)}=I^{\dot{\mathbb{Q}}_{\mathrm{lh}(a)}}_{\check{p}^{(a,n)}(\mathrm{lh}(a))} and

  9. (F.ix)(F.ix)

    a``XˇX˙(a,n)HθˇV[G˙lh(a)] is countable and respects I˙(a,n)"a\Vdash``\check{X}\sqsubseteq\dot{X}^{(a,n)}\prec H_{\check{\theta}}^{V[\dot{G}_{\mathrm{lh}(a)}]}\text{ is countable and respects }\dot{I}^{(a,n)}".

Moreover, for any bsucTn(a)b\in\mathrm{suc}^{n}_{T}(a)

  1. (F.x)(F.x)

    blh(a)lh(a)``pˇ(b,n+1),Tˇ(b,n+1)X˙(a,n), in particular lh(bˇ),lh(aˇ),lh(bˇ)X˙(a,n)b\upharpoonright\mathrm{lh}(a)\Vdash_{\mathrm{lh}(a)}``\check{p}^{(b,n+1)},\check{T}^{(b,n+1)}\in\dot{X}^{(a,n)},\text{ in particular }\mathrm{lh}(\check{b}),\mathbb{P}_{\mathrm{lh}(\check{a}),\mathrm{lh}(\check{b})}\in\dot{X}^{(a,n)}”,

  2. (F.xi)(F.xi)

    blh(b)X˙(a,n)[G˙lh(a),lh(b)]X˙(b,n+1)b\Vdash_{\mathrm{lh}(b)}\dot{X}^{(a,n)}[\dot{G}_{\mathrm{lh}(a),\mathrm{lh}(b)}]\sqsubseteq\dot{X}^{(b,n+1)} and

  3. (F.xii)(F.xii)

    if h(n)=(i,j)h(n)=(i,j) and c=predTi(b)c=\mathrm{pred}_{T}^{i}(b) then

    blh(n)pˇ(b,n+1)πX˙(a,n)[μ˙c,a+(D˙j(c,i))].b\Vdash_{\mathrm{lh}(n)}\check{p}^{(b,n+1)}\in\pi_{\dot{X}^{(a,n)}}[\dot{\mu}_{c,a}^{+}(\dot{D}_{j}^{(c,i)})].

Here, μc,a+\mu_{c,a}^{+} denotes121212There is some slight abuse of notation here in an effort to improve readability.

μZ˙(c,i),Z˙(a,n)+:MZ˙(c,i)[fˇ(δˇ)]MZ˙(a,n)[fˇ(δˇ)].\mu_{\dot{Z}^{(c,i)},\dot{Z}^{(a,n)}}^{+}\colon M_{\dot{Z}^{(c,i)}}[\check{f}(\check{\delta})]\rightarrow M_{\dot{Z}^{(a,n)}}[\check{f}(\check{\delta})].

We define all objects by induction on n<ωn<\omega.

T0={𝟙},p(𝟙,0),T(𝟙,0),X˙(𝟙,0),Z˙(𝟙,0)(D˙j(𝟙,0))j<ω,I˙(𝟙,0)T_{0}=\{\mathbbm{1}\},p^{(\mathbbm{1},0)},T^{(\mathbbm{1},0)},\dot{X}^{(\mathbbm{1},0)},\dot{Z}^{(\mathbbm{1},0)}\left(\dot{D}_{j}^{(\mathbbm{1},0)}\right)_{j<\omega},\dot{I}^{(\mathbbm{1},0)}

are given by (F.i)(F.i)-(F.iv)(F.iv) and (F.viii)(F.viii). Suppose we have already defined

Tn,p(a,n),T(a,n),X˙(a,n),Z˙(a,n),(D˙j(a,n))j<ωaTnT_{n},\left\langle p^{(a,n)},T^{(a,n)},\dot{X}^{(a,n)},\dot{Z}^{(a,n)},\left(\dot{D}_{j}^{(a,n)}\right)_{j<\omega}\mid a\in T_{n}\right\rangle

and we will further construct

Tn+1,p(b,n+1),T(b,n+1),X˙(b,n+1),Z˙(b,n+1),(D˙j(b,n+1))j<ωbTn+1.T_{n+1},\left\langle p^{(b,n+1)},T^{(b,n+1)},\dot{X}^{(b,n+1)},\dot{Z}^{(b,n+1)},\left(\dot{D}_{j}^{(b,n+1)}\right)_{j<\omega}\mid b\in T_{n+1}\right\rangle.

Fix aTna\in T_{n}. Let EE be the set of all bb so that

  1. (E.i)(E.i)

    blh(b)b\in\mathbb{P}_{\mathrm{lh}(b)} and lh(b)<γ\mathrm{lh}(b)<\gamma,

  2. (E.ii)(E.ii)

    lh(a)lh(b)\mathrm{lh}(a)\leq\mathrm{lh}(b) and blh(a)ab\upharpoonright\mathrm{lh}(a)\leq a,

and there are a nested antichain SS in \mathbb{P}, ss\in\mathbb{P} and names X˙\dot{X}, I˙\dot{I} with

  1. (E.iii)(E.iii)

    ST(a,n)S\angle\ T^{(a,n)},

  2. (E.iv)(E.iv)

    sp(a,n)s\leq p^{(a,n)} is a mixture of SS,

  3. (E.v)(E.v)

    if h(n)=(i,j)h(n)=(i,j) and c=predTi(a)c=\mathrm{pred}_{T}^{i}(a) then

    blh(b)sˇπZ˙(a,n)[μ˙c,a+(D˙j(c,i))],b\Vdash_{\mathrm{lh}(b)}\check{s}\in\pi_{\dot{Z}^{(a,n)}}[\dot{\mu}^{+}_{c,a}(\dot{D}_{j}^{(c,i)})],
  4. (E.vi)(E.vi)

    lh(b)\mathrm{lh}(b) is not a limit ordinal,

  5. (E.vii)(E.vii)

    blh(a)lh(a)sˇ,SˇX˙b\upharpoonright\mathrm{lh}(a)\Vdash_{\mathrm{lh}(a)}\check{s},\check{S}\in\dot{X},

  6. (E.viii)(E.viii)

    blh(b)sˇlh(b)G˙lh(b)b\Vdash_{\mathrm{lh}(b)}\check{s}\upharpoonright\mathrm{lh}(b)\in\dot{G}_{\mathrm{lh}(b)},

  7. (E.ix)(E.ix)

    blh(b)X˙(a,n)X˙(a,n)[G˙lh(a),lh(b)]X˙HθˇV[G˙lh(bˇ)]b\Vdash_{\mathrm{lh}(b)}\dot{X}^{(a,n)}\sqsubseteq\dot{X}^{(a,n)}[\dot{G}_{\mathrm{lh}(a),\mathrm{lh}(b)}]\sqsubseteq\dot{X}\prec H_{\check{\theta}}^{V[\dot{G}_{\mathrm{lh}(\check{b})}]},

  8. (E.x)(E.x)

    blh(b)``X˙ is countable and respects I˙"b\Vdash_{\mathrm{lh}(b)}``\dot{X}\text{ is countable and respects }\dot{I}",

  9. (E.xi)(E.xi)

    blh(b)I˙=Isˇ(lh(b))˙lh(b)b\Vdash_{\mathrm{lh}(b)}\dot{I}=I^{\dot{\mathbb{Q}}_{\mathrm{lh}(b)}}_{\check{s}(\mathrm{lh}(b))} and

  10. (E.xii)(E.xii)

    if S0={c0}S_{0}=\{c_{0}\} then lh(b)=lh(c0)\mathrm{lh}(b)=\mathrm{lh}(c_{0}) and bc0b\leq c_{0}.

Claim 4.18.

Elh(a){blh(a)bE}E\upharpoonright\mathrm{lh}(a)\coloneqq\{b\upharpoonright\mathrm{lh}(a)\mid b\in E\} is dense in lh(a)\mathbb{P}_{\mathrm{lh}(a)}.

Proof.

Let aaa^{\prime}\leq a and let GG be lh(a)\mathbb{P}_{\mathrm{lh}(a)}-generic with aGa^{\prime}\in G. By (F.v)(F.v), p(a,n)lh(a)Gp^{(a,n)}\upharpoonright\mathrm{lh}(a)\in G. Work in V[G]V[G]. Let h(n)=(i,j)h(n)=(i,j) and c=predTi(a)c=\mathrm{pred}_{T}^{i}(a). Let

X(c,i)=(X˙(c,i))Glh(c) and X(a,n)=(X˙(a,n))GX^{(c,i)}=\left(\dot{X}^{(c,i)}\right)^{G_{\mathrm{lh}(c)}}\text{ and }X^{(a,n)}=\left(\dot{X}^{(a,n)}\right)^{G}

as well as Z(c,i)=X(c,i)VZ^{(c,i)}=X^{(c,i)}\cap V, Z(a,n)=X(a,n)VZ^{(a,n)}=X^{(a,n)}\cap V. Find rT1(a,n)r\in T_{1}^{(a,n)} with rlh(a)Gr\upharpoonright\mathrm{lh}(a)\in G. As p(a,n)p^{(a,n)} is a mixture of T(a,n)T^{(a,n)}, we have

rp(a,n)lh(r).r\leq p^{(a,n)}\upharpoonright\mathrm{lh}(r).

Let r^=rp(a,n)[lh(r),γ)\hat{r}=r^{\frown}p^{(a,n)}\upharpoonright[\mathrm{lh}(r),\gamma). Note that r^X(a,n)\hat{r}\in X^{(a,n)}, as

p(a,n),T(a,n),GX(a,n)p^{(a,n)},T^{(a,n)},G\in X^{(a,n)}

by (F.vii)(F.vii). Moreover, r^lh(a)G\hat{r}\upharpoonright\mathrm{lh}(a)\in G. Let ˙lh(a)G\mathbb{Q}\coloneqq\dot{\mathbb{Q}}_{\mathrm{lh}(a)}^{G} and

Dμc,a+((D˙ji)Glh(c))MZ(a,n)[f(δ)]MX(a,n)[f(δ)].D\coloneqq\mu_{c,a}^{+}((\dot{D}^{i}_{j})^{G_{\mathrm{lh}(c)}})\in M_{Z^{(a,n)}}[f(\delta)]\subseteq M_{X^{(a,n)}}[f(\delta)].
Subclaim 4.19.

There are ss, YY with

  1. (i)(i)

    X(a,n)YHθV[G]X^{(a,n)}\sqsubseteq Y\prec H_{\theta}^{V[G]},

  2. (ii)(ii)

    sp(a,n)s\leq p^{(a,n)},

  3. (iii)(iii)

    slh(a)Gs\upharpoonright\mathrm{lh}(a)\in G,

  4. (iv)(iv)

    sπY[μX(a,n),Y+(D)]s\in\pi_{Y}[\mu_{X^{(a,n)},Y}^{+}(D)] and

  5. (v)(v)

    YY respects Is(lh(a))I^{\mathbb{Q}}_{s(\mathrm{lh}(a))}.

Proof.

Let

D0{tDπX(a,n)(t)p(a,n)πX(a,n)(t)lh(a)G}D_{0}\coloneqq\{t\in D\mid\pi_{X^{(a,n)}}(t)\leq p^{(a,n)}\wedge\pi_{X^{(a,n)}}(t)\upharpoonright\mathrm{lh}(a)\in G\}

and D1D_{1} be the projection of D0D_{0} onto πX(a,n)1()\pi_{X^{(a,n)}}^{-1}(\mathbb{Q}). Observe that

MX(a,n)[f(δ)]``D1 is dense below πX(a,n)1(p(a,n)(lh(a)) in πX(a,n)1()".M_{X^{(a,n)}}[f(\delta)]\models``D_{1}\text{ is dense below }\pi_{X^{(a,n)}}^{-1}(p^{(a,n)}(\mathrm{lh}(a))\text{ in }\pi_{X^{(a,n)}}^{-1}(\mathbb{Q})".

Applying Lemma 4.17 with (making use of the notation there)

  • =˙\mathbb{P}=\dot{\mathbb{Q}},

  • p=p(a,n)(lh(a))p=p^{(a,n)}(\mathrm{lh}(a)),

  • X=X(a,n)X=X^{(a,n)} and

  • D=D0D=D_{0},

we find some countable YY and some s0s_{0} with

  1. (i)(i)

    X(a,n)YHθV[G]X^{(a,n)}\sqsubseteq Y\prec H_{\theta}^{V[G]},

  2. (ii)(ii)

    s0p(a,n)(lh(a))s_{0}\leq p^{(a,n)}(\mathrm{lh}(a)),

  3. (iii)(iii)

    s0πY[μX(a,n),Y+(D1)]s_{0}\in\pi_{Y}[\mu_{X^{(a,n)},Y}^{+}(D_{1})] and

  4. (iv)(iv)

    YY respects Is0I^{\mathbb{Q}}_{s_{0}}.

By definition of D1D_{1}, there is sp(a,n)s\leq p^{(a,n)} with

  1. (s.i)(s.i)

    slh(a)Gs\upharpoonright\mathrm{lh}(a)\in G,

  2. (s.ii)(s.ii)

    sπY[μX(a,n),Y+(D)]s\in\pi_{Y}[\mu_{X^{(a,n)},Y}^{+}(D)] and

  3. (s.iii)(s.iii)

    s(lh(a))=s0s(\mathrm{lh}(a))=s_{0}.

Y,sY,s have the desired properties.

We can now apply Fact 3.23 in YY and get a nested antichain SX(a,n)S\in X^{(a,n)} with

  1. (S.i)(S.i)

    ss is a mixture of SS,

  2. (S.ii)(S.ii)

    if S0={d}S_{0}=\{d\} then lh(r)lh(d)\mathrm{lh}(r)\leq\mathrm{lh}(d), dlh(r)rd\upharpoonright\mathrm{lh}(r)\leq r and lh(d)\mathrm{lh}(d) is not a limit ordinal and

  3. (S.iii)(S.iii)

    ST(a,n)S\angle\ T^{(a,n)}.

Let X˙\dot{X} be a name for Y[G˙lh(a),lh(d)]Y[\dot{G}_{\mathrm{lh}(a),\mathrm{lh}(d)}] and I˙\dot{I} a name for Is(lh(d))˙lh(d)I^{\dot{\mathbb{Q}}_{\mathrm{lh}(d)}}_{s(\mathrm{lh}(d))}.

Subclaim 4.20.

In V[G]V[G], we have

I˙slh(d)=Islh(d)+1lh(a),lh(d)+1=Is(lh(a)).\dot{I}^{s\upharpoonright\mathrm{lh}(d)}=I^{\mathbb{P}_{\mathrm{lh}(a),\mathrm{lh}(d)+1}}_{s\upharpoonright\mathrm{lh}(d)+1}=I^{\mathbb{Q}}_{s(\mathrm{lh}(a))}.
Proof.

The first equality is simply by definition of I˙\dot{I}. The second equality follows as we preserve old ff-stationary sets along the iteration and since lh(a),lh(d)+1\mathbb{P}_{\mathrm{lh}(a),\mathrm{lh}(d)+1} preserves ff by our inductive hypothesis. ∎

It follows that

Y respects I˙slh(d).Y\text{ respects }\dot{I}^{s\upharpoonright\mathrm{lh}(d)}.

As lh(a)\mathrm{lh}(a) is not a limit ordinal, ()(\ddagger) holds in V[G]V[G], so that lh(a),lh(d)\mathbb{P}_{\mathrm{lh}(a),\mathrm{lh}(d)} is respectful by Lemma 4.10. Thus there is blh(a),lh(d)b\in\mathbb{P}_{\mathrm{lh}(a),\mathrm{lh}(d)}, bslh(d)b\leq s\upharpoonright\mathrm{lh}(d) so that

blh(b)``YˇYˇ[G˙] respects I˙".b\Vdash_{\mathrm{lh}(b)}``\check{Y}\sqsubseteq\check{Y}[\dot{G}]\text{ respects }\dot{I}".

Since blh(a)Gb\upharpoonright\mathrm{lh}(a)\in G, we may assume further that blh(a)ab\upharpoonright\mathrm{lh}(a)\leq a^{\prime}. s,S,X˙,I˙s,S,\dot{X},\dot{I} witness bEb\in E. ∎

To define Tn+1T_{n+1}, fix a maximal antichain AElh(a)A\subseteq E\upharpoonright\mathrm{lh}(a), and for any eAe\in A choose beEb_{e}\in E with belh(a)=eb_{e}\upharpoonright\mathrm{lh}(a)=e. We set sucTn(a)={beeA}\mathrm{suc}_{T}^{n}(a)=\{b_{e}\mid e\in A\}. For any bsucTn(a)b\in\mathrm{suc}_{T}^{n}(a), let S,s,X˙,I˙S,s,\dot{X},\dot{I} witness bEb\in E. We then let

  • p(b,n+1)=s,T(b,n+1)=S,X˙(b,n+1)=X˙,I˙(b,n+1)=I˙p^{(b,n+1)}=s,\ T^{(b,n+1)}=S,\ \dot{X}^{(b,n+1)}=\dot{X},\ \dot{I}^{(b,n+1)}=\dot{I},

  • Z˙(b,n+1)\dot{Z}^{(b,n+1)} be a name for X˙V\dot{X}\cap V and

  • (D˙j(b,n+1))j<ω\left(\dot{D}_{j}^{(b,n+1)}\right)_{j<\omega} be a sequence of names that are forced by bb to enumerate all dense subsets of πZ˙(b,n+1)1()\pi_{\dot{Z}^{(b,n+1)}}^{-1}(\mathbb{P}) in MZ˙(b,n+1)[f(δ)ˇ]M_{\dot{Z}^{(b,n+1)}}\left[\widecheck{f(\delta)}\right].

This finishes the construction.

By Fact 3.23, there is a mixture qq of TT. Let GG be \mathbb{P}-generic with qTq\in T. By Fact 3.25, in V[G]V[G] there is a sequence ann<ω\langle a_{n}\mid n<\omega\rangle so that for all n<ωn<\omega

  1. (a.i)(\vec{a}.i)

    a0=q0a_{0}=q_{0},

  2. (a.ii)(\vec{a}.ii)

    an+1sucTn(an)a_{n+1}\in\mathrm{suc}_{T}^{n}(a_{n}) and

  3. (a.iii)(\vec{a}.iii)

    p(an,n)Gp^{(a_{n},n)}\in G.

For n<ωn<\omega, let αn=lh(an)<γ\alpha_{n}=\mathrm{lh}(a_{n})<\gamma. For n<ωn<\omega we let

Xn(X˙(an,n))GαnX_{n}\coloneqq\left(\dot{X}^{(a_{n},n)}\right)^{G_{\alpha_{n}}}

and also

Xω=n<ωXn[Gαn,γ].X_{\omega}=\bigcup_{n<\omega}X_{n}[G_{\alpha_{n},\gamma}].

Further, for nωn\leq\omega let

ZnXnV and πnπZn.Z_{n}\coloneqq X_{n}\cap V\text{ and }\pi_{n}\coloneqq\pi_{Z_{n}}.

We remark that

Xn[Gαn,γ]Xm[Gαm,γ]HθV[G]X_{n}[G_{\alpha_{n},\gamma}]\sqsubseteq X_{m}[G_{\alpha_{m},\gamma}]\prec H_{\theta}^{V[G]}

follows inductively from (F.vii)(F.vii) and (F.ix)(F.ix) for nm<ωn\leq m<\omega so that XωHθV[G]X_{\omega}\prec H_{\theta}^{V[G]}. We aim to prove that

XXω is f-slim.X\sqsubseteq X_{\omega}\text{ is }f\text{-slim}.

In fact, we will show

  1. (Zω.i)(Z_{\omega}.i)

    XZωX\sqsubseteq Z_{\omega},

  2. (Zω.ii)(Z_{\omega}.ii)

    Zω is f-slimZ_{\omega}\text{ is }f\text{-slim} and

  3. (Zω.iii)(Z_{\omega}.iii)

    πω1[G] is generic over Mω[f(δ)]\pi_{\omega}^{-1}[G]\text{ is generic over }M_{\omega}[f(\delta)],

which implies the above.

Claim 4.21.

Zω=n<ωZnZ_{\omega}=\bigcup_{n<\omega}Z_{n}.

Proof.

``"``\supseteq" is trivial, so we show ``"``\subseteq". Let xZωx\in Z_{\omega} and find i<ωi<\omega with xXi[Gαi,γ]x\in X_{i}[G_{\alpha_{i},\gamma}]. Note that there is x˙Zi\dot{x}\in Z_{i} a \mathbb{P}-name for a set in VV with x=x˙Gx=\dot{x}^{G}. Let DMiD\in M_{i} be the dense set of conditions in πn1()\pi_{n}^{-1}(\mathbb{P}) deciding πi1(x˙)\pi_{i}^{-1}(\dot{x}). There must be some j<ωj<\omega so that

(D˙j(ai,i))G=D.\left(\dot{D}_{j}^{(a_{i},i)}\right)^{G}=D.

Now find nn with h(n)=(i,j)h(n)=(i,j). We then have

p(an+1,n+1)πn[μai,an+1+(D)]p^{(a_{n+1},n+1)}\in\pi_{n}[\mu_{a_{i},a_{n+1}}^{+}(D)]

by (F.xii)(F.xii). We have that p(an+1,n+1)p^{(a_{n+1},n+1)} decides x˙\dot{x} to be some zXnz\in X_{n}, and as p(an+1,n+1)Gp^{(a_{n+1},n+1)}\in G,

x=x˙G=zXnV=Zn.x=\dot{x}^{G}=z\in X_{n}\cap V=Z_{n}.

As XXnX\sqsubseteq X_{n} is f-slimf\text{-slim} by (F.ix)(F.ix) for n<ωn<\omega, (Zω.i)(Z_{\omega}.i) and (Zω.ii)(Z_{\omega}.ii) follow at once. It remains to show (Zω.iii)(Z_{\omega}.iii).
As ZωZ_{\omega} is f-slimf\text{-slim} and by Claim 4.21, we have that

Mω[f(δ)],μn,ω+n<ω=limMn[f(δ)],μn,m+nm<ω\langle M_{\omega}[f(\delta)],\mu_{n,\omega}^{+}\mid n<\omega\rangle=\varinjlim\langle M_{n}[f(\delta)],\mu_{n,m}^{+}\mid n\leq m<\omega\rangle

for some (μn,ω+)n<ω(\mu_{n,\omega}^{+})_{n<\omega}. Let EMω[f(δ)]E\in M_{\omega}[f(\delta)] be dense in πω1()\pi_{\omega}^{-1}(\mathbb{P}). Then for some i,j<ωi,j<\omega, E=μi,ω+(D)E=\mu_{i,\omega}^{+}(D) for

D(D˙j(ai,i))G.D\coloneqq\left(\dot{D}_{j}^{(a_{i},i)}\right)^{G}.

Find nn with h(n)=(i,j)h(n)=(i,j). By (F.xii)(F.xii),

p(an+1,n+1)πn[μi,n+(D)]πω[μi,ω+(D)]=πω[E].p^{(a_{n+1},n+1)}\in\pi_{n}[\mu_{i,n}^{+}(D)]\subseteq\pi_{\omega}[\mu_{i,\omega}^{+}(D)]=\pi_{\omega}[E].

As p(an+1,n+1)Gp^{(a_{n+1},n+1)}\in G, we have Eπω1[G]E\cap\pi_{\omega}^{-1}[G]\neq\emptyset, which is what we had to show. ∎

5 ff-Proper and ff-Semiproper Forcings

Suppose ff witnesses (𝔹)\diamondsuit(\mathbb{B}). We already used the term (X,,f)(X,\mathbb{P},f)-semigeneric which suggests there should be a notion of ff-semiproperness. Indeed there is and it behaves roughly like semiproperness. In fact, there are several other classes associated to ff which mirror well-known forcing classes.

Definition 5.1.

A forcing \mathbb{P} is ff-complete if for any sufficiently large regular θ\theta, for any f-slimf\text{-slim} XHθX\prec H_{\theta} with X\mathbb{P}\in X and any g¯g\subseteq\bar{\mathbb{P}} generic over MX[f(δX)]M_{X}[f(\delta^{X})], there is a some pp\in\mathbb{P} with

pG˙Xˇ=πX[gˇ].p\Vdash\dot{G}\cap\check{X}=\pi_{X}[\check{g}].
Definition 5.2.

A forcing \mathbb{P} is ff-proper if for any sufficiently large regular θ\theta, any f-slimf\text{-slim} XHθX\prec H_{\theta} with X\mathbb{P}\in X and any pXp\in X\cap\mathbb{P}, there is a (X,,f)(X,\mathbb{P},f)-generic condition qpq\leq p, that is a condition qq with

qG˙Xˇ is generic over XˇXˇ[G˙] is fˇ-slim".q\Vdash\dot{G}\cap\check{X}\text{ is generic over }\check{X}\wedge\check{X}[\dot{G}]\text{ is }\check{f}\text{-slim}".
Definition 5.3.

A forcing \mathbb{P} is ff-semiproper if for any sufficiently large regular θ\theta, any f-slimf\text{-slim} XHθX\prec H_{\theta} with X\mathbb{P}\in X and any pXp\in X\cap\mathbb{P}, there is a (X,,f)(X,\mathbb{P},f)-semigeneric condition qpq\leq p.

The following graphic collects all provable relations between the relevant forcing classes.

Classical\diamondsuit-Forcingcomplete(σ\approx\sigma-closed)propersemiproperstationary set preservingω1\omega_{1}-preservingff-completeff-properff-semiproperff-stationary set preservingff-preserving

We also get the expected iteration theorems.

Theorem 5.4.

Any countable support iteration of ff-complete (resp. ff-proper) forcings is ff-complete (resp. ff-proper).

Theorem 5.5.

Any nice iteration of ff-semiproper forcings is ff-semiproper.

The proof is much easier than that of Theorem 4.1, so we omit it.

References

  • [AS85] U. Abraham and S. Shelah. Isomorphism types of aronszajn trees. Israel Journal of Mathematics, 50:75–113, 1985.
  • [JS13] RONALD JENSEN and JOHN STEEL. K without the measurable. The Journal of Symbolic Logic, 78(3):708–734, 2013.
  • [Miy02] Tadatoshi Miyamoto. On iterating semiproper preorders. J. Symbolic Logic, 67(4):1431–1468, 2002.
  • [Miy03] Tadatoshi Miyamoto. A limit stage construction for iterating semiproper preorders. In Proceedings of the 7th and 8th Asian Logic Conferences, pages 303–327. Singapore Univ. Press, Singapore, 2003.
  • [Sch11] Ralf Schindler. On NSω1\operatorname{NS}_{\omega_{1}} being saturated, September 2011. Available online at https://ivv5hpp.uni-muenster.de/u/rds/sat_ideal_even_better_version.pdf.
  • [She98] Saharon Shelah. Proper and improper forcing. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, second edition, 1998.
  • [ST71] R. M. Solovay and S. Tennenbaum. Iterated cohen extensions and souslin’s problem. Annals of Mathematics, 94(2):201–245, 1971.
  • [Tod87] S. Todorčević. Strong Reflections, 1987. Handwritten nores.
  • [Woo10] W. Hugh Woodin. The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal, volume 1 of De Gruyter Series in Logic and its Applications. Walter de Gruyter GmbH & Co. KG, Berlin, revised edition, 2010.