In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found in this previous blog post.
Shelah’s construction of a coloring witnessing with no rainbow triangles was from CH, but there is a finer proof assuming the existence of a Luzin set (see Erdos-Hajnal, 1978). I am not aware of a ZFC construction, but another consistent construction is the following:
Theorem (Todorcevic, 1981). Suppose is a regular uncountable cardinal, and there exists a -Souslin tree. Then there exists a coloring witnessing that does not admit a rainbow triangle.
The goal of the current post is to present Todorcevic’s proof by relying on the notion of a prolific Souslin tree.
Definition (Brodsky-Rinot). A subset is a prolific -Souslin tree iff , has no antichains of size , and for all and : and are in .
Remark. The above definition is slightly simpler than the one of our paper, but the two coincide on all tree levels .
A folklorish observation asserts that the existence of a -Souslin tree entails the existence of a prolific one. Before we prove this, let us show how to derive Todorcevic’s theorem.
Let be a prolific -Souslin tree. For every , pick .
For every , denote
Finally, define a coloring by letting for all :
Claim 1. witnesses .
That is, for every of size , we have .
Proof. Let of size and be arbitrary. We shall find from with .
Let . Since is prolific, is a subset of of size , and hence is not an antichain with respect to . That is, there exist from such that In particular, . So and , as sought.
Claim 2. does not admit a rainbow triangle.
That is, for every of size , the restriction is not injective.
Proof. Let of size be arbitrary.
If is a constant function, then clearly, .
Otherwise, we may find such that and , and hence .
I find the above to be a considerably simpler consistency proof than the one from CH.
Next, to show how to obtain a prolific Souslin tree from a plain one, we recall some definitions and set up our notation.
A tree is a poset for which the downward cone is well-ordered by , for all . Write . For all , denote by the -level of the tree, that is, . Note that every level is an antichain. The tree is said to Hausdorff iff for all limit and , if , then .
A -Souslin tree is a tree of size having no chains or antichains of size . A moment reflection makes it clear that if is a -Souslin tree, then is an Hausdorff -Souslin tree.
Observation. Suppose that is a regular uncountable cardinal.
If there exists a -Souslin tree, then there exists a prolific one.
Proof. Fix an Hausdorff -Souslin tree . In particular, , that is, admits a unique root. Put:
Since has no antichains of size , we may pick a large enough such that . Let Since has no cofinal branches, we know that . Consequently,
is a club in . Denote .
Subclaim. Suppose , and is some infinite cardinal. Then there exists some such that for all .
Proof. Write . Since , let be the unique element of to satisfy . Let be the order-preserving bijection.
By , let us pick with . For all , let be the unique element of to satisfy . Since is linearly ordered, we have and whenever .
Let be arbitrary. By , let us pick that extends and is distinct from .
Then is an antichain consisting of elements above .
Finally, let be arbitrary. For all , by , let us pick some such that . Then .
By the subclaim, we may define a function , stipulating:
Let . Then is a club subset of . Fix the order-preserving bijection .
Now, we define injections by recursion:
- Let , where denotes the unique root of .
- Suppose and has already been defined. For all , denote . By , we have . So it is easy to find an injection that satisfies for all :
- Suppose that is a nonzero limit ordinal, and has already been defined. Define by letting for all :Since is Hausdorff, is injective.
This completes the construction. Let , and . Then is an order-preserving bijection from to . In particular, , and has no antichains of size . Of course, the above construction ensures that is prolific.
Back to the beginning of the post, let us point out that if we did not care about rainbow triangles, we could have let uniformly for all . The latter is a stronger coloring, and is of a particular interest when the tree is either coherent or free.
This reminds me of an open problem I heard from Zapletal: Suppose that there exists a -Souslin tree. Must there also be a free one?