Forcing is -dense” From Large Cardinals
Abstract
We answer a question of Woodin by showing that assuming an inaccessible cardinal which is a limit of -supercompact cardinals exists, there is a stationary set preserving forcing so that . We also introduce a new forcing axiom , show it is consistent assuming a supercompact limit of supercompact cardinals and prove that it implies . Consequently, implies “ is -dense”.
1 Introduction
1.1 History of “ is -dense”
In 1930, Stanislaw Ulam published an influential paper [Ula30] dealing with a question of Stefan Banach generalizing the measure problem of Lebesgue. He proved the following theorem:
Theorem 1 (Ulam).
Suppose is an uncountable cardinal and there is a -additive real-valued measure on which
-
measures all subsets of and
-
vanishes on points.
Then there is a weakly inaccessible cardinal .
Ulam noticed that he could strengthen his conclusion if he replaces real-valued by 0-1-valued. In more modern terminology, his second result reads:
Theorem 2 (Ulam).
Suppose is an uncountable cardinal and there is a nonprincipal -complete ultrafilter on . Then there is a (strongly) inaccessible cardinal .
These theorems gave birth to what are now known as real-valued measurable cardinals and measurable cardinals respectively. In the interest of having all subsets of some cardinal be measured in some sense, instead of increasing the size of , it is also possible to increase the number of allowed filters that measure. Henceforth Ulam considered the following question:
Question 3.
Suppose is an uncountable cardinal below the least inaccessible. What is the smallest possible size of a family of -closed nonprincipal filters on so that every subset of is measured by some filter in ?
Let us call the cardinal in question the Ulam number of , . Ulam’s second theorem above can be rephrased as “”. Indeed, Ulam proved in unpublished work that . At some point, Ulam proposed this question to Paul Erdős, who, together with Leonidas Alaoglu, improved Ulam’s result to “” [Erd50]. The problem, this time in the special case , was apparently revitalized by appearing in the 1971 collection of unsolved problems in set theory popularized by Erdős and Hajnal [EH71]: Shortly after, Karel Prikry [Pri72] produced a model in which , and did the same again with a different method in [Pri76].
A critical step towards a model in which was taken by Alan D. Taylor: Building on earlier work of Baumgartner-Hajnal-Maté [BHM75], Taylor provided [Tay79] an impressive amount of statements equivalent to a natural strengthening of , here is a shortened list.
Theorem 4 (Taylor).
The following are equivalent:
-
There is a family of normal filters witnessing .
-
There is a -closed uniform -dense ideal on .
-
There is a normal uniform -dense ideal on .
The formulation is much better suited for set-theoretical arguments. We also mention that Taylor proved that all the above statements fail under .
Thus what remains of Ulam’s original question was reduced to: Is the existence of a normal uniform -dense ideal on consistent with ? This was answered positively by W. Hugh Woodin in three different ways. The first was by forcing over a model of +, already in the fall of 1978. (unpublished). At that time, this theory was not yet known to be consistent relative to large cardinals. Naturally, somewhat later he did so from large cardinals:
Theorem 5 (Woodin, unpublished333A proof can be found in Foreman’s handbook article [For10].).
Assume there is an almost-huge cardinal . Then there is a forcing extension in which there is a normal uniform -dense ideal on .
This finally resolved the question relative to large cardinals. But can the canonical normal uniform ideal, namely , have this property? It is known that behaves a little different in this context.
Theorem 6 (Shelah, [She86]).
If is -dense then . In particular fails.
This is not true for other normal uniform ideals on , for example holds in the model Woodin constructs from an almost huge cardinal. One can also ask about the exact consistency strength of the existence of such a normal uniform -dense ideal on . Both these questions were answered in subsequent work by Woodin, building on his -technique.
Theorem 7 (Woodin, [Woo10, Corollary 6.150]).
The following theories are equiconsistent:
The direction makes use of Woodin’s core model induction technique, the argument is unpublished. We refer the interested reader to [RS14] where part of this is proven. Woodin’s method for is by forcing over , assuming there, with the . This approach has one downside: It is a forcing construction over a canonical determinacy model. can be replaced by larger determinacy models, but relies on a good understanding of the model in question. In practice, this is akin to an anti large cardinal assumption and leaves open questions along the lines of: Is “ is -dense” consistent together with all natural large cardinals, e.g. supercompact cardinals? Is it consistent with powerful combinatorial principles, for example ?
Woodin’s original motivation for these results was in fact the question of generic large cardinal properties of : For example is not measurable by Ulam’s theorem, but there can be a generic extension of with an elementary embedding with transitive and critical point . This leads to precipitous ideals on .
Definition 8.
A uniform ideal on is precipitous if, whenever is generic for then is wellfounded444 denotes the -ultrafilter induced by ..
The existence of an -dense ideal is a much stronger assumption than the existence of a precipitous ideal. There is a natural well-studied intermediate principle.
Definition 9.
A uniform ideal on is saturated if is -c.c..
Here is a short history of similar result for these principles:
Woodin’s results continue this line of research for -dense ideals. But the analog of the step from to for -dense ideals was missing. Accordingly, Woodin posed the following question:
Question 10 (Woodin, [Woo99, Chapter 11 Question 18 b)]).
Assuming the existence of some large cardinal: Must there exist some semiproper partial order such that
We will answer this positively in this thesis.
Theorem 11.
Assume there is an inaccessible cardinal which is the limit of cardinals which are -supercompact. Then there is a stationary set preserving forcing so that
If there is an additional supercompact cardinal below , we can find such that is semiproper.
On a different note, there has been significant interest recently into the possible -definability of (with parameters), in particular in the presence of forcing axioms. Note that is trivially -definable, but it is independent of whether is -definable. Hoffelner-Larson-Schindler-Wu [HLSW22] show:
-
If holds and there is a Woodin cardinal then is not -definable.
-
If holds then is not -definable.
-
Thus by Asperó-Schindler [AS21], if holds, is not -definable.
-
It is consistent relative to large cardinals that holds and is -definable.
There is also a forthcoming paper by Ralf Schindler and Xiuyuan Sun [SS22] showing that in , can be relaxed to .
If is -dense then is automatically -definable: If is a set of -many stationary sets witnessing the density, then is stationary iff
This was first observed by Friedman-Wu-Zdomskyy [FWZ15]. In this context, two interesting points arise from our results here: First, we isolate for the first time a forcing axiom which implies “ is -definable”. Second, it is well known that many of the structural consequences of follow already from , for example “ is saturated”, , , etc. In contrast, in the result of Schindler-Sun, cannot be replaced by : If appropriate large cardinals are consistent, then so is together with “ is -definable”.
Acknowledgements
I want to thank my supervisor Ralf Schindler for his continued support that led to the results presented here. Most importantly, for relentlessly asking me to force “ is -dense” from large cardinals from the beginning of my PhD on. It should be obvious to the reader that this work would not have been possible without Ralf’s great supervision.
Moreover, I am grateful to David Asperó for a number of very helpful remarks and suggestions.
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 satisfy 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 introduce the central combinatorial principle which is due to Woodin. The relevancy is motivated by the following observation: If is -dense, then there is a dense embedding
We aim to force a forcing axiom that implies this. As usual, the forcing achieving this is an iteration of some large cardinal length which preserves and iterates forcings of size with countable support-style supports. will thus be -c.c. and this means that some “representation”
of exists already in an intermediate extension. By “representation” we mean that in ,
for all 777For and an ideal on , denotes the equivalence class of induced by the equivalence relation .. With this in mind, one should isolate the relevant -properties which possesses in . Consequently, satisfies these properties in the intermediate extension. It is hopefully easier to first force an object with this -fragment and we should subsequently only force with partial orders that preserve this property. This is exactly what we will do. The relevant combinatorial properties are and and were already isolated by Woodin in his study of [Woo10, Section 6.2]. We remark that the definition we use here is slightly stronger than Woodin’s original principle in a technical way that turns out to be convenient for our purposes. Most results in this Section are essentially due to Woodin and proven in [Woo10, Section 6.2].
Definition 3.1.
-
We say that guesses -filters if is a function
and for all , is a -filter888We consider the empty set to be a filter..
-
Suppose is regular and is an elementary substructure. We say is 999We 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.
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.
We introduce some convenient shorthand notation.
Definition 3.3.
If witnesses 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 original definition of .
Definition 3.4.
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.5.
Suppose witnesses .
-
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 .
Note that all -stationary sets are stationary, but the converse might fail. -stationary sets are the correct replacement of stationary set in our context.
We mention a few basic facts about and which are all essentially due to Woodin [Woo10], although he did not use the notion of -stationary sets explicitly.
Proposition 3.6.
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.7.
Suppose guesses -filters. The following are equivalent:
-
witnesses .
-
is -stationary for all .
-
For any and sequence of dense subsets of ,
is stationary.
Proof.
The equivalence of and follows from the definitions. and are equivalent by the equivalent formulation of -stationarity provided by Proposition 3.6. ∎
We mention a handy corollary.
Corollary 3.8.
Suppose witnesses . Any forcing preserving -stationary sets preserves .
Proposition 3.9.
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 embeddings101010Regular embeddings, also known as complete embeddings, are embeddings between partial orders which preserve maximal antichains. of into .
Lemma 3.10.
The following are equivalent:
-
.
-
There is a regular embedding .
The argument above suggests the following definition.
Definition 3.11.
Suppose witnesses . We define
by and call the embedding associated to .
Definition 3.12.
Suppose witnesses . is the ideal of -nonstationary sets, that is
Lemma 3.13.
Suppose witnesses . is a normal uniform ideal.
To each witness of , one can associate a version of semiproperness.
Definition 3.14.
-
Let be a sufficiently large regular cardinal and with . A condition is -semigeneric if is -semigeneric and
-
is -semiproper if for any sufficiently large regular and any with as well as all there is that is -semigeneric.
An -semiproper forcing need not preserve stationary sets, however it will preserve -stationary sets as -stationary sets and hence will still witness in .
However, just as for semiproperness, -semiproper forcings can be iterated.
Theorem 3.15 (Lietz, [Lie23]).
Suppose witnesses . Any nice iteration of -semiproper forcings is -semiproper.
We refer to [Miy02] for the definition of nice iterations. For all intents and purposes, nice iterations can be replaced by RCS iterations here.
4 A Forcing Axiom That Implies “ Is -Dense”
We formulate a forcing axiom that implies . We go on and show that it can be forced from a supercompact limit of supercompact cardinals.
4.1 -Maximum
Definition 4.1.
-Maximum, denoted , holds if there is a witness of and holds where
We remark that the consistency of is a subtle matter, for example any “”-version of would be inconsistent. It is however relevant to our purposes.
Lemma 4.2.
If witnesses then is a dense embedding. In particular, is -dense.
Proof.
Suppose is so that
for all . Let be the canonical forcing that shoots a club through . That is iff is closed and bounded and iff is an initial segment of .
Claim 4.3.
preserves .
Proof.
Let , we have to show that is -stationary in . Let , a -name for a club and a sequence of -names for dense subsets of . We will find with
() |
Let be large and regular. Note that holds and hence witnesses . As is stationary, is -stationary and we can find some with
-
is ,
-
and
-
.
Thus holds. This implies that if is -generic then
and as contains a club in , this must already be true in . This means is nonstationary which is what we had to show. ∎
We will prove eventually that can be forced from large cardinals.
Theorem 4.4.
Suppose there is a supercompact limit of supercompact cardinals. Then holds in a forcing extension by stationary set preserving forcing.
4.2 -iterations
Our strategy to force , or “ is -dense” for that matter has to make use of an iteration theorem that allows us to iterate essentially arbitrary -preserving forcings for a witness of so that is preserved. We have proven in [Lie23] a more general version of the following theorem.
Theorem 4.5 (Lietz, [Lie23]).
Suppose witnesses and is a nice iteration of -preserving forcings. Suppose that
-
for all and
-
.
Then preserves .
The immediate problem is that puts an undesired additional requirement on the forcings we want to iterate. Luckily, there is a small trick to still get away with this: Note that an -preserving forcing must preserve the -stationarity of the set for . Suppose that at all successor steps, we arrange that any -stationary set from the previous extension contains some modulo a non-stationary set. Now at a limit step, suddenly every -preserving forcing will satisfy requirement . As does not ask anything of us at limit steps either, we are free to use any -preserving forcing we desire at limit steps.
Definition 4.6.
Suppose witnesses . We say that a forcing freezes along if for any -generic we have
-
witnesses in and
-
for any , we either have or there is with .
We hope to have motivated the following definition.
Definition 4.7.
Suppose witnesses . A -iteration (w.r.t. ) is a nice iteration which satisfies
-
,
-
and
-
if then
for all .
As an immediate consequence of Theorem 4.5, we get the following “iteration theorem”.
Theorem 4.8.
Suppose witnesses . All -iterations (w.r.t. ) preserve .
Provided we find enough forcings which allow us to continue a -iteration up to a supercompact cardinal, we are able to force . To be precise, we will prove the following two lemmas.
Lemma 4.9.
Suppose witnesses , there is a Woodin cardinal and is closed under . Then there is a -preserving forcing which freezes along .
Lemma 4.10.
Suppose witnesses and there is a supercompact cardinal. Then there is an -preserving forcing with .
We can show this right away.
Proof.
The same construction which forces via semiproper forcing from a supercompact cardinal can be used. A small change in the proof gives that any forcing for an instance of is not only semiproper, but also -semiproper. Now use Theorem 3.15 instead of Shelah’s iteration theorem for semiproper forcings and do a nice iteration instead of a RCS iteration. ∎
We will eventually prove Lemma 4.9 in the next section. The basic idea is to use a version of the Asperó-Schindler -forcing with replaced by . However, we will run into a number of problems we need to solve first.
5 Blueprints for Instances of “”
We modify the -forcing method of Asperó-Schindler in a way that allows us to prove a variety of instances of , though our main interest lies in Lemma 4.9.
Definition 5.1.
Let be a forcing. asserts that holds in and there is a filter with
-
is -generic over and
-
.
is . is the most prominent of a number of similar forcing notions defined and analyzed by Woodin in [Woo10]. A central notion to all of them is that of a generically iterable structure.
Definition 5.2.
Suppose the following holds:
-
is a countable transitive model of (sufficiently much of) where is allowed as a class parameter in the schemes.
-
is a normal uniform ideal on ”.
-
.
In this case, we call a potentially iterable structure. A generic iteration of is a sequence
with
-
•
,
-
•
for ,
-
•
is a generic ultrapower of w.r.t and
-
•
if then
for all . is a generically iterable structure if all (countable) generic iterations of produce wellfounded models. Note that this only depends on and that we do not require .
Remark 5.3.
A generic iteration can be read off from the final map , so we will frequently identify one with the other. We also reserve the right to call generic iterations simply iterations.
Definition 5.4.
-conditions are generically iterable structures with and . is ordered by iff there is a generic iteration
of length in so that
-
and
-
.
There are a number of ways this definition can be varied, leading to different partial orders. We will work with such variants in a general context.
5.1 and the -multiverse view
Definition 5.5.
A is a nonempty projective preorder with the following properties:
-
Conditions in are generically iterable structures for some fixed 111111Of course, not all structures of this form are necessarily conditions..
-
There is a first order formula in the language121212When dealing with s, we stick to the convention that capitalized symbols are unary predicates symbols which are lower case are constants. so that iff there is a generic iteration
in of length with
-
If witnesses and witnesses then witnesses .
-
Suppose is generically iterable, is a generic iteration of of countable length and . Then
-
has no minimal conditions.
We always consider as a class defined by a projective formula, rather then the set itself. So if we mention in, e.g. a forcing extension of , then we mean the evaluation of the projective formula in that model131313In practice this extension will be projectively absolute so it does not matter which projective formula we choose. Also all the variations we consider will have a -definition..
Remark 5.6.
Typically, dictates e.g. one or more of the following:
-
•
.
-
•
.
-
•
Some first order property is absolute between and .
We want to relate forcing axioms to star axioms of the form for s . To explain this relationship heuristically we present the -Multiverse View:
Suppose is a (with for convenience) and
-
•
for some large cardinal in some larger model and
-
•
there are a proper class of Woodin cardinals both in and .
We will take the point of view of . Note that our assumptions imply generic projective absoluteness (and more) in , in particular is a also in and for any generic extension of . Pick some . Let denote the closure of under generic extensions and grounds containing . Points may be considered as -conditions if
In this case we identify with this condition. In practice, this can only reasonably hold if so we make this an explicit condition. The -multiverse of (w.r.t. ) is
If we picked with sufficient care then should be nonempty. If is a generic extension of , both in , then it is a good extension if
Here, means . The existence of a proper class of Woodin cardinals in should guarantee that reversely ordered by good extensions is “as rich as” .
In this sense, iterated forcing along good extensions corresponds to building descending sequences in . In practice, s are -closed. From this point of view, -closure of becomes roughly equivalent to a forcing iteration theorem: If
is a chain of good extensions of points
then this constitutes a countable decreasing chain141414Note that the size of in does not matter here. in in . -closure of suggests that there should be a further point
below all , . Thus the “forcing iteration along ” preserves and enough structure to be able to be extended to a -condition below all without collapsing .
We should be able to find points satisfying by constructing “closure points” of sufficiently generic -decreasing sequences
in . To make that precise, we want:
() |
Here, is the reinterpretation of the universally Baire in . The degree of closure of under this procedure is measured by
which should be a filter if is “sufficiently closed”. can be defined in via
if has unique iterations.
Definition 5.7.
has unique iterations if whenever then there is a unique generic iteration of witnessing this.
Under reasonable assumptions, ( ‣ 5.1) implies that is generic over . Finally, an additional property151515Often, simply is enough. Woodin [Woo] (see also [Sch]) has shown that if holds, there is a filter generic over and fails then witnesses . like should imply .
Taking a step back, forcing a forcing axiom related to good extensions via iterated forcing looks like it should produce such sequences with ( ‣ 5.1) and saturated in , so should follow from such a forcing axiom.
On the other hand, looks like an endpoint of an iteration liberally incorporating forcings leading to good extensions: For , if is dense open in then is dense open in the full . can also be considered as a dense subset of . As , by ( ‣ 5.1), there will be some later with . Thus one might expect a forcing axiom to hold at . This suggest that should in fact be equivalent to a forcing axiom related to good extensions. The consistency of this forcing axiom should follow from the iteration theorem suggested by the -closure of .
If we look at the case and let be some subset of so that then stationary set preserving extensions are exactly the generic extensions intermediate to a good extension. The -Multiverse View is roughly correct in the sense that:
-
•
(Woodin) is -closed assuming .
-
•
(Shelah) Semiproper forcings can be iterated and the class of stationary set preserving forcings and semiproper forcings coincide under .
-
•
(Asperó-Schindler) If there is a proper class of Woodin cardinals then
The rest of this section distills this heuristic into rigorous mathematics that relates more s to forcing axioms. We will assume (two-step) generic absoluteness in this section, though this is not fully necessary. Note that in this case, if is a then we have
in any generic extension , where is to be understood as defined by a projective formula. Usually, s are .
We will from now on work with some fixed and assume to ease notation.
Definition 5.8.
We say that a structure is almost a -condition if
For , denotes the structure:
Suppose that for some fixed we have that is almost a -condition. We may define
Our goal is to show that witnesses under favorable circumstances. At the very least, it should be a filter.
Proposition 5.9.
Suppose meets all projective dense . Then is a filter.
Proof.
It is easy to see that if and then . So assume and we have to find some with . Consider
and note that is a projective dense subset of , so by assumption we can find some . Now in we have and thus is compatible with both and . By generic absoluteness, this is true in as well so that as . ∎
Even assuming that is a fully generic over , we still have to arrange .
Definition 5.10.
Suppose that
-
is a filter,
-
and
-
is a generic iteration of .
Then we say that is guided by if for all countable .
Lemma 5.11.
Suppose has unique iterations and is a filter meeting all projective dense . For any and any , there is a unique iteration
of of length guided by .
Proof.
First, we prove existence for all .
Claim 5.12.
There is with .
Proof.
Claim 5.13.
is guided by .
Proof.
Let . Then is an iteration of length in and , thus and . ∎
Next we prove uniqueness. By proceeding by induction on , it is in fact enough to verify the case . Suppose that is a generic ultrapower of with for . As is a filter and by , there is with as witnessed by some
for as well as as witnessed by
Let . We have that are countable in . As
is a true -statement, it is true in as well. Thus there is a generic ultrapower
in . Both witness and as has unique iterations, . It follows that .
Claim 5.14.
.
Proof.
Assume this fails, then
is another true -statement which accordingly must hold in . Thus there is a generic ultrapower map in different from . But then both and witness , which contradicts that has unique iterations. ∎
Finally, existence of a generic iteration of of length guided by follows from existence and uniqueness of generic iterations of guided by of any countable length. ∎
This suggests the following definition:
Definition 5.15.
Suppose is a with unique iterations and is a filter. For , the -iteration of is the unique generic iteration of of length that is guided by (if it exists).
Corollary 5.16.
Suppose that
-
holds in ,
-
has unique iterations,
-
is almost a -condition,
-
for all dense , and
-
.
Then holds and witnesses this.
Proof.
is a filter by Proposition 5.9 and thus -generic by assumption. To see that , notice that for any , knows of all countable generic iterations of . Hence, can piece together the -iteration of from the countable iterations of that are guided by . now follows immediately from . ∎
The biggest obstacle by far is to get into a situation where for all dense , . The main idea is:
Lemma 5.17.
Suppose that all of the following hold:
-
is dense.
-
is almost a -condition.
-
is a forcing and is -universally Baire.
-
In there is and an iteration with
-
is a set of formulas in the language so that
-
,
-
, where is computed in the language and
-
is closed under and .
-
-
.
Then .
If additionally
then .
Proof.
Observe that implies that preserves . The statement
is in and thus is true in
as witnessed by some and iteration . It follows that witnesses in so that .
Now assume , it is our duty to show
Let . As above,
reflects down to . The iteration witnessing this in is guided by by the same argument that showed above. ∎
5.2 Asperó-Schindler -forcing
We describe the results of Asperó-Schindler[AS21]. Their results carry over to any though they were originally proven in the case of . Suppose that
-
is saturated,
-
is so that is almost a -condition and
-
is a -universally Baire dense subset of whose reinterpretation is still dense in extensions by forcings of size , as witnessed by trees with .
Asperó-Schindler construct a partial order so that in the following picture
exists so that
-
are generic iterations of , respectively,
-
witnesses ,
-
and
-
the generic iteration is correct, i.e. .
If implies then . This gets transported upwards along and shows . Together with , this yields , i.e. preserves stationary sets. If holds in then
and it follows from Lemma 5.17 that (note that ). This is how Asperó-Schindler prove .
An important observation is the following: To invoke a forcing axiom in the case of or variants thereof, typically needs to preserve certain structure, like stationary sets in the example above. This preservation is proven in two steps:
-
Preservation between and . This is governed by the iteration having certain properties in , e.g. correctness.
-
Preservation between and . This is governed by the nature of , specifically the formula .
5.3 -iterations
We introduce the concept that is roughly the equivalent of -forcing in the world of generic iterations.
Definition 5.18.
Suppose is generically iterable. A generic iteration
of is a -iteration if for any
-
sequence of dense subsets of and
-
the set
is stationary. Here, is the generic ultrafilter applied to for .
If is generically iterable and holds then there is a -iteration of . But this is not generally the case. Paul Larson noted that if is generically iterable and
is a generic generic iteration of of length then this is a -iteration. By this we mean that this iteration has been constructed generically by forcing with countable approximations ordered by endextension.
Lemma 5.19.
Suppose
is a -iteration. If
then . In particular, witnesses .
Proof.
Let , we have to show that is -stationary. Let be a sequence of dense subsets of . As witnesses in , we have
and notice that is a complete embedding in as well. Thus is dense for . As is a -iteration,
is stationary. Thus if is club, we can find with and . It follows that
so that for all . ∎
5.4 -forcing
Theorem 5.20.
Suppose that
-
generic projective absoluteness holds for generic extensions by forcings of size ,
-
is a ,
-
is saturated and exists,
-
is almost a -condition and
-
is -universally Baire and dense in in any generic extension by a forcing of size , as witnessed by trees with .
Then there is a forcing so that in the following picture
exists so that
-
are generic iterations of , respectively,
-
witnesses ,
-
and
-
the generic iteration is a -iteration.
For the remainder of this section, will always denote .
So suppose - holds. We will assume for notational purposes. For the most part, we will follow the construction of in [AS21] but will put additional constraints on the certificates. The idea that guides us here is:
In order for to be a -iteration, the forcing will have to anticipate dense subsets of the forcing so that they have been “hit before”. This should be captured by the map . Formulating this correctly produces a strengthened version of the “genericity condition” put onto semantic certificates.
A reader who can compile the above paragraph without syntax error can probably safely skip most the definition of and go straight to 4.
We try to keep our notation here consistent with the notation in the paper [AS21]. For this reason, we will identify a condition with its first coordinate . Additionally, by even more abuse of notation:
Convention 5.21.
If is (almost) a condition in , then
-
•
denotes ,
-
•
denotes and
-
•
denotes .
We will additionally assume both and to hold. Otherwise, first force with and note that and still hold for forcing with , which is all we need. Moreover, observe that this preserves “ is saturated”.
We will denote by and pick a -sequence .
We may find of size so that
Here we use that is almost a -condition as well as . Note that in any outer model. Without loss of generality, we may assume that is a tree on .
Fix a bijection
For let
There is then a club with
-
and ,
-
and
-
for all . We now have
is stationary. |
We will also define as . The forcing will add some
together with a generic iteration
by Henkin-style finite approximations. By abuse of notation, we let . For readability we will also write
will be the last element of an increasing sequence of forcings which we define inductively. We will have:
-
,
-
conditions in will be finite sets of formulae in a first order language and
-
the order on is reverse inclusion.
Suppose now that and is defined for all .
We will make use of the same convention as Asperó-Schindler.
Convention 5.22.
is a real code for if there is a surjection so that is the monotone enumeration of Gödel numbers of all expressions of the form
where is a first order formula of the language associated to (see below) and
holds.
We will have conditions in be certified in a concrete sense by objects which exist in generic extensions of that satisfies projective absoluteness w.r.t. . They are of the form
where
-
, ,
-
is a real code for and is a branch through ,
-
is a generic iteration of witnessing ,
-
is a generic iteration of ,
-
and
-
and for all
-
, and if is in then and ,
-
and .
-
If has these properties, we call a potential certificate.
Next up, we will define a certain first order language . will have the following distinguished constants
-
•
for any ,
-
•
for any ,
-
•
for ,
-
•
for ,
-
•
,
-
•
for ,
-
•
for ,
-
•
, and
-
•
for .
The constants will eventually produce “Henkin-style” term models for the . Formulas in the language are of the form
where
-
•
,
-
•
,
-
•
,
-
•
,
-
•
for
and is a first order -formula. Moreover we allow as formulas
-
•
for and ,
-
•
for ,
-
•
for and ,
-
•
for and ,
-
•
for and and
-
•
for and .
is the set of -formulae so that if appears in for some then . We assume formulae in to be coded in a reasonably way (ultimately uniform in ) so that . We will not make this precise.
A potential certificate
is (-)precertified by if there are surjections for so that
-
(.1)
iff
-
(a)
,
-
(b)
,
-
(c)
,
-
(d)
,
-
(e)
for
and
where ,
-
(a)
-
(.2)
iff , and ,
-
(.3)
for all ,
-
(.4)
iff and ,
-
(.5)
iff for some , and for all , ,
-
(.6)
iff and and
-
(.7)
iff and .
Note that can be “read off” from in a unique way via a Henkin-style construction. For and , let
and denote the equivalence class of modulo by . We will usually drop the superscript if it is clear from context. Also let
Then . We call the latter model the term model producing . See Lemma 3.7 in [AS21] for more details. For we say is represented by if gets mapped to by the unique isomorphism of to the term model. The term model for is then the direct limit along the term models producing the , and elements can then be represented by pairs , in the natural way.
To define certificates, we make use of the following concept:
Definition 5.23.
For ,
is a -code for a dense subset of given that
-
if then
-
for any with
there is with
-
, and
-
for some ,
-
-
and if as well as then .
Suppose that
is precertified by as witnessed by . For we define the evaluation of by as
A potential certificate is (-)certified by a collection if is -)precertified by and additionally
-
4.
whenever and is a -code for a dense subset of definable over
from parameters in , then there is with .
Definition 5.24.
In the case that 4 is satisfied, we call a semantic certificate, and a syntactic certificate, relative to
Remark 5.25.
The genericity condition in [AS21] that is replaced here with 4 (adapted to our context) is:
-
If and is dense and definable over
from parameters in then
Condition 4 is stronger than : From any such ,
is a -code for a dense subset of definable over the same structure from the same parameters. If , it follows that
Suppose is a certificate that certifies
and is a -code for a dense subset of definable over
is supposed to represent a dense subset of (w.r.t. inclusion ) in . may not be “generic over ”, so it may not be the case that is dense in . Nonetheless, already implies that
is dense. may not be in , so it is not guaranteed that is hit by the ultrapower just from genericity over alone, however 4 makes sure that this happens (observe that ). So in essence, the idea of 4 is that any dense subset of that exists in the final has been “hit” before at some point along the iteration of to .
Remark 5.26.
Note that for any syntactic certificate, there is a unique semantic certificate it corresponds to. Given a semantic certificate, its corresponding syntactic certificate is unique modulo the choice of the maps .
A finite set of -formulas is certified by iff is a syntactic certificate and . If is a semantic certificate then we also say is certified by in case there is a syntactic certificate certifying both and .
Definition 5.27.
Conditions are finite sets of formulae so that
This completes the construction of .
Proposition 5.28.
Let . If is certified in some outer model, then is certified in .
Proof.
Let be -generic. If there is some outer model in which is certified, then by Shoenfield absoluteness we can find in a set of -formulas with such that if
is the corresponding semantic interpretation then
as this can be expressed by a -formula. It remains to show that holds true as well, i.e. . For this follows as and by assumption , in . To see that , note that as is almost a -condition in . By , it is enough to see that is generically iterable. This follows from (the proof of) Theorem 3.16 in [Woo10], here we use exists in . ∎
We let . As in Asperó-Schindler, we conclude that there is a club so that for all
and hence we get
is stationary. |
Lemma 5.29.
.
The argument is essentially the same as the proof of Lemma 3.6 in [AS21] modulo some details that arise from replacing by a general .
Proof.
Let be generic for . Note that as is almost a -condition in . By choice of , we can find with . Let witness . Let us denote and let
witness . Now let
be a generic iteration of of length as well as
the stretch of by . Note that this is a generic iteration of of length .
Claim 5.30.
The generic iteration
can be extended to a generic iteration of of length . That is, there is a generic iteration
of so that for all
-
and
-
.
Proof.
The iteration arises by applying the same generic ultrafilter which generates to . By induction on , as , measures all subsets of in . It is a generic ultrafilter as
by elementarity of , and hence all maximal antichains in are already in , hence are met by . Now let
be the ultrapower. Any is represented by some function which is an element of . It follows that . It is easy to see that the properties , are stable under taking direct limits. ∎
The point is that
is a semantic certificate for in with respect to
for and . By Proposition 5.28,
so that in by elementarity of . ∎
Lemma 5.31.
Suppose and is a filter with
-
whenever is dense and definable over
-
is an element of a generic extension of by a forcing of size .
Then is a semantic certificate.
Proof.
Read off the canonical candidate
from . The proof of Lemma 3.7 in [AS21] shows that -precertifies . Note that the argument from Proposition 5.28 gives that and follows from (.1) and . It remains to check 4. So suppose and is a -code for a dense subset of definable over
from a parameter . Then there is with
Let be a syntactic certificate certifying (in some extension of by ) and
the corresponding semantic certificate. We have and as well as . Thus is definable over from parameters in . As satisfies 4, there is with . We may now find so that
Note that as . Let . It follows that
This is a density argument that shows: There are , , so that
-
,
-
and
-
for some .
It follows that for , we have and . ∎
Lemma 5.32.
Suppose is generic for and
is the resulting semantic certificate. Then in ,
is a -iteration.
Proof.
Let be -names with
for some . Further suppose is a sequence of -names for dense subsets of . We may suppose that
for some and where is a name for which arises in the semantic certificate corresponding to the generic filter. It is our duty to find and with
() |
where is a name for the generic ultrafilter applied to along the iteration to . We will replace the with codes for them: For , let be defined by iff
-
,
-
and
-
.
Further, for , we let
and
Finally we define
We may now find so that and
Here, denotes some canonical way of coding at most -many subsets of into a subset of . Let be -generic over .
Claim 5.33.
Proof.
We now work in . Let be the filters given by the claim above and let
be the semantic certificate that comes from . Let
be the generic ultrapower. We can further extend the generic iteration
to one of length , say
Further, set
As is certified, and as in Claim 5.30, we can extend the tail of that is an iteration of to a generic iteration of , say
and have all , , wellfounded. Let us write
Work in . We will now use
as part of a certificate. Set
where represents in the term model for .
Claim 5.34.
.
Proof.
Set
where
-
•
,
-
•
for , and and
-
•
, .
We show that is a semantic certificate for in . Note that we have to show that is a certificate relative to
Observe that we can find a corresponding set of formulae that corresponds to with which we aim to prove to be a syntactic certificate.
We have . Notice also that
and that is still a real code for . Next, we prove 4. First assume . Then
and as . As , 4 holds for in , since it holds for in .
Finally, let us consider the case . We have
and as has critical point . Clearly collapses to . So if and
for some , then by elementarity, the same definition defines a -code for a dense subset of over
with parameter and we have . Our properties of imply that there is . It is not difficult to see
and hence . This shows 4 at .
We conclude that indeed, is a semantic certificate for which exists in some outer model of . This gives by Proposition 5.28.
∎
Thus we have
By elementarity of , we conclude
Let witness this and set
We will show that witness ( ‣ 5.4). From this point on, we work in again and forget about , etc.
Claim 5.35.
.
Proof.
As in Claim 3.17 in [AS21], exploit the components of made up from as well as , . ∎
Claim 5.36.
.
Proof.
Let be -generic with and let
be the resulting semantic certificate. We have and as . Fix some . Clearly,
is a -code for a dense subset of which is definable over
from a parameter in , namely . Recall that . Using 4, we find that there is
with . Note that there are , as well as with
-
and
-
.
By definition of , and as , and since , , where is the generic ultrafilter generating . ∎
This completes the proof of Theorem 5.20. We denote the forcing constructed above in the instance of a , the set and appropriate dense by (and forget that also depends on the choice of etc.).
5.5 The first blueprint
We will formulate a general theorem that will allow us to prove a variety of instances of . In order to formulate the relevant forcing axioms, we use that in practice has a specific form.
Definition 5.37.
A is typical if can be chosen to be the form
for and a finite set of formulae in the language . Moreover, contains the formulae and for all . We say that witnesses the typicality of .
This means that iff there is a generic iteration of in of length so that the formulae in are absolute between .
Remark 5.38.
For example, is (or can be construed as) a typical . We have that typicality of is witnessed by where
-
•
and
-
•
.
All we will encounter, except for , are typical .
Next, we formulate the relevant bounded and unbounded forcing axioms as general as possible.
Definition 5.39.
Suppose is a formula in the language and .
-
We define via
-
For , we say that is a code for if: Let denote Gödels pairing function and . Then is wellfounded and is the transitive isomorph161616 denotes transitive closure..
-
is a code for an element of if is a code for some .
Definition 5.40.
Suppose that
-
•
is a class of forcings,
-
•
and
-
•
is a set of formulae in the language .
-
states that is -universally Baire and whenever and is -generic then
For , means for all .
-
states that whenever and
-
is a set of at most -many dense subsets of ,
-
is a set of at most -many -names for codes of elements of for
then there is a filter so that
-
for all and
-
is a code for an element of for all , .
-
We note that the methods of Bagaria in [Bag00] readily yield the following.
Lemma 5.41.
Suppose that
-
is a class of forcings,
-
and
-
is a set of formulae in the language .
If holds then so does .
Definition 5.42.
Let be a set of formulae in the language for some . For , we say that a forcing is -preserving iff
for all . denotes the class of -preserving forcings.
Definition 5.43.
A accepts -iterations if
is provable in (that is, from sufficiently much of ).
First Blueprint Theorem 5.44.
Suppose that
-
is a typical with typicality witnessed by ,
-
has unique iterations and accepts -iterations,
-
and is almost a -condition,
-
holds and
-
holds.
Then holds as witnessed by .
Proof.
Let us assume , so . entails “ is saturated” as well as . Results of Steel [Ste05] show that the latter implies that is closed under . As a consequence
-
•
,
-
•
all sets of reals in are -universally Baire and
-
•
for all sets in and any generic extension of .
Thus generic projective absoluteness holds in and if is a dense subset of , then is a dense subset of in any generic extension. Thus exists for any such .
Claim 5.45.
For any dense , , is -preserving.
Proof.
Let be -generic. By Theorem 5.20, in we have
where
-
are generic iterations of , respectively,
-
witnesses ,
-
and
-
the generic iteration is a -iteration.
Note that
As is typical, we must have . As accepts -iterations,
and finally it follows from typicality that
As witnesses the typicality of , it follows that is -preserving. ∎
Remark 5.46.
If additionally there are a proper class of Woodin cardinals, then meets all -universally Baire dense subsets of .
5.6 The second blueprint
From the right perspective, is a forcing axiom. As noted before, Asperó-Schindler show that if there is a proper class of Woodin cardinals, then is equivalent to -. Some additional assumption like large cardinals is necessary as implies closure of under sharps while holds in the -extension of . We try to generalize this result roughly to all natural for which the -method can prove them from some forcing axiom. We will have to restrict to better behaved .
Definition 5.47.
Let be a with unique iterations and be -generic over .
-
We say that produces if there is so that if
is the -iteration of then for all .
-
If is typical, we set
where is the unique sequence produced by .
Definition 5.48.
A with unique iterations is self-assembling if: Whenever is -generic over then
-
is almost a -condition and
-
.
All we will work with are self-assembling (assuming in ). For example, is self-assembling. The relevance of this property for us is partly explained by the following result.
Lemma 5.49.
Suppose is a self-assembling with unique iterations and typicality of is witnessed by a set of -formulae. If holds as witnessed by then
-
is almost a -condition and
-
where produces .
Proof.
As is self-assembling, is almost a -condition. Moreover, as witnesses . It follows that and thus holds.
Let us now prove , note that it suffices to show .
Claim 5.50.
If and
is the -iteration of then and for .
Proof.
for follows easily from typicality, we show . It is clear that since if , then a tail of the iteration points of the iteration is missing from . On the other hand, suppose . We may assume for some . If is club then as is self-assembling, there is , such that if is the -iteration of , then , say . Note that we may assume , say this is witnessed by
Write . As is typical, and hence which gives
Clearly, is an iteration of of length guided by . Thus, by Lemma 5.11, . follows. ∎
Let and let be the -iteration of .
Claim 5.51.
.
Proof.
Let and assume is , so write where is . So suppose for some and we have
As is self-assembling, we can find with
-
as witnessed by and
-
for some
where is the -iteration of . By Claim 5.50,
and as by Lemma 5.11 as well as elementarity of we find
Finally, so that
and hence by elemntarity of .
The “dual argument” works if is instead.
∎
Now if is -generic then the above shows that witnesses in . Thus . ∎
Theorem 5.44 gives a hint how the forcing axiom equivalent to should look like. However, is not the right class of forcings, for example one can construe two which are the same as forcings, but for which the resulting classes are fundamentally different for reasonable . Instead, we should look at the class of forcings which roughly lie on the way to the good extensions highlighted in the -Multiverse View.
Definition 5.52.
Suppose that
-
is a typical ,
-
typicality of is witnessed by and
-
.
The class consists of all -preserving forcings so that if is -generic, then there is a forcing with
and if further is -generic over , then in both
-
is almost a -condition and
-
is saturated.
It just so happens that, maybe by accident, for the we will look at explicitly, if there is a proper class of Woodin cardinals then one can choose so that in case that .
Definition 5.53.
Suppose that is a potentially iterable structure and . We say that is (generically) -iterable if for we have
-
is a model of (sufficiently much of) where is allowed as a class parameter in the schemes and
-
whenever is a generic iteration of , i.e.
-
is an ultrapower of by a -generic ultrafilter w.r.t. for ,
-
if is a limit then
then .
-
Proposition 5.54 (Folklore).
Suppose that is saturated and is -universally Baire. Then in any forcing extension in which is countable, is -iterable.
Proof.
Let be some forcing which collapses to . Let witness that is -universally Baire with . Let be -generic over . Let
be any generic iteration of . Then as in Claim 5.30, this iteration can be lifted to a generic iteration
of . In particular, is wellfounded as is wellfounded. Let , .
Claim 5.55.
In , .
Proof.
Work in . We have and this implies , likewise . In , project to complements and an absoluteness of wellfoundedness argument shows that this must be true in as well, so that we indeed have . ∎
We conclude
which is what we had to show. ∎
Lemma 5.56.
Suppose that
-
is a typical self-assembling with unique iterations,
-
typicality of is witnessed by a set of -formulae ,
-
there is a proper class of Woodin cardinals,
-
holds as witnessed by and
-
produces .
Then holds true.
Proof.
We will assume . Let witness . Let and the generic iteration of guided by . We will show that
holds. By Lemma 5.49, is almost a -condition. Now let and . Let be -generic. We have to show that
So let , and a -formula such that
As is self-assembling, we may assume without loss of generality that for some . Let be a further generic extension by -preserving forcing so that in
-
is almost a -condition and
-
is saturated.
Note that
as the extension is -preserving. Here, denotes the reevaluation of in . Accordingly,
Let be -generic over and the reevaluation of in . Then in ,
is -iterable by Proposition 5.54.
Claim 5.57.
for all .
Proof.
Let and the -iteration of . It follows from the proof of Lemma 5.49 that
and since the extension is -preserving,
follows. ∎
Let , as witnessed by . witnesses in that there is , as witnessed by , so that
-
is -iterable,
-
and
-
where . As there is a proper class of Woodin cardinals,
and hence a density argument shows that there is , , as witnessed by , such that
-
is -iterable,
-
and
-
for some , .
Let be the -iteration of . By (the proof of) Lemma 5.49
and hence
Moreover,
is fully elementary by so that
By Lemma 5.11, , so we can conclude
which is what we had to show. ∎
In fact, we get an equivalence in case we can apply the -method.
Second Blueprint Theorem 5.58.
Suppose that
-
There are a proper class of Woodin cardinals,
-
is a self-assembling typical ,
-
has unique iterations and accepts -iterations,
-
typicality of is witnessed by a set of -formulae,
-
and
-
.
The following are equivalent:
-
There is a filter which witnesses and produces .
-
.
Proof.
“” follows from Theorem 5.56. “” can be proven similar to the First Blueprint Theorem 5.44. We use the existence of a proper class of Woodin cardinals instead of to justify , that all sets of reals in are -universally Baire and generic -absoluteness. It is not immediate that is almost a -condition, nor did we assume that is saturated, however as , we can pass to a -preserving forcing extension in which both of this is true. It follows that
witnesses and produces . ∎
5.7 The -variation
We will have to do some work in order to find a forcing which freezes along a witness of . The main idea is to find the correct to throw into the --forcing. Let us first introduce Woodin’s .
Definition 5.59.
A condition is a generically iterable structure with
-
and
-
, where is the embedding associated to .
The order on is given by
iff there is an iteration
in with .
We mention that it follows from Lemma 3.10 that if is a -condition then ”.
Forcing that is almost a -condition for some essentially amounts to forcing “ is -dense”. We replace by an equivalent forcing for which this is easier to achieve.
Definition 5.60.
A condition is a generically iterable structure of the form so that
The order on is given by iff there is an iteration
in so that
-
and
-
if then there is with .
We note that is essentially unchanged if condition is dropped, but demanding it is convenient for us.
Proposition 5.61 (Woodin, [Woo10, Definition 6.20]).
Suppose is closed under and is a normal uniform ideal. Suppose guesses -filters. The following are equivalent:
-
witnesses .
-
For any ,
and for all , .
The following is the key result about .
Lemma 5.62.
Suppose is a normal uniform ideal, witnesses , and is closed under . For any there is an iteration
so that
-
(so in particular witnesses ) and
-
if then there is with .
Proof.
Let be a real coding and let be the club of -indiscernibles below . By induction along we will define a filter . Let
be the increasing enumeration of . Assume that is already defined. First we define :
Case 1: is generic over . Then let .
Case 2: Case 1 fails. Then let be some generic for over .
Next, we choose to be any generic for over .
Claim 5.63.
is generic over .
Proof.
enumerates a club of -regular ordinals. Thus for any , has the -c.c. in . It follows by induction that is -generic over and finally that is -generic over . ∎
By induction on , we now define a generic iteration
of . Here, denotes the generic filter that produces the ultrapower .
Let denote the map
Simply pick least, according to the canonical global wellorder in
so that
-
is -generic over and
-
.
This is possible as is -generic over , as
and as is countable in . induces the generic ultrapower .
Finally we get a generic iteration map
Claim 5.64.
.
Proof.
and agree on the club of iteration points, i.e. we have for any . Here we use that extends .
Moreover,
by Proposition 5.61 as witnesses . By construction of , it follows that . As is a normal uniform ideal, we can conclude
∎
It follows that witnesses . Now let . We have to show the following.
Claim 5.65.
for some .
Proof.
We will prove that the intersection of with is bounded below for some . Find so that
-
there is with and
-
.
where is a name for the least filter that is generic over and contains , where is now the canonical name for the generic. Now suppose . There is then an elementary embedding
with
-
and
-
.
We have that lifts to an elementary embedding
so that
Clearly, and thus
as . Note that all points in are iteration points and recall that and agree on iteration points.
Subclaim 5.66.
.
Proof.
The reason is that, since is a limit ordinal, is the direct limit along and thus there is some and with . Hence
Here, we use in the third equation. This holds as our lift satisfies and so it is easy to see that so that
∎
All in all, . Thus
so that .
∎
∎
Proposition 5.67 (Folklore?).
Suppose there is a precipitous ideal on . Then is closed under .
Proof.
It is easy to see that is closed under . Let be a precipitous ideal and let be the generic ultrapower of in the extension , generic for . Then and is coded by a real in . By elementarity, is closed under . Thus exists in . As forcing cannot add a sharp, . ∎
Lemma 5.68.
Assume in . The inclusion is a dense embedding.
Proof.
It is not obvious how to even prove construct a single -condition assuming only . Woodin worked with a variant of instead to analyze the -extension of . We remark that this can be done with as well. The arguments are, modulo Lemma 5.62, quite similar to the arguments in the analysis.
6 Consistency of and forcing “ is -dense”
We are now in position to force and force “ is -dense”.
We can now finally find a forcing which freezes along assuming large cardinals and that witnesses .
We will also reap what we have sown by replacing with .
Proof of Lemma 4.9.
Use the Woodin cardinal to make saturated while turning into a witness of by -semiproper forcing in a generic extension using the iteration theorem 3.15. Shelah’s construction to make saturated works just as well in this context. Observe that
is a almost a -condition in . Work in . Next we want to apply Theorem 5.20 with for the dense set . Note that the universe is closed under and as is , is -universally Baire. We cannot guarantee full generic absoluteness for small forcings, however we actually only need that for any forcing of size we have that
-
and
-
is a in
is again guaranteed by the closure under . The only nontrivial thing one has to verify for is that has no minimal conditions in . This follows from the closure of under .
Thus exists and in a further extension by we have:
So that
-
are generic iterations of , respectively,
-
witnesses ,
-
and
-
the generic iteration is a -iteration.
Claim 6.1.
witnesses in .
Proof.
By Lemma 5.19 and , , in particular witnesses in . ∎
It remains to show that the extension has “frozen along ”. Let . It follows from , and the definition of (especially ) that one of the following holds:
-
•
Either ,
-
•
or for some we have .
As any -iteration is correct, . It follows that
-
•
either ,
-
•
or for some we have ,
which is what we had to show. ∎
Remark 6.2.
Instead of closure of under we could just as well have assumed that there is a second Woodin cardinal with a measurable above.
Theorem 6.3.
Suppose witnesses and there is a supercompact limit of supercompact cardinals. Then there is a -preserving forcing extension in which witnesses .
Proof.
Let be a supercompact limit of supercompact cardinals and
an associated Laver function. We describe a -iteration w.r.t.
that forces . For any , is a two step-iteration of the form
with . If is a successor (or ) then
-
is forced to be a -preserving forcing that freezes along and
-
is a name for a -preserving partial order forcing .
Note that exists by Lemma 4.9 and exists by Corollary LABEL:getSRPcor.
If is a limit ordinal, then
-
is if that is a -name for a -preserving forcing and the trivial forcing else,
-
is as in the successor case.
It is clear that this constitutes a -iteration and hence preserves and in particular is not collapsed. is -c.c.. As we use -preserving forcings guessed by at limit steps, holds in the extension as witnessed by by the usual argument. ∎
If one is only interested in forcing “ is -dense”, a slightly weaker large cardinal assumption is sufficient.
Theorem 6.4.
Suppose witnesses and is an inaccessible limit of -supercompact cardinals. Then there is a -preserving forcing extension in which is -dense.
Proof.
Indeed any nice iteration
so that for all
preserves and forces “ is -dense”. To see this, first of all note that is -c.c. by Fact LABEL:niceccfact. Now any for preserves by Theorem 4.8 applied in and it follows immediately that preserves . Suppose now that is -generic and
There must be some nonlimit with . As freezes along in , there must be some with in , hence in . ∎
Neither of these results answers the original question, as Woodin asks specifically for a semiproper forcing, but -iterations are not stationary set preserving if is not -dense to begin with. However, we have one more trick up our sleeves: For once we will pick more carefully.
Lemma 6.5.
Suppose is a sequence of pairwise disjoint stationary sets in and holds for all . Then there is witnessing so that for all , there is with .
Proof.
From , we get a witness of so that is the trivial filter if . Let be an enumeration of some maximal antichain in of size . Now define as follows: For we let
Note that there is at most one with . If is not in any , let be the trivial filter. It is now clear that , but we still need to verify that indeed witnesses . So let and
be a sequence of dense subsets of . We have that show that
is stationary. So let be a club in . Find so that is compatible with and note that we may assume further that . Hence we can write as . For , let
and note that is dense. As witnesses , we may find large enough so that
-
,
-
and
-
.
It follows that and that
∎
Corollary 6.6.
Assume there is a supercompact limit of supercompact cardinals. Then there is a semiproper forcing with .
Proof.
By otherwise taking advantage of the least supercompact, we may assume all stationary-set preserving forcings are semiproper. Next, we force with
Let be -generic over . There is then a partition of into stationary sets so that whenever is stationary in , then is stationary for all . Also, there is an enumeration
of all stationary sets in . Now in ,
is a sequence of pairwise disjoint stationary sets. Moreover, holds for any stationary . By Lemma 6.5, there is a witness of so that for any there is with . Thus for any stationary , contains some . Note that any further -preserving forcing preserves the stationarity of any and hence does not kill any stationary . By Theorem 6.3, there is an -preserving that forces . It follows that back in , the two-step forcing preserves stationary sets, hence is semiproper, and forces . ∎
Similarly, can prove the following from Theorem 6.4.
Corollary 6.7.
Assume there is an inaccessible that is a limit of -supercompact cardinals. Then there is a stationary set preserving forcing with
Assuming one more (sufficiently past -) supercompact cardinal below , one can replace stationary set preserving forcing by semiproper forcing.
So the answer to Woodin’s question is yes assuming sufficiently large cardinals.
6.1 implies
We apply the Blueprint Theorems to show that the relation between and is analogous to the one of and .
Typicality of is witnessed by consisting of the formulae
-
•
,
-
•
and
-
•
.
Note that is (in context equivalent to) a -formula.
Theorem 6.8.
implies .
Proof.
Definition 6.9.
For , - states that there is witnessing so that
holds.
We mention that already - is enough to prove “ is -dense”.
Finally, we remark that one can show that fragments of hold in -extensions of canonical models of determinacy. For example , i.e. for forcings of size at most continuum, holds in the -extension of models of and holds in the -extension of suitable -mice.
Finally we want to mention that Woodin has formulated a forcing axiom somewhat similar to and has proven that it holds in the -extension of a model of , see Theorem 9.54 in [Woo10]171717We remark once again that Woodin has defined slightly different than we have here. The global version of Woodin’s axiom does not imply “ is -dense”. The reason is that if witnesses and holds then is true, however is not -dense.
References
- [AS21] David Asperó and Ralf Schindler. Martin’s Maximum++ implies Woodin’s axiom . Ann. of Math. (2), 193(3):793–835, 2021.
- [Bag00] Joan Bagaria. Bounded forcing axioms as principles of generic absoluteness. Arch. Math. Logic, 39(6):393–401, 2000.
- [BHM75] J. E. Baumgartner, A. Ha̧jņal, and A. Mate. Weak saturation properties of ideals. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, Colloq. Math. Soc. János Bolyai, Vol. 10, pages 137–158. North-Holland, Amsterdam, 1975.
- [EH71] P. Erdős and A. Hajnal. Unsolved problems in set theory. In Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967), pages 17–48. Amer. Math. Soc., Providence, R.I., 1971.
- [Erd50] P. Erdős. Some Remarks on Set Theory. Proceedings of the American Mathematical Society, 1(2):127–141, 1950.
- [FMS88] M. Foreman, M. Magidor, and S. Shelah. Martin’s maximum, saturated ideals, and nonregular ultrafilters. I. Ann. of Math. (2), 127(1):1–47, 1988.
- [For10] Matthew Foreman. Ideals and generic elementary embeddings. In Handbook of set theory. Vols. 1, 2, 3, pages 885–1147. Springer, Dordrecht, 2010.
- [FWZ15] Sy-David Friedman, Liuzhen Wu, and Lyubomyr Zdomskyy. -definability of the non-stationary ideal at successor cardinals. Fund. Math., 229(3):231–254, 2015.
- [HLSW22] Stefan Hoffelner, Paul Larson, Ralf Schindler, and Liuzhen Wu. Forcing Aioms and Definability of the Nonstationary Ideal on . 2022. submitted.
- [JMMP80] T. Jech, M. Magidor, W. Mitchell, and K. Prikry. Precipitous ideals. J. Symbolic Logic, 45(1):1–8, 1980.
- [Kun78] Kenneth Kunen. Saturated ideals. J. Symbolic Logic, 43(1):65–76, 1978.
- [Lie23] Andreas Lietz. An iteration theorem for -preserving forcings. 2023. To appear.
- [Miy02] Tadatoshi Miyamoto. On iterating semiproper preorders. J. Symbolic Logic, 67(4):1431–1468, 2002.
- [Pri72] Karel Prikry. On a problem of Erdős, Hajnal and Rado. Discrete Math., 2:51–59, 1972.
- [Pri76] Karel Prikry. Kurepa’s hypothesis and a problem of Ulam on families of measures. Monatsh. Math., 81(1):41–57, 1976.
- [RS14] John Steel Ralf Schindler. The core model induction, September 2014. Available online at https://ivv5hpp.uni-muenster.de/u/rds/core_model_induction.pdf.
- [Sch] Ralf Schindler. and . Available online at http://ivv5hpp.uni-muenster.de/u/rds/-CH_star.pdf.
- [Sch11] Ralf Schindler. On being saturated, September 2011. Available online at https://ivv5hpp.uni-muenster.de/u/rds/sat_ideal_even_better_version.pdf.
- [She86] Saharon Shelah. Around classification theory of models, volume 1182 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1986.
- [She98] Saharon Shelah. Proper and improper forcing. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, second edition, 1998.
- [SS22] Ralf Schindler and Xiuyuan Sun. and the definability of . 2022. submitted.
- [Ste05] John R. Steel. PFA implies . J. Symbolic Logic, 70(4):1255–1296, 2005.
- [SVW82] John R. Steel and Robert Van Wesep. Two consequences of determinacy consistent with choice. Trans. Amer. Math. Soc., 272(1):67–85, 1982.
- [Tay79] Alan D. Taylor. Regularity properties of ideals and ultrafilters. Ann. Math. Logic, 16(1):33–55, 1979.
- [Ula30] Stanisław Ulam. Zur Masstheorie in der allgemeinen Mengenlehre. Fundamenta Mathematicae, 16(1):140–150, 1930.
- [Woo] W. Hugh Woodin. The equivalence of Axiom and Axiom .
- [Woo83] W. Hugh Woodin. Some consistency results in using . In Cabal seminar 79–81, volume 1019 of Lecture Notes in Math., pages 172–198. Springer, Berlin, 1983.
- [Woo99] 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 & Co., Berlin, 1999.
- [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.