This is the first out of a series of posts on the following theorem.
Theorem (Erdos-Dushnik-Miller, 1941). For every infinite cardinal , we have:
Namely, for any coloring there exists either a subset of order-type with , or a subset of order-type with .
In this post, we shall focus on the case that is a regular cardinal.
Notice that the case is precisely the infinite Ramsey theorem. Also notice that a statement of the form is syntactically stronger than the above statement. To appreciate this difference, let us mention the following four:
Theorem (Laver, 1973). entails .
Theorem (Todorcevic, 1983). entails for every .
Theorem (Todorcevic, 1989). If , then .
Proposition (folklore). whenever .
Proof. Fix an injection . Define as follows.
Given , let iff . There are the two possible cases.
Case 1: there exists a subset of order-type such that . Let denote the increasing enumeration of . By the definition of , and since is injective, we must conclude that is a strictly decreasing sequence of ordinals. This is a contradiction.
Case 2: there exists a subset of order-type for which . Let denote the increasing enumeration of , then is a subset of of order-type . This is a contradiction, as well.
In the case that is indeed regular, the Erdos-Dushnik-Miller theorem will follow from the following stronger result.
Theorem (Erdos-Rado, 1956). For every regular uncountable cardinal , we have:
Proof. Suppose that we are given a coloring . Fix an elementary submodel such that and is an ordinal of countable cofinality, say .
If there exists a cofinal subset of of order-type for which , then we are done (as would make a closed copy of ). Next, suppose this is not the case.
It follows that there exists a finite set and an ordinal such that the two holds:
- ;
- for every .
Fix such and . Then are in , and hence all of the following sets are in as well:
Evidently, . Thus, we are left with establishing that is a stationary subset of . As , the latter task reduces to showing that . Namely, that . We have already seen that , thus to see that , we fix an arbitrary and verify that .
Note that:
I. (since )
II. (since )
III. (since )
IV. (by item I and since )
So, alotgether, it must be the case that .
In an unpcoming post, we prove the Erdos-Dushnik-Miller theorem for the case of a singular . We shall also point out that fails for singular cardinals of countable cofinality, but otherwise holds provided that .
We conclude this post with one last no-can-do observation:
Proposition (folklore). for every ordinal of uncountable cofinality.
Proof. Split into two pairwise disjoint stationary sets, and . Define by letting iff .
Now, in any club , we can find and , and infer that . I.e., for every club .
On the other front, if is a subset of of size , then for some , we have . Consequently, .
Open Problem: Is it consistent that ?
That was a fast write-up Assaf!
I see that you simplified some of the arguments by writing `let b be a finite subset…’ as opposed to writing out the elements. This is a good habit that I keep trying to develop.
For clarification, did you mean to omit the superscript 2 in some of the arrow notations? (eg. the folklore propositions, the Todorcevic theorems)
Thanks for your feedback, Mike!
Indeed, I started by writing down the individual elements, but then got annoyed by the option that the set which I eventually called would be empty, so took another approach.
Thanks also for pointing out the superscript omissions. I will fix this.
Here’s a question that’s bothering me. Shelah’s paper that you linked (“The Erdos-Rado Arrow for Singular Cardinals”) gives a positive result for cardinals satisfying the particular relation that you state. But it does not say anything about the case where that relation fails. So for example, if , we do not know whether or not . I think that means that this problem is still open, right? If so, then why does the MathSciNet review for that paper of Shelah state “The author settles a question of Erdos, Hajnal, Mate and Rado, proving…”, when the question is only partly solved?
My guess is that the reviewer was under the impression that this solves the problem, because Shelah announced in an older paper that is consistent.
As far as I know, this theorem was never published, and this must mean that Shelah found a gap in the alleged proof.
Altogether, I would say that this question is still open.
For a regular cardinal , the relation can be iterated to give (for finite k). This works if all you want is the homogeneous set of the required order type. But can we get
that is relatively closed in the stationary set, not necessarily closed in the original lambda. Is there another way to do the iteration?
It seems to me that this doesn’t follow automatically, since the stationary subset of lambda is not necessarily closed, so when you iterate you get only a copy of
The above proof actually gives you what you are looking for. Namely, that whenever is a regular uncountable cardinal, and is stationary, then to any coloring , either there exists a stationary subset with , or for some closed subset of order-type .
Simply take the model such that and .
Pingback: Dushnik-Miller for regular cardinals (part 2) | Assaf Rinot
Pingback: Dushnik-Miller for singular cardinals (part 2) | Assaf Rinot
Pingback: Fourteenth Linkfest
Hi Assaf,
I think there’s a minor mistake in your proof of the Theorem, but it can be fixed and actually simplifies the proof a bit. You state is evidently true, but in fact this is the case iff . Since it’s clear that , is stationary, so it actually suffices to show that . This is easy: take . Then by points II, III, and IV at the end of the proof.
Cheers,
Amit
Thank you, Amit! . In any case, to make the “evidently” truly evident, I changed the definition of from
The proof indeed (implicitly) shows that
to
Thanks, again.
Hi Assaf,
Yes, I think that works. My suggestion was that you don’t even need to mention . Clearly so is stationary. Then you can show using the exact same argument (points I-IV) you used to show , just replace all occurrences of with some with .
Interestingly, with it's easy to see that it's stationary but it takes an argument to show that its image under is . For it's the opposite: its image is clearly (given your new definition) but it takes an argument to show it's stationary. Even more interestingly, the argument to show the image of is is exactly the same argument used to show is stationary. So doesn't gain you anything.
Cheers,
Amit
I totally agree. Basically, I had to choose between writing “Here’s an homogenous set — let’s see that it is large” to “Here’s a large set, let’s see that it is homogeneous” :).
Pingback: The P-Ideal Dichotomy and the Souslin Hypothesis | Assaf Rinot
The “Open Problem” above is answered (positively), assuming the consistency of a measurable cardinal, in this paper by Raghavan and Todorcevic:
https://doi.org/10.1007/s11856-018-1677-1
thanks!
As to the result of Erdos and Rado assuming CH it holds that: , also the 0-homogeneous set can be made stationary [Handbook of Set Theory, ch. 2., 3.11]. Can it be strengthened to also require the 1-homogeneous set to be closed, i.e. a club subset of some uncountable ordinal ?
Hi David! Let us demonstrate that . , fix a club in of order-type , such that, for every limit ordinal , and every , iff .
For every limit ordinal
and then pick a coloring