On supercompactness of $\omega_1$
Daisuke Ikegami, Nam Trang

TL;DR
This paper explores the implications of $oldsymbol{ ext{supercompactness of }oldsymbol{ ext{$oldsymbol{ ext{omega}_1}$}}}$ under $ ext{ZF}$, revealing connections to choice principles, determinacy axioms, and regularity properties of sets.
Contribution
It establishes new links between supercompactness of $ ext{omega}_1$, choice axioms, determinacy, and regularity properties, under $ ext{ZF}$ without the Axiom of Choice.
Findings
$ ext{DC}$ follows from $ ext{omega}_1$ is supercompact
$ ext{AD}^+$ is equivalent to $ ext{AD}_ ext{R}$ under supercompactness
Supercompactness implies all sets in the Chang model have regularity properties
Abstract
This paper studies structural consequences of supercompactness of under . We show that the Axiom of Dependent Choice follows from " is supercompact". " is supercompact" also implies that , a strengthening of the Axiom of Determinacy , is equivalent to . It is shown that " is supercompact" does not imply . The most one can hope for is Suslin co-Suslin determinacy. We show that this follows from " is supercompact" and Hod Pair Capturing , an inner-model theoretic hypothesis that imposes certain smallness conditions on the universe of sets. " is supercompact" on its own implies that every Suslin co-Suslin set is the projection of a determined (in fact, homogenously Suslin) set. " is supercompact" also implies all sets in the Chang model…
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
TopicsEconomic theories and models · Advanced Topology and Set Theory · Economic Theory and Institutions
\tocauthor
Daisuke Ikegami and Nam Trang 11institutetext: SIT Research Laboratories, Shibaura Institute of Technology,
3-7-5 Toyosu Koto-ward, Tokyo 135-8548, JAPAN,
11email: [email protected],
WWW home page: http://www.sic.shibaura-it.ac.jp/~ikegami/ 22institutetext: Department of Mathematics, University of North Texas,
1155 Union Circle #311430, Denton, TX 76203-5017, USA,
22email: [email protected],
WWW home page: http://www.math.unt.edu/~ntrang/
On supercompactness of
Daisuke Ikegami 11
Nam Trang 22
Abstract
This paper studies structural consequences of supercompactness of under . We show that the Axiom of Dependent Choice follows from “ is supercompact”. “ is supercompact” also implies that , a strengthening of the Axiom of Determinacy , is equivalent to . It is shown that “ is supercompact” does not imply . The most one can hope for is Suslin co-Suslin determinacy. We show that this follows from “ is supercompact” and Hod Pair Capturing , an inner-model theoretic hypothesis that imposes certain smallness conditions on the universe of sets. “ is supercompact” on its own implies that every Suslin co-Suslin set is the projection of a determined (in fact, homogenously Suslin) set. “ is supercompact” also implies all sets in the Chang model have all the usual regularity properties, like Lebesgue measurability and the Baire property.
Mathematics Subject Classification: 03E55\ \cdot\03E60\ \cdot\03E45
keywords:
Large cardinal properties, supercompactness, , Axiom of Determinacy
1 Introduction
Under , successor cardinals (like ) are “small”. If is a successor cardinal, then there is an injection from into .111This is equivalent to “there is a surjection from onto ” under . Without the Axiom of Choice, the equivalence can fail. Without the Axiom of Choice, it is possible for successor cardinals like to exhibit large cardinal properties. For instance, it has been known since the 1960’s that can be measurable under ; this in particular implies that is regular and there is no injection of into . We believe this result is independently due to Jech ([3]) and Takeuti ([13]). Furthermore, Takeuti, in the same paper [13], is able to show that “ is supercompact” is consistent relative to “ there is a supercompact cardinal”. The Takeuti model in which is supercompact is essentially the Solovay’s model. Suppose holds and there is a supercompact cardinal. Let be a supercompact cardinal. Let be -generic for the collapse forcing. Let . Then Takeuti’s model is the symmetric model .
Another major development started in the 1960’s in set theory concerns the theory of infinite games with perfect information. The Axiom of Determinacy asserts that in an infinite game where players take turns to play integers, one of the players has a winning strategy (see the next section for more detailed discussions on and its variations). It is well-known that contradicts the Axiom of Choice. Solovay has shown that implies is measurable and implies that there is a supercompact (countably complete, normal, fine) measure on . Structural consequences of have been extensively investigated, most notably by the Cabal seminar members. Through work of Harrington, Kechris, Neeman, Woodin amongst others, we know that is -supercompact for every ordinal under , a strengthening of . By [17], and cannot imply is supercompact. Woodin (see below) shows that is consistent with “ is supercompact.”
It can be shown that the theories “ is measurable” is equiconsistent with “ there is a measurable cardinal”. The question of whether “ is supercompact” is equiconsistent with “ there is a supercompact cardinal” is much more subtle. Woodin, in an unpublished work in the 1990’s, is able to show that the former is much weaker than the latter. Woodin’s model is a variation of the Chang model. For each , let be the club filter on . Woodin’s model is defined as
\mathcal{C}^{+}=\rm{L}$$(\bigcup_{\lambda\in Ord}\lambda^{\omega})[\langle\mathcal{F}_{\lambda}:\lambda\in Ord\rangle].222The Chang model is defined as .
Woodin shows that if there is a proper class of Woodin cardinals which are limits of Woodin cardinals, then satisfies the and is supercompact. We note that in Takeuti’s model, fails.333This gives a proof that does not imply “ is supercompact”. Suppose not. Letting be a set in that codes , then is in for some real . This is a consequence of . However, there is some such that , where is the restriction of to . In , is a limit of measurable cardinals and codes , so if A\in\rm{L}$$[x], then \rm{L}$$[x]\vDash “there is a measurable cardinal”. This is impossible.
The theory “ is supercompact” and variations of Woodin’s model are intimately related to determinacy theory as well as modern developments in descriptive inner model theory, cf. [8, Conjecture 1.8]. The following conjecture captures some of these relationships and is an important test question for the future development of descriptive inner model theory and the core model induction.
Conjecture 1.1**.**
The following theories are equiconsistent.
- (i)
* is supercompact.* 2. (ii)
* is supercompact.* 3. (iii)
* there is a Woodin cardinal which is a limit of Woodin cardinals.*
[17], [15], [16] made some progress in resolving the conjecture by exploring consistency strength and structural consequences of various fragments of supercompactness of .
This paper studies structural consequences of (full) supercompactness of under . We first show the following basic structural consequences.
Theorem 1.2**.**
Assume that is supercompact. Then
the Axiom of Dependent Choices (DC) holds, while 2. 2.
there is no injection from to .
The useful fact that holds can be used to derive other determinacy-like consequences such as:
Theorem 1.3**.**
Assume is supercompact. Then every tree is weakly homogeneous.
Theorem 1.4**.**
Assume is supercompact and Hod Pair Capturing (HPC). Then for any such that is Suslin co-Suslin, is determined.
See Section 7 for more detailed discussions on the hypothesis . Under “ is supercompact”, we also show that and are equivalent.
Theorem 1.5**.**
Assume is supercompact. Then the following theories are equivalent:
. 2. 2.
.
“ is supercompact” also implies a large collection of sets of reals are determined ([17]) and perhaps an even larger collection of sets of reals admit -Borel representations.
Theorem 1.6**.**
Assume that is supercompact. Then every subset of in the Chang model is -Borel.
The paper is organized as follows. Section 2 summarizes basic concepts and definitions used in this paper. In Section 3, we prove Theorem 1.2. The proof of Theorem 1.6 is given in Section 4. In Section 5, we prove Theorem 1.3. Section 6 introduces the notion of the envelope of a pointclass and proves Theorem 1.5. Finally, Section 7 explains and proves Theorem 1.4.
Acknowledgement. We would like to thank Hugh Woodin for communicating his insights on this subject as well as his results concerning the model . The first author would like to thank the Japan Society for the Promotion of Science (JSPS) for its generous support through the grant with JSPS KAKENHI Grant Number 15K17586. The second author would like to thank the National Science Foundation (NSF) for its generous support through Grants DMS-1565808 and DMS-1849295.
2 Definitions and basic concepts
Throughout this paper, we work in ZF without the Axiom of Choice. For a nonempty set , the axiom states that for any relation on such that for any element of there is an element of with , there is a function such that for all natural numbers , \bigl{(}f(n),f(n+1)\bigr{)}\in R. The Axiom of Dependent Choices (DC) states that for any nonempty set , holds.
For a set , denotes the set of all finite sequences of elements of , and denotes the set of all functions from to . In particular, denotes the set of all function from to , not an ordinal or a cardinal. For a set , we often consider as a topological space whose basic open sets are of the form for . For a set and an infinite cardinal , let be the set of all subsets of such that is well-orderable and its cardinality is less than .
Let us review some basic terminology on filters. For a set , a filter on is a collection of subsets of closed under supersets and finite intersections. A filter on is -complete if it is closed under countable intersections. A filter on is non-trivial if the empty set does not belong to the filter. A filter on is an ultrafilter (or a measure) if it is non-trivial and for any subset of , either or is in the filter. Given a formula and an ultrafilter on , if the set is in , then we say “for -measure one many , holds”.
Let us introduce fineness and normality of ultrafilters on . An ultrafilter on is fine if for any element of , for -measure one many , is in . An ultrafilter on is normal if for any set in and with for all , there is an such that for -measure one many in , . Notice that this definition of normality is equivalent to the closure under diagonal intersections in ZF while it may not be equivalent to the standard definition of normality with regressive functions without the axiom of choice. An ultrafilter on is a fine measure on if it is -complete and fine. A fine measure on is a normal measure on if it is normal.
We now introduce the main definitions of this paper:
Definition 2.1**.**
Let be an infinte cardinal.
Let be a set.
- (a)
* is -strongly compact if there is a fine measure on .* 2. (b)
* is -supercompact if there is a normal measure on .* 2. 2.
* is strongly compact if for any set , is -strongly compact.* 3. 3.
* is supercompact if for any set , is -supercompact.*
We now review basic notions on determinacy axioms. For a nonempty set , the Axiom of Determinacy in () states that for any subset of , in the Gale-Stewart game with the payoff set , one of the players must have a winning strategy. We write AD for . The ordinal is defined as the supremum of ordinals which are sujrctive images of . Under ZF+AD, is very big, e.g., it is a limit of measurable cardinals wile under ZFC, is equal to the successor cardinal of the continuum . The Ordinal Determinacy states that for any , any continuous function , in the Gale-Stewart game with the payoff set , one of the players must have a winning strategy. In particular, Ordinal Determinacy implies AD while it is still open whether the converse holds under ZF+DC.
We will introduce the notion of -Borel codes. Before that, we review some terminology on trees. Given a set , a tree on is a collection of finite sequences of elements of closed under subsequences. Given an element of , denotes its length, i.e., the domain or the cardinality of . Given a tree on and elements and of , is an immediate successor of in if is a supersequence of and . Given a tree on and an element of , denotes the collection of all immediate successors of in . An element of a tree on is terminal if . For an element of a tree on , denotes the collection of all terminal elements of . Given a tree on , denotes the collection of all such that for all natural numbers , is in . A tree on is well-founded if . We often identify a tree on with a subset of the set , and denotes the collection of all such that there is a with .
Definition 2.2**.**
Let be a non-zero ordinal.
An -Borel code in is a pair where is a well-founded tree on some ordinal , and is a function from to . 2. 2.
Given an -Borel code in , to each element of , we assign a subset of by induction on using the well-foundedness of the tree as follows:
- (a)
If is a terminal element of , let be the basic open set in . 2. (b)
If is a singleton of the form , let be the complement of . 3. (c)
If has more than one element, then let be the union of all set of the form where is in .
We write for . 3. 3.
A subset of is -Borel if there is an -Borel code in such that .
Usually, we use -Borel codes and -Borel sets only in the spaces or . We use them for general spaces in Secion 4.
In section 4, we will use the following characterization of -Borelness in the space :
Fact 1**.**
Let be a subset of Then the following are equivalent:
* is -Borel,* 2. 2.
* is -Borel as a subset of , and* 3. 3.
for some formula and some set of ordinals, for all elements of , is in if and only if .
We now introduce the axiom , and reivew some notions on Suslin sets. The axiom states that (a) holds, (b) Ordinal Determinacy holds, and (c) every subset of is -Borel. Since demands Ordinal Determinacy, implies while it is open whether the converse holds in ZF+DC. A subset of (ot ) is Suslin if there are some ordinal and a tree on respectively) such that . is co-Suslin if the complement of is Suslin. An infinite cardinal is a Suslin cardinal if there is a subset of () such that there is a tree on () such that while there are no and a tree on () such that . Under ZF+, is equivalent to the assertion that Suslin cardinals are closed below in the order topology of .
3 Choice principles and supercompactness of
In this section, we prove Theorem 1.2.
Proof 3.1** (Theorem 1.2).**
1. Let be any nonempty set and be any relation on such that for any there is a such that . We will show that there is a function such that for all natural numbers , \bigl{(}f(n),f(n+1)\bigr{)}\in R.
Since is supercompact, there is a fine normal measure on . We fix such a measure .
Claim 2**.**
For -measure one many elements of , the following holds:
[TABLE]
Proof 3.2** (Claim 2).**
Suppose not. We will derive a contradiction using . Since is an ultrafilter on , for -measure one many elements of , the following holds:
[TABLE]
By normality of , there is an such that for -measure one many elements of with , for all , .
On the other hand, by the assumption on , there is a such that . By fineness of , for -measure one many elements of , both and are elements of .
Since is a filter, for -measure one many elements of with , for all , while both and are elements of and . This gives us both and , a contradiction. This finishes the proof of the claim. ∎
We now know that for -measure one many elements of , the following holds:
[TABLE]
Let us pick such a . Then for any , there is a such that . Since is an element of , it is countable, so we can fix a surjection . Using this , the above property of , and the well-orderedness of , one can easily construct a desired . This finishes the proof of 1..
2. Suppose that there was an injection . We will derive a contradiction using supercompactness of . For each , we write for .
We first note that there is a non-principal -complete ultrafilter on , i.e., is measurable. Since is supercompact, we can fix a fine normal measure on . Let be as follows:
[TABLE]
Then it is easy to see that is a non-principal -complete ultrafilter on .
Using this , we will derive a contradiction as follows. Since is an ultrafilter on , for any natural number , there is an such that the set is of -measure one. Since is -complete, the set is of -measure one. By the property of each , for any in , for all natural numbers , . But since is injective, has at most one element. This contradicts that is of -measure one and is non-principal. This finishes the proof of 2.. This completes the proof of Theorem 1.2. ∎
Remark 3.3**.**
(2) of Theorem 1.2 is the best one can hope for. “ is supercompact” does not imply “there is no injection ”. To see this, assume and there is a supercompact cardinal . Let be an injection in . Let be the Takeuti model defined at . Then clearly and in , and .
4 Chang model and supercompactness of
In this section, we prove Theorem 1.6. As a corollary, one can obtain usual regularity properties for sets of reals in the Chang model:
Corollary 4.1**.**
Assume that is supercompact. Then every subset of in the Chang model is Lebesgue measurable and has the Baire property.
Corollary 4.1 directly follows from Theorem 1.2, Theorem 1.6, and the following fact:
Fact 3** (Essentially Solovay).**
Assume that there is no injection from to . Let be a subset of which is -Borel. Then is Lebesgue measurable and has the Baire property.
For the proof of Fact 3, one can refer to e.g., [1, Theorem 2.4.2 & Proposition 3.2.13].
To prove Theorem 1.6, we prepare some definitions and lemmas. Given a set , let be the rudimental closure of .
Definition 4.2**.**
Let be the following sequence:
, 2. 2.
, and 3. 3.
* when is a limit ordinal.*
Set .
Lemma 4.3**.**
. 2. 2.
* is in .* 3. 3.
For any set in the Chang model, there is an ordinal such that is in .
Proof 4.4** (Lemma 4.3).**
For 1., it is easy to see that is contained in the Chang model because the construction of the sequence is absolute between the Chang model and . So it is enough to prove that contains the Chang model. For that it is enough to show that is an inner model of ZF containing all sets in . By the construction of , it is easy to see that contains all the sets in , rudimentarily closed, satisfies Comprehension Scheme, and for any subset of in , there is a set in such that (namely for some big ). Therefore, is an inner model of ZF containing all the sets in , as desired.
For 2., it is enough to see that the construction of the sequence is absolute between and , which follows by observing that is in .
For 3., let be any set in the Chang model. By 1., is in and hence there is an ordinal such that is in . By 2., is in . Therefore, is in , as desired. This completes the proof of Lemma 4.3. ∎
By item 3. of Lemma 4.3, to obtain Theorem 1.6, it is enough to prove that for all , every subset of in is -Borel.
Throughout this section, we fix a non-zero ordinal and a fine measure on . We will show that every subset of in is -Borel using .
By Fact 1, it is enough to show the following:
() For any subset of in , there are some formula and a set of ordinals such that for all elements of ,
[TABLE]
If () holds for all elements of , then we say that is defined from the pair and we write for .
The following is the key lemma in this section:
Lemma 4.5**.**
There is a function which is OD from such that
* is defined for all pairs where is a formula and is a set of ordinals,* 2. 2.
* is of the form such that if is a subset of defined from , then is defined from , i.e., if , then .*
To prove Lemma 4.5, we use a variant of Vopnka algebra: Let be a set of ordinals and be an element of . We fix an injection which is OD from and such that for all , where . Set . For , if . For an element of , set .
Fact 4** (Vopnka).**
In , is a complete Boolean algebra, and 2. 2.
for any element of , is -generic over , and is in , which is a subclass of .
Towards a proof of Lemma 4.5, let us fix a fine measure on . For each , let and . We will consider the ultraproducts for . Using the finness of , one can prove Łos’ theorem for these ultraproducts (the proof is essentially the same as the one given in [14, Lemma 2.3]). By DC, the above ultraproducts are all well-founded and we identify them with their transitive collapses. Set and .
We are now ready to prove Lemma 4.5.
Proof 4.6** (Lemma 4.5).**
For simplicity, we will assume (the general case is treated in the same way). Let be defined from , i.e., . Then for all ,
[TABLE]
The first equivalence follows from the assumption that is defined from . The second equivalence follows from the fineness of . The forward direction of the third equivalence follows from the property of the Vopnka algebra given in Fact 4. The backward direction of the third equivalence follows from the fact that is countable in because is countable by the fact that is well-orderable in and is countable in , and is a transitive model of ZFC. The fourth & fifth equivalences follow from Łos’ theorem for the ultraproduct and the definitons of and .
Now let be the set of ordinals simply coding and , and be the formula stating ``\Bigl{(}\exists p\in\text{Coll}\bigl{(}\omega,|\mathcal{P}(Q_{\infty})|\bigr{)}\Bigr{)}\ p\Vdash(\exists y)\ (\check{x},y)\in B_{(\phi,S_{\infty})}". Then be as desired by the above equivalences. This completes the proof of Lemma 4.5. ∎
We shall prove () above which gives us Theorem 1.6. The idea is to look at the hierarchy \bigl{(}\mathrm{L}_{\alpha}(\lambda^{\omega})\mid\alpha\in\text{Ord}\bigr{)}, and by induction on , to each definition of an element of , we assign certain and such that is defined from . We fix an from Lemma 4.5.
Definition 4.7**.**
The hierarchy \bigl{(}\mathrm{L}_{\alpha}(\lambda^{\omega})\mid\alpha\in\text{Ord}\bigr{)} is defined as follows:
\mathrm{L}_{0}(\lambda^{\omega})=\text{ the transitive closure of \lambda^{\omega}}, 2. 2.
\mathrm{L}_{\alpha+1}(\lambda^{\omega})=\text{Def}\ \bigl{(}\mathrm{L}_{\alpha}(\lambda^{\omega}),\in\bigr{)}, and 3. 3.
* when is a limit ordinal.*
Remark 4.8**.**
There is a sequence of partial surjections \bigl{(}\pi_{\alpha}\colon\alpha^{<\omega}\times\lambda^{\omega}\to\mathrm{L}_{\alpha}(\lambda^{\omega})\mid\alpha\in\text{Ord}\bigr{)} such that
if , then , 2. 2.
if , is defined, and , then is an element of definable in the structure \bigl{(}\mathrm{L}_{\beta_{0}}(\lambda^{\omega}),\in\bigr{)} via a formula coded by with some parameters of the form where here depends only on , not on , and 3. 3.
there is a such that for all , .
Definition 4.9**.**
For an ordinal , let
[TABLE] 2. 2.
For an ordinal , a formula , and , let
[TABLE]
Lemma 4.10**.**
There is a function which is OD from sending to , where is an ordinal and is as in Definition 4.9, such that is definable from .
Proof 4.11** (Lemma 4.10).**
We prove the lemma by induction on . Let us fix . Then we prove the statement by induction on the complexity of .
Case 1:* When is of the form or .*
Let . Then and by Remark 4.8, both and are definable in the structure \bigl{(}\mathrm{L}_{\beta_{*}}(\lambda^{\omega}),\in\bigr{)} with some parameters of the form where here depends only on and . Then one can find a formula and some such that . By induction hypothesis, one can find a desired .
Case 2:* When is of the form .*
In this case, by induction hypothesis, letting , we have . Then is the desired one.
Case 3:* When is of the form .*
In this case, by induction hypothesis, letting and , we have and . Then is the desired one.
Case 4:* When is of the form .*
In this case, by induction hypothesis, for each , setting , we have . We write for . Note that
[TABLE]
where is the subset of defined from , is the pair defining the union , and is from Lemma 4.5. Therefore, q^{\alpha}_{p}=F\bigl{(}\bigvee_{\vec{\beta}\in\alpha^{<\omega}}q_{\vec{\beta}}\bigr{)} is the desired one. This completes the proof of the lemma. ∎
We are now ready to finish the proof of Theorem 1.6.
Proof 4.12** (Theorem 1.6).**
As in the paragraph after Fact 1, it is enough to prove the following: () For any subset of in , there are some formula and a set of ordinals such that for all elements of ,
[TABLE]
Let be a subset of in . Then there is an ordinal such that . Let be a formula defining in the structure \bigl{(}\mathrm{L}_{\alpha}(\lambda^{\omega}),\in\bigr{)} with some parameters . Let be such that for all . Then
[TABLE]
where and is from Lemma 4.10. This shows that is defined from with parameters , which easily gives us that is defined from for some and . This finishes the proof of , and hence this completes the proof of Theorem 1.6. ∎
5 Weak homogeneity and supercompactness of
In this section, we prove Theorem 1.3. Recall the terminology about trees from Section 2. A tree is said to be on if . For a tree on , for , let . Let also . Every tree considered in the following will be on for some .
Following [5], we define what it means for a tree on to be weakly homogeneous. First, for , an infinite cardinal, a nonzero ordinal, let MEAS be the set of all -complete measures on . For , for , let . A -tower of measures is a sequence such that
- (i)
for each , MEAS, and 2. (ii)
for , , where .
A tower is countably complete if for every sequence such that for all , there is a function such that for all .
Definition 5.1**.**
Let be a tree on . is weakly homogeneous if there is a sequence such that
- (i)
for each , is a countable subset of MEAS* and for each , .* 2. (ii)
for all , there is a countably complete -tower of measures such that for each , .
Proof 5.2** (Theorem 1.3).**
Let be a tree on . [5] shows that is weakly homogeneous provided the following conditions hold:
- (A)
There is a countably complete, normal fine measure on \mathcal{P}_{\omega_{1}}(\bigcup_{n}(\mathcal{P}({}^{n}\lambda)\cup\rm{MEAS}$${}^{\omega_{1},\lambda}_{n})). 2. (B)
The Axiom of Dependent Choice holds for relations on . 3. (C)
There is a wellorder on \bigcup_{n}\rm{MEAS}$${}^{\omega_{1},\lambda}_{n}.
We need to verify (A), (B), (C) follow from the supercompactness of . (A) is obvious. (B) follows from Theorem 1.2. Now we verify (C). Let X=\bigcup_{n}\rm{MEAS}$${}^{\omega_{1},\lambda}_{n}. We need to show that is wellorderable.
It is enough to prove that MEAS is well-orderable. This is because for each , there is a bijection from MEAS onto MEAS. Such a bijection is induced by a bijection between and . Hence, MEAS is well-orderable. By , is well-orderable.
Let Z=\mathcal{P}(\lambda)\cup\rm{MEAS}$${}^{\omega_{1},\lambda}_{1}. Let be a countably complete, normal fine measure on . Given MEAS and , let
.
So is a function from into the ordinals.
Claim 5**.**
Suppose are in MEAS. Then , here “” abbreviates the statement “the set of such that is in ”.
Proof 5.3**.**
Let witness . Without loss of generality, assume and . By fineness of , , . Fix such a . Then and . Since are disjoint, ∎
Let be defined as: . The claim gives us that is an injection. By , is well-founded and furthermore is well-ordered. Therefore, is well-ordered as desired. ∎
6 , , and supercompactness of
In this section, we prove Theorem 1.5. We need the following important notion of an envelope of a pointclass. This was first formulated by D.A. Martin (cf. [2]). We only need the notion of an envelope of an inductive-like pointclass.
Definition 6.1**.**
A pointclass is inductive-like if it is closed under continuous reductions and real quantifiers. 444Here and below, is always a boldface pointclass.
Let be an inductive-like pointclass. Let be the pointclass consisting of all such that . Let . The envelope of , , is the pointclass consisting of all such that for any countable , there is some such that .
The following fact about envelopes is crucial for our argument. It is essentially proved in [18] (which deals with generic large cardinal properties of in rather than with large cardinal properties of , but the argument carries over to the present context.)
Lemma 6.2** (Wilson).**
Assume . Let be an inductive-like pointclass with the scale property. Suppose that is -strongly compact. Then there is a scale on a universal set, each of whose prewellorderings is in .
In the above, is a self-dual pointclass (closed under complementation) containing (cf. [2] and [18]). So . Another important fact about envelopes is that if holds and the boldface ambiguous part of the pointclass is determined, as it is here, then is determined and projectively closed (Wilson [18]; based on work of Kechris, Woodin, and Martin.) Therefore Wadge’s lemma applies to it, as one can easily verify that the relevant games are determined. Moreover, the Wadge preordering555We are abusing notation here; really it is a preordering of pairs where . of is a prewellordering: otherwise by we could choose a sequence of pointsets in that was strictly decreasing in the Wadge ordering, but then by the proof of the Martin–Monk theorem we get a contradiction. (Again one can easily verify that the relevant games are determined.)
Note that the prewellorderings of a scale as in Lemma 6.2 must be Wadge-cofinal in ; otherwise the sequence of prewellorderings itself would be coded by a set of reals in , which is impossible.
The following fundamental fact about is due to H.W. Woodin (cf. [4]).
Theorem 6.3** (Woodin).**
The following are equivalent.
. 2. 2.
* the class of Suslin cardinals is closed.*
We will also need the following results due to D.A. Martin and Woodin.
Theorem 6.4**.**
Assume ZF + DC. The following are equivalent.
. 2. 2.
* every set is Suslin.*
Proof 6.5** (Theorem 1.5).**
First, note that by Theorem 1.2, follows from supercompactness of . The direction follows immediately from Theorem 6.4. For the direction, suppose fails. By Theorems 6.4 and 6.3, there is the largest Suslin cardinal . Let be the pointclass of -Suslin sets, i.e. the set of such that there is a tree on such that . Then by the basic theory of pointclasses under determinacy, is inductive-like, has the scale property, and furthermore, there is some that is not Suslin (equivalently, there is no scale on ). Such a can be taken to be a universal -set. The reason cannot have a scale is because otherwise, is Suslin. Since is the largest Suslin cardinal, is -Suslin (i.e. there is a tree on such that ). But this means , which cannot happen.
By Lemma 6.2, is supercompact implies that every set in has a scale, each of whose prewellorderings is in .666In fact, [17, Section 5] just needs is -strongly compact for this. This is a contradiction.777An alternative proof for the direction is as follows. Suppose fails. Let be the largest Suslin cardinal and . Let be a universal -set. Then by results of Section 5, is weakly homogeneously Suslin. By the Martin-Solovay construction, is Suslin. But . This contradicts the fact that is the largest Suslin pointclass. ∎
The following may be a more approachable version of a well-known conjecture that is equivalent to .
Conjecture 6.6**.**
Assume is supercompact. is equivalent to .
7 and supercompactness of
In this section, we will prove Theorem 1.4. First, we note that we do not need the full “ is supercompact” hypothesis in the proof of the theorem; one just needs:
- •
is -supercompact, and
- •
.
Both of these are consequences of is supercompact, cf[17, Section 1].
Now we explain Hod Pair Capturing (). This hypothesis and the notion of least branch hod pair (lbr hod pair) are formulated by John Steel. The reader can see [11] for a detailed discussion regarding topics concerning least-branch hod premice, lbr hod pairs, and . The main thing one needs from are the facts given by Theorem 7.4. For basic facts about inner model theoretic notions such as iteration strategies, see [10].
Definition 7.1** (lbr hod pair, [11]).**
* is an lbr hod pair if is an lpm (least-branch hod premouse) and is a complete strategy for that is normalizes well and has strong hull condensation.*
Definition 7.2** (, [11]).**
Suppose is Suslin co-Suslin. Then there is an lbr hod pair such that is Wadge reducible to .
It is conjectured that implies . and its variations have been shown to hold in very strong models of determinacy, cf. [7].
In the above, a complete strategy acts on all countable stacks of countable normal trees. The reader can consult [11] for more details on lbr hod pairs. The basic theory of lbr hod pairs has been worked out in [11]. What we need are a couple of facts about them. In the following, we fix a canonical coding of subsets of by subsets of .888One way of defining is as follows. Let be a surjection defined as: for any that codes a well-founded relation on , let be the transitive collapge of the structure . Then for any , is defined to be . Given an lbr hod pair , for , is the minimal, active -mouse that has Woodin cardinals. See for instance [9] for a precise definition. The following facts are relevant for us.
Lemma 7.3**.**
Let be an lbr hod pair. Let and be ’s canonical strategy. Let be the largest Woodin cardinal of . There is a term such that whenever is an iteration embedding via an iteration according to , and is -generic, then
.
Theorem 7.4**.**
Suppose is -supercompact, . Suppose is an lbr hod pair. Then
(**[12, Section 2]**) is Suslin co-Suslin. 2. 2.
(**[17, Section 3]**) exists.
Remark 7.5**.**
We note that in the above theorem, the hypothesis is -supercompact is used in (1) to extend to act on all stacks such that there is a surjection of onto . The proof of (2) just needs is -strongly compact and .
The following theorem, due to Neeman, is our main tool for proving determinacy.
Theorem 7.6** (Neeman, [6]).**
Suppose . Suppose is such that
* is Woodin;* 2. 2.
* is an -iteration strategy for ;* 3. 3.
there is a term such that whenever is an iteration map according to , is -generic, then .
Then is determined.
Proof 7.7** (Theorem 1.4).**
Let be Suslin co-Suslin. By , let be an lbr hod pair such that is Wadge reducible to . Let witness this; we let be the continuous function given by such that .999We can construe as a function and this naturally gives rise to a continuous (in fact Lipschitz) function . By Theorem 7.4, is Suslin co-Suslin and exists. Let be the canonical iteration strategy for and be the Woodin cardinals of . Let be an iteration tree with the following properties:
- •
* is according to .*
- •
Letting be the corresponding iteration embedding, then is -generic for the extender algebra at .101010The reader can see [10] for more detailed discussions about the extender algebra and genericity iteration trees. All we need here is the fact there is some forcing such that card and such that there is some -generic filter such that .
Now we can construe as a -mouse over , which we will call . Note that is a Woodin cardinal of and induces a strategy on .
We note that satisfies the hypothesis of Theorem 7.6 for . Let is given as in Lemma 7.3 for , then induces a term satisfying (3) of Theorem 7.6. Let . The term consists of where is a real and ”.
By Theorem 7.6, is determined. This completes the proof of Theorem 1.4. ∎
We conjecture that is not needed in Theorem 1.4. [17] has shown that is supercompact implies that all sets in are Suslin co-Suslin and are determined and much more.111111[17] shows that there is a transitive class model containing all reals such that . One may hope to prove Conjecture 7.8 by showing that every Suslin co-Suslin set is homogeneously Suslin. Theorem 1.3 shows that every Suslin co-Suslin set is a projection of a homogenously Suslin, hence determined, set.
Conjecture 7.8**.**
Assume is supercompact. For any Suslin co-Suslin set , is determined.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Ikegami, D.: Games in Set Theory and Logic. Ph.D. thesis, Institute for Logic, Language and Computation, Universiteit von Amsterdam (2010). URL http://www.sic.shibaura-it.ac.jp/%7Eikegami/thesis-latest.pdf
- 2[2] Jackson, S.: Structural consequences of ad. In: Handbook of set theory, pp. 1753–1876. Springer (2010)
- 3[3] Jech, T.: ω 1 subscript 𝜔 1 \omega_{1} can be measurable. Israel J. Math. 6 , 363–367 (1969) (1968)
- 4[4] Ketchersid, R.: More structural consequences of ad. Contemporary Mathematics 533 , 71–105 (2011)
- 5[5] Martin, D.A., Woodin, W.H.: Weakly homogeneous trees. In: Games, Scales, and Suslin Cardinals: The Cabal Seminar, vol. 1, pp. 421–438 (2008)
- 6[6] Neeman, I.: Optimal proofs of determinacy. Bulletin of Symbolic Logic 1 (3), 327–339 (1995)
- 7[7] Sargsyan, G., Trang, N.: The largest Suslin axiom. Submitted. URL http://sites.math.rutgers.edu/%7Egs 481/lsa.pdf
- 8[8] Sargsyan, G., Trang, N.: The exact consistency strength of the generic absoluteness for the universally baire sets (2019). In preparation
