In this post, we shall provide a proof of Silver’s theorem that the Erdos caridnal relativizes to Godel’s constructible universe.
First, recall some definitions. Given a function , we say that is a set of indiscernibles for iff for every and every , we have . Let denote the assertion that every function admits a set of indiscernibles of order-type . Then, one defines the -Erdos cardinal, as follows:
is the least cardinal (if exists) for which .
We mention that Erdos and Hajnal proved that entails , and that a cardinal is said to be Ramsey iff it is the -Erdos cardinal, i.e., .
Silver’s idea for relativizing goes through a reformulation of the statement concerning the existence of a set of indiscenribles, in terms of the failure of well-foundedness of a related poset. This leads us to revisiting this subject:
Definition. A poset is said to be well-founded iff every non-empty subset has a -minimal element . (the latter means that for all )
Fact (ZF). Suppose that is a poset whose underlying set admits a well-ordering , then all of the following are equivalent:
- is well-founded (slang: “ does not admit an infinite -descending chain”);
- if is an order-reversing map, then its image is finite;
- there exists an ordinal and a function such that for every distinct elements : implies .
Proof. Recursively define
Of course, is an increasing chain of subsets of , and so by the axiom of replacement, there exists some such that . Note that , because otherwise, would be non-empty, and one could find a minimal ; it will then follow from the minimality of in , that . So , contradicting the definition of .
Thus, define (the rank function) by letting for all . Then has the desired properties.
Let witness (3). Suppose that is order-reversing. Then is an order-reversing map from ordinal to ordinals, and hence is finite. Since is linearly-ordered by , is finite iff is finite. Consequently, the image of is indeed finite.
Suppose that is non-empty subset of without a minimal element. Define a relation of over , as follows: iff , that is,
Note that entails , and that for every , there exists a unique such that . Let us say that a function is good, if is a positive integer, , and if , then .
Let . Then a second look at the definition of reveals that is a function. Moreover, since does not contain a minimal element, we get that is infinite. As implies , we conclude that is an order-reversing function with an infinite image.
Proposition (ZF). admits a well-ordering.
Proof. Given , we let iff one of the following holds:
- ;
- ;
- and and . (here, .)
We need to show that is linearly-ordered, and well-founded. It is obvious that for every , we either have or , and that if and , then . Next, suppose that and . We need to verify that . To avoid trivialities, we may assume that . If or , then , and we are done. So, we assume that . Put .
- If , then and . So and .
- If , then and . So and .
Next, we verify well-foundedness. Suppose that is a non-empty subset of . If , then it is the minimal element of , and we are done. Suppose now that this is not the case, and let be the least natural number for which there exists with . Put . Next, let , and put . Then for , let , and put . Then is a singleton whose element is the minimal element of .
Terminology. Let us say that two functions are compatible iff for every , we have
Lemma (ZF). Given a function , a (countable) ordinal , and bijection , denote Then has a set of indiscernibles of order-type iff is not well-founded.
Proof. As admits a well-ordering, we know that is well-founded iff it does not admit an infinite -descending chain iff if does not admit an infinite -increasing chain.
Suppose that has a set of indiscernibles of order-type . Fix an order-preserving injection such that is a set of indiscernibles for . Define by letting for all . As is order-preserving, we get that and are compatible, and then for all . As is an increasing -chain, we infer that is not well-founded.
Suppose that is not well-founded, and let be an increasing -chain within . Let . Then , and are compatible. Put . Then is a set of indiscerinbles for . Finally, since are compatible and , we get that and has the same order-type. That is .
We know that properties (e.g., being an ordinal, being a function) are absolute for all transitive models of , and hence properties are upward absolute, and properties are downward absolute. In particular, properties are absolute. Let us point out that this is indeed the case here:
Suppose that are as in the preceding lemma. Then has a set of indiscernibles of order-type iff the following formula (with a parameter ) fails:
Recalling the fact that we proved at the beginning of this post, we get as well that has a set of indiscerinbles of order-type iff the following formula (with a parameter ) fails:
[Note that the negation of a statement is again ]
Corollary (Silver, 1970). Suppose that is transitive model of ZF, and with . If holds (in the universe), then
In particular, if exists, say it is , then .
Proof. Suppose that is a given coloring in , and . Our goal is to find (within ) a set of indiscernibles for of order-type .
Fix in , a bijection . As holds in the universe, there exists a set of indiscernibles for of order-type . So is not well-founded. Since , we infer that , and so by absoluteness for properties: It now follows from the lemma that contains a set of indiscernibles for of order-type .
For completeness, we mention that Rowbottom proved in his dissertation that the existence of the Erdos cardinal contradicts the axiom . (Thus, improving Scott’s famous theorem that the existence of a measurable cardinal implies .) It follows that Silver’s theorem that relativizes to for all is best possible.
Enjoyed your talk in class, by the way!
Thanks
1) In the sentence defining indiscernibles, you switch between the variables and , where both letters are referring to the same set. 3), toward the end of the line, should be . instead of , but at the beginning of the proof of the Lemma it still says "As admits a well-ordering…", which should be .
2) In the second bullet point of the proof of (1
3) I see you changed the Proposition to use
4) I see you've already made the other corrections that I was going to suggest!
5) What's the reason for using the terminology of "indiscernibles" rather than referring to "homogeneous sets"?
Hi Ari,
Thank you very much for your comments!
I think that the term “homogeneous” is more common for colorings of the form (where one usually mean that is monochromatic with resepct to ), while “indiscernibles” is for colorings of the form (where is monochromatic for each ).
Hey Assaf, I’m glad you posted this, it’s really interesting! (especially since I missed your lecture). I think the explanation on why people use the term “indiscernibles” rather than just “homogeneous” can be seen if you follow the link that appears when you first mention Ramsey cardinals. On that webpage, they explain the model-theoretic caracterization, in which it is more natural to call the homogeneous set “a set of indiscernibles”.
I agree. The model-theoretic perspective is clearer.
Also, in the second line of the Proof of the last Lemma, I would add the word “infinite” right before both “ -descending chain” and “ -increasing chain”.
Thanks! Now, corrected.
Pingback: The chromatic numbers of the Erdos-Hajnal graphs | Assaf Rinot
Pingback: Prikry Forcing