1 Introduction
This article brings together two important threads in forcing iteration theory: variations on revised countable support and Jensen’s subversions of forcing classes. In the first half we pursue a Boolean algebraic approach to iterating subproper and subcomplete forcing notions while preserving certain properties of the forcing notions being iterated. This is based on what has been done in [Reference Jensen14]. In the second half we contrast this approach with one involving nice iterations in the sense of Miyamoto [Reference Miyamoto16]. Here, we use partial preorders and obtain the same iteration and preservation theorems. In this setting, there is a further upshot that we can remove one of the more technical conditions in the definition of subproperness, thus getting an iteration theorem for a (seemingly) more general class of forcing notions. We can similarly omit that condition from the definition of subcomplete forcing notions while maintaining the crucial properties of the forcing class, namely not adding reals, preserving Souslin trees and diamond sequences, and being iterable via nice iterations.
In the final section we provide applications of the theorems from the first two sections, constructing multiple new models of the axiom
$\mathsf {SCFA} $
.
The definitions of the classes of subproper and subcomplete forcing (defined in the next section) result from modifying the definitions of proper and
$\sigma $
-closed forcing in a way we call “subversion”, resulting in properly larger forcing classes which include forcing notions that badly fail to be proper, such as Namba forcing (under
$\mathsf {CH} $
), Příkrý forcing and the forcing to shoot clubs through stationary subsets of
$\kappa \cap \mathrm {cof}(\omega )$
for regular
$\kappa> 2^{\aleph _0}$
, see [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13].
Both classes come with associated forcing axioms and the subcomplete forcing axiom,
$\mathsf {SCFA} $
, which is Martin’s axiom on
$\aleph _1$
for subcomplete forcing is particularly striking as it has much of the strength of
$\mathsf {MM}$
, for instance implying failure of various square principles, see Jensen [Reference Jensen11] and Fuchs [Reference Fuchs3], [Reference Fuchs4], but is consistent with
$\diamondsuit $
. Models of
$\mathsf {SCFA} +\neg \mathsf {CH} $
came up during the investigation of the first author and Minden in [Reference Fuchs and Minden7], and the present paper grew out of discussions relating to this.
The basic issue is as follows. In trying to uncover consequences of
$\mathsf {SCFA} $
one often falls into two situations. Either some consequence of
$\mathsf {MM}$
can be shown to follow already from
$\mathsf {SCFA} $
, usually by simply showing that the forcing used for the
$\mathsf {MM}$
application is actually subcomplete, or else this consequence is incompatible with
$\diamondsuit $
, and hence it cannot follow from
$\mathsf {SCFA} $
. An example for the first type of situation, Jensen’s aforementioned observation that the forcing to shoot a club in ordertype
$\omega _1$
through a stationary subset of
$\kappa \cap \mathrm {cof}(\omega )$
, for regular
$\kappa> 2^\omega $
, is subcomplete, allows one to conclude that
$\mathsf {SCH}$
follows from
$\mathsf {SCFA} $
, [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, Corollary 7.4], using the known arguments based on Martin’s Maximum. As an example for the second type of situation,
$\mathsf {SCFA} $
does not imply Souslin’s hypothesis, since Souslin trees exist in any model with a diamond sequence. Another example is that
$\mathsf {SCFA} $
does not imply that the nonstationary ideal on
$\omega _1$
is saturated (as Martin's Maximum does), again since
$\mathsf {SCFA} $
is compatible with
$\diamondsuit $
, which, in turn, implies the failure of saturation.
The basic question is whether such non-implications are only obstructed by diamond (or
$\mathsf {CH} $
), i.e., is it enough to add the failure of
$\mathsf {CH} $
, say, to
$\mathsf {SCFA} $
to resurrect the consequences of
$\mathsf {MM}$
that are not already consequences of
$\mathsf {SCFA} $
? In short, does
$\mathsf {SCFA} +\neg \mathsf {CH} $
imply
$\mathsf {MM}$
?
Of course, we did not expect the answer to this question to be affirmative, but the fact that this was a question illustrates how little we knew about models of
$\mathsf {SCFA} +\neg \mathsf {CH} $
.
In the final section we will apply our iteration theorems to produce various models of
$\mathsf {SCFA} +\neg \mathsf {CH} $
with different constellations of cardinal characteristics of the continuum inconsistent with
$\mathsf {MM}$
, thus answering the provocative question above in the negative, as expected. This is also interesting on its own right, since it shows that there are strong forcing axioms compatible with various constellations of cardinal characteristics of the continuum often studied in set theory of the reals. A sampling of results along this line is given below.
Theorem 1.1. Assuming the consistency of a supercompact cardinal the following are consistent with
$\mathsf {SCFA} + \neg \mathsf {CH} $
.
-
(1) Souslin’s Hypothesis fails.
-
(2)
$\mathfrak {d} < \mathfrak {c}$
. -
(3)
$\mathsf {MA}_{\aleph _1} (\sigma \mathrm {-linked})$
holds while
$\mathsf {MA}_{\aleph _1}$
fails.
The key to proving these results is the proof of iteration theorems for these classes. Specifically we show that certain iterations of subproper forcing notions preserving a fixed Souslin tree S preserve S, that certain iterations of
${}^\omega \omega $
-bounding subproper forcing notions are
${}^\omega \omega $
-bounding and that certain iterations of subproper forcing notions not adding branches through a fixed
$\omega _1$
-tree T do not add branches through T. We can then, starting in a model with a supercompact cardinal, run the usual argument, based on Baumgartner’s construction of a model of the proper forcing axiom, to produce a model of the forcing axiom for the relevant forcing class. For example, if we do this for the class of subproper forcing notions that preserve a particular Souslin tree S, then in the resulting model, there obviously is a Souslin tree, and
$\mathsf {CH} $
fails, because Cohen forcing is in the class, and
$\mathsf {SCFA} $
holds, since every subcomplete forcing preserves Souslin trees. So this will be a model of
$\mathsf {SCFA} +\neg \mathsf {CH} $
in which Souslin’s Hypothesis fails.
We prove these iteration theorems in two different ways. First using RCS iterations, generalizing Jensen’s techniques, and second with nice iterations in the sense of Miyamoto, [Reference Miyamoto16], who carried out these arguments in the context of semiproper forcing. In the latter case we drop a technical condition on the definition of subproper and subcomplete forcing. We dub these classes
$\infty $
-subproper and
$\infty $
-subcomplete forcing notions. We feel both proofs of the iteration theorems give information and perspective the other does not. It also sheds light on the difference between different styles of RCS iterations in this novel context. Since the precise relationship between RCS iterations and nice iterations is still not completely understood this may be of independent interest.
As such this article is broken into two parts. In Section 2, we treat RCS iterations and develop more fully the theory of nicely subproper iterations. This includes the abovementioned iteration theorems. In Section 3 we reconsider these theorems, this time using nice iterations. We introduce
$\infty $
-subproper and
$\infty $
-subcomplete forcing notions, study their general properties, and we review the machinery of nice iterations needed to prove the iteration theorems in this context. Note that while the two approaches use the same generic word “nice”, it means something very different in Sections 2 and 3. It is simply an unfortunate coincidence that the established terminology in the literature conflicts in this way.
In Section 4, we give the aforementioned applications to the study of forcing axioms, and we conclude with some remarks and open questions in Section 5.
2 RCS iterations
In this section, we will prove preservation theorems for iterations of subproper forcing notions with revised countable support, and variations thereof. We use a definition of subproperness that uses a slightly different Hull Property, following Jensen [Reference Jensen14, Section 4]. It also incorporates a variation mentioned in [Reference Jensen14, Section 4] and is somewhat close to what Jensen would call “very subproper”. Namely, in place of the cardinality of a poset, we use its density, defined as follows.
Definition 2.1. Given a poset
${\mathord {\mathbb P}}$
,
$\delta ({\mathord {\mathbb P}})$
is the smallest cardinal
$\kappa $
such that there is a dense subset of
${\mathord {\mathbb P}}$
that has cardinality
$\kappa $
.
There are other, maybe more natural, measures of the size of a poset, introduced in [Reference Fuchs2]. We could use those as well, and work with the resulting variations of subproperness, but since we don’t have any applications of these variations thus far, we chose not to do so. The density of a partial order is related to its chain condition.
Observation 2.2. For any poset
${\mathord {\mathbb P}}$
,
${\mathord {\mathbb P}}$
is
$\delta ({\mathord {\mathbb P}})^+$
-c.c.
Proof. Let
$A\subseteq {\mathord {\mathbb P}}$
be an antichain, and let
$D\subseteq {\mathord {\mathbb P}}$
be a dense set of cardinality
$\delta ({\mathord {\mathbb P}})$
. Define
$f:A\longrightarrow D$
by choosing, for each
$a\in A$
, an
$f(a)\le a$
with
$f(a)\in D$
. Then f is injective, and hence,
$\mathrm {card}(A)\le \mathrm {card}(D)<\delta ({\mathord {\mathbb P}})^+$
.
The following definition is due to Jensen. The theory
${\mathsf {ZFC}}^-$
results from
$\mathsf {ZFC}$
by dropping the Power Set Axiom and replacing the Replacement Scheme with the Collection Scheme, consisting of all sentences of the form
for any formula
$\varphi (x,y,\vec {z})$
(with the free variables listed) in the language of set theory, where
$u,v$
are variables that don’t occur in
$\varphi $
.
Definition 2.3. A transitive model N of
${\mathsf {ZFC}}^-$
is full if there is an ordinal
$\gamma>0$
such that
$L_\gamma (N)$
satisfies
${\mathsf {ZFC}}^-$
and N is regular in
$L_\gamma (N)$
, meaning that if
$a\in N$
and
$f\in L_\gamma (N)$
is a function
$f:a\longrightarrow N$
, then
$ \mathrm {ran} (f)\in N$
.
We are now ready to state Jensen’s definition of subproperness. Here, when
${\mathord {\mathbb {B}}}$
is a complete Boolean algebra, we use the notation
${\mathord {\mathbb {B}}}^+$
for
${\mathord {\mathbb {B}}}\setminus \{0\}$
. Also, here and in the following, we denote by
$L_\tau ^A$
the structure
$ {\langle L_\tau [A],\in {\restriction } L_\tau [A],A\cap L_\tau [A] \rangle } $
.
Definition 2.4. A complete Boolean algebra
${\mathord {\mathbb {B}}}$
is subproper if every sufficiently large cardinal
$\theta $
verifies the subproperness of
${\mathord {\mathbb {B}}}$
, meaning that the following holds:
${\mathord {\mathbb {B}}}\in H_\theta $
, and if
$\tau>\theta $
is such that
$H_\theta \subseteq N=L_\tau ^A\models \mathsf {ZFC}^-$
, and
$\sigma :{\bar {N}}\prec N$
, where
${\bar {N}}$
is countable, transitive and full, and
${\bar {S}}= {\langle {\bar {\theta }},\bar {\mathbb {B}},{\bar {a}},{\bar {s}},{\bar {\lambda }}_1,\ldots ,{\bar {\lambda }}_n \rangle } \in {\bar {N}}$
,
$S= {\langle \theta ,{\mathord {\mathbb {B}}},a,s,\lambda _1,\ldots ,\lambda _n \rangle } =\sigma ({\bar {S}})$
, where
$a\in {\mathord {\mathbb {B}}}^+$
and
$\lambda _i>\delta ({\mathord {\mathbb {B}}})$
is regular, for
$1\le i\le n$
, then there is a
$c\in {\mathord {\mathbb {B}}}^+$
such that
$c\le a$
and such that whenever
$G\subseteq {\mathord {\mathbb {B}}}$
is generic with
$c\in G$
, then there is a
$\sigma '\in \mathrm {V}[G]$
such that
-
(a)
$\sigma ':{\bar {N}}\prec N$
. -
(b)
$\sigma '({\bar {S}})=\sigma ({\bar {S}})$
. -
(c)
$(\sigma ')^{-1}"G$
is
$\bar {\mathbb {B}}$
-generic over
${\bar {N}}$
. -
(d) Letting
${\bar {\lambda }}_0= \mathrm {On} \cap {\bar {N}}$
, for all
$i\le n$
, we have that
$\sup (\sigma ')"{\bar {\lambda }}_i=\sup \sigma "{\bar {\lambda }}_i$
.
Our definition differs slightly from that used in [Reference Jensen14], in that we don’t require
$\tau $
(in the notation of the definition) to be regular. This ensures that the resulting definition is locally based, in the sense of [Reference Jensen11, Section 2, p. 6], and is in line with the definition of subcompleteness employed by Jensen in [Reference Jensen11, p. 3]. There are several ways of defining subproperness directly for posets rather than complete Boolean algebras, but since we are going to work with complete Boolean algebras here, the definition given will do. We will return to the poset definition in Section 3. Jensen has sometimes employed a slight strengthening of condition (d) above. We will also return to this later.
2.1 The subproperness extension lemma
The iteration theorems in this section are based on one main lemma, which we will prove here. It is based on what Jensen calls the One Step Lemma, but slightly more abstract. We call it the Subproperness Extension Lemma, in analogy to the context of proper forcing. In order to formulate it, we need some terminology regarding iterated forcing using the Boolean algebraic approach.
If
${\mathord {\mathbb {B}}}$
is a complete Boolean algebra, then we write
$\mathbb {A}\subseteq {\mathord {\mathbb {B}}}$
to express that
$\mathbb {A}$
is a complete subalgebra of
${\mathord {\mathbb {B}}}$
, meaning that
$\mathbb {A}$
is a complete Boolean algebra, and furthermore, that for
$X\subseteq \mathbb {A}$
,
$\bigvee ^{\mathbb {A}} X=\bigvee ^{\mathord {\mathbb {B}}} X$
and
$\bigwedge ^{\mathbb {A}} X=\bigwedge ^{\mathord {\mathbb {B}}} X$
. In this situation, the retraction
$h_{{\mathord {\mathbb {B}}},\mathbb {A}}:{\mathord {\mathbb {B}}}\longrightarrow \mathbb {A}$
is defined by
Further, if
$G_0\subseteq \mathbb {A}$
is a generic filter, then
$G_0$
generates the filter
$G=\{b\in {\mathord {\mathbb {B}}}\;|\;\exists a\in G_0\ a\le b\}$
on
${\mathord {\mathbb {B}}}$
, and writing
$b\Rightarrow c$
for
$\neg b\lor c$
, G induces an equivalence relation on
${\mathord {\mathbb {B}}}$
defined by identifying b and
$b'$
iff
$(b\Rightarrow b')\land (b'\Rightarrow b)\in G$
. We write
$b/G_0$
for the equivalence class of b under that equivalence relation, and we write
${\mathord {\mathbb {B}}}/G_0$
for the factor algebra. The ordering on
${\mathord {\mathbb {B}}}/G_0$
is given by
$b/G_0\le _{{\mathord {\mathbb {B}}}/G_0}c/G_0$
iff
$(b\Rightarrow c)\in G$
. We write
$\dot {G}_{\mathbb {A}}$
for the canonical name for the
$\mathbb {A}$
-generic ultrafilter. Here and in the following, when stating lemmas and theorems with multiple assumptions and conclusions, we will try to stick to the convention of numbering the assumptions
$(A1)-(Am)$
and the conclusions
$(C1)-(Cn)$
.
Lemma 2.5 (Subproperness Extension Lemma).
Let
${\mathord {\mathbb {B}}}$
be a complete Boolean algebra, and let
$\mathbb {A}\subseteq {\mathord {\mathbb {B}}}$
be a complete subalgebra of
${\mathord {\mathbb {B}}}$
. Let
$h=h_{\mathbb {A}}:{\mathord {\mathbb {B}}}\longrightarrow \mathbb {A}$
be the retraction. Let
$\delta =\delta ({\mathord {\mathbb {B}}})$
. Suppose that
$\Vdash _{\mathbb {A}}$
“
$\check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}}$
is subproper, as verified by
$\check {\theta }$
,” where
${\mathord {\mathbb {B}}}\in H_\theta $
. Let
$N=L_\tau ^A$
be a
${\mathsf {ZFC}}^-{}$
model with
$H_\theta \subseteq N$
and
$\theta <\tau $
, and let
${\bar {N}}$
be countable, transitive and full. Let
${\bar {S}}= {\langle {\bar {\theta }},\bar {\mathbb {A}},\bar {{\mathord {\mathbb {B}}}},{\bar {s}},{\bar {\lambda }}_1,\ldots ,{\bar {\lambda }}_n \rangle } \in {\bar {N}}$
, and
$S= {\langle \theta ,\mathbb {A},{\mathord {\mathbb {B}}},s,\lambda _1,\ldots ,\lambda _n \rangle } \in N$
, where
$\delta <\lambda _i$
is regular, for
$1\le i\le n$
. Let
$\dot {\sigma }_0$
,
$\dot {t}$
,
$\dot {\bar {b}}$
and
$\dot {b}$
be
$\mathbb {A}$
-names, and let
$a\in \mathbb {A}^+$
be a condition that forces with respect to
$\mathbb {A}$
:
-
(A1)
$\dot {\sigma }_0:\check {{\bar {N}}}\prec \check {N}$
, -
(A2)
$\dot {\sigma }_0(\check {{\bar {S}}})=\check {S}$
(so
$\bar {\mathbb {A}}$
and
$\bar {{\mathord {\mathbb {B}}}}$
are complete Boolean algebras in
${\bar {N}}$
), -
(A3)
$\dot {t}\in \check {{\bar {N}}}$
,
$\dot {{\bar {b}}}\in \check {\bar {{\mathord {\mathbb {B}}}}}$
,
$\dot {b}\in \check {{\mathord {\mathbb {B}}}}$
, and
$\check {h}(\dot {b})\in \dot {G}_{\mathbb {A}}$
, -
(A4)
$\dot {\sigma }_0^{-1}"\dot {G}_{\mathbb {A}}$
is
$\check {{\bar {N}}}$
-generic for
$\bar {\mathbb {A}}$
, -
(A5)
$\dot {\sigma }_0(\dot {\bar {b}})=\dot {b}$
.
Then there are a condition
$c\in {\mathord {\mathbb {B}}}^+$
such that
$h(c)=a$
and a
${\mathord {\mathbb {B}}}$
-name
$\dot {\sigma }_1$
such that whenever I is
${\mathord {\mathbb {B}}}$
-generic with
$c\in I$
, letting
$\sigma _1=\dot {\sigma }_1^I$
,
$G=I\cap \mathbb {A}$
and
$\sigma _0=\dot {\sigma }_0^G$
, the following conditions hold:
-
(C1)
$\sigma _1:{\bar {N}}\prec N$
, -
(C2)
$\sigma _1({\bar {S}})=S$
, -
(C3)
$\sigma _1(\dot {t}^G)=\sigma _0(\dot {t}^G)$
, -
(C4)
$\sigma _1(\dot {\bar {b}}^G)=\sigma _0(\dot {\bar {b}}^G)=\dot {b}^G$
, -
(C5)
$\dot {b}^G\in I$
, -
(C6)
${\sigma _1}^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}$
-generic over
$\bar {N}$
, -
(C7) Letting
${\bar {\lambda }}_0= \mathrm {On} \cap {\bar {N}}$
, for all
$i\le n$
,
$\sup \sigma _0"{\bar {\lambda }}_i=\sup \sigma _1"{\bar {\lambda }}_i$
.
Proof. We follow the proof of [Reference Jensen12, Section 2, Lemma 2]. Let G be any
$\mathbb {A}$
-generic filter with
$a\in G$
. Then in
$\mathrm {V}[G]$
,
${\mathord {\mathbb {B}}}/G$
is subproper, as verified by
$\theta $
. Let
$t=\dot {t}^{G}$
,
$\bar {b}=\dot {\bar {b}}^G$
,
$b=\dot {b}^G$
and
$\sigma _0=\dot {\sigma }_0^{G}$
. Then
$\sigma _0:{\bar {N}}\prec N$
,
$\sigma _0({\bar {S}})=S$
,
$h(b)\in G$
,
$t\in {\bar {N}}$
and
${\bar {G}}=\sigma _0^{-1}"G$
is
${\bar {N}}$
-generic for
$\mathbb {A}$
. Let
be the unique embedding extending
$\sigma _0$
such that
$\sigma _0^*({\bar {G}})=G$
.
We have that
$H_\theta ^{V[G]}=H_\theta [G]\subseteq N[G]$
, and
${\bar {N}}[{\bar {G}}]$
is full in
$\mathrm {V}[G]$
. We also have that
$b/G\neq 0$
. To see this, note that since
$b\in \mathrm {V}$
, it makes sense to write
$b=\check {b}^G$
. By [Reference Jensen12, p. 91, Fact 3], we know that
. So, since
$h(b)\in G$
, this means that
, which means precisely that
$b/G\neq 0$
.
So, since
${\mathord {\mathbb {B}}}/G$
is subproper in
$\mathrm {V}[G]$
, there is a condition
$d\in {\mathord {\mathbb {B}}}/G$
with
$d\le b/G$
such that whenever H is generic for
${\mathord {\mathbb {B}}}/G$
over
$\mathrm {V}[G]$
with
$d\in H$
, then in
$\mathrm {V}[G][H]$
, there is an elementary embedding
$\sigma ':{\bar {N}}[{\bar {G}}]\prec N[G]$
with
$\sigma '({\bar {S}})=S$
,
${\bar {H}}=(\sigma ')^{-1}"H$
is
$\bar {{\mathord {\mathbb {B}}}}/{\bar {G}}$
-generic over
${\bar {N}}[{\bar {G}}]$
and for all
$i\le n$
,
$\sup \sigma ^*_0"{\bar {\lambda }}_i=\sup \sigma '"{\bar {\lambda }}_i$
. We may moreover insist that
$\sigma '$
maps any finite list of members of
${\bar {N}}[{\bar {G}}]$
the same way
$\sigma _0^*$
does. Thus, we require that
$\sigma '(t)=\sigma ^*_0(t)$
,
$\sigma '(\bar {b})=\sigma _0^*(\bar {b})=b$
and
$\sigma '({\bar {G}})=\sigma _0^*({\bar {G}})=G$
.
Let us temporarily fix such an H, and let
$I=G*H$
. Let
$\sigma _1=\sigma '{\restriction }{\bar {N}}$
. It follows that
$\sigma '(\tau ^{\bar {G}})=(\sigma _1(\tau ))^G$
, for
$\tau \in {\bar {N}}^{\bar {\mathbb {A}}}$
, since
$\sigma '({\bar {G}})=G$
.
Then
$\sigma '$
, G and I clearly satisfy conditions (C1), (C2), (C3), (C4), (C5), and (C7) above.
It follows also that (C6) is satisfied, that is,
${\bar {I}}=\sigma _1^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}$
-generic over
${\bar {N}}$
: since
${\bar {G}}$
is
$\bar {\mathbb {A}}$
-generic over
${\bar {N}}$
and
${\bar {H}}$
is
$\bar {\bar {\mathbb {B}}}/{\bar {G}}$
-generic over
${\bar {N}}[{\bar {G}}]$
, it follows that
$\bar {G}*\bar {H}$
is
$\bar {{\mathord {\mathbb {B}}}}$
-generic over
${\bar {N}}$
. But, for
$\bar {c}\in \bar {{\mathord {\mathbb {B}}}}$
, we have that
$\bar {c}\in \bar {G}*\bar {H}$
iff
$\bar {c}/\bar {G}\in \bar {H}$
iff
$\sigma '(\bar {c}/\bar {G})=\sigma _1(\bar {c})/G\in H$
iff
$\sigma _1(\bar {c})\in G*H=I$
. Thus,
$\bar {G}*\bar {H}=\sigma _1^{-1}"I={\bar {I}}$
is
$\bar {{\mathord {\mathbb {B}}}}$
-generic over
${\bar {N}}$
, as claimed.
So there are a name
$\pi $
in
$\mathrm {V}[G]^{{\mathord {\mathbb {B}}}/G}$
with
$\sigma _1=\pi ^H$
and a condition
$d\in ({\mathord {\mathbb {B}}}/G)^+$
that forces over
$\mathrm {V}[G]$
with respect to
${\mathord {\mathbb {B}}}/G$
that
$\pi $
has the properties listed.
Now, all of this is true in
$\mathrm {V}[G]$
whenever G is
$\mathbb {A}$
-generic over
$\mathrm {V}$
, with
$a\in G$
, and so, there are names
$\dot {d},\dot {\pi }\in \mathrm {V}^{\mathbb {A}}$
such that
$d=\dot {d}^{G}$
and
$\pi =\dot {\pi }^G$
, and a forces the situation described. Let
$\dot {\sigma }_1$
be a
${\mathord {\mathbb {B}}}$
-name such that
$\dot {\sigma }_1^{G*H}=(\dot {\pi }^G)^H=\sigma _1$
.
The only thing that’s missing is the condition
$c\in {\mathord {\mathbb {B}}}$
with
$h(c)=a$
such that whenever
$c\in I$
, I is
${\mathord {\mathbb {B}}}$
-generic over
$\mathrm {V}$
,
$G=I\cap \mathbb {A}$
and
$\sigma _1=\dot {\sigma }_1^I$
, and
$\sigma _0=\dot {\sigma }_0^G$
, it follows that (C1)–(C7) hold. To find the desired condition, first note that we may choose the name
$\dot {d}$
in such a way that
$\Vdash _{\mathbb {A}}\dot {d}\in \check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}}$
and
. Namely, given the original
$\dot {d}$
such that a forces that
$\dot {d}\in (\check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}})^+$
and all the other statements listed above, there are two cases: if
$a= {1\mathrm {\hspace {-0.5ex}l}} _{\mathbb {A}}$
, then since
, it already follows that
and
$\Vdash _{\mathbb {A}}\dot {d}\in \check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}}$
. If
$a< {1\mathrm {\hspace {-0.5ex}l}} _{\mathbb {A}}$
, then let
$\dot {e}\in \mathrm {V}^{\mathbb {A}}$
be a name such that
$\Vdash _{\mathbb {A}}\dot {e}=0_{\check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}}}$
, and mix the names
$\dot {d}$
and
$\dot {e}$
to get a name
$\dot {d}'$
such that
$a\Vdash _{\mathbb {A}}\dot {d}'=\dot {d}$
and
$\neg a\Vdash _{\mathbb {A}}\dot {d}'=\dot {e}$
. Then
$\dot {d}'$
is as desired. Clearly,
$\Vdash _{\mathbb {A}}\dot {d}'\in \check {{\mathord {\mathbb {B}}}}/\dot {G}_{\mathbb {A}}$
. Since
$a\Vdash _{\mathbb {A}}\dot {d}'=\dot {d}$
, it follows that
, and since
$\neg a\Vdash _{\mathbb {A}}\dot {d'}=\dot {e}$
, it follows that
, so
. So we could replace
$\dot {d}$
with
$\dot {d}'$
.
Then, by [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, Section 0, Fact 4],Footnote
1
there is a unique
$c\in {\mathord {\mathbb {B}}}$
such that
$\Vdash _{\mathbb {A}}\check {c}/\dot {G}_{\mathbb {A}}=\dot {d}$
, and it follows by [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, Section 0, Fact 3] that
as wished.
2.2 RCS and nicely subproper iterations
We adopt Jensen’s approach to RCS iterations. Thus, an iteration of length
$\alpha $
is a sequence
${\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
of complete Boolean algebras such that for
$i\le j<\alpha $
,
${\mathord {\mathbb {B}}}_i\subseteq {\mathord {\mathbb {B}}}_j$
, and such that if
$\lambda <\alpha $
is a limit ordinal, then
${\mathord {\mathbb {B}}}_\lambda $
is generated by
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i$
, meaning that
${\mathord {\mathbb {B}}}_\lambda $
is the completion of the collection of all infima and suprema of subsets of
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i$
. In this setting,
$\vec {b}={\langle b_i\;|\;}{i<\lambda \rangle }$
is a thread in
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
if for every
$i\le j<\lambda $
,
$b_i=h_{{\mathord {\mathbb {B}}}_j,{\mathord {\mathbb {B}}}_i}(b_j)$
and
$b_j\neq 0$
.
${\mathord {\mathbb {B}}}_\lambda $
is an inverse limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
if for every thread
$\vec {b}$
in
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
,
$b^*:=\bigwedge _{i<\lambda }^{{\mathord {\mathbb {B}}}_\lambda }b_i\neq 0$
, and if the set of such
$b^*$
is dense in
${\mathord {\mathbb {B}}}_\lambda $
. This characterizes
${\mathord {\mathbb {B}}}_\lambda $
up to isomorphism. If
${\langle \xi _i\;|\;}{i<{\bar {\lambda }}\rangle }$
is monotone and cofinal in
$\lambda $
and
$\vec {b}={\langle b_i\;|\;}{i<{\bar {\lambda }}\rangle }$
is such that for every
$i<{\bar {\lambda }}$
,
$b_i\in {\mathord {\mathbb {B}}}_{\xi _i}$
and for every
$i\le j<{\bar {\lambda }}$
,
$h_{{\mathord {\mathbb {B}}}_{\xi _j},{\mathord {\mathbb {B}}}_{\xi _i}}(b_j)=b_i$
, then we will consider
$\vec {b}$
to be a thread in
$\vec {B}{\restriction }\lambda $
as well, since it gives rise to a thread
$\vec {c}={\langle c_i\;|\;}{i<\lambda \rangle }$
in the original sense via the definition
$c_i=h_{{\mathord {\mathbb {B}}}_{\xi _j},{\mathord {\mathbb {B}}}_i}(b_j)$
where j is such that
$\xi _j\ge i$
, and vice versa, the restriction of a thread in the original sense to a cofinal index set determines the entire thread, so that these two notions are equivalent. If
${\vec {{\mathord {\mathbb {B}}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
is an iteration as above, then
$\alpha $
is the length of
${\vec {{\mathord {\mathbb {B}}}}}$
.
The direct limit takes
${\mathord {\mathbb {B}}}_\lambda $
as the minimal completion of
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i$
and is characterized by the property that
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i\setminus \{0\}$
is dense in
${\mathord {\mathbb {B}}}_\lambda $
. Another way of looking at it is that it is generated by the eventually constant threads.
The RCS limit is defined as the inverse limit, except that only RCS threads
$\vec {b}$
are used:
$\vec {b}={\langle b_i\;|\;}{i<\lambda \rangle }$
is an RCS thread in
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
if it is a thread in
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
and there is an
$i<\lambda $
such that either, for all
$j<\lambda $
with
$i\le j$
,
$b_i=b_j$
, or
$b_i\Vdash _{{\mathord {\mathbb {B}}}_i} \mathrm {cf} (\check {\lambda })=\check {\omega }$
.
Definition 2.6. Let
$\vec {{\mathord {\mathbb {B}}}}$
be an iteration of length
$\alpha $
.
Then
${\vec {{\mathord {\mathbb {B}}}}}$
is direct if for every
$i+1<\alpha $
,
${\mathord {\mathbb {B}}}_i\neq {\mathord {\mathbb {B}}}_{i+1}$
.
It is standard if it is direct and for every
$i+1<\alpha $
, letting
$\delta _i=\delta ({\mathord {\mathbb {B}}}_i)$
,
$\Vdash _{{\mathord {\mathbb {B}}}_{i+1}}\mathrm {card}(\check {\delta }_i)\le \omega _1$
.
It is an RCS iteration if for every limit
$\lambda $
,
${\mathord {\mathbb {B}}}_\lambda $
is the RCS limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
.
Let
$\Gamma =\{{\mathord {\mathbb {B}}}\;|\;\varphi _\Gamma ({\mathord {\mathbb {B}}},p)\}$
be a class of complete Boolean algebras (defined by some formula
$\varphi _\Gamma $
in some parameter p).
Then an iteration
${\vec {{\mathord {\mathbb {B}}}}}$
is an iteration of forcings in
$\Gamma $
if for every
$i+1<\alpha $
,
$\Vdash _{{\mathord {\mathbb {B}}}_i}$
“
$\check {{\mathord {\mathbb {B}}}}_{i+1}/\dot {G}_i\in \Gamma $
,” (i.e.,
$\Vdash _{{\mathord {\mathbb {B}}}_i}\varphi _\Gamma ({\mathord {\mathbb {B}}}_{i+1}/\dot {G}_i,\check {p})$
).
$\Gamma $
is standard RCS iterable if whenever
${\vec {{\mathord {\mathbb {B}}}}}$
is a standard RCS iteration of forcings in
$\Gamma $
, then for every
$h\le i<\alpha $
, if
$G_h$
is generic for
${\mathord {\mathbb {B}}}_h$
, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_i/G_h\in \Gamma $
(i.e.,
$\varphi _\Gamma ({\mathord {\mathbb {B}}}_i/G_h,p)$
holds in
$\mathrm {V}[G_h]$
).
In the context of a given iteration
$\vec {{\mathord {\mathbb {B}}}}$
as above, if
$i<\alpha $
and
$b\in {\mathord {\mathbb {B}}}_j$
, for some
$j<\alpha $
, we’ll just write
$h_i(b)$
for
$h_{{\mathord {\mathbb {B}}}_j,{\mathord {\mathbb {B}}}_i}(b)$
. We’ll write
$\mathrm {lh}(\vec {{\mathord {\mathbb {B}}}})=\alpha $
, the length of the iteration. The following fact summarizes the basic properties of RCS iterations.
Fact 2.7 [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, p. 142].
Let
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
be an RCS iteration.
-
(1) If
$\lambda <\alpha $
and
$ \mathrm {cf} (\lambda )=\omega $
, then
${\mathord {\mathbb {B}}}_\lambda $
is the inverse limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
. -
(2) If
$\lambda <\alpha $
and for every
$i<\lambda $
,
$\Vdash _{{\mathord {\mathbb {B}}}_i} \mathrm {cf} (\check {\lambda })>\omega $
, then
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i$
is dense in
${\mathord {\mathbb {B}}}_\lambda $
(that is,
${\mathord {\mathbb {B}}}_\lambda $
is formed using only eventually constant threads, making it the direct limit). -
(3) If
$i<\lambda $
and G is
${\mathord {\mathbb {B}}}_i$
-generic, then the above are true in
$\mathrm {V}[G]$
about the iteration
${\langle {\mathord {\mathbb {B}}}_{i+j}/G\;|\;}{j<\alpha -i\rangle }$
.
The following fact gives us some information about the chain conditions satisfied by direct limits in an iteration.
Fact 2.8 (Baumgartner, see [Reference Viale, Audrito and Steila18, Theorem 3.13]).
Let
${\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\lambda \rangle }$
be an iteration such that for every
$\alpha <\lambda $
,
${\mathord {\mathbb {B}}}_\alpha $
is
${<}\lambda $
-c.c., and such that the set of
$\alpha <\lambda $
such that
${\mathord {\mathbb {B}}}_\alpha $
is the direct limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\alpha $
is stationary. Then the direct limit of
$\vec {{\mathord {\mathbb {B}}}}$
is
${<}\lambda $
-c.c.
A variation of the RCS iteration theorem for subproper forcing [Reference Jensen14, Section 4, p. 2, Theorem 5] says:
Theorem 2.9 (Jensen).
The class of complete subproper Boolean algebras is standard RCS iterable.
In detail, Jensen proved the version of this theorem for subcomplete forcing in [Reference Jensen14, Section 3, Theorem 2], and states that the version for subproper forcing can be reproven easily (see [Reference Jensen14, Section 4, p. 19]).
Jensen [Reference Jensen10] uses a more flexible notion of iteration of subcomplete forcing notions, and an elegant proof of a generalization of the main iteration theorem of that work is given in [Reference Jensen14]. We follow the latter presentation here, albeit in the context of subproper forcing. The following is a version of [Reference Jensen14, Section 3, p. 9] translated from the subcomplete to the subproper context. We also work with
$\delta ({\mathord {\mathbb {B}}}_i)$
rather than
$\mathrm {card}({\mathord {\mathbb {B}}}_i)$
.
Definition 2.10 (after Jensen).
Let
$\Gamma $
be a class of complete Boolean algebras. A standard iteration
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
is nicely
$\Gamma $
if, letting
$\delta _i=\delta ({\mathord {\mathbb {B}}}_i)$
, for
$i<\alpha $
, the following hold:
-
(1) Suppose
$i+1<\alpha $
. Then
$\Vdash _{{\mathord {\mathbb {B}}}_i}\check {{\mathord {\mathbb {B}}}}_{i+1}/\dot {G}_i\in \Gamma $
. -
(2) Suppose
$\lambda <\alpha $
is a limit ordinal of countable cofinality.-
(a) If
$\vec {b}$
is a thread in
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
, then
$\bigwedge _{i<\lambda }b_i\neq 0$
in
${\mathord {\mathbb {B}}}_\lambda $
. -
(b) If for every
$i<\lambda $
,
${\mathord {\mathbb {B}}}_i\in \Gamma $
, then
${\mathord {\mathbb {B}}}_\lambda \in \Gamma $
.
-
-
(3) Suppose that
$\lambda <\alpha $
is a limit ordinal such that for every
$i<\lambda $
,
$\Vdash _{{\mathord {\mathbb {B}}}_i} \mathrm {cf} (\check {\lambda })>\omega $
. Then
$\bigcup _{i<\lambda }{\mathord {\mathbb {B}}}_i$
is dense in
${\mathord {\mathbb {B}}}_\lambda $
, that is,
${\mathord {\mathbb {B}}}_\lambda $
is the direct limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\lambda $
. -
(4) Let
$i<\alpha $
. Then, if
$G_i$
is
${\mathord {\mathbb {B}}}_i$
-generic, (1)-(3) hold in
$\mathrm {V}[G_i]$
for
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\alpha -i\rangle }$
.
Finally, we say that
$\Gamma $
is nicely iterable if whenever
${\vec {{\mathord {\mathbb {B}}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
is a nicely
$\Gamma $
iteration, then for every
$h\le \delta <\alpha $
, if
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_\delta /G_h\in \Gamma $
.
That is, in a nicely
$\Gamma $
iteration, we already know that belonging to
$\Gamma $
propagates to limit stages of countable cofinality, but we have almost no restrictions as to how those limit stages are formed. The following observation shows that iterations of subproper forcing as in Theorem 2.9 are nicely subproper.
Observation 2.11. Every standard RCS iteration of subproper forcings is nicely subproper.
Proof. Let
$i<\alpha $
, and let
$G_i$
be
${\mathord {\mathbb {B}}}_i$
-generic. We have to verify that conditions (1)–(3) of Definition 2.10 hold of
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\alpha -i\rangle }$
in
$\mathrm {V}[G_i]$
.
Condition (1) is trivial: let
$j+1<\alpha -i$
. Since
$\Vdash _{{\mathord {\mathbb {B}}}_{i+j}}\check {{\mathord {\mathbb {B}}}}_{i+j+1}/\dot {G}_{i+j}$
is subproper, it clearly has to be that
$\Vdash _{{\mathord {\mathbb {B}}}_{i+j}/G_i}(\check {{\mathord {\mathbb {B}}}}_{i+j+1}/\check {G}_i)/\dot {G}_{{\mathord {\mathbb {B}}}_{i+j}/\check {G}_i}$
is subproper in
$\mathrm {V}[G_i]$
. It can be shown similarly that
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\alpha -i\rangle }$
is a standard iteration in
$\mathrm {V}[G_i]$
.
For condition (2), let
$\lambda <\alpha -i$
be a limit ordinal that has countable cofinality in
$\mathrm {V}[G_i]$
. By Fact 2.7, part (3), the first two parts of that fact apply to
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\alpha -i\rangle }$
in
$\mathrm {V}[G_i]$
. Thus,
${\mathord {\mathbb {B}}}_\lambda /G_i$
is the inverse limit of
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\lambda \rangle }$
. This implies condition (2)(a). And by Theorem 2.9,
${\mathord {\mathbb {B}}}_\lambda /G_i$
is subproper in
$\mathrm {V}[G_i]$
, so condition (2)(b) holds.
Finally, condition (3) hold because part (2) of Fact 2.7 applies to
${\langle {\mathord {\mathbb {B}}}_{i+j}/G_i\;|\;}{j<\alpha -i\rangle }$
in
$\mathrm {V}[G_i]$
, by part (3) of that fact.
The following is a version of a theorem that Jensen proved for subcomplete forcing in [Reference Jensen14, Section 3, pp. 9–11]. By Observation 2.11, it generalizes Theorem 2.9.
Theorem 2.12 (Jensen).
The class of subproper Boolean algebras is nicely iterable.
Proof. The proof is a virtual repetition of the argument of Jensen’s proof of [Reference Jensen14, Section 4, Theorem 5, pp. 3–12], incorporating the changes necessitated by working with
$\delta ({\mathord {\mathbb {B}}}_i)$
(as in [Reference Jensen14, Section 3, p. 2, Theorem 2]), except that it is somewhat simpler, because the limit of countable cofinality case is vacuous now. We have checked that the proof goes through, and so has Jensen (see [Reference Jensen14, Section 4, last three lines on p. 19]).
2.3 Iterating subproper Souslin tree preserving forcing
The main idea for this section stems from Miyamoto [Reference Miyamoto16, Lemma 5.0], even though we do not employ his “nice iterations” here. In the original setting, a Souslin tree T is fixed, and it is shown that nice limits of nice iterations of semi-proper forcing notions that preserve T also preserve T. The corresponding theorem holds for subproper forcing as well, and one can work with RCS iterations rather than nice iterations too, as we shall show. However, we will first prove a different version of this preservation fact, because we want to establish a proof template that we will reuse in different situations later. The proof of that fact will be slightly more complicated and hence more suitable for these later variations.
Definition 2.13. A forcing notion
${\mathord {\mathbb P}}$
preserves Souslin trees if for every Souslin tree T,
$\Vdash _{\mathord {\mathbb P}}$
“
$\check {T}$
is Souslin.”
The main difference between this concept and the preservation of a fixed Souslin tree, when forming iterations of such forcing notions, is that iterands in an iteration of Souslin tree preserving forcing notions are required to preserve the Souslin trees that may have been added by earlier stages of the iteration, not only one fixed T, or some collection of Souslin trees in the ground model. We will give the proof of the following theorem in considerable detail, in order to establish a point of reference for later variations of the argument.
Theorem 2.14. The class of subproper Boolean algebras that are Souslin tree preserving is standard RCS iterable.
Proof. Let
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
be a standard RCS iteration of forcings that are subproper and Souslin-tree preserving. We prove by induction on
$\delta $
: whenever
$h\le \delta <\alpha $
and
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper and Souslin tree preserving.
It suffices to focus on the Souslin tree preservation, since by Theorem 2.12,
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper in
$\mathrm {V}[G_h]$
whenever
$h\le \delta <\alpha $
and
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic.
The successor case is trivial, as is the case
$h=\delta $
. So let
$\delta $
be a limit ordinal, and let
$h<\delta $
.
Note that by Observation 2.11,
${\vec {{\mathord {\mathbb {B}}}}}$
is nicely subproper. We will use this, rather than that
${\vec {{\mathord {\mathbb {B}}}}}$
is an RCS iteration, whenever possible. Doing so will make it easier to slightly generalize the theorem later.
Case 1: there is an
$i<\delta $
such that
$ \mathrm {cf} (\delta )\le \delta ({\mathord {\mathbb {B}}}_i)$
.
Fix such an i. Then whenever
$i<j<\delta $
,
$\Vdash _j \mathrm {cf} (\check {\delta })\le \omega _1$
. It suffices to prove
-
(A) if
$i<j<\delta $
and
$G_j$
is
${\mathord {\mathbb {B}}}_j$
-generic, then in
$\mathrm {V}[G_j]$
,
${\mathord {\mathbb {B}}}_\delta /G_j$
is Souslin tree preserving.
For if we have done so, then the full claim follows: let
$h\le i$
, and let
$G_h\subseteq {\mathord {\mathbb {B}}}_h$
be generic. By Theorem 2.12, we know that
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper in
$\mathrm {V}[G_h]$
. Thus, it suffices to prove that if T is some Souslin tree in
$\mathrm {V}[G_h]$
and H is
${\mathord {\mathbb {B}}}_\delta /G_h$
-generic over
$\mathrm {V}[G_h]$
, then T is a Souslin tree in
$\mathrm {V}[G_h][H]$
. But letting
$G_{i+1}=(G_h*H)\cap {\mathord {\mathbb {B}}}_{i+1}$
, we know inductively that T is Souslin in
$\mathrm {V}[G_{i+1}]=\mathrm {V}[G_h][G_{i+1}/G_h]$
, and so, by
$(A)$
, T is Souslin in
$\mathrm {V}[G_{i+1}*((G_h*H)/G_{i+1})]=\mathrm {V}[G_h][H]$
.
To prove
$(A)$
, we would now have to fix a
$j<\delta $
, a
$G_j\subseteq {\mathord {\mathbb {B}}}_j$
that’s generic, and a T such that in
$\mathrm {V}[G_j]$
, T is Souslin. We’d have to prove in
$\mathrm {V}[G_j]$
that
${\mathord {\mathbb {B}}}_\delta /G_j$
preserves T as a Souslin tree. But the iteration
${\langle {\mathord {\mathbb {B}}}_{j+i}/G_j\;|\;}{i<\delta -j\rangle }$
is RCS (see Fact 2.7) in
$\mathrm {V}[G_j]$
, and it satisfies everything in
$\mathrm {V}[G_j]$
that we assumed about
${\vec {{\mathord {\mathbb {B}}}}}$
in
$\mathrm {V}$
, with the addition of the fact that in
$\mathrm {V}[G_j]$
,
$ \mathrm {cf} (\delta )\le \omega _1$
.
Thus, it suffices to show:
-
(B) if
$ \mathrm {cf} (\delta )\le \omega _1$
then
${\mathord {\mathbb {B}}}_\delta $
is Souslin tree preserving.
For the argument, carried out in
$\mathrm {V}[G_j]$
would prove
$(A)$
.
Note that by arguing in
$\mathrm {V}[G_j]$
, but pretending
$\mathrm {V}[G_j]$
is
$\mathrm {V}$
, we effectively absorbed T into
$\mathrm {V}$
. It is this step that’s not necessary if one only wants to preserve one fixed ground model Souslin tree.
To prove (B), let us fix a Souslin tree T.
Note that if
$ \mathrm {cf} (\delta )=\omega _1$
, then for every
$i<\delta $
,
$\Vdash _{{\mathord {\mathbb {B}}}_i} \mathrm {cf} (\check {\delta })=\check {\omega }_1$
, as
${\mathord {\mathbb {B}}}_i$
preserves
$\omega _1$
. Thus,
${\mathord {\mathbb {B}}}_\delta $
is the direct limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\delta $
, by part (3) of Definition 2.10, that is,
$\bigcup _{i<\delta }{\mathord {\mathbb {B}}}_i$
is dense in
${\mathord {\mathbb {B}}}_\delta $
in this case. Let us denote this dense set by X.
If, on the other hand,
$ \mathrm {cf} (\delta )=\omega $
, then since
${\vec {{\mathord {\mathbb {B}}}}}$
is an RCS iteration, then we know by Fact 2.7 that the set
$\{\bigwedge _{i<\delta }t_i\;|\;{\langle t_i\;|\;}{i<\delta \rangle }\ \text {is a thread in}\ {\vec {{\mathord {\mathbb {B}}}}}{\restriction }\delta \}$
is dense in
${\mathord {\mathbb {B}}}_\delta $
. In case
$ \mathrm {cf} (\delta )=\omega $
, let X be that dense subset of
${\mathord {\mathbb {B}}}_\delta $
.
Let
$\pi :\omega _1\longrightarrow \delta $
be cofinal, with
$\pi (0)=0$
.
Let
$\dot {A}$
be a
${\mathord {\mathbb {B}}}_\delta $
-name for a maximal antichain in T, and let
$a_0\in X$
be a condition. We will find a countable
$\zeta $
and a condition extending
$a_0$
that forces that
$\dot {A}\subseteq \check {T}|\check {\zeta }$
. Here,
$T|\zeta $
is the union of the levels of T below
$\zeta $
.
Let N be a model of the form
$L_\tau ^{\hat {A}}$
, with
$H_\theta \subseteq N$
, such that
$\theta $
verifies the subproperness of each
${\mathord {\mathbb {B}}}_i$
, for
$i\le \delta $
and
$H_\theta $
is large enough to contain the parameters we need. Specifically, letting
$S= {\langle \theta ,\delta ,\vec {{\mathord {\mathbb {B}}}},X,\dot {A},T,\pi ,a_0 \rangle } $
, we want to fix
$M_0\prec N$
with
$S\in M_0$
,
$M_0$
countable and such that, letting
$\sigma _0:{\bar {N}}\longrightarrow M_0$
be the inverse of the Mostowski collapse (so that
${\bar {N}}$
is transitive),
${\bar {N}}$
is full—it is easy to see that this situation can be arranged; see the discussion following [Reference Fuchs5, Definition 2.21]. Let
${\tilde {\delta }}=\sup (M_0\cap \delta )$
, and let
$\Omega =M_0\cap \omega _1= \mathrm {crit} (\sigma _0)=\omega _1^{\bar {N}}$
. Fix an enumeration
${\langle s_n\;|\;}{n<\omega \rangle }$
of
$T(\Omega )$
, the
$\Omega $
-th level of T.
Let
$\sigma _0^{-1}(S)={\bar {S}}= {\langle {\bar {\theta }},{\bar {\delta }},\vec {\bar {{\mathord {\mathbb {B}}}}},{\bar {X}},\dot {{\bar {A}}},{\bar {T}},{\bar {\pi }},\bar {a}_0 \rangle } $
. Let
${\langle \nu _i\;|\;}{i<\omega \rangle }$
be a sequence of ordinals
$\nu _i<\omega _1^{\bar {N}}$
such that if we let
${\bar {\gamma }}_i={\bar {\pi }}(\nu _i)$
, it follows that
${\langle {\bar {\gamma }}_i\;|\;}{i<\omega \rangle }$
is cofinal in
${\bar {\delta }}$
, and such that
$\nu _0=0$
, so that
${\bar {\gamma }}_0=0$
. Hence, letting
$\gamma _i=\sigma _0({\bar {\gamma }}_i)$
, we have that
$\sup _{i<\omega }\gamma _i=\sup (M_0\cap \delta )={\tilde {\delta }}$
. Moreover, whenever
$\sigma ':{\bar {N}}\prec N$
is such that
$\sigma '({\bar {\pi }})=\pi $
, it follows that for every
$i<\omega $
,
$\sigma '({\bar {\gamma }}_i)=\gamma _i=\pi (\nu _i)$
, since
$\sigma '({\bar {\gamma }}_i)=\sigma '({\bar {\pi }}(\nu _i))=\sigma '({\bar {\pi }})(\nu _i)=\pi (\nu _i)$
.
By induction on
$n<\omega $
, construct sequences
${\langle \dot {\sigma }_n\;|\;}{n<\omega \rangle }$
,
${\langle c_n\;|\;}{n<\omega \rangle }$
,
${\langle \dot {b}_n\;|\;}{n<\omega \rangle }$
and
${\langle \dot {\bar {b}}_n\;|\;}{n<\omega \rangle }$
with
$c_n\in {\mathord {\mathbb {B}}}_{\gamma _n}$
,
$\dot {\sigma }_n,\dot {b}_n,\dot {{\bar {b}}}_n\in \mathrm {V}^{{\mathord {\mathbb {B}}}_{\gamma _n}}$
, such that for every
$n<\omega $
,
$c_n$
forces the following statements with respect to
${\mathord {\mathbb {B}}}_{\gamma _n}$
:
-
(1)
$\dot {\sigma }_n:\check {{\bar {N}}}\prec \check {N}$
, -
(2)
$\dot {\sigma }_n(\check {{\bar {S}}})=\check {S}$
, and for all
$k<n$
,
$\dot {\sigma }_n(\dot {\bar {b}}_k)=\dot {\sigma }_k(\dot {\bar {b}}_k)$
, -
(3)
$\dot {\sigma }_n(\dot {\bar {b}}_n)=\dot {b}_n$
and
$\dot {\bar {b}}_n\in \check {{\bar {X}}}$
(and so,
$\dot {b}_n\in \check {X}$
), -
(4)
$\check {h}_{\gamma _n}(\dot {b}_n)\in \dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _{n}}}$
, -
(5)
$\dot {\sigma }_n^{-1}"\dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _n}}$
is
$\check {{\bar {N}}}$
-generic for
$\check {\bar {{\mathord {\mathbb {B}}}}}_{\gamma _n}$
, -
(6)
$\dot {b}_n/\dot {G}_{\gamma _n}$
forces wrt.
$\check {{\mathord {\mathbb {B}}}_\delta }/\dot {G}_{\gamma _n}$
that there is a node
$t<s_{n-1}$
with
$t\in \dot {A}$
(for
$n>0$
), -
(7)
$c_{n-1}=h_{\gamma _{n-1}}(c_{n})$
(for
$n>0$
), -
(8)
$\dot {b}_n\le _{\check {{\mathord {\mathbb {B}}}}_\delta }\dot {b}_{n-1}$
(for
$n>0$
),
To start off, in the case
$n=0$
, we set
$c_0= {1\mathrm {\hspace {-0.5ex}l}} $
,
$\dot {\sigma }_0=\check {\sigma }_0$
and
$\dot {b}_0=\check {a}_0$
and
$\dot {{\bar {b}}}_0=\sigma _0^{-1}(\dot {b}_0)$
. Clearly then, (1)–(6) are satisfied for
$n=0$
(and (7)–(8), as well as the second part of (2), are vacuous for
$n=0$
).
Now suppose
$m=n-1$
, and
$\dot {\sigma }_l$
,
$c_l$
,
$\dot {b}_l$
and
$\dot {{\bar {b}}}_l$
have been defined so that (1)–(8) are satisfied for
$l\le m$
.
An application of Lemma 2.5 (to
${\mathord {\mathbb {B}}}_{\gamma _m}\subseteq {\mathord {\mathbb {B}}}_{\gamma _n}$
) yields a condition
$c_n\in {\mathord {\mathbb {B}}}_{\gamma _n}$
and a
${\mathord {\mathbb {B}}}_{\gamma _n}$
-name
$\dot {\sigma }_n$
such that
$h_{\gamma _m}(c_n)=c_m$
and whenever I is
${\mathord {\mathbb {B}}}_{\gamma _n}$
-generic over
$\mathrm {V}$
with
$c_n\in I$
,
$G=I\cap {\mathord {\mathbb {B}}}_{\gamma _m}$
and
$\sigma _n=\dot {\sigma }_n^I$
it follows that
$\sigma _n:{\bar {N}}\prec N$
,
$\sigma _n^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}_{{\bar {\gamma }}_n}$
-generic over
${\bar {N}}$
,
$\sigma _n({\bar {S}})=\sigma _m({\bar {S}})$
,
$\sigma _n({\bar {b}}_k)=\sigma _m({\bar {b}}_k)$
for
$k\le m$
, where
$\sigma _m=\dot {\sigma }_m^G$
and for
$k\le m$
,
${\bar {b}}_k=\dot {{\bar {b}}}_k^{I\cap {\mathord {\mathbb {B}}}_{\gamma _k}}$
as well as
$b_k=\dot {b}_k^{I\cap {\mathord {\mathbb {B}}}_{\gamma _k}}$
. Moreover, we can arrange that
$h_{\gamma _n}(\dot {b}_m^G)\in I$
. For this last property, let
$\dot {b}$
from the statement of Lemma 2.5 be a
${\mathord {\mathbb {B}}}_{\gamma _m}$
-name for
$h_{\gamma _n}(\dot {b}_m)$
and
$\dot {{\bar {b}}}$
a name for the preimage of
$b_m$
under
$\sigma _n$
. Since inductively,
$c_m$
forces that
$\check {h}_{\gamma _m}(\dot {b}_m)\in \dot {G}_{\gamma _m}$
, assumption (3) of the lemma is satisfied, and we get that
$h_{\gamma _n}(\dot {b}_m^G)=\dot {b}^G\in I$
, as wished.
With these definitions, all the conditions (1)–(8) are satisfied, as long as they don’t concern
$\dot {b}_n$
and
$\dot {{\bar {b}}}_n$
. To define
$\dot {b}_n$
and
$\dot {{\bar {b}}}_n$
, let I and G as described in the previous paragraph. Let
$\sigma _n=\dot {\sigma }_n^I$
,
$b_m=\dot {b}_m^I$
,
$M_n= \mathrm {ran} (\sigma _n)$
,
${\bar {I}}=\sigma _n^{-1}"I$
,
$\sigma _n^*:{\bar {N}}[{\bar {I}}]\stackrel {\sim }{\longleftrightarrow } M_n[I]\prec N[I]$
with
$\sigma _n\subseteq \sigma _n^*$
and
$\sigma _n^*({\bar {I}})=I$
.
Working in
$\mathrm {V}[I]$
, we know that
$b_m/I$
forces wrt.
${\mathord {\mathbb {B}}}_\delta /I$
that
$\dot {A}/I$
is a maximal antichain in T (since
$b_m\le \dot {b}_0^I=a_0$
). Thus, the set
is dense in T. Note that
$D\in M_n[I]$
. Working in
$M_n[I]$
, let
$A\subseteq D$
be a maximal antichain, so
$A\in M_n[I]$
. Since
${\mathord {\mathbb {B}}}_{\gamma _n}$
preserves T as a Souslin tree, it follows that A is countable in
$M_n[I]$
, and so,
$A\subseteq M_n[I]$
. Since D is dense in T, A is (in
$\mathrm {V}[I]$
) a maximal antichain in T, and
$A\subseteq T|\Omega $
(note that
$ \mathrm {crit} (\sigma _n)=\omega _1^{\bar {N}}=\Omega $
). Hence, there is a
$t\in A$
with
$t<_T s_m$
. Since
$A\subseteq D$
, it follows that
$t\in D$
. Working in
$M_n[I]$
again, let
$b_n\in X$
,
$\bar {t}\le _T t$
witness that
$t\in D$
, i.e.,
$b_n\le _{\delta }b_m$
,
$h_{\gamma _n}(b_n)\in I$
and
$b_n/I$
forces wrt.
${\mathord {\mathbb {B}}}_\delta /I$
that
$\check {\bar {t}}\in \dot {A}/I$
. Let
${\bar {b}}_n=(\sigma ^*_m)^{-1}(b_n)$
.
Since all of this holds in
$\mathrm {V}[I]$
whenever I is
${\mathord {\mathbb {B}}}_{\gamma _n}$
-generic over
$\mathrm {V}$
and
$c_n\in I$
, there are
${\mathord {\mathbb {B}}}_{\gamma _m}$
-names
$\dot {\bar {t}}$
for
$\bar {t}$
and
$\dot {b}_n$
for
$b_n$
such that
$c_n$
forces all of this wrt.
${\mathord {\mathbb {B}}}_{\gamma _n}$
. In particular,
$c_n$
forces that
$\dot {\bar {t}}\in \dot {A}$
and
$\dot {\bar {t}}<_Ts_{m}$
. So (1)–(8) are satisfied. This finishes the recursive construction.
By (7), the sequence
${\langle c_n\;|\;}{c<\omega \rangle }$
is a thread, and so,
$c=\bigwedge _{n<\omega }c_n\in {\mathord {\mathbb {B}}}_\delta ^+$
: if
$ \mathrm {cf} (\delta )=\omega $
, then this follows from part (2)(a) of Definition 2.10. And if
$ \mathrm {cf} (\delta )=\omega _1$
, then
$\gamma :=\sup _{n<\omega }\gamma _n<\delta $
and
$ \mathrm {cf} (\gamma )=\omega $
, so again,
$c\in {\mathord {\mathbb {B}}}_\gamma ^+\subseteq {\mathord {\mathbb {B}}}_\delta ^+$
, for the same reason.
We claim that c forces that
$\dot {A}$
is bounded in
$\check {T}$
. To see this, let G be
${\mathord {\mathbb {B}}}_\delta $
-generic over
$\mathrm {V}$
, with
$c\in G$
. For
$n<\omega $
, let
$b_n=\dot {b}_n^G$
.
-
(C) For all
$n<\omega $
,
$b_n\in G$
.
Proof of (C).
Let
$n<\omega $
. We have that
$h_{\gamma _n}(b_n)\in G\cap {\mathord {\mathbb {B}}}_{\gamma _n}$
, by (4). For every
$l\ge n$
,
$b_l\le b_n$
, by (8), so
$h_{\gamma _l}(b_l)\le h_{\gamma _l}(b_n)$
. Since
$h_{\gamma _l}(b_l)\in G\cap {\mathord {\mathbb {B}}}_{\gamma _l}$
, this implies that for
$l\ge n$
,
This holds for
$l<n$
as well, because in that case,
$h_{\gamma _l}(b_n)\ge h_{\gamma _n}(b_n)\in G$
.
Recall that
${\tilde {\delta }}=\sup _{l<\omega }\gamma _l$
. Let
$M_n= \mathrm {ran} (\sigma _n)$
. It follows that
$\sup (\delta \cap M_n)={\tilde {\delta }}$
(since
$\sigma _n({\bar {\pi }})=\pi $
).
Now, if
$ \mathrm {cf} (\delta )=\omega _1$
, then
${\tilde {\delta }}<\delta $
, and we know that
$b_n\in X=\bigcup _{i<\delta }{\mathord {\mathbb {B}}}_i$
, so there is an
$i<\delta $
such that
$b_n\in {\mathord {\mathbb {B}}}_i$
. But since
$b_n\in M_n$
, the same is true in
$M_n$
, and this means that there is an
$i<{\tilde {\delta }}$
such that
$b_n\in {\mathord {\mathbb {B}}}_i$
. But then, letting
$l>n$
be such that
$\gamma _l>i$
, it follows that
$b_n=h_{\gamma _l}(b_n)\in G\cap {\mathord {\mathbb {B}}}_{\gamma _l}$
, so
$b_n\in G$
, as claimed.
If, on the other hand,
$ \mathrm {cf} (\delta )=\omega $
, then since
$b_n\in X$
, there is a thread
${\langle t_i\;|\;}{i<\delta \rangle }$
in
${\vec {{\mathord {\mathbb {B}}}}}{\restriction }\delta $
such that
$b_n=\bigwedge _{i<\delta }t_i$
. But then, for every
$l<\omega $
,
$t_{\gamma _l}=h_{\gamma _l}(b_n)\in G\cap {\mathord {\mathbb {B}}}_{\gamma _l}\subseteq G$
. By genericity (and thus
$\mathrm {V}$
-completeness) of G, this implies that
$b_n=\bigwedge _{i<\delta }t_i=\bigwedge _{l<\omega }t_{\gamma _l}\in G$
. Note that we used that
${\vec {{\mathord {\mathbb {B}}}}}$
is an RCS iteration here.
Note in particular that
$b_0=a_0\in G$
. Since this is true whenever
$c\in G$
,
$c\Vdash _{{\mathord {\mathbb {B}}}_\delta }\check {a}_0\in \dot {G}$
, which implies that
$c\le a_0$
. Moreover, c forces that
$\dot {A}$
is bounded in
$\check {T}$
: working in
$\mathrm {V}[G]$
again, where
$G\ni c$
is
${\mathord {\mathbb {B}}}_\delta $
-generic, we have that for every
$n<\omega $
, there is a
$t_n\in A=\dot {A}^G$
with
$t_n<_T s_n$
, by (6). So A cannot contain a node a at a level greater than
$\Omega $
, because the predecessor of such an a at level
$\Omega $
would have to be of the form
$s_m$
, for some m, and
$s_m>_Tt_m$
. So
$a,t_m\in A$
would be comparable. Thus, c forces wrt.
${\mathord {\mathbb {B}}}_\delta $
that
$\dot {A}\subseteq \check {T}|\check {\Omega }$
.
Case 2: for all
$i<\delta $
,
$ \mathrm {cf} (\delta )>\delta ({\mathord {\mathbb {B}}}_i)$
.
We may also assume that
$ \mathrm {cf} (\delta )>\omega _1$
, for otherwise,
$ \mathrm {cf} (\delta )\le \omega _1$
and the argument of case 1 goes through (recall that we proved (B)).
It follows as in [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, p. 143, Claim (2)] that for
$i<\delta $
,
$\mathrm {card}(i)\le \delta ({\mathord {\mathbb {B}}}_i)$
. But then, it follows that
$\delta $
is regular, for otherwise, if
$i= \mathrm {cf} (\delta )<\delta $
, it would follow that
$ \mathrm {cf} (\delta )=i\le \delta ({\mathord {\mathbb {B}}}_i)< \mathrm {cf} (\delta )$
.
Thus,
$\delta $
is a regular cardinal, and
$\delta \ge \omega _2$
. Hence,
$S^\delta _{\omega _1}$
, the set of ordinals less than
$\delta $
with cofinality
$\omega _1$
, is stationary in
$\delta $
. For
$\gamma \in S^\delta _{\omega _1}$
, since
${\mathord {\mathbb {B}}}_\gamma $
, being subproper, preserves
$\omega _1$
, it follows that for every
$i<\gamma $
,
$\Vdash _{{\mathord {\mathbb {B}}}_i} \mathrm {cf} (\check {\gamma })>\omega $
. Thus, since
${\vec {{\mathord {\mathbb {B}}}}}$
is nicely subproper, it follows by part (3) of Definition 2.10 that
${\mathord {\mathbb {B}}}_\gamma $
is the direct limit of
${\vec {{\mathord {\mathbb {B}}}}}{\restriction }\gamma $
. Moreover, since for
$i<\delta $
,
$\delta ({\mathord {\mathbb {B}}}_i)<\delta = \mathrm {cf} (\delta )$
, it follows by Observation 2.2 that
${\mathord {\mathbb {B}}}_i$
is
${<}\delta ({\mathord {\mathbb {B}}}_i)^+$
-c.c., and hence
${<}\delta $
-c.c.
It follows by Fact 2.8 that the direct limit of
$\vec {{\mathord {\mathbb {B}}}}{\restriction }\delta $
is
${<}\delta $
-c.c.
Again, since for all
$i<\delta $
,
${\mathord {\mathbb {B}}}_i$
is
${<}\delta $
-c.c., it follows that
${\mathord {\mathbb {B}}}_i$
forces that the cofinality of
$\delta $
is uncountable. So since
${\vec {{\mathord {\mathbb {B}}}}}$
is nicely subproper, it follows that
${\mathord {\mathbb {B}}}_\delta $
is the direct limit of
${\vec {{\mathord {\mathbb {B}}}}}{\restriction }\delta $
, and hence that
${\mathord {\mathbb {B}}}_\delta $
is
${<}\delta $
-c.c.
Now let
$h<\delta $
, let
$G_h\subseteq {\mathord {\mathbb {B}}}_h$
be generic, and let
$T\in \mathrm {V}[G_h]$
be a Souslin tree. We have to show that T is still Souslin in
$\mathrm {V}[G_h][H]$
, whenever
$H\subseteq {\mathord {\mathbb {B}}}_\delta /G_h$
is generic over
$\mathrm {V}[G_h]$
. But if there were an uncountable antichain of T in
$\mathrm {V}[G_h][H]=\mathrm {V}[G_h*H]$
, then since
${\mathord {\mathbb {B}}}_\delta $
is
$\delta $
-c.c. and
$\delta>\omega _1$
, it would follow that this antichain exists already in
$\mathrm {V}[(G_h*H)\cap {\mathord {\mathbb {B}}}_i]$
, for some
$i\in [h,\delta )$
. Thus,
${\mathord {\mathbb {B}}}_i/G_h$
would fail to be Souslin tree preserving in
$\mathrm {V}[G_h]$
, contradicting our inductive assumption.
Definition 2.15. Let T be a Souslin tree and
${\mathord {\mathbb P}}$
a notion of forcing.
${\mathord {\mathbb P}}$
preserves the Souslinness of T if
$\Vdash _{\mathord {\mathbb P}}$
“
$\check {T}$
is Souslin.”
Theorem 2.16. Let T be a Souslin tree. Then the class of subproper Boolean algebras that preserve the Souslinness of T is standard RCS iterable.
Proof. Letting
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
be a standard RCS iteration of forcings that are subproper and preserve T as a Souslin tree, we prove by induction on
$\delta $
: whenever
$h\le \delta <\alpha $
and
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper and preserves T as a Souslin tree.
For this, the proof of Theorem 2.14 goes through almost without change. Some steps of the argument are somewhat simpler in the present context, because the Souslin tree T is in the ground model.
Looking over the proof of Theorem 2.14, one sees that the assumption that the iteration in question uses revised countable support was only used at stages of the iteration that acquire countable cofinality. Thus, we obtain nice iterability results for the corresponding forcing classes.
As before, the previous RCS iteration theorem implies the following.
Observation 2.17. Every standard RCS iteration of subproper and Souslin tree preserving forcings is nicely subproper and Souslin tree preserving. Similarly, if T is a fixed Souslin tree then every standard RCS iteration of subproper and Souslinness of T preserving forcings is nicely subproper and Souslinness of T preserving.
Thus, we can generalize Theorems 2.14 and 2.16 as follows.
Theorem 2.18. The class of subproper and Souslin tree preserving Boolean algebras is nicely iterable, and so is the class of subproper Boolean algebras that preserve some fixed Souslin tree T.
Proof. Recall that in the proof of Theorem 2.14, we used the fact that the iteration was just nicely subproper, rather than an RCS iteration, wherever possible. The only places in the argument that used that we were dealing with an RCS iteration occurred at stages of the iteration that acquired countable cofinality. But these stages are trivial in a nicely subproper T-preserving iteration.
2.4 Nicely subproper iterations of
$[T]$
-preserving forcing
Definition 2.19. Let T be an
$\omega _1$
-tree. Then
$[T]$
denotes the set of cofinal branches of T, that is, the set of branches of T that have order type
$\omega _1$
. We say that a forcing notion
${\mathord {\mathbb P}}$
is
$[T]$
-preserving to express that
${\mathord {\mathbb P}}$
cannot add new cofinal branches through T, that is, that
$\Vdash _{\mathord {\mathbb P}}[\check {T}]\subseteq \check {\mathrm {V}}$
. As with the preservation of a fixed Souslin tree, there is a more general version of this preservation property:
${\mathord {\mathbb P}}$
is branch preserving if for every
$\omega _1$
-tree S,
${\mathord {\mathbb P}}$
is
$[S]$
-preserving.
Theorem 2.20. The class of subproper and branch preserving forcing notions is standard RCS iterable.
Proof. We follow along the lines of the proof of Theorem 2.14. So let
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
be a standard RCS iteration of forcings that are subproper and branch preserving. We prove by induction on
$\delta $
: whenever
$h\le \delta <\alpha $
and
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper and branch preserving.
Case 1:
$\delta $
is a limit ordinal and there is an
$i<\delta $
such that
$ \mathrm {cf} (\delta )\le \delta ({\mathord {\mathbb {B}}}_i)$
.
As before, it suffices to prove
-
(B) if
$ \mathrm {cf} (\delta )\le \omega _1$
then
${\mathord {\mathbb {B}}}_\delta $
adds no cofinal branch to an
$\omega _1$
-tree.
So let us fix an
$\omega _1$
-tree T. Depending on whether the cofinality of
$\delta $
is
$\omega $
or
$\omega _1$
, let
$X=\{\bigwedge _{i<\delta }t_i\;|\;\vec {t}\ \text {is a thread in}\ \vec {{\mathord {\mathbb {B}}}}{\restriction }\delta \}$
or
$X=\bigcup _{i<\delta }{\mathord {\mathbb {B}}}_i$
.
Toward a contradiction, let
$\dot {B}$
be a
${\mathord {\mathbb {B}}}_\delta $
-name such that some condition
$a_0\in X$
forces that
$\dot {B}$
is a new cofinal branch, that is, that
$\dot {B}\notin \mathrm {V}^{{\mathord {\mathbb {B}}}_\gamma }$
for all
$\gamma <\delta $
.
Let
$\pi :\omega _1\longrightarrow \delta $
be cofinal, with
$\pi (0)=0$
. Let
$N=L_\tau ^A$
, with
$H_\theta \subseteq N$
, such that
$\theta $
verifies the subproperness of each
${\mathord {\mathbb {B}}}_i$
, for
$i\le \delta $
. Let
$S= {\langle \theta ,\delta ,\vec {{\mathord {\mathbb {B}}}},X,\dot {B},T,\pi ,a_0 \rangle } $
. Let
$M_0\prec N$
with
$S\in M_0$
,
$M_0$
countable and such that, letting
$\sigma _0:{\bar {N}}\longrightarrow M_0$
be the inverse of the Mostowski collapse, where
${\bar {N}}$
is full. Let
${\tilde {\delta }}=\sup (M_0\cap \delta )$
, and let
$\Omega =M_0\cap \omega _1= \mathrm {crit} (\sigma _0)=\omega _1^{\bar {N}}$
. Fix an enumeration
${\langle s_n\;|\;}{n<\omega \rangle }$
of
$T(\Omega )$
.
Let
$\sigma _0^{-1}(S)={\bar {S}}= {\langle {\bar {\theta }},{\bar {\delta }},\vec {\bar {{\mathord {\mathbb {B}}}}},{\bar {X}},\dot {{\bar {B}}},{\bar {T}},{\bar {\pi }},\bar {a}_0 \rangle } $
. Let
${\langle \nu _i\;|\;}{i<\omega \rangle }$
be a sequence of ordinals
$\nu _i<\omega _1^{\bar {N}}$
such that if we let
${\bar {\gamma }}_i={\bar {\pi }}(\nu _i)$
, it follows that
${\langle {\bar {\gamma }}_i\;|\;}{i<\omega \rangle }$
is cofinal in
${\bar {N}}$
, and such that
$\nu _0=0$
, so that
${\bar {\gamma }}_0=0$
. Let
$\gamma _i=\sigma _0({\bar {\gamma }}_i)$
.
By induction on
$n<\omega $
, construct sequences
${\langle \dot {\sigma }_n\;|\;}{n<\omega \rangle }$
,
${\langle c_n\;|\;}{n<\omega \rangle }$
,
${\langle \dot {b}_n\;|\;}{n<\omega \rangle }$
and
${\langle \dot {\bar {b}}_n\;|\;}{n<\omega \rangle }$
with
$c_n\in {\mathord {\mathbb {B}}}_{\gamma _n}$
,
$\dot {\sigma }_n,\dot {b}_n,\dot {{\bar {b}}}_n\in \mathrm {V}^{{\mathord {\mathbb {B}}}_{\gamma _n}}$
, such that for every
$n<\omega $
,
$c_n$
forces the following statements:
-
(1)
$\dot {\sigma }_n:\check {{\bar {N}}}\prec \check {N}$
, -
(2)
$\dot {\sigma }_n(\check {{\bar {S}}})=\check {S}$
, and for all
$k<n$
,
$\dot {\sigma }_n(\dot {\bar {b}}_k)=\dot {\sigma }_k(\dot {\bar {b}}_k)$
, -
(3)
$\dot {\sigma }_n(\dot {\bar {b}}_n)=\dot {b}_n$
and
$\dot {\bar {b}}_n\in \check {\bar {X}}$
(and so,
$\dot {b}_n\in \check {X}$
), -
(4)
$\check {h}_{\gamma _n}(\dot {b}_n)\in \dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _{n}}}$
, -
(5)
$\dot {\sigma }_n^{-1}"\dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _n}}$
is
$\check {{\bar {N}}}$
-generic for
$\check {\bar {{\mathord {\mathbb {B}}}}}_{\gamma _n}$
, -
(6) for some
$t\in T|\Omega $
with
$t\not <s_{n-1}$
,
$\dot {b}_n$
forces wrt.
${\mathord {\mathbb {B}}}_\delta $
that
$\check {t}\in \dot {B}$
, and in particular,
$\dot {b}_n$
forces that
$\check {s}_{n-1}\notin \dot {B}$
(for
$n>0$
), -
(7)
$c_{n-1}=h_{\gamma _{n-1}}(c_{n})$
(for
$n>0$
), -
(8)
$\dot {b}_n\le _{\check {{\mathord {\mathbb {B}}}}_\delta }\dot {b}_{n-1}$
(for
$n>0$
),
To start off, in the case
$n=0$
, we set
$c_0= {1\mathrm {\hspace {-0.5ex}l}} $
,
$\dot {\sigma }_0=\check {\sigma }_0$
and
$\dot {b}_0=\check {a}_0$
and
$\dot {{\bar {b}}}_0=\sigma _0^{-1}(\dot {b}_0)$
.
Now suppose
$m=n-1$
, and
$\dot {\sigma }_l$
,
$c_l$
,
$\dot {b}_l$
, and
$\dot {{\bar {b}}}_l$
have been defined, so that (1)-(8) are satisfied for
$l\le m$
. An application of Lemma 2.5 (to
${\mathord {\mathbb {B}}}_{\gamma _m}\subseteq {\mathord {\mathbb {B}}}_{\gamma _n}$
) yields
$c_n\in {\mathord {\mathbb {B}}}_{\gamma _n}$
and a
${\mathord {\mathbb {B}}}_{\gamma _n}$
-name
$\dot {\sigma }_n$
such that (1)–(8) are satisfied at level n, as long as they don’t refer to
$\dot {b}_n$
and
$\dot {\bar {b}}_n$
, as before. As before, we can also arrange that
$c_n$
forces that
$\check {h}_{\gamma _n}(\dot {b}_m)\in \dot {G}_{\gamma _n}$
.
To define
$\dot {b}_n$
and
$\dot {{\bar {b}}}_n$
, let I be
${\mathord {\mathbb {B}}}_{\gamma _n}$
-generic with
$c_n\in I$
, and let
$G=I\cap {\mathord {\mathbb {B}}}_{\gamma _m}$
. Let
$\sigma _n=\dot {\sigma }_n^I$
,
$b_m=\dot {b}_m^G$
,
$M_n= \mathrm {ran} (\sigma _n)$
,
${\bar {I}}=\sigma _n^{-1}"I$
,
$\sigma _n^*:{\bar {N}}[{\bar {I}}]\prec M_n[I]$
with
$\sigma _n\subseteq \sigma _n^*$
and
$\sigma _n^*({\bar {I}})=I$
. We have that
$h_{\gamma _n}(b_m)\in I$
.
Working in
$\mathrm {V}[I]$
, we know that
$b_m/I$
forces wrt.
${\mathord {\mathbb {B}}}_\delta /I$
that
$\dot {B}/I$
is a new cofinal branch in
$\check {T}$
(that is, a branch that did not exist in
$\mathrm {V}[I]$
). Consider the set of
$z\in {\mathord {\mathbb {B}}}_{\gamma _n}$
such that there exist
$t_1,t_2\in T$
and
$y_1,y_2\le _\delta b_m$
such that
-
•
$t_1,t_2$
are incomparable in T, -
•
$z=h_{\gamma _n}(y_1)=h_{\gamma _n}(y_2)$
, -
•
$y_1\Vdash _{{\mathord {\mathbb {B}}}_\delta }\check {t}_1\in \dot {B}$
, -
•
$y_2\Vdash _{{\mathord {\mathbb {B}}}_\delta }\check {t}_2\in \dot {B}$
.
Then
$D\in M_n$
, and D is dense in
${\mathord {\mathbb {B}}}_{\gamma _n}$
below
$h_{\gamma _n}(b_m)$
. So there is a
$z\in I\cap D$
, and this is witnessed by some
$t_1,t_2,y_1,y_2$
. Since
$M_n[I]\prec N[I]$
, these objects may be chosen in
$M_n[I]$
. Thus,
$t_1,t_2\in T|\Omega $
. Since
$t_1$
and
$t_2$
are incomparable in T, at most one of them can be below
$s_m$
. Say
$i<2$
is such that
$t_i$
is not below
$s_m$
. Then we can set
$b_n=y_i$
.
Since all of this holds in
$\mathrm {V}[I]$
whenever I is
${\mathord {\mathbb {B}}}_{\gamma _n}$
-generic over
$\mathrm {V}$
and
$c_n\in I$
, there is a
${\mathord {\mathbb {B}}}_{\gamma _n}$
-name
$\dot {b}_n$
for
$b_n$
such that
$c_n$
forces all of this wrt.
${\mathord {\mathbb {B}}}_{\gamma _n}$
. Then (1)–(8) are satisfied. This finishes the recursive construction.
As before, the sequence
${\langle c_n\;|\;}{n<\omega \rangle }$
is a thread, and so,
$c=\bigwedge _{n<\omega }c_n\in {\mathord {\mathbb {B}}}_\delta ^+$
. It follows that
$c\Vdash \dot {b}_n\in \dot {G}_\delta $
, for all
$n<\omega $
. In particular,
$c\le a_0$
. We claim that c forces that
$\dot {B}$
is bounded in
$\check {T}$
. To see this, let G be
${\mathord {\mathbb {B}}}_\delta $
-generic over
$\mathrm {V}$
, with
$c\in G$
, and let
$B=\dot {B}^G$
. Let
$n<\omega $
. Since
$b_{n+1}:=\dot {b}_{n+1}^G\in G$
, we have by (6) that
$s_n\notin B$
. Since this holds for all
$n<\omega $
, B contains no node at level
$\Omega $
of T. So B is bounded in T. This is a contradiction.
Case 2: for all
$i<\delta $
,
$ \mathrm {cf} (\delta )>\delta ({\mathord {\mathbb {B}}}_i)$
.
Exactly as in the proof of Theorem 2.14, we may reduce to the case that
$\delta>\omega _1$
is a regular cardinal. It follows that
${\mathord {\mathbb {B}}}_\delta $
is
${<}\delta $
-c.c. Thus, if
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic and
${\mathord {\mathbb {B}}}_\delta /G_h$
added a new cofinal branch to some
$\omega _1$
-tree
$T\in \mathrm {V}[G_h]$
, then already some earlier
${\mathord {\mathbb {B}}}_\gamma /G_h$
would add this branch, contradicting our inductive hypothesis.
Theorem 2.21. Let T be an
$\omega _1$
-tree. Then the class of subproper forcing notions that are
$[T]$
-preserving is standard RCS iterable.
Proof. We can simplify the argument of the proof of Theorem 2.20, as before.
Again, we can easily modify the arguments of the proofs of the previous two theorems to obtain results about nice iterability. As before, the previous theorems show that every standard iteration of subproper and branch preserving/
$[T]$
-preserving forcing notions is nicely subproper and branch preserving/
$[T]$
-preserving, so that the following theorem is a generalization of these theorems.
Theorem 2.22. The class of subproper and branch preserving forcing notions is nicely iterable, and so is the class of subproper forcing notions that are
$[T]$
-preserving, for some fixed
$\omega _1$
-tree T.
2.5 RCS and nicely subproper iterations of
${}^\omega \omega $
-bounding forcing
We will now follow Abraham’s handbook article [Reference Abraham, Foreman and Kanamori1], where this is carried out for countable support iterations of proper forcing notions, in showing that the stages of certain RCS iterations of
${}^\omega \omega $
-bounding and subproper forcing notions are also subproper and
${}^\omega \omega $
-bounding.
For
$f,g\in {}^\omega \omega $
and
$n\in \omega $
, we write
$f\le _n g$
if for all
$k\ge n$
,
$f(k)\le g(k)$
, and we write
$f\le ^*g$
if there is an
$n\in \omega $
such that
$f\le _ng$
(and we express this by saying that g eventually dominates f). A forcing notion
${\mathord {\mathbb P}}$
is
${}^\omega \omega $
-bounding if whenever G is
${\mathord {\mathbb P}}$
-generic over
$\mathrm {V}$
and
$f\in ({}^\omega \omega )^{\mathrm {V}[G]}$
, then there is a
$g\in \mathrm {V}$
such that
$f\le ^*g$
, and in fact, in this case, there is then a
$g\in \mathrm {V}$
such that
$f\le _0g$
. If
$\dot {f}$
is a
${\mathord {\mathbb P}}$
-name for a real, then a weakly decreasing sequence
${\vec {p}}={\langle p_i\;|\;}{i<\omega \rangle }$
of conditions in
${\mathord {\mathbb P}}$
interprets
$\dot {f}$
if there is an
$f^*\in {}^\omega \omega $
such that for every
$n<\omega $
,
$p_n\Vdash _{\mathord {\mathbb P}}\dot {f}{\restriction }\check {n}=\check {f}^*{\restriction }\check {n}$
. In this case, we say that
${\vec {p}}$
interprets
$\dot {f}$
as
$f^*$
, and we write
$f^*=\mathsf {intp}(\dot {f},{\vec {p}})$
to express this. If
$g\in {}^\omega \omega $
and
$\dot {f}$
is a
${\mathord {\mathbb P}}$
-name for a real, then we say that a weakly decreasing sequence
${\vec {p}}$
in
${\mathord {\mathbb P}}$
interprets
$\dot {f}$
and respects g if
$\mathsf {intp}(\dot {f},{\vec {p}})\le _0g$
.
Theorem 2.23 [Reference Abraham, Foreman and Kanamori1, Theorem 3.2].
Let
${\mathord {\mathbb P}}$
be an
${}^\omega \omega $
-bounding forcing notion. Let
$\dot {f}$
be a
${\mathord {\mathbb P}}$
-name for a real, let
$\kappa $
be a sufficiently large cardinal, and let
$H_\kappa \subseteq N\models {\mathsf {ZFC}}^-$
, where N is transitive. Let
$M\prec N$
be countable, with
${\mathord {\mathbb P}},\dot {f}\in M$
. Suppose that
$g\in {}^\omega \omega $
eventually dominates all reals in M and
${\vec {p}}\in M$
interprets
$\dot {f}$
and respects g. Then there are a condition
$p\in {\mathord {\mathbb P}}\cap M$
and a real
$h\in {}^\omega \omega \cap M$
such that
$h\le _0g$
and
$p\Vdash _{\mathord {\mathbb P}}\dot {f}\le _0\check {h}$
. In particular,
$p\Vdash _{\mathord {\mathbb P}}\dot {f}\le _0\check {g}$
. Moreover, for any
$n<\omega $
, there is such a condition p with
$p\le p_n$
.
We will use the concept of a derived sequence. Suppose that
$\mathbb {A}\subseteq {\mathord {\mathbb {B}}}$
are complete Boolean algebras, and
$h=h_{{\mathord {\mathbb {B}}},\mathbb {A}}$
. In this situation, let
$\dot {f}$
be a
${\mathord {\mathbb {B}}}$
-name for a real, and let
${\vec {b}}$
be a sequence in
${\mathord {\mathbb {B}}}^+$
that interprets
$\dot {f}$
, i.e., such that
$\mathsf {intp}(\dot {f},{\vec {b}})$
exists. Let us fix a well-order of
${\mathord {\mathbb {B}}}$
, and let G be
$\mathbb {A}$
-generic over
$\mathrm {V}$
. Recall that
$b/G\neq 0$
iff
$h(b)\in G$
. Define the derived sequence
${\vec {a}}$
recursively, as follows: if
$h(b_i)\in G$
, then
$a_i=b_i$
. Note that in this case,
$h(b_j)\in G$
for all
$j<i$
, so
$a_j=b_j$
for all
$j\le i$
. If not, then let
$a_i$
be the least element of
${\mathord {\mathbb {B}}}^+$
(with respect to the fixed well-order) such that
$h(a_i)\in G$
,
$a_i\le a_{i-1}$
and
$a_i$
decides
$\dot {f}{\restriction }\check {i}$
. We write
$\delta _G({\vec {b}},\dot {f})$
for the derived sequence, and
$\delta _G({\vec {b}},\dot {f})/G$
for the sequence
${\langle a_i/G\;|\;}{i<\omega \rangle }$
. Note that by construction,
$\delta _G({\vec {b}},\dot {f})/G$
is a weakly decreasing sequence in
$({\mathord {\mathbb {B}}}/G)^+$
. The following lemma on derived sequences is completely general and has nothing to do with subproperness vs. properness.
Lemma 2.24 [Reference Abraham, Foreman and Kanamori1, Lemma 3.3].
Let
$\mathbb {A}\subseteq {\mathord {\mathbb {B}}}$
be complete Boolean algebras, where
$\mathbb {A}$
is
${}^\omega \omega $
-bounding, and let
$h=h_{{\mathord {\mathbb {B}}},\mathbb {A}}$
. Let
$\dot {f}\in \mathrm {V}^{\mathord {\mathbb {B}}}$
be a name for a real,
$b\in {\mathord {\mathbb {B}}}^+$
, and suppose that:
-
(1)
${\vec {b}}$
is a weakly decreasing sequence below b in
${\mathord {\mathbb {B}}}^+$
that interprets
$\dot {f}$
, -
(2)
$M\prec N$
is countable, where for some sufficiently large cardinal
$\kappa $
,
$H_\kappa \subseteq N\models {\mathsf {ZFC}}^-$
, N transitive, with
$\mathbb {A},{\mathord {\mathbb {B}}},\dot {f},{\vec {b}},b\in M$
, -
(3)
$g\in {}^\omega \omega $
bounds the reals of M and
$\mathsf {intp}(\dot {f},{\vec {b}})\le _0g$
.
Then there is a condition
$0\neq a\le h(b)$
with
$a\in M$
such that a forces with respect to
$\mathbb {A}$
that if
${\vec {a}}=\delta _{\dot {G}_{\mathbb {A}}}(\check {{\vec {b}}},\check {\dot {f}})$
, then
${\vec {a}}$
is below
$\check {b}$
, interprets
$\check {\dot {f}}$
and respects
$\check {g}$
.
The following lemma is a version of [Reference Abraham, Foreman and Kanamori1, Lemma 1.1] for complete Boolean algebras.
Lemma 2.25. Let
$\mathbb {A}\subseteq {\mathord {\mathbb {B}}}$
be complete Boolean algebras, and let
$G_0$
be
$\mathbb {A}$
-generic over
$\mathrm {V}$
. Suppose that in
$\mathrm {V}[G_0]$
, there is a sequence
${\langle r_i\;|\;}{i<\omega \rangle }$
such that
$r_i\in {\mathord {\mathbb {B}}}$
and
$r_{i+1}/G_0\le _{{\mathord {\mathbb {B}}}/G_0}r_i/G_0$
, for all
$i<\omega $
. Then, in
$\mathrm {V}[G_0]$
, there is a sequence
${\langle g_i\;|\;}{i<\omega \rangle }$
such that for all
$i<\omega $
,
$g_i\in G=\{b\in {\mathord {\mathbb {B}}}\;|\;\exists a\in G_0\ a\le b\}$
and, letting
$s_i=r_i\land g_i$
, for
$i<\omega $
, it follows that
$\vec {s}$
is weakly decreasing in
${\mathord {\mathbb {B}}}$
.
Proof. Recall that in this situation, G is a
$\mathrm {V}$
-complete filter in
${\mathord {\mathbb {B}}}$
, and that the quotient
${\mathord {\mathbb {B}}}/G_0={\mathord {\mathbb {B}}}/G$
consists of equivalence classes with respect to the equivalence relation that identifies
$b_0,b_1\in {\mathord {\mathbb {B}}}$
iff
$(b_0\Rightarrow b_1)\land (b_1\Rightarrow b_0)\in G$
(where
$b_0\Rightarrow b_1=\neg b_0\lor b_1$
).
$b/G_0$
denotes the equivalence class of b with respect to this equivalence relation. The partial order on
${\mathord {\mathbb {B}}}/G_0$
is defined by
$b_0/G_0\le _{{\mathord {\mathbb {B}}}/G_0}b_1/G_0$
iff
$(b_0\Rightarrow b_1)\in G$
.
Now let
$g_i=\bigwedge _{j<i}(r_{j+1}\Rightarrow r_j)$
and
$s_i=\bigwedge _{j\le i}r_j$
. Then clearly, each
$g_i$
is in G, and the sequence
$\vec {s}$
is weakly decreasing in
${\mathord {\mathbb {B}}}$
. It follows by induction on i that
$r_i\wedge g_i=s_i$
, completing the proof. This is clear if
$i=0$
, since
$s_0=r_0$
and
$g_0=1$
. For the inductive step we get that
$r_{i+1}\wedge g_{i+1}=r_{i+1}\wedge (r_{i+1}\Rightarrow r_i)\wedge g_i=r_{i+1}\wedge r_i\wedge g_i$
, which inductively is
$r_{i+1}\wedge s_i=s_{i+1}$
.
The following lemma is the version of [Reference Abraham, Foreman and Kanamori1, Lemma 3.4] for subproper forcing with complete Boolean algebras.
Lemma 2.26. Let
${\mathord {\mathbb {B}}}_0\subseteq {\mathord {\mathbb {B}}}_1\subseteq {\mathord {\mathbb {B}}}_2$
be complete Boolean algebras. Note that
$h_{{\mathord {\mathbb {B}}}_1,{\mathord {\mathbb {B}}}_0}=h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_0}{\restriction }{\mathord {\mathbb {B}}}_1$
. So let us write
$h_0$
for
$h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_0}$
and
$h_1$
for
$h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_1}$
.
Suppose that
${\mathord {\mathbb {B}}}_0$
is subproper and
${}^\omega \omega $
-bounding, and that
$\Vdash _{{\mathord {\mathbb {B}}}_0}$
“
$\check {{\mathord {\mathbb {B}}}}_1/\dot {G}_{{\mathord {\mathbb {B}}}_0}$
is subproper and
${}^\omega \omega $
-bounding.” Let
$\dot {f}\in \mathrm {V}^{{\mathord {\mathbb {B}}}_2}$
be a name for a real, and let
$\delta =\delta ({\mathord {\mathbb {B}}}_1)$
.
Let
$N=L_\tau ^A$
be such that
$H_\theta \subseteq N$
, where
$\theta $
is sufficiently large, and fix
$s\in N$
. Let
$a\in {\mathord {\mathbb {B}}}^+_0$
,
${\bar {\theta }}, \bar {{\mathord {\mathbb {B}}}}_0,\bar {{\mathord {\mathbb {B}}}}_1,\bar {{\mathord {\mathbb {B}}}}_2, \bar {s}\in {\bar {N}}$
, where
${\bar {N}}$
is countable, transitive and full, and
$\bar {{\mathord {\mathbb {B}}}}_0\subseteq \bar {{\mathord {\mathbb {B}}}}_1\subseteq \bar {{\mathord {\mathbb {B}}}}_2$
are complete Boolean algebras in
${\bar {N}}$
.
Let
$g\in {}^\omega \omega $
bound all the reals in
${\bar {N}}$
.
Let
${\bar {S}}= {\langle {\bar {\theta }},\bar {{\mathord {\mathbb {B}}}}_0,\bar {{\mathord {\mathbb {B}}}}_1,\bar {{\mathord {\mathbb {B}}}}_2,\dot {{\bar {f}}},\bar {s},{\bar {\lambda }}_1,\ldots ,{\bar {\lambda }}_n \rangle } $
and
$S= {\langle \theta ,{\mathord {\mathbb {B}}}_0,{\mathord {\mathbb {B}}}_1,{\mathord {\mathbb {B}}}_2,\dot {f},s,\lambda _1,\ldots ,\lambda _n \rangle } $
, where
$\lambda _i>\delta $
is regular. Let
$\dot {\sigma }_0$
,
$\dot {t}$
,
$\dot {\bar {b}}$
,
$\dot {b}$
be
${\mathord {\mathbb {B}}}_0$
-names and suppose that a forces:
-
(A1)
$\dot {\sigma }_0:\check {{\bar {N}}}\prec \check {N}$
, -
(A2)
$\dot {\sigma }_0(\check {{\bar {S}}})=\check {S}$
, -
(A3)
$\dot {\sigma }_0(\dot {\bar {b}})=\dot {b}$
and
$\dot {\bar {b}}\in \check {\bar {{\mathord {\mathbb {B}}}}}_2$
(and so,
$\dot {b}\in \check {{\mathord {\mathbb {B}}}}_2$
), -
(A4)
$\check {h}_0(\dot {b})\in \dot {G}_{{\mathord {\mathbb {B}}}_0}$
, -
(A5)
$\dot {t}\in \check {{\bar {N}}}$
, -
(A6)
$\dot {\sigma }_0^{-1}"\dot {G}_{{\mathord {\mathbb {B}}}_0}$
is
$\check {{\bar {N}}}$
-generic for
$\check {\bar {{\mathord {\mathbb {B}}}}}_0$
, -
(A7) Letting
$M= \mathrm {ran} (\dot {\sigma }_0)$
, there is in
$M[\dot {G}_{{\mathord {\mathbb {B}}}_0}]$
a decreasing sequence
${\vec {b}}$
of conditions in
${\mathord {\mathbb {B}}}_2^+$
, below
$\dot {b}$
, such that
${\vec {b}}/\dot {G}_{{\mathord {\mathbb {B}}}_0}$
is decreasing in
$({\mathord {\mathbb {B}}}_2/\dot {G}_{{\mathord {\mathbb {B}}}_0})^+$
, and such that
$\mathsf {intp}(\check {\dot {f}},{\vec {b}})\le _0\check {g}$
.
Then there are a condition
$c\in {\mathord {\mathbb {B}}}^+_1$
with
$h_0(c)=a$
and a
${\mathord {\mathbb {B}}}_1$
-name
$\dot {\sigma }_1$
such that whenever I is
${\mathord {\mathbb {B}}}_1$
-generic with
$c\in I$
, letting
$\sigma _1=\dot {\sigma }_1^I$
,
$G=I\cap {\mathord {\mathbb {B}}}_0$
and
$\sigma _0=\dot {\sigma }_0^G$
, the following conditions hold:
-
(C1)
$\sigma _1:{\bar {N}}\prec N$
, -
(C2)
$\sigma _1({\bar {S}})=S$
, -
(C3)
$\sigma _1(\dot {\bar {b}}^G)=\sigma _0(\dot {\bar {b}}^G)$
and
$\sigma _1(\dot {t}^G)=\sigma _0(\dot {t}^G)$
, -
(C4)
$h_1(\dot {b}^G)\in I$
, -
(C5)
${\sigma _1}^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}_1$
-generic over
$\bar {N}$
, -
(C6) Letting
${\bar {\lambda }}_0= \mathrm {On} \cap {\bar {N}}$
, we have that for
$i\le n$
,
$\sup \sigma _0"{\bar {\lambda }}_i=\sup \sigma _1"{\bar {\lambda }}_i$
. -
(C7) Letting
$M= \mathrm {ran} (\sigma _1)$
, there is in
$M[I]$
a decreasing sequence
${\vec {c}}$
of conditions in
${\mathord {\mathbb {B}}}_2^+$
below
$\dot {b}^G$
such that
${\vec {c}}/I$
is decreasing in
$({\mathord {\mathbb {B}}}_2/I)^+$
and
$\mathsf {intp}(\dot {f},{\vec {c}})\le _0g$
.
Proof. Let
$G_0$
be
${\mathord {\mathbb {B}}}_0$
-generic over
$\mathrm {V}$
, with
$a\in G_0$
. Let
$\sigma _0=\dot {\sigma }_0^{G_0}$
,
$M= \mathrm {ran} (\sigma _0)$
,
$b=\dot {b}^{G_0}$
, etc. Then
$\sigma _0:{\bar {N}}\prec M$
, and
$\sigma _0$
lifts to
$\sigma _0^*:{\bar {N}}[{\bar {G}}]\prec M[G_0]$
, where
${\bar {G}}=\sigma _0^{-1}"G_0$
. Since
$M[G_0]\prec N[G_0]$
, we will be able to apply Lemma 2.24 in
$\mathrm {V}[G_0]$
.
Note that
${}^\omega \omega \cap M[G_0]={}^\omega \omega \cap {\bar {N}}[{\bar {G}}]$
. Since
${\mathord {\mathbb {B}}}_0$
is
${}^\omega \omega $
-bounding,
${\bar {N}}$
thinks that
$\bar {{\mathord {\mathbb {B}}}}_0$
is
${}^\omega \omega $
-bounding, and since
${\bar {G}}$
is
$\bar {{\mathord {\mathbb {B}}}}_0$
-generic over
${\bar {N}}$
, it follows that every real of
${\bar {N}}[{\bar {G}}]$
is bounded by some real of
${\bar {N}}$
, which is bounded by g. Thus, the reals of
${\bar {N}}[{\bar {G}}]$
are bounded by g, and hence, the reals of
$M[G_0]$
are bounded by g.
The
${\mathord {\mathbb {B}}}_2$
-name
$\dot {f}$
can be viewed as a
${\mathord {\mathbb {B}}}_2/G_0$
-name in the obvious way. Let’s write
$\dot {f}/G_0$
for this name. Then
$\dot {f}/G_0$
is a
${\mathord {\mathbb {B}}}_2/G_0$
-name for a real.
By assumption (A7), let
${\vec {b}}$
be a decreasing sequence of conditions in
${\mathord {\mathbb {B}}}_2$
, below b, such that
${\vec {b}}/G_0$
is decreasing in
${\mathord {\mathbb {B}}}_2/G_0$
, and such that
$\mathsf {intp}(\dot {f},{\vec {b}})\le _0g$
. This means that
$\mathsf {intp}(\dot {f}/G_0,{\vec {b}}/G_0)\le _0g$
.
Thus, by Lemma 2.24, applied to
$\mathbb {A}={\mathord {\mathbb {B}}}_1/G_0$
,
${\mathord {\mathbb {B}}}={\mathord {\mathbb {B}}}_2/G_0$
, the name
$\dot {f}/G_0$
, the model
$M[G_0]$
, the condition
$b/G_0$
and the sequence
${\vec {b}}/G_0$
, there is a condition
$d\in {\mathord {\mathbb {B}}}^+_1\cap M[G_0]$
such that
$d/G_0\le h_{{\mathord {\mathbb {B}}}_2/G_0,{\mathord {\mathbb {B}}}_1/G_0}(b/G_0)$
and such that
$d/G_0$
forces with respect to
${\mathord {\mathbb {B}}}_1/G_0$
that if
${\vec {a}}=\delta _{\dot {G}_{{\mathord {\mathbb {B}}}_1/G_0}}({\vec {b}}/G_0,\dot {f}/G_0)$
, then
$\vec {a}$
is below
$\check {b}/G_0$
in
$({\mathord {\mathbb {B}}}_2/G_0)^+$
, interprets
$(\dot {f}/G_0)\check {}$
and respects g.
Let
$\dot {d}$
be a
${\mathord {\mathbb {B}}}_0$
-name for d such that a forces (with respect to
${\mathord {\mathbb {B}}}_0$
) that all of these properties hold. Let
$\dot {\bar {d}}$
be a
${\mathord {\mathbb {B}}}_0$
-name such that a forces that
$\dot {\sigma }_0^*(\dot {\bar {d}})=\dot {d}$
.
We can now apply Lemma 2.5 to
${\mathord {\mathbb {B}}}_0\subseteq {\mathord {\mathbb {B}}}_1$
,
$\dot {\sigma }_0$
,
$\dot {{\bar {d}}}$
,
$\dot {d}$
getting a condition
$c\in {\mathord {\mathbb {B}}}_1$
with
$h_0(c)=a$
and a
${\mathord {\mathbb {B}}}_1$
-name
$\dot {\sigma }_1$
such that whenever I is
${\mathord {\mathbb {B}}}_1$
-generic over
$\mathrm {V}$
with
$c\in I$
and
$G=I\cap {\mathord {\mathbb {B}}}_0$
, it follows that
-
(1)
$\sigma _1:{\bar {N}}\prec N$
, -
(2)
$\sigma _1({\bar {S}})=S$
, -
(3)
$\sigma _1(\dot {{\bar {b}}}^G)=\sigma _0(\dot {{\bar {b}}}^G)$
and
$\sigma _1(\dot {t}^G)=\sigma _0(\dot {t}^G)$
, -
(4)
$\sigma _1(\dot {{\bar {d}}}^G)=\sigma _0(\dot {{\bar {d}}}^G)=\dot {d}^G$
, -
(5)
$\dot {d}^G\in I$
, -
(6)
$\sigma _1^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}$
-generic over
${\bar {N}}$
, -
(7) for all
$i\le n$
,
$\sup \sigma _0"{\bar {\lambda }}_i=\sup \sigma _1"{\bar {\lambda }}_i$
.
where
$\delta =\delta ({\mathord {\mathbb {B}}}_1)$
. To conclude the proof, we verify that we also have:
$h_1(\dot {b}^G)\in I$
, and letting
$M= \mathrm {ran} (\sigma _1)$
, there is in
$M[I]$
a decreasing sequence
${\vec {c}}$
of conditions in
${\mathord {\mathbb {B}}}_2$
below
$\dot {b}^G$
such that
${\vec {c}}/I$
is decreasing in
${\mathord {\mathbb {B}}}_2/I$
and
$\mathsf {intp}(\dot {f},{\vec {c}})\le _0g$
.
In the present situation, we have
$I\subseteq {\mathord {\mathbb {B}}}_1$
is generic over
$\mathrm {V}$
,
$G=I\cap {\mathord {\mathbb {B}}}_0$
is
${\mathord {\mathbb {B}}}_0$
-generic over
$\mathrm {V}$
, and
$I/G=\{x/G\;|\; x\in I\}$
is
${\mathord {\mathbb {B}}}_1/G$
-generic over
$\mathrm {V}[G]$
. Moreover,
$I=G*(I/G)=\{x\in {\mathord {\mathbb {B}}}_1\;|\; x/G\in I/G\}$
.
Let
$b=\dot {b}^G\in {\mathord {\mathbb {B}}}_2$
,
$b'=h_1(b)$
and
$d=\dot {d}^G\in {\mathord {\mathbb {B}}}_1$
. We have that
$d/G\le h_{{\mathord {\mathbb {B}}}_2/G_0,{\mathord {\mathbb {B}}}_1/G_0}(b)$
, since this was forced by a. But
$h_{{\mathord {\mathbb {B}}}_2/G,{\mathord {\mathbb {B}}}_1/G}(b)=h_1(b)/G$
(see [Reference Viale, Audrito and Steila18, Proposition 4.9]). Thus,
$d/G\le b'/G$
. Since
$d\in I$
, we have that
$d/G\in I/G$
, and so,
$b'/G\in I/G$
. But since
$I=\{x\in {\mathord {\mathbb {B}}}_1\;|\; x/G\in I/G\}$
, this means that
$b'=h_1(b)\in I$
, as wished.
Further, what
$d/G$
forces over
$\mathrm {V}[G]$
is true in
$\mathrm {V}[G][I/G]=\mathrm {V}[I]$
. Thus, let
${\vec {a}}=\delta _{I/G}({\vec {b}}/G,\dot {f}/G)$
. Then
$\vec {a}$
is below
$b/G$
in
$({\mathord {\mathbb {B}}}_2/G)^+$
, interprets
$\dot {f}/G$
and respects g. Note that
${\vec {a}}\in M[I]$
, and
${\vec {a}}/(I/G)$
is weakly decreasing in
$(({\mathord {\mathbb {B}}}_2/G)/(I/G))^+$
, which we can identify with
${\mathord {\mathbb {B}}}_2/I$
.
For every
$i<\omega $
, let
$a^{\prime }_i\in {\mathord {\mathbb {B}}}_2$
be such that
$a_i=a^{\prime }_i/G$
. We then have that for every
$i<\omega $
,
$a_i/(I/G)=(a^{\prime }_i/G)/(I/G)$
, which we may identify with
$a^{\prime }_i/I$
. Thus,
${\langle a^{\prime }_i\;|\;}{i<\omega \rangle }$
is a sequence in
${\mathord {\mathbb {B}}}_2^+$
such that for all
$i<\omega $
,
$a^{\prime }_{i+1}/I\le _{{\mathord {\mathbb {B}}}_2/I}a^{\prime }_i/I$
, and
$a^{\prime }_i/I\neq 0$
. By replacing
$a^{\prime }_i$
with
$a^{\prime }_i\land b$
if necessary, we may assume that
$a^{\prime }_i\le b$
, for all i – note that
$a_i=a^{\prime }_i/G=(a^{\prime }_i\land b)/G$
since
$a_i/G\le b/G$
.
By Lemma 2.25, there is a sequence
${\langle q_i\;|\;}{i<\omega \rangle }$
in
$\mathrm {V}[I]$
such that each
$q_i\in I^*=\{x\in {\mathord {\mathbb {B}}}_2\;|\;\exists y\in I\ y\le x\}$
, and such that if we let
$c_i=a^{\prime }_i\land q_i$
, then
$\vec {c}$
is weakly decreasing in
${\mathord {\mathbb {B}}}_2$
. Since
$a^{\prime }_i/I\neq 0$
, we know that
$h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_1}(a^{\prime }_i)\in I$
. If
$q_i\ge q^{\prime }_i\in I$
, then we have that
$h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_1}(a^{\prime }_i\land q^{\prime }_i)=h_{{\mathord {\mathbb {B}}}_2,{\mathord {\mathbb {B}}}_1}(a^{\prime }_i)\land q^{\prime }_i\in I$
(we used here [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, p. 87, second bullet point] and the fact that
$q^{\prime }_i\in {\mathord {\mathbb {B}}}_1$
), and so,
$(a^{\prime }_i\land q^{\prime }_i)/I\neq 0$
. Since
$q_i\ge q^{\prime }_i$
, it follows that
$c_i/I\neq 0$
. And since
$c_i\le a^{\prime }_i$
for all i, it follows that
$\vec {c}$
interprets
$\dot {f}$
and respects g, and
$\vec {c}$
is below b, as wished.
We can now follow the proof templates of Theorems 2.14 and 2.20 to obtain our iteration theorem for
${}^\omega \omega $
-bounding subproper forcing.
Theorem 2.27. The class of subproper
${}^\omega \omega $
-bounding Boolean algebras is standard RCS iterable.
Proof. Let
$\vec {{\mathord {\mathbb {B}}}}={\langle {\mathord {\mathbb {B}}}_i\;|\;}{i<\alpha \rangle }$
be a standard RCS iteration of subproper and
${}^\omega \omega $
-bounding complete Boolean algebras. We prove by induction on
$\delta $
: whenever
$h\le \delta <\alpha $
and
$G_h$
is
${\mathord {\mathbb {B}}}_h$
-generic, then in
$\mathrm {V}[G_h]$
,
${\mathord {\mathbb {B}}}_\delta /G_h$
is subproper and
${}^\omega \omega $
-bounding.
As before, it suffices to focus on the
${}^\omega \omega $
-bounding property, and it suffices to focus on the case that
$\delta $
is a limit ordinal.
Case 1: there is an
$i<\delta $
such that
$ \mathrm {cf} (\delta )\le \delta ({\mathord {\mathbb {B}}}_i)$
.
Let
$i<\delta $
have this property. As before, it suffices to prove:
-
(A) if
$i<j<\delta $
and
$G_j$
is
${\mathord {\mathbb {B}}}_j$
-generic, then in
$\mathrm {V}[G_j]$
,
${\mathord {\mathbb {B}}}_\delta /G_j$
is
${}^\omega \omega $
-bounding.
This further reduces to showing
-
(B) if
$ \mathrm {cf} (\delta )\le \omega _1$
then
${\mathord {\mathbb {B}}}_\delta $
is
${}^\omega \omega $
-bounding.
As before, we can define a dense set
$X\subseteq {\mathord {\mathbb {B}}}_\delta $
, depending on the cofinality of
$\delta $
: if
$ \mathrm {cf} (\delta )=\omega _1$
, then
$X=\bigcup _{i<\delta }{\mathord {\mathbb {B}}}_i$
, and if
$ \mathrm { cf} (\delta )=\omega _1$
, then
$\{\bigwedge _{i<\delta }t_i\;|\;{\langle t_i\;|\;}{i<\delta \rangle }\ \text {is a thread in}\ {\vec {{\mathord {\mathbb {B}}}}}{\restriction }\delta \}$
.
Let
$\pi :\omega _1\longrightarrow \delta $
be cofinal, with
$\pi (0)=0$
.
Let
$\dot {f}$
be a
${\mathord {\mathbb {B}}}_\delta $
-name for a member of
${}^\omega \omega $
, and let
$a_0\in {\mathord {\mathbb {B}}}_\delta $
be a condition. We have to find
$g\in {}^\omega \omega $
and a condition extending
$a_0$
that forces that
$\dot {f}\le _0\check {g}$
. Since X is dense in
${\mathord {\mathbb {B}}}_\delta $
, we may assume that
$a_0\in X$
.
Let
$N=L_\tau ^A$
, with
$H_\theta \subseteq N$
, such that
$\theta $
verifies the subproperness of each
${\mathord {\mathbb {B}}}_i$
, for
$i\le \delta $
. Let
$S= {\langle \theta ,\delta ,\vec {{\mathord {\mathbb {B}}}},X,\dot {f},\pi ,a_0 \rangle } $
. Let
$M_0\prec N$
with
$S\in M_0$
,
$M_0$
countable and such that, letting
$\sigma _0:{\bar {N}}\longrightarrow M_0$
be the inverse of the Mostowski collapse (so that
${\bar {N}}$
is transitive),
${\bar {N}}$
is full. Let
$\sigma _0^{-1}(S)={\bar {S}}= {\langle {\bar {\theta }},{\bar {\delta }},\vec {\bar {{\mathord {\mathbb {B}}}}},{\bar {X}},\dot {{\bar {f}}},{\bar {\pi }},\bar {a}_0 \rangle } $
. Let
${\langle \nu _i\;|\;}{i<\omega \rangle }$
be a sequence of ordinals
$\nu _i<\omega _1^{\bar {N}}$
such that if we let
${\bar {\gamma }}_i={\bar {\pi }}(\nu _i)$
, it follows that
${\langle {\bar {\gamma }}_i\;|\;}{i<\omega \rangle }$
is monotone and cofinal in
${\bar {\delta }}$
, and such that
$\nu _0=0$
, so that
${\bar {\gamma }}_0=0$
. Hence, letting
$\gamma _i=\sigma _0({\bar {\gamma }}_i)$
, we have that
$\sup _{i<\omega }\gamma _i=\sup (M_0\cap \delta )$
. Moreover, whenever
$\sigma ':{\bar {N}}\prec N$
is such that
$\sigma '({\bar {\pi }})=\pi $
, it follows that
$\sigma '({\bar {\gamma }}_i)=\gamma _i=\pi (\nu _i)$
, as before.
Working inside
$M_0$
, construct a decreasing sequence
${\langle a_i\;|\;}{i<\omega \rangle }$
that interprets
$\dot {f}$
as some
$f^*\in M_0$
(so
${\vec {a}}$
starts with the given condition fixed above). Let g bound the reals of
$M_0$
, with
$f^*\le _0g$
.
By induction on
$n<\omega $
, construct sequences
${\langle \dot {\sigma }_n\;|\;}{n<\omega \rangle }$
,
${\langle c_n\;|\;}{n<\omega \rangle }$
,
${\langle \dot {b}_n\;|\;}{n<\omega \rangle }$
and
${\langle \dot {\bar {b}}_n\;|\;}{n<\omega \rangle }$
with
$c_n\in {\mathord {\mathbb {B}}}_{\gamma _n}$
,
$\dot {\sigma }_n\in \mathrm {V}^{{\mathord {\mathbb {B}}}_n}$
,
$\dot {b}_n,\dot {{\bar {b}}}_n\in \mathrm {V}^{{\mathord {\mathbb {B}}}_{\gamma _n}}$
, such that for every
$n<\omega $
,
$c_n$
forces the following statements:
-
(1)
$\dot {\sigma }_n:\check {{\bar {N}}}\prec \check {N}$
. -
(2)
$\dot {\sigma }_n(\check {{\bar {S}}})=\check {S}$
, and for all
$k<n$
,
$\dot {\sigma }_n(\dot {\bar {b}}_k)=\dot {\sigma }_k(\dot {\bar {b}}_k)$
. -
(3)
$\dot {\sigma }_n(\dot {\bar {b}}_n)=\dot {b}_n$
and
$\dot {\bar {b}}_n\in \check {\bar {{\mathord {\mathbb {B}}}}}_{\bar {\delta }}$
(and so,
$\dot {b}_n\in \check {{\mathord {\mathbb {B}}}}_\delta $
). Moreover,
$\dot {\bar {b}}_n\in \check {{\bar {X}}}$
, so
$\dot {b}_n\in \check {X}$
. -
(4)
$\check {h}_{\gamma _n}(\dot {b}_n)\in \dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _{n}}}$
. -
(5)
$\dot {\sigma }_n^{-1}"\dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _n}}$
is
$\check {{\bar {N}}}$
-generic for
$\check {\bar {{\mathord {\mathbb {B}}}}}_{\gamma _n}$
. -
(6) Letting
$M_n= \mathrm {ran} (\dot {\sigma }_n)$
, there is in
$M_n[\dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _n}}]$
a decreasing sequence of conditions in
$\check {{\mathord {\mathbb {B}}}}_\delta $
, below
$\dot {b}_n$
, such that
${\vec {b}}/\dot {G}_{{\mathord {\mathbb {B}}}_\delta }$
is decreasing in
$(\check {{\mathord {\mathbb {B}}}}_{\delta }/\dot {G}_{{\mathord {\mathbb {B}}}_{\gamma _n}})^+$
, and such that
$\mathsf {intp}(\check {\dot {f}},{\vec {b}})\le _0\check {g}$
. -
(7)
$\dot {b}_n$
decides
$\dot {f}{\restriction }\check {n}$
(with respect to
${\mathord {\mathbb {B}}}_\delta $
), and
$\dot {b}_n\Vdash _{\check {{\mathord {\mathbb {B}}}}_\delta }\dot {f}{\restriction }\check {n}\le _0\check {g}{\restriction }\check {n}$
. -
(8)
$c_{n-1}=h_{\gamma _{n-1}}(c_{n})$
(for
$n>0$
). -
(9)
$\dot {b}_n\le _{\check {{\mathord {\mathbb {B}}}}_\delta }\dot {b}_{n-1}$
(for
$n>0$
).
To start off, in the case
$n=0$
, we set
$c_0= {1\mathrm {\hspace {-0.5ex}l}} $
,
$\dot {\sigma }_0=\check {\sigma }_0$
and
$\dot {b}_0=\check {a}_0$
and
$\dot {{\bar {b}}}_0=\sigma _0^{-1}(\dot {b}_0)$
. Clearly then, (1)–(7) are satisfied for
$n=0$
—for (3) and (6), note that we picked
$\vec {a}$
in X. Conditions (8) and (9), as well as the second part of (2), are vacuous for
$n=0$
.
Now suppose
$m=n-1$
, and
$\dot {\sigma }_l$
,
$c_l$
,
$\dot {b}_l$
and
$\dot {{\bar {b}}}_l$
have been defined, so that (1)–(9) are satisfied for
$l\le m$
.
We want to apply Lemma 2.26 in the present situation. Here is the conversion:

The assumptions (1)–(7) stated in the lemma are then satisfied, by our inductive assumption, and the lemma then guarantees the existence of certain objects, which we convert to the current situation as follows:

We are thus left to define
$\dot {b}_n$
and
$\dot {{\bar {b}}}_n$
. To do this, let I be
${\mathord {\mathbb {B}}}_{\gamma _n}$
-generic over
$\mathrm {V}$
, and let
$G=I\cap {\mathord {\mathbb {B}}}_{\gamma _m}$
, with
$c_n\in I$
. Working in
$\mathrm {V}[I]$
, let
$\sigma _n=\dot {\sigma }_n^I$
,
$\sigma _m=\dot {\sigma }_m^G$
,
$t=\dot {t}^G$
,
$b_k=\dot {b}_k^G$
and
${\bar {b}}_k=\dot {{\bar {b}}}_k^G$
, for
$k\le m$
. Since
$\dot {\sigma }_n$
and
$c_n$
were chosen according to Lemma 2.26, we then have that
$\sigma _n:{\bar {N}}\prec N$
,
$\sigma _n({\bar {S}})=S$
,
$\sigma _n({\bar {b}}_k)=b_k$
for
$k\le m$
,
$h_{\gamma _m}(b_m)\in I$
and
${\bar {I}}=\sigma _n^{-1}"I$
is
$\bar {{\mathord {\mathbb {B}}}}_{{\bar {\gamma }}_n}$
-generic over
${\bar {N}}$
. So let
$M_n= \mathrm {ran} (\sigma _n)$
, and let
$\sigma ^*_n:{\bar {N}}[{\bar {I}}]\prec M[I]$
be such that
$\sigma _n\subseteq \sigma ^*_n$
and
$\sigma ^*_n({\bar {I}})=I$
. By conclusion (7) of Lemma 2.26, there is in
$M_n[I]$
a sequence
${\vec {r}}={\langle r_i\;|\;}{i<\omega \rangle }$
decreasing in
${\mathord {\mathbb {B}}}_\delta $
, below
$b_m$
, such that
${\vec {r}}/I$
is decreasing in
$({\mathord {\mathbb {B}}}_\delta /I)^+$
and
$\mathsf {intp}(\dot {f},{\vec {r}})\le _0g$
. Let
$\dot {b}_n$
be a
${\mathord {\mathbb {B}}}_{\gamma _n}$
-name such that
$\dot {b}_n^I=r_n$
, and such that
$c_n$
forces that
$\dot {b}_n$
decides
$\dot {f}{\restriction }\check {n}$
and forces
$\dot {f}{\restriction }\check {n}\le _0\check {g}{\restriction }\check {n}$
. Finally, let
$\dot {{\bar {b}}}_n$
be a
${\mathord {\mathbb {B}}}_{\gamma _n}$
-name for
$(\sigma ^*_n)^{-1}(\dot {b}_n)$
.
This concludes the construction of the sequences
$\vec {\dot {\sigma }}$
,
$\vec {c}$
,
$\vec {b}$
, and
$\vec {\bar {b}}$
.
Now, the sequence
${\langle c_n\;|\;}{c<\omega \rangle }$
is a thread, and it follows as before that
$c=\bigwedge _{n<\omega }c_n\in {\mathord {\mathbb {B}}}_\delta ^+$
.
We claim that c forces that
$\dot {f}\le _0\check {g}$
. To see this, let G be
${\mathord {\mathbb {B}}}_\delta $
-generic over
$\mathrm {V}$
, with
$c\in G$
. Let
$n<\omega $
. Let
$b_n:=\dot {b}_n^G\in G$
. We show as before:
-
(C) For all
$n<\omega $
,
$b_n\in G$
.
Now by point (7) in our recursive construction,
$b_n$
decides
$\dot {f}{\restriction }\check {n}$
to be totally bounded by
$g{\restriction } n$
. This shows that
$\dot {f}^G\le _0 g$
.
Case 2: for all
$i<\delta $
,
$ \mathrm {cf} (\delta )>\delta ({\mathord {\mathbb {B}}}_i)$
.
It follows as before that
${\mathord {\mathbb {B}}}_\delta $
the direct limit of
${\vec {{\mathord {\mathbb {B}}}}}{\restriction }\delta $
, and is
${<}\delta $
-c.c.
But then it follows that if G is
${\mathord {\mathbb {B}}}_\delta $
-generic over
$\mathrm {V}$
, then any real in
$\mathrm {V}[G]$
is already in
$\mathrm {V}[G\cap {\mathord {\mathbb {B}}}_\gamma ]$
, for some
$\gamma <\delta $
, and hence is bounded by a real in
$\mathrm {V}$
, since we know inductively that
${\mathord {\mathbb {B}}}_\gamma $
is
${}^\omega \omega $
-bounding.
As before, the previous RCS iteration theorems imply:
Observation 2.28. Every standard RCS iteration of subproper and
${}^\omega \omega $
-bounding forcings is nicely subproper and
${}^\omega \omega $
-bounding.
And as before, we can generalize Theorem 2.27 as follows.
Theorem 2.29. The class of subproper and
${}^\omega \omega $
-bounding Boolean algebras is nicely iterable.
3 Nice Iterations
In this section, we will adopt Miyamoto’s nice iterations from [Reference Miyamoto16], and prove preservation theorems for generalizations of subproper and subcomplete forcing. Initially, we proved that subcomplete forcing can be iterated in this way, but then realized that we could drop a condition in the definition of subcompleteness. We then observed that the corresponding simplification works for the class of subproper forcing notions as well. We learned afterwards that Miyamoto [Reference Miyamoto17] also made this latter observation for subproper forcing.
3.1 Subcompleteness and
$\infty $
-subcompleteness
Let us start by giving the definition of subcompleteness, as well as its simplification. Recall the definitions of the density of a partial order (Definition 2.1) and fullness (Definition 2.3). In order to discuss these variations, we will present the definitions in the more general framework of Fuchs [Reference Fuchs2]. We will work with the “hull condition” version of subcompleteness. In order to formulate it, we use the following terminology.
Definition 3.1. Let
$N=L^A_\tau = {\langle L_\tau [A],\in ,A\cap L_\tau [A] \rangle } $
be a
${\mathsf {ZFC}}^-{}$
model,
$\varepsilon $
an ordinal and
$X\cup \{\varepsilon \}\subseteq N$
. Then
$C^N_\varepsilon (X)$
is the smallest
$Y\prec N$
such that
$X\cup \varepsilon \subseteq Y$
.
Definition 3.2. Let
$\varepsilon $
be an ordinal. A forcing
${\mathord {\mathbb P}}$
is
$\varepsilon $
-subcomplete if there is a cardinal
$\theta>\varepsilon $
which verifies the
$\varepsilon $
-subcompleteness of
${\mathord {\mathbb P}}$
, which means that
${\mathord {\mathbb P}}\in H_\theta $
, and for any
${\mathsf {ZFC}}^-{}$
model
$N=L_\tau ^A$
with
$\theta <\tau $
and
$H_\theta \subseteq N$
, any
$\sigma :{\bar {N}}\prec N$
such that
${\bar {N}}$
is countable, transitive and full and such that
${\mathord {\mathbb P}},\theta ,\varepsilon \in \mathrm {ran} (\sigma )$
, any
$\bar {G}\subseteq \bar {{\mathord {\mathbb P}}}$
which is
$\bar {{\mathord {\mathbb P}}}$
-generic over
${\bar {N}}$
, and any
$\bar {s}\in {\bar {N}}$
, the following holds. Letting
$\sigma ( {\langle \bar {\varepsilon },\bar {\theta },\bar {{\mathord {\mathbb P}}} \rangle } )= {\langle \varepsilon ,\theta ,{\mathord {\mathbb P}} \rangle } $
, and setting
$\bar {S}= {\langle \bar {s},\bar {\varepsilon },\bar {\theta },\bar {{\mathord {\mathbb P}}} \rangle } $
, there is a condition
$p\in {\mathord {\mathbb P}}$
such that whenever
$G\subseteq {\mathord {\mathbb P}}$
is
${\mathord {\mathbb P}}$
-generic over
$\mathrm {V}$
with
$p\in G$
, there is in
$\mathrm {V}[G]$
a
$\sigma '$
such that
-
(1)
$\sigma ':{\bar {N}}\prec N$
, -
(2)
$\sigma '(\bar {S})=\sigma (\bar {S})$
, -
(3)
$(\sigma ')"\bar {G}\subseteq G$
, -
(4)
$C^N_{\varepsilon }( \mathrm {ran} (\sigma '))=C^N_{\varepsilon }( \mathrm {ran} (\sigma ))$
.
In this parlance,
${\mathord {\mathbb P}}$
is subcomplete iff it is
$\delta ({\mathord {\mathbb P}})$
-subcomplete. It is easy to see that increasing
$\varepsilon $
weakens the condition of being
$\varepsilon $
-subcomplete. Thus, we refer to the version of subcompleteness obtained by dropping the hull condition 4 as
$\infty $
-subcompleteness. This makes sense if one interprets
$\infty $
as
$ \mathrm {On} \cap N$
in Definition 3.1. Since in our context, N is a
${\mathsf {ZFC}}^-$
model of the form
$L^A_\tau $
, it follows then that
$C^N_\infty (\emptyset )=N$
, and hence that the hull condition is vacuous.
It was pointed out in [Reference Fuchs2] that the hull condition is somewhat unnatural, because the density of a partial order is not preserved under forcing equivalence. It was shown there that the
$\varepsilon $
-subcompleteness of a partial order, however, is preserved under forcing equivalence, and it is easy to see that the same is true of
$\infty $
-subcompleteness. Another flaw of the concept of subcompleteness that was addressed in [Reference Fuchs2] is that it is unclear whether factors of subcomplete forcing notions are subcomplete. The result of [Reference Fuchs2] that factors of
$\varepsilon $
-subcomplete forcing notions are
$\varepsilon $
-subcomplete carries over to
$\infty $
-subcompleteness; in fact, it simplifies slightly, since one does not need to worry about proving that the factor satisfies the hull condition. As a result the proof of this fact below is much simpler than the corresponding one in [Reference Fuchs2].
We introduced the concept of
$\varepsilon $
-subcompleteness only in order to motivate
$\infty $
-subcompleteness; it is the latter class that concerns us here.
Just like in the case of subcompleteness, when verifying that some poset
${\mathord {\mathbb P}}$
is
$\infty $
-subcomplete, one may assume that some useful parameter p belongs to the range of
$\sigma $
(in the setup of Definition 3.2). For the case of subcompleteness, this was pointed out in [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, pp. 115–116, Lemma 2.5]. The argument carries over to the case of
$\infty $
-subcompleteness (the reader may follow along the proof of [Reference Fuchs5, Observation 2.27].) We will tacitly use this fact throughout.
Theorem 3.3. Let
${\mathord {\mathbb P}}$
be a poset, and let
$\dot {{\mathord {\mathbb Q}}}$
be a
${\mathord {\mathbb P}}$
-name for a poset, such that
${\mathord {\mathbb P}}*\dot {{\mathord {\mathbb Q}}}$
is
$\infty $
-subcomplete. Then
${\mathord {\mathbb P}}$
is
$\infty $
-subcomplete.
Proof. Let
$\theta $
be large enough to verify that
$\mathbb P * \dot {\mathbb Q}$
is
$\infty $
-subcomplete. We claim that it is also large enough to verify that
$\mathbb P$
is subcomplete. To see this, let
$N = L_\tau [A]$
, be a ZFC
$^-$
model with
$\tau> \theta $
regular, and
$H_\theta \subseteq N$
. Fix a parameter
$s \in N$
and let
$\sigma :{\bar {N}} \prec N$
with
${\bar {N}}$
countable, transitive and full so that
$\sigma (\overline {\mathbb P}, \dot {\overline {\mathbb Q}}, \overline {\theta }, \overline {s}) = \mathbb P, \dot {\mathbb Q}, \theta , s$
. Let
$\overline {G} \subseteq \overline {\mathbb P}$
be generic over
${\bar {N}}$
. Let
$(p, \dot {q})$
be a condition witnessing the
$\infty $
-subcompleteness of
$\mathbb P * \dot {\mathbb Q}$
and let
$(p, \dot {q}) \in G * H$
be
$\mathbb P * \dot {\mathbb Q}$
-generic over
$\mathrm {V}$
. Work in
$\mathrm {V}[G*H]$
and let
$\sigma ':\bar {N} \prec N$
be an embedding so that
$\sigma ' (\overline {\mathbb P}, \dot {\overline {\mathbb Q}}, \overline {\theta }, \overline {s}) = \mathbb P, \dot {\mathbb Q}, \theta , s$
and
$\sigma ' "\bar {G} \subseteq G$
. Fixing an enumeration of
${\bar {N}}$
in order type
$\omega $
, we can consider the tree
$T_{G}$
of finite initial segments of an elementary embedding
$\sigma _0 : {\bar {N}} \prec N$
with
$\sigma _0 (\overline {\mathbb P}, \dot {\overline {\mathbb Q}}, \overline {\theta }, \overline {s}) = \mathbb P, \dot {\mathbb Q}, \theta , s$
and so that
$\sigma _0 ' " \bar {G} \subseteq G$
. Note that this tree is in fact in
$\mathrm {V}[G]$
. Moreover, in
$\mathrm {V}[G*H]$
it’s ill-founded since
$\sigma '$
generates an infinite branch. But then by the absoluteness of ill-foundedness,
$T_G$
is ill-founded in
$\mathrm {V}[G]$
. So there is an infinite branch in
$\mathrm {V}[G]$
and this branch witnesses that
$\mathbb P$
is
$\infty $
-subcomplete.
The following observation underlines the simplicity and elegance of the concept of
$\infty $
-subcomplete forcing.
Proposition 3.4 (Essentially Lemma 2.3 of [Reference Fuchs2]).
$\infty $
-subcomplete forcings are closed under forcing equivalence.
Proof. The argument of [Reference Fuchs2, Lemma 2.3] goes through. Let
$\mathbb P$
be
$\infty $
-subcomplete and
$\mathbb Q$
be forcing equivalent to
$\mathbb P$
. By this, we mean that
${\mathord {\mathbb P}}$
and
${\mathord {\mathbb Q}}$
have the same forcing extensions—this can be expressed in a first order way. To show that
${\mathord {\mathbb Q}}$
is
$\infty $
-subcomplete, let
$\theta $
be large enough to verify the
$\infty $
-subcompleteness of
$\mathbb P$
and assume
$\mathcal P(\mathbb Q \cup \mathbb P) \in H_\theta $
. Let
$\sigma :{\bar {N}}\prec N, s, \bar {{\mathord {\mathbb Q}}},\bar {H}$
, etc be as in the definition of
$\infty $
-subcompleteness, where
$\bar {H}$
is
$\bar {{\mathord {\mathbb Q}}}$
-generic over
${\bar {N}}$
and
$\sigma (\bar {{\mathord {\mathbb Q}}})={\mathord {\mathbb Q}}$
. We may assume that
${\mathord {\mathbb P}}\in \mathrm {ran} (\sigma )$
, and write
$\bar {{\mathord {\mathbb P}}}=\sigma ^{-1}({\mathord {\mathbb P}})$
. By elementarity,
${\bar {N}}$
believes that
${\bar {{\mathord {\mathbb P}}}}$
and
$\bar {{\mathord {\mathbb Q}}}$
are forcing equivalent, and hence, there is a
$\bar {G}$
which is
${\bar {{\mathord {\mathbb P}}}}$
-generic over
${\bar {N}}$
, such that
${\bar {N}}[{\bar {G}}]={\bar {N}}[\bar {H}]$
. Since
${\mathord {\mathbb P}}$
is
$\infty $
-subcomplete, there is a condition
$p \in \mathbb P$
so that if
$G\ni p$
is
$\mathbb P$
-generic over V then in
$V[G]$
there is an embedding
$\sigma ' : {\bar {N}} \prec N$
as in the definition of
$\infty $
-subcompleteness, so
$\sigma '"{\bar {G}}\subseteq G$
. We may also assume that
$\sigma '(\bar {{\mathord {\mathbb Q}}})={\mathord {\mathbb Q}}$
.
$\sigma '$
then lifts to an embedding
${\tilde {\sigma }}:{\bar {N}}[{\bar {G}}]\prec N[G]$
with
${\tilde {\sigma }}({\bar {G}})=G$
. By elementarity of
${\tilde {\sigma }}$
, letting
$H={\tilde {\sigma }}(\bar {H})$
, it follows that H is
${\mathord {\mathbb Q}}$
-generic over N, and since N contains all subsets of
${\mathord {\mathbb Q}}$
, it follows that H is
${\mathord {\mathbb Q}}$
-generic over
$\mathrm {V}$
. Moreover, by elementarity of
${\tilde {\sigma }}$
, we see that
$N[G]=N[H]$
, so
$G\in \mathrm {V}[H]$
, so
$\sigma '\in \mathrm {V}[H]$
. And clearly, since
$H={\tilde {\sigma }}(\bar {H})$
, it follows that
${\tilde {\sigma }}"{\bar {H}}\subseteq H$
, that is,
$\sigma '"{\bar {H}}\subseteq H$
. Since
$\sigma '\in \mathrm {V}[H]$
, there is a condition
$q\in H$
that forces the existence of an embedding like
$\sigma '$
, showing that
${\mathord {\mathbb Q}}$
is
$\infty $
-subcomplete.
It is unclear if the corresponding fact is true for subcomplete forcing notions since there are forcing equivalent notions with radically different densities.
We do not know whether the iteration theorems for nicely subcomplete iterations, which give great leeway in how limit stages of the iteration are formed, can be carried out without some version of the hull or suprema condition. But if we use Miyamoto’s method of forming limits in nice iterations, it turns out that we do not need any hull or suprema conditions. All other preservation properties of subcomplete forcing notions that we know of actually do not need the hull or suprema condition either, and thus are preservation properties of
$\infty $
-subcomplete forcing. We list some in the following observation.
Observation 3.5. Let
${\mathord {\mathbb P}}$
be
$\infty $
-subcomplete.
-
(1)
${\mathord {\mathbb P}}$
preserves stationary subsets of
$\omega _1$
. -
(2)
${\mathord {\mathbb P}}$
preserves Souslin trees. -
(3)
${\mathord {\mathbb P}}$
preserves the principle
$\diamondsuit $
. -
(4)
${\mathord {\mathbb P}}$
does not add reals.
Apart from simplifying the theory, however, we do not have a particular use of the concept of
$\infty $
-subcompleteness. In fact, the following question is open.
Question 3.6. Is every
$\infty $
-subcomplete forcing also subcomplete?
However, we feel that simplifying a highly technical concept such as subcompleteness is worthwhile in its own right.
The same “
$\infty $
”-modification made to subcomplete forcing notions can be made to subproper forcing notions as well. The proofs that
$\infty $
-subproperness is invariant under forcing equivalence and that factors of
$\infty $
-subproper forcing notions are
$\infty $
-subproper follow the proofs of the corresponding results given above, so we leave the details to the interested reader and just list this definition and fact. Note that the definition of
$\infty $
-subproperness results from dropping the suprema condition (d) from Definition 2.4. We repeat it in full below for completeness, and since we use partial orders rather than Boolean algebras, as the former will be used in the iteration theorem.
Definition 3.7. A forcing notion
${\mathord {\mathbb P}}$
is
$\infty $
-subproper if every sufficiently large cardinal
$\theta $
verifies the
$\infty $
-subproperness of
${\mathord {\mathbb P}}$
, meaning that the following holds:
${\mathord {\mathbb P}}\in H_\theta $
, and if
$\tau>\theta $
is such that
$H_\theta \subseteq N=L_\tau ^A\models \mathsf {ZFC}^-$
, and
$\sigma :{\bar {N}}\prec N$
, where
${\bar {N}}$
is countable, transitive and full, and
${\bar {S}}= {\langle {\bar {\theta }},\bar {\mathbb P},{\bar {p}},{\bar {s}} \rangle } \in {\bar {N}}$
,
$S= {\langle \theta ,{\mathord {\mathbb P}},p,s \rangle } =\sigma ({\bar {S}})$
, where
${\bar {p}}\in {\mathord {\mathbb P}}$
, for
$1\le i\le n$
, then there is a
$q \in {\mathord {\mathbb P}}$
such that
$q \le p$
and such that whenever
$G\subseteq {\mathord {\mathbb P}}$
is generic with
$q\in G$
, then there is a
$\sigma '\in \mathrm {V}[G]$
such that
-
(a)
$\sigma ':{\bar {N}}\prec N$
. -
(b)
$\sigma '({\bar {S}})=\sigma ({\bar {S}})$
. -
(c)
$(\sigma ')^{-1}"G$
is
$\bar {{\mathord {\mathbb P}}}$
-generic over
${\bar {N}}$
.
Lemma 3.8.
$\infty $
-subproper forcing notions are closed under factors and forcing equivalence.
Let us make a remark on the suprema condition that is part of Definition 2.4 and is omitted in Definition 3.7. When motivating his definition of subproperness, Jensen writes in [Reference Jensen12, Section 0, p. 3] on this condition:
We needed (d) to handle certain regular limit points in the iteration. The experts on the subject may well be able to modify or eliminate (d).
This prediction came true, as Miyamoto showed, for the case of subproperness, which we learned after proving our iteration theorems for nice iterations. Our contribution is that this can be done for subcompleteness as well, and that some subclasses of subproper forcing, exhibiting more preservation properties, without requiring the hull or suprema condition, can be iterated in this way as well. The additional preservation properties of the subclasses we consider are the same properties that Miyamoto imposed on the class of semiproper forcing in his iteration theorems from [Reference Miyamoto16] and [Reference Miyamoto15]. Our proofs in this section are adaptations of Miyamoto’s arguments in the context of semiproper forcing. The honor of being considered an expert on the subject by Jensen is entirely Miyamoto’s.
3.2 The theory of nice iterations
We collect here first the relevant facts and definitions from [Reference Miyamoto16]. For a more in depth discussion, including proofs, see that article. For basic notions of projection etc, see the introduction there. For a sequence x we denote its length by
$l(x)$
.
Definition 3.9. Let
$\nu $
be a limit ordinal. A sequence of separative partial preordersFootnote
2
of length
$\nu $
,
$\langle ({\mathord {\mathbb P}}_\alpha , \leq _\alpha , 1_\alpha )\; | \; \alpha < \nu \rangle $
is called a general iteration iff for any
$\alpha \leq \beta < \nu $
the following holds
-
(1) For any
$p \in {\mathord {\mathbb P}}_\beta $
, p is a sequence of length
$\beta $
,
$p \upharpoonright \alpha \in {\mathord {\mathbb P}}_\alpha $
and
$1_\beta \upharpoonright \alpha = 1_\alpha $
. -
(2) For any
$p \in {\mathord {\mathbb P}}_\alpha $
and any
$q \in {\mathord {\mathbb P}}_\beta $
, if
$p \leq _\alpha q \upharpoonright \alpha $
then
$p^\frown q \upharpoonright [\alpha , \beta ) \in {\mathord {\mathbb P}}_\beta $
and
$p^\frown q \upharpoonright [\alpha , \beta ) \leq _\beta q$
-
(3) For any
$p, q \in {\mathord {\mathbb P}}_\beta $
, if
$p \leq _\beta q$
then
$p \upharpoonright \alpha \leq _\alpha q \upharpoonright \alpha $
and
$p\leq _\beta p \upharpoonright \alpha ^\frown q\upharpoonright [\alpha , \beta )$
.
A general iteration
$\langle ({\mathord {\mathbb P}}_\alpha , \leq _\alpha , 1_\alpha )\; | \; \alpha < \nu \rangle $
is an iteration iff for every limit ordinal
$\beta <\nu $
and all
$p,q\in {\mathord {\mathbb P}}_\beta $
,
$p\le _\beta q$
iff for all
$\alpha <\beta $
,
$p{\restriction }\alpha \le _\alpha q{\restriction }\alpha $
.
We will use the following fact (and the notation introduced there).
Fact 3.10 (see [Reference Miyamoto16, Proposition 1.3]).
Let
$\langle ({\mathord {\mathbb P}}_\alpha , \leq _\alpha , 1_\alpha )\; | \; \alpha < \nu \rangle $
be a general iteration, and let
$\alpha \le \beta <\nu $
. Then
-
(1) Let
$G_\beta $
be
${\mathord {\mathbb P}}_\beta $
-generic over
$\mathrm {V}$
. Set
$G_\beta {\restriction }\alpha =\{p{\restriction }\alpha \;|\; p\in G_\beta \}$
,
$G_\beta {\restriction }[\alpha ,\beta )=\{p{\restriction }[\alpha ,\beta )\;|\; p\in G_\beta \}$
, and let equipped with the ordering
$$\begin{align*}{\mathord{\mathbb P}}_{\alpha,\beta}={\mathord{\mathbb P}}_\beta/(G_\beta{\restriction}\alpha)=\{p{\restriction}[\alpha,\beta)\;|\; p\in {\mathord{\mathbb P}}_\beta\ \text{and}\ p{\restriction}\alpha\in G_\beta{\restriction}\alpha\}\end{align*}$$
$p\le _{\alpha ,\beta }q$
iff there is an
$r\in G_\beta {\restriction }\alpha $
such that
$r{{}^\frown } p\le _\beta r{{}^\frown } q$
. Then
$G_\beta {\restriction }\alpha $
is
${\mathord {\mathbb P}}_\alpha $
-generic over
$\mathrm {V}$
and
$G_\beta {\restriction } [\alpha , \beta )$
is
${\mathord {\mathbb P}}_{\alpha ,\beta }$
-generic over
$\mathrm {V}[G_\beta {\restriction }\alpha ]$
.
-
(2) If
$G_\alpha $
is
${\mathord {\mathbb P}}_\alpha $
-generic over
$\mathrm {V}$
and H is
${\mathord {\mathbb P}}_{\alpha ,\beta }={\mathord {\mathbb P}}_\beta /G_\alpha $
-generic over
$\mathrm {V}[G_\alpha ]$
, then
$G_\alpha *H=\{p\in {\mathord {\mathbb P}}_\alpha \;|\; p{\restriction }\alpha \in G_\alpha \ \text {and}\ p{\restriction }[\alpha ,\beta )\in H\}$
is
${\mathord {\mathbb P}}_\beta $
-generic over
$\mathrm {V}$
,
$(G_\alpha *H){\restriction }\alpha =G_\alpha $
and
$(G_\alpha *H){\restriction }[\alpha ,\beta )=H$
. -
(3) Let
$G_\beta $
be
${\mathord {\mathbb P}}_\beta $
-generic over
$\mathrm {V}$
. Then a condition
$p\in {\mathord {\mathbb P}}_\beta $
is in
$G_\beta $
iff
$p{\restriction }\alpha \in G_\beta {\restriction }\alpha $
and
$p{\restriction }[\alpha ,\beta )\in G_\beta {\restriction }[\alpha ,\beta )$
.
In what follows we suppress the notation
$\leq _\alpha , 1_\alpha $
and identify a partial preorder with its underlying set. We have the following useful proposition.
Proposition 3.11 (Proposition 1.7 of [Reference Miyamoto16]).
Let
$ {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha < \nu \rangle } $
be an iteration and
$\beta <\nu $
a limit ordinal. Then for any
$p \in {\mathord {\mathbb P}}_\beta $
and any
${\mathord {\mathbb P}}_\beta $
-generic
$G_\beta $
we have
$p\in G_\beta $
if and only if for all
$\alpha <\beta $
,
$p{\restriction }\alpha \in G_\beta {\restriction }\alpha $
.
From now on we always assume the sequence
$\vec {{\mathord {\mathbb P}}} = {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha <\nu \rangle } $
is an iteration. Let us quickly define the relevant concepts: nested antichain,
$S \mathrel {\angle } T$
, mixtures and
$(T, \beta )$
-niceness. We refer the reader to [Reference Miyamoto16] for an in depth discussion of these ideas and their significance.
Definition 3.12. A nested antichain in
$\vec {{\mathord {\mathbb P}}}=\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha <\nu \rangle $
is a triple
$\langle T, \langle T_n \; | \; n < \omega \rangle , \langle \mathrm {suc}^n_T \; | \; n < \omega \rangle \rangle $
so that
-
(1)
$T = \bigcup _{n < \omega } T_n$
-
(2)
$T_0$
consists of a unique element of some
${\mathord {\mathbb P}}_\alpha $
for
$\alpha < \nu $
. We denote this unique element by
$\mathrm {root}(T)$
.For each
$n < \omega $
we have that -
(3)
$T_n \subseteq \bigcup \{{\mathord {\mathbb P}}_\alpha \; | \; \alpha < \nu \}$
and
$\mathrm {suc}^n_T: T_n \to \mathcal P(T_{n+1})$
. -
(4) For
$a \in T_n$
and
$b \in \mathrm {suc}^n_T (a)$
,
$l(a) \leq l(b)$
and
$b \upharpoonright l(a) \leq a$
. -
(5) If
$a \in T_n$
and
$b_0,b_1\in \mathop {\mathrm {suc}}^n_T(a)$
are distinct, then
$b_0{\restriction } l(a)$
and
$b_1{\restriction } l(a)$
are incompatible in
${\mathord {\mathbb P}}_{l(a)}$
. Moreover, the set of all
$b{\restriction } l(a)$
with
$b \in \mathrm {suc}^n_T(a)$
forms a maximal antichain below a in
${\mathord {\mathbb P}}_{l(a)}$
. In particular, this set is not empty. -
(6)
$T_{n+1} = \bigcup \{ \mathrm {suc}^n_T (a) \; | \; a \in T_n\}$
Given such a nested antichain T in
$\vec {{\mathord {\mathbb P}}}$
with
$a_0=\mathrm {root}(T)$
, for a condition
$p \in {\mathord {\mathbb P}}_\beta $
with
$\beta <\nu $
we say that p is a mixture of T up to
$\beta $
if for all
$i<\beta $
the condition
$p{\restriction } i$
forces that
-
(1)
$p{\restriction }[i, i+1) \equiv a_0{\restriction } [i, i+1)$
in
${\mathord {\mathbb P}}_{i,i+1}(={\mathord {\mathbb P}}_{i+1}/\dot {G}_i)$
and
$a_0{\restriction } i\in \dot {G}_i$
if
$i<l(a_0)$
, where
$\dot {G}_i$
is the canonical name for the
${\mathord {\mathbb P}}_i$
-generic filter. -
(2)
$p{\restriction }[i,i+1) \equiv s{\restriction }[i,i+1)$
if there are
$r, s \in T$
with
$s \in \mathrm {suc}^n_T(r)$
for some n and
$l(r) \leq i < l(s)$
and
$s{\restriction } i \in \dot {G}_i$
. -
(3)
$p{\restriction }[i, i+1)\equiv 1_{i+1}{\restriction }[i,i+1)$
if there is a sequence
$ {\langle a_n\;|\; n<\omega \rangle } $
so that
$a_0\in T_0$
and for all
$n<\omega $
,
$a_{n+1} \in \mathrm {suc}^n_T(a_n)$
and
$l(a_n)\leq i$
and
$a_n\in \dot {G}_i{\restriction } l(a_n)$
.
If
$\beta $
is a limit ordinal we say that a sequence p of length
$\beta $
(not necessarily in
$\mathbb P_\beta $
) is
$(T, \beta )$
-nice if for all
$\alpha < \beta $
,
$p \upharpoonright \alpha $
is a mixture of T up to
$\alpha $
.
Finally, given two nested antichains S and T in
$\vec {{\mathord {\mathbb P}}}$
we define
$S \mathrel {\angle } T$
(“S hooks T”) if for every
$n < \omega $
and all
$b \in S_n$
there is an
$a \in T_{n+1}$
so that
$l(a) \leq l(b)$
and
$b\upharpoonright l(a) \leq a$
.
This previous definition combines Definitions 2.0, 2.4, and 2.10 of [Reference Miyamoto16]. We will need the following characterization of mixtures.
Fact 3.13 (see [Reference Miyamoto16, Proposition 2.5]).
Let T be a nested antichain in an iteration
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha <\nu \rangle }$
,
$\beta <\nu $
and
$p\in {\mathord {\mathbb P}}_\beta $
. Then p is a mixture of T up to
$\beta $
iff the following hold:
-
(1) Let
$T_0=\{a_0\}$
and
$\mu =\min (l(a_0),\beta )$
. Then
$a_0{\restriction }\mu \equiv p{\restriction }\mu $
. -
(2) For any
$a\in T$
, letting
$\mu =\min (l(a),\beta )$
, we have that
$a{\restriction }\mu \le p{\restriction }\mu $
. -
(3) If
$n<\omega $
,
$a\in T_n$
,
$b\in \mathop {\mathrm {suc}}_T^n(a)$
and
$l(a)\le \beta $
, then, letting
$\mu =\min (\beta ,l(b))$
, we have that
$b{\restriction }\mu \equiv b{\restriction } l(a){{}^\frown } p{\restriction }[l(a),\mu )$
. -
(4) For any
$i\le \beta $
and any
$q\in {\mathord {\mathbb P}}_i$
with
$q\le _i p{\restriction } i$
, if q forces with respect to
${\mathord {\mathbb P}}_i$
that there is a sequence
${\langle a_n\;|\;}{n<\omega \rangle }$
such that
$a_0\in T_0$
, and for all
$n<\omega $
,
$a_{n+1}\in \mathop {\mathrm {suc}}_T^n(a_n)$
,
$l(a_n)\le i$
and
$a_n\in \dot {G}_i{\restriction } l(a_n)$
, then
$q{{}^\frown } 1_\beta {\restriction }[i,\beta )\equiv q{{}^\frown } p{\restriction }[i,\beta )$
.
The following is Definition 3.6 in Miyamoto’s article.
Definition 3.14. An iteration
$ {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha <\nu \rangle } $
is called a nice iteration if
-
(1) For any i such that
$i+1<\nu $
, if
$p \in {\mathord {\mathbb P}}_i$
and
$\tau $
is a
${\mathord {\mathbb P}}_i$
-name such that
$p\Vdash _i$
“
$\tau \in {\mathord {\mathbb P}}_{i+1}$
and
$\tau {\restriction } i \in \dot {G_i}$
” then there is a
$q \in {\mathord {\mathbb P}}_{i +1}$
so that
$q \upharpoonright i = p$
and
$p \Vdash _i\tau \upharpoonright [i, i+1) \equiv q \upharpoonright [i, i+1)$
. -
(2) For any limit ordinal
$\beta < \nu $
and any sequence x of length
$\beta $
,
$x \in {\mathord {\mathbb P}}_\beta $
if and only if there is a nested antichain T in
$\langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha < \beta \rangle $
such that x is
$(T, \beta )$
-nice.
In its original formulation, the following corollary assumes the iteration in question to be rich, a concept we will not need here. But [Reference Miyamoto16, Proposition 3.7] says that nice iterations are rich, so we restate the corollary in terms of nice iterations.
Corollary 3.15 (Corollary 3.3 of [Reference Miyamoto16]).
Let
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha <j\rangle }$
be a nice iteration, and fix
$i\le \beta <j$
. Let
$p\in {\mathord {\mathbb P}}_i$
, and let
$\tau \in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
be such that
$p\Vdash _i$
“
$\tau \in {\mathord {\mathbb P}}_\beta $
and
$\tau {\restriction } i\in \dot {G}_i$
.” Then there is a
$q\in {\mathord {\mathbb P}}_\beta $
such that
$q{\restriction } i=p$
and
$p\Vdash _i$
“
$q{\restriction }[i,\beta )\equiv _{{\mathord {\mathbb P}}_{i,\beta }}\tau {\restriction }[i,\beta )$
.”
Lemma 3.16 (Lemma 2.7 of [Reference Miyamoto16]).
Let
$\nu $
be a limit ordinal and
$A \subseteq \nu $
be cofinal. Suppose that T is a nested antichain in an iteration
$\langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha < \nu \rangle $
and p is a sequence of length
$\nu $
such that p is
$(T, \nu )$
-nice. Then for any
$\beta < \nu $
and any
$s \in {\mathord {\mathbb P}}_\beta $
strengthening
$p \upharpoonright \beta $
we get a nested antichain S so that
-
(1) If
$T_0 = \{a_0\}$
and
$S_0 = \{b_0\}$
then
$l(b_0) \in A$
and
$l(a_0), \beta \leq l(b_0)$
. -
(2) For any
$b \in S$
,
$l(b) \in A$
. -
(3)
$r = s^\frown p \upharpoonright [\beta , \nu )$
is
$(S, \nu )$
-nice.
Lemma 3.17 (Lemma 2.11 of [Reference Miyamoto16]).
Let
$\nu $
be a limit ordinal and
$\langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha < \nu \rangle $
an iteration. Let
$A \subseteq \nu $
be a cofinal subset of
$\nu $
. If T and U are nested antichains, p and q are sequences of length
$\nu $
with
$p (T, \nu )$
-nice and
$q (U, \nu )$
-nice and
$r \in T_1$
so that
$q \upharpoonright l(r) \leq r$
and for all
$\alpha \in [l(r), \nu )$
,
$q \upharpoonright \alpha \leq r^\frown p\upharpoonright [l(r), \alpha )$
; then there is a nested antichain S in
$ {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha <\nu \rangle } $
so that q is
$(S, \nu )$
-nice, if
$\{b_0\} = S_0$
then
$l(r) \leq l(b_0)$
and
$b_0 \upharpoonright l(r) \leq r$
, for all
$s \in S$
,
$l(s) \in A$
and
$S \mathrel {\angle } T$
.
We also recall the definition of a fusion structure.
Definition 3.18 (Definition 3.4 of [Reference Miyamoto16]).
Let
$\vec {{\mathord {\mathbb P}}}= {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha \le \nu \rangle } $
be an iteration, where
$\nu $
is a limit ordinal. Given a nested antichain T in
$\vec {\mathbb P}{\restriction }\nu $
, we call a structure
$\langle (q^{(a, n)}, T^{(a, n)}) \;|\; a\in T_n, n<\omega \rangle $
a fusion structure if for all
$n<\omega $
and
$a\in T_n$
the following hold:
-
(1)
$T^{(a, n)}$
is a nested antichain in
$\langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha < \nu \rangle $
. -
(2)
$q^{(a, n)} \in {\mathord {\mathbb P}}_\nu $
is a mixture of
$T^{(a, n)}$
up to
$\nu $
. -
(3)
$a\leq q^{(a, n)}{\restriction } l(a)$
and
$l(a)=l(\mathrm {root}(T^{(a,n)}))$
. -
(4) For any
$b \in \mathrm {suc}^n_T(a), T^{(b, n+1)} \mathrel {\angle } T^{(a, n)}$
so
$q^{(b, n+1)} \leq q^{(a, n)}$
.
If
$p \in {\mathord {\mathbb P}}_\nu $
is a mixture of T up to
$\nu $
then we call p a fusion of the fusion structure.
Proposition 3.19 (Proposition 3.5 of [Reference Miyamoto16]).
Let
$ {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha \leq \nu \rangle } $
be an iteration, where
$\nu $
is a limit ordinal. If
$p\in {\mathord {\mathbb P}}_\nu $
is a fusion of a fusion structure
$\langle (q^{(a, n)}, T^{(a, n)})\;|\; a\in T_n, n<\omega \rangle $
then p forces that there is a sequence
$ {\langle a_n\;|\; n<\omega \rangle } $
such that the following hold:
-
(1)
$a_0\in T_0$
, and for all
$n<\omega $
,
$a_{n+1}\in \mathrm {suc}^n_T(a_n)$
,
$a_n\in \dot {G}_\nu {\restriction } l(a_n)$
and
$q^{(a_n, n)}\in \dot {G}_\nu $
. -
(2) If
$\beta =\sup \{l(a_n)\;|\; n<\omega \}$
then
$q^{(a_n, n)}{\restriction }\beta \in \dot {G}_\nu {\restriction }\beta $
and
$q^{(a_n,n)}{\restriction }[\beta ,\nu )\equiv 1_\nu {\restriction }[\beta ,\nu )$
.
3.3 Nice iterations of
$\infty $
-subcomplete forcing
First we prove that
$\infty $
-subcomplete forcing is preserved under nice iterations. We use the following notational convention: if
$\langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha \leq \nu \rangle $
is an iteration then for
$i \leq j \leq \nu $
the poset
${\mathord {\mathbb P}}_{i, j}$
, which is defined in Fact 3.10, depends on the
${\mathord {\mathbb P}}_i$
-generic chosen, so we will identify it with its
${\mathord {\mathbb P}}_i$
name
${\mathord {\mathbb P}}_j/\dot {G}_i$
.
The special case
$i=0$
and
$j=\nu $
of following theorem implies that if every successor stage of a nice iteration
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \le \nu \rangle }$
is forced to be
$\infty $
-subcomplete, then
${\mathord {\mathbb P}}_\nu $
is
$\infty $
-subcomplete.
Theorem 3.20. Let
$\vec {\mathbb P}= {\langle {\mathord {\mathbb P}}_\alpha \;|\;\alpha \leq \nu \rangle } $
be a nice iteration so that
${\mathord {\mathbb P}}_0=\{1_0\}$
and for all i with
$i+1<\nu $
,
$\Vdash _i{\mathord {\mathbb P}}_{i,i+1}$
is
$\infty $
-subcomplete. Then for all
$j\le \nu $
the following statement
$\varphi (j)$
holds:
if
$i\le j$
,
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$\theta $
is a sufficiently large cardinal,
$\tau $
is an ordinal,
$H_\theta \subseteq N=L_\tau ^A\models \mathsf {ZFC}^-$
,
${\bar {N}}$
is a transitive model,
${\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j}\in {\bar {N}}$
,
$\bar {G}_{\bar {i}},\bar {G}_{\bar {i},\bar {j}}\subseteq {\bar {N}}$
, and the following assumptions hold:
-
(A1) p forces with respect to
${\mathord {\mathbb P}}_i$
that
$$\begin{align*}\dot{\sigma}(\check{\bar{\vec{{\mathord{\mathbb P}}}}},\check{\bar{i}},\check{\bar{j}},\check{{\bar{\theta}}},\check{{\bar{G}}}_{\bar{i}})=\check{\vec{{\mathord{\mathbb P}}}},\check{i},\check{j},\check{\theta},\dot{G}_i.\end{align*}$$
-
(A2)
$\bar {G}_{\bar {i}}$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {i}}$
-generic over
${\bar {N}}$
and
$\bar {G}_{\bar {i},\bar {j}}$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {i},\bar {j}}$
-generic over
${\bar {N}}[\bar {G}_{\bar {i}}]$
, where
$\bar {{\mathord {\mathbb P}}}_{\bar {i},\bar {j}}=\bar {{\mathord {\mathbb P}}}_{\bar {j}}/\bar {G}_{\bar {i}}$
. -
(A3)
${\bar {N}}$
is countable, transitive and full, and p forces with respect to
${\mathord {\mathbb P}}_i$
that
$$\begin{align*}\dot{\sigma}:\check{{\bar{N}}}[\check{{\bar{G}}}_{\bar{i}}]\prec \check{N}[\dot{G}_i].\end{align*}$$
then there is a condition
$p^*\in {\mathord {\mathbb P}}_j$
such that
$p^*{\restriction } i=p$
and whenever
$G_j\ni p^*$
is
${\mathord {\mathbb P}}_j$
-generic, then in
$\mathrm {V}[G_j]$
, there is a
$\sigma '$
such that, letting
$\sigma =\dot {\sigma }^{G_i}$
, the following hold:
-
(C1)
$\sigma '({\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }},{\bar {G}}_{\bar {i}})=\sigma ({\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }},{\bar {G}}_{\bar {i}})$
. -
(C2)
$(\sigma ')"\bar {G}_{\bar {i},\bar {j}}\subseteq G_{i,j}$
. -
(C3)
$\sigma ':{\bar {N}}[{\bar {G}}_{\bar {i}}]\prec N[G_i]$
.
Let us stress that our proof is similar to that of [Reference Miyamoto16, Lemma 4.3], adapting to the case of
$\infty $
-subcomplete forcings in place of semiproper forcings.
Proof. The proof is by induction on j. So let us assume that
$\varphi (j')$
holds for every
$j'<j$
. Fix some
$i\le j$
. Since nothing is to be shown when
$i=j$
, let
$i<j$
. In particular, the case
$j=0$
is trivial.
Let us fix
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$\theta $
,
$\tau $
, A, N,
${\bar {N}}$
,
${\bar {s}}$
,
$\bar {\vec {{\mathord {\mathbb P}}}}$
,
$\bar {i}$
,
$\bar {j}$
,
$\bar {G}_{\bar {i}}$
,
$\bar {G}_{\bar {i},\bar {j}}$
so that assumptions (A1)–(A3) hold.
When it causes no confusion, if a is in the range of some elementary embedding
$\sigma _0: {\bar {N}} \prec N$
then we will denote
$\sigma _0^{-1}(a)$
by
$\overline {a}$
.
Case 1: j is a limit ordinal.
Let
$\{t_n \; | \; n < \omega \}$
enumerate the elements of
${\bar {N}}[{\bar {G}}_{\bar {i}}]$
, with
$t_0=\emptyset $
. Throughout this proof we will identify the
$t_n$
’s with their check names when it causes no confusion. Also let
$\{\overline {p}_n \; | \; n <\omega \}$
enumerate the elements of
$\bar {G}_{\bar {i}}*\bar {G}_{\bar {i},\bar {j}}$
, with
$\bar {p}_0=1_{\bar {{\mathord {\mathbb P}}}_{\bar {j}}}$
. It follows then that p forces that
$\dot {\sigma }(\check {\overline {p}}_0)=\check {1}_j$
, so we write
$p_0=1_j$
.
Note that since in some forcing extension, there is an elementary embedding from
${\bar {N}}$
to
$N = L_\tau ^A$
, it follows that
${\bar {N}}$
is of the form
$L_{\bar {\tau }}^{\bar {A}}$
, and hence,
${\bar {N}}$
has a canonical definable well-order, which we denote by
$<_{\bar {N}}$
. Since
$\bar {p}_0=1_{\bar {{\mathord {\mathbb P}}}_{\bar {j}}}$
, there is a trivial nested antichain
$\bar {W}\in {\bar {N}}$
in
$\vec {\bar {{\mathord {\mathbb P}}}}{\restriction }\bar {j}$
so that
$\bar {p_0}$
is a mixture of
$\bar {W}$
up to
$\bar {j}$
and
$l(\mathrm {root}(\bar {W}))=\bar {i}$
. Letting
$\bar {W}$
be the
$<_{\bar {N}}$
-least one, we know that p forces that
$\dot {\sigma }(\check {\bar {W}})$
is the
$L_\tau ^A$
-least nested antichain W in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
such that
$p_0$
is a mixture of W up to j and such that the length of the root of W is i, since we know that p forces that
$\bar {p}_0,\bar {i},\bar {j}$
are mapped to
$p_0,i,j$
by
$\dot {\sigma }$
, respectively.
We will define a nested antichain
$\langle T, \langle T_n \; | \; n < \omega \rangle , \langle \mathop {\mathrm {suc}}^n_T \; | \; n < \omega \rangle \rangle $
in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
, a fusion structure
${\langle {\langle q^{(a, n)}, T^{(a, n)} \rangle } \;|\;}{n < \omega , a\in T_n\rangle }$
in
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \leq j\rangle }$
and a sequence
$\langle \dot {\sigma }^{(a, n)} \; | \; n < \omega , a \in T_n\rangle $
so that the following conditions hold.
-
(1)
$T_0 = \{p\}$
,
$q^{(p,0)}=p_0$
,
$T^{(p,0)}=W$
and
$\dot {\sigma }^{(p,0)} = \dot {\sigma }$
.
Further, for any
$n<\omega $
and
$a\in T_n$
:
-
(2)
$q^{(a, n)}\in {\mathord {\mathbb P}}_j$
and
$\dot {\sigma }^{(a, n)}$
is a
${\mathord {\mathbb P}}_{l(a)}$
-name, -
(3) a forces the following statements with respect to
${\mathord {\mathbb P}}_{l(a)}$
:-
(a)
$\dot {\sigma }^{(a, n)} : {\bar {N}}[{\bar {G}}_{\bar {i}}]\prec N[\dot {G}_i]$
, -
(b)
$\dot {\sigma }^{(a, n)}(\overline {\theta }, \bar {\vec {{\mathord {\mathbb P}}}}, \overline {s}, \overline {\nu }, \bar {i},\bar {j},\bar {G}_{\bar {i}}) = \theta , \vec {{\mathord {\mathbb P}}}, \tau ,\dot {\sigma }({\bar {s}}), \nu , i, j, \dot {G}_i$
, -
(c)
$q^{(a, n)} \leq _j \dot {\sigma }^{(a, n)}(\overline {p}_n)$
, and
$q^{(a,n)}\in \mathrm {ran} (\dot {\sigma }^{(a,n)})$
.
-
-
(4) for some
$\bar {q}^{(a,n)}\in \bar {{\mathord {\mathbb P}}}_{\bar {j}}$
,
$\bar {T}^{(a,n)}\in {\bar {N}}$
and
$\overline {l(a)}\in {\bar {N}}$
, we have that
$\bar {q}^{(a, n)} \in {\bar {G}}_{\bar {i}}*\bar {G}_{\bar {i},\bar {j}}$
,
$\bar {q}^{(a, n)} \leq \bar {p}_n$
and
$a \Vdash \dot {\sigma }^{(a, n)} ( {\langle \bar {q}^{(a, n)}, \bar {T}^{(a, n)}, \overline {l(a)} \rangle } ) = {\langle q^{(a, n)}, T^{(a, n)}, l(a) \rangle } $
.
If
$b \in \mathrm {suc}^n_T (a)$
, then
-
(5)
$b \Vdash _{l(b)} \dot {\sigma }^{(b, n+1)}(t_m) = \dot {\sigma }^{(a, n)}(t_m)$
and
$\dot {\sigma }^{(b, n+1)}(\bar {p}_m) = \dot {\sigma }^{(a, n)}(\bar {p}_m)$
for all
$m\le n$
. -
(6)
$b{\restriction } l(a)\Vdash _{l(a)}q^{(b,n+1)},T^{(b,n+1)}\in \mathrm {ran} (\dot {\sigma }^{(a,n)})$
.
First let’s see that constructing such objects is sufficient to prove the existence of a condition
$p^*$
as in the statement of the theorem. So suppose that we have constructed a nested antichain
$\langle T, \langle T_n \; | \; n < \omega \rangle , \langle \mathop {\mathrm {suc}}^n_T \; | \; n < \omega \rangle \rangle $
, a fusion structure
${\langle {\langle q^{(a, n)}, T^{(a, n)} \rangle } \;|\;}{n < \omega , a\in T_n\rangle }$
in
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \leq j\rangle }$
and a sequence
$\langle \dot {\sigma }^{(a, n)} \; | \; n < \omega , a \in T_n\rangle $
, so that (1) through (6) above are satisfied. Let
$q^*\in {\mathord {\mathbb P}}_j$
be a fusion of the fusion structure, and let
$p^*=p{{}^\frown } q^*{\restriction }[i,j)$
. To see that
$p^*$
is as wished, note first that by (1), we have that
$q^*{\restriction } i\equiv p$
, so
$p^*\equiv q^*$
and
$p^*{\restriction } i=p$
, as required. Now let
$G_j$
be
${\mathord {\mathbb P}}_j$
-generic over
$\mathrm {V}$
with
$p^* \in G_j$
. We have to show that in
$\mathrm {V}[G_j]$
, there is a
$\sigma '$
so that conclusions (C1)-(C3) are satisfied. Since
$p^*\equiv q^*$
, we have that
$q^*\in G_j$
. Work in
$\mathrm {V}[G_j]$
. By Proposition 3.19 there is a sequence
$\langle a_n \; | \; n < \omega \rangle \in \mathrm {V}[G_j]$
so that for all
$n < \omega $
,
$a_n\in T_n$
,
$a_{n+1} \in \mathrm {suc}^n_T(a_n)$
,
$a_n \in G_j \upharpoonright l(a_n)$
and
$q^{(a_n, n)} \in G_j$
. Let
$\sigma _n$
be the evaluation of
$\dot {\sigma }^{(a_n, n)}$
by
$G_j$
. Define
$\sigma ': {\bar {N}}[{\bar {G}}_{\bar {i}}] \to N[G_i]$
by
$\sigma '(t_n) = \sigma _n (t_n)$
. We claim that
$\sigma '$
satisfies the conclusions (C1)-(C3).
Condition (C1) says that
$\sigma '$
moves the parameters
$\bar {s},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }}$
and
${\bar {G}}_{\bar {i}}$
the same way
$\sigma =\dot {\sigma }^{G_i}$
does. But this is true of every
$\sigma _n$
, hence also of
$\sigma '$
.
Condition (C2) says that
$(\sigma ')"{\bar {G}}_{\bar {i},\bar {j}}\subseteq G_{i,j}$
. So let
${\bar {p}}\in {\bar {G}}_{\bar {i},\bar {j}}$
. We have to show that
$\sigma '({\bar {p}})\in G_{i,j}$
. Recall
${\bar {G}}_{\bar {i}}*{\bar {G}}_{\bar {i},\bar {j}} = \{\overline {p}_n \; | \; n < \omega \}$
. Let n be such that
${\bar {p}}={\bar {p}}_n{\restriction }[\bar {i},\bar {j})$
. By (3)(c), we have that
$q^{(a_n, n)}\leq _j\sigma _n(\overline {p}_n)$
, so since
$q^{(a_n, n)}\in G_j$
, it follows that
$\sigma _n(\overline {p}_n)\in G_j$
as well. By (5) and the definition of
$\sigma '$
, we have that
$\sigma _n(\overline {p}_n) = \sigma '(\overline {p}_n)$
. It follows that
$\sigma '({\bar {p}})=\sigma '({\bar {p}}_n{\restriction }[\bar {i},\bar {j}))=\sigma '({\bar {p}}_n){\restriction }[i,j)\in G_{i,j}$
, as claimed.
Condition (C3) says that
$\sigma ':{\bar {N}}[\bar {G}_{\bar {i}}]\prec N[G_i]$
is elementary. Since any one formula can only use finitely many parameters, and
$\sigma '{\restriction }\{t_0,\ldots ,t_n\}=\sigma _n{\restriction }\{t_0,\ldots ,t_n\}$
, this is true by (5) and (3)(a).
Therefore it remains to show that the construction described above can actually be carried out. This is done by recursion on n. It proceeds as follows. At stage
$n+1$
of the construction, we assume that for all
$m\le n$
and all
$a\in T_m$
, we have defined
$T_m$
,
$T^{(a,m)}$
,
$q^{(a,m)}$
, and
$\dot {\sigma }^{(a,m)}$
. Also, for
$m<n$
and
$a\in T_m$
, we assume that
$\mathop {\mathrm {suc}}_T^m(a)$
has been defined. Our inductive hypothesis is that for all
$m\le n$
and all
$a\in T_m$
, conditions (2)–(4) hold, and that for all
$m<n$
, all
$a\in T_m$
and all
$b\in \mathop {\mathrm {suc}}_T^m(a)$
, conditions (5) and (6) are satisfied. In order to define
$T_{n+1}$
, we will specify
$\mathop {\mathrm {suc}}_T^n(a)$
, for every
$a\in T_n$
, which implicitly defines
$T_{n+1}=\bigcup _{a\in T_n}\mathop {\mathrm {suc}}_T^n(a)$
. Simultaneously, we will define, for every such a and every
$b\in \mathop {\mathrm {suc}}_T^n(a)$
, the objects
$T^{(b,n+1)}$
,
$q^{(b,n+1)}$
, and
$\dot {\sigma }^{(b,n+1)}$
in such a way that whenever
$a\in T_n$
and
$b\in \mathop {\mathrm {suc}}_T^n(a)$
, (5) and (6) are satisfied by a and b, and (2)–(4) are satisfied by b and
$n+1$
(instead of a and n). In order to ensure that we ultimately produce a fusion structure, we arrange that
$q^{(b,n+1)}$
is a mixture of
$T^{(b,n+1)}$
up to j,
$b\le q^{(b,n+1)}{\restriction } l(b)$
,
$l(b)=l(\mathrm {root}(T^{(b,n+1)}))$
and
$T^{(b,n+1)}\mathrel {\angle } T^{(a,n)}$
, so that Definition 3.18(2)–(4) hold (and we also assume that the corresponding statements are true of the earlier defined
$q^{(c,k)}$
and
$T^{(c,k)}$
).
For stage 0 of the construction, notice that (1) gives the base case where
$n =0$
and in this case (2)-(4) are satisfied, p forces that
$q^{(p, 0)}=p_0=\dot {\sigma }(\overline {p}_0)$
and p forces that
$W=T^{(p,0)}$
has a preimage under
$\dot {\sigma }$
, namely
$\bar {W}$
. Note that we have
$p\le _{l(p)}q^{(p,0)}{\restriction } l(p)=1_i$
and
$l(p)=i=l(\mathrm {root}(T^{(p,0)}))$
, as required in a fusion structure.
At stage
$n+1$
of the construction, we work under the assumptions described above. Fixing
$a\in T_n$
, we have to define
$\mathop {\mathrm {suc}}_T^n(a)$
. To this end, let D be the set of all conditions
$b\in \bigcup _{l(a)\le \xi <j}{\mathord {\mathbb P}}_\xi $
for which there are a nested antichain S in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
and objects
$\dot {\sigma }^b$
, u,
$\bar {u}$
,
$\bar {S}$
and
$\overline {l(b)}$
satisfying the following:
-
(D1)
$b{\restriction } l(a)\le _{l(a)}a$
. -
(D2)
$S \mathrel {\angle } T^{(a, n)}$
,
${\bar {S}}\in {\bar {N}}$
,
$S\in N$
. -
(D3)
$u\in {\mathord {\mathbb P}}_j$
,
$u\le q^{(a,n)}$
and u is a mixture of S up to j. -
(D4)
$b\le _{l(b)}u{\restriction } l(b)$
and
$l(b)=l(\mathrm {root}(S))$
. -
(D5)
$\overline {u} \in {\bar {G}}_{\bar {i}}*{\bar {G}}_{\bar {i},\bar {j}}$
, and
$\overline {u} \leq \overline {p}_{n+1}$
. -
(D6)
$b{\restriction } l(a)\Vdash _{l(a)}\dot {\sigma }^{(a,n)}(\check {{\bar {S}}},\check {\bar {u}},(\overline {l(b)})\check {}) =\check {S},\check {u},(l(b))\check {}$
. -
(D7) b forces the following statements with respect to
${\mathord {\mathbb P}}_{l(b)}$
:-
(a)
$\dot {\sigma }^b (\overline {\theta },\bar {i},\bar {j},\bar {\vec {{\mathord {\mathbb P}}}},{\bar {G}}_{\bar {i}}, \overline {s},\overline {u},{\bar {S}},(\overline {l(b)})\check {}) = \theta ,i,j,\vec {{\mathord {\mathbb P}}},\dot {G}_i,\dot {\sigma }({\bar {s}}), u,S,(l(b))\check {}$
. -
(b)
$\forall m \leq n \dot {\sigma }^b(t_m) = \dot {\sigma }^{(a, n)}(t_m)$
and
$\dot {\sigma }^b(\overline {p}_m) = \dot {\sigma }^{(a, n)}(\overline {p}_m)$
. -
(c)
$\dot {\sigma }^b: {\bar {N}}[{\bar {G}}_{\bar {i}}] \prec N[\dot {G}_i]$
.
-
Note that if
$b\in D$
and
$b'\le _{l(b)}b$
, then
$b'\in D$
as well. It follows that
$D{\restriction } l(a):=\{b{\restriction } l(a)\;|\; b\in D\}$
is open in
${\mathord {\mathbb P}}_{l(a)}$
. Thus, it suffices to show that
$D{\restriction } l(a)$
is predense below a in
${\mathord {\mathbb P}}_{l(a)}$
. For if we know this,
$D{\restriction } l(a)$
is dense below a, and we may choose a maximal antichain
$A\subseteq D{\restriction } l(a)$
(with respect to
${\mathord {\mathbb P}}_{l(a)}$
), which then is a maximal antichain in
${\mathord {\mathbb P}}_{l(a)}$
below a. Thus, for every
$c\in A$
, we may pick a condition
$b(c)\in D$
such that
$b(c){\restriction } l(a)=c$
, and define
$\mathop {\mathrm {suc}}_T^n(a)=\{b(c)\;|\; c\in A\}$
(in order to satisfy Definition 3.12, part
$(5)$
). Now, for every
$b\in \mathop {\mathrm {suc}}_T^n(a)$
, let S,
$\dot {\sigma }^b$
, u and
$\bar {u}$
witness that
$b\in D$
, i.e., let them be chosen in such a way that (D1)–(D7) hold. Set
$T^{(b,n+1)}=S$
,
$\dot {\sigma }^{(b, n+1)}=\dot {\sigma }^b$
,
$q^{(b, n+1)}=u$
,
$\bar {q}^{(b,n+1)}=\bar {u}$
and
$\bar {T}^{(b,n+1)}={\bar {S}}$
. Then a, b satisfy (5) and (6) at stage n, and b satisfies (2) and (4) at stage
$n+1$
.
To see that
$D{\restriction } l(a)$
is predense below a, let
$G_{l(a)}$
be
${\mathord {\mathbb P}}_{l(a)}$
-generic over V with
$a \in G_{l(a)}$
. We have to find a
$b\in D$
so that
$b \upharpoonright l(a) \in G_{l(a)}$
. Work in
$V[G_{l(a)}]$
. Let
$\sigma _n =(\dot {\sigma }^{(a, n)})^{G_{l(a)}}$
. Since (3) holds at stage n, we have that
$\sigma _n:{\bar {N}}[{\bar {G}}_{\bar {i}}]\prec N[G_i]$
and
$\sigma _n(\overline {\theta }, \bar {\vec {{\mathord {\mathbb P}}}},{\bar {s}},\overline {\nu },\bar {i},\bar {j},{\bar {G}}_{\bar {i}}) =\theta ,\vec {{\mathord {\mathbb P}}},\sigma ({\bar {s}}),\nu ,i,j,G_i$
. We also have objects
$\bar {q}^{(a,n)},{\bar {T}}^{(a,n)},\overline {l(a)}$
satisfying condition (4), so that
$\bar {q}^{(a,n)}\in {\bar {G}}_{\bar {i}}*{\bar {G}}_{\bar {i},\bar {j}}$
,
${\bar {T}}^{(a,n)}\in {\bar {N}}$
,
$\bar {q}^{(a,n)}\le {\bar {p}}_n$
,
$\sigma _n(\bar {q}^{(a,n)},{\bar {T}}^{(a,n)})=q^{(a,n)},T^{(a,n)}$
and
$\sigma _n(\overline {l(a)})=l(a)$
.
First we find the requisite u and
$\bar {u}$
. By elementarity of
$\sigma _n$
,
$\bar {q}^{(a, n)}$
is a mixture of
$\bar {T}^{(a, n)}$
up to
$\overline {j}$
.
Let
${\bar {T}}_0^{(a,n)}=\{{\bar {a}}_0\}$
. Let’s write
${\bar {G}}_{\bar {j}}={\bar {G}}_{\bar {i}}*{\bar {G}}_{\bar {i},\bar {j}}$
, and for
$k\le \bar {j}$
, let’s set
${\bar {G}}_k={\bar {G}}_{\bar {j}}{\restriction } k$
. Since
$\bar {T}^{(a,n)}$
is a nested antichain in
$\vec {\bar {{\mathord {\mathbb P}}}}{\restriction }\bar {j}$
, it is also a nested antichain in
$\vec {\bar {{\mathord {\mathbb P}}}}{\restriction }(\bar {j}+1)$
, so since
$\bar {j}<\bar {j}+1$
and
$\bar {q}^{(a,n)}\in \bar {{\mathord {\mathbb P}}}_{\bar {j}}$
, Fact 3.13.(1) applies, yielding that
${\bar {a}}_0\equiv \bar {q}^{(a,n)}{\restriction } l({\bar {a}}_0)\in {\bar {G}}_{l({\bar {a}}_0)}$
, since
$l(\bar {q}^{(a,n)})=\bar {j}>l({\bar {a}}_0)$
. So
${\bar {a}}_0\in {\bar {G}}_{l({\bar {a}}_0)}$
. Let
$\bar {r}\in {\bar {T}}_1^{(a,n)}$
, that is,
$\bar {r}\in \mathop {\mathrm {suc}}_{{\bar {T}}^{(a,n)}}^0({\bar {a}}_0)$
, be such that
$\bar {r}{\restriction } l({\bar {a}}_0)\in \bar {G}_{l({\bar {a}}_0)}$
. There is such an
$\bar {r}$
by Definition 3.12(5). By Fact 3.13.(3), again since
$l(\bar {r})<\bar {j}=l(\bar {q}^{(a,n)})$
, it follows that
$\bar {r}\equiv \bar {r}{\restriction } l({\bar {a}}_0){{}^\frown }\bar {q}^{(a,n)}{\restriction }[l({\bar {a}}_0),l(\bar {r}))$
. Since
$\bar {r}{\restriction } l({\bar {a}}_0)\in {\bar {G}}_{l({\bar {a}}_0)}$
, this implies that
$\bar {r}{\restriction }[l({\bar {a}}_0),l(\bar {r}))\equiv \bar {q}^{(a,n)}{\restriction }[l({\bar {a}}_0),l(\bar {r}))$
(in the partial order
$\bar {{\mathord {\mathbb P}}}_{l({\bar {a}}_0),l(\bar {r})}=\bar {{\mathord {\mathbb P}}}_{l(\bar {r})}/{\bar {G}}_{l({\bar {a}}_0)}$
), and
$\bar {q}^{(a,n)}{\restriction }[l({\bar {a}}_0),l(\bar {r}))\in {\bar {G}}_{\bar {j}}{\restriction }[l({\bar {a}}_0),l(\bar {r}))$
. So we have that
$\bar {r}{\restriction } l({\bar {a}}_0)\in {\bar {G}}_{l({\bar {a}}_0)}$
and
$\bar {r}{\restriction }[l({\bar {a}}_0),l(\bar {r}))\in {\bar {G}}_{\bar {j}}{\restriction }[l({\bar {a}}_0),l(\bar {r}))$
. By Fact 3.10.(3), this implies that
$\bar {r}\in {\bar {G}}_{l(\bar {r})}$
.
It follows that
$\overline {r}{{}^\frown }\overline {q}^{(a, n)}{\restriction }[l(\bar {r}), \bar {j})\in {\bar {G}}_{\bar {j}}$
, again using Fact 3.10(3). Let
$\overline {u} \in {\bar {G}}_{\bar {j}}$
strengthen both
$\overline {r}{{}^\frown }\overline {q}^{(a, n)}{\restriction }[l(\overline {r}),\bar {j})$
and
$\overline {p}_{n+1}$
. By Lemma 3.17, applied in
$\bar {N}$
, there is a nested antichain
$\bar {S} \mathrel {\angle } \bar {T}^{(a, n)}$
such that
$\bar {u}$
is a mixture of
${\bar {S}}$
up to
$\bar {j}$
and such that letting
${\bar {S}}_0 = \{{\bar {d}}_0\}$
, we have that
$l(\bar {r}) \leq l({\bar {d}}_0)$
and
${\bar {d}}_0 {\restriction } l(\bar {r}) \leq \bar {r}$
. Let
$S,d_0,u=\sigma _n({\bar {S}},{\bar {d}}_0,{\bar {u}})$
, and let
$w\in G_{l(a)}$
force this. Since
$a\in G_{l(a)}$
, we may choose w so that
$w\le a$
.
Note that
$S,d_0,u$
are in N (and hence in
$\mathrm {V}$
), since
${\bar {S}},{\bar {d}}_0,{\bar {u}}\in {\bar {N}}$
.
We are going to apply our inductive hypothesis
$\varphi (l(d_0))$
, noting that
$l(d_0)<j$
, to
$i =l(a) \leq l(d_0)$
, the filters
${\bar {G}}_{\overline {l(a)}}$
,
${\bar {G}}_{\overline {l(a)},l({\bar {d}}_0)}$
, the models
${\bar {N}}$
, N, the condition w (in place of p), the name
$\dot {\sigma }^{(a,n)}$
(in place of
$\dot {\sigma }$
and the parameter
${\bar {s}}'\in {\bar {N}}$
which we will specify below). No matter which
${\bar {s}}'$
we choose, by the inductive hypothesis, there is a condition
$w^*\in {\mathord {\mathbb P}}_{l(d_0)}$
with
$w^*{\restriction } l(a)=w$
and a name
$\dot {\sigma }'$
such that
$w^*$
forces with respect to
${\mathord {\mathbb P}}_{l(d_0)}$
:
-
(a)
$\dot {\sigma }'(\check {{\bar {s}}}',\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\overline {l(a)}},\check {l(\overline {d}_0)},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\overline {l(a)}})=\dot {\sigma }^{(a,n)}(\check {{\bar {s}}}',\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\overline {l(a)}},\check {l(\overline {d}_0)},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\overline {l({a})}})$
. -
(b)
$(\dot {\sigma }')"\check {\bar {G}}_{\overline {l(a)},l({\bar {d}}_0)}\subseteq \dot {G}_{l(a),l(d_0)}$
. -
(c)
$\dot {\sigma }':\check {{\bar {N}}}[\check {{\bar {G}}}_{\overline {l(a)}}]\prec \check {N}[\dot {G}_{l(a)}]$
.
By choosing
${\bar {s}}'$
appropriately, we may insure that it is forced that
$\dot {\sigma }'$
moves any finite number of members of
${\bar {N}}$
the same way
$\dot {\sigma }^{(a,n)}$
does. Thus, we may insist that
$w^*$
forces that
$\dot {\sigma }'({\bar {u}},{\bar {d}}_0,{\bar {S}})=\dot {\sigma }^{(a,n)}({\bar {u}},{\bar {d}}_0,{\bar {S}})$
. Recall that w forced that
$\dot {\sigma }^{(a,n)}({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
. Hence, since
$w^*{\restriction } l(a)=w$
, we get that
$w^*$
forces that
$\dot {\sigma }'({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
as well.
In addition, we may insist that
$\sigma '$
moves the parameters
$\bar {i}$
,
$\bar {j}$
,
$\bar {\vec {{\mathord {\mathbb P}}}}$
,
${\bar {\theta }}$
,
${\bar {s}}$
,
${\bar {p}}_0$
,
$\ldots $
,
${\bar {p}}_n$
,
$t_0$
,
$\ldots $
,
$t_n$
the same way
$\dot {\sigma }^{(a,n)}$
does. Note that already a forced with respect to
${\mathord {\mathbb P}}_{l(a)}$
that
$\bar {i},\bar {j},\bar {\vec {{\mathord {\mathbb P}}}},{\bar {\theta }}$
are mapped to
$i,j,\vec {{\mathord {\mathbb P}}},\theta $
by
$\dot {\sigma }^{(a,n)}$
.
Now, setting
$b=w^*$
, and letting
$\dot {\sigma }^b$
be a name for the restriction of
$\dot {\sigma }'$
to
${\bar {N}}[{\bar {G}}_{\bar {i}}]$
, conditions (D1)–(D7) are satisfied, that is,
$b\in D$
. Most of these are obvious; let us just remark that b forces that
$\dot {\sigma }^b({\bar {G}}_{\bar {i}})=\dot {G}_i$
because it forces that
$\dot {\sigma }'(\bar {i})=i$
and
$\dot {\sigma }'({\bar {G}}_{\overline {l(a)}})=\dot {G}_{l(a)}$
. Condition (D4) holds because
$l(b)=l(w^*)=l(d_0)$
and
$d_0=\mathrm {root}(S)$
. To see that
$b=w^*\le u{\restriction } l(d_0)$
, note that
$w^*$
forces with respect to
${\mathord {\mathbb P}}_{l(d_0)}$
that
$\dot {\sigma }'"\bar {G}_{l(\bar {d}_0)}\subseteq \dot {G}_{l(b)}$
and that
$\dot {\sigma }'(\bar {u}{\restriction } l(\bar {d}_0))=u{\restriction } l(d_0)$
. Since
$\bar {u}{\restriction } l(\bar {d}_0)\in \bar {G}_{l(\bar {d}_0)}$
, it follows that b forces that
$u{\restriction } l(d_0)\in \dot {G}_{l(d_0)}$
. This means that
$b\le _{l(b)}u{\restriction } l(d_0)$
, as claimed. Condition (D6) holds because
$b{\restriction } l(a)=w$
. For the same reason, we have that
$b{\restriction } l(a)\in G_{l(a)}$
, completing the proof that
$D{\restriction } l(a)$
is predense below a. This concludes the treatment of case 1.
Case 2: j is a successor ordinal.
Let
$j=k+1$
. Since we assumed
$i<j$
, it follows that
$i\le k$
. Inductively, we know that
$\varphi (k)$
holds. Note that
$\bar {j}$
is of the form
${\bar {k}}+1$
, where p forces with respect to
${\mathord {\mathbb P}}_i$
that
$\dot {\sigma }({\bar {k}})=k$
, and if we let
${\bar {G}}_{{\bar {k}}}={\bar {G}}_{\bar {j}}{\restriction }{\bar {k}}$
, then the assumptions (A1)–(A3) are satisfied by
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$\theta $
,
$\tau $
, A, N,
${\bar {N}}$
,
${\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {k}\in {\bar {N}}$
,
$\bar {G}_{\bar {i}},\bar {G}_{\bar {i},\bar {k}}\subseteq {\bar {N}}$
and k. By
$\varphi (k)$
, we obtain a condition
$p^{**}\in {\mathord {\mathbb P}}_k$
with
$p^{**}{\restriction } i=p$
and a
${\mathord {\mathbb P}}_k$
-name
$\dot {{\bar {\sigma }}}$
such that
$p^{**}$
forces with respect to
${\mathord {\mathbb P}}_k$
:
-
(a1)
$\dot {{\bar {\sigma }}}(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\bar {i}})=\dot {\sigma }(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\bar {i}})$
. -
(b1)
$\dot {{\bar {\sigma }}}"\check {\bar {G}}_{\bar {i},\bar {k}}\subseteq \dot {G}_{i,k}$
. -
(c1)
$\dot {{\bar {\sigma }}}:\check {{\bar {N}}}[\check {{\bar {G}}}_{\bar {i}}]\prec \check {N}[\dot {G}_i]$
.
It follows then that
$p^{**}$
forces that
$\dot {{\bar {\sigma }}}"{\bar {G}}_{\bar {k}}\subseteq \dot {G}_k$
, and hence that
$\dot {{\bar {\sigma }}}$
lifts to an elementary embedding from
${\bar {N}}[{\bar {G}}_{\bar {k}}]\prec N[\dot {G}_k]$
that maps
${\bar {G}}_{\bar {k}}$
to
$\dot {G}_k$
. Let
$\dot {{\tilde {\sigma }}}$
be a
${\mathord {\mathbb P}}_k$
-name such that
$p^{**}$
forces that
$\dot {{\tilde {\sigma }}}$
is that lifted embedding.
Temporarily fix a
${\mathord {\mathbb P}}_k$
-generic filter H that contains
$p^{**}$
. In
$\mathrm {V}[H]$
, the forcing
${\mathord {\mathbb P}}_{k,k+1}={\mathord {\mathbb P}}_{k,j}={\mathord {\mathbb P}}_j/H$
is
$\infty $
-subcomplete. Note that the structure
$N[H]=L_\tau ^A[H]$
can be thought of as having the form
$L_\tau ^{A\oplus H}$
, and similarly,
$\bar {N}[\bar {G}_{\bar {k}}]$
can be thought of as having the form
$L_{\bar {\tau }}^{\bar {A}\oplus \bar {G}_{\bar {k}}}$
, where
$x\oplus y=x\times \{0\}\cup y\times \{1\}$
, say. Then,
$\bar {N}[\bar {G}_{\bar {k}}]$
is full and has the right form, and letting
${\tilde {\sigma }}=\dot {{\tilde {\sigma }}}^H$
, we have that
${\tilde {\sigma }}:{\bar {N}}[{\bar {G}}_{\bar {k}}]\prec N[H]$
, and thus, there is a condition q in
${\mathord {\mathbb P}}_{k,j}$
such that q forces the existence of an elementary embedding
$\sigma '$
with
-
(a2)
$\sigma '(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\bar {i}},\check {{\bar {G}}}_{{\bar {k}}})={\tilde {\sigma }}(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {{\bar {G}}}_{\bar {i}},\check {{\bar {G}}}_{{\bar {k}}})$
. -
(b2)
$(\sigma ')"\check {\bar {G}}_{\bar {k},\bar {j}}\subseteq \dot {G}_{k,j}$
. -
(c2)
$\sigma ':\check {{\bar {N}}}[\check {{\bar {G}}}_{\bar {k}}]\prec \check {N}[\check {H}]$
.
Since this holds in
$\mathrm {V}[H]$
whenever
$p^{**}\in H$
, there is a
${\mathord {\mathbb P}}_k$
-name
$\tau $
which is essentially a name for q above—more precisely,
$\tau $
is such that
$p^{**}$
forces that
$\tau \in {\mathord {\mathbb P}}_j$
,
$\tau {\restriction } k\in \dot {G}_k$
and
$\tau {\restriction }[k,j)$
has the properties of q, as listed above. Since the iteration is nice, there is a condition
$p^*\in {\mathord {\mathbb P}}_j$
such that
$p^*{\restriction } k=p^{**}$
and
$p^*$
forces that
$\tau {\restriction }[k,j)\equiv p^*{\restriction }[k,j)$
; see Definition 3.14, part (1). We claim that
$p^*$
is as wished.
First, note that
$p^*{\restriction } i=(p^*{\restriction } k){\restriction } i=p^{**}{\restriction } i=p$
. Now, let
$G_j$
be a
${\mathord {\mathbb P}}_j$
-generic filter with
$p^*\in G_j$
. We have to show that in
$\mathrm {V}[G_j]$
, there is a
$\sigma '$
such that, letting
$\sigma =\dot {\sigma }^{G_i}$
, the following hold:
-
(a)
$\sigma '({\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }},{\bar {G}}_{\bar {i}})=\sigma ({\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }},{\bar {G}}_{\bar {i}})$
. -
(b)
$(\sigma ')"\bar {G}_{\bar {i},\bar {j}}\subseteq G_{i,j}$
. -
(c)
$\sigma ':{\bar {N}}[{\bar {G}}_{\bar {i}}]\prec N[G_i]$
.
But this follows, because
$\mathrm {V}[G_j]=\mathrm {V}[G_k][G_{k,j}]$
,
$p^*{\restriction }[k,j)\in G_{k,j}$
and
$p^{**}\in G_k$
. So writing H for
$G_k$
puts us in the situation described above;
$p^*{\restriction }[k,j)\equiv \dot {q}^{G_j}$
, where
$\dot {q}$
is a name for the condition q mentioned above. Thus, there is a
$\sigma '$
in
$\mathrm {V}[G_j]$
such that the conditions (a2)–(c2) listed above hold in
$\mathrm {V}[G_j]$
. Remembering that
${\tilde {\sigma }}$
lifts
${\bar {\sigma }}$
and
${\bar {\sigma }}$
moves the required parameters as prescribed (by (a1)–(c1)), it follows that (a)–(c) are satisfied.
3.4 Nice iterations of
$\infty $
-subproper forcing
Next we prove a similar theorem for
$\infty $
-subproper forcing. Even though it was originally shown by Miyamoto, we present here a complete proof we found before learning about his result. We will use this proof as a template later.
Theorem 3.21 (Miyamoto [Reference Miyamoto17]).
Let
$\vec {{\mathord {\mathbb P}}} = \langle {\mathord {\mathbb P}}_\alpha \; | \; \alpha \leq \nu \rangle $
be a nice iteration so that
${\mathord {\mathbb P}}_0 = \{1_0\}$
and for all
$i<\nu $
,
$\Vdash _i {\mathord {\mathbb P}}_{i, i+1}$
is
$\infty $
-subproper. Then for all
$j\le \nu $
the following statement
$\varphi (j)$
holds:
if
$i\le j$
,
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$q\in {\mathord {\mathbb P}}_j$
is such that
$p\le _i q{\restriction } i$
,
$\theta $
is a sufficiently large cardinal,
$\tau $
is an ordinal,
$H_\theta \subseteq N=L_\tau ^A\models \mathsf {ZFC}^-$
, s is an element of N,
${\bar {N}}$
is a countable, full, transitive model so that
${\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},\bar {q}\in {\bar {N}}$
and p forces with respect to
${\mathord {\mathbb P}}_i$
that the following assumptions hold:
-
(A1)
$\dot {\sigma }:\check {{\bar {N}}}\prec \check {N}$
. -
(A2)
$\dot {\sigma }(\check {{\bar {s}}}, \check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {\bar {j}},\check {{\bar {\theta }}}, \check {\bar {q}})=\check {s}, \check {\vec {{\mathord {\mathbb P}}}},\check {i},\check {j},\check {q}$
. -
(A3)
$\dot {\sigma }^{-1}"\dot {G_i}$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {i}}$
-generic over
$\check {{\bar {N}}}$
.
then there is a condition
$p^*\in {\mathord {\mathbb P}}_j$
with
$p^*\le _j q$
and
$p^*{\restriction } i=p$
such that whenever
$G_j\ni p^*$
is
${\mathord {\mathbb P}}_j$
-generic, we have that in
$\mathrm {V}[G_j]$
, there is a
$\sigma '$
such that, letting
$\sigma =\dot {\sigma }^{G_i}$
, the following conclusions hold:
-
(C1)
$\sigma ':{\bar {N}}\prec N$
. -
(C2)
$\sigma '({\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j},{\bar {\theta }}, \bar {q})=s,\vec {{\mathord {\mathbb P}}},i,j,\theta ,q$
. -
(C3)
$(\sigma ')^{-1}"G_i=\sigma ^{-1}"G_i$
and
$(\sigma ')^{-1}"G_j$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
-generic over
${\bar {N}}$
.
Proof. Like in the previous proof, we induct on j. So let us assume that
$\varphi (j')$
holds for every
$j'<j$
. Fix some
$i\le j$
. Since nothing is to be shown when
$i=j$
, let
$i<j$
. In particular, the case
$j=0$
is trivial.
Let us fix
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$q\in {\mathord {\mathbb P}}_j$
with
$p\le _i q{\restriction } i$
. Also fix
$\theta $
,
$\tau $
, A, N,
${\bar {N}}$
,
${\bar {s}},\bar {\vec {{\mathord {\mathbb P}}}},\bar {i},\bar {j}\in {\bar {N}}$
so that assumptions 3.21–3.21 hold.
When it causes no confusion, we will again employ our notational “bar” convention.
Case 1: j is a limit ordinal.
Let
${\langle t_n\;|\;}{n < \omega \rangle }$
enumerate the elements of
${\bar {N}}$
, starting with
$t_0=\emptyset $
. Also let
${\langle \bar {D}_n\;|\;}{n<\omega \rangle }$
enumerate the dense open subsets of
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
in
${\bar {N}}$
in such a way that
$\bar {q}\in \bar {D}_0$
.
As before, there is an
${\bar {N}}$
-definable well ordering of the universe of
${\bar {N}}$
,
$<_{\bar {N}}$
. As noted in [Reference Miyamoto16], by Lemma 3.16, in
${\bar {N}}$
,
$\bar {q}$
is a mixture up to
$\bar {j}$
of some nested antichain in
$\bar {\vec {{\mathord {\mathbb P}}}}{\restriction }{\bar {j}}$
whose root has length
$\bar {i}$
. Letting
$\bar {W}$
be the
$<_{\bar {N}}$
-least one, we know that p forces that
$\dot {\sigma }(\check {\bar {W}})$
is the
$L_\tau ^A$
-least nested antichain W in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
such that q is a mixture of W up to j, since we know that p forces that
$\bar {q},\bar {i},\bar {j}$
are mapped to
$q,i,j$
by
$\dot {\sigma }$
, respectively.
We will define a nested antichain
$\langle T, \langle T_n \; | \; n < \omega \rangle , \langle \mathop {\mathrm {suc}}^n_T \; | \; n < \omega \rangle \rangle $
, a fusion structure
${\langle {\langle q^{(a, n)}, T^{(a, n)} \rangle } \;|\;}{n < \omega , a\in T_n\rangle }$
in
${\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \leq j\rangle }$
and a sequence
$\langle \dot {\sigma }^{(a, n)} \; | \; n < \omega , a \in T_n\rangle $
so that the following conditions hold.
-
(1)
$T_0 = \{p\}$
,
$q^{(p,0)}=q$
,
$T^{(p,0)}=W$
and
$\dot {\sigma }^{(p,0)} = \dot {\sigma }$
.
Further, for any
$n<\omega $
and
$a\in T_n$
:
-
(2)
$q^{(a, n)} \leq q$
,
$q^{(a, n)}\in {\mathord {\mathbb P}}_j$
and
$\dot {\sigma }^{(a, n)}$
is a
${\mathord {\mathbb P}}_{l(a)}$
-name. -
(3) a forces the following statements with respect to
${\mathord {\mathbb P}}_{l(a)}$
:-
(a)
$\dot {\sigma }^{(a, n)} : \check {{\bar {N}}}\prec \check {N}$
. -
(b)
$\dot {\sigma }^{(a, n)}(\check {\overline {\theta }}, \check {\bar {\vec {{\mathord {\mathbb P}}}}}, \overline {s}, \check {\bar {i}},\check {\bar {j}}, \check {\bar {q}}) = \check {\theta }, \check {\vec {{\mathord {\mathbb P}}}}, \check {s}, \check {i}, \check {j}, \check {q}$
. -
(c)
$q^{(a,n)}\in \mathrm {ran} (\dot {\sigma }^{(a,n)})$
and its preimage is in
$\overline {D}_n$
.
-
-
(4) For some
$\bar {q}^{(a,n)}\in \bar {D}_n$
,
$\bar {T}^{(a,n)}\in {\bar {N}}$
and ordinal
$\overline {l(a)}$
, we have that and
$$\begin{align*}a \Vdash \dot{\sigma}^{(a, n)} ( {\langle \bar{q}^{(a, n)}, \bar{T}^{(a, n)},\overline{l(a)} \rangle} ) = {\langle q^{(a, n)}, T^{(a, n)}, l(a) \rangle} \end{align*}$$
$(\dot {\sigma }^{(a,n)})^{-1}"\dot {G}_{l(a)}$
is
$\bar {{\mathord {\mathbb P}}}_{\overline {l(a)}}$
-generic over
${\bar {N}}$
.
For
$b \in \mathrm {suc}^n_T (a)$
:
-
(5) b forces with respect to
${\mathord {\mathbb P}}_{l(b)}$
that
$$\begin{align*}(\dot{\sigma}^{(b,n+1)})^{-1}"\dot{G}_{l(a)}=(\dot{\sigma}^{(a,n)})^{-1}"\dot{G}_{l(a)}.\end{align*}$$
Further, if
$m\le n$
, then
$$\begin{align*}b \Vdash_{l(b)} \dot{\sigma}^{(b, n+1)}(\check{t}_m) = \dot{\sigma}^{(a, n)}(\check{t}_m).\end{align*}$$
Also, let
$<_T$
be the transitive closure of the order
$<^{\prime }_T$
on
$\{ {\langle c,k \rangle } \;|\; k<\omega \land c\in T_k\}$
defined by
$ {\langle c,k \rangle } <^{\prime }_T {\langle d,l \rangle } $
iff
$l=k+1$
and
$d\in \mathop {\mathrm {suc}}_T^k(c)$
. Then, if
$ {\langle c,m \rangle } \le _T {\langle a,n \rangle } $
, we have that
$$\begin{align*}b\Vdash\dot{\sigma}^{(b,n+1)}(\bar{q}^{(c,m)})=\dot{\sigma}^{(a,n)}(\bar{q}^{(c,m)}).\end{align*}$$
-
(6)
$b{\restriction } l(a)\Vdash _{l(a)}q^{(b,n+1)},T^{(b,n+1)}\in \mathrm {ran} (\dot {\sigma }^{(a,n)})$
.
First let’s see that constructing such objects is sufficient to prove the existence of a condition
$p^*$
as in the statement of the theorem. Suppose that we have constructed sequences satisfying 1 through 6 above. Let
$q^*\in {\mathord {\mathbb P}}_j$
be a fusion of the fusion structure, and let
$p^*=p{{}^\frown } q^*{\restriction }[i,j)$
. By (1), we have that
$q^*{\restriction } i\equiv p$
, so
$p^*\equiv q^*$
and
$p^*{\restriction } i=p$
, as required. To see that
$p^*$
is as wished, let
$G_j$
be
${\mathord {\mathbb P}}_j$
-generic over
$\mathrm {V}$
with
$p^* \in G_j$
. Let
$\sigma =\dot {\sigma }^{G_j}$
and
$\bar {G}_{\bar {i}}=\sigma ^{-1}"G_i$
. We have to show that in
$\mathrm {V}[G_j]$
, there is a
$\sigma '$
so that conclusions (C1)–(C3) are satisfied. Since
$p^*\equiv q^*$
, we have that
$q^*\in G_j$
. Work in
$\mathrm {V}[G_j]$
. By Proposition 3.19 there is a sequence
$\langle a_n \; | \; n < \omega \rangle \in V[G_j]$
so that
$a_0\in T_0$
(so
$a_0=p$
) and for all
$n < \omega $
,
$a_{n+1} \in \mathrm {suc}^n_T(a_n)$
,
$a_n \in G_j {\restriction } l(a_n)$
and
$q^{(a_n, n)} \in G_j$
. Let
$\sigma _n$
be the evaluation of
$\dot {\sigma }^{(a_n, n)}$
by
$G_j$
. So
$\sigma _n:{\bar {N}}\prec N$
. Define
$\sigma ':{\bar {N}}\prec N$
by letting
$\sigma '(t_n)=\sigma _n(t_n)$
. It follows as before that
$\sigma '$
is elementary, so that conclusion (C1) is satisfied. Conclusion (C2) stating that
$\sigma '$
moves the given parameters the same way
$\sigma $
does, follows since each
$\sigma _n$
moves them that way. The crucial claim we have to verify is condition (3), which has two parts.
The first part states that
$(\sigma ')^{-1}"G_i=\sigma ^{-1}"G_i$
. Let
$\delta _n=l(a_n)$
. By construction, we have that for
$m<n<\omega $
,
$\delta _m\in \mathrm {ran} (\sigma _m)$
and
$\bar {\delta }_m=\sigma _m^{-1}(\delta _m)=\sigma _n^{-1}(\delta _m)$
. We also have that
$(\sigma _{n+1})^{-1}"G_{\delta _n}=(\sigma _n^{-1})"G_{\delta _n}$
. It follows by induction on n that
$(\sigma _n)^{-1}"G_{\delta _0}=(\sigma _0)^{-1}"G_{\delta _0}$
. The base case is trivial, and for the inductive step, we use that by construction, we have that
$(\sigma _{n+1})^{-1}"G_{\delta _n}=(\sigma _n)^{-1}"G_{\delta _n}$
.
This implies that
$(\sigma _{n+1})^{-1}"G_{\delta _0}=(\sigma _n)^{-1}"G_{\delta _0}$
: for
$x\in {\mathord {\mathbb P}}_{\delta _0}$
, let
For
$\bar {x}\in \bar {{\mathord {\mathbb P}}}_{\bar {\delta }_0}$
, let
$\bar {x}'$
be defined similarly, with
$\bar {\delta }_0$
,
$\bar {\delta }_{n}$
in place of
$\delta _0$
,
$\delta _{n}$
. Then
$x\in G_{\delta _0}$
iff
$x'\in G_{\delta _{n}}$
. To prove the claimed identity, let
$\bar {x}\in (\sigma _{n+1})^{-1}"G_{\delta _0}$
. So
$x=\sigma _{n+1}(\bar {x})\in G_{\delta _0}$
. Then
$x'\in G_{\delta _n}$
, and
$\sigma _{n+1}(\bar {x}')=x'$
. So
$\bar {x}'\in (\sigma _{n+1})^{-1}"G_{\delta _n}$
. Hence,
$\bar {x}'\in (\sigma _n)^{-1}"G_{\delta _n}$
, that is,
$\sigma _n(\bar {x}')\in G_{\delta _n}$
. But
$\sigma _n(\bar {x}')=\sigma _n(\bar {x})'$
. So
$\sigma _n(\bar {x})'\in G_{\delta _n}$
, which implies that
$\sigma _n(\bar {x})\in G_{\delta _0}$
. So
$\bar {x}\in (\sigma _n)^{-1}"G_{\delta _0}$
. For the converse, let
$\bar {x}\in (\sigma _n)^{-1}"G_{\delta _0}$
. So
$\bar {x}'\in \sigma _n^{-1}"G_{\delta _n}=\sigma _{n+1}^{-1}"G_{\delta _n}$
. So
$\sigma _{n+1}(\bar {x}')=\sigma _{n+1}(\bar {x})'\in G_{\delta _n}$
, so
$\sigma _{n+1}(\bar {x})\in G_{\delta _0}$
, that is,
$\bar {x}\in \sigma _{n+1}^{-1}"G_{\delta _0}$
.
Inductively, we have that
$\sigma _n^{-1}"G_{\delta _0}=\sigma _0^{-1}"G_{\delta _0}$
, which together with the identity shown in the previous paragraph yields that
$(\sigma _{n+1})^{-1}"G_{\delta _0}=\sigma _0^{-1}"G_{\delta _0}$
, completing the induction step.
Since
$\delta _0=i$
and
$\sigma _0=\sigma $
, this means that
$(\sigma _n)^{-1}"G_i=\sigma ^{-1}"G_i$
, for every n.
This easily implies that
$(\sigma ')^{-1}"G_i=\sigma ^{-1}"G_i$
. From left to right, suppose
$\sigma '(\bar {x})\in G_i$
. Say
$\bar {x}=t_n$
. So
$\sigma _n(\bar {x})\in G_i$
, i.e.,
$\bar {x}\in \sigma _n^{-1}"G_i=\sigma ^{-1}"G_i$
. Vice versa, suppose
$\sigma (\bar {x})\in G_i$
. Let
$\bar {x}=t_n$
. Then
$\bar {x}\in \sigma _n^{-1}"G_i$
, i.e.,
$\sigma '(\bar {x})=\sigma _n(\bar {x})\in G_i$
. So
$\bar {x}\in (\sigma ')^{-1}"G_i$
.
The second part of conclusion (C3) is that
$\bar {G}_{\bar {j}}=(\sigma ')^{-1}"G_j$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
-generic over
$\bar {N}$
. This is taken care of in the construction since the pre-image of
$q^{(a_n,n)}$
under
$\sigma '$
is in
$\bar {D}_n$
by (3c). In detail, let
$t_m=\bar {q}^{(a_n,n)}$
. Then
$\sigma '(\bar {q}^{(a_n,n)})=\sigma '(t_m)=\sigma _m(t_m)=\sigma _m(\bar {q}^{(a_n,n)})$
.
If
$m\le n$
, then
so
$(\sigma ')^{-1}(q^{(a_n,n)})=\bar {q}^{(a_n,n)}\in \bar {D}_n$
in this case. And if
$n<m$
, then
so again,
$(\sigma ')^{-1}(q^{(a_n,n)})=\bar {q}^{(a_n,n)}\in \bar {D}_n$
.
Thus it remains to see that such a construction can be carried out. This is done by induction on n, in a manner similar to the previous proof. Like last time, at stage
$n+1$
of the construction, we assume that
$T_m$
,
$T^{(a,m)}$
,
$q^{(a,m)}$
and
$\dot {\sigma }^{(a,m)}$
have been defined, for all
$m\le n$
and all
$a\in T_m$
. Also, for
$m<n$
and
$a\in T_m$
, we assume that
$\mathop {\mathrm {suc}}_T^m(a)$
has been defined. Our inductive hypothesis is that for all
$m\le n$
and all
$a\in T_m$
, conditions (2)–(4) hold, and that for all
$m<n$
, all
$a\in T_m$
and all
$b\in \mathop {\mathrm {suc}}_T^m(a)$
, conditions (5) and (6) are satisfied. As before, for every
$a\in T_n$
, we will specify
$\mathop {\mathrm {suc}}_T^n(a)$
, and for every
$b\in \mathop {\mathrm {suc}}_T^n(a)$
, the objects
$T^{(b,n+1)}$
,
$q^{(b,n+1)}$
and
$\dot {\sigma }^{(b,n+1)}$
in such a way that (5) and (6) are satisfied by a and b, and (2)-(4) are satisfied by b and
$n+1$
(instead of a and n). As before, in order to ensure that we ultimately produce a fusion structure, we again arrange that
$q^{(b,n+1)}$
is a mixture of
$T^{(b,n+1)}$
up to j,
$b\le q^{(b,n+1)}{\restriction } l(b)$
,
$l(b)=l(\mathrm {root}(T^{(b,n+1)}))$
and
$T^{(b,n+1)}\mathrel {\angle } T^{(a,n)}$
, so that Definition 3.18(2)–(4) hold (and we also assume that the corresponding statements are true of the earlier defined
$q^{(c,k)}$
and
$T^{(c,k)}$
).
For stage 0 of the construction, notice that (1) gives the base case where
$n=0$
and in this case (2)–(4) are satisfied, p forces that
$q^{(p, 0)}=q=\dot {\sigma }(\overline {q}) \in \overline {D}_0$
and p forces that
$W=T^{(p,0)}$
has a preimage under
$\dot {\sigma }$
, namely
$\bar {W}$
.
At stage
$n+1$
of the construction, work under the assumptions described above. Fixing
$a\in T_n$
, we have to define
$\mathop {\mathrm {suc}}_T^n(a)$
. To this end let D be the set of all conditions
$b\in \bigcup _{l(a)\le \xi <j}{\mathord {\mathbb P}}_\xi $
for which there are a nested antichain S in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
and objects
$\dot {\sigma }^b$
, u,
$\bar {u}$
,
$\overline {l(b)}$
, and
$\bar {S}$
satisfying the following:
-
(D1)
$b{\restriction } l(a) \le a$
. -
(D2)
$S \mathrel {\angle } T^{(a, n)}$
,
${\bar {S}}\in {\bar {N}}$
,
$S\in N$
. -
(D3)
$u\in {\mathord {\mathbb P}}_j$
,
$u \leq q^{(a,n)}$
and u is a mixture of S up to j. -
(D4)
$b\le _{l(b)}u{\restriction } l(b)$
and
$l(b)=l(\mathrm {root}(S))$
. -
(D5)
$\overline {u} \in \overline {D}_{n+1}$
. -
(D6)
$b{\restriction } l(a)\Vdash _{l(a)}\dot {\sigma }^{(a,n)}(\check {\bar {S}},\check {\bar {u}},\check {\overline {l(b)})}=\check {S},\check {u},(l(b))\check {}$
. -
(D7) b forces the following statements with respect to
${\mathord {\mathbb P}}_{l(b)}$
:-
(a)
$\dot {\sigma }^b: \check {{\bar {N}}}\prec \check {N}$
. -
(b)
$\dot {\sigma }^b (\check {\overline {\theta }},\check {\bar {i}},\check {\bar {j}},\check {\bar {\vec {{\mathord {\mathbb P}}}}}, \check {\overline {s}},\check {\bar {u}},\check {{\bar {S}}}, \check {\bar {q}},(\overline {l(b)})\check {}) = \check {\theta },\check {i},\check {j},\check {\vec {{\mathord {\mathbb P}}}},\dot {\sigma }({\bar {s}}), \check {u},\check {S}, \check {q},(l(b))\check {}$
, and
$\forall m \leq n\forall c\quad \dot {\sigma }^b(t_m) = \dot {\sigma }^{(a, n)}(t_m)$
and
$ {\langle c,m \rangle } \le _T {\langle a,n \rangle } \longrightarrow \dot {\sigma }^b(\bar {q}^{(c,m)})=\dot {\sigma }^{(a,n)}(\bar {q}^{(c,m)})$
. -
(c)
$(\dot {\sigma }^b)^{-1}"\dot {G}_{l(a)}=(\dot {\sigma }^{(a,n)})^{-1}"\dot {G}_{l(a)}$
and
$(\dot {\sigma }^b)^{-1}"\dot {G}_{l(b)}$
is
$\bar {{\mathord {\mathbb P}}}_{\overline {l(b)}}$
-generic over
${\bar {N}}$
.
-
As before,
$D{\restriction } l(a):=\{b{\restriction } l(a)\;|\; b\in D\}$
is open in
${\mathord {\mathbb P}}_{l(a)}$
, and it suffices to show that
$D{\restriction } l(a)$
is predense below a in
${\mathord {\mathbb P}}_{l(a)}$
, because knowing this, we may choose a maximal antichain
$A\subseteq D{\restriction } l(a)$
, which then is a maximal antichain in
${\mathord {\mathbb P}}_{l(a)}$
below a. For every
$c\in A$
, we may then pick a condition
$b(c)\in D$
such that
$b(c){\restriction } l(a)=c$
, and define
$\mathop {\mathrm {suc}}_T^n(a)=\{b(c)\;|\; c\in A\}$
. Now, for every
$b\in \mathop {\mathrm {suc}}_T^n(a)$
, let S,
$\dot {\sigma }^b$
, u and
$\bar {u}$
be chosen in such a way that (D1)–(D7) hold. Set
$T^{(b,n+1)}=S$
,
$\dot {\sigma }^{(b, n+1)}=\dot {\sigma }^b$
,
$q^{(b, n+1)}=u$
,
$\bar {q}^{(b,n+1)}=\bar {u}$
and
$\bar {T}^{(b,n+1)}={\bar {S}}$
. Then a, b satisfy (5) and (6) at stage n, and b satisfies (2)–(4) at stage
$n+1$
.
To see that
$D{\restriction } l(a)$
is predense below a, let
$G_{l(a)}$
be
${\mathord {\mathbb P}}_{l(a)}$
-generic over V with
$a \in G_{l(a)}$
. We have to find a
$b\in D$
so that
$b{\restriction } l(a) \in G_{l(a)}$
. Work in
$V[G_{l(a)}]$
. Let
$\sigma _n = (\dot {\sigma }^{(a, n)})_{G_{l(a)}}$
. Since (3) holds at stage n, we have that
$\sigma _n:{\bar {N}}\prec N$
and
$\sigma _n(\overline {\theta }, \bar {\vec {{\mathord {\mathbb P}}}},{\bar {s}},\overline {\nu },\bar {i},\bar {j}) =\theta ,\vec {{\mathord {\mathbb P}}},\sigma ({\bar {s}}),\nu ,i,j$
. We also have objects
$\bar {q}^{(a,n)},{\bar {T}}^{(a,n)},\overline {l(a)}$
satisfying condition (4), so that
${\bar {T}}^{(a,n)}\in {\bar {N}}$
,
$\sigma _n(\bar {q}^{(a,n)},{\bar {T}}^{(a,n)})=q^{(a,n)},T^{(a,n)}$
and
$\sigma _n(\overline {l(a)})=l(a)$
. We also know that
$\bar {G}_{\overline {l(a)}}=\sigma _n^{-1}"G_{l(a)}$
is
$\bar {{\mathord {\mathbb P}}}_{\overline {l(a)}}$
-generic over
${\bar {N}}$
.
Let’s first find u and
$\bar {u}$
again. By elementarity,
$\overline {q}^{(a, n)}$
is a mixture of
$\overline {T}^{(a, n)}$
up to
$\overline {j}$
. Let
${\bar {T}}_0^{(a,n)}=\{{\bar {a}}_0\}$
. Let
$a_0=\sigma _n({\bar {a}}_0)$
. So
$T_0^{(a,n)}=\{a_0\}$
. We know that
$a\le q^{(a,n)}{\restriction } l(a)$
, so
$q^{(a,n)}{\restriction } l(a)\in G_{l(a)}$
, so
$\bar {q}^{(a,n)}{\restriction }\overline {l(a)}\in \bar {G}_{\overline {l(a)}}$
. Since
$\bar {q}^{(a,n)}$
is a mixture of
$\bar {T}^{(a,n)}$
up to
$\bar {j}$
in
${\bar {N}}$
, it follows that
$\bar {q}^{(a,n)}{\restriction } l({\bar {a}}_0)\equiv {\bar {a}}_0$
, by Fact 3.13.(1), since
$l(\bar {q}^{(a,n)})=\bar {j}>l({\bar {a}}_0)$
. Since we have ensured that
$l(a)=l(\mathrm {root}(T^{(a,n)})$
, we have by elementarity that
$\overline {l(a)}=l(\bar {a}_0)$
. So
${\bar {a}}_0\in \bar {G}_{\bar {l(a)}}$
. Let
$\bar {r}\in {\bar {T}}_1^{(a,n)}$
be such that
$\bar {r}{\restriction } l({\bar {a}}_0)\in {\bar {G}}_{l({\bar {a}}_0)}$
. There is such an
$\bar {r}$
by Definition 3.12(5), since
${\bar {G}}_{l({\bar {a}}_0)}$
is
${\bar {{\mathord {\mathbb P}}}}_{l({\bar {a}}_0)}$
-generic over
${\bar {N}}$
. So we have that
$\bar {r}{\restriction }\overline {l(a)}\in \bar {G}_{\overline {l(a)}}$
.
Now let
$\bar {u}\in {\bar {{\mathord {\mathbb P}}}}_{\bar {j}}$
strengthen
$\tilde {q}=\bar {r}^{\frown }\bar {q}^{(a, n)}{\restriction } [{l(\bar {r})},\bar {j})$
so that
$\overline {u}\in \overline {D}_{n+1}$
and
$\bar {u}{\restriction }\overline {l(a)}\in {\bar {G}}_{\overline {l(a)}}$
. This can be achieved since
$\tilde {D}=\{x\in \bar {D}_{n+1}\;|\; x\le \tilde {q}\}$
is dense below
$\tilde {q}$
in
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
, so
$\tilde {D}{\restriction }\overline {l(a)}=\{x{\restriction }\overline {l(a)}\;|\; x\in \tilde {D}\}$
is dense below
$\bar {r}{\restriction }\overline {l(a)}$
in
$\bar {{\mathord {\mathbb P}}}{\restriction }\overline {l(a)}$
, so there is a
$\tilde {u}\in \tilde {D}{\restriction }\overline {l(a)}\cap {\bar {G}}_{\overline {l(a)}}$
, and
$\tilde {u}=\bar {u}{\restriction }\overline {l(a)}$
for some
$\bar {u}\in \tilde {D}$
which then is as wished.
By Lemma 3.17, applied in
${\bar {N}}$
, we can pick a nested antichain
$\bar {S} \mathrel {\angle } \bar {T}^{(a, n)}$
such that
$\bar {u}$
is a mixture of
${\bar {S}}$
up to
$\bar {j}$
and such that letting
${\bar {S}}_0 = \{{\bar {d}}_0\}$
, we have that
$l(\bar {r}),\overline {l(a)}\leq l({\bar {d}}_0)$
and
${\bar {d}}_0 {\restriction } l(\bar {r}) \leq \bar {r}$
. Moreover, we have that
$\bar {u}{\restriction } l({\bar {d}}_0)\equiv {\bar {d}}_0$
, since
$\bar {u}$
is a mixture of
${\bar {S}}$
up to
$\bar {j}$
. In particular,
${\bar {d}}_0{\restriction }\overline {l(a)}\in {\bar {G}}_{\overline {l(a)}}$
.
Let
$S,d_0,u=\sigma _n({\bar {S}},{\bar {d}}_0,{\bar {u}})$
. So
$u{\restriction } l(d_0)\equiv d_0$
. Note that
$d_0{\restriction } l(a)\in G_{l(a)}$
.
Also, let
${\bar {s}}'\in {\bar {N}}$
be a tuple of parameters to be specified below, and let
$s'=\sigma _n({\bar {s}}')$
.
Let
$w\in G_{l(a)}$
force these facts about
$\dot {\sigma }^{(a,n)}$
and the check names for the parameters
$\bar {S},\bar {d_0},{\bar {u}},{\bar {s}}'$
and
$S,d_0,u,s'$
. Since
$a,d_0{\restriction } l(a)\in G_{l(a)}$
, we may choose w so that
$w\le _{l(a)}a,d_0{\restriction } l(a)$
.
We are now going to apply our inductive hypothesis
$\varphi (l(d_0))$
(noting that
$l(d_0)<j$
) to
$l(a)$
(in place of i; note that
$l(a)\leq l(d_0)$
as required), the models
${\bar {N}}$
, N, the condition w (in place of p), the condition
$d_0$
(in place of q; note that
$w\le _{l(a)} d_0{\restriction } l(a)$
, as required), the name
$\dot {\sigma }^{(a,n)}$
(in place of
$\dot {\sigma }$
) and the parameter
${\bar {s}}'\in {\bar {N}}$
.
No matter which
${\bar {s}}'$
is chosen, by the inductive hypothesis, there are a condition
$w^*\in {\mathord {\mathbb P}}_{l(d_0)}$
with
$w^*{\restriction } l(a)=w$
and
$w^*\le d_0$
, and a
${\mathord {\mathbb P}}_{l(d_0)}$
-name
$\dot {\sigma }'$
such that
$w^*$
forces:
-
(a)
$\dot {\sigma }':\check {{\bar {N}}}\prec \check {N}$
. -
(b)
$\dot {\sigma }'(\check {{\bar {s}}}', \check {\bar {\vec {{\mathord {\mathbb P}}}}}, \check {(\overline {l(a)}}, \check {l(\overline {d}_0)}, \check {{\bar {\theta }}})= \dot {\sigma }^{(a,n)}(\check {{\bar {s}}}', \check {\bar {\vec {{\mathord {\mathbb P}}}}}, \check {\overline {l(a)}},\check {l(\overline {d}_0)},\check {{\bar {\theta }}})$
. -
(c)
$(\dot {\sigma }'{}^{-1})" \dot {G}_{l(a)}=\dot {\sigma }^{-1}"\dot {G}_{l(a)}$
and
$(\dot {\sigma }'{}^{-1})" \dot {G}_{l(d_0)}$
is
${\mathord {\mathbb P}}_{l(d_0)}$
-generic over
$\check {{\bar {N}}}$
.
Thus, we let
${\bar {s}}'$
be a name for the finite tuple of further objects of which we want
$w^*$
to force that
$\dot {\sigma }'$
moves them the same way as
$\dot {\sigma }^{(a,n)}$
:
${\bar {u}},{\bar {d}}_0,{\bar {S}},\bar {i},\bar {j},\bar {\vec {{\mathord {\mathbb P}}}},{\bar {\theta }},{\bar {s}},t_0,\ldots ,t_n$
and for every
$ {\langle c,m \rangle } \le _T {\langle a,n \rangle } $
,
$\bar {q}^{(c,m)}$
. Recall that w forced that
$\dot {\sigma }^{(a,n)}({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
. Hence, since
$w^*{\restriction } l(a)=w$
, we get that
$w^*$
forces that
$\dot {\sigma }'({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
as well.
Note that already a forced with respect to
${\mathord {\mathbb P}}_{l(a)}$
that
$\bar {i},\bar {j},\bar {\vec {{\mathord {\mathbb P}}}},{\bar {\theta }}$
are mapped to
$i,j,\vec {{\mathord {\mathbb P}}},\theta $
by
$\dot {\sigma }^{(a,n)}$
.
Now, set
$b=w^*$
,
$\dot {\sigma }^b=\dot {\sigma }'$
. It follows that the conditions (D1)-(D7) are satisfied, that is,
$b\in D$
. Most of these are straightforward to verify. Let us remark that condition (D4) holds because
$b=w^*\le _{l(b)}d_0\equiv u{\restriction } l(d_0)$
, so
$b\le u{\restriction } l(b)$
as
$l(b)=l(d_0)$
. Condition (D6) holds because
$b{\restriction } l(a)=w$
. This completes the proof that
$D{\restriction } l(a)$
is predense below a, and hence the treatment of case 1.
Case 2: j is a successor ordinal.
Let
$j=k+1$
. Since we assumed
$i<j$
, it follows that
$i\le k$
. Inductively,
$\varphi (k)$
holds. Note that
$\bar {j}$
is of the form
${\bar {k}}+1$
, and p forces with respect to
${\mathord {\mathbb P}}_i$
that
$\dot {\sigma }({\bar {k}})=k$
, the assumptions 3.21–3.21 are satisfied by
$p\in {\mathord {\mathbb P}}_i$
,
$\dot {\sigma }\in \mathrm {V}^{{\mathord {\mathbb P}}_i}$
,
$q{\restriction } k\in {\mathord {\mathbb P}}_k$
,
$\theta $
,
$\tau $
, A, N,
${\bar {N}}$
,
${\bar {s}}$
,
$\bar {\vec {{\mathord {\mathbb P}}}}$
,
$\bar {i}$
,
$\bar {k}\in {\bar {N}}$
and k. By
$\varphi (k)$
, we obtain a condition
$p^{**}\in {\mathord {\mathbb P}}_k$
with
$p^{**}{\restriction } i=p$
and
$p^{**}\le _k q{\restriction } k$
, as well as a
${\mathord {\mathbb P}}_k$
-name
$\dot {{\bar {\sigma }}}$
such that
$p^{**}$
forces with respect to
${\mathord {\mathbb P}}_k$
:
-
(a1)
$\dot {{\bar {\sigma }}}:\check {{\bar {N}}}\prec \check {N}$
. -
(b1)
$\dot {{\bar {\sigma }}}(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}}, \check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}}) =\dot {\sigma }(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}}, \check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}})$
. -
(c1)
$\dot {{\bar {\sigma }}}^{-1}"\dot {G}_i=\dot {\sigma }^{-1}"\dot {G}_i$
and
$\dot {{\bar {\sigma }}}^{-1}"\dot {G}_k$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {k}}$
-generic over
$\check {{\bar {N}}}$
.
As pointed out in the beginning of the proof, there is a
${\mathord {\mathbb P}}_k$
-name
$\dot {{\bar {\sigma }}}^*$
such that
$p^{**}$
forces that
$\dot {{\bar {\sigma }}}^*$
is the lifting of
$\dot {{\bar {\sigma }}}$
to
${\bar {N}}[\dot {{\bar {\sigma }}}^{-1}"\dot {G}_k]$
—so
$p^{**}$
forces with respect to
${\mathord {\mathbb P}}_k$
that
$\dot {{\bar {\sigma }}}^*{\restriction }{\bar {N}}=\dot {{\bar {\sigma }}}{\restriction }{\bar {N}}$
,
$\dot {{\bar {\sigma }}}^*(\dot {{\bar {\sigma }}}^{-1}"\dot {G}_k)=\dot {G}_k$
, and:
-
(a2)
$\dot {{\bar {\sigma }}}^*:\check {{\bar {N}}}[\dot {{\bar {\sigma }}}^{-1}"\dot {G}_k]\prec \check {N}[\dot {G}_k]$
. -
(b2)
$\dot {{\bar {\sigma }}}^*(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}}, \check {{\bar {k}}},\check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}}) =\sigma (\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}}, \check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}})$
. -
(c2)
$(\dot {{\bar {\sigma }}}^*)^{-1}"\dot {G}_i=\dot {\sigma }^{-1}"\dot {G}_i$
,
$\dot {{\bar {\sigma }}}^*(\dot {\sigma }^{-1}"\dot {G}_i)=\dot {G}_i$
, and
$(\dot {{\bar {\sigma }}}^*)^{-1}"\dot {G}_k$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {k}}$
-generic over
$\check {{\bar {N}}}$
.
Temporarily fix a
${\mathord {\mathbb P}}_k$
-generic filter
$G_k$
that contains
$p^{**}$
. In
$\mathrm {V}[G_k]$
, the forcing
${\mathord {\mathbb P}}_{k,k+1}={\mathord {\mathbb P}}_{k,j}={\mathord {\mathbb P}}_j/G_k$
is
$\infty $
-subproper by assumption. Note that since
$p^{**}\le _k q{\restriction } k$
,
$q^*=q{\restriction }[k,j)\in {\mathord {\mathbb P}}_{k,j}$
. Let
${\bar {\sigma }}^*=(\dot {{\bar {\sigma }}}^*)^{G_k}$
. Then
$q^*$
is in the range of
${\bar {\sigma }}^*$
and we have that
${\bar {\sigma }}^*:{\bar {N}}[({\bar {\sigma }}^*)^{-1}"G_k]\prec N[G_k]$
. Also, letting
$\sigma =\dot {\sigma }^{G_k}$
,
$\sigma ^{-1}"G_i=({\bar {\sigma }}^*)^{-1}"G_i$
, and
${\bar {\sigma }}^*(\sigma ^{-1}"G_i)=G_i$
.
Since
${\bar {N}}$
is full, so is
${\bar {N}}[({\bar {\sigma }}^*)^{-1}"G_k]$
, and since
$H_\theta \subseteq N$
,
$H_\theta ^{\mathrm {V}[G_k]}=H_\theta [G_k]\subseteq N[G_k]$
. Hence, by
$\infty $
-subproperness of
${\mathord {\mathbb P}}_{k,j}$
in
$\mathrm {V}[G_k]$
, there is a condition r in
${\mathord {\mathbb P}}_{k,j}$
with
$r\le _{k,j}q^*$
such that, writing
$\dot {G}_{k,j}$
for the canonical
${\mathord {\mathbb P}}_{k,j}$
-name for the generic filter, r forces the existence of an elementary embedding
$\sigma '$
with
-
(a3)
$\sigma ':\check {{\bar {N}}}[({\bar {\sigma }}^*)^{-1}"G_k]\prec N[G_k]$
. -
(b3)
$\sigma '(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}}, \check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}},\sigma ^{-1}"G_i) ={\bar {\sigma }}^*(\check {{\bar {s}}},\check {\bar {\vec {{\mathord {\mathbb P}}}}},\check {\bar {i}},\check {{\bar {k}}}, \check {\bar {j}},\check {{\bar {\theta }}},\check {\bar {q}},\sigma ^{-1}"G_i)$
. -
(c3)
$(\sigma ')^{-1}"\dot {G}_{k,j}$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {k},\bar {j}}$
-generic over
$\check {{\bar {N}}}[{\bar {\sigma }}^{-1}"G_k]$
.
Since this holds in
$\mathrm {V}[G_k]$
whenever
$p^{**}\in G_k$
, there is a
${\mathord {\mathbb P}}_k$
-name
$\tau $
which is essentially a name for r above—more precisely,
$p^{**}$
forces that
$\tau \in {\mathord {\mathbb P}}_j$
,
$\tau {\restriction } k\in \dot {G}_k$
and
$\tau {\restriction }[k,j)$
has the properties of r, as listed above. Since the iteration is nice, there is a condition
$p^*\in {\mathord {\mathbb P}}_j$
such that
$p^*{\restriction } k=p^{**}$
and
$p^*$
forces that
$\tau {\restriction }[k,j)\equiv p^*{\restriction }[k,j)$
; see Definition 3.14, part (1). We claim that
$p^*$
is as wished.
First, note that
$p^*{\restriction } i=(p^*{\restriction } k){\restriction } i=p^{**}{\restriction } i=p$
. Also,
$p^{**}=p^*{\restriction } k\le q{\restriction } $
k and
$p^{**}$
forces that
$p^*{\restriction }[k,j)\equiv \tau {\restriction }[k,j)\le _{k,j}q^*$
, so
$p^*\le q$
.
Now, let
$G_j$
be a
${\mathord {\mathbb P}}_j$
-generic filter with
$p^*\in G_j$
. Then
$\mathrm {V}[G_j]=\mathrm {V}[G_k][G_{k,j}]$
, where
$p^{**}\in G_k$
and
$p^*{\restriction }[k,j)\in G_{k,j}$
. Since
$p^*{\restriction }[k,j)$
has the properties of the condition r above in
$\mathrm {V}[G_k]$
, there is in
$\mathrm {V}[G_j]$
a
$\sigma '$
with (a3)-(c3). Letting
$\sigma =\dot {\sigma }^{G_j}$
, it follows then that
${\bar {G}}_{\bar {i}}:=\sigma ^{-1}"G_i=\sigma '{}^{-1}"G_i$
, since
$\sigma '({\bar {G}}_{\bar {i}})=G_i$
. Moreover, since
$(\sigma ')^{-1}"G_{k,j}$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {k},\bar {j}}$
-generic over
${\bar {N}}[{\bar {G}}_{\bar {k}}]$
and
${\bar {G}}_{\bar {k}}=(\sigma ')^{-1}"G_k$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {k}}$
-generic over
${\bar {N}}$
,
$(\sigma ')^{-1}"G_j$
is
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
-generic over
${\bar {N}}$
. Thus, the restriction of
$\sigma '$
to
${\bar {N}}$
has the desired properties.
So
$\infty $
-subproper and
$\infty $
-subcomplete forcings are iterable when using nice iterations. Let us make one strengthening of these theorems that will be useful in applications. The key step in both proofs was the construction of the fusion sequence in the limit stage and in particular the conditions u and
$\bar {u}$
. In both proofs we needed u to be as strong as a certain condition, but in fact, we could have strengthened it further if we liked. We get the following theorem, a version of [Reference Miyamoto16, Lemma 4.3].
Theorem 3.22. Let
$\vec {{\mathord {\mathbb P}}}={\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \le \nu \rangle }$
be a nice iteration with
${\mathord {\mathbb P}}_0 = \{1_0\}$
such that for all i with
$i+1< \nu $
,
$\Vdash _i {\mathord {\mathbb P}}_{i, i+1}$
is
$\infty $
-subproper, where
$\nu $
is a limit ordinal. Let
$\theta $
, N,
${\bar {N}}$
,
$\bar {s}$
, s be as in Theorem 3.21, and let
$\sigma :{\bar {N}}\prec N$
. Let
$q\in {\mathord {\mathbb P}}_\nu $
and suppose
${\langle E_n\;|\;}{n<\omega \rangle }$
is a sequence of subsets of
${\mathord {\mathbb P}}_\nu $
such that for each
$n<\omega $
, any
$u\le _\nu q$
, any
$i<\nu $
and any
${\mathord {\mathbb P}}_i$
-name
$\dot {\sigma }$
we have that
$1_i$
forces:
“if
$\dot {\sigma }:{\bar {N}}\prec N$
,
$u,q,\theta ,\vec {{\mathord {\mathbb P}}},s,i\in \mathrm {ran} (\dot {\sigma })$
,
$\dot {\sigma }(\bar {s},\bar {\theta },\bar {\vec {{\mathord {\mathbb P}}}})=s,\theta ,\vec {{\mathord {\mathbb P}}}$
,
$u{\restriction } i\in \dot {G}_i$
, and
$\dot {\sigma }^{-1}"\dot {G}_i$
is
$\dot {\sigma }^{-1}({\mathord {\mathbb P}}_i)$
-generic over
${\bar {N}}$
, then there is an
$r\in E_n\cap \mathrm {ran} (\dot {\sigma })$
such that
$r\le _\nu u$
and
$r{\restriction } i\in \dot {G}_i$
.”
Then, there is a
$p^*\le _\nu q$
such that whenever
$G_\nu $
is
${\mathord {\mathbb P}}_\nu $
-generic with
$p^*\in G_\nu $
, there is a
$\sigma '\in \mathrm {V}[G_\nu ]$
such that the conclusions (a)-(c) of the previous theorem hold (with
$i=0$
,
$j=\nu $
,
$p=1_0$
,
$\dot {\sigma }=\check {\sigma }$
), and in addition,
$G_\nu \cap E_n\neq \emptyset $
for every
$n<\omega $
.
The proof of [Reference Miyamoto16, Lemma 4.3] describes in the context of semiproper forcing the modifications to the construction of the fusion sequence in the limit case needed to ensure that the sets
$E_n$
(
$n<\omega $
) are met. The corresponding modifications can be carried out in the context of
$\infty $
-subproper forcing as well. These ideas are due to Miyamoto, and we refer the reader to his article for the details.
3.5 Preserving properties of trees
In this section we lift some results about preservation of properties of trees from [Reference Miyamoto16] to the context of
$\infty $
-subproper forcing. The proofs are in the same spirit as those given using RCS iterations, but since those results do not apply to
$\infty $
-subproper forcing we give them here in the modified context as well. Both results are instances of Theorem 3.22.
Lemma 3.23. Let
$S = (S, \leq _S)$
be a Souslin tree and
$\vec {{\mathord {\mathbb P}}}={\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \le \nu \rangle }$
be a nice iteration of
$\infty $
-subproper forcings as in Theorem 3.21, such that for each
$i+1\le \nu $
,
$\Vdash _i$
“if
$\check {S}$
is Souslin, then
${\mathord {\mathbb P}}_{i,i+1}$
preserves
$\check {S}$
as a Souslin tree.” Then
$\Vdash _\nu $
“
$\check {S}$
is a Souslin tree.”
We stress that the proof of this theorem is similar to that of Lemma 5.0 and Theorem 5.1 of [Reference Miyamoto16].
Proof. If not, then let
$\vec {{\mathord {\mathbb P}}}={\langle {\mathord {\mathbb P}}_i\;|\;}{i\le \nu \rangle }$
be a counterexample with
$\nu $
minimal. Clearly,
$\nu $
must be a limit ordinal, and by minimality, for every
$i<\nu $
,
$\Vdash _i$
“
$\check {S}$
is a Souslin tree.” Let
$\dot {A}$
be a
${\mathord {\mathbb P}}_\nu $
name such that
$q \in {\mathord {\mathbb P}}_\nu $
forces that
$\dot {A}$
is a maximal antichain in
$\check {S}$
. We need to find a
$p^* \leq q$
forcing that
$\dot {A}$
is countable. Fix
$\theta $
sufficiently large that
$\dot {A}, \mathbb P, S \in H_\theta $
and fix
$\sigma :{\bar {N}} \prec N$
as in the standard setup; we can ensure that
${\bar {N}}$
is full using the usual arguments; see the remark following Definition 2.21 of [Reference Fuchs5]. Let
$s= {\langle S,\dot {A} \rangle } $
,
$\bar {s}=\sigma ^{-1}(s)$
. Set
$\delta = \omega _1^{\bar {N}}=\sigma ^{-1}(\omega _1)$
. We may assume that
$\sigma $
does not move the nodes in
$\bar {S}=\sigma ^{-1}(S)$
, since we may assume
$S\subseteq H_{\omega _1}$
. Enumerate the
$\delta ^{\mathrm {th}}$
level of S as
$\langle s_n \; | \; n < \omega \rangle $
. For each n, define
$E_n = \{r \in {\mathord {\mathbb P}}_\nu \; | \; \exists s \in S \; \mathrm {such \; that} \; s <_S s_n \; \mathrm {and} \; r \Vdash s \in \dot {A}\}$
. We claim that the
$E_n$
’s satisfy the “predensity condition” of Theorem 3.22. If we can do this then it follows that there is a
$p^*\le q$
forcing that
$\dot {G} \cap E_n \neq \emptyset $
for all
$n< \omega $
, and hence that the levels of the nodes occurring in
$\dot {A}$
are all below
$\delta $
, rendering
$\dot {A}$
countable.
To check the predensity condition, fix
$n<\omega $
,
$u\le _\nu q$
,
$i<\nu $
and a
${\mathord {\mathbb P}}_i$
-name
$\dot {\sigma }$
. Suppose that
$1_i$
forces that
$\dot {\sigma }:{\bar {N}}\prec N$
,
$u,q,\theta ,\nu ,\vec {{\mathord {\mathbb P}}}\in \mathrm {ran} (\dot {\sigma })$
,
$u{\restriction } i\in \dot {G}_i$
,
$\dot {\sigma }(\bar {\theta },\bar {s},\bar {i})=\theta ,s,i$
, and
$\dot {\sigma }^{-1}"\dot {G}_i$
is
$\dot {\sigma }^{-1}({\mathord {\mathbb P}}_i)$
-generic over
${\bar {N}}$
. Let
$G_i$
be
${\mathord {\mathbb P}}_i$
-generic,
$\sigma _i=\dot {\sigma }^{G_i}$
and
$\bar {G}_{\bar {i}}=\sigma _i^{-1}"G_i$
.
Recall that
$\sigma _i$
lifts to an embedding
$\sigma ^*_i: {\bar {N}}[\overline {G}_{\bar {i}}]\prec N[G_i]$
with
$\sigma ^*_i(\bar {G}_{\bar {i}})=G_i$
. Working in
${\bar {N}}[\overline {G}_{\bar {i}}]$
, let
$D=\{s\in \bar {S}\;|\;\exists \bar {r}\in \bar {{\mathord {\mathbb P}}}_{\bar {\nu }}\ \bar {r}\le \bar {u},\ \bar {r}{\restriction }\bar {i} \in {\bar {G}}_{\bar {i}}\ \text {and}\ \bar {r}\Vdash _{\bar {\nu }}s\in \bar {\dot {A}}\}$
. We claim that as a subset of
$\bar {S}$
, D is predense, that is, every
$t\in \bar {S}$
is comparable with some element of D.
To see this, work in
${\bar {N}}$
. There,
$\bar {\dot {A}}$
is forced to be a maximal antichain in
$\check {\bar {S}}$
by
$1_{\bar {{\mathord {\mathbb P}}}_{\bar {\nu }}}$
. So fixing
$t\in \bar {S}$
, the set E of
$\bar {r}\in \bar {{\mathord {\mathbb P}}}_{\bar {\nu }}$
such that
$\bar {r}\le _{\bar {{\mathord {\mathbb P}}}_{\bar {\nu }}}\bar {u}$
and there is an
$s\in \bar {S}$
that is comparable to t and
$\bar {r}\Vdash _{{\bar {{\mathord {\mathbb P}}}}_{{\bar {\nu }}}}$
“
$s\in \bar {\dot {A}}$
” is dense below
$\bar {u}$
as a subset of
${\bar {{\mathord {\mathbb P}}}}_{{\bar {\nu }}}$
. Hence, the set
$E{\restriction }\bar {i}=\{\bar {r}{\restriction }\bar {i}\;|\;\bar {r}\in E\}$
is dense below
$\bar {u}{\restriction }\bar {i}$
as a subset of
${\bar {{\mathord {\mathbb P}}}}_{\bar {i}}$
. Since
$\bar {G}_{\bar {i}}$
is
${\bar {{\mathord {\mathbb P}}}}_{\bar {i}}$
-generic over
${\bar {N}}$
and
$\bar {u}{\restriction }\bar {i}\in \bar {G}_{\bar {i}}$
, it follows that
$\bar {G}_{\bar {i}}\cap E{\restriction }\bar {i}\neq \emptyset $
. So let
$\bar {r}\in E$
be such that
$\bar {r}{\restriction }{\bar {i}}\in \bar {G}_{\bar {i}}\cap E{\restriction }\bar {i}$
, and let
$s\in \bar {S}$
witness that
$\bar {r}\in E$
. Then
$s\in D$
, as witnessed by
$\bar {r}$
, and s is comparable to t. This shows that D is a predense subset of
$\bar {S}$
.
By assumption, S is Souslin in
$\mathrm {V}[G_i]$
, hence in
$N[G_i]$
, and hence,
$\bar {S}$
is Souslin in
${\bar {N}}[\bar {G}_{\bar {i}}]$
, by the elementarity of
$\sigma ^*_i$
. Now the set
$b_n=\{t\in \bar {S}\;|\; t<_Ss_n\}$
is a cofinal branch of
$\bar {S}$
, and hence it is
$\bar {S}$
-generic over
${\bar {N}}[\bar {G}_{\bar {i}}]$
. So
$b_n\cap D\neq \emptyset $
, as D is predense in
$\bar {S}$
. Let
$s\in D$
,
$s<_Ss_n$
. Let
$\bar {r}$
witness this and set
$r=\sigma _i(\bar {r})$
. Then
$\sigma _i(s)=s$
witnesses that
$r\in E_n$
,
$r\le _\nu u$
and
$r{\restriction } i\in G_i$
. Clearly,
$r\in \mathrm {ran} (\sigma _i)$
, so the predensity condition is satisfied.
A similar modification of Lemma 5.2 and Theorem 5.3 of [Reference Miyamoto16] can be used to prove the preservation of “not adding uncountable branches through trees.”
Lemma 3.24. Let T be an
$\omega _1$
-tree and let
$\vec {{\mathord {\mathbb P}}}={\langle {\mathord {\mathbb P}}_\alpha \;|\;}{\alpha \le \nu \rangle }$
be a nice iteration of
$\infty $
-subproper forcings such that for each
$i<\nu $
with
$i + 1 \leq \nu $
,
$\Vdash _i "{\mathord {\mathbb P}}_{i, i+1}$
does not add an uncountable branch through
$\check {T}$
” then
${\mathord {\mathbb P}}_\nu $
does not add an uncountable branch through T.
Proof. If not, then let
$\vec {{\mathord {\mathbb P}}}$
be a counterexample of minimal length
$\nu $
. Then
$\nu $
is a limit ordinal, and we have that for every
$i<\nu $
,
${\mathord {\mathbb P}}_i$
does not add an uncountable branch through T. Let
$\dot {b}$
be a
${\mathord {\mathbb P}}_\nu $
-name and
$q\in {\mathord {\mathbb P}}_\nu $
a condition that forces
$\dot {b}$
to be a new uncountable branch through T, that is, a branch that did not exist in
$\mathrm {V}$
. Fix
$\theta $
sufficiently large that
$\dot {b},\vec {{\mathord {\mathbb P}}}, T \in H_\theta $
and fix
$\sigma :{\bar {N}} \prec N$
as before. Let
$\delta = \omega _1^{\bar {N}}$
. As before, assume that
$\sigma $
does not move the nodes in
$\bar {T}=\sigma ^{-1}(T)$
. So
$\bar {T}=T|\delta $
. Enumerate the
$\delta ^{\mathrm {th}}$
level of T as
$\langle t^n \; | \; n < \omega \rangle $
. For
$n<\omega $
, define
We will again show that the predensity condition of Theorem 3.22 is satisfied. Knowing this, it then follows there is a
$p^*\leq q$
forcing that
$\dot {G}_\nu \cap E_n \neq \emptyset $
for all
$n< \omega $
. But if
$G_\nu $
is
${\mathord {\mathbb P}}_\nu $
-generic,
$r\in G_\nu \cap E_n$
and t witnesses that
$r\in E_n$
, then
$t_n\notin \dot {b}^{G_\nu }$
(because
$t\in \dot {b}^{G_\nu }$
, so if
$t_n$
were in
$\dot {b}^{G_\nu }$
, then it would follow that
$t<_Tt_n$
, which does not hold). Thus,
$\dot {b}^{G_\nu }$
does not intersect the
$\delta $
-th level of T, a contradiction.
So fix
$n<\omega $
,
$u\le _\nu q$
,
$i<\nu $
and a
${\mathord {\mathbb P}}_i$
-name
$\dot {\sigma }$
. Suppose that
$1_i$
forces that
$\dot {\sigma }:{\bar {N}}\prec N$
,
$u,q,\theta ,\nu ,\vec {{\mathord {\mathbb P}}}\in \mathrm {ran} (\dot {\sigma })$
,
$u{\restriction } i\in \dot {G}_i$
,
$\dot {\sigma }(\bar {\theta },\bar {s},\bar {i})=\theta ,s,i$
, and
$\dot {\sigma }^{-1}"\dot {G}_i$
is
$\dot {\sigma }^{-1}({\mathord {\mathbb P}}_i)$
-generic over
${\bar {N}}$
. Let
$G_i$
be
${\mathord {\mathbb P}}_i$
-generic,
$\sigma _i=\dot {\sigma }^{G_i}$
and
$\bar {G}_{\bar {i}}=\sigma _i^{-1}"G_i$
. Let
$\sigma ^*_i: {\bar {N}}[\overline {G}_{\bar {i}}]\prec N[G_i]$
be the lifting of
$\sigma _i$
.
Since
${\mathord {\mathbb P}}_i$
does not add a new uncountable branch to T, T has the same uncountable branches in
$\mathrm {V}[G_i]$
as it has in
$\mathrm {V}$
. This implies that
$G_i$
intersects the set D of conditions
$x\in {\mathord {\mathbb P}}_i$
such that there are incomparable nodes
$t_1$
,
$t_2\in T_{{<}\delta }$
and conditions
$u_1,u_2\le _\nu u$
such that
$u_1$
forces that
$t_1\in \dot {b}$
,
$u_2$
forces that
$t_2\in \dot {b}$
and
$u_1{\restriction } i=u_2{\restriction } i=x$
. To see this, let
$G'$
,
$G"$
be mutually generic over
$\mathrm {V}[G_i]$
for
${\mathord {\mathbb P}}_{i,\nu }$
, such that
$u\in G_i*G'$
and
$u\in G_i*G"$
. Then
$\dot {b}^{G_i*G'}\neq \dot {b}^{G_i*G"}$
, or else
$b=\dot {b}^{G_i*G'}=\dot {b}^{G_i*G"}\in \mathrm {V}[G_i][G']\cap \mathrm {V}[G_i][G"]=\mathrm {V}[G_i]$
, meaning that already
${\mathord {\mathbb P}}_i$
would add a new uncountable branch to T. Let
$t_1\in \dot {b}^{G_i*G'}\setminus \dot {b}^{G_i*G"}$
,
$t_2\in \dot {b}^{G_i*G"}\setminus \dot {b}^{G_i*G'}$
. Then
$t_1$
and
$t_2$
are incomparable in T. Let
$u^{\prime }_1\in G_i*G'$
,
$u^{\prime }_2\in G_i*G"$
be such that
$u^{\prime }_1\Vdash _\nu $
“
$\check {t}_1\in \dot {b}$
” and
$u^{\prime }_2\Vdash _\nu $
“
$\check {t}_2\in \dot {b}$
”. Since both
$u^{\prime }_1{\restriction } i$
and
$u^{\prime }_2{\restriction } i$
are in
$G_i$
, we may find a common extension
$x\le _i u^{\prime }_1,u^{\prime }_2$
with
$x\in G_i$
. Then, setting
$u_1=x{{}^\frown } u^{\prime }_1{\restriction }[i,\nu )$
,
$u_2=x{{}^\frown } u^{\prime }_2{\restriction }[i,\nu )$
, we have that
$t_1, t_2, u_1, u_2$
witness that
$x\in D$
, and
$x\in G_i$
, as wished.
By the elementarity of
$\sigma ^*_i$
,
$\bar {D}=(\sigma ^*_i)^{-1}(D)$
intersects
$\bar {G}_{\bar {i}}$
. Let
$\bar {r}\in \bar {D}\cap \bar {G}_{\bar {i}}$
, and let
$t_1,t_2,\bar {u}_1,\bar {u}_2$
witness this. Since
$t_1$
and
$t_2$
are incomparable in
$\bar {T}=T{\restriction }\delta $
, at least one of them is not T-below
$t^n$
. Say
$t_1\not <t^n$
. Then
$r=\sigma _i(\bar {u}_1)$
is in
$E_n$
, as witnessed by
$t_1=\sigma _i(t_1)$
,
$r\le u$
,
$r{\restriction } i\in G_i$
and
$r\in \mathrm {ran} (\sigma _i)$
, verifying the predensity condition.
3.6 Nice iterations of
$\infty $
-subproper
${}^\omega \omega $
-bounding forcing
In this section we will prove that
$\infty $
-subproper and
${}^\omega \omega $
-bounding forcing notions are iterable using nice iterations. Throughout, by a real we will mean a member of Baire space. We will use the concepts of a descending sequence of conditions in a poset interpreting a name for a real, the sequence respecting a real (in its interpretation of the given name for a real), and derived sequences, as outlined in Section 2.5 and described in detail in [Reference Abraham, Foreman and Kanamori1, Section 3].
Theorem 3.25. Nice iterations of
${}^\omega \omega $
-bounding
$\infty $
-subproper forcing notions are
${}^\omega \omega $
-bounding.
Proof. Let
${\langle {\mathord {\mathbb P}}_i\;|\;}{i\le \lambda \rangle }$
be a nice iteration of
$\infty $
-subproper,
${}^\omega \omega $
-bounding forcing posets.
Let
$\varphi (j)$
be the statement that
${\mathord {\mathbb P}}_j$
is
${}^\omega \omega $
-preserving and
$\infty $
-subproper. We prove
$\varphi (j)$
by induction on
$j\le \lambda $
. So suppose
$\varphi (\bar {j})$
holds for every
$\bar {j}<j$
.
We have to show that
${\mathord {\mathbb P}}_j$
is
${}^\omega \omega $
-preserving. This follows trivially from the inductive hypothesis if j is a successor ordinal. So assume that j is a limit ordinal.
Fix a condition
$q\in {\mathord {\mathbb P}}_j$
and a
${\mathord {\mathbb P}}_j$
-name
$\dot {x}$
such that q forces that
$\dot {x}$
is a real (in Baire space). We have to find an extension of q that forces
$\dot {x}$
to be bounded by some real in
$\mathrm {V}$
.
To this end, let
$\theta $
be sufficiently large,
$H_\theta \subseteq L_\tau ^A\models {\mathsf {ZFC}}^-$
,
$\theta <\tau $
,
$\sigma :{\bar {N}}\prec N$
with
$\dot {x},p,\vec {{\mathord {\mathbb P}}},j\in \mathrm {ran} (\sigma )$
, where
${\bar {N}}$
is countable, transitive and full. Use the bar notation for the preimages of these objects under
$\sigma $
. To emphasize the similarity to earlier constructions, the reader may think of
$p=\emptyset $
, the only member of
${\mathord {\mathbb P}}_0$
(which could also be denoted
$1_0$
), and
$i=0$
.
In
${\bar {N}}$
, pick some
$\le _{\bar {{\mathord {\mathbb P}}}_{\bar {j}}}$
-descending sequence of conditions
${\langle \bar {s}_k\;|\;}{k<\omega \rangle }$
with
$\bar {s}_0\le \bar {q}$
which interprets
$\dot {\bar {x}}$
as some real
$x_0$
.
Fix a real y to that for every
$x\in {}^\omega \omega \cap {\bar {N}}$
,
$x\le ^* y$
, and so that
$x_0\le _0 y$
.
We will find a condition
$p^*$
extending q in
${\mathord {\mathbb P}}_j$
, such that
$p^*$
forces that
$\dot {x}\le _0\check {y}$
.
Note that for any
$\alpha <\beta <j$
,
${\mathord {\mathbb P}}_\alpha $
and
${\mathord {\mathbb P}}_\beta $
are
${}^\omega \omega $
-bounding. It follows that
${\mathord {\mathbb P}}_\alpha $
forces that
${\mathord {\mathbb P}}_{\alpha ,\beta }$
is
${}^\omega \omega $
-bounding. Hence, a variation of the proof of Lemma 2.26, using Theorem 3.21 instead of Lemma 2.5, [Reference Abraham, Foreman and Kanamori1, Lemma 3.3] instead of Lemma 2.24 and again applying Corollary 3.15, yields the following version of Lemma 2.26 for the stages of the iteration:
-
(*) Let
$\alpha \le \beta <j$
. Fix some
$s\in {\bar {N}}$
. Let
$w\in {\mathord {\mathbb P}}_\alpha $
,
$q\in {\mathord {\mathbb P}}_j$
with
$w\le _\alpha q{\restriction }\alpha $
. Let
$S= {\langle \theta ,\vec {{\mathord {\mathbb P}}},\alpha ,\beta ,j,q,\dot {x},s \rangle } $
. Let
$\bar {q}\in {\bar {N}}$
and let
$\dot {\sigma }_\alpha $
be a
${\mathord {\mathbb P}}_\alpha $
-name. Let
$\bar {S}= {\langle \bar {\theta },\vec {\bar {{\mathord {\mathbb P}}}},{\bar {\alpha }},{\bar {\beta }},\bar {j},\bar {q},\dot {\bar {x}},\bar {s} \rangle } \in {\bar {N}}$
so that w forces with respect to
${\mathord {\mathbb P}}_\alpha $
:-
(A1)
$\dot {\sigma }_\alpha :\check {{\bar {N}}}\prec \check {N}$
, -
(A2)
$\dot {\sigma }_\alpha (\check {{\bar {S}}})=\check {S}$
, -
(A3)
$\dot {\sigma }_\alpha ^{-1}"\dot {G}_\alpha $
is
$\check {{\bar {N}}}$
-generic for
$\check {\bar {{\mathord {\mathbb P}}}}_{{\bar {\alpha }}}$
, -
(A4) Letting
$M= \mathrm {ran} (\dot {\sigma }_\alpha )$
, there is in
$M[\dot {G_\alpha }]$
a decreasing sequence of conditions in
${\mathord {\mathbb P}}_{\alpha ,j}$
, below
$\dot {q}{\restriction }[\alpha ,j)$
, which interprets
$\check {\dot {x}}$
and respects
$\check {y}$
.
Then: there are a condition
$w^*\in {\mathord {\mathbb P}}_\beta $
with
$w^*{\restriction }\alpha =w$
and
$w^*\le q{\restriction }\beta $
, and a
${\mathord {\mathbb P}}_\beta $
-name
$\dot {\sigma }_\beta $
such that whenever
$G_\beta $
is
${\mathord {\mathbb P}}_\beta $
-generic with
$c\in G_\beta $
, letting
$\sigma _\beta =\dot {\sigma }_\beta ^{G_\beta }$
,
$G_\alpha =G_\beta {\restriction }\alpha $
and
$\sigma _\alpha =\dot {\sigma }_\alpha ^{G_\alpha }$
, the following conditions hold:-
(C1)
$\sigma _\beta :{\bar {N}}\prec N$
, -
(C2)
$\sigma _\beta ({\bar {S}})=S$
, -
(C3)
$\sigma _\beta ^{-1}"G_\alpha =\sigma _\alpha ^{-1}"G_\alpha $
and
${\sigma _\beta }^{-1}"G_\beta $
is
$\bar {{\mathord {\mathbb P}}}_{\bar {\beta }}$
-generic over
$\bar {N}$
. -
(C4) Letting
$M= \mathrm {ran} (\sigma _\beta )$
, there is in
$M[G_\beta ]$
a decreasing sequence
${\vec {c}}$
of conditions in
${\mathord {\mathbb P}}_{\beta ,j}$
below
$q{\restriction }[\beta ,j)$
which interprets
$\dot {x}$
and respects y.
-
Proof of
$(*)$
.
We give an argument, for completeness. Let
$G_\alpha $
be
${\mathord {\mathbb P}}_\alpha $
-generic with
$w\in G_\alpha $
. Let
$\sigma _\alpha =\dot {\sigma }_\alpha ^{G_\alpha }$
and let
$M= \mathrm {ran} (\sigma _\alpha )$
. Let
$\bar {G}_{\bar {\alpha }}=\sigma _\alpha ^{-1}"G_\alpha $
, and let
$\sigma ^*_\alpha :{\bar {N}}[\bar {G}_{\bar {\alpha }}]\prec N[G_\alpha ]$
be the unique elementary embedding that maps
$\bar {G}_{\bar {\alpha }}$
to
$G_\alpha $
. Observe that the reals of
${\bar {N}}[\bar {G}_{{\bar {\alpha }}}]$
are eventually bounded by g, as are the reals of
$M[G_\alpha ]$
. Let
$\dot {x}/G_\alpha $
be the canonical
${\mathord {\mathbb P}}_{\alpha ,j}$
-name such that if
$G_{\alpha ,j}$
is
${\mathord {\mathbb P}}_{\alpha ,j}$
-generic, then
$(\dot {x}/G_\alpha )^{G_\alpha ,j}=\dot {x}^{G_\alpha *G_{\alpha ,j}}$
. It follows from 3.6 that there is in
$M[G_\alpha ]$
a decreasing sequence
$\vec {r}$
in
${\mathord {\mathbb P}}_{\alpha ,j}$
below
$q{\restriction }[\alpha ,j)$
which interprets
$\dot {x}/G_\alpha $
and respects y. Applying [Reference Abraham, Foreman and Kanamori1, Lemma 3.3] to
$M[G_\alpha ]$
, the orderings
${\mathord {\mathbb P}}_{\alpha ,\beta }$
and
${\mathord {\mathbb P}}_{\alpha ,j}$
and the condition
$q{\restriction }[\alpha ,j)$
, there is a condition
$d\in {\mathord {\mathbb P}}_\beta $
with
$d{\restriction }\alpha \in G_\alpha $
(so
$d{\restriction }[\alpha ,\beta )\in {\mathord {\mathbb P}}_{\alpha ,\beta }$
) such that
$d{\restriction }[\alpha ,\beta )\in M[G_0]$
and
$d{\restriction }[\alpha ,\beta )\le _{\alpha ,\beta }q{\restriction }[\alpha ,\beta )$
, with the key property that
$d{\restriction }[\alpha ,\beta )$
forces with respect to
${\mathord {\mathbb P}}_{\alpha ,\beta }$
that there is in
$M[G_\alpha ][\dot {G}_{\alpha ,\beta }]$
a decreasing sequence
$\vec {r}$
in
${\mathord {\mathbb P}}_{\beta ,j}$
below
$q{\restriction }[\alpha ,j)$
which interprets
$\dot {x}$
and respects y; in fact the derived sequence
$\delta _{G_\beta }(\vec {r},\dot {x})$
is such a sequence. There is a name for d, forced by w to have all the properties listed, but since w then also forces that
$d{\restriction }\alpha \in \dot {G}_\alpha $
, it follows by Corollary 3.15 that this name can be identified with a condition in
${\mathord {\mathbb P}}_\beta $
such that
$d{\restriction }\alpha =w$
. It follows that
$\bar {d}=\sigma _\alpha ^{-1}(d)\in \bar {{\mathord {\mathbb P}}}_{\bar {\beta }}$
.
Let
$\dot {\vec {r}}\in M$
be a
${\mathord {\mathbb P}}_\alpha $
-name for the sequence
$\vec {r}$
, and let
$\dot {\vec {\bar {r}}}$
be its preimage under
$\sigma _\alpha $
. I.e.,
$\dot {\vec {r}}^{G_\alpha }=\vec {r}$
and
$\sigma _\alpha (\dot {\vec {\bar {r}}})=\dot {\vec {r}}$
.
Let
$w'\in G_\alpha $
,
$w'\le w$
, be such that
$w'\Vdash \dot {\sigma }_\alpha (\check {\bar {d}})=\check {d}$
and
$\dot {\sigma }_\alpha ((\dot {\vec {\bar {r}}})\check {})=(\dot {\vec {r}})\check {}$
, and such that
$w'$
forces “the interpretation of
$(\dot {\vec {r}})\check {}$
is a decreasing sequence as described”.
Note that
$w'\le w=d{\restriction }\alpha $
. By Theorem 3.21, there is a
$\tilde {w}\in {\mathord {\mathbb P}}_\beta $
with
$\tilde {w}\le _\beta d$
(so
$\tilde {w}{\restriction }[\alpha ,\beta )\le q{\restriction }[\alpha ,\beta )$
) and
$\tilde {w}{\restriction }\alpha =w'$
such that whenever
$H_\beta $
is
${\mathord {\mathbb P}}_\beta $
-generic over with
$\tilde {w}\in H_\beta $
, letting
$H_\alpha =H{\restriction }\alpha $
, there is in
$\mathrm {V}[H_\beta ]$
an elementary embedding
$\sigma _\beta :{\bar {N}}\prec N$
satisfying conditions (C1)–(C3) (using
$\sigma _\alpha =\dot {\sigma }_\alpha ^{H_\alpha }$
here), such that also
$\sigma _\alpha (\bar {d})=d=\sigma _\beta ({\bar {d}})$
and
$\sigma _\alpha (\dot {\vec {\bar {r}}})=\dot {\vec {r}}$
.
Now let us let
$G_{\alpha ,\beta }$
be
${\mathord {\mathbb P}}_{\alpha ,\beta }$
-generic over
$\mathrm {V}[G_\alpha ]$
, with
$\tilde {w}\in G_\alpha *G_{\alpha ,\beta }=G_\beta $
. Note that
$d{\restriction }[\alpha ,\beta )\in H_{\alpha ,\beta }$
, since
$\tilde {w}\le d$
. So by what
$d{\restriction }[\alpha ,\beta )$
forced, the derived sequence
$\delta _{G_\beta }(\dot {\vec {r}}^{G_\alpha },\dot {x})$
is below
$q{\restriction }[\beta ,j)$
, interprets
$\dot {x}$
and respects y. Moreover, it is in
$ \mathrm {ran} (\sigma _\beta )[G_\beta ]$
.
In particular,
$\tilde {w}$
forces the existence of an embedding
$\sigma _\beta $
with all the desired properties (C1)–(C4). Since such a
$\tilde {w}$
exists, no matter what
$G_\alpha $
is (as long as
$w\in G_\alpha $
), there is a
${\mathord {\mathbb P}}_\alpha $
-name
$\dot {\tilde {w}}$
such that w forces that
$\dot {\tilde {w}}{\restriction }\alpha \in G_\alpha $
, and that
$\dot {\tilde {w}}{\restriction }[\alpha ,j)$
forces the existence of such an embedding
$\sigma _\beta $
. Furthermore, w forces that
$\dot {\tilde {w}}{\restriction }[\alpha ,\beta )\le q{\restriction }[\alpha ,\beta )$
. But, again by Corollary 3.15, there is then a
$w^*\in {\mathord {\mathbb P}}_\beta $
such that
$w^*{\restriction }\alpha =w$
and such that w forces that
$w^*{\restriction }[\alpha ,\beta )\equiv \dot {\tilde {w}}\le q{\restriction }[\alpha ,\beta )$
. This is the
$w^*$
we were looking for.
As before, let
${\langle t_n\;|\;}{n < \omega \rangle }$
enumerate the elements of
${\bar {N}}$
, starting with
$t_0=\emptyset $
. Since we already know that the iteration is
$\infty $
-subproper, we don’t have to worry about meeting any dense sets, so we don’t need to fix an enumeration of the dense open subsets of
$\bar {{\mathord {\mathbb P}}}_{\bar {j}}$
in
${\bar {N}}$
this time. But we again let
$\bar {W}$
be a nested antichain in
$\bar {\vec {{\mathord {\mathbb P}}}}{\restriction }{\bar {j}}$
such that
$\bar {q}$
is a mixture of
$\bar {W}$
up to
$\bar {j}$
, whose root has length
$\bar {i}=0$
,
$<_{{\bar {N}}}$
-minimal with this property, and we let W be the
$<_N$
-least nested antichain in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
whose root has length i and such that q is a mixture of W up to j.
Much like in the
$\infty $
-subproperness iteration theorem, we will construct a fusion structure whose fusion can serve as
$p^*$
. Specifically, we construct a sequence
which satisfies all the properties listed in the proof of Theorem 3.21, with two extra requirements (items (5) and (8)) regarding the interpretation of
$\dot {x}$
(but dropping the requirement regarding the enumeration of dense open sets in
${\bar {N}}$
):
-
(1)
$T_0 = \{p\}$
,
$q^{(p,0)}=q$
,
$T^{(p,0)}=W$
,
$\dot {\sigma }^{(p,0)} = \check {\sigma }$
.
Further, for any
$n<\omega $
and
$a\in T_n$
:
-
(2)
$a\in {\mathord {\mathbb P}}_{l(a)}$
, where
$l(a)<j$
.
$q^{(a, n)}\in {\mathord {\mathbb P}}_j$
,
$q^{(a, n)}\le _j q$
and
$\dot {\sigma }^{(a, n)}$
is a
${\mathord {\mathbb P}}_{l(a)}$
-name. -
(3) a forces the following statements with respect to
${\mathord {\mathbb P}}_{l(a)}$
:-
(a)
$\dot {\sigma }^{(a, n)} : \check {{\bar {N}}}\prec \check {N}$
. -
(b)
$\dot {\sigma }^{(a, n)}(\check {\bar {\theta }}, \check {\bar {\vec {{\mathord {\mathbb P}}}}}, \check {\bar {i}},\check {\bar {j}}, \check {\bar {q}} ) = \check {\theta }, \check {\vec {{\mathord {\mathbb P}}}}, \check {s}, \check {i}, \check {j}, \check {q} $
. -
(c)
$q^{(a,n)}\in \mathrm {ran} (\dot {\sigma }^{(a,n)})$
.
-
-
(4) There are
$\bar {T}^{(a,n)}$
,
$\overline {l(a)}$
which are forced by a to be the preimages of
$T^{(a,n)}$
,
$l(a)$
under
$\dot {\sigma }^{(a,n)}$
, in the sense that
$a\Vdash \dot {\sigma }^{(a,n)}((\bar {T}^{(a,n)})\check {})=(T^{(a,n)})\check {}$
. Moreover, a forces that
$(\dot {\sigma }^{(a,n)})^{-1}"\dot {G}_{l(a)}$
is
$\bar {{\mathord {\mathbb P}}}_{\overline {l(a)}}$
-generic over
${\bar {N}}$
. -
(5) a forces wrt.
${\mathord {\mathbb P}}_{l(a)}$
that in the range of
$\dot {\sigma }^{(a,n)}$
there is a decreasing sequence of conditions in
${\mathord {\mathbb P}}_{l(a),j}$
below
$q^{(a,n)}{\restriction }[l(a),j)$
, such that the sequence interprets
$\dot {x}$
and respects y.
For
$b \in \mathrm {suc}^n_T (a)$
:
-
(6) b forces with respect to
${\mathord {\mathbb P}}_{l(b)}$
that
$$\begin{align*}(\dot{\sigma}^{(b,n+1)})^{-1}"\dot{G}_{l(a)}=(\dot{\sigma}^{(a,n)})^{-1}"\dot{G}_{l(a)}.\end{align*}$$
Further, if
$m\le n$
, then
$$\begin{align*}b \Vdash_{l(b)} \dot{\sigma}^{(b, n+1)}(\check{t}_m) = \dot{\sigma}^{(a, n)}(\check{t}_m).\end{align*}$$
Also, let
$<_T$
be the transitive closure of the order
$<^{\prime }_T$
on
$\{ {\langle c,k \rangle } \;|\; k<\omega \land c\in T_k\}$
defined by
$ {\langle c,k \rangle } <^{\prime }_T {\langle d,l \rangle } $
iff
$l=k+1$
and
$d\in \mathop {\mathrm {suc}}_T^k(c)$
. Then, if
$ {\langle c,m \rangle } \le _T {\langle a,n \rangle } $
, we have that
$$\begin{align*}b\Vdash\dot{\sigma}^{(b,n+1)}(\bar{q}^{(c,m)})=\dot{\sigma}^{(a,n)}(\bar{q}^{(c,m)}).\end{align*}$$
-
(7) There are
$\bar {q}^{(b,n+1)}$
,
$\bar {T}^{(b,n+1)}$
such that
$b{\restriction } l(a)\Vdash _{l(a)} \dot {\sigma }^{(a,n)}((\bar {q}^{(b,n+1)})\check {},(\bar {T}^{(b,n+1)})\check {})= (q^{(b,n+1)})\check {},(\bar {T}^{(b,n+1)})\check {}$
. -
(8)
$q^{(b,n+1)}$
decides
$\dot {x}{\restriction } n$
, and
$q^{(b, n+1)}\Vdash _j\dot {x}{\restriction } n \leq _0 \check {y} {\restriction } n$
.
Further, as before, in order to ensure that we end up constructing a fusion sequence, we require that
$T^{(a,n)}$
is a nested antichain in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
, that
$q^{(a,n)}$
is
$(T^{(a,n)},j)$
-nice, that
$l(\mathrm {root}(T^{(a,n)}))=l(a)$
, that
$a\le q^{(a,n)}{\restriction } l(a)$
and that for
$b\in \mathop {\mathrm {suc}}^n_T(a)$
,
$T^{(b,n+1)}\mathrel {\angle } T^{(a,n)}$
and
$b{\restriction } l(a)\le a$
.
Supposing we can construct such a sequence and letting
$p^*$
be a fusion of the fusion sequence, then in any extension by a generic filter G containing
$p^*$
, it follows that
$\dot {x}^G \leq _0 y$
, because in
$\mathrm {V}[G]$
, there is a sequence
${\langle a_n\;|\;}{a<n\rangle }$
such that for all
$n<\omega $
,
$q^{(a_n,n)}\in G$
. So by 8,
$\dot {x}^G{\restriction } n\le _0y{\restriction } n$
for every n. We don’t have to worry about piecing together the embeddings
$\sigma ^{(a_n,n)}$
as before, because we already know that
${\mathord {\mathbb P}}_j$
is
$\infty $
-subproper.
Thus it suffices to show that such a sequence can be constructed. This is done by recursion on
$n<\omega $
. The case
$n=0$
is given by (1). For the inductive step, suppose for some
$n<\omega $
we have constructed
$q^{(a,n)}, T^{(a, n)}$
and
$\dot {\sigma }^{(a, n)}$
for some
$a \in T_n$
satisfying (1)–(5) and
$\mathrm {suc}^m_T$
has been defined for all
$m<n$
. Assume also
$q^{(a, n)}$
decides
$\dot {x}{\restriction }(n-1)$
(this is for free if
$n=0$
and it follows from 8 at stage n if
$n>0$
). We have to define
$\mathop {\mathrm {suc}}_T^n(a)$
. To this end, let D be the set of all
$b\in \bigcup _{l(a)\le \xi <j}{\mathord {\mathbb P}}_\xi $
such that there are a nested antichain S in
$\vec {{\mathord {\mathbb P}}}{\restriction } j$
as well as objects
$\dot {\sigma }^b$
, u,
$\bar {u}$
,
$\bar {S}$
,
$\overline {l(b)}$
, satisfying the following conditions:
-
(D1)
$b{\restriction } l(a)\le a$
. -
(D2)
$S \mathrel {\angle } T^{(a, n)}$
,
${\bar {S}}\in {\bar {N}}$
,
$S\in N$
. -
(D3)
$u\in {\mathord {\mathbb P}}_j$
,
$u \leq q^{(a,n)}$
and u is a mixture of S up to j. -
(D4)
$b\le _{l(b)}u{\restriction } l(b)$
and
$l(b)=l(\mathrm {root}(S))$
. -
(D5)
$b{\restriction } l(a)\Vdash _{l(a)}\dot {\sigma }^{(a,n)}(\check {\bar {S}},\check {\bar {u}},(\overline {l(b)})\check {})=\check {S},\check {u},(l(b))\check {}$
. -
(D6)
$\dot {\sigma }^b$
is a
${\mathord {\mathbb P}}_{l(b)}$
-name, and b forces with respect to
${\mathord {\mathbb P}}_{l(b)}$
:-
(a)
$\dot {\sigma }^b: \check {{\bar {N}}}\prec \check {N}$
. -
(b)
$\dot {\sigma }^b (\check {\overline {\theta }},\check {\bar {i}},\check {\bar {j}},\check {\bar {\vec {{\mathord {\mathbb P}}}}}, \check {\overline {s}},\check {\overline {u}},\check {{\bar {S}}}, \check {\bar {q}},(\overline {l(b)})\check {} ) = \check {\theta },\check {i},\check {j},\check {\vec {{\mathord {\mathbb P}}}},\dot {\sigma }({\bar {s}}), \check {u},\check {S}, \check {q},(l(b))\check {} $
, and
$\forall m \leq n\forall c\quad \dot {\sigma }^b(t_m) = \dot {\sigma }^{(a, n)}(t_m)$
and
$ {\langle c,m \rangle } \le _T {\langle a,n \rangle } \longrightarrow \dot {\sigma }^b(\bar {q}^{(c,m)})=\dot {\sigma }^{(a,n)}(\bar {q}^{(c,m)})$
. -
(c)
$(\dot {\sigma }^b)^{-1}"\dot {G}_{l(a)}=(\dot {\sigma }^{(a,n)})^{-1}"\dot {G}_{l(a)}$
and
$(\dot {\sigma }^b)^{-1}"\dot {G}_{l(b)}$
is
$\bar {{\mathord {\mathbb P}}}_{\overline {l(b)}}$
-generic over
${\bar {N}}$
.
-
-
(D7) b forces with respect to
${\mathord {\mathbb P}}_{l(b)}$
that in the range of
$\dot {\sigma }^b$
there is sequence
$\vec {q'}$
of conditions in
${\mathord {\mathbb P}}_j$
, such that
$\vec {q'}/\dot {G}_{l(b)}$
is decreasing in
${\mathord {\mathbb P}}_{l(b),j}$
, below
$u/\dot {G}_{l(b)}$
, interprets
$\dot {x}$
and respects y. -
(D8) u decides
$\dot {x}{\restriction } n$
, and
$u\Vdash _j\dot {x}{\restriction }\check {n}\le _0\check {y}{\restriction }\check {n}$
.
Let
$\alpha =l(a)$
. As in the proofs of the two iteration theorems,
$D{\restriction }\alpha $
is open in
${\mathord {\mathbb P}}_\alpha $
, and it suffices to show that
$D{\restriction }\alpha $
is predense below a in
${\mathord {\mathbb P}}_\alpha $
.
To prove that
$D{\restriction }\alpha $
is predense below a, let
$G_\alpha $
be a
${\mathord {\mathbb P}}_\alpha $
-generic filter with
$a\in G_\alpha $
. Work in
$\mathrm {V}[G_\alpha ]$
. Let
$\sigma _n$
be the evaluation of
$\dot {\sigma }^{(a, n)}$
by
$G_\alpha $
. We have that
$\sigma _n:{\bar {N}}\prec N$
moves the various parameters we care about correctly,
$\bar {G}_{{\bar {\alpha }}}=\sigma _n^{-1}"G_{l(a)}$
is
$\bar {{\mathord {\mathbb P}}}_{{\bar {\alpha }}}$
-generic over
${\bar {N}}$
, and in
$ \mathrm {ran} (\sigma _n)$
there is a sequence
$\vec {q}$
of conditions in
${\mathord {\mathbb P}}_j$
, below
$q^{(a,n)}$
, such that
$q_m{\restriction }\alpha \in G_{\alpha }$
for each
$m<\omega $
, decreasing in
${\mathord {\mathbb P}}_{\alpha ,j}$
, interpreting
$\dot {\bar {x}}$
, and respecting y. Let
$q_n$
be the n-th element of this sequence, which decides
$\dot {x}{\restriction } n$
, and let
$\bar {q}_n$
be its preimage under
$\sigma _n$
. Let
$v:n\longrightarrow \omega $
be such that
$q_n\Vdash \dot {x}{\restriction } n=\check {v}$
.
By elementarity,
$\overline {q}^{(a, n)}$
is a mixture of
$\overline {T}^{(a, n)}$
up to
$\overline {j}$
. Let
${\bar {T}}_0^{(a,n)}=\{{\bar {a}}_0\}$
. Let
$a_0=\sigma _n({\bar {a}}_0)$
. We know that
$a\le q^{(a,n)}{\restriction }\alpha $
, so
$q^{(a,n)}{\restriction }\alpha \in G_\alpha $
, so
$\bar {q}^{(a,n)}{\restriction }{\bar {\alpha }}\in \bar {G}_{{\bar {\alpha }}}$
. By Fact 3.13.(1),
$\bar {q}^{(a,n)}{\restriction } l({\bar {a}}_0)\equiv {\bar {a}}_0$
. Since we have ensured that
$\alpha =l(\mathrm {root}(T^{(a,n)}))$
, we have by elementarity that
${\bar {\alpha }}=l(\bar {a}_0)$
. So
${\bar {a}}_0\in \bar {G}_{{\bar {\alpha }}}$
. Let
$\bar {r}\in {\bar {T}}_1^{(a,n)}$
be such that
$\bar {r}{\restriction }{\bar {\alpha }}\in {\bar {G}}_{{\bar {\alpha }}}$
. Let
$\bar {\beta }=l(\bar {r})$
and
$\beta =\sigma _n(\bar {\beta })$
. Let
$\bar {u}\in {\bar {{\mathord {\mathbb P}}}}_{\bar {j}}$
strengthen
$\tilde {q}=\bar {r}^{\frown }\bar {q}_n{\restriction } [{l(\bar {r})},\bar {j})$
so that
$\bar {u}{\restriction }{\bar {\alpha }}\in {\bar {G}}_{{\bar {\alpha }}}$
.
Let
$\tilde {u}\in \bar {G}_{{\bar {\alpha }}}$
with
$\tilde {u}\le \bar {r}{\restriction }{\bar {\alpha }},\bar {q}_n{\restriction }{\bar {\alpha }}$
(as both of these conditions are in
$\bar {G}_{\bar {\alpha }}$
), and then set
$\bar {u}=\tilde {u}{{}^\frown }\bar {q}_n{\restriction }[{\bar {\alpha }},\bar {j}]$
. So we have:
By Lemma 3.17, applied in
${\bar {N}}$
, we can pick a nested antichain
$\bar {S} \mathrel {\angle } \bar {T}^{(a, n)}$
such that
$\bar {u}$
is a mixture of
${\bar {S}}$
up to
$\bar {j}$
and such that letting
${\bar {S}}_0 = \{{\bar {d}}_0\}$
, we have that
$l(\bar {r}),\bar {l(a)}\leq l({\bar {d}}_0)$
and
${\bar {d}}_0 {\restriction } l(\bar {r}) \leq \bar {r}$
. Moreover, we have that
$\bar {u}{\restriction } l({\bar {d}}_0)\equiv {\bar {d}}_0$
, since
$\bar {u}$
is a mixture of
${\bar {S}}$
up to
$\bar {j}$
. In particular,
${\bar {d}}_0{\restriction }\overline {l(a)}\in {\bar {G}}_{\overline {l(a)}}$
.
Let
$S,d_0,u,q_n=\sigma _n({\bar {S}},{\bar {d}}_0,{\bar {u}},\bar {q}_n)$
, and let
$l(d_0) = \beta =\sigma _n(l({\bar {d}}_0))=\sigma _n(\bar {\beta })$
. We have that
$u{\restriction } l(d_0)\equiv d_0$
. Note that
$d_0{\restriction } l(a)\in G_{l(a)}$
. Also, let
$\bar {s}'$
be a tuple of parameters in
${\bar {N}}$
we want our new embedding to move the same way
$\sigma _n$
does, and let
$s'=\sigma (\bar {s}')$
.
Let
$w\in G_{l(a)}$
force these facts about
$\dot {\sigma }^{(a,n)}$
and the check names for the parameters
$\bar {S},\bar {d_0},{\bar {u}},{\bar {s}}'$
and
$S,d_0,u,s',v$
. Since
$a,d_0{\restriction } l(a)\in G_{l(a)}$
, we may choose w so that
$w\le _{l(a)}a,d_0{\restriction } l(a)$
.
Now we apply
$(*)$
to w,
$q=u$
,
$\bar {q}=\bar {u}$
and
$\dot {\sigma }_\alpha =\dot {\sigma }^{(a,n)}$
. Note here that the sequence
${\langle q_m{\restriction }[\alpha ,j)\;|\;}{n\le m<\omega \rangle }$
is forced to be decreasing and below u in
${\mathord {\mathbb P}}_{\alpha ,j}$
by w. We obtain a condition
$b=w^*\in {\mathord {\mathbb P}}_\beta $
with
$b{\restriction }\alpha =w$
and
$b\le u{\restriction }\beta \equiv d_0$
, and a
${\mathord {\mathbb P}}_\beta $
-name
$\dot {\sigma }'$
such that b forces with respect to
${\mathord {\mathbb P}}_\beta $
:
-
(a)
$\dot {\sigma }'$
and
$\dot {\sigma }^{(a,n)}$
move the parameters
$\check {\bar {\vec {{\mathord {\mathbb P}}}}}$
,
$\check {\overline {l(a)}}$
,
$\check {\overline {\beta }}$
,
$\check {{\bar {\theta }}}$
,
$\check {{\bar {u}}}$
,
$\check {{\bar {d}}}_0$
,
$\bar {s}'$
,
$\bar {q}_n$
and
$\check {{\bar {S}}}$
the same way. -
(b)
$(\dot {\sigma }'{}^{-1})"\dot {G}_\beta $
is generic over
$\check {{\bar {N}}}$
. -
(c)
$(\dot {\sigma }'{}^{-1})"\dot {G}_{l(\alpha )}=(\dot {\sigma }^{(a,n)})^{-1}"G_{l(\alpha )}$
. -
(d) there is in
$ \mathrm {ran} (\dot {\sigma }')$
a sequence of conditions
$\vec {q'}$
in
${\mathord {\mathbb P}}_j$
such that
$\vec {q'}{\restriction }\dot {G}_{l(b)}$
is decreasing and below
$u/\dot {G}_{l(b)}$
in
${\mathord {\mathbb P}}_{l(b),j}$
, that interprets
$\dot {x}$
and respects y.
Note that w forced that
$\dot {\sigma }^{(a,n)}({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
and hence, since
$b{\restriction } l(a)=w$
, b forces that
$\dot {\sigma }'({\bar {u}},{\bar {d}}_0,{\bar {S}})=u,d_0,S$
as well. In addition, we may insist that
$\sigma '$
moves all the required parameters the same way
$\dot {\sigma }^{(a,n)}$
does (by listing them in
$\bar {s}'$
).
To finish, we claim that
$b\in D$
as witnessed by u and
$\dot {\sigma }'$
. The only new point that requires checking (compared to the proof of Theorem 3.21) is (D8): that u decides
$\dot {x}$
and forces that
$\dot {\bar {x}}{\restriction } n \leq _0 \check {y} {\restriction } n$
. But this is clear since
$\bar {u}\le \bar {q}_n\Vdash _{\bar {j}}\dot {x}{\restriction } n=\check {v}\le _0\check {y}{\restriction } n$
.
We remark that in the second author’s PhD thesis (written under the direction of the first author) a general version of Theorem 3.25 is proved that implies that many preservation results on the reals for proper forcing hold for
$\infty $
-subproper forcing as well including the Sacks and Laver properties.
4 Applications
In this section we provide some applications of the preservation theorems proved in the previous two sections, as announced in the introduction. In what follows, one can choose to iterate using either RCS iterations or nice iterations. If using the latter, “subcomplete” and “subproper” can be replaced by their “infinity” versions.
The main technique used here is as follows. We start in a model with a supercompact cardinal. Suppose we have a subproper forcing
$\mathbb P$
which preserves some property that is also preserved by all subcomplete forcing (for instance not killing a fixed Souslin tree S). Then we can add
$\mathbb P$
into the standard Baumgartner type iteration to produce a model of
$\mathsf {SCFA} $
while preserving that property (so S remains Souslin). Moreover,
$\mathsf {SCFA} $
will be forced in the final model, but
$\mathbb P$
makes some contribution as well.
Recall that a forcing notion
$\mathbb P$
is
$\sigma $
-linked if it can be written as the countable union,
$\mathbb P = \bigcup _{n < \omega } \mathbb P_n$
where for each
$n < \omega \mathbb P_n$
consists of pairwise compatible elements. Note that
$\sigma $
-linked forcing notions are ccc. The following is well known.
Proposition 4.1. If S is a Souslin tree and
$\mathbb P$
is
$\sigma $
-linked then forcing with
$\mathbb P$
preserves S as a Souslin tree.
Proof. Let
$\mathbb P$
and S be as in the statement and since
$\mathbb P$
is
$\sigma $
-linked it can be written as
$\bigcup _{n < \omega } \mathbb P_n$
. Now suppose
$\dot {A}$
names a maximal antichain in S and suppose
$p \in \mathbb P$
forces that
$\dot {A}$
is uncountable. For each
$n < \omega $
let
Since each
$\mathbb P_n$
consists of pairwise compatible elements, it follows that each
$A_n$
is an antichain. Since
$A_n\in \mathrm {V}$
, it’s countable. But that means that
$\bigcup _{n < \omega } A_n$
is countable, that is, the set of all
$s\in S$
so that there is some condition stronger than p forcing s to be in
$\dot {A}$
is countable, which contradicts the fact that p forced
$\dot {A}$
to be uncountable.
In the following, we will treat both
$\mathsf {SCFA} $
, the subcomplete forcing axiom, and its bounded version
$\mathsf {BSCFA} $
.
$\mathsf {SCFA} $
states that if
${\mathord {\mathbb P}}$
is a subcomplete forcing and
${\langle D_i\;|\;}{i<\omega _1\rangle }$
is a sequence of dense subsets of
${\mathord {\mathbb P}}$
, then there is a filter
$F\subseteq {\mathord {\mathbb P}}$
such that for every
$i<\omega _1$
,
$F\cap D_i\neq \emptyset $
. The bounded version of the axiom, denoted
$\mathsf {BSCFA} $
, is the weaker form of the axiom stating that whenever
${\mathord {\mathbb {B}}}$
is the regular open algebra of a subcomplete forcing and
${\langle A_i\;|\;}{i<\omega _1\rangle }$
is a sequence of maximal antichains in
${\mathord {\mathbb {B}}}^+$
, each of which has size at most
$\aleph _1$
, then there is a filter
$F\subseteq {\mathord {\mathbb {B}}}^+$
such that for every
$i<\omega _1$
,
$F\cap A_i\neq \emptyset $
. This axiom was originally introduced for proper forcing by Goldstern and Shelah [Reference Goldstern and Shelah8], where the consistency strength of the bounded proper forcing axiom was shown to be exactly a reflecting cardinal. In Fuchs [Reference Fuchs3], the version for subcomplete forcing was analyzed and shown to have the same consistency strength. In all the applications below,
$\mathsf {SCFA} $
and
$\mathsf {BSCFA} $
could be replaced by their “
$\infty $
” versions, however, since we do not know if these statements are equivalent or not we leave this out.
Theorem 4.2. Assume that
$\kappa $
is supercompact. Then there is a
$\kappa $
-length iteration
$\mathbb P_\kappa $
of subproper forcing notions so that if
$G\subseteq \mathbb P_\kappa $
is generic over
$\mathrm {V}$
then in
$\mathrm {V}[G]$
there are Souslin trees,
$\mathfrak {c} = \aleph _2$
and
$\mathsf {SCFA} $
holds. If
$\kappa $
is only a reflecting cardinal then the same conclusion holds true with
$\mathsf {SCFA} $
replaced by
$\mathsf {BSCFA} $
, the bounded subcomplete forcing axiom.
As mentioned in the beginning of this section, the word “iteration” in the theorem can be interpreted either way discussed in this paper.
Proof. By forcing if necessary, assume first that in
$\mathrm {V}$
that there is a Souslin tree S. Let
$\kappa $
be supercompact. We will define a
$\kappa $
-length iteration,
$\mathbb P_\kappa $
as follows: let
$f: \kappa \to V_\kappa $
be a Laver function. At stage
$\alpha $
if
$f(\alpha ) = (\dot {\mathbb P}, \mathcal D)$
is a pair of
$\mathbb P_\alpha $
names such that
$\dot {\mathbb P}$
is a subcomplete forcing notion and
$\mathcal D$
is a
$\gamma $
-sequence of dense subsets of
$\dot {\mathbb P}$
for some
$\gamma < \kappa $
then let
$\dot {\mathbb Q}_\alpha = \dot {\mathbb P}$
otherwise add a Cohen real. By the iteration theorems proved in the earlier sections, at limit stages either we can decide to take RCS limits, in which case we need to collapse each iterand to
$\aleph _1$
as well, or else nice limits in the sense of the previous section. Either way, since every iterand is either subcomplete or proper, the entire iteration is subproper. Moreover, since subcomplete forcing doesn’t kill Souslin trees, and neither does Cohen forcing, since it’s
$\sigma $
-linked, the entire iteration doesn’t kill S.
A standard
$\Delta $
-system argument shows that
$\mathbb P_\kappa $
has the
$\kappa $
-c.c. but since
$\mathbb P_\kappa $
collapses everything inbetween
$\omega _1$
and
$\kappa $
, in the extension
$\kappa = \omega _2$
. Also Cohen reals are added unboundedly often there are
$\kappa $
many new reals in the extension so
$\kappa = 2^{\aleph _0}$
. Finally the usual Baumgartner argument shows that
$\mathsf {SCFA} $
must be forced as well. For a detailed proof of this in the subcomplete context see Jensen [Reference Jensen, Chong, Feng, Slaman, Woodin and Yang13, pp. 65–66, Proof of Theorem 5]. There Jensen checks the Baumgartner proof when no reals are added but it’s easily seen to go through in this case as well.
For the case of
$\mathsf {BSCFA} $
the proof is nearly identical, replacing the argument for
$\mathsf {SCFA} $
from the Laver diamond by the one for
$\mathsf {BSCFA} $
with a reflecting cardinal, see Fuchs [Reference Fuchs3, Lemma 3.5].
Following language used by Jensen in [Reference Jensen11], let us refer to any model obtained by performing the Baumgartner style iteration below a supercompact cardinal, by iterating forcings belonging to some forcing class
$\Gamma $
as the natural model for the forcing axiom for
$\Gamma $
. The previous theorem then shows that the natural model for the forcing axiom for the class of all forcings which are either subcomplete or Cohen forcing, satisfies
$\mathsf {SCFA} + \mathfrak {c}=\omega _2 + \text {"there is a Souslin tree"}$
, because Cohen forcing adds a Souslin tree, and that Souslin tree survives.
Observe that all that was used about Cohen forcing in the proof above is that it is
$\sigma $
-linked and adds a real. It follows that we could have ensured that we force with every
$\sigma $
-linked forcing the Laver diamond guessed as well. As a result essentially the same proof gives the following.
Theorem 4.3. Assume that
$\kappa $
is supercompact. Then there is a
$\kappa $
-length iteration
$\mathbb P_\kappa $
of subproper forcing notions so that if
$G\subseteq \mathbb P_\kappa $
is generic over
$\mathrm {V}$
then in
$\mathrm {V}[G]$
there are Souslin trees,
$\mathfrak {c} = \aleph _2$
, and both
$\mathsf {SCFA} $
and
$\mathsf {MA}_{\aleph _1} (\sigma \mathrm {-linked})$
hold. If
$\kappa $
is only a reflecting cardinal then the same conclusion holds true with
$\mathsf {SCFA} $
replaced by
$\mathsf {BSCFA} $
. As a result,
$\mathsf {SCFA} + \mathsf {MA}_{\aleph _1} (\sigma \mathrm {- linked})$
does not imply
$\mathsf {MA}$
(as
$\mathsf {MA}$
implies Souslin’s Hypothesis).
Again, the model of the previous theorem can be taken to be the natural model for the forcing axiom for the class of all forcing notions that are subcomplete or
$\sigma $
-linked.
The
${}^\omega \omega $
-bounding preservation theorem gives us another result along these lines. Recall that
$\mathfrak {d}$
, the dominating number, is the smallest cardinal
$\kappa $
such that there is a collection D of reals, of cardinality
$\kappa $
, such that every real is dominated by some real in D.
Theorem 4.4. Assume that
$\kappa $
is supercompact. Then there is a
$\kappa $
-length iteration
$\mathbb P_\kappa $
of subproper forcing notions so that if
$G\subseteq \mathbb P_\kappa $
is generic over
$\mathrm {V}$
then in
$\mathrm {V}[G]$
we have that
$\mathfrak {d} = \aleph _1 < \mathfrak {c} = \aleph _2$
and
$\mathsf {SCFA} $
holds. Moreover, it can be arranged that there are either Souslin trees or not. If
$\kappa $
is only a reflecting cardinal then the same conclusion holds true with
$\mathsf {SCFA} $
replaced by
$\mathsf {BSCFA} $
.
Proof. The idea is the same as in the previous theorem, replacing Cohen forcing with some fixed
$\omega ^\omega $
-bounding forcing which adds a real, for example random forcing. By the preservation theorem, the entire iteration will be
$\omega ^\omega $
-bounding and so
$\mathfrak {d} = \aleph _1$
as witnessed by the collection of the ground model reals, which will be dominating and have size
$\aleph _1$
in the final model. For the “moreover” part, note that since random forcing is
$\sigma $
-linked, the resulting iteration will preserve any given Souslin tree, thus giving the consistency of the above with a Souslin tree. However, one could also choose to force with every Souslin tree as they are guessed by the Laver diamond. Since forcing with a Souslin tree is ccc and does not add reals, it’s in particular proper and
$\omega ^\omega $
-bounding. In the latter case there will be no Souslin trees in the final model.
Finally, let us note one more application in this spirit, this one due to Jensen [Reference Jensen11, Section 4].
Theorem 4.5 (Jensen).
Assume that
$\kappa $
is supercompact. Then there is a
$\kappa $
-length iteration
$\mathbb P_\kappa $
of subproper forcing notions so that if
$G\subseteq \mathbb P_\kappa $
is generic over
$\mathrm {V}$
then in
$\mathrm {V}[G] \mathsf {SCFA} $
holds,
$\mathsf {CH} $
holds but all Aronszajn trees are special. In particular
$\diamondsuit $
fails. If
$\kappa $
is only a reflecting cardinal then the same conclusion holds true with
$\mathsf {SCFA} $
replaced by
$\mathsf {BSCFA} $
.
Proof. In [Reference Jensen9] Jensen introduces the class of “Dee-subcomplete and
$<\omega _1$
-subproper forcing notion” and proves that the associated forcing axiom
$\mathsf {DSCFA}$
is consistent relative to a supercompact. This class does not add reals, hence, like with
$\mathsf {SCFA} $
, the natural model of this axiom satisfies
$\mathsf {CH} $
as well. While we omit the definition of this class here, we note that Jensen shows that it contains all subcomplete forcing, plus a forcing notion for specializing Aronszajn trees. It follows that under
$\mathsf {DSCFA}$
both
$\mathsf {SCFA} $
and “all Aronszajn trees are special” hold (so
$\diamondsuit $
fails). Since this axiom is consistent with
$\mathsf {CH} $
, we’re done.
5 Conclusion and Open Questions
The possible structure of the continuum under
$\mathsf {SCFA} $
remains something of a mystery. In particular, the above methods show that when
$\mathsf {CH} $
fails,
$\mathsf {SCFA} $
does not say much about the reals or combinatorics on
$\omega _1$
, and the
$\mathsf {CH} $
setting may in some sense be more attractive for
$\mathsf {SCFA} $
. One question we had was whether
$\mathsf {SCFA} $
is consistent with
$\diamondsuit ^+$
(and hence with the existence of a Kurepa tree). It is easy to see that in the natural model of
$\mathsf {SCFA} $
, there are no Kurepa trees. In fact, in that model
$\mathsf {SCFA} ^+$
holds, and already
$\mathsf {MA}^+_{\omega _1}(\sigma \mathrm {-}closed)$
implies that there are no Kurepa trees. However, in recent work, Hirohsi Sakai obtained the very interesting result that
$\mathsf {SCFA} $
is consistent with
$\diamondsuit ^+$
, thus answering this question.
We can ask similar questions about
$\omega _2$
, and at that level, much more remains open. For instance, we do not even know whether the continuum can be larger than
$\aleph _2$
under
$\mathsf {SCFA} $
.Footnote
3
Question 5.1. Is
$2^{\aleph _0}> \aleph _2$
consistent with
$\mathsf {SCFA} $
?
Another line of questioning concerns the utility and uniqueness of
$\infty $
-subproper and
$\infty $
-subcomplete forcing notions.
Question 5.2. Is every
$\infty $
-subcomplete (
$\infty $
-subproper) forcing notion subcomplete (subproper)? What about just up to forcing equivalence? Are the forcing axioms for these classes equivalent?
On another note, we can ask about the relationship between RCS and nice iterations. Note that proper, semiproper, subproper and subcomplete forcing notions are all iterable by both types of limits. It’s worth asking if this is simply a
$\mathsf {ZFC}$
-phenomenon.
Question 5.3. Suppose
$\Gamma $
is a definable class of forcing notions. If
$\Gamma $
is iterable with RCS, is it iterable by nice iterations? What about the converse?
Acknowledgments
We would like to express our sincerest gratitude to the referee for reading an earlier versions of this article very carefully and for bringing many errors to our attention. Their work helped improve this paper vastly.
Funding
The first author’s research for this paper was supported in part by PSC CUNY research grant 61567-00 49. The second author’s research was funded in whole or in part by the Austrian Science Fund (FWF) grant DOI: 10.55776/ESP548, 10.55776/Y1012, 10.55776/I4513.



