On Semiproperness of Namba forcings and Ideals in Prikry extensions
Abstract.
In this paper, we study some variations of Namba forcing over and show that its semiproperness implies .
In particular, Prikry forcing at forces Namba forcing is not semiproper. This shows that there is no semiproper saturated ideal in the extensions by Prikry-type forcings. We also show that cannot carry a -saturated semiproper ideal if is singular with countable cofinality.
Key words and phrases:
Namba forcing, Semistationary reflection principles, Prikry-type forcing, saturated ideal, huge cardinal2020 Mathematics Subject Classification:
03E35, 03E40, 03E551. Introduction
The notion of a saturated ideal is one of generic large cardinal axioms. The first model of a saturated ideal over is due to Kunen. He established
Theorem 1.1 (Kunen [15] for ).
If is a huge cardinal then for every regular cardinal , there is a poset which forces that carries a saturated ideal.
Kunen’s proof is useful to construct a model with a saturated ideal over . Many saturated ideals, which have strengthnengths of a saturation property, were found by Kunen’s method like in [16] and [9]. In [26], the author proved that Kunen’s original ideal of Theorem 1.1 is not so strong in the sense of saturation properties.
But, if then the saturated ideals obtained by collapsing a huge cardinal are proper* (For example, see Proposition 5.1). It seems that properness* of ideals is very strong by the results of [17]. Here, by proper*, we mean the properness in the sense of forcing. For an ideal over , the properness of is in the usual sense. To distinguish properness of ideals and that of forcings, we write “proper*” according to [22].
In the above story, is a regular cardinal. We are interested in the case of singular cardinal . A model with a saturated ideal over was given by Foreman [6]. Then, the ideal is not proper*. Moreover, it is known that cannot carry a proper* ideal if singular by Matsubara–Shelah [18].
On the other hand, Sakai obtained a model with a semiproper ideal over in [22]. In Sakai’s proof, can be taken as a singular cardinal. Notice that the ideal of Sakai’s model is not saturated. We ask
Question 1.2.
For a singular cardinal , can carry a saturated and semiproper ideal?
All known models with a saturated ideal over a successor of a singular cardinal were given by using Prikry-type forcing, as far as the author knows. This paper aims to show all known saturated ideals are not semiproper by proving the following theorem.
Theorem 1.3.
Suppose that are inner models and are cardinals such that:
-
(1)
and are regular cardinals in .
-
(2)
is a singular cardinal in of cofinality .
-
(3)
is a regular cardinal in .
-
(4)
is a stationary subset in .
Then there is no semiproper precipitous ideals over in . In particular, Prikry-type forcing over (like Prikry forcing and Woodin’s modification) forces there is no semiproper precipitous ideals over for all regular .
Moreover, if we consider an ideal over instead of , the answer of Question 1.2 is NO.
Theorem 1.4.
Suppose that is a singular cardinal with cofinality and is a regular cardinal. If carries a normal, fine, -complete -saturated ideal then is not semiproper.
The key of the proof of Theorems 1.3 and 1.4 is the study of semiproperness of Namba forcing. Namba forcing was introduced by Namba [20] as an example of Boolean algebras that is -distributive but not -distributive.
In recent research, Namba forcing is studied in the context of semiproper forcing sometimes. For example, Namba forcing appears as one of the characterizations of dagger principle that was introduced by Foreman–Magidor–Shelah [5].
Theorem 1.5 (Shelah [24] for (1) (2), Doebler–Schindler [3] for (3) (2)).
The following are equivalent:
-
(1)
holds. That is, every -stationary preserving poset is semiproper.
-
(2)
holds for all .
-
(3)
is semiproper for all .
and are semistationary reflection principles and Namba forcing over , respectively. For the definition of them, we refer to Section 2. There is also a local relationship between (2) and (3) above as follows.
-
•
For -strongly compact cardinal , the Levy collapse forces both and the semiproperness of .
-
•
(Todorčević [25]) If is semiproper then holds. In particular, holds.
is the stationary reflection principle. We are interested in the tolerance between and the semiproperness of . In this paper, we introduce Namba forcing over and show the following.
Theorem 1.6.
Suppose that for all and are regular cardinals. The following are equivalent:
-
(1)
preserves the semistationarity of any subset of .
-
(2)
.
is one of variations of semistationary reflection principles introduced by Sakai [23]. This is equivalent with if . The semiproperness of is also equivalent with that of (See Lemma 3.10). Theorem 1.6 generalizes Todorčević’s result. We can regard the semiproperness of Namba forcing as one of the reflection principles.
Theorem 1.6 brings us the following observation. The proof of Theorem 1.3 is almost the same as that of the following theorem.
Theorem 1.7.
Suppose that are inner models and are cardinals such that:
-
(1)
and are regular cardinals in .
-
(2)
is a singular cardinal in of cofinality .
-
(3)
is a regular cardinal in .
-
(4)
is a stationary subset in .
Then is not semiproper for all regular in . In particular, Prikry-type forcing over (like Prikry forcing and Woodin’s modification) forces is not semiproper for all regular . In particular, is forced to be non semiproper111This also follows from the proof of [3, Theorem 5.7]..
The structure of this paper is as follows. In Section 2, we recall the basic facts of semistationary subsets, Namba forcings, and saturated ideals. In Section 3, we introduce Namba forcing over . We study the basic properties of . In Section 4, we prove Theorems 1.6 and 1.7. In Section 5, we study the semiproperness of ideals in Prikry-type extensions. The proofs of Theorems 1.3 and 1.4 are given in this section. Section 6 is not related to saturated ideals. However, our results can be positioned in the context of strong compactness of cardinals. We will call these principles -aspects of strong compactness and conclude this paper with some observations.
2. Preliminaries
In this section, we recall basic facts of semistationary subsets, Namba forcings, and saturated ideals. We use [14] as a reference for set theory in general. For the topics of Namba forcings and saturated ideals, we refer to [24, Section XII] and [7], respectively.
Our notation is standard. In this paper, by and , we mean regular cardinals greater than unless otherwise stated. We use to denote an infinite cardinal. For , and denote the set of all ordinals below of cofinality and , respectively. We also write . By , we mean the class of regular cardinals. For -increasing finite sequences , by , we means end-extends that is, . -strongly compact cardinal is a regular cardinal in which carries a fine ultrafilter.
In the proof of Theorem 1.3 and 1.7, we use the properties of Prikry forcing and Woodin’s modifications. The former was introduced in [21] and the letter appeared in [11].
Theorem 2.1 (Prikry [21]).
If is a measurable cardinal then there is a poset with the following conditions:
-
(1)
is -centered and preserves all cardinal.
-
(2)
.
-
(3)
If then .
Theorem 2.2 (Woodin).
If is a measurable cardinal and then there is a poset with the following conditions:
-
(1)
is -centered.
-
(2)
.
-
(3)
If then .
Proof.
See [11]. ∎
Lemma 2.3.
If is a generic extension by Prikry forcing over or Woodin’s modification over . Then, for every regular , the following holds.
-
(1)
is a singular cardinal in of cofinality .
-
(2)
is a regular cardinal in .
-
(3)
is a stationary subset in .
Proof.
Easy. ∎
2.1. Semistationary subsets and Namba forcing
For a set , a semistationary subset is an such that is stationary in . By , we mean .
For a poset , we say that is semiproper if and only if is -semigeneric contains a club for all sufficiently large regular . -semigeneric is a condition that forces . The following lemma is well-known.
Lemma 2.4 (Shelah [24]).
The following are equivalent:
-
(1)
is semiproper.
-
(2)
preserves the semistationarity of any sets.
We also introduce a useful lemma due to Menas to study semistationary subsets.
Lemma 2.5 (Menas [19]).
Let and be sets with .
-
(1)
If is a club then the set is a club in .
-
(2)
If is a club then the set contains a club in .
Lemma 2.6.
If is semistationary in then is semistationary in .
Proof.
This directly follows from Lemma 2.5. ∎
is the statement that claims, for every semistationary subset , there is an with the following properties:
-
(1)
-
(2)
is semistationary.
We say that reflects to if above holds. To give an witness of , it is enough to give an in which some semistatoinary reflects to . So can be removed as follows.
Lemma 2.7.
If a semistationary subset reflects to then there is an such that reflects to and .
Proof.
See [22]. ∎
Lemma 2.8.
If a semistationary subset reflects to then is semistationary is co-bounded.
Proof.
This follows from Lemma 2.6. ∎
In the proof of Theorem 1.7, we use the following theorem.
Theorem 2.9 (Sakai [23]).
implies .
Here, is the statement that, for every stationary subset , there is an such that is stationary in .
Lastly, we conclude this subsection with the definition of Namba forcing. Namba forcing is the set of all Namba trees. Namba tree is a tree with the following conditions:
-
(1)
has a trunk , that is, is the maximal such that .
-
(2)
For all , if then is unbounded in .
is ordered by inclusion. Note that we wrote to denote . But if we write then we always assume . Therefore, end-extends . We use a similar notation for finite subsets of an ordered set later.
is -stationary preserving and that forces . Therefore is semiproper under . Namba forcing is a representative of semiproper posets that change uncountable cofinalities in the following sense.
Theorem 2.10 (Shelah [24]).
The following are equivalent:
-
(1)
is semiproper.
-
(2)
There is a poset that is semiproper and forces .
-
(3)
.
For the definition of , see Section 3.
2.2. Saturated ideals
For an ideal over , we write for the set of -positive sets. is a poset . We say that is semiproper if is semiproper. We say that is -saturated if has the -c.c. For an ideal over , we simply say that is saturated if is -saturated. Note that we can see an ideal over as an ideal over .
For a precipitous ideal over , by , we mean the least such that is not -complete. Then, the critical point of the generic ultrapower mapping is forced to be . We say that an ideal is exactly and uniformly -complete if for all . If or then every -complete ideal over is exactly and uniformly -complete.
Lemma 2.11.
Suppose that is a normal, fine, exactly and uniformly -complete precipitous ideal over . Let be a -name for the generic ultrapower mapping . Then the following are forced by :
-
(1)
.
-
(2)
. If is -saturated then .
Proof.
See [7, Section 2] ∎
For a later purpose, we see the cofinalities in the generic ultrapower. Let us introduce Shelah’s famous result.
Lemma 2.12 (Shelah).
Suppose that are inner models. Let be a regular cardinal in . If is a cardinal in then .
Proof.
See [4, Theorem 4.73] ∎
We will use Lemma 2.13 in Section 5. An example of use is computations of cofinalities. For a given saturated ideal over , if is singular with the countable cofinality then forces by Lemma 2.13.
Lemma 2.13.
Suppose that is a normal, fine, exactly and uniformly -complete -saturated ideal over . Suppose that is a regular cardinal. Then the following holds:
-
(1)
If then forces that .
-
(2)
If and is a successor cardinal then forces that .
Proof.
In this paper, we often consider an ideal in some extension. We introduce the preservation theorem of saturated ideals. Foreman proved the conclusion of Lemma 2.14 in the case of in [6] at first but the same thing holds for a loud class.
Lemma 2.14 (Foreman [6]).
Suppose that is a normal, fine, exactly and uniformly -complete -saturated ideal over . Suppose one of the following.
-
(1)
and .
-
(2)
and .
Then, for every -centered poset forces is a normal, fine, exactly and uniformly -complete -saturated ideal over . is -name for the ideal generated by .
Proof.
This follows from Foreman’s duality theorem [8]. ∎
Lastly, we recall forcing projections for Proposition 5.1. For posets and , a projection is an order-preserving mapping with the property that implies and . Whenever a projection is given, for every dense in , is also dense in . It follows that generates a -generic filter, where is the canonical name of -generic filter. The quotient forcing is defined by , ordered by . Then is equivalent with in the sense of Boolean completion.
We say that a projection between complete Boolean algebras is continuous if for all with . The continuity of projection is useful when we try to analyze quotient forcing . The following lemma will be used in a proof of Proposition 5.1.
Lemma 2.15.
If is a continuous projection between complete Boolean algebras and is -closed then forces is -closed.
Proof.
Note that has a -closed dense subset. Let be a descending sequence. By induction, let us construct and such that
-
(1)
-
(2)
.
-
(3)
.
We note that for each by (3). Since is -closed, . Then the continuity of shows
By the definition of , forces that and this is a lower bound of , as desired. ∎
3. Properties of
From here, throughout this paper, we fix regular cardinals . In this section, for a fine ideal over , we introduce and study this. Most things in this section are analogies of original . An importance is that is -stationary preserving, this is shown in Lemma 3.8. Our proof of this is essentially due to Shelah (See Lemma 3.7).
For a fine ideal over , a (-)Namba tree is a set with the following conditions:
-
(1)
is a tree. That is, each is -increasing and closed under the initial segment.
-
(2)
has a trunk .
-
(3)
For each , if then .
Let be the set of all -Namba trees. is ordered by inclusion. we denote by . is the bounded ideal over .
For and , we write . This set is the -th levels of . For , by , we mean and .
Lemma 3.1.
If is a fine ideal over then, for all , is a dense subset of .
Proof.
Easy. ∎
changes the cofinalities of regular cardinals lying between and .
Lemma 3.2.
Suppose that is a fine ideal over . For all , forces .
Proof.
Consider a -name for the set . is forced to be a countable -increasing sequence. Let be -name for the -th element of . It is easy to see
-
(1)
and
-
(2)
. Here, .
For each , by (1), . By (1), for each . Since , is forced to be . Of course, , as desired. ∎
We need a fusion sequence argument sometime.
Lemma 3.3.
Suppose that is a fine ideal over . For a -descending sequence , suppose that there is a increasing such that
-
•
for every .
-
•
For every , for every .
Then, .
Proof.
Let then is a tree with trunk . By the assumption, for every , let be a natural number such that then . Therefore is -Namba tree, as desired. ∎
We often deal with an -Namba tree that has a form of . Lemma 3.4 describes what this tree is and its properties.
Lemma 3.4.
Suppose that is a fine ideal over . For and , is an -Namba tree such that
-
(1)
.
-
(2)
For every , if then .
Proof.
Easy. ∎
We fix a -name for a ordinal such that for some set . For an -Namba tree , we say is -bad, if there is no that decides the value of .
Lemma 3.5.
Suppose that is a fine ideal over . For every -name for an ordinal and a set with , if is -bad then is -bad .
Proof.
We show the contraposition. Since is not -bad , for each , there are and such that . Since is -complete, there is a such that . Consider a tree . Then forces , as desired. ∎
Lemma 3.6.
If is a fine ideal over then, for every -name for an ordinal and a set with , there is no -bad condition.
Proof.
Lemma 3.7.
Suppose that is a fine ideal over . For a set , if has a club subset of size then, for every , if is a club then contains a club.
Proof.
For each , let us define a two player game of length as follows:
Player I | , | |||||
---|---|---|---|---|---|---|
Player II | , |
Players I and II must choose to satisfy the following:
-
•
.
-
•
, , and .
-
•
.
-
•
.
-
•
and .
-
•
.
Note that Player II can choose anytime by Lemma 3.6. Player II wins if . It is easy to see that is an open game, and thus, is determined.
First, we claim that Player II has a winning strategy in contains a club subset. Suppose otherwise. Then, there is a stationary subset such that, for every , Player I has a winning strategy in by the determinacy of games. Let be I’s winning strategies. Let be a sufficiently large regular cardinal. Consider an elementary substructure such that
-
(1)
is countable.
-
(2)
.
-
(3)
.
To prove the contradiction, let us find a sequence of Player II’s move in which and this is a regal move after Player I taked . In this play, Player II wins while Player I uses her winning strategy, as we see later.
Suppose that has been obtained. For each , let if is a partial play of along . Note that by the induction hypothesis and . By , . So, in , we can pick . Then . By the rule of , . By Lemma 3.6, we can choose and such that and . The induction is completed.
Player I used a winning strategy in this play but Player II wins. Indeed, by each is in . This is a contradiction.
Fix . Lastly, we claim that there is a that forces . Let enumerates . By induction, let us define a descending sequence with the following conditions:
-
(1)
.
-
(2)
for all .
-
(3)
For every , if we write then there is a such that for some .
Suppose that has been defined. Let us define . For each , first we consider . Let be the set of all such that appears in for some . need to be an -positive set, that is .
Suppose otherwise, let . By the definition of , . On the other hand, by the rule of , . This is a contradiction. So . For each , there are and such that for some . Define by
and
Note that for each , and .
By the definition of and Lemma 3.3, a lower bound exists. Let be a -name such that
if and only if .
This is well-defined. It is easy to see that for each . Then , as desired. ∎
Lemma 3.8.
Suppose that is a fine ideal over . If is semistationary subset of . If has a club subset of size then preserves the semistationarity of . In particular, is -stationary preserving.
Proof.
Let and be such that is a club. By Lemma 3.7, we can take and such that and , as desired. ∎
Proposition 3.9.
If is a stationary subset of . If has a club subset of size then preserves the stationarity of . In particular, if and then forces .
Proof.
For the preservation of stationary subsets, Lemma 3.7 works as well as the proof of Lemma 3.8. We only check about uncountable cofinalities. Let be a cofinal subset of . Then has a club subset of size . Therefore, is forced to be a stationary subset. So any countable subset of in the extension is covered by some element of , as desired. ∎
In the proof of Theorem 1.7, we will use the following lemma:
Lemma 3.10.
The following are equivalent:
-
(1)
is semiproper.
-
(2)
is semiproper.
To show Lemma 3.10, we need to characterize the semiproperness of in terms of game theory. Let us introduce the principle . is the statement that the player II has a winning strategy for the Galvin game for all . is a game of length with two players as follows:
Player I | ||||||
---|---|---|---|---|---|---|
Player I |
Let . II wins if . We write for . Note that, the Galvin game can be defined for any ideal over any set . is the statement that Player II has a winning strategy for . is equivalent with the semiproperness of as we saw in Theorem 2.10. Lemma 3.11 is an analog of this. Lemma 3.10 follows by (See Lemmas 3.12 and 3.13).
Note that is a game theoretical variation of Chang’s conjecture. For a detail, we refer to [24, Theorem 2.5 of Section XII]. We see as a variation of Chang’s conjectures.
Lemma 3.11.
Suppose that is a fine ideal over . The following are equivalent.
-
(1)
is semiproper.
-
(2)
holds.
Proof.
First, we show the forward direction. Let be a club such that, for every ,
-
•
,
-
•
, and,
-
•
for every , there is a that forces .
Consider an expansion . Let us describe a winning strategy for Player II in .
When a function is given, let be a -name for . Let be a condition such that and for all . Note that . By Lemma 3.8, .
Suppose that Player I played . Let be a Skolem hull . Player II choose . Then Player II wins. Note that by the definition of ’s. Let . We have . By the choice of , we can take a that forces .
Let and let be the -name for the -th element of . We have
.
For every , forces , and thus, . So is -positive, as desired.
Let us show the inverse direction. We fix a sequence of winning strategies . For a countable with . For , let us find which forces . Let be an enumeration of -names for a countable ordinal belonging to .
We put . Let be a function such that:
-
•
has a direct extension that forces .
Let be II’s first play using and . Define .
Next, let us define . First, for each , let be a function such that
-
•
has a direct extension that forces .
Let be II’s first play using and . Let us define by
-
•
If then .
-
•
If then .
Let be II’s second play using and . Define . Of course, .
Similarly, we continue this process for all . Then is a tree such that, for all , if then . Each of the components was a response by II using her winning strategy. Therefore . So and that forces is bounded by and it is in . In particular, , as desired. ∎
Lemma 3.12.
Suppose that is a fine ideal over . If is semiproper then is semiproper for all .
Proof.
Lemma 3.13.
implies .
Proof.
Let be a II’s winning strategy of . Since has a subset such that and . Define an ordinal . For , define by . Define II’s strategy for by . It is easy to see that is a winning strategy. ∎
The rest of this section is not related to the main theorems, but we introduce these. The consistency of was shown in [10]. Recall that is -strategically closed if Player II has a winning strategy for the game in which Player I and II alternatively choose and such that . Player II wins if . The following lemma is essentially due to Galvin–Jech–Magidor [10].
Lemma 3.14.
If is a fine ideal over such that is -strategically closed then holds
Proof.
Let be II’s winning strategy witnessing -strategically closedness. We let to describe II’s winning strategy for for all .
When Player I chooses , since is -complete, we define and such that . Let . Define .
Then Player II wins. In fact, is in since is taken by the II’s strategy , as desired. ∎
Galvin–Jech–Magidor proved that carries an ideal in which is -strategically closed if a measurable cardinal is collapsed to .
4. Proof of Theorems 1.6 and 1.7
Lemma 4.1.
Suppose that a semistationary subset does not reflect to any . Then destroys the semistationarity of .
Proof.
First, we fix a bijection . For each , by the assumption, there is a function such that there is no which closed under .
Let be a -name for . Let be the -th element of . Again, we list the properties of .
-
(1)
-
(2)
.
-
(3)
.
We may assume that by shrinking .
Define a -name for a function by
.
Here, denotes for each .
Suppose that closed under some . By Lemma 2.5, we may assume that can decode . That is, if then .
By the choice of , we can choose and such that . We may assume that for some . Then . We claim that closed under . For every , we can choose an expansion by . forces
.
And thus, . Therefore it is forced by that closed under . Let denote the least set that contains as a subset and closed under . We have
.
Since , we also have
.
In particular, closed under . This is contradicting to the choice of . So, the semistationarity of is destroyed by , as desired. ∎
Lemma 4.2.
If a semistationary subset reflects to some then preserves the semistationarity of .
Proof.
Proof of Theorem 1.6.
We conclude this section with Theorem 1.7.
Proof of Theorem 1.7.
It is easy to see that fails in . Indeed, does not reflect to any ordinals in . Since is a stationary subset, this witnesses in . By Theorem 2.9, also fails in . By Lemma 3.10, is not semiproper, as desired. In particular, by Lemma 3.11, is non semiproper in . For Prikry-type forcings, Lemma 2.3 works. ∎
5. Semiproperness of saturated ideals
In this section, we discuss about ideals. First, we note that successors of regular cardinals can carry an ideal that is both saturated and semiproper by Proposition 5.1. The rest is devoted to Theorems 1.3 and 1.4. We also study their corollaries.
Proposition 5.1.
If is an almost huge embedding with critical point . For regular cardinals , there is a poset which forces the following:
-
(1)
carries a saturated and proper* ideal.
-
(2)
and .
Proof.
Let . Here, is the -support diagonal product of Levy collapses . For a detail, we refer to [27, Theorem 1.2]. This paper gave a continuous projection and a -name such that forces the following properties:
-
(1)
is a saturated ideal over .
-
(2)
.
It is easy to see that is -closed. By Lemma 2.15, is forced to be -closed. By (2), has a -closed dense subset. Since , is proper*, as desired. ∎
A conclusion of Proposition 5.1 fails if is singular as follows.
Theorem 5.2 (Matsubara–Shelah [18]).
If is a singular cardinal then cannot carries a proper* ideal.
Proof.
Matsubara–Shelah proved non-properness* for a more loud class of ideals, that contains all ideals over successors of singular cardinals. We refer to [18].
Here, to see a common point between saturated ideals and Namba forcings, we show non-properness* assuming the cofinality of is countable and the ideal is saturated. Let be a saturated ideal over . By (1) of Lemma 2.13, forces . Therefore this is not proper* by the same reason of non-properness* of Namba forcing. ∎
A model in which carries a semiproper ideal such that forces was given by Sakai [22]. Note that is not saturated in Sakai’s model.
We study the semiproperness of ideals in terms of the semistationary reflection principle. The following lemma is an analog of Theorem 1.7 for precipitous ideals.
Lemma 5.3.
Suppose that is a normal, fine, exactly and uniformly -complete precipitous ideal over . If for all then the following are equivalent:
-
(1)
.
-
(2)
preserves all semistationary subset of .
Proof.
Let . We may assume . First, we need the following claim:
Claim 5.4.
There is a such that for all .
Proof of Claim.
Let be an arbitrary -generic and be the generic ultrapower mapping by . Then the following holds:
-
•
and .
-
•
.
The first item is well-known. The second item follows from the assumption.
Therefore, we have . By Łós’s theorem, . Since is arbitrary, , as desired. ∎
First, we show the forward direction. Let be a semistationary subset of . By Lemma 2.8, is semistationary is co-bounded. By the claim and Lemma 2.5, . It is easy to see that is semistationary. By Łós’s theorem, forces that is semistationary. Since is forced to be closed under -sequence, is semistationary, as desired.
Let be semistationary subset of . By the previous argument, we have and is semistationary. Since is fine and -complete, we may assume that for all . Therefore reflect to for all , as desired.∎
Therefore there is no semiproper saturated ideals over in the extension by Prikry forcing or Woodin’s modification over . Moreover, there is no semiproper precipitous ideals222It is unknown whether every semiproper ideal is precipitous or not. But, under the GCH, the semiproperness shows the precipitousness, and thus, we can omit the condition of precipitousness from Theorem 1.3. For detail, we refer to [22].
Proof of Theorem 1.4.
Since is a regular cardinal, is a non-reflecting stationary subset. That is, for every , is not stationary in . Let be -generic and be the generic ultrapower mapping induced by . By Lemmas 2.11 and 2.13, has the following properties:
-
(1)
.
-
(2)
.
-
(3)
.
Note that remains a stationary subset since is -saturated. (1) shows that and is non-reflection stationary subset in . By (3), is forced to be a subset of . Therefore, by (2),
there is a non-reflecting stationary subset of .
By the elementarity of , we have a non-reflecting stationary subset of in the ground. In particular, fails by Theorem 2.9. By Lemma 5.3, is not semiproper, as desired. ∎
We have a new mutual inconsistency.
Corollary 5.5.
If is a singular cardinal with cofinality then the following are mutually inconsistent:
-
(1)
carries a semiproper ideal.
-
(2)
carries a normal, fine, -complete -saturated ideal for some regular .
Proof.
If (1) holds then holds. By the proof of Theorem 1.4, (2) cannot hold. ∎
It seems that the “huge-type” saturated ideal is an anti-compactness principle around singular cardinals in the following sense.
Corollary 5.6.
If carries a normal, fine, -complete -saturated ideal for some regular and singular of cofinality then there is no supercompact cardinal between and .
Proof.
Suppose otherwise. Let be a supercompact such that . Let be a normal, fine, -complete -saturated ideal. If then forces both and the ideal generated by is a -saturated. The former follows from [5, Theorem 14]. The latter follows from Lemma 2.14
Note that a saturated ideal is -stationary preserving. Therefore the ideal is semiproper and -saturated ideal over in the extension. This contradicts to Theorem 1.4.
We assume is uncountable then forces that is supercompact and the generated ideal by is a -saturated ideal. The latter also follows from Lemma 2.14. In the extension, carries a -saturated ideal and . This is impossible.∎
Lastly, we point out that the semiproperness of saturated ideals can characterized by the following form:
Proposition 5.7.
For a fine ideal over with the disjointing property, the following are equivalent:
-
(1)
is semiproper.
-
(2)
is semiproper.
-
(3)
holds.
Proof.
We only check (3) (1). By the disjointing property of , for every countable with -name for a countable ordinals, and , there is an and such that . So, if has Player II’s winning strategy of Galvin game then this strategy shows is -positive. is a -semigeneric condition. ∎
6. -aspects of Strong compactness
In this section, we introduce the -aspects of strong compactness. We begin with Proposition 6.1.
Proposition 6.1.
The following are equivalent
-
(1)
.
-
(2)
for all .
-
(3)
is semiproper for all .
Proposition 6.2.
If is -strongly compact then is semiproper.
Proof.
Note that carries a fine ultrafilter . Then is -strategically closed by obvious reason. By Lemma 3.14, holds. In particular, holds too. ∎
Recall that our definition of is -strongly compact is that carries a fine ultrafilter. On the other hand, the original definition of strong compactness is due to Tarski. He introduced a logic that admits disjunctions of -many formulas and -many quantifiers. is strongly compact if, for every -theory , if is -consistent then is consistent. Here, by -consistent, we mean that is consistent for all . For a detail, we refer to [14, Section 4].
There is another formulation of strong compactness. We say that is -compact333This phrase is due to Gitik. if every -complete filter over can be extended to -complete ultrafilter. It was shown that is strongly compact if is -compact for all .
Hayut studied these compactnesses.
Theorem 6.3 (Hayut [13]).
If then the following are equivalent.
-
(1)
is -compact.
-
(2)
For every -theory with -many symbols, if is -consistent then is consistent.
(2) is called -compactness for languages of size . Then, Hayut claimed that -compactness affects to cardinals up to , contrary to -strong compactness only effects for . In [13], he also drew a picture like
-strong compactness | -compact | ||
-compactness for language of size | -strong compactness. |
We see a similar phenomenon in the view of semistationary reflection principles and semiproperness of Namba forcings.
Proposition 6.4.
If for all then the following are equivalent.
-
(1)
for all .
-
(2)
is semiproper for all .
Proof.
(2) to (1) follows from Theorem 1.6. (1) to (2) follows from Lemma 3.8. Indeed, for every semistationary subset for , let us check the semistationarity of is preserved by .
If then Lemma 3.8 works.
We let to denote for convenience by (1) or (2) above holds. is equivalent with . Of course, is equivalent to (1) and (2), respectively.
Proposition 6.5.
If is strongly compact. For an uncountable regular cardinal , forces .
Proof.
The standard generic elementary embedding argument shows for all . ∎
The following lemma is essentially due to Todorčević [25].
Lemma 6.6.
If is a fine ideal over then the following are equivalent:
-
(1)
holds. This is equivalent with is semiproper.
-
(2)
is non-stationary for all .
Proof.
The forward direction is clear. Let us check the inverse direction. We define a winning strategy of Player II for the Galvin game . Let be a sufficiently large regular cardinal. Let be a club subset such that . Consider an expansion . For given Player I’s move , Let . denotes the Skolem hull. It is easy to see that is a winning strategy. ∎
Importance is is forced to be non-semiproper by even if is stationary as follows.
Lemma 6.7.
Suppose that is a fine ideal over and . Then forces is non-semistationary.
Proof.
Let be -Namba tree such that
-
•
.
-
•
for all .
For every , let us define by . Here, is the -th element of . Note that force by the choise of . So is well-defined.
Let be a sufficiently large regular cardinal. We claim that if then for any . Suppose otherwise, let us fix such that forces . Putting , for every , we have
.
So . This is a contradiction.
Let be a -name for an expansion . For a contradiction, we assume that there is a that forces and . By the claim above, we have forces
.
This is a contradiction. Therefore is forced to be non-semistationary, as desired. ∎
Theorem 6.8.
If for all then the following implication holds:
is semiproper for all fine ideal over | |||
is semiproper | |||
. |
Proof.
The third implication follows from Theorem 1.6. The second implication is trivial.
Theorem 6.9.
Proof.
For the first line, let us give a model in which but is not semiproper. By the result of Baumgartner [1], Velic̆ković [29], and Sakai [23], it is known that is equiconsistent with the existence of a weakly compact cardinal.
On the other hand, If is semiproper then so is (Lemma 3.10). Shelah proved that the semiproperness of implies the Chang’s conjecture. So the consistency strength of the semiproperness of is stronger than that of an -Erdős cardinal.
Therefore, let us assume weakly compact cardinal exists in . In , by the above observations, we can get a model in which but is not semiproper, as desired.
For the third line, let us give a model in which is semiproper but fails assuming is a -strongly compact cardinal. We may assume . Then . Note that implies by Theorem 2.9. Let be the standard poset, that adds -sequence, of [2]. Note that does not changes and thus remains -strongly compact. By Proposition 6.2, the extension is a required model. ∎
As we have seen in Proposition 6.5, holds if is strongly compact or is Levy collapsed to some successor cardinal. Note that another reflection principle holds from the effect of strong compactness. For example, one of them is Rado’s conjecture.
For a tree of height , we say that is a special if there is an such that is an anti-chain for each . is the following statement: For every non-special tree of size has a non-special subtree of size .
Theorem 6.10.
implies holds.
Proof.
The same proof of [30, Theorem 5.2] works as well. ∎
It is also known that the inverse direction cannot be proven in 444For example, see [28, Theorem 1.7].. By the contents of this section, under the , we have the following diagram of strong compactness of .
is semiproper | ||||
is semiproper | ||||
is semiproper |
All of the inverse directions of the arrows above cannot be proven in modulo the existence of large cardinals. By this diagram, we can observe the strong compactness in more detail. We conclude this paper with the following question.
Question 6.11.
Is it consistent that is semiproper but is not semiproper for some fine ideal ?
References
- [1] James E. Baumgartner. A new class of order types. Ann. Math. Logic, 9(3):187–222, 1976.
- [2] James Cummings, Matthew Foreman, and Menachem Magidor. Squares, scales and stationary reflection. J. Math. Log., 1(1):35–98, 2001.
- [3] Philipp Doebler and Ralf Schindler. consequences of is precipitous and the semiproperness of stationary set preserving forcings. Math. Res. Lett., 16(5):797–815, 2009.
- [4] Todd Eisworth. Successors of singular cardinals. In Handbook of set theory. Vols. 1, 2, 3, pages 1229–1350. Springer, Dordrecht, 2010.
- [5] 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.
- [6] Matthew Foreman. More saturated ideals. In Cabal seminar 79–81, volume 1019 of Lecture Notes in Math., pages 1–27. Springer, Berlin, 1983.
- [7] Matthew Foreman. Ideals and generic elementary embeddings. In Handbook of set theory. Vols. 1, 2, 3, pages 885–1147. Springer, Dordrecht, 2010.
- [8] Matthew Foreman. Calculating quotient algebras of generic embeddings. Israel J. Math., 193(1):309–341, 2013.
- [9] Matthew Foreman and Richard Laver. Some downwards transfer properties for . Adv. in Math., 67(2):230–238, 1988.
- [10] F. Galvin, T. Jech, and M. Magidor. An ideal game. J. Symbolic Logic, 43(2):284–292, 1978.
- [11] Moti Gitik. The negation of the singular cardinal hypothesis from . Ann. Pure Appl. Logic, 43(3):209–234, 1989.
- [12] Gitik, M. Prikry-type forcings. In Handbook of set theory. Vols. 1, 2, 3, pages 1351–1447. Springer, Dordrecht, 2010.
- [13] Yair Hayut. Partial strong compactness and squares. Fund. Math., 246(2):193–204, 2019.
- [14] Akihiro Kanamori. The higher infinite. Springer Monographs in Mathematics. Springer-Verlag, Berlin, second edition, 2003. Large cardinals in set theory from their beginnings.
- [15] Kenneth Kunen. Saturated ideals. J. Symbolic Logic, 43(1):65–76, 1978.
- [16] Richard Laver. An -saturated ideal on . In Logic Colloquium ’80 (Prague, 1980), volume 108 of Stud. Logic Foundations Math., pages 173–180. North-Holland, Amsterdam-New York, 1982.
- [17] Yo Matsubara. Stationary preserving ideals over . J. Math. Soc. Japan, 55(3):827–835, 2003.
- [18] Yo Matsubara and Saharon Shelah. Nowhere precipitousness of the non-stationary ideal over . J. Math. Log., 2(1):81–89, 2002.
- [19] Telis K. Menas. On strong compactness and supercompactness. Ann. Math. Logic, 7:327–359, 1974/75.
- [20] Kanji Namba. Independence proof of -distributive law in complete Boolean algebras. Comment. Math. Univ. St. Paul., 19:1–12, 1971.
- [21] Prikry, K. L. Changing measurable into accessible cardinals. Dissertationes Math. (Rozprawy Mat.), 68:55, 1970.
- [22] Hiroshi Sakai. Semiproper ideals. Fund. Math., 186(3):251–267, 2005.
- [23] Hiroshi Sakai. Semistationary and stationary reflection. J. Symbolic Logic, 73(1):181–192, 2008.
- [24] Saharon Shelah. Proper and improper forcing. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, second edition, 1998.
- [25] Stevo Todorčević. Conjectures of Rado and Chang and cardinal arithmetic. In Finite and infinite combinatorics in sets and logic (Banff, AB, 1991), volume 411 of NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., pages 385–398. Kluwer Acad. Publ., Dordrecht, 1993.
- [26] Kenta Tsukuura. ON THE CENTEREDNESS OF SATURATED IDEALS. Tsukuba J. Math., 47(1):29–39, 2023.
- [27] Kenta Tsukuura. The extent of saturation of induced ideals. submitted.
- [28] Toshimichi Usuba. Reflection principles for and the semi-stationary reflection principle. J. Math. Soc. Japan, 68(3):1081–1098, 2016.
- [29] Boban Velic̆ković. Forcing axioms and stationary sets. Adv. Math., 94(2):256–284, 1992.
- [30] Jing Zhang. Rado’s conjecture and its Baire version. J. Math. Log., 20(1):1950015, 35, 2020.