An Iteration Theorem for -preserving Forcings
Abstract
We prove an iteration theorem which guarantees for a wide class of nice iterations of -preserving forcings that is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a nice iteration of -preserving forcings which force at successor steps and preserves old stationary sets does not collapse .
1 Introduction
The method of iterated forcing is a powerful yet flexible tool in establishing independence results. Say, the goal is to produce a forcing extension of the universe with a specific property. Frequently, it is the case that it is much easier to find a forcing , which solves this problem for “a single instance” or ”all instances in ”, but may add new “unresolved instances” at the same time. One can then hope to iterate up to some closure point, usually a sufficiently large regular cardinal so that the whole iteration is -c.c., so that in end all instances have been dealt with and the full desired property holds. This can only work if the iteration in question preserves the progress of earlier stages up until the end. Theorems which guarantee such a preservation are often called iteration theorems. If the property in question is one about then at the very least it is required that is preserved or maybe the somewhat stronger property that stationary sets are preserved. We give some examples.
1.1 Iterations of c.c.c. Forcings
The earliest iteration theorem is due to Solovay-Tennenbaum.
Theorem 1.1 (Solovay-Tennenbaum, [ST71]).
Suppose is a finite support iteration of c.c.c. forcings. Then is c.c.c..
A Suslin tree is a tree of height with no uncountable chains and antichains. Forcing with a Suslin tree (with the reverse order) is a c.c.c. forcing and in the forcing extension is no longer Suslin. Not being a Suslin tree is a -property and so is upwards absolute to forcing extensions preserving . As c.c.c. forcings preserve , iterating forcing with Suslin trees produces models in which there are no Suslin tree and hence in which Suslin’s hypothesis holds.
Theorem 1.2 (Solovay-Tennenbaum, [ST71]).
There is a c.c.c. forcing so that .
1.2 Iterations of Proper Forcings
The class of forcings with the countable chain condition is rather small, so not suitable in all cases. Shelah discovered the beautiful notion of proper forcing which is large enough to include both c.c.c. and -closed forcing, but nonetheless all such forcings preserve .
Definition 1.3 (Shelah,[She98]).
A forcing is proper if for any large enough regular and any countable with , whenever then there is some with
Shelah proved a famous iteration theorem for proper forcings. Though, as finite support iterations of non-c.c.c. forcings usually collapse , the preferred support in this instance is countable support.
Theorem 1.4 (Shelah,[She98]).
Suppose is a countable support iteration of proper forcings. Then is proper.
An Aronszajn tree is a tree of height with all countable levels and no cofinal branch. For a tree of height and , let denote the tree with nodes of a level of with and the tree order inherited from . Two trees of height are club-isomorphic iff there is a club so that as partial orders. Given two Aronszajn trees , Abraham-Shelah discovered a proper forcing which forces and to be club-isomorphic. Note that the property “ are club-isomorphic” is and thus upwards-absolute to any -preserving forcing extension.
Theorem 1.5 (Abraham-Shelah, [AS85]).
There is a proper forcing so that
We remark that Suslin’s hypothesis is an immediate consequence of “any two Aronszajn trees are club-isomorphic”. There provably is an Aronszajn tree which is special, i.e. the union of countably many antichains. Such a tree cannot be club-isomorphic to a Suslin tree.
1.3 Iterations of Semiproper Forcings
Later, Shelah proved another iteration theorem for the even larger class of semiproper forcings.
Definition 1.6 (Shelah, [She98]).
A forcing is semiproper if for any large enough regular and any countable with , whenever then there is some with
From now on, we will denote by . So for example above we have .
Theorem 1.7 (Shelah).
Suppose is a -iteration of semiproper forcings. Then is semiproper.
Once again, the notion of support had to be changed. In the argument of Theorem 1.7 it is crucial that if and is -generic over , then the tail iteration is still a -iteration. This can fail for countable support iterations as, unlike proper forcings, semiproper forcings can turn regular cardinals into cardinals of countable cofinality. In fact, Theorem 1.7 fails if -support is replaced with countable support.
Suppose is an ideal on . An -antichain is a set so that for any . The ideal is saturated if for all -antichains we have .
Theorem 1.8 (Shelah, see [Sch11] for a proof).
Assume there is a Woodin cardinal. Then there is a semiproper forcing so that
If is a maximal -antichain then the sealing forcing is a natural stationary-set-preserving forcing which turns into a maximal -antichain of size and the statement “ is a maximal antichain of size ” turns out to be . Now, an instance of the sealing forcing is not semiproper in general, but Shelah shows that when iterating up to a Woodin cardinal and using a sealing forcing only when it is semiproper, it can be arranged that often enough sealing forcings are semiproper that in the end, is saturated.
1.4 Iterations of Stationary-Set-Preserving Forcing
So what are the limits of iteration theorems? We have
and none of the implications can be reversed. However, while there are always non-c.c.c. proper forcings and non-proper semiproper forcings, consistently the class of semiproper forcings can agree with the class of stationary set preserving forcing, so these two notions are quite close. Nonetheless, there is no analogue of Theorem 1.7 for stationary set preserving forcings. Consistently, a counterexample can be given along the lines of the discussion of Theorem 1.8. In the argument, the Woodin cardinal is used solely to verify that instances of sealing forcing are semiproper often enough, an inaccessible cardinal would suffice otherwise. But a Woodin cardinal is indeed required for the conclusion.
Theorem 1.9 (Steel, Jensen-Steel [JS13]).
Suppose that there is a normal saturated ideal on . Then there is an inner model with a Woodin cardinal.
So suppose we work in an model without an inner model with a Woodin cardinal, say , and there is an inaccessible cardinal. One could then try to iterate instances of the Sealing forcing along a suitable bookkeeping up to . In light of Theorem 1.9, this cannot result in a forcing extension in which is saturated. It follows that the iteration collapses at some point, yet instances of the sealing forcing are always stationary set preserving.
A much more serious example is due to Shelah.
Theorem 1.10 (Shelah [She98]).
There is a full support iteration
of stationary set preserving forcings so that collapses .
In fact, in the above example it does not matter at all which kind of limit is taken, though we want to mention that countable support, and full support iterations agree on length iterations. The first forcing in Shelah’s example is semiproper, but all subsequent forcings are not semiproper in the relevant extension. Semiproper forcing is the correct regularity property for stationary set preserving forcings in terms of iterations in the sense that
-
1.
all semiproper forcings are stationary set preserving,
-
2.
consistently, all stationary set preserving forcings are semiproper and
-
3.
semiproper forcings can be iterated.
We will define the class of respectful forcing which, in a slightly weaker sense, is a regularity property corresponding to the wider class of -preserving forcings.
1.5 Iterations of -Preserving Forcings
When iterating -preserving forcing which kill stationary sets there is another threat to preserving in the limit as illustrated in the following folklore example: For stationary, the club shooting forcing is the canonical forcing that shoots a club trough . Conditions are closed countable sets ordered by iff . If is generic for then is a club contained in , so is nonstationary in , but is not collapsed, that is . Now suppose be a partition of into stationary sets. Let be a length iteration of the forcings (it does not matter which limit we take at ). Then must collapse as in , is a countable union of nonstationary sets and hence must be nonstationary itself. Clearly, this is only possible if .
The issue here does not stem from a lack of regularity of the forcings we used. In fact, for a stationary set , the club shooting is -proper. The problem is much more that at each step of the iteration, we come back to to kill an “old” stationary set. If we avoid the two presented issues of
-
1.
using too many forcings lacking regularity properties and
-
2.
killing old stationary sets
then we can prove an iteration theorem for -preserving forcings. Without defining respectful forcings, a special case of our main result can be stated as follows.
Theorem 1.11.
Suppose is a nice iteration of -preserving forcings so that
-
if then and
-
if then is forced to preserve old stationary sets, i.e.
Then preserves . Moreover, we have for all
In fact we will prove something more general which allows, e.g. the preservation of a Suslin tree on the side.
Here, the Strong Reflection Principle is the reflection principle isolated by Todorčević.
Definition 1.12 (Todorčević, [Tod87]).
-
For an uncountable cardinal and we define
-
The Strong Reflection Principle () holds if: Whenever is regular, and then contains a continuous increasing -chain of countable elementary substructures of containing , i.e. there is so that for all
-
is countable,
-
,
-
,
-
and
-
if then .
-
We note that can always be forced assuming large cardinals.
Theorem 1.13 (Shelah).
Suppose there is a supercompact cardinal. Then there is a semiproper forcing so that .
As a consequence of this, assuming large cardinals, Theorem 1.11 can be understood as a strategic iteration theorem. Consider the following two player game of length .
Player | … | … | ||||||
Player | … | … |
Player plays at all even stages, including limit steps. Player and cooperate in this way to produce an -iteration of forcings which do not kill old stationary sets. Player wins iff preserves .
Corollary 1.14.
Suppose there is a proper class of supercompact cardinals. Then for any , Player has a winning strategy for the game .
Acknowledgements
The author thanks his PhD advisor Ralf Schindler for many fruitful discussions as well as his guidance and support during the completion of this project.
Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research
Foundation) under Germany’s Excellence Strategy EXC 2044 390685587, Mathematics Münster:
Dynamics - Geometry - Structure.
2 Notation
First, we fix some notation. We will extensively deal with countable elementary substructures for large regular . We will make frequent use of the following notation:
Definition 2.1.
Suppose is any extensional set.
-
denotes the transitive isomorph of .
-
denotes the inverse collapse.
-
.
In almost all cases, we will apply this definition to a countable elementary substructure for some uncountable cardinal . In some cases, the we care about lives in a generic extension of , even though it is a substructure of . In that case, will always mean .
We will also sometimes make use of the following convention in order to “unclutter” arguments.
Convention 2.2.
If is an elementary substructure and some object has been defined before and then we denote by .
We will make use of this notation only if it is unambiguous.
Definition 2.3.
If are sets then holds just in case
-
and
-
.
We use the following notions of clubs and stationarity on :
Definition 2.4.
Suppose is an uncountable set.
-
is the set of countable subsets of .
-
is a club in if
-
for any there is a with and
-
if is a -increasing sequence of sets in then .
-
-
is stationary in if for any club in .
Next, we explain our notation for forcing iterations.
Definition 2.5.
Suppose is an iteration and . We consider elements of as functions of domain (or length) .
-
If then .
-
If is -generic then denotes the restriction of to , i.e.
Moreover, is the canonical -name for .
-
If is -generic then denotes (by slight abuse of notation) the remainder of the iteration, that is
denotes a name for in .
-
If is -generic and then denotes the projection of onto .
There will be a number of instances were we need a structure to satsify a sufficiently large fragment of . For completeness, we make this precise.
Definition 2.6.
Sufficiently much of is the fragment . Here, is without the powerset axiom and with the collection scheme instead of the replacement scheme.
3 and
We will introduce the combinatorial principle which will parameterize the main iteration theorem. These are generalizations of the principles and isolated by Woodin [Woo10] in his study of [Woo10, Section 6.2]. Most results in this Section are essentially due to Woodin and proven in [Woo10, Section 6.2].
Definition 3.1.
Suppose is a forcing.
-
We say that guesses -filters if is a function
and for all , is a -filter333We consider the empty set to be a filter..
-
Suppose is regular and is an elementary substructure. We say is 444We use the adjective “slim” for the following reason: An cannot be too fat compared to its height below , i.e. . If and is then is as well, but the converse can fail. if
-
is countable,
-
and
-
is -generic over .
-
Definition 3.2.
Let be a forcing. states that there is a function so that
-
guesses -filters and
-
for any and regular
is stationary in .
is the strengthening of where is replaced by:
-
For any regular
contains a club of . Moreover, for any
is stationary.
We say that witnesses , respectively.
Remark 3.3.
Observe that if witnesses and is separative then can be “read off” from : We have and for , iff whenever then as well. Thus, it is usually not necessary to mention .
We introduce some convenient shorthand notation.
Definition 3.4.
If is a forcing, guesses -filters and then
If is clear from context we will sometimes omit the superscript .
Note that if witnesses , then is stationary for all . This is made explicit for . This is exactly the technical strengthening over Woodin’s definition of . Lemma 3.11 shows that this strengthening is natural. Moreover, this implies
whenever are forcings and is the disjoint union of and coded into a subset of . This becomes relevant in Subsection LABEL:splitwitnessessubsection. Nonetheless, the basic theory of these principles is not changed by a lot.
Definition 3.5.
If witnesses and is a forcing, we say that preserves if whenever is -generic then witnesses in .
We remark that if witnesses then “ preserves ” still only means that witnesses in .
Next, we define a variant of stationary sets related to a witness of . Suppose is regular. Then is stationary iff for any club , there is some with . -stationarity results from restricting to -slim only.
Definition 3.6.
Suppose guesses -filters.
-
A subset is -stationary iff whenever is regular and is club then there is some with .
-
A forcing preserves -stationary sets iff any -stationary set is still -stationary in .
We make use of -stationarity only when witnesses . However, with the above definition it makes sense to talk about -stationarity in a forcing extension before we know that has been preserved. Note that all -stationary sets are stationary, but the converse might fail, see Proposition LABEL:noplusprop. We will later see that -stationary sets are the correct replacement of stationary set in our context. Most prominently this notion will be used in the definition of the -variant we introduce in Subsection LABEL:fmppandrelatedforcingaxiomssection. It will be useful to have an equivalent formulation of -stationarity at hand.
Proposition 3.7.
Suppose guesses -filters. The following are equivalent for any set :
-
is -stationary.
-
Whenever is a sequence of dense subsets of , the set
is stationary.
Proposition 3.8.
Suppose guesses -filters. The following are equivalent:
-
witnesses .
-
is -stationary for all .
-
For any and sequence of dense subsets of ,
is stationary.
We mention a handy corollary.
Corollary 3.9.
Suppose witnesses . Any forcing preserving -stationary sets preserves .
Proposition 3.10.
Suppose guesses -filters. The following are equivalent:
-
witnesses .
-
For any , is stationary and all stationary sets are -stationary.
-
If is dense in then
contains a club and for all , is stationary.
-
All countable with and regular are and moreover for all , is stationary.
We will now give a natural equivalent formulation of .
Witnesses of are simply codes for regular embeddings555Regular embeddings, also known as complete embeddings, are embeddings between partial orders which preserve maximal antichains. of into .
Lemma 3.11.
The following are equivalent:
-
.
-
There is a regular embedding .
The argument above suggests the following definition.
Definition 3.12.
Suppose witnesses . We define
by and call the embedding associated to .
We will now show that is consistent for any forcing , even simultaneously so for all such . We will deal with the consistency of in the next section.
Proposition 3.13.
Assume . Then holds for any poset .
Corollary 3.14.
Suppose is a forcing. Then holds in .
In a number of arguments, we will deal with that become thicker over time, i.e. at a later stage there will be some .
Definition 3.15.
In the above case of , we denote the canonical elementary embedding from to by
is given by .
Usually, both and will be . It is then possible to lift .
Proposition 3.16.
Suppose guesses -filters and are both with . Then the lift of to
exists.
Proof.
As , the critical point of is (if it exists). As is a forcing of size and is generic over both and , the lift exists. ∎
We consider the above proposition simultaneously as a definition: From now on will refer to this lift if it exists.
Definition 3.17.
Suppose witnesses . is the ideal of -nonstationary sets, that is
Lemma 3.18.
Suppose witnesses . is a normal uniform ideal.
3.1 Miyamoto’s theory of nice iterations
For all our intents and purposes, it does not matter in applications how the limit our iterations look like as long as we can prove a preservation theorem about it.
We give a brief introduction to Miyamoto’s theory of nice iterations. These iterations are an alternative to -itertaions when dealing with the problem described above. In the proof of the iteration theorem for (-)proper forcings, one constructs a generic condition by induction as the limit of a sequence . In case of (-)semiproper forcings, the length of the iteration may have uncountable cofinality in but become -cofinal along the way. In this case, a sequence with the desired properties cannot be in . The key insight to avoid this issue is that one should give up linearity of this sequence and instead build a tree of conditions in the argument. Nice supports follow the philosophy of form follows function, i.e. its definitions takes the shape of the kind of arguments it is intended to be involved in. The conditions allowed in a nice limit are represented by essentially the kind of trees that this inductive nonlinear constructions we hinted at above produces.
Miyamoto works with a general notion of iteration. For our purposes, we will simply define nice iterations by induction on the length. Successor steps are defined as usual, that is if is a nice iteration of length and is a -name for a forcing then is a nice iteration of length where .
Definition 3.19 (Miyamoto, [Miy02]).
Let be a potential nice iteration, that is
-
is a nice iteration of length for all ,
-
for all and
-
for all .
A nested antichain in is of the form
so that for all the following hold666Usually, we identify the nested antichain with , its first component and write instead of if are clear from context.:
-
.
-
for some .
-
and .
-
For and , and .
-
For and distinct , .
-
For , is a maximal antichain below in .
-
.
Abusing notation, we will usually identify with
If then we also write . If then is a mixture of up to iff for all forces
-
if and ,
-
if there are , with , and ,
-
if there is a sequence with , and for all .
If is a limit, and is a sequence of length (may or may not be in ), is -nice if for all , is a mixture of up to .
We refer to [Miy02] for basic results on nested antichains and mixtures. We go on and define nice limits.
Definition 3.20 (Miyamoto, [Miy02]).
Suppose is a potential nice iteration of limit length . Let denote the inverse limit along . The nice limit of is defined as
inherits the order from .
Finally, if is a potential nice iteration then
is a nice iteration of length where .
The fundamental property of nice iterations is:
Fact 3.21 (Miyamoto,[Miy02]).
Suppose is a nice iteration and is a nested antichain in . Then there is a mixture of .
Definition 3.22 (Miyamoto,[Miy02]).
Let be a nice iteration. If are nested antichains in then iff for any and there is with
Fact 3.23 (Miyamoto, [Miy02]).
Let be a nice iteration of limit length . Suppose that
-
is a nested antichain in ,
-
is a mixture of and ,
-
,
-
and
-
is cofinal.
Then there is a nested antichain in with
-
is a mixture of ,
-
If then and and
-
.
The following describes the tool we use to construct conditions.
Definition 3.24 (Miyamoto, [Miy02]).
Let be a nice iteration of limit length . A fusion structure in is
where
-
is a nested antichain in
and for all and
-
is a nested antichain in ,
-
is a mixture of ,
-
and if then and
-
for any , , thus .
If is a mixture of then is called a fusion of the fusion structure.
Fact 3.25 (Miyamoto, [Miy02]).
Let be a nice iteration of limit length . If is a fusion of a fusion structure
and is -generic with then the following holds in : There is a sequence so that for all
-
,
-
,
-
and
-
.
We mention one more convenient fact:
Fact 3.26 (Miyamoto, [Miy03]).
Suppose is an inaccessible cardinal, is a nice iteration so that
-
for all and
-
preserves .
Then is -c.c..
Miyamoto proves this for so called simple iterations of semiproper forcings. The proof works just as well for nice iterations of semiproper forcings and finally the proof can be made to work with assuming only preserves instead of being a semiproper iteration.
4 The Iteration Theorem
The full main theorem we are going to prove is the following.
Theorem 4.1.
Suppose witnesses and is a nice iteration of -preserving forcings. Suppose that
-
for all and
-
.
Then preserves .
Note that if is the trivial forcing and we take to be the witness of with for all , then we recover the special case mentioned in the introduction.
So what is the basic idea? For the moment, let us assume that is the trivial witness of above for simplicity. As always, we want to imitate the argument of the mother of all iteration theorems, the iteration theorem for proper forcings. Suppose we have a full support iteration
and for the moment assume only that
We try to motivate some additional reasonable constraints imply to be -preserving. For the moment, we try to consider Shelah’s argument as a game: In the beginning there some countable as well as . The argument proceeds as follows: In round , we have already constructed a -semigeneric condition and have
Next, our adversary hits us with a dense subset in and we must find and some -semigeneric with and777Here, we consider also as a -name.
Our job is to survive this game for -many steps. If we have a winning strategy then we can find a -semigeneric condition, so in particular preserves .
Destroying stationarity makes it significantly more difficult to survive the above game: Suppose for example that
for some with . Then there is no hope of finding a -semigeneric condition with . Hence, we must already be careful with what we start the game. This leads us to the following definitions.
Definition 4.2.
Suppose is sufficiently large and regular, is countable. If is an ideal on , we say that respects if for all we have .
Note that all countable respect and countable with respects if and only if is .
Definition 4.3.
Suppose is a forcing and is a name for an ideal on . For in , we denote the partial evaluation of by by
Back to the discussion, we need to start with an so that respects where is a name for the nonstationary ideal. This gives us a shot at getting past the first round. Luckily, there are enough of these .
Definition 4.4.
Let be an uncountable set with and a normal uniform ideal on . Then is projective -positive if for any the set
is stationary in .
Proposition 4.5.
Suppose is sufficiently large and regular. Let be a normal uniform ideal on . Then
is projective -positive.
Proof.
Let be a club in and assume that all elements of are elementary substructures of and contain as an element. Let
be a continuous increasing chain of elements in . Let and let
be an enumeration of . Let be the set of so that
-
and
-
is an enumeration of
and note that is club. Let . As is normal, . Then is a complement of a set in and for any we have
for all . Hence . ∎
Of course, the problem continues. What if we have found a suitable and now we work in with . At the very least, we need that respects , where is now a -name for the nonstationary ideal. Ensuring this is a matter of being able to pick the right to begin with. This motivates the following class of forcings.
Definition 4.6.
We say that a forcing is respectful if preserves and the following is true: Whenever
-
•
is sufficiently large and regular,
-
•
is countable with ,
-
•
is a -name for a normal uniform ideal and
-
•
then exactly one of the following holds:
-
Either there is some -semigeneric so that
or
-
does not respect .
Roughly, this condition states that we can find a -generic filter with so that respects as long as there is no obvious obstruction to it.
Remark 4.7.
If is respectful and preserves stationary sets then is semiproper. However, the converse is not true in general. Similarly, a respectful -stationary set preserving forcing is -semiproper, which follows from plugging in a name for as in the definition of respectfulness.
We require888This excludes the first counterexample due to Shelah, but not yet all the counterexamples of the second kind. now that
for all . We then aim to make sure (assuming is already defined) to find in round so that in addition to the prior constraints,
where is a name for the ideal of sets forced to be nonstationary by . Consider as a -name for a -name. By respectfulness, this reduces to avoiding an instance of the “bad case” , namely we should make sure that whenever is -generic with then
where . he next key insight is that this reduces to
which we have (almost)999We made sure of this if is replaced by in the definition of , we ignore this small issue for now. already justified inductively, assuming only kills new stationary sets: Our final requirement101010It is readily seen that this eliminates the counterexamples of the second kind. is that
for all . The point is that trivially only contains sets in , so all such sets will be preserved by . The sets that are killed are then already killed in the extension by .
Modulo some details we have shown the following.
Theorem 4.8.
Suppose is a full support iteration so that
-
and
-
for all . Then does not collapse .
Two issues arise when generalizing this to longer iterations. The first issue is the old problem that new relevant indices may appear along the iteration in the argument, which we deal with by using nice supports. The second problem is that it seemingly no longer suffices that each iterand individually is respectful. For longer iterations, say of length , the argument then requires that
for sufficiently many . This is problematic as we will not prove an iteration theorem of any kind for respectful forcings111111Indeed it seems that no useful iteration theorem for respectful forcings is provable in , see Subsection LABEL:disrespectfulforcingsubsection.. This is where we take out the sledgehammer.
Definition 4.9.
holds if and only if all -preserving forcings are respectful.
Lemma 4.10.
implies .
Proof.
Let , , , be as Definition 4.6. It is easy to see that and cannot hold simultaneously. It is thus enough to prove that one of them holds. Let be regular, and and consider the set
By , there is a continuous increasing elementary chain
so that
-
and
-
for all , either or there is no with .
Let .
Claim 4.11.
.
Proof.
Let be generic with and let . Assume toward a contradiction that is -positive. Note that is a continuous increasing sequence of elementary substructure of . Hence there is a club of so that for
and thus there is a -semigeneric condition , . Hence by definition of , for any , we may find some so that . By normality of , there is some -positive and some so that for all . But then for , we have
so that . But , contradiction. ∎
We will get around this second issue by forcing often along the iteration. Remember that what we really care about is preserving a witness of along an iteration of -preserving forcings, so fix such an now. It will be quite convenient to introduce some short hand notation.
Definition 4.12.
Suppose is a forcing and . Then we let denote where is a -name for . That is
Definition 4.13.
Suppose witnesses . An -ideal is an ideal on so that
-
whenever and is a sequence of dense subsets of , then
-
and for all .
Recall that is clearly an -ideal and it is normal and uniform by Lemma 3.18.
Proposition 4.14.
Suppose is a forcing that preserves and . Then is a normal uniform -ideal.
We leave the proof to the reader. The next Lemma gives us a criterion that guarantees the relevant witness of to be preserved. We first introduce the notion of a -semigeneric condition.
Definition 4.15.
Suppose witnesses , is a forcing, is sufficiently large and is a elementary substructure of with . A condition is called -semigeneric if is -semigeneric and
Lemma 4.16.
Suppose witnesses and is a forcing with the following property: For any sufficiently large regular and there is a normal uniform -ideal so that
is projective -positive. Then preserves .
Proof.
Assume , is sufficiently large and regular. Let ,
be a sequence of -names for dense subsets of and a -name for a club in . We will find so that
By our assumption, there is some normal uniform -ideal so that
is projective -positive. It follows that we can find some countable so that
-
as well as
-
and some that is -semigeneric. If is then any -generic with , we have
and hence as well as
∎
We also need to resolve a small issue that we glossed over in the sketch of a proof of Theorem 4.8.
Lemma 4.17.
Suppose witnesses . Further assume that
-
•
is a respectful, -preserving forcing and ,
-
•
is sufficiently large and regular,
-
•
is countable, respects and and
-
•
.
Then there are with
-
is countable,
-
,
-
respects , in particular is and
-
.
Proof.
We may assume that is an elementary substructure of
where is a wellorder of . As is respectful and respects , there is a -semigeneric condition so that
i.e. is -semigeneric. Let be -generic with . Then is . Let , note that exists by Proposition 3.16. Now there is thus some , with
Finally, note that and have the desired properties. ∎
Proof of Theorem 4.1.
Let be an iteration of -preserving forcings which preserve old -stationary sets and forces at successor steps. We may assume inductively that preserves for all . The successor step is trivial, so we may restrict to . Note that we may further assume that holds in , otherwise we could work in . Let and let . is a normal uniform -ideal by Proposition 4.14. Now let be sufficiently large and regular, countable with
-
and
-
respects .
By Proposition 4.5 and Lemma 4.16, it suffices to find that is -semigeneric. Note that is as is a -ideal. Let
be a surjection with whenever .
Let denote . We will construct a fusion structure
in as well as names
so that for any and
-
, , , ,
-
is a nested antichain that is a mixture of with ,
-
,
-
is forced by to be an enumeration of all dense subsets of in
-
,
-
is not a limit ordinal,
-
,
-
and
-
.
Moreover, for any
-
”,
-
and
-
if and then
Here, denotes121212There is some slight abuse of notation here in an effort to improve readability.
We define all objects by induction on .
are given by - and . Suppose we have already defined
and we will further construct
Fix . Let be the set of all so that
-
and ,
-
and ,
and there are a nested antichain in , and names , with
-
,
-
is a mixture of ,
-
if and then
-
is not a limit ordinal,
-
,
-
,
-
,
-
,
-
and
-
if then and .
Claim 4.18.
is dense in .
Proof.
Let and let be -generic with . By , . Work in . Let and . Let
as well as , . Find with . As is a mixture of , we have
Let . Note that , as
Subclaim 4.19.
There are , with
-
,
-
,
-
,
-
and
-
respects .
Proof.
Let
and be the projection of onto . Observe that
Applying Lemma 4.17 with (making use of the notation there)
-
•
,
-
•
,
-
•
and
-
•
,
we find some countable and some with
-
,
-
,
-
and
-
respects .
By definition of , there is with
-
,
-
and
-
.
have the desired properties.
∎
We can now apply Fact 3.23 in and get a nested antichain with
-
is a mixture of ,
-
if then , and is not a limit ordinal and
-
.
Let be a name for and a name for .
Subclaim 4.20.
In , we have
Proof.
The first equality is simply by definition of . The second equality follows as we preserve old -stationary sets along the iteration and since preserves by our inductive hypothesis. ∎
It follows that
As is not a limit ordinal, holds in , so that is respectful by Lemma 4.10. Thus there is , so that
Since , we may assume further that . witness . ∎
To define , fix a maximal antichain , and for any choose with . We set . For any , let witness . We then let
-
•
,
-
•
be a name for and
-
•
be a sequence of names that are forced by to enumerate all dense subsets of in .
This finishes the construction.
By Fact 3.23, there is a mixture of . Let be -generic with . By Fact 3.25, in there is a sequence so that for all
-
,
-
and
-
.
For , let . For we let
and also
Further, for let
We remark that
follows inductively from and for so that . We aim to prove that
In fact, we will show
-
,
-
and
-
,
which implies the above.
Claim 4.21.
.
Proof.
As is by for , and follow at once. It remains to show .
As is and by Claim 4.21, we have that
for some . Let be dense in . Then for some , for
As , we have , which is what we had to show. ∎
5 -Proper and -Semiproper Forcings
Suppose witnesses . We already used the term -semigeneric which suggests there should be a notion of -semiproperness. Indeed there is and it behaves roughly like semiproperness. In fact, there are several other classes associated to which mirror well-known forcing classes.
Definition 5.1.
A forcing is -complete if for any sufficiently large regular , for any with and any generic over , there is a some with
Definition 5.2.
A forcing is -proper if for any sufficiently large regular , any with and any , there is a -generic condition , that is a condition with
Definition 5.3.
A forcing is -semiproper if for any sufficiently large regular , any with and any , there is a -semigeneric condition .
The following graphic collects all provable relations between the relevant forcing classes.
We also get the expected iteration theorems.
Theorem 5.4.
Any countable support iteration of -complete (resp. -proper) forcings is -complete (resp. -proper).
Theorem 5.5.
Any nice iteration of -semiproper forcings is -semiproper.
The proof is much easier than that of Theorem 4.1, so we omit it.
References
- [AS85] U. Abraham and S. Shelah. Isomorphism types of aronszajn trees. Israel Journal of Mathematics, 50:75–113, 1985.
- [JS13] RONALD JENSEN and JOHN STEEL. K without the measurable. The Journal of Symbolic Logic, 78(3):708–734, 2013.
- [Miy02] Tadatoshi Miyamoto. On iterating semiproper preorders. J. Symbolic Logic, 67(4):1431–1468, 2002.
- [Miy03] Tadatoshi Miyamoto. A limit stage construction for iterating semiproper preorders. In Proceedings of the 7th and 8th Asian Logic Conferences, pages 303–327. Singapore Univ. Press, Singapore, 2003.
- [Sch11] Ralf Schindler. On being saturated, September 2011. Available online at https://ivv5hpp.uni-muenster.de/u/rds/sat_ideal_even_better_version.pdf.
- [She98] Saharon Shelah. Proper and improper forcing. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, second edition, 1998.
- [ST71] R. M. Solovay and S. Tennenbaum. Iterated cohen extensions and souslin’s problem. Annals of Mathematics, 94(2):201–245, 1971.
- [Tod87] S. Todorčević. Strong Reflections, 1987. Handwritten nores.
- [Woo10] W. Hugh Woodin. The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal, volume 1 of De Gruyter Series in Logic and its Applications. Walter de Gruyter GmbH & Co. KG, Berlin, revised edition, 2010.