Prikry-type Forcing and the Set of Possible Cofinalities
Abstract.
It is known that the set of possible cofinalities has good properties if is a progressive interval of regular cardinals. In this paper, we give an interval of regular cardinals such that has no good properties in the presence of a measurable cardinal, or in generic extensions by Prikry-type forcing.
Key words and phrases:
pcf theory, Prikry-type forcing, Prikry forcing, Magidor forcing2020 Mathematics Subject Classification:
03E04, 03E35, 03E551. Introduction
Cardinal arithmetic has been one of the most important areas in set theory. Shortly after Cohen devised the method of forcing, Easton [3] proved that the powers of regular cardinals is subject only to König’s theorem in ZFC. Easton’s theorem left the behavior of the powers of singular cardinals as the Singular Cardinal Problem. Some time later, Silver [11] proved the first nontrivial result around the problem: Singular cardinals of uncountable cofinality cannot be the least cardinal at which the Generalized Continuum Hypothesis (GCH) fails. Still later, Shelah [10] developed pcf theory and established a result that supersedes Silver’s theorem:
Theorem 1.1 (Shelah).
.
An outline of the proof is as follows. First we have . The crucial claim is that . Shelah proved it by analyzing the structure of . More specifically, he obtained the latter inequality by showing the following results for a progressive interval of regular cardinals :
-
•
is an interval of regular cardinals with a largest element.
-
•
.
Theorem 1.1 can be generalized for a non-fixed point of the function. Let be a singular cardinal with . Shelah proved that for some progressive interval of regular cardinals with . As before, this reduces the investigation of the power of to that of the structure of . Note that we can take to be progressive because is a non-fixed point of the function. Thus the assumption of being progressive seems essential in pcf theory. Now one may ask
Question 1.2.
What if is a non-progressive interval of regular cardinals?
Motivated by the question, we prove in this paper
Theorem 1.3.
Suppose is a measurable cardinal. Then the following hold:
-
.
-
Prikry forcing over forces that .
From Theorem 1.3 (1) we get
Corollary 1.4.
Suppose is a measurable cardinal. Then the following hold:
-
has no largest element if is singular.
-
if .
Corollary 1.5.
Suppose there is a supercompact cardinal. Then in some forcing extension there is a non-progressive interval of regular cardinals such that is singular, has no largest element and .
The proof of Corollary 1.5 is as follows. Let be a supercompact cardinal. We may assume that is indestructibly supercompact in the sense of Laver [6]. This enables us to get a model in which is supercompact and is a singular cardinal . Finally, Prikry forcing gives a model in which is as desired by Theorem 1.3 (2). See Corollary 3.1 for an additional property of the final model.
Some large cardinal hypothesis is necessary in Theorem 1.3. Assume on the contrary that GCH holds and there is no weakly inaccessible cardinal. A simple argument shows that if , then has no maximal element, so that has a largest element and .
2. Preliminaries
In this section, we recall basic facts of pcf theory and Prikry forcing. For more on the topics, we refer the reader to [1] and [4] respectively. We also use [5] as a reference for set theory in general.
Our notation is standard. We let denote the class of all regular cardinals. Let . Then is the set . Let be a filter over . We define a strict order on by iff .
Definition 2.1.
For ,
Note that . If there is an increasing and cofinal sequence in of length for some filter over , then .
A set is progressive if . An interval of regular cardinals is a set of the form for a pair of cardinals . Here is the fundamental theorem on progressive intervals of regular cardinals.
Theorem 2.2 (Shelah).
If is a progressive interval, then we have
-
has a largest element.
-
.
-
.
Theorem 2.3 is known as the scale theorem.
Theorem 2.3 (Shelah).
Suppose is a singular cardinal. Then there is a set such that and has an increasing and cofinal sequence of length . Here, is the cobounded filter over . In particular, .
Next, we recall basic facts of Prikry forcing from [9]. Let be a measurable cardinal and a normal ultrafilter over . Prikry forcing is the set ordered by iff (i.e. ), and .
has the -c.c. and size . Thus, does not change the value of for any . preserves all cardinals above but changes the cofinality of . Let be a -name such that , where is the canonical -name for a generic filter. Then is forced to be a cofinal subset of of order type . Moreover, we need
-
•
. In particular, for every .
-
•
If , then .
The latter property follows by forces .
For subsequent purposes, we present a direct proof of Prikry lemma. Suppose . The diagonal intersection is defined to be the set . Since is normal, we have .
Lemma 2.4.
Suppose and . Then any extension of is compatible with .
Proof.
Let . Then by and . Thus is a common extension of and , as desired. ∎
Lemma 2.5 (Prikry lemma).
Let and be a statement of the forcing language. Then there is an such that decides , i.e. or .
Proof.
For each define as follows: If , let be the unique set from the following mutually disjoint sets
-
•
.
-
•
.
-
•
.
Otherwise, let . For each define as follows: If there is a such that decides , let be one such . Otherwise, let . We claim that is as desired. Take an arbitrary extension that decides . We may assume with . Note that decides . We may assume . Then by Lemma 2.4. Thus forces . We claim that , which completes the proof by repeating the argument.
It suffices to show that any extension of is compatible with a condition forcing . Let . We may assume . Note that by , and hence by . Let . Then , so for some , and hence . Note that by and . Thus is a common extension of and , as desired. ∎
Corollary 2.6.
adds no new bounded subsets of . In particular, preserves all cardinals below .
3. Prikry Forcing and a Non-progressive Interval
The first half of this section is devoted to
Proof of Theorem 1.3.
Let be a measurable cardinal. Take a normal ultrafilter over and form . For each , we can choose such that by .
Note that . To complete the proof, it suffices to show that in both cases, (1) and (2).
(1) Let . Then we may assume . Since , we have
Note that is strictly increasing. Define an ultrafilter over by iff . Then we have .
Since is increasing and cofinal in , we have , as desired.
(2) Let be Prikry forcing defined by . Note that the set remains the same after forcing with and is singular. Let . It suffices to prove that . Again, we may assume . First, note that
Since , we have
Here and are -names for the order on defined by the cobounded filter over , and the cobounded filter over respectively. Thus it suffices to prove
-
(i)
is increasing in .
-
(ii)
is cofinal in .
(i) Let . Then . If , then , as desired.
(ii) By the proof of (i), it suffices to show that is forced to be cofinal in .
Assume . For each define and as follows. Note that forces and hence . By Prikry lemma, there is a that decides for every . Then we can take an such that
For each define
Since is regular, we have in . Let . We claim that for every , which completes the proof. It suffices to show that any extension of forcing is compatible with a condition forcing .
Suppose forces . By the property we saw in Section 2, we have . is compatible with forcing , as in the proof of Prikry lemma. ∎
Corollary 1.5 shows that the assumption of being progressive is necessary in Theorem 2.2 (1) and (2). Corollary 3.1 does the same for Theorem 2.2 (3).
Corollary 3.1.
One can add “” to the list of properties of in Corollary 1.5.
Proof.
The rest of this section is devoted to improving Corollary 3.1. Define for by and .
Theorem 3.2.
Suppose is an increasing sequence of supercompact cardinals. Then the following hold in some forcing extension:
-
is a singular cardinal of cofinality .
-
for every .
Lemma 3.3 ensures that sets of the form remain the same throughout forcing extensions for Theorem 3.2.
Lemma 3.3.
Suppose , and has the -c.c. with . Then .
Proof.
In , let be arbitrary. Then there are an ultrafilter over and an increasing and cofinal sequence in . Let be a -name for the filter generated by . Since remains regular after forcing with , it suffices to prove that is forced to be increasing and cofinal in .
It is easy to see the former. For the latter, it suffices to prove that is forced to be cofinal in . Assume . For each , define
Then for every . Since has the -c.c. and is regular, we have in , as desired. ∎
Proof of Theorem 3.2.
We may assume that each is indestructibly supercompact in the sense of Laver [6] and . We refer the reader to [2] for more details.
Let be the full support product , where is the poset adding many Cohen subsets of . Standard arguments show that preserves cofinalities and forces for every . We claim that forces for every .
4. An Analogue for Magidor Forcing
Prikry forcing is known for a wealth of variations. In this section, we give an analogue of Theorem 1.3 (2) for one of them. Here we take up Magidor forcing from [7], but the argument works equally well for other variations, e.g. the diagonal Prikry forcing as defined in [8].
Magidor forcing uses a sequence of ultrafilters rather than a single ultrafilter, and makes a hypermeasurable cardinal into a singular cardinal of uncountable cofinality. For normal ultrafilters over , iff . Let be a -increasing sequence with . Note that there is a such sequence if is supercompact. For any , we fix a function such that . For each , define
Note that . Magidor forcing is the set of pairs such that
-
•
is an increasing function such that
-
–
and .
-
–
-
•
is a function such that
-
–
and ),
-
–
For every , if , . Otherwise, where .
-
–
is ordered by iff , and . has the -c.c. and size . Thus, does not change the value of for any . preserves all cardinals above but changes the cofinality of like Prikry forcing. Let be an -name such that , where is the canonical -name for a generic filter. is forced to be an increasing sequence of length which converges to . As in Prikry forcing, we also have
-
•
.
For each , We let and . Here, and are and respectively. The orders on and are naturally defined by that on . can be factored as follows.
Lemma 4.1.
For every and , we have
Note that has the -c.c. Lemmas 4.2 and 4.3 are analogues of Lemmas 2.4 and 2.5 for Magidor forcing respectively. See [7] for proofs.
Lemma 4.2.
Suppose that and is a set of extensions of where . Then there is a such that and every extension of is compatible with if .
Lemma 4.3 (Prikry lemma).
For every and statement of the forcing language, , there is a such that
-
•
and .
-
•
If decides , then decides .
Here is the fundamental theorem of Magidor forcing:
Theorem 4.4 (Magidor).
The following hold:
-
adds no new subsets of . In particular, remains the same by .
-
preserves all cardinals.
-
forces that is a strong limit singular cardinal of cofinality .
Now we get an analogue of Theorem 1.3 (2) for Magidor forcing.
Theorem 4.5.
forces that .
Proof.
By the proof of Theorem 1.3, it suffices to show that . Note that remains the same after forcing with . Let . Let us see that .
For every and , we fix a function such that . We may assume . Let be a function in such that for any .
We will show that forces has an increasing and cofinal sequence of length . Here, is an -name for the order on defined by the cobounded filter over . This gives the desired result, as shown by the following argument:
By a usual density argument, we can find an -name such that forces the following properties:
-
•
.
-
•
.
And thus, by the proof of Theorem 1.3, we have
.
Here, is an -names for the cobounded filter over . It follows that forces has an increasing and cofinal sequence of length .
For every , let be an -name for a function . It suffices to prove
-
(i)
is increasing in .
-
(ii)
is cofinal in .
(i) Let . Note that we have for each . Let be arbitrary. Define . Here, . Then forces for every .
(ii) Let and be arbitrary. Suppose . By the proof of (i), we may assume that for all . For each define and as follows. If , by Lemma 4.3 and , there is a such that
-
•
.
-
•
if forces , then .
Define by
.
Then,
.
For with , and .
For each , since has the -c.c., . For every , define . Because of , we have for every . Let . By Lemma 4.2 and the proof of (i), there is an extension such that
-
•
every extension of is compatible with if .
-
•
.
Lastly, we claim that for all . Let and be arbitrary. Extending we may assume that . Now, we can find such that and . By the certain property of , and have a common extension forcing , as desired. ∎
Theorem 4.5 enables us to generalize Theorem 3.2 as follows, including the case of uncountable cofinality.
Theorem 4.6.
Suppose is an increasing sequence of supercompact cardinals greater than a regular cardinal . Then in some forcing extension the following hold:
-
is a singular cardinal of cofinality .
-
for all .
-
.
For , define
Note that GCH implies for every . By Theorem 4.6, it is consistent that is -increasing for some . We conclude this paper with the following
Question 4.7.
Is it a theorem of ZFC that for every there is an such that ?
References
- [1] Abraham, U. and Magidor, M. Cardinal arithmetic. In Handbook of set theory. Vols. 1, 2, 3, pages 1149–1227. Springer, Dordrecht, 2010.
- [2] Apter, A. W. Some results on consecutive large cardinals. Ann. Pure Appl. Logic 25(1983), no.1, 1–17.
- [3] Easton, W. B. Powers of regular cardinals. Ann. Math. Logic 1 (1970), 139–178.
- [4] Gitik, M. Prikry-type forcings. In Handbook of set theory. Vols. 1, 2, 3, pages 1351–1447. Springer, Dordrecht, 2010.
- [5] Kanamori, A. The higher infinite. Springer Monographs in Mathematics. Springer-Verlag, Berlin, second edition, Large cardinals in set theory from their beginnings, Paperback reprint of the 2003 edition, 2009.
- [6] Laver, R. Making the supercompactness of indestructible under -directed closed forcing. Israel J. Math. 29(1978), no.4, 385–388.
- [7] Magidor, M. Changing cofinality of cardinals. Fund. Math. 99(1978), no. 1, 61–71.
- [8] Neeman, I. and Unger, S. Aronszajn trees and the SCH. In Appalachian set theory 2006–2012, volume 406 of London Math. Soc. Lecture Note Ser., pages 187–206. Cambridge Univ. Press, Cambridge, 2013.
- [9] Prikry, K. L. Changing measurable into accessible cardinals. Dissertationes Math. (Rozprawy Mat.) 68(1970), 55.
- [10] Shelah, S. Cardinal arithmetic. volume 29 of Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York, Oxford Science Publications, 1994.
- [11] Silver, J. On the singular cardinals problem. In Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), Vol. 1, pages 265–268, 1975.