Prolific Souslin trees

In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing 1[1]32 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 1[1]ω2 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 κ[κ]κ2 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 T<κκ is a prolific κ-Souslin tree iff |T|=κ, (T,) has no antichains of size κ, and for all tT and β<dom(t): tβ and tβ are in T.

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 T be a prolific κ-Souslin tree. For every α<κ, pick tαTακ.
For every αβ, denote Δ(α,β):={min{α,β},if tαtβT;min{εtα(ε)tβ(ε)},otherwise.
Finally, define a coloring c:[κ]2κ by letting for all αβ:c(α,β):={tβ(α),if tαtβ;tα(β),if tβtα;min{tα(Δ(α,β)),tβ(Δ(α,β))},otherwise.

Claim 1. c witnesses κ[κ]κ2.
That is, for every Xκ of size κ, we have c[X]2=κ.
Proof. Let Xκ of size κ and i<κ be arbitrary. We shall find α<β from X with c(α,β)=i.
Let Y:=T{tαiαX}. Since T is prolific, Y is a subset of T of size κ, and hence Y is not an antichain with respect to . That is, there exist α<β from X such that (tαi)(tβi).In particular, (tαi)(tβ). So tαtβ and c(α,β)=tβ(α)=i, as sought. ◻

Claim 2. c does not admit a rainbow triangle.
That is, for every Xκ of size 3, the restriction c[X]2 is not injective.
Proof. Let Xκ of size 3 be arbitrary.
If Δ[X]2 is a constant function, then clearly, |c[X]2|=2.
Otherwise, we may find α,β,γ such that X={α,β,γ} and Δ(α,γ)=Δ(β,γ)<Δ(α,β), and hence c(α,γ)=c(β,γ). ◻

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 (S,<S) for which the downward cone x:={ySy<Sx} is well-ordered by <S, for all xS. Write ht(x):=otp(x,<S). For all β, denote by Sβ the βth-level of the tree, that is, Sβ:={xSht(x)=β}. Note that every level is an antichain. The tree (S,<S) is said to Hausdorff iff for all limit β and x,ySβ, if x=y, then x=y.
A κ-Souslin tree is a tree of size κ having no chains or antichains of size κ. A moment reflection makes it clear that if (S,<S) is a κ-Souslin tree, then ({xxS},) 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 (S,<S). In particular, |S0|=1, that is, (S,<S) admits a unique root. Put:
A:={xSβ<κySβ(y is incomparable with x)}.Since (S,<S) has no antichains of size κ,  we may pick a large enough ε<κ such that ASε. Let B:={xS(x,<S) is linearly ordered}. Since (S,<S) has no cofinal branches, we know that BA. Consequently,
D:={β<κ(xS[ε,β))(y0,y1Sβ)[y0,y1 are incompatible extensions of x]}ε is a club in κ. Denote SD:={xSht(x)D}.

Subclaim. Suppose  ySD, and μ<κ is some infinite cardinal. Then there exists some β<κ such that |Sγy|μ for all γDβ.
Proof. Write α:=ht(y). Since otp(Dα)=κ>μ, let β be the unique element of D to satisfy otp((Dα)β)=μ. Let f:μ(Dα)β be the order-preserving bijection.

By α,βD, let us pick zSβ with y<Sz. For all i<μ, let yi be the unique element of Sf(i) to satisfy yi<Sz. Since (z,<S) is linearly ordered, we have  y=y0 and yi<Syj whenever i<j<μ.

Let i<μ be arbitrary. By ht(yi),ht(yi+1)D,  let us pick xiSht(yi+1) that extends yi and is distinct from  yi+1.
Then {xii<μ}S(Dβ) is an antichain consisting of elements above y.

Finally, let γDβ be arbitrary. For all i<μ, by ht(yi),γD, let us pick some ziSγ such that yi<Szi. Then |Sγy||{zii<μ}|=|{yii<μ}|=μ. ◼

By the subclaim, we may define a function g:DD, stipulating:
g(α):=min{βDySαγDβ |Sγy||α|}.

Let E:={α<κg[α]α}. Then E{0} is a club subset of D. Fix the order-preserving bijection π:κE.

Now, we define injections hα:Sπ(α)ακα<κ by recursion:

  • Let h0:={(r,)}, where r denotes the unique root of (S,<S).
  • Suppose β<κ and hααβ has already been defined. For all xSπ(β), denote I(x):={ySπ(β)+1x<Sy}. By π(β),π(β+1)E, we have |I(x)||π(β)||β|. So it is easy to find an injection hβ+1:Sπ(β+1)β+1κ that satisfies for all xSπ(β):hβ+1I(x){hβ(x)ii<β}.
  • Suppose that β is a nonzero limit ordinal, and hαα<β has already been defined. Define hβ:Sπ(β)βκ by letting for all xSπ(β):hβ(x):={hα(y)α<β,ySπ(α)x}.Since (S,<S) is Hausdorff, hβ is injective.

This completes the construction. Let h:=α<κhα, and T:=Image(h). Then h is an order-preserving bijection from (SE,<S) to (T,). In particular, |T|=κ, and (T,) has no antichains of size κ. Of course, the above construction ensures that T 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 c(α,β)=tβ(α) uniformly for all α<β<κ. The latter is a stronger coloring, and is of a particular interest when the tree T 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?

This entry was posted in Blog, Expository and tagged , , . Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *