WorksMathematics
On a problem of Erdos and Hajnal
Abstract
We address a question of Erdős and Hajnal about the ordinary partition relation . For , assuming they proved the negative relation and asked whether the (local instance of) GCH is indispensable. We show that this negative relation is consistent with being a strong limit and . The result can be pushed down to .
2010 Mathematics Subject Classification. 03E02, 03E04, 03E55.
Key words and phrases. Infinite combinatorics, GCH, stick, tiltan, singular cardinals hypothesis, pcf theory.
The research was supported by Israel Science Foundation Grant no. 1838/19 and Grant no. 2320/23. This is publication 1249 (the 204th prime number) of the third author, publication 47 (the 15th prime number) of the first author and publication 37 (the 12th prime number) of the second author.
Introduction
Let be a graph of size . One may wonder whether there must be a monochromatic triangle under any edge coloring . The answer is trivially no, since the graph can be a set of isolated vertices with no edges at all, or a triangle-free graph. Thus in order to make the above question interesting, one should assume that there are many edges (and, in particular, many triangles) in the graph. One possible way to do it uses the following concept. A set of vertices is called independent if . If is of size and there are no independent subsets of size in , then there are many edges in the graph and the question makes more sense.
The above discussion can be formulated in the language of partition calculus, without mentioning graphs at all. The ordinary partition relation says that for every coloring there is either so that , or and so that . A particular interesting case is when . In terms of graph theory, one can interpret the coloring as assigning zero to pairs of vertices with no edge, and some color to edges of a given graph. The positive relation means that either there is an independent set of size , or a monochromatic triangle.
Erdős, Hajnal and Rado investigated this relation in [8]. They established several results, and focused in particular on graphs whose size is a successor of a singular cardinal. A good account appears in the monograph [7], in which the following is phrased and proved:
Theorem 0.1. Assume that is a singular cardinal and . Then .
Actually, they proved something a bit stronger, see [7], Theorem 20.2. A natural question is whether the assumption is removable. Let us indicate that if one forces then a negative result obtains, as mentioned in [7]. Thus we shall assume from now on that , and in fact we shall force the negative relation while is a strong limit singular cardinal. The first case, in this context, is . In a collection of unsolved problems [6], Problem 5, the pertinent question appears as follows:
Question 0.2. Can one prove without assuming GCH that the relation holds?
It appeared, again, in [7], Problem 20.1.1 Despite the fact that powerful methods for dealing with successors of singular cardinals are available today, the problem is still open. A recent survey by Komjáth, [15], describes the progress in every problem from the list of Erdős and Hajnal, and according to this survey no progress has been made with regard to this problem. In this paper we intend to show that is consistent with , where is singular and strong limit.
Our strategy is to replace the hypothesis by pcf arguments. More specifically, we obtain unbounded sequences of regular cardinals below that satisfy some relevant negative arrow relation, and we make sure that the true cofinality of these sequences is . These assumptions enable us to lift the negative relations below to , even if .
This approach is rendered here twice. Firstly, we get the negative arrow relation where each is a successor of a singular cardinal, simply by assuming GCH below , and then we lift this relation to . The drawback here is that must be a limit of singular cardinals with the same cofinality. Thus cannot be handled in this way. Secondly, we modify the negative arrow relation over each in such a way that it applies to regular cardinals even though these cardinals are not successors of singular cardinals. This strategy applies to small cardinals like the s, and consequently the negative arrow relation can be forced over .
There is another possible approach towards the same negative arrow relation. This approach is based on prediction principles from the tiltan family. Suppose that diamond holds at , in which case . In many cases, diamond can be replaced by weaker prediction principles like tiltan or stick. Usually, these principles at are consistent with . We shall prove that yields the negative arrow relation . However, we do not know whether is consistent with when is a strong limit singular cardinal. Recall that in the size of the guessing sets is , and this is the main problematic issue in our context. This point will be discussed in the relevant section.
The rest of the paper contains three additional sections. In the first section we solve the general problem using simple arguments of pcf theory. As mentioned above, this solution does not cover the case of . In the second section we modify the pcf arguments and show how to push down the result to . Finally, in the third section we show that a special version of stick at yields the desired negative arrow relation.
Our notation is coherent with [7]. We shall use the Jerusalem forcing notation, namely we force upwards. A function is a set mapping if whenever . A subset is free for iff whenever . If then we let . If then is a stationary subset of .
We shall use the idea of indestructibility (at supercompact cardinals) as appeared in the seminal work of Laver, [16]. It is shown there that a supercompact cardinal can be made indestructible under any generic extension by -directed-closed forcing notions. In our context, we need a modification of Laver’s proof, applicable to strategically-closed forcing notions. This version will be phrased and proved below. For basic background concerning Prikry type forcings we refer to [11], and to the papers of Magidor [17] and [18] in which the basic method of Prikry forcing with interleaved collapses was introduced. We also refer to [13] in this context. For background in pcf theory we suggest [1], [4] and [21].
A negative relation from simple pcf arguments
In this section we suggest our first approach for proving the negative relation where is a strong limit singular cardinal and . The idea is to assume the negative relation at an unbounded sequence of cardinals below (by assuming GCH at these cardinals) and to obtain the negative relation at by means of pcf theory. Recall that iff there is a -cofinal and increasing sequence in the product , and is the minimal length of such a sequence. We commence with the combinatorial theorem, followed by a description of the ways to force the assumptions in this theorem.
Theorem 1.1. Assume that:
(a) .
(b) is a strong limit cardinal.
(c) .
(d) is increasing and .
(e) for every .
(f) is a strong limit cardinal for every .
(g) for every .
(h) .
Then .
Proof.
For every let be a witness to the negative relation . This negative relation follows from assumption (g). Our goal is to define a coloring by combining the s together in such a way that the corresponding negative relation at will follow.
We need two mathematical objects to define our coloring. The first is a scale in the product . The second is a system of functions where is injective and for each . Also, if then . Suppose that . Let be the minimal so that . Such an ordinal always exists since . We define the coloring as follows. Given let and let .2 Let us show that exemplifies the negative relation .
(ℵ) Assume that . For every let . Set , and notice that . Fix . For every we choose such that . Since (this inequality follows from (f)), there are a set and a fixed element such that if are taken from then and for every . Since witnesses the negative relation , one can choose such that and . But then , so the proof of the first case is accomplished.
(□) Assume that . If or or then cannot be -monochromatic with any color since for one has and by the definition of . If then with implies , since is injective. But this is impossible by the choice of , so we are done.
A corollary to the above theorem gives an answer to the question of Erdős and Hajnal. Within the proof of this corollary we force with from [12] Definition 2.3. For being self-contained, we unfold the definition of this forcing notion.
Let be supercompact, and let be an increasing sequence of regular cardinals so that for every . A condition is a pair such that and . We refer to as the stem of . Also, and . If then iff and for every .
Intuitively, adds a function which dominates every old function in this product. If in the ground model then is -cc. Also, is -strategically-closed. Hence one can iterate and preserve cardinals. If is the length of the iteration then the generic functions added at each step form a scale. Moreover, upon singularizing either by Prikry or by Magidor forcing one preserves the properties of this scale, thus forcing in the generic extension.
Corollary 1.2. Assuming the existence of large cardinals in the ground model, one can force with and is a strong limit cardinal.
Proof. Our goal is to force the assumptions of Theorem 1.1. Let be a supercompact cardinal and fix a regular cardinal . We may assume that is Laver-indestructible, and GCH holds above . Let be an increasing sequence of singular cardinals so that for every and . We may assume that for every .
We force with followed by Magidor forcing to make to obtain the assumption . If then one can simply use Prikry forcing. Thus, the length of the iteration should be an ordinal of cofinality . We increase to any desired point (this can be done by choosing the length of the iteration to be in the desired cardinality). Notice that remains true, as is -strategically-closed for every and the component of Prikry or Magidor forcing also preserves this fact. Thus the assumptions of Theorem 1.1 hold in the generic extension, and the corollary follows.
It seems that the above method cannot be applied to . The main point is that our singular cardinal of cofinality should be a limit of singular cardinals with the same cofinality. Thus, the negative colorings along the way are always with the same number of colors (namely, ) and hence one can produce a coloring over the cardinal with -many colors. Since there are no singular cardinals below at all, the above proof is inapplicable as it is to this case. However, seems suitable for this pattern of proof. Indeed, the cofinality of is and it is a limit of singular cardinals of countable cofinality.
Theorem 1.3. Assuming the existence of large cardinals in the ground model, one can force with and is a strong limit cardinal, where .
Proof. Let be a strong cardinal and let be a regular cardinal. Let be a -extender and let be the canonical embedding, where . We assume GCH in the ground model. In order to force the above statement at we use the Extender-based Prikry forcing, and in order to obtain the negative relation at we use the same forcing with interleaved collapses.
Let be -generic for this forcing notion. Notice that is a strong limit cardinal in , and . Likewise, is a singular cardinal of countable cofinality in the generic extension, and GCH still holds below in . We can add the collapses to make in .
Let be the Prikry forcing added through the (unique) normal ultrafilter of . It is known that in the generic extension. Moreover, up to a modification of a proper initial segment, this is the only sequence with true cofinality in this product. Hence, if is an increasing sequence of singular cardinals with countable cofinality such that then in . For these facts we refer to [13]. We see that all the assumptions of Theorem 1.1 hold, and therefore . In the setting of the Extender-based Prikry forcing with interleaved collapses we can make in . This is the first infinite cardinal which can be represented as a limit of a sequence as above, so the proof is accomplished.
We conclude with a couple of open problems. Maybe the most interesting problem which issues from our study is whether the negative relation holds in ZFC. We believe that the positive relation is consistent, but we do not know how to prove this:
Question 1.4. Is it consistent that is a strong limit singular cardinal and ? Is it forceable at ?
It follows from the proofs in this section that a positive answer to the above question must be forced by adding a lot of bounded subsets to . In any attempt to force a positive relation one has to eliminate GCH at every unbounded sequence of cardinals in whose true cofinality is .
More pcf and the case of
In this section we prove that the negative relation is consistent with being a strong limit singular cardinal and even if is not a limit of singular cardinals. In particular, this setting is forceable at .
The basic idea is similar to that of the proof of Theorem 1.1 in the previous section. Namely, from negative arrow relations on a sequence of cardinals below one obtains the negative arrow relation at , provided that the true cofinality of the sequence is . Thus, pcf theory enables us to lift combinatorial properties below to . However, in order to incorporate into this framework one has to prove relevant statements about regular cardinals (e.g., the s). For those cardinals we refine the negative partition relation to a weaker negative partition relation, relative to certain filters. Using an appropriate pcf structure that respects those filters, we will obtain the parallel of Theorem 1.1.
So, first we deal with obtaining those weaker instances of the negative partition relation from local instances of the generalized continuum hypothesis. This is the content of the first proposition of this section.
Claim 2.1. Assume that are regular cardinals and . Then there exists a pair such that:
(a) .
(b) is a -complete (proper) filter over .
(c) If and is constantly zero then .
(d) If then .
Proof. Enumerate the elements of by , where and each appears -many times in the enumeration. We shall define as , so we define and an ordinal by induction on as follows. For let and if is a limit ordinal then .
If then we define and (so is picked at the th stage). Let be the minimal so that and is constantly zero, if there is such an ordinal. If not, let . Now if then let . For every let if and let if . Thus extends , and the new values are determined according to the membership in . Let .
Let be the ideal that is -generated by the 0-monochromatic subsets of under , and the bounded subsets of . Formally, for every let iff there are and for every so that for each and . Let be the dual filter, namely . Clearly, is a -complete filter over . We must prove, however, that is a proper filter (or, in other words, that ). Assume towards contradiction that . Fix and for every such that is constantly zero for each and . Since is regular, is bounded in . We may assume, without loss of generality, that for every , since can be augmented by adding every of size less than to .
We choose a sequence of ordinals with no repetitions such that for every . The choice is possible since for every . For every let and let . Notice that since is regular, and hence as well. Apply Hajnal’s free subset theorem to the collection and let be free. That is, if then .
Let be an increasing function satisfying . Let . Observe that and is constantly zero. Indeed, if and then . But then by definition, and we know that as both and belong to .
Recall that appears many times in our enumeration of the elements of . At some point there will be an ordinal so that and is the first ordinal for which , since the previous ’s will be exhausted. From this argument it follows that can be arbitrarily large, so we choose so that . Since , there is some such that . By definition, as well, thus as is constantly zero. However, , so , a contradiction.
The above claim is exactly what we need in order to lift negative partition relations to the negative arrow relation over a successor of a singular cardinal. We emphasize that the coloring may possess a 0-monochromatic set of size . Only the weaker statement is guaranteed. But this will be sufficient as shown in the following.
Theorem 2.2. Suppose that:
(ג) If for every then there is such that for every one can find so that whenever .
Then .
Proof. We define as follows. For every we let , and . Now if then we define . Otherwise, we set .
We claim that witnesses the negative arrow relation . To show this, we must prove two propositions. Firstly, let us show that if then the graph has no triples. Indeed, if then the triple is -monochromatic under , contradicting (B)(ג) as . Secondly, we argue that if then is not constantly .
To see this, assume towards contradiction that is a counterexample. For every let . We distinguish two cases. In the first case, for some . Fix such and choose for every so that . For every let . Thus . Since is -complete and , for some one has . By assumption (B)(ג), there are so that and . By definition, . But , so , a contradiction.
In the second case, for every . Define . From (C)(ג) we see that , as for every \alpha\in A\eta_\alpha(i)\in A_ii\in\thetaA\subseteq B|A|<\lambda$, a contradiction.
2.2
In order to utilize the above theorem one has to show that the assumptions there hold (or can be forced) under the relevant circumstances. The assumptions of (A) are easily satisfied for an appropriate choice of cardinals when is a strong limit singular cardinal. The assumptions of (B) follow from Claim 2.1. Thus the only challenge is (C), and this is our next goal.
Lemma 2.3. Let be a strongly inaccessible cardinal. Let be an unbounded set of regular cardinals. For every let be a -complete filter over . There is a -strategically-closed -cc forcing notion , for which the following hold in the generic extension by :
(ℵ) is a scale in .
(ג) For every there is such that for each there exists such that if then . Proof. Let be a -support iteration of length , where is (a name of) a forcing notion defined in the generic extension by as follows. A condition is a pair , where is a function with for some and is a sequence of sets . For every one has and for every one has . If then iff , whenever and if then . Thus approximates a function in in a Hechlerish style. We shall say that is the stem of and is the pure part of .
Observe that is (forced to be) -strategically-closed. In fact, if then there exists a -directed-closed dense open set of conditions, that is, . To see this, suppose that is directed. Define and for every let . Notice that since and is -complete. Now is an upper bound for . It is easy to see that is -centered. Indeed, if and then . Since the number of stems is (recall that is strongly inaccessible) we conclude that is -centered.
Let be generic. Define . By the directness of and simple density arguments, is a function, and for every . Let . Observe that is -strategically-closed and -cc. Indeed, is a -support iteration and each component in the iteration is -strategically-closed and -centered. Fix a -generic set . Let us show that the statement of the lemma holds in .
As noted above, . Since is -strategically-closed, no new bounded subsets of are introduced in . However, new sequences of measure-one sets (of length ) are introduced. Fix such a sequence . Since is -cc, there must be some so that . We claim that if then there exists such that whenever . If we prove this statement then the proof of the lemma will be accomplished.
To see this, let be an arbitrary condition that forces to be a sequence of measure-one sets. Fix . Define so that , and let . We require that for every . This is possible as is a -name and hence also a -name. Finally, let . If then , so as was arbitrary we are done.
2.3
Remark that for densely many conditions , for every , the stem of the condition is a canonical name of a ground model function. Hence we may assume, without loss of generality, that this is true for every condition in .
By the previous lemma, we can force our pcf assumption using a -strategically-closed forcing notion. We would like, therefore, to prove that a supercompact cardinal will remain supercompact after such a forcing. This will be instrumental since we will singularize this cardinal with various kinds of Prikry-type forcings. Thus we have to show that a supercompact cardinal can be indestructible under such forcings. We shall follow the ideas of Laver, with slight little changes, in order to force this property over a supercompact cardinal in the ground model.
As our forcing is not sufficiently directed closed, we need a weaker property that would imply the existence of a master condition for lifting certain supercompact embeddings.
Lemma 2.4. Let and be as above, and let . Suppose that is a directed set of conditions, , and for every one has . Then there exists a master condition so that for every .
Proof. We commence with letting . For every let and let , for every . We prove by induction on that is a condition and for every .
For this is trivial, and for a limit ordinal it follows from the fact that . We are left with the successor steps, so fix . By the induction hypothesis, forces to be a sequence of measure-one sets for every . Hence is a condition. It remains to show that for every .
Fix . From the definition it follows that and for every relevant . Suppose that . Since is the union of s, there exists for which and . Since is directed, there exists such that . It follows that , and hence , so we are done.
As mentioned before, we need the above lemma in order to prove a version of Laver’s indestructibility. In the work of Laver, a supercompact cardinal is forced to be indestructible under any -directed-closed forcing notion. One cannot expect to be indestructible under every -strategically-closed forcing, since one can force a non-reflecting stationary set with such a forcing notion. However, if the set is sufficiently sparse then one can prepare the universe so that the corresponding forcing notion will preserve the supercompactness of . This is the content of our next lemma, and the main idea is that we define the Laver iteration only with respect to some strategically closed forcing notions.
Lemma 2.5. Let be supercompact and assume GCH. There is a forcing notion such that the following holds in the generic extension by . If is a set of double-double successors of strongly inaccessible cardinals and is a -complete filter over for every then the associated forcing preserves the supercompactness of as well as GCH.
Proof. Let be a Laver function. Let be the Easton support iteration where is an -name of the trivial forcing unless is strongly inaccessible, for each and is a pair of the form and is an -name of some -strategically-closed forcing notion that preserves GCH.
One can verify that is -cc and if is an inaccessible closure point of then is preserved by . It follows from the choice of the s and standard arguments that GCH holds in the generic extension by . Choose a -generic set , and in choose a -generic set . We claim that is supercompact in .
To see this, suppose that is an arbitrary ordinal and is a -supercompact elementary embedding, with . By increasing if needed we may assume that . We may also assume that is an ultrapower embedding derived from some fine and normal measure over .
By elementarity, , where is -closed in .
Let . By the closure of and the fact that we see that . Moreover, satisfies the assumptions of Lemma 2.4. Indeed, by the choice of we know that and . Hence Lemma 2.4 applies and there is a master condition for .
By GCH, which holds in , the number of dense subsets of is . Using the fact that is -closed, one can construct an -generic set containing . By the nature of , is contained in . Hence Silver’s criterion applies and lifts to . Thus is -supercompact in . But was arbitrary, hence one concludes that is supercompact in and the proof is accomplished.
The above setting is rendered in a universe satisfying GCH. Our goal, however, is to force the negative arrow relation when . Furthermore, we wish to force this relation at . We shall use the extender-based Prikry forcing in order to increase , and the corresponding version with interleaved collapses in order to push down the result to . The presentation of these forcing notions is inspired from the work of Merimovich, see e.g. [19].
Let be the universe obtained by the preparatory forcing . Fix such that every element of is of the form , where is a strongly inaccessible cardinal, and is unbounded in . For every let be as guaranteed in Claim 2.1. Namely, has no 1-monochromatic triangle and if is 0-monochromatic under then , where is a -complete proper filter over . We denote the dual (proper) ideal by , so is -generated from the bounded subsets of and the 0-monochromatic sets of the coloring .
Let be the forcing notion associated with , and let be the extension of by . Let be the generic scale. Fix a -extender in and let be the extender ultrapower map. Let be the (unique) normal measure of , and let be the corresponding ultrapower embedding. Let be -generic for the forcing . Let be the quotient map, and let be the generic set generated by .
Claim 2.6. is -generic for the forcing .
Proof. Let be a dense subset of , and assume that . We must show that . By the nature of , there are for some and so that . Define . Clearly , and since is -distributive and is the intersection of less than dense open sets, we see that is dense and open. Thus and hence . Notice that for , hence . In particular, as sought. 2.6
Working in , let be the extender-based Prikry forcing with interleaved collapses, using the extender and the set as a guiding generic. Following [19], for every let . Thus is a -complete ultrafilter over , and is a partial increasing function from to . Since concentrates on such objects we may assume, without loss of generality, that if then is a set of partial increasing functions with domain contained in .
We define our forcing notion as follows. A condition is a quadruple of the form , where:
(a) is a partial function from to .
(b) satisfies .
(c) for every and we let .
(d) , where and .
(e) .
(f) If then , and .
(g) is a function from to .
(h) For every , .
(i) .
We have to define the forcing order. To this end, we define the direct order and one point extensions. Then we let the forcing order be a finite sequence of these two extensions.
Assume, therefore, that . We shall say that is a direct extension of (denoted by ) iff the following hold:
() . In particular, .
() .
() extends for every .3
() for every (here is the order of the collapse).
Assume now that and . We define the one-point extension (or Prikry extension) as a condition satisfying the following requirements:
() if , and if .
() .
() .
() .
Finally, extends iff can be obtained from by a finite sequence of direct extensions and one-point extensions. Clearly, if then the process of deriving from can be introduced as one single direct extension followed by a finite sequence of one-point extensions.
Notice that is -closed since is -complete and the collapses are -complete. It is known that satisfies the strong Prikry property, preserves cardinals above (including itself), forces , preserves GCH below and forces .
Claim 2.7. Let be a name for the normal Prikry sequence. Suppose that and is a -name of an ordinal in . There exists a condition so that and a function with , such that for every and .
Proof. Let be a dense open sets deciding the value of . By the strong Prikry property there are a natural number and a condition such that and every extension of by -many one-point extensions belongs to . Recall that is the domain of . Let be a sequence of -many one-point extensions of such that the value of is decided by and these s. Since and we may assume (by shrinking if needed) that for every and every it is true that . Moreover, by fixing a bijection and shrinking further we may assume that . Consequently, for every . Hence we can define as the set of all possible values for using with , and get as required.
□ 2.7
For every let be the -complete filter over derived from Claim 2.1. The forcing certainly introduces new bounded subsets of , so we must show that the relevant assumptions of Theorem 2.2 remain true in the generic extension by . We commence with the following:
Claim 2.8. Let be the coloring described in Claim 2.1. Let be a name of a 0-monochromatic set under . Then is (forced to be) contained in the union of less than many 0-monochromatic sets from the ground model.
Proof. Fix an enumeration of , for every , in the ground model. We are assuming GCH in the ground model, hence the size of the enumeration is . Let be an arbitrary condition that forces to be 0-monochromatic. By extending if needed we may assume that . In other words, is decided by .
Let , that is, is the product of the first collapses mentioned in the condition . Note that and the next collapses are at least -closed. Let enumerate . By induction on we define a condition such that:
(ℵ) is -increasing.
(ב) is constant.
(ג) If there is a direct extension of which is the same as except that and decides the truth value of the statement then already decides this statement.
Let be an upper bound of . Such an upper bound exists since all the relevant components are sufficiently closed. Let denote the condition obtained from upon replacing by .
Let . For every let , so and . Furthermore, is 0-monochromatic under for every such that , hence . We conclude, therefore, that is (forced to be) covered by a ground model set in , as required.
□ 2.8
Let . We claim that is a scale satisfying the required assumption of Theorem 2.2. Specifically, we must show that for every sequence of sets where for each , there exists such that if then for some one has whenever .
By Claim 2.8 we may assume that for every . Notice, however, that the whole sequence need not be in . Let be an arbitrary condition in . Applying Claim 2.7 repeatedly and using the enumeration of the ground model sets, we construct a -increasing sequence such that and , where for every .
Since is -closed, there exists a single condition such that for each . For every let . By the closure of we see that . By the construction, belongs to the ground model and hence there is an ordinal such that for every there exists so that whenever . This completes the proof, as for every .
In order to force the failure of SCH at , as done in our results, one has to assume the existence of a measurable cardinal with in the ground model. This fundamental result was proved by Gitik in [9] and in [10]. In our constructions we started from a supercompact cardinal in the ground model. The gap between these large cardinals invites the following:
Question 2.9. Let be a strong limit singular cardinal.
(א) What is the consistency strength of the negative arrow relation with ?
(ב) What is the consistency strength of the same negative relation with where ?
(ג) What is the consistency strength of the negative relation at every strong limit singular cardinal , in a universe in which at every such ?
A negative relation from stick
In the previous sections we used pcf assumptions in order to cope with the problem of Erdős and Hajnal. We move now to the second approach in which prediction principles play an important role. The prediction principle that we need for the combinatorial proof is called stick. The idea of stick as a prediction principle is well-articulated in [2], Chapter 4(12): “It consults its stick, its rod directs it”. Here we need the mathematical incarnation of this idea. We commence with the following definition.
Definition 3.1. Suppose that .
(ℵ) .
(♢) Denote by .
The stick principle is closely related to the club principle, but no stationary sets are involved in the prediction. This fact makes very useful when is a singular cardinal. Let us recall the definition of the club principle (or tiltan), which appeared for the first time in [20]. If and is stationary, then a tiltan sequence is a sequence of sets, where is a cofinal subset of for each ,4 and if then is stationary. One says that holds if there exists such a sequence.
We proceed to the combinatorial result. Our goal is to prove the relation from the stick principle . Negative partition relations at successors of a regular cardinal follow from as shown in [5]. Here we apply a similar idea to successors of singular cardinals. We need the following lemma about free sets from [14]. The lemma and its proof also appear in [7], Lemma 20.3.
Lemma 3.2. Let be a regular cardinal. Suppose that , and for every . Assume further that is a set mapping, and for every . Then there exists a free set for so that for every .
We can state now the following:
Theorem 3.3. suppose that and assume that holds. Then .
Proof. Let be an increasing sequence of infinite cardinals such that . Notice that the enumeration of these cardinals begins with since we wish to save the first color to the full-sized independent subsets of the graph. We shall define a partition of .5 Then, essentially, for we will set iff .6 The partition will be based on a sequence of set-mappings in the following way. For every we shall define such that for every . We let . This procedure defines for , and we let .
The construction of each is by induction on , where at the th stage, is defined simultaneously for each . Fix and suppose that is already defined for every and every . Let be a sequence, so for every . Let . Notice that and hence there exists a decomposition of the form , where and for every .
In order to define for each , fix an ordinal and apply Lemma 3.2, where here stands for there, and here stands for there. Notice that for each by the induction hypothesis, so the assumptions of the lemma hold. By the conclusion of the lemma, there exists a free set for which satisfies for every . By removing elements from if needed, we may assume that , so we can define . This completes the definition of our set mappings, and consequently the definition of , the partition of .
We define, at this stage, the coloring by letting iff is the first ordinal so that . We claim that witnesses the negative relation to be proved. To see this, let us show firstly that there are no and such that where . Indeed, if and then . This means that . But is a free set with respect to , and , hence . Since one concludes that . Therefore, .
Secondly, we argue that there is no -monochromatic subset of of size . To see this, fix . Choose an ordinal such that . If and then, by definition, . Since is unbounded in , one can choose such that . Recall that we had a partition , hence for some . By the choice of we know that , so one can choose . The fact that implies that . Hence . Since and , one concludes that , so we are done.
We would like to emphasize an important aspect of the proof. The size of each is , as our guessing principle is . simpler if we could replace by or by for some . One should ask, therefore, whether is essential for the combinatorial proof above. To wit, one should ask why do we insist on guessing sets of size . The point lies in Lemma 3.2. In order to find a free set that meets every , one must verify that is sufficiently large. In the context of our proof, one needs for some relevant , where plays the role of within the proof of the theorem. However, we do not know in advance the identity of , and it might appear as any in the sequence . It seems that the only way to cope with this problem is by taking the s to be of cardinality .
Though we do not know how to force with the failure of SCH at , we can describe a possible strategy towards this goal. Let be a supercompact cardinal and let be a normal ultrafilter over . One says that holds every family contains a subfamily so that . One can force such an ultrafilter over a supercompact cardinal , see e.g. [3]. If one forces Prikry through such an ultrafilter then every new set of size in the Prikry generic extension contains an old set of size . Thus if stick or tiltan hold at in the ground model, this will be preserved in the generic extension. Moreover, this is true for a variety of Prikry-type forcing notions, including Prikry forcing with interleaved collapses. There are also several ways to force stick or tiltan at a supercompact cardinal while increasing above . We do not know, however, to force these two things together:
Question 3.4. Is it consistent that is supercompact, is a normal ultrafilter over satisfying , holds and ?
References
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Email address: [email protected]
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Email address: [email protected]
Institute of Mathematics The Hebrew University of Jerusalem, Jerusalem 91904, Israel and Department of Mathematics Rutgers University New Brunswick, NJ 08854, USA
Email address: [email protected]
URL: http://www.math.rutgers.edu/~shelah
References
- [1]Uri Abraham and Menachem Magidor. Cardinal arithmetic. In Handbook of set theory. Vols. 1, 2, 3, pages 1149–1227. Springer, Dordrecht, 2010.DOI
- [2]Hosea Ben Be’eri. The book of Hosea. In Prophets. 727 B.C.E.
- [3]Tom Benhamou, Shimon Garti, and Alejandro Poveda. Negating the Galvin property. J. Lond. Math. Soc. (2), 108(1):190–237, 2023.
- [4]Maxim R. Burke and Menachem Magidor. Shelah’s pcf theory and its applications. Ann. Pure Appl. Logic, 50(3):207–254, 1990.
- [5]William Chen, Shimon Garti, and Thilo Weinert. Cardinal characteristics of the continuum and partitions. Israel J. Math., 235(1):13–38, 2020.DOI
- [6]P. Erdős and A. Hajnal. Unsolved problems in set theory. In Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967), pages 17–48. Amer. Math. Soc., Providence, R.I., 1971.DOI
- [7]Paul Erdős, András Hajnal, Attila Máté, and Richard Rado. Combinatorial set theory: partition relations for cardinals, volume 106 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 1984.
- [8]P. Erdős, A. Hajnal, and R. Rado. Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hungar., 16:93–196, 1965.DOI
- [9]Moti Gitik. The negation of the singular cardinal hypothesis from o(κ) = κ⁺⁺. Ann. Pure Appl. Logic, 43(3):209–231, 1989.
- [10]Moti Gitik. The strength of the failure of the singular cardinal hypothesis. Ann. Pure Appl. Logic, 51(3):215–240, 1991.
- [11]Moti Gitik. Prikry-type forcings. In Handbook of set theory. Vols. 1, 2, 3, pages 1351–1447. Springer, Dordrecht, 2010.DOI
- [12]Shimon Garti and Saharon Shelah. A strong polarized relation. J. Symbolic Logic, 77(3):766–776, 2012.DOI
- [13]Yair Hayut. Prikry type forcings and the Bukovský-Dehornoy phenomena. preprint, 2023.
- [14]András Hajnal and Attila Máté. Set mappings, partitions, and chromatic numbers. In Logic Colloquium ’73 (Bristol, 1973), volume Vol. 80 of Stud. Logic Found. Math., pages 347–379. North-Holland, Amsterdam-Oxford, 1975.DOI
- [15]Péter Komjáth. The Erdos-Hajnal problem list. Bull. Symbolic Logic, page To appear, 2025.DOI
- [16]Richard Laver. Making the supercompactness of κ indestructible under κ-directed closed forcing. Israel J. Math., 29(4):385–388, 1978.
- [17]Menachem Magidor. On the singular cardinals problem. I. Israel J. Math., 28(1-2):1–31, 1977.DOI
- [18]Menachem Magidor. On the singular cardinals problem. II. Ann. of Math. (2), 106(3):517–547, 1977.DOI
- [19]Carmi Merimovich. Mathias like criterion for the extender based Prikry forcing. Ann. Pure Appl. Logic, 172(9):Paper No. 102994, 6, 2021.
- [20]A. J. J. Ostaszewski. On countably compact, perfectly normal spaces. J. London Math. Soc. (2), 14(3):505–516, 1976.
- [21]Saharon Shelah. Cardinal arithmetic, volume 29 of Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York, 1994. Oxford Science Publications.