This posting complements a series of talks given at the Set Theory Seminar at BSU from September 12 to October 24, 2008. Here is a list of links to the talks in this series:
- First talk, September 12, 2008.
- Second talk, September 19, 2008.
- Third talk, September 26, 2008.
- Fourth talk, October 3, 2008.
- Fifth talk, October 10, 2008.
- Sixth talk, October 17, 2008.
- Seventh talk, October 24, 2008.
[Version of October 31.]
I’ll use this post to provide some notes about consistency strength of the different natural hierarchies that forcing axioms and their bounded versions suggest. This entry will be updated with some frequency until I more or less feel I don’t have more to add. Feel free to email me additions, suggestions and corrections, or to post them in the comments. In fact, please do.
- The consistency strength of is bounded above by a supercompact cardinal. See Foreman, Magidor, Shelah, Martin’s maximum, saturated ideals, and nonregular ultrafilters. I. Ann. of Math. (2) 127 (1) (1988), 1-47.
- implies that there is a non-domestic premouse. This in turn implies that there is a sharp for an inner model with a proper class of strong cardinals and a proper class of Woodin cardinals. See Jensen, Schimmerling, Schindler, Steel, Stacking mice. The Journal of Symbolic Logic, to appear.
This is significantly stronger than in any forcing extension and that the existence of inner models of containing all the reals.
- is equiconsistent with a reflecting cardinal.
Definition: Let be cardinals, with regular. Then is -reflecting iff for any and any , if there is some regular such that then there are stationarily many with and such that there is some such that , where is the transitive collapse of .
This notion is due to Miyamoto. We say that is reflecting iff it is -reflecting; this relativizes down to ; in fact, being -reflecting relativizes to . A cardinal is supercompact iff it is -reflecting for all .
The proof of the equiconsistency of and reflecting cardinals goes back to Goldstern, Shelah, The bounded proper forcing axiom. The Journal of Symbolic Logic, 60 (1) March 1995, 58-73.
Definition: For any cardinal , let denote the following fragment of : Given any proper and any sequence of predense subsets of with for each , there is a filter meeting all the .
The subscript is for Todorcevic, who seems to have been first to study these fragments systematically. See Todorcevic, Localized reflection and fragments of . In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 58, 2002, 135-148. Notice is .
- is equiconsistent with an -reflecting cardinal .
- (for ) implies for all regular cardinals . For , this already implies the lower bound mentioned above for . For , this implies . See for example Schimmerling, Coherent sequences and threads. Adv. Math. 216 (1) (2007), 89-117.
- is consistent relative to a -reflecting cardinal . This follows from the results in Miyamoto, Localized reflecting cardinals and weak segments of . Preprint, 1996. The same holds with in place of
- On the other hand, seems significantly stronger than . For example, implies that for every set there is an inner model that contains and has a strong cardinal, see Schindler, Bounded Martin’s Maximum and strong cardinals, in: Set theory. Centre de recerca Matematica, Barcelona 2003-4 (Bagaria, Todorcevic, eds.), Basel 2006, 401-406.
- An upper bound for the consistency strength of is Woodin cardinals. This is a result of Woodin, and it is buried somewhere in The Axiom of Determinacy, Forcing Axioms, and the Nonstationary ideal, De Gruyter, 1999; see for instance the arguments on on section 9.2. You can see a proof in Schindler’s talk The role of absoluteness and correctness, Barcelona, 2003 (pages 76-80).
Definition: For any cardinal , let denote restricted to forcings of size at most .
This notation is due to Woodin. I believe is a more useful notion, so one should probably call that one and this one , or something like that.
- is just Martin’s axiom for Cohen forcing. It is equiconsistent with .
- A bit more interestingly, is also equiconsistent with . I heard the rumor that implies , but I remain skeptical. [Update: the claim was withdrawn.]
- Clearly, follows from , so it can be forced over and has consistency strength at most an -reflecting cardinal (also called a -indescribable cardinal). settles the size of the continuum, see Velickovic, Forcing axioms and stationary sets. Adv. Math. 94 (2) (1992), 256-284. This fragment has consistency strength at least a weakly compact (or -indescribable) cardinal.
- Foreman and Larson showed that implies , but their arguments do not even seem to adapt to See Foreman, Larson, Small posets and the continuum. Unpublished note, 2004.
- Woodin has investigated in his book mentioned above, where he shows that it implies the existence of sharps for all subsets of (see section 9.5); this is the first step of an induction showing that implies . Later work of Steel and Zoble has extended this to show that it in fact implies , see Determinacy from strong reflection, preprint, September 16, 2008. Steel and Zoble conjecture that has consistency strength at least Woodin cardinals. Woodin also establishes (in section 9.2 of the book mentioned above) that is an upper bound for the consistency strength of . Recent work of Sargsyan shows that this determinacy hypothesis has strength below a Woodin limit of Woodin cardinals.
- implies .
- implies the lower bound mentioned above of an inner model with a proper class of Woodin cardinals and a proper class of strong cardinals.
Compare the following with the notion of indescribability defined above.
Definition: Let be cardinals. We say that is –subcompact, or that is a –indescribable interval of cardinals, iff for all and formulas , if there is some such that then there is some with , and sets and such that , and there is an elementary embedding with critical point such that .
This notion is due to Neeman and Schimmerling, see their joint paper Hierarchies of forcing axioms I, The Journal of Symbolic Logic, 73 (2008), 343-362, and Neeman, Hierarchies of forcing axioms II, The Journal of Symbolic Logic, 73 (2008), 522-542.
Supercompactness of is equivalent to being -indescribable for all .
Recall that a poset is –linked iff is the union of compatible sets. This of course holds if , and it of course implies that is -cc.
Definition: is the assertion that holds restricted to -linked posets.
- and are equiconsistent with the existence of a such that is a -indescribable interval of cardinals. We also say that is -indescribable, and this notion relativizes to .
- More generally, the existence of a such that is -indescribable is an upper bound for the consistency strength of . For Neeman has shown that this is quite close to an equiconsistency. It is possible that the equiconsistency holds for all , and once inner model theory is developed at the appropriate level, we will be able to prove this. For , this upper bound falls beyond the upper bound for mentioned above.
- One can generalize the notions above to include -indescribability for all (see the Neeman, Schimmerling paper for details). A cardinal with a -indescribable interval is an upper bound for the consistency strength of .
Index of talks: