Adjoining only the things you want: a survey of Strong Chang's Conjecture and related topics
Sean Cox

TL;DR
This paper surveys various results, both old and new, concerning strong variants of Chang's Conjecture and related mathematical topics, providing a comprehensive overview of recent developments.
Contribution
It offers a comprehensive survey of recent and classical results on strong variants of Chang's Conjecture, highlighting new insights and open problems.
Findings
Summarizes key results on strong Chang's Conjecture variants
Identifies connections between Chang's Conjecture and related topics
Highlights recent advances and open questions in the field
Abstract
We survey some old and new results on strong variants of Chang's Conjecture and related topics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
Adjoining only the things you want: a survey of Strong Chang’s Conjecture and related topics
Sean Cox
Department of Mathematics and Applied Mathematics
Virginia Commonwealth University
1015 Floyd Avenue
Richmond, Virginia 23284, USA
Abstract.
We survey some old and new results on strong variants of Chang’s Conjecture and related topics.
2010 Mathematics Subject Classification:
03E05, 03E55, 03E35, 03E65
The author gratefully acknowledges support from Simons Foundation grant 318467.
Contents
1. Introduction
Variations of the following problem appear frequently in set theory, especially since Shelah’s introduction of proper and semiproper forcing. Given an uncountable set such that , some Skolemized structure in a countable language, some countable ,111We do not require here that , because some examples of this problem appear when and is in some forcing extension of . and some object of interest, we are often interested in adjoining to , but in a way that doesn’t add any new “unintended” objects. For example, we often want to know whether we can arrange that the -Skolem hull of —which we’ll denote —has the property that
[TABLE]
We often informally express (+ ‣ 1) by saying that “adjoining to doesn’t add new countable ordinals”.
We will omit the superscript from when it is clear from the context. Given a countable , there are always objects for which the equality (+ ‣ 1) must fail. For example, if , then clearly (+ ‣ 1) fails. A slightly less obvious example is when , where is any Skolemized extension of , and is some ordinal in . To see that (+ ‣ 1) must fail in this situation, let be any ordinal in above . Since and extends , there is some that is a surjection from . Now , so there is some such that . Then , because otherwise, since , would be in too, contrary to our assumptions about .
So we cannot hope to have (+ ‣ 1) hold for every choice of and . There are several dials to turn to adjust the question, e.g. for an arbitrary , for which does (+ ‣ 1) hold? Or, for a fixed , and given some (necessarily nonstationary) collection of countable such that , for which such does equation (+ ‣ 1) hold?
Such questions come up surprisingly often in set theory. Here are a few more concrete variants of the question, to give a flavor of how widespread the problem is.
1.1. Semiproper and Proper forcing (Shelah)
Suppose that is a partial order in and is a countable elementary substructure of . Let be a condition in . Can we find a -generic filter , with , such that, letting be any wellorder of (so that the resulting structure will have definable Skolem functions), the equation
[TABLE]
holds? Here denotes the hull of in the structure . If the answer is “yes” for every countable and every , then is called semiproper.
What if, instead, we make the stronger requirement that
[TABLE]
If the answer is “yes” for every countable and every , then is called proper.
1.2. Strong versions of Chang’s Conjecture
For how many is there some such that ? There are always projective stationarily many such (see Section 3). Getting club-many such requires (consistency of) large cardinals, and is a kind of Strong Chang’s Conjecture discussed in Section 4. These strong forms of Chang’s Conjecture have interesting characterizations (e.g. Theorem 4.6 and 4.7), and tend to amplify saturation properties of the nonstationary ideal on (Section 4.7). Moreover, higher variants of this notion (for example, for of size ) were used by Foreman and Magidor to prove that certain kinds of stationary reflection are inconsistent with ZFC; see Section 5.
Here is a related question that is closely related to stationary set reflection. Suppose , is some skolemized extension of , is countable, and happens to be of the form for some countable and some such that . Then (because both and were elementary in , and is Skolemized). Not only do we have in this situation, but in fact
[TABLE]
To see the nontrivial direction of (** ‣ 1.2)—i.e. the direction—let . Then and for some -Skolem function and some finite tuple from . Since and , . Since , . So .
It’s natural to ask for how many does such a exist:
Question 1.1**.**
For how many is it true that there exists a such that and ?
It turns out that there are always a large number (“projective stationarily many”) of such , and in fact a large number of for which stationarily many ’s work. We will return to this in Section 3.
1.3. Antichain catching
Suppose is a countable elementary substructure of and is a maximal antichain in the boolean algebra (where denotes the ideal of nonstationary subsets of ). We say that catches if there is some such that .222More precisely, we should say that there is an such that and , where denotes the equivalence class of in . We will often omit the equivalence class notation.
Question 1.2**.**
How many catch ?
There are always projective stationarily many such . If there are club-many such (for each ), then is saturated (i.e. has the chain condition). The converse holds as well. This is proved in a highly general form (applicable to ideals other than ) in Lemma 3.46 of Foreman [MattHandbook]; we sketch a proof just for in Section 2.
Here is a question about antichain-catching that is more closely related to Chang’s Conjecture and stationary set reflection is (again, for an arbitrary maximal antichain in ):
Question 1.3**.**
For how many does the following hold?
[TABLE]
Equivalently: how many can be “end-extended” (i.e. without adding new countable ordinals) to some model that catches ?
The stationary reflection principle WRP implies that the answer is “club-many” (for each ), which in turn implies that is presaturated. See Section 4.5.
1.4. The scope and purpose of this survey
This is intended to be a survey of several topics that are closely related to the “extension” problems described above. Proofs are generally included if they are sufficiently short, demonstrate some of the common ideas, or simplify/shorten existing proofs in the literature. There is considerable overlap between this survey and the Handbook of Set Theory, especially Foreman’s chapter ([MattHandbook]), where these topics are usually treated in much more generality. The current survey is intended to be more concise, and with a more restricted scope, than those sources. The survey also includes some newer results (mainly in Section 4) that have appeared since the Handbook of Set Theory was published. The survey also attempts to uniformize the treatment of some related topics, e.g. the “Global” versions of Strong Chang’s Conjecture introduced by Doebler-Schindler [MR2576698] and Fuchino-Usuba [FuchinoUsuba] (these are covered in Section 4).
Section 2 includes preliminaries. Section 3 covers some basic results in ZFC, generally of the form “such-and-such a set is always projective stationary”. Section 4, the longest section of the survey, deals with strong versions of Chang’s Conjecture, stationary reflection principles, and related topics. One can roughly view these as what you get when you replace “projective stationary” with “club” in the lemmas from Section 3. Section 5 covers some results of Foreman-Magidor [MR1359154] about impossibility of higher stationary set reflection (with attempts to streamline the proof and highlight its connection with Strong Chang’s Conjecture).
2. Preliminaries
Throughout this paper, we use the word stationary in the “weak” sense of Foreman-Magidor-Shelah [MR924672] and Larson [MR2069032], though in many contexts this “weak” concept of stationarity is equivalent to Jech’s notion of stationarity (see Feng [MR946635] for a comparison of the two notions). Namely, a set is stationary iff for every , there exists an that is closed under . This is equivalent to requiring that for every structure in a countable language with universe , there exists some such that . We will often refer to some ambient space when discussing stationarity, and say things like “ is stationary in ”; by this we mean that , and whenever is a structure on in a countable language, then there is a such that . Other ambient spaces will sometimes be used as well (e.g. ). This implies in particular that , and hence agrees with the assertion that “ is stationary” defined above. We make frequent use of the -completeness of the nonstationary ideal; i.e. that a countable union of nonstationary sets is nonstationary. We also make frequent use of Fodor’s Lemma, which asserts that if is a regressive function on a stationary set —i.e. for every —then there is a stationary and a fixed such that for every . The same holds if we replace “stationary” by “stationary in such-and-such ambient structure”. Proofs of these and other standard facts about this notion of stationarity appear in Larson [MR2069032]. The following lemmas are used frequently:
Lemma 2.1**.**
Suppose and is countable. If contains a club subset of and , then .
Lemma 2.2**.**
If is a structure in a countable signature, and , then .
If is a set, a filtration of is a -continuous and -increasing sequence , with union , such that for all . If and are sets, we write iff and . A set is semistationary (in ) if
[TABLE]
is stationary. A partial order is proper if it preserves all stationary subsets of (for all large enough ), and semiproper if it preserves all semistationary subsets of (for all large enough ).
The following lemma is probably the most frequently used lemma in the entire subject. Intuitively, it says that for an uncountable set and some fixed objects outside of , almost every subset of can have those new objects adjoined to them, without adding new elements of .
Lemma 2.3**.**
Suppose is any uncountable set, is any superset of , and is a Skolemized structure on in a countable language.333In applications, will often include as a predicate (or even a constant, if ). Then for “almost every” ,
[TABLE]
In other words, letting denote the set of for which the equation holds, we have that is nonstationary in .
Proof.
Suppose toward a contradiction that were stationary in (recall that we are using the notion of “weak” stationarity). Then for every , there is some -Skolem function and some finite tuple from such that . Since is in a countable language, there are only countably many Skolem functions; so by the -completness of the nonstationary ideal, there is a stationary and a fixed Skolem function such that for every . Let denote the arity of . Then by repeated use of Fodor’s Lemma times (on the regressive maps , then , etc.) there is a stationary and a fixed -tuple such that (and hence ) for every .
In summary, for every in . And is stationary in , which implies . Since , there is some such that , a contradiction. ∎
To illustrate a typical use of Lemma 2.3, and because the proof involves simple but powerful techniques that are used so often in this area, we prove the following lemma of Foreman. Recall the definition of “catching” an antichain appeared in Section 1.3. The use of Lemma 2.3 is in the (3) (1) direction of the proof.
Lemma 2.4** (Special case of Lemma 3.46 of Foreman [MattHandbook]).**
The following are equivalent (in what follows, “maximal antichain” means a maximal antichain in ):
- (1)
* is saturated.* 2. (2)
For every regular , there are club-many such that for every maximal antichain , catches . 3. (3)
For every maximal antichain and every regular , club-many catch .
Proof.
(1) (2): Assume is saturated, and . Let be a maximal antichain; then sees that , and hence that the diagonal union of contains a club . Then , and hence . It follows that there is some such that .
(2) (3): Given a particular , there are club-many with . By assumption, club many of those catch all of their antichains, so in particular they catch .
(3) (1): assume (3). Let be a maximal antichain, and let be a Skolemized structure witnessing that the -catching sets form a club in ; so for every countable , catches . Let
[TABLE]
and observe that . Suppose for a contradiction that ; fix some for the remainder of the proof. Let . By Lemma 2.3, almost every has the property that
[TABLE]
In particular, we can easily find such an such that, in addition, and (note that is elementary in , so makes sense). Set . Then, in particular, ; let denote this ordinal. Furthermore, since , catches ; so there is some such that . Now but ; in particular, and are distinct members of the antichain , and hence is nonstationary. But and are both elements of , and . This contradicts Lemma 2.1. ∎
3. ZFC results: some common projective stationary sets
Feng-Jech [MR1668171] defined a subset to be projective stationary iff for every stationary , the set
[TABLE]
is stationary in .
For the rest of the section, we prove several ZFC results, which often conclude that there are projective stationarily many with some nice extension property. As we will see in subsequent sections, to move from projective stationarily many to club many results in a statement that not only is independent of ZFC, but has large cardinal strength.
The following lemma is the ZFC result alluded to in Section 1.2 above; it can be viewed as a ZFC-provable version of the principle Global that will be introduced in Section 4. The proof makes use of the notion of an internally approachable set of size ; this is a set such that there is some -increasing and continuous sequence of countable sets, with union , such that every proper initial segment of is an element of . denotes the class of sets that are internally approachable of size . The following facts are well-known and easy to prove:
Fact 3.1**.**
Suppose is regular.
- •
* is stationary in .*
- •
If , is regular, , and , then .
- •
If then contains a club subset of (this latter property is called internally club by Foreman-Todorcevic [MR2115072]).
- •
If and , where is countable, then (this really just follows from the internal clubness of ).
Lemma 3.2**.**
Given a regular and a Skolemized structure in a countable language extending , there are projective-stationarily many such that
[TABLE]
is stationary in .
Proof.
Let be a stationary subset of ; we need to prove that there are stationarily many such that and is stationary in .444In fact, the proof can be modified to show that (for stationarily many ) the set is stationary.
Suppose toward a contradiction that this fails. Then there is a Skolemized structure in a countable language, which we can without loss of generality assume extends , such that whenever is countable and , then is nonstationary in . For each such , let be a Skolemized structure on witnessing the nonstationarity of in . So whenever is defined, and whenever is a set such that and , then .
Fix a regular , and let
[TABLE]
where
[TABLE]
Fix a such that , and ; this is possible by Fact 3.1. Set ; then by Fact 3.1, is also in . Also notice that
[TABLE]
because .
Now fix a countable such that and . Set . Then:
- (1)
Because and , and because is Skolemized, it follows that . Moreover, , because and . Hence is defined. 2. (2)
, by Fact 3.1. 3. (3)
Since and , is an element of . It follows that .
We claim that , which will be a contradiction. For the nontrivial direction (), notice that an arbitrary element of has the form for some -Skolem function and some parameter , and moreover . Now and are both elements of , and ; hence . So , completing the proof.
∎
Corollary 3.3**.**
For any regular and any Skolemized structure on , there are (at least) projective stationarily many such that, for some , .
Proof.
By Lemma 3.2, there are projective stationarily many such that for stationarily many , and . Fix such an and and set . Then , and because is definable from we have . Since , in particular , and hence too. ∎
Can we replace “projective stationarily many” with “club-many” in the conclusions of the previous results? Consistently, yes; but it has large cardinal strength. This leads us into a hierarchy of Strong Chang’s Conjectures discussed in Section 4.
Recall from Section 1.3 that given a maximal antichain in , and a countable , we say that catches if there is some such that and (again, by we really mean the equivalence class of is in ).
Lemma 3.4** (Feng-Jech [MR1668171]).**
Suppose is a maximal antichain in , and is a large regular cardinal. Then there are projective-stationarily many that catch .
Proof.
Let be a stationary subset of . Since is maximal, there is some such that is stationary. Fix any countable with and . Then catches (as witnessed by ), and . ∎
Lemma 3.4, along with an argument resembling the 3 1 direction of the proof of Lemma 2.4, can be used to show that the Strong Reflection Principle (SRP) of [MR1668171] implies that the nonstationary ideal on is saturated. See [MR1668171] for details.
4. Chang’s Conjecture and stationary set reflection
4.1. Local versions of Strong Chang’s Conjecture
Given cardinals , we write
[TABLE]
to mean that for every structure in a countable signature, there is an such that and . We will mainly be interested in instances of the form
[TABLE]
where is an infinite regular cardinal. For example, the classic Chang’s Conjecture, which we’ll abbreviate CC, is the principle
[TABLE]
CC is equiconsistent with an -Erdős cardinal ([MR520190]), and has many combinatorial consequences such as non-existence of Kurepa trees on , and that every is bounded on a stationary set by some canonical function.
It is often convenient to work with more ambient set theory when dealing with Chang’s Conjecture, in which case the following lemma (really a special case of Lemma 2.3) is useful:
Lemma 4.1** (folklore; see e.g [MattHandbook]).**
Let be a regular cardinal. The following are equivalent:
- •
**
- •
For every regular , the set
[TABLE]
is (weakly) stationary.555Recall from Section 2, this means that for every , there exists an in the displayed set that is closed under .
In order to resolve a question of Baumgartner-Taylor [MR654852] about “c.c.c.-indestructible saturation”, Foreman-Magidor-Shelah [MR924672] introduced a stronger form of CC, which we will call Projective CC:
Definition 4.2**.**
Projective CC asserts that “Chang structures” are projective over ; i.e. for every stationary , the set
[TABLE]
is (weakly) stationary.
Projective CC has a characterization analogous to the characterization of CC in Lemma 4.1. Section 4.7 will review some results of Foreman-Magidor-Shelah [MR924672] and P. Larson, showing that Projective CC amplifies the saturation properties (if any exist) of the nonstationary ideal on .
Other strong variants of CC have appeared in the literature, with inconsistent terminology and notation (see Table 1 in [Cox_Nonreasonable] for a comparison). We introduce several forms of “Strong” CC. In order for this to be applicable to the Foreman-Magidor results in Section 5, we state them in a general form which make sense at higher cardinals. In what follows,
[TABLE]
For , is essentially the same (mod NS) as what is usually denoted , but for they can consistently differ; the point is that the set does not include “Chang-type” subsets of . For example, in the case , does not include those such that but . One reason for using instead of on some occasions is that the notions of weak and strong stationarity coincide for subsets of (though not necessarily for subsets of ; see Feng [MR946635]).
We first define some “local” versions of Strong Chang’s Conjecture.
Definition 4.3** (local versions of Strong Chang’s Conjecture).**
Let be a regular uncountable cardinal. We define the principles , , , and in parallel. They assert (respectively) that for all sufficiently large regular and all wellorders on and all such that : letting
[TABLE]
we have:
- •
: there exists an such that .
- •
: there are cofinally many such that there exists an such that .
- •
: there are cofinally many such that there exists an such that , and .
- •
: there exist , in such that and are -incomparable (i.e., neither is a subset of the other).
Convention: If the is not specified, it is intended to be ; e.g., SCC means .
For example, in the case , SCC (i.e. ) asserts that for all large regular and all wellorders on and all countable , there is an such that , , but includes some ordinal in . By the discussion in the introduction, such an ordinal is necessarily in the interval \big{[}\text{sup}(M\cap\omega_{2}),\omega_{2}\big{)}.
For , all of the variants in Definition 4.3 are consistent relative to a measurable cardinal.666Cox [Cox_Nonreasonable] proves that if there is a normal ideal on whose quotient forcing is proper—as is the case in when is measurable in (see [MR560220])—then holds. For , they all turn out to be inconsistent, though the (inconsistent) principle turns out to be a useful intermediary in other inconsistency proofs (this is due to Foreman-Magidor [MR1359154]; see Section 5).
The following lemma provides a useful characterization of the principle , by basically allowing one to turn a single counterexample into stationarily many. We omit the proof, and refer the reader to the proof of Lemma 13 of [Cox_Nonreasonable].
Lemma 4.4**.**
For a regular , is equivalent to the assertion that for all but nonstationarily many , there is an such that , , and .
We note that SCC and CC have more similar characterizations than might first be apparent. Let us call a set a Chang set if and . Then CC holds iff (for every large ) there are stationarily many that can be -extended to a Chang elementary substructure of ; while SCC holds iff there are club many such .
The following implications are straightforward (see Cox-Sakai [Cox_Sakai_SCC]):
[TABLE]
It is known that the implication is not reversible (Cox [Cox_Nonreasonable]). It is open whether any of the implications between and SCC are reversible; it is even open whether the implication is reversible. Those questions are related to Conjecture 4.8 below.
Regarding the remaining implications from (4), Todorcevic [MR1261218] observed that SCC implies that every stationary subset of reflects to an ordinal in the interval . Such a reflection property fails after adding a Cohen real , because Gitik [MR820120] proved that is stationary in in . And cannot reflect to any ordinal , because contains a club (just fix any -length filtration of in ). In short, SCC fails after adding a Cohen real. The following lemma (a slight extension of the well-known theorem that CC is preserved by c.c.c. forcing) shows that, on the other hand, Projective CC is preserved by such forcing:
Lemma 4.5**.**
Projective CC is preserved by c.c.c. forcing.
Proof.
Suppose is c.c.c., is a -name for a function from , and is a -name for a stationary subset of . Let be a condition. Since preserves , there are stationarily many such that some condition below forces . Let denote this stationary set; by Projective CC there is an such that . Let be generic with . Then and is closed under . Since was c.c.c., is a master condition for every elementary submodel (countable or otherwise), in particular for . So . So and . ∎
So the implication from SCC to Projective CC is not reversible, because the latter is preserved by adding a Cohen real but the former is not. Finally, Projective CC is known to have strictly higher consistency strength than CC (see Sharpe-Welch [MR2817562]).
The reversibility of the remaining implications in (4) are all open, but the following theorems may be relevant. Shelah proved an interesting characterization of :
Theorem 4.6** (Shelah).**
The following are equivalent:
- (1)
. 2. (2)
Namba forcing is semiproper. 3. (3)
There exists some semiproper poset that forces .
Most of the implications of Theorem 4.6 are proven in Chapter XII of Shelah [MR1623206]; for the proof that implies semiproperness of Namba forcing, see Section 3 of Doebler [MR3065118].
Cox and Sakai proved a characterization of that closely mimics Shelah’s Theorem 4.6:
Theorem 4.7** (Cox-Sakai [Cox_Sakai_SCC]).**
The following are equivalent:
- (1)
** 2. (2)
The poset that adds a Cohen real, then shoots a club through with countable conditions, is semiproper. 3. (3)
There exists some semiproper poset that forces to be nonstationary.
In light of Shelah’s Theorem 4.6 and the Cox-Sakai Theorem 4.7, we make the following conjecture:
Conjecture 4.8**.**
The implication is not reversible.
4.2. Global versions of Strong Chang’s Conjecture
We now introduce “global” versions of and , because they are (respectively) equivalent to reflection principles. The principles Global and Global were introduced by Doebler-Schindler [MR2576698] and Fuchino-Usuba [FuchinoUsuba], respectively (but under different names). Unlike Definition 4.3 we will only need the version for . Note also the similarity of the following definition with Lemma 3.2.
Definition 4.9** (“Global” versions of Strong Chang’s Conjecture).**
We define “global” versions of and . They assert (respectively) that for all sufficiently large regular and all wellorders on and all countable :
- •
: the set
[TABLE]
is -cofinal in .
- •
: the set
[TABLE]
is -cofinal in .
The Global versions easily imply the versions from Definition 4.3. For example, if Global holds, and is countable, then given any we can use the Global assumption to find a such that and . It follows that , and
[TABLE]
Hence is the end-extension of required by .
Each principle in Definition 4.9 is equivalent to a kind of global stationary reflection principle, as described in the next section.
4.3. Relationship with Stationary reflection principles
The following kind of stationary set reflection (in the case ) was introduced by Beaudoin [MR877870] and Foreman-Magidor-Shelah [MR924672]:
Definition 4.10**.**
For a regular uncountable cardinal , the principle \text{WRP}\big{(}\wp^{*}_{\mu}\big{)} asserts that for every regular and every stationary , there is an such that is stationary.
Convention: The unadorned version is understood to mean the version where ; i.e. WRP means .
So, for example, WRP (i.e. ) means that for every regular and every stationary , there is a such that and is stationary in .
Theorem 4.11**.**
Let be a regular uncountable cardinal. The principle \text{WRP}\big{(}\wp^{*}_{\mu}\big{)} implies .
Proof.
Suppose toward a contradiction that fails; then by Lemma 4.4, there is a stationary such that for all , there is no (using the notation from Definition 4.3) such that properly extends below .
By there is a such that is stationary in . Fix such a for the remainder of the proof. Since is stationary in , by Lemma 2.3 there is an such that
[TABLE]
where denotes the hull of in the structure (where is any wellorder of ). In particular, since , it follows that ,777This is where we needed to know that had transitive intersection with ; i.e. why we require that the reflecting set is in rather than just in . So . But also , and is at least as large as , because . Hence properly end extends below . This contradicts that .
Then, letting , we have a contradiction to the fact that . ∎
Theorem 4.11 actually follows from a weaker assumption (see Theorem 4.13 below), but we chose to sketch the proof of Theorem 4.11 under non-optimal hypotheses, for a couple of reasons. Firstly, it is all that we need for its main application in Section 5. Secondly, it highlights what the author considers to be an interesting open problem. Notice that (in the case , for simplicity) the proof actually shows that WRP implies that for every large regular and almost every , there is a such that . This seems awfully close to getting Global , but in order to obtain the latter, one seems to need that the from the proof is also an element of , so that any purported bound on (using the notation from Definition 4.9) would be an element of , and hence would be beyond this bound, leading to a contradiction. But it is not clear that we can arrange that from WRP alone. This was the apparent motivation of the principle introduced by Fuchino-Usuba [FuchinoUsuba] (though under a different name); this principle asserts that for all regular and all stationary , there is a such that —not merely —is stationary in . Fuchino and Usuba proved:
Theorem 4.12** (Fuchino-Usuba [FuchinoUsuba]).**
[TABLE]
Now clearly , but whether this implication is actually an equivalence is open. More details on these and related problems can be found in Cox [Cox_RP_IS].
We mentioned above that the assumptions of Theorem 4.11 were not optimal. The optimal result is due to Doebler and Schindler, and involves the Semistationary Set Reflection Principle (SSR), which is weaker than WRP, but still quite strong:
Theorem 4.13** (Doebler-Schindler [MR2576698]).**
[TABLE]
They also obtained several other interesting statements that are also equivalent to Global , e.g. the assertion (famously introduced in [MR924672]) that every -stationary set preserving forcing is semiproper.
4.4. Strong Chang’s Conjecture and the Tree Property
The principle and its global version found applications in recent work of Torres-Pérez and Wu. The principle asserts that there are no -Aronszajn trees. The principle is a strengthening of introduced by Weiss [Weiss_CombEssence], whose definition we will not give here.
Theorem 4.14** (Torres-Pérez and Wu).**
Assume that the Continuum Hypothesis (CH) fails. Then:
- (a)
* implies ([MR3431031]).* 2. (b)
Global implies ([MR3600760]).
The assumption that CH fails in Theorem 4.14 cannot be removed, since Global is consistent with CH, and CH implies failure of and .
Todorcevic [MR1261218] proved that SCC implies every stationary subset of reflects to a set of size (this is a local fragment of ). So in light of Theorem 4.14, the following question from [MR3431031] is a natural one:
Question 4.15**.**
Suppose CH fails and every stationary subset of reflects to a set of size . Must hold?
4.5. WRP and presaturation
We now return, yet again, to the notion of antichain catching introduced in Section 1.3. We say that is presaturated iff whenever is an -sequence of maximal antichains in , there are densely many (i.e. densely many stationary sets in the boolean algebra ) such that for every , is compatible with at most many members of . Presaturation suffices for many of the applications of saturation; in particular, presaturation yields “generic almost huge embeddings” (see [MattHandbook]).
The following theorem is not optimal; the weaker Semistationary Reflection Principle suffices instead of WRP. But the idea is similar.
Theorem 4.16** ([MR924672]).**
WRP implies that is presaturated.
Proof.
Assume WRP. We need an end-extension claim.
Claim 4.16.1**.**
For every maximal antichain , every sufficiently large regular , and every wellorder on : whenever , can be -extended to a countable elementary substructure of that catches .
Equivalently: there is an such that and
[TABLE]
Proof.
(of Claim 4.16.1). Let be a maximal antichain, and suppose the claim fails. Then Lemma 2.3 can be used to show there are stationarily many (for some large ) for which it fails. Let denote this stationary set. By WRP, there is a such that is stationary in . Fix a filtration
[TABLE]
of . Then
[TABLE]
Since is a maximal antichain, there is some such that is stationary. Then
[TABLE]
Then by Lemma 2.3, there is an such that
[TABLE]
Hence, letting , we have and . So witnesses that catches . ∎
Now assume is an -sequence of maximal antichains. Let be a stationary subset of ; we need to find a stationary subset of such that for each , the subset is compatible with at most many members of .
Repeated application of Claim 4.16.1 -many times easily yields:
Claim 4.16.2**.**
Fix a large regular . Then
[TABLE]
is stationary.
Let denote the stationary subset of given by Claim 4.16.2. By WRP, reflects to some such that . Let be a filtration of . Then
[TABLE]
is a stationary subset of . The following claim will finish the proof (this is yet another proof that resembles the 3 1 direction of Lemma 2.4):
Claim 4.16.3**.**
For every ,
[TABLE]
Proof.
(of Claim 4.16.3): Suppose for a contradiction that for some and some , is stationary. Then
[TABLE]
is a stationary subset of . By Lemma 2.3, there is an such that
[TABLE]
Now since , catches ; so fix some witnessing this. Note that because but . Let . Then, in particular, . But and are both elements of , and are distinct members of the antichain , so is a nonstationary element of . Since , this contradicts Lemma 2.1. ∎
∎
4.6. Forcing properties of sealing forcings
Given a maximal antichain , the sealing forcing for (defined by Foreman-Magidor-Shelah [MR924672]) is the poset followed by shooting a club (using initial segments) through the diagonal union of . An equivalent way to represent this forcing is as the set of all pairs such that:
- •
for some ;
- •
is a closed, bounded subset of such that
[TABLE]
A condition is stronger than iff and end-extends .
We will let denote this poset. Foreman-Magidor-Shelah [MR924672] proved that always preserves stationary subsets of ; this was used in the proof that MM implies saturation of .
If is semiproper for every maximal antichain , then is presaturated; the argument is similar to the proof that WRP (or even SSR) implies presaturation.
When can be proper? Certainly if it is easy to see that is proper (in fact, equivalent to a -closed forcng). M. Eskew asked the author if could ever be proper when . It cannot; in fact:
Lemma 4.17**.**
Let be a maximal antichain in . The following are equivalent:
- (1)
. 2. (2)
* is forcing equivalent to a -closed poset.* 3. (3)
* is a proper forcing.*
Proof.
The implication 1 2 is straightforward, and left to the reader. The implication 2 3 is trivial.
For the 3 1 direction: suppose is proper. The sealing forcing is always -distributive; so in fact is totally proper. In other words, for all large regular and all countable , every condition in can be extended to a condition whose upward closure generates an -generic filter (i.e. a filter that meets whenever and is dense). We will call such a condition a totally generic condition for . See Abraham [MR2768684] for these basic facts about these notions.
Fix any such , and let be a totally generic condition for . An easy density argument yields that , and is a limit point, and hence element, of the closed set . Then by the definition of what it means to be a condition, there is some such that . Now , and hence ; so catches .
Since was arbitrary, this shows that club-many catch . By the same argument as the (3) (1) direction of the proof of Lemma 2.4, must have cardinality . ∎
4.7. Projective CC and saturation of the nonstationary ideal
In this section we return to the notion “Projective CC” introduced earlier, and present two results—the older Theorem 4.18 and the newer Theorem 4.21—that demonstrate how Projective CC amplifies saturation properties of the nonstationary ideal on .
Theorem 4.18** (Foreman-Magidor-Shelah [MR924672]).**
Suppose is saturated, and Projective CC holds. Then the saturation of is “c.c.c.-indestructible”; i.e. every c.c.c. forcing extension satisfies that is saturated.
To prove Theorem 4.18, we will need the following special case of Foreman’s Duality Theorem (this special case was originally proved independently by Kakuda and Magidor; see Corollary 7.17 of [MattHandbook]):
Theorem 4.19**.**
Suppose is saturated and is c.c.c. Let be the -name for the generic ultrapower embedding. If forces that is -cc in the generic extension of by , then
[TABLE]
We now return to the proof of the Foreman-Magidor-Shelah Theorem 4.18:
Proof.
Let be c.c.c. By Theorem 4.19, it suffices to show that forces that is -cc. Suppose toward a contradiction that is a stationary subset of , is a -name, and
[TABLE]
By Projective CC, there is an
[TABLE]
such that and . Let be the inverse of the transitive collapsing map of , and let . Let ; note . Since is saturated, catches all of its antichains; this is similar to the argument of the (1) implies (2) direction of Lemma 2.4. It follows that
[TABLE]
is generic over for \sigma^{-1}\big{(}\wp(\omega_{1})/\text{NS}_{\omega_{1}}\big{)}.
Let be the ultrapower of by ; by standard arguments, the map defined by
[TABLE]
(for any ) is a well-defined, elementary map from , and has the property that .
Now since is generic over , sees the map , and believes that it is a generic ultrapower. Furthermore, since , , and so believes that is an antichain in
[TABLE]
of size . Note that since has ordertype , . So, from the point of view of , is an antichain in that has an enumeration of length . Now although is not an element of , it is a subset of , and distinct conditions from are incompatible in . Then by elementarity of , is a collection of pairwise incompatible elements of . But has size in , contradicting that is c.c.c. ∎
For the next theorem we need to introduce a stronger concept of saturation. Note that if is saturated, then for any -sized collection of stationary subsets of , there is a pair of distinct members of whose intersection is stationary. We say that is -saturated if it satisfies the following stronger requirement: whenever is an -sized collection of stationary subsets of , there is an -sized subcollection such that for every finite , is stationary.
We will make use of the following well-known lemma:
Lemma 4.20**.**
If is saturated, then is a complete boolean algebra.
Proof.
Let be a collection of stationary subsets of , and let be a -maximal antichain contained in . By saturation, . If the cardinality of is exactly , it is routine to show that “the” diagonal union of (using any -length enumeration of ) represents the least upper bound of in . If then the union of serves the same purpose. ∎
If is a collection of stationary subsets of that has a least upper bound in , then we will denote this least upper bound by .
Theorem 4.21** (Larson; cf. Lemma 3.11 of Dow-Tall [MR3744886]; see also Garti et al [GartiEtAl] where a slightly stronger assumption was used).**
Suppose is saturated, and Projective CC holds. Then in fact is -saturated.
Proof.
Let be an -sized collection of stationary subsets of ; fix a one-to-one enumeration of . For each , let
[TABLE]
Such least upper bounds exist by saturation of and Lemma 4.20. Then is a descending sequence mod ; so again by saturation of , it must stabilize; so there is some such that for all . Let ; then
[TABLE]
By Projective CC, there is an
[TABLE]
such that and .
Claim 4.21.1**.**
There -many such that .
Proof.
(of Claim 4.21.1) Note that since , , and is a one-to-one enumeration, it suffices to show that for every such that , there is an above such that . So fix such a . Then by (5),
[TABLE]
Furthermore, since , the boolean sum on the right side of the equation is an element of . is also an element of , by choice of . Hence the set difference
[TABLE]
which is nonstationary by (6), is also an element of . It follows that cannot lie in this set difference. But also , by choice of . Hence
[TABLE]
Since and are elements of , is also an element of . It follows from this and (7) that there is some such that .
∎
Let be the -sized collection of indices from given by Claim 4.21.1. Consider any finite collection from . Then is an element of , and . It follows from Lemma 2.1 that is stationary. ∎
5. What about adjoining objects to uncountable models?
This section is mostly about results of Foreman and Magidor, showing that higher versions of SCC and WRP are inconsistent. We attempt to streamline their proof, while also highlighting the role of (the ulimately inconsistent) principle in their arguments.
5.1. Negative results
The following theorem of Shelah is stated in a slightly unusual form:
Theorem 5.1** (Shelah).**
Suppose is a transitive model, is a cardinal in , exists and is a cardinal in , but is not a cardinal in . Then .
The proof is basically the same as Shelah’s original proof; using that is a model that believes exists, has a strongly almost disjoint, -sized family of subsets of , and this is upward absolute to . Shelah’s argument then shows that cannot have cofinality strictly less than (see Lemma 23.19 of [MR1940513]).
Theorem 5.2** (Foreman-Magidor [MR1359154]).**
There is an such that whenever is closed under , , and is an ordinal in the interval , then is -cofinal.
Proof.
If there were no such , then there would be (weakly) stationarily many such that and is an -cofinal ordinal in . Let denote this stationary set. By Lemma 2.3, there exists a
[TABLE]
such that . Fix such a . Since , then by definition of , it follows that
[TABLE]
Now , but in fact must have ordertype exactly (i.e. no larger than) .888To prove this, consider an arbitrary . Since , there is a surjection with , and hence ; the latter set has cardinality . In short, every proper initial segment of has cardinality, and hence ordertype, .
Let be the inverse of the transitive collapse of . The calculations above regarding ’s trace on imply that
[TABLE]
Theorem 5.1 implies that is -cofinal, contradicting (8). ∎
Corollary 5.3**.**
* is inconsistent. (Recall this notion was defined on page 4.3).*
Proof.
Assume toward a contradiction that holds. Fix a large and a wellorder of , and let be the -least function satisfying the conclusion of Theorem 5.2. Fix an such that and is an -cofinal ordinal in the interval . Using , build a -increasing and continuous chain such that , , , , , and for all . Let be the union of the ’s. Then , , and is an -cofinal ordinal. But and hence is closed under . This contradicts Theorem 5.2. ∎
Corollary 5.3 and Theorem 4.11 imply:
Corollary 5.4** (Foreman-Magidor [MR1359154]).**
The principle \text{WRP}\big{(}\wp^{*}_{\omega_{2}}\big{)} is inconsistent.
5.2. Positive results
While \text{WRP}\big{(}\wp^{*}_{\omega_{2}}\big{)} is always false, a restricted version of it is consistent. Recall the class from Fact 3.1.
Theorem 5.5** (Foreman-Magidor [MR1359154]).**
If is supercompact, then the following statement holds after forcing with the Levy collapse : For every regular and every stationary such that
[TABLE]
there is a such that is stationary in .
6. Open Problem Summary
Here we collect the open problems that were mentioned at various places in the survey:
- (1)
(From Section 4.1): Are any of the following implications reversible?
[TABLE]
The author conjectures that none of the implications are reversible. The question of whether the implication is reversible was also asked by Usuba [MR3248209]. 2. (2)
(From Section 4.3): Does WRP imply ? This is similar to questions of Krueger [MR2674000] (whether WRP implies the principle ) and Beaudoin [MR877870] (whether WRP implies Fleissner’s Axiom R). See Cox [Cox_RP_IS] for more details. 3. (3)
(From Section 4.4): Does plus “every stationary subset of reflects to a set of size ” imply that the Tree Property holds at ? This question also appears in [MR3431031].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1\bibselect ../../../Master Bibliography/Bibliography
