An Extension of Shelah's Trichotomy Theorem
Shehzad Ahmed

TL;DR
This paper extends Shelah's pcf theory and trichotomy theorem to broader settings without size restrictions, providing new proofs and discussing challenges for further generalizations.
Contribution
It generalizes Shelah's trichotomy theorem to the setting where |A| is not less than min(A), and offers a modern proof of generator existence in pcf theory.
Findings
Generalization of Shelah's trichotomy theorem
New proof of generator existence in pcf theory
Discussion of obstacles to further generalizations
Abstract
In Sh506, Shelah develops the theory of without the assumption that , going so far as to get generators for every under some assumptions on . Our main theorem is that we can also generalize Shelah's trichotomy theorem to the same setting. Using this, we present a different proof of the existence of generators for which is more in line with the modern exposition. Finally, we discuss some obstacles to further generalizing the classical theory.
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.
An Extension of Shelah’s Trichotomy Theorem
Shehzad Ahmed
Ohio University
Dept of Math 321 Morton Hall
Athens, Ohio 45701-2979
Abstract.
In [8], Shelah develops the theory of without the assumption that , going so far as to get generators for every under some assumptions on . Our main theorem is that we can also generalize Shelah’s trichotomy theorem to the same setting. Using this, we present a different proof of the existence of generators for which is more in line with the modern exposition. Finally, we discuss some obstacles to further generalizing the classical theory.
1. Introduction
††I would like to thank Todd Eisworth for his assistance with the organization of the manuscript, and an anonymous referee for their helpful remarks which enhanced the clarity of the paper.
The pcf theory as presented in [6] has proven to be a powerful tool for analyzing the combinatorial structure at singular cardinals as well as their successors. Perhaps the most well-known consequence of the pcf-theoretic machinery is the following theorem due to Shelah:
Theorem 1.1** (Shelah).**
[TABLE]
This contrasts greatly with the situation for regular cardinals, and tells us that we can get meaningful results about the power of singular cardinals in ZFC. On the other hand, we know that some of this machinery can only work for singular cardinals which are not fixed points of the -function. Given suitable large cardinal hypotheses, one can use Prikry-type forcings to blow up the power of some -fixed points to be arbitrarily large (see [3] for an overview). So if the pcf machinery can be generalized to -fixed points, this can only be done in a restricted manner.
In [8], Shelah does precisely this. The pcf machinery is relativized to particular ideals over some set which need not satisfy . In particular, Shelah is able to obtain generators for every . The usual proof of the existence of generators requires obtaining universal cofinal sequences for each , and then showing that exact upper bounds for such sequences yield generators. In the classical case, one can make use of Shelah’s trichotomy theorem [6]:
Theorem 1.2** (Chapter II, Claim 1.2 of [6]).**
*Suppose that is a regular cardinal with , is an ideal over , and is an -increasing sequence of functions from to . Then satisfies at least one of the following conditions:
- (1)
**: has an exact upper bound such that for all . 2. (2)
**: There are sets for each such that and an ultrafilter over disjoint from such that, for all , there exists some and some such that . 3. (3)
Ugly*: There is a function such that, letting , the sequence (which is -increasing) does not stabilize modulo . That is, for every , there is some such that .*
In our desired applications, the functions will belong to , where is a collection of regular cardinals. So if does have an exact upper bound , it would be bounded above by the function . This means that if is Good as above, the requirement that for each will force that . So this version of trichotomy will not work in the more general setting of [8]. While Shelah pursues a different route, it is natural to ask whether or not one can generalize the trichotomy theorem. Of course, even if we obtain this more general trichotomy theorem, we still have to show that we can find sequences that are neither bad nor ugly. Our main theorem is that one can do precisely that.
This paper is organized as follows: In Section 2, we extend Theorem 1.2, and show that one can still construct sequences that are neither bad nor ugly. In Section 3, we use this to provide a streamlined proof of the fact that generators exist for . Finally, we show that the no holes conclusion must fail in general, and that the standard techniques for obtaining transitive generators cannot be generalized.
2. The Trichotomy Theorem
Our goal in this section is to generalize Theorem 1.2 by replacing the assumption that with assumptions about the ideal we are asking about. First, we fix some notation
Definition 2.1**.**
Suppose that is an ideal over a set of ordinals. Then
- (1)
We denote the dual filter by . 2. (2)
We say that property holds for -almost every if the set of such that holds is in the dual filter . 3. (3)
If are functions from to the ordinals, and is a relation on the ordinals, then we say if and only if . 4. (4)
Dually, if is a filter on , are functions from to the ordinals, and is a relation on the ordinals, then we say if and only if . 5. (5)
We say a set is -positive if . We denote the collection of -positive sets by .
We now isolate and discuss several properties of ideals that we will be working with.
Definition 2.2**.**
Suppose that is an ideal on some set . For a cardinal , we say that is weakly -saturated if there is no partition of into -many -positive sets.
Note that if is weakly -saturated, and is a cardinal above , then is also weakly -saturated. Further, note that is always weakly -saturated for trivial reasons.
Definition 2.3**.**
If is an ideal on a set , then let denote the least cardinal such that is weakly -saturated.
Another property that we will need indirectly is a weakening of -completeness.
Definition 2.4**.**
Suppose that is an ideal on some set . For a regular cardinal , we say that is -indecomposable if is closed under -increasing unions of length .
One thing to note above is that, unlike weak saturation, indecomposability is neither upwards nor downwards hereditary. While we will be making use of weak saturation directly in the next section, our use of indecomposability comes by way of combining it with weak saturation. In particular, we will make frequent use of the following result.
Lemma 2.1** (Proposition 2.6 of [2]).**
Let be an ideal on a set . The following are equivalent for a regular cardinal .
- (1)
* is weakly -saturated and -indecomposable.* 2. (2)
Whenever is a -increasing -sequence of subsets of , then there is some such that
[TABLE] 3. (3)
Whenever is a sequence of -positive sets, there is some such that
[TABLE]
At this point we can isolate one of the properties needed to push the generalized trichotomy theorem through.
Definition 2.5**.**
Let be an ideal on a set . For a regular cardinal , we say that is -regular if it satisfies one of the equivalent conditions in Lemma 2.1.
Note that will automatically be -regular. To see this, fix a sequence of non-empty subsets of . Then define a function by setting to be the least such that . Then there must be some of cardinality and such that for every . In particular, if is an ideal on a set of ordinals and , then will be -regular for every .
Definition 2.6**.**
Suppose that is an ideal on a set . Let denote the least regular such that is -regular.
For a set of ordinals, an ideal on , and a regular cardinal , recall that we are concerned with the following properties:
Definition 2.7**.**
Let be a collection of functions from to . We say that is an -upper bound for if for every . We say that is an -least upper bound for if additionally for every upper bound of . Finally, is an -exact upper bound for if is a least upper bound of , and is -cofinal in . If the ideal is clear from the context, then it may be omitted.
Definition 2.8**.**
Let be an -increasing sequence of functions from to . For a cardinal , we define the following properties of :
- (1)
**: has an exact upper bound with . 2. (2)
**: There are sets for each such that and an ultrafilter over disjoint from such that, for all , there exists some and some such that . 3. (3)
Ugly*: There is a function such that, letting , the sequence (which is -increasing) does not stabilize modulo . That is, for every , there is some such that .*
We begin by noting that the following two lemmas do not require any hypotheses on or . The first of the two lemmas appears as Claim A.2 of [4]
Lemma 2.2**.**
Suppose that is a set of ordinals, and is an ideal on . Let be regular and be -increasing. If is not Ugly, then every least upper bound of is an exact upper bound.
The next lemma appears in the middle of the proof of Theorem 2.15 of [1], but we prove it for the sake of completeness.
Lemma 2.3**.**
Suppose that is a set of ordinals, and is an ideal on . Further, suppose that and are regular, and that is a -increasing sequence of functions from to . If has an exact upper bound such that then satisfies .
Proof.
Let be an upper bound for with , and let be an ultrafilter over disjoint from such that . Next for each , let be cofinal in with , and let for each . For each , let be defined by for and otherwise.
Now for any we have that where . On the other hand, is exact and since is cofinal in -almost everywhere, it follows that there is some such that and so is bad as witnessed by and . ∎
With these two lemmas in hand, we move to the statement and proof of the trichotomy theorem.
Theorem 2.1** (Trichotomy).**
Suppose that is a set of ordinals, and is an ideal on . Let and be regular. If is a -increasing sequence of functions from to , then at least one of , , or must hold.
One thing to note is that the classical Trichotomy Theorem requires that , whereas we simply require that . By work of Kojman and Shelah in [5], the requirement that cannot be weakened to .
Proof.
We will show that, assuming is not Ugly, then we can either find a witness to or find a least upper bound for . By Lemma 2.2, this least upper bound is actually exact and so by Lemma 2.3 we can either find a witness to or witnesses . We proceed by induction on , and at each stage create a candidate for a least upper bound. We will terminate at successor stages if we have found a least upper bound, and at limit stages if we can construct a witness to . At the end, we will show that we must have terminated at some , else we will be able to derive a contradiction. At each stage , we will define:
- (1)
Functions which are -upper bounds for such that, for each , we have but . 2. (2)
Sets . 3. (3)
Functions for defined by .
Note here that 2) and 3) depend on how we define 1). Further, the sequence is -increasing in .
Stage : Here we let be any -upper bound of , for example works. Requiring that dominates everywhere ensures that the functions are defined everywhere.
Stage : Assume that has been define. If is a -least upper bound for , then we can terminate the induction. Otherwise is not a least upper bound, so there is some -upper bound such that but .
Stage limit: Suppose that is a limit ordinal and that has been defined for each . Now consider the functions and the sets
[TABLE]
for . Fixing the coordinate, the function is fixed while we run through and so the sequence is -increasing since the sequence is -increasing. Fixing the coordinate on the other hand, we fix and run through and so the sequence is -decreasing. Since is not Ugly, it follows that each sequence stabilizes modulo at some ordinal . That is, for all , we have that .
We have two cases to consider: either for each , or for all sufficiently large , we have . To see that these are indeed all of our cases, first note that whenever ,
[TABLE]
for since is -decreasing. So if there is some for which , then it follows that for each since and .
Assume that the former happens (i.e. for each ), and consider the sequence . Note that this sequence is -decreasing, and so has the finite intersection property. So let be an ultrafilter over extending , and note that is witnessed by and . By construction we know that for each . On the other hand, we have that since . If this happens, we can terminate the induction.
Otherwise, suppose that for each sufficiently large . Let be the least for which this occurs, and define . Note then that is an -upper bound of by construction, and so we only need to verify that while for each . Recall that while and is -decreasing. If , then since is an -upper bound for , and thus . Additionally, it follows that . Otherwise, for , we get that
[TABLE]
and so . This contradicts condition (1) of the induction, and so . It is worth noting that, in this case stabilizes modulo again by definition.
We claim that this induction must have terminated. Otherwise, for each , we have defined:
- (1)
Functions which are upper bounds for such that, for each with , we have but . 2. (2)
Ordinals such that for each .
Since with regular, we can see that is still below . Note that for each , so letting we have that enjoys the same properties as . Now for each , let be the successor of in , i.e.
[TABLE]
Define the sets
[TABLE]
for each . Now, for all , we have and hence . On the other hand, by construction each , and so the sequence has the property that, for some with , the intersection is non-empty. Letting be in this intersection, we see that for all :
[TABLE]
Thus, we have an infinite descending sequence of ordinals, which is a contradiction. Therefore the induction must have terminated and the theorem follows. ∎
One thing to note is that the trichotomy theorem above is indeed a generalization of the classical trichotomy theorem. This follows from the discussion above showing that any ideal on a set is automatically -regular. Our next goal is to show that, under the same assumptions as the above trichotomy theorem, one can actually build Good exact upper bounds. In other words, we need to show that it is still possible to produce sequences in which are neither Bad nor Ugly.
Implicit in [6] is the fact that one can manufacture sequences with a property that is referred to as in [1], and furthermore this property is equivalent to . The property and this equivalence are used to show that any Good eub will have an stationary set of good points. Unfortunately for us, it is not clear whether or not sequences satisfy if and only if they satisfy .
Fortunately for us, we can show that if a sequence satisfies , then it satisfies . Further, we can produce sequences which satisfy directly. Throughout, we will fix a set of ordinals , and an ideal on such that .
Definition 2.9**.**
Let be a set of ordinals, and let be a -increasing sequence of functions from to . We say that is strongly increasing if there are sets for each such that, for any , we have that for all .
The idea behind strongly increasing sequences is that the sets serve as canonical witnesses that the sequence is -increasing.
Definition 2.10**.**
Let be a regular cardinal, and let be a -increasing sequence of functions from to . Letting be a regular cardinal, we say that satisfies if for every unbounded in , there exists a set of size such that is strongly increasing.
We should note that satisfying for a sequence of functions is somewhat analogous to satisfying for an ideal .
Lemma 2.4**.**
Let be a regular cardinal, be a -increasing sequence of functions from to , and . If satisfies , then is not .
Proof.
Suppose otherwise, and let witness that is Ugly. That is, letting for each , the sequence does not stabilize modulo . So for each , there is some such that . Using this, we can find an unbounded such that, for all with , we have . Next, we use the fact that satisfies to fix a set of size such that is strongly increasing as witnessed by for each .
For each , let be the successor of in , and let
[TABLE]
Note that for each , and so we can find some of size such that . Let be in this intersection, and let with . Then we have that
[TABLE]
Note that we get the first inequality from the fact that , while the second inequality comes from the fact that with , and the final inequality comes from the fact that . This gives us that , which is of course a contradiction. ∎
Lemma 2.5**.**
Let be a regular cardinal, be a -increasing sequence of functions from to , and let be regular such that is -regular. If satisfies , then is not .
Proof.
Suppose otherwise, and let and witness that holds. Let be unbounded such that for all with , there is a function such that . Using the fact that satisfies , let be of size such that is strongly increasing as witnessed by for each .
As before, for each , we let be the successor of in . For each , let and define
[TABLE]
Note that , and so each is -positive. So we can find some of size such that , so let be in this intersection. Then for every with , we have that
[TABLE]
The first inequality follows from , while the third follows from the fact that . The second inequality comes from the fact that and . But then the sequence is strictly increasing along while which is absurd. ∎
So for our purposes, it suffices to be able to construct sequences satisfying for appropriate . We now quote Lemma 2.19 from [1], which gives us conditions for constructing such sequences.
Lemma 2.6**.**
Suppose that
- (1)
* is an ideal over ;* 2. (2)
* and are regular cardinals such that ;* 3. (3)
* is a -increasing sequence of functions from to such that for every , there is a club such that for some , we have*
[TABLE]
Then holds for .
It turns out that, while the above lemma looks technical, constructing sequences with the above properties is itself easy. The proof of the following theorem is identical to the proof of Theorem 2.21 of [1], but we include it for the sake of completeness.
Theorem 2.2**.**
Suppose that is a set of regular cardinals. Let be a regular cardinal such that is -directed, and let be any -increasing sequence of functions in . Then there exists a sequence such that:
- (1)
* is -increasing;* 2. (2)
for each , we have ; 3. (3)
for every regular such that , , and is -regular, we have that is .
Proof.
By Lemma 2.4 and Lemma 2.5, it suffices to produce a sequence which satisfies for every appropriate . In other words, we only need to produce a sequence satisfying the last condition in Lemma 2.6. We proceed by induction on .
At stage [math], we simply let be any function in . At successor stages, suppose that has been defined and let be defined by
[TABLE]
At limit stages , we have two cases to deal with. In the first case, we suppose that for as in condition , and let be club of order type . Define
[TABLE]
and note that whenever and so . In the other case, simply let be a -upper bound of and set .
By construction, the sequence satisfies the hypotheses of Lemma 2.6, and so we are finished. ∎
3. Generators for
In the classical pcf theory, the trichotomy theorem is used to produce generators for every . We would like to do exactly that for each when is a set of regular cardinals, and is an ideal on satisfying . As noted earlier, Shelah does obtain generators for in [8]. The benefit of our approach is that the exposition has been streamlined to mimic the modern development of pcf theory as found in [1]. The results in the section are due to Shelah unless otherwise noted.
Definition 3.1**.**
Suppose that is a partial order. We say that has true cofinality if there is a -linearly ordered family of cofinality which is itself cofinal in . In this case, we write , though the ordering may be omitted if it is clear from the context.
We should note that may not always be defined, as could very well not have a linearly ordered cofinal subset. When it is defined, it is always a regular cardinal and .
Definition 3.2**.**
Suppose is a collection of ordinals and is a fixed ideal over . Define
[TABLE]
.
As is linearly ordered, it follows that every element of is a regular cardinal.
Definition 3.3**.**
Suppose is a collection of ordinals and is a fixed ideal over . The ideal is defined to be the collection of sets satisfying:
- (1)
* or;* 2. (2)
for every ultrafilter over disjoint from , if , then .
We will denote these ideals by if the set is clear from context.
We now highlight a number of simple properties of and .
Lemma 3.1**.**
Suppose is a collection of ordinals and is a fixed ideal over .
- (1)
If , then is proper. 2. (2)
If , then . 3. (3)
If is a filter disjoint from with , then . 4. (4)
For which is -positive, if we set , then . 5. (5)
If and are ideals over such that , then . 6. (6)
If is such that , then .
Proof.
As the proofs of these results are routine, we will content ourselves with only proving , and leaving the rest for the reader.
(6): We already know that from (4), so it suffices to show the other direction. With that in mind, let and let be an ultrafilter over disjoint from such that . Note that so we can define which is an ultrafilter over extending . Now if we let be cofinal in , then we see that is cofinal in . Thus, . ∎
With (4) and (6) above in mind, we set aside some notation
Definition 3.4**.**
Suppose is a collection of ordinals, and is some ideal over . For any -positive , we define
[TABLE]
We first show that only assuming is enough to get -directedness of whenever it is proper. The following appears as Lemma 1.9 in [8], but we include a proof for the sake of completeness.
Lemma 3.2**.**
Suppose that is a collection of regular cardinals with no maximum, and that is an ideal over such that . If is a cardinal with proper, then is -directed.
Proof.
We will show by induction on that is directed. If is such that , then we let be defined by . Then since each is regular, it follows that and everywhere.
By way of induction, assume we have shown for some cardinal with , that is -directed, and let of size be given. We first assume that is singular. In this case, we can write such that . Then by assumption, we can bound each by some , and then bound the set by some . We then have that modulo for each .
So assume that is regular. We begin by replacing with a -increasing sequence . We just let be a -upper bound for . By construction, if we can find a such that modulo for each , then we will be done. At this point, we will proceed by induction on and attempt to construct a -increasing sequence of candidates for bounds of . As usual, we will show that this construction must terminate at some point, or we will be able to generate a contradiction.
By induction on , we will define functions , ordinals , and sequences with the following properties:
- (1)
and for all , we have that ; 2. (2)
; 3. (3)
For each , and every , we have that modulo .
The construction proceeds as follows. At stage , we simply let , and set (note that only matters when for some ordinal ). At limit stages, assume that has been defined for each , and define by setting . Note since and each is regular, that .
At successor stages, let , and suppose that has been defined. If is a -upper bound for , then we’re done and we can terminate the induction. Otherwise, note that the sequence is -increasing and so there is a minimum for which every has the property that (else if there is no such , then was indeed the desired bound). By definition, that means we can find some ultrafilter , disjoint from such that and . Thus it follows that must have a -upper bound in , say . We then define by .
Note that for each , we have that . On the other hand, our definition of gives us that since is at least everywhere. Thus, condition 3) is satisfied, as are 1) and 2) trivially by construction.
We claim that this process must have terminated at some stage. Otherwise, we let , and note that each since the induction never terminated. Next, we note that conditions 1) and 3) give us that for , we have and so . Therefore, for , we have that and so the sets and are disjoint -positive sets (since extends ). But then we have a partition of A into -many disjoint -positive sets, which is a contradiction. Therefore the process terminated at some point and (hence ) has a -upper bound. This completes the induction and the proof.
∎
Throughout the remainder of this section, we fix a set of regular cardinals with no maximum, and an ideal . In line with the notation of [1], we will isolate the additional hypothesis of Lemma 3.2.
Definition 3.5**.**
We say that is weakly progressive over if . We say that is progressive over if additionally, .
From -directedness, we immediately recover the following facts. Note that the proofs of the following two corollaries only utilize -directedness, and can be found in [1] as Corollary 3.5 and Corollary 3.7 respectively.
Corollary 3.1**.**
If is weakly progressive over , then for every ultrafilter over A disjoint from , if and only if .
Corollary 3.2**.**
If is weakly progressive over , then exists.
As we are aiming to obtain generators using the trichotomy theorem, our next natural step is to show that we can get universal cofinal sequences.
Definition 3.6**.**
Suppose that . A sequence of functions in is a universal cofinal sequence for if and only if
- (1)
* is -increasing.* 2. (2)
For every ultrafilter over disjoint from such that , is cofinal in .
Theorem 3.1**.**
If is weakly progressive over , then every has a universal cofinal sequence.
Proof.
The proof of this will be very similar to the proof of Lemma 3.2, insofar as we will proceed by induction on , and suppose that we fail to get a universal cofinal sequence at each stage. From this we will be able to produce a contradiction to weak saturation.
We will proceed by induction on , and construct candidate universal sequences . Now, we want to come up with sets that are -increasing in the coordinate but differ from each other modulo (and hence ). So we will ask that not only is the collection strictly increasing modulo in the coordinate, but that it is -increasing in the coordinate. With that in mind, we will use -directedness to inductively construct these sequences.
At stage , we let be any -increasing sequence in . We can create such a sequence inductively as follows: let be arbitrary, and then assume that has been defined for . By -directedness, we can find such that for all , and let .
At limit stages, let and assume that has been defined for each . We inductively define as follows: let , which is in since . Now suppose that has been defined for each , and let . Again , and let be such that for all by -directedness. Then define by , which is as desired.
At successor stages suppose that has been defined. If is a universal sequence, then we can terminate the induction. If not, we inductively define as follows: Since is not universal, we can find an ultrafilter over with the property that , but is -dominated by some (note that is disjoint from ). Let be a -increasing, cofinal sequence in . We define by setting . Now suppose that has been defined for each , and let be such that for all by -directedness. Then define by , which is as desired. Note that is cofinal in
We claim that we must have terminated the induction at some stage. Otherwise, we will have defined for each the following:
- (1)
Sequences which are -increasing in the coordinate, and -increasing in the coordinate. 2. (2)
Ultrafilters disjoint from such that is dominated by , and is cofinal in .
We will use this to derive a contradiction. We begin by letting be defined by setting (recall that ). By condition 2) above, for every , there exists an index such that . Since for regular, it follows that is below . So, for each , we have that . Now define the sets
[TABLE]
By construction, we have that since . On the other hand, since . So, it follows that modulo (hence modulo ). But since , we have that (in fact implies that ) and so we are in the same position as the proof of Lemma 3.2. That is, is a collection of -positive sets which are disjoint, contradicting weak saturation. Therefore, the induction must have halted at some stage and we are done.
∎
Now that we have universal cofinal sequences, we can recover the following corollary by repeating the standard arguments (Theorem 4.4 from [1]).
Corollary 3.3**.**
If is weakly progressive over , then .
Definition 3.7**.**
Let . We say that is a generator of (written ) if the ideal is generated by .
The pcf theorem (in the classical theory) is the statement that, for every , we can find a generator. We now show how to extract generators from universal cofinal sequences under the appropriate conditions. As the proof of the following lemma can be recovered by repeating the standard arguments (as found in the beginning of the proof of e.g. Theorem 4.8 of [1]), we omit said proof.
Lemma 3.3**.**
Suppose that has a universal cofinal sequence with an exact upper bound . Then the set is a generator for .
The following is immediate.
Theorem 3.2** (The pcf Theorem).**
If is progressive over , then for every , there exists a such that .
Proof.
Fix . Note that if and , then and, desired generator is simply . So, assume that and apply Theorem 3.1 to obtain a universal cofinal sequence for . As is directed and , we may apply Theorem 2.2 to obtain a -increasing sequence which pointwise dominates such that has an eub . It is easily seen that any -increasing sequence which -dominates is also universal for . Thus, we may apply Lemma 3.3 to to obtain the desired generator
[TABLE]
∎
As an easy corollary, we can obtain the compactness theorem modulo .
Theorem 3.3** (Compactness).**
Suppose that is progressive over , and let be a sequence of generators. For any -positive , we can find and such that
[TABLE]
Proof.
Recall that . As is still progressive over , it follows that exists, so let . If , then we have that . Otherwise, we note that is progressive over and so exists and is equal to some . Continuing on in this manner, we will reach some finite stage such that and . At this point, we are done since
[TABLE]
∎
4. Obstacles and Questions
With generators in hand, the natural thing to ask is whether or not one can obtain something like the no holes conclusion. That is, can we show that if is an interval of regular cardinals, then so is ? We should expect not, as only depends on modulo , and in general we cannot expect to only concentrate on intervals of regular cardinals.
Lemma 4.1**.**
It is consistent that is an interval of regular cardinals, while fails to be.
Proof.
For this, we work in a model where is strong limit while , and let . Note in this case that any ideal over will be -regular for every regular . Further, we have that by the classical pcf theory, and in particular we have generators for each . So we let for each , noting that we may assume that the sets are disjoint since is only unique modulo . Finally, let and let be the ideal over defined by
[TABLE]
We claim that . We begin by noting that each is unbounded in , and so extends the ideal of bounded sets. For each , we have that and so is a generator for . Therefore, for each . For such a , let be a universal cofinal sequence for with exact upper bound such that (recall that this is how we obtain generators in the first place). In this case, and so has a -upper bound. As is universal, it follows that there is no ultrafilter over extending the dual of with .
Now we only need to show that and we are done. For this, simply note that is -positive for or and so we can find an ultrafilter over disjoint from containing . Let be a universal cofinal sequence for with exact upper bound such that . Then is cofinal in , which means that for or . ∎
The next thing to note is that, even though the proofs may be different, we obtained generators for by generalizing the standard techniques. So, we might ask if it is possible to employ this strategy to obtain transitive generators.
Definition 4.1**.**
Suppose that is a set of regular cardinals, and is such that carries a generating sequence . We say that is transitive if for every , if , then .
Unfortunately, there are a number of obstacles to obtaining transitive generators through this route. In order to explain precisely what these obstacles are, we need several tools involving elementary submodels. Following standard abuse of notation, we will use to refer to the structure where well orders .
Definition 4.2**.**
Suppose are regular cardinals. We say is a -presentable substructure if where
- (1)
* for each ;* 2. (2)
* is -increasing and continuous;* 3. (3)
* for each ;* 4. (4)
; 5. (5)
* for each .*
Definition 4.3**.**
For any structure , we let denote the characteristic function of , defined by setting
[TABLE]
where is a regular cardinal. Note that if , then .
Let be a set of regular cardinals with , and fix a sufficiently large and regular . Let be a -presentable structure with , where . The arguments for producing transitive generators (Claim 6.7 and 6.7A of [7] and section 6 of [1]) rely on the fact that, for every , we can code a generator for by way of . More precisely, the key observation is Lemma 5.8 of [1], which we quote in a simplified form.
Lemma 4.2**.**
Suppose that are as above with . For , let be a universal cofinal sequence for , and let . Then the set
[TABLE]
is a generator for .
The generators obtained in this way are subsets of the ordinal closure of , which has cardinality . So suppose we only ask that , and we somehow manage to obtain transitive generators for some using -presentable structures. In doing so, we will have obtained generators above, which must have size . But then, we can employ Theorem 3.3 to see that there are for such that
[TABLE]
So then concentrates on a set of size . As will remain the same if we replace with an -equivalent set, this amounts to doing pcf theory in the classical case. So in order to have any hope of obtaining transitive generators for more than just the classical case, we would need to use different techniques and perhaps utilize stronger assumptions on , , or even than just .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Uri Abraham and Menachem Magidor. Cardinal arithmetic. In Matthew Foreman and Akihiro Kanamori, editors, The Handbook of Set Theory , volume 2, pages 1149–1228. Springer, 2010.
- 2[2] Todd Eisworth. Club guessing, stationary reflection, and coloring theorems. Annals of Pure and Applied Logic , 161:1216–1243, 2010.
- 3[3] Moti Gitik. Prikry-type forcings. In Matthew Foreman and Akihiro Kanamori, editors, The Handbook of Set Theory , volume 2, pages 1351–1448. Springer, 2010.
- 4[4] Menachem Kojman. Exact upper bounds, and their uses in set theory. Annals of Pure and Applied Logic , 92:267–282, 1998.
- 5[5] Menachem Kojman and Saharon Shelah. The pcf trichotomy theorem does not hold for short sequences. Archive for Mathematical Logic , 39:213–218, 2000.
- 6[6] Saharon Shelah. Cardinal Arithmetic , volume 29 of Oxford Logic Guides . Oxford University Press, 1994.
- 7[7] Saharon Shelah. Further cardinal arithmetic. Israel Journal of Mathematics , 95:61–114, 1996.
- 8[8] Saharon Shelah. The pcf theorem revisited. Algorithms and Combinatorics , 14:420–459, 1997.
