Skip to content

1. χ_{BM}(G_T)≤3

problem

Let XX be a Polish space and let T ⁣:X→XT\colon X→X be a Borel map without fixed points. Fill in the details of the proof that χBM(GT)≤3χ_{BM}(G_T)≤3 sketched in class.

Here’s the outline of how the proof goes:

  • Find a Borel set A⊆XA⊆X so that the set of vertices

    X′≔{x∈X:(x,Tx,T2x,…) visits A and A∁ both infinitely often} X' ≔ \{x∈X : \text{\((x,Tx,T²x,…)\) visits $A$ and $A^∁$ both infinitely often}\}

    is comeager (in XX).

    To do so, start with a countable Borel proper coloring c ⁣:X→Nc\colon X→ℕ. Partition XX into two subsets P,P∁P,P^∁.

    P={x:(c(Tnx))n=0∞ decreases infinitely often},P∁={x:(c(Tnx))n=0∞ eventually only increases}.\begin{aligned} P &= \{x : \text{\((c(Tⁿx))_{n=0}^∞\) decreases infinitely often}\}, \\ P^∁ &= \{x : \text{\((c(Tⁿx))_{n=0}^∞\) eventually only increases}\}. \end{aligned}

    We will construct A0⊆PA₀⊆P and A1⊆P∁A₁⊆P^∁, then set A=A0∪A1A=A₀∪A₁:

    • Take A0={x∈P:c(Tx)<c(x)}A₀=\{x∈P:c(Tx)<c(x)\}.

    • Within P∁P^∁, for each x∈Xx∈X let C(x)={c(Tnx)}n∈NC(x)=\{c(Tⁿx)\}_{n∈ℕ} (the set of all colors in the TT-orbit of xx), and let

      𝒮(x)≔{S∈2N:[C(x)∩S],[C(x)∖S] both infinite}. 𝒮(x) ≔ \{S∈2^ℕ : \text{\([C(x)∩S],[C(x)∖S]\) both infinite}\}.

      Equivalently, S∈𝒮(x)S∈𝒮(x) if and only if (Tnx)n=0∞(Tⁿx)_{n=0}^∞ visits c−1(S)c⁻¹(S) and c−1(S)∁c⁻¹(S)^∁ both infinitely often, i.e., (c(Tnx))n=0∞(c(Tⁿx))_{n=0}^∞ visits SS and S∁S^∁ both infinitely often.

      Observe that for each fixed x∈P∁x∈P^∁, 𝒮(x)𝒮(x) is comeager in 2N2^ℕ. Then by Kuratowski–Ulam, for generic S∈2NS∈2^ℕ,

      Y(S)≔{x∈P∁:[C(x)∩S],[C(x)∖S] both infinite} Y(S) ≔ \{x∈P^∁ : \text{\([C(x)∩S],[C(x)∖S]\) both infinite}\}

      is comeager in P∁P^∁. So fix such an SS and let A1=c−1(S)A₁=c⁻¹(S).

    So A=A0∪A1A=A₀∪A₁ is the set of points satisfying

    • if (c(Tnx))n=0∞(c(Tⁿx))_{n=0}^∞ decreases infinitely often, then c(Tx)<c(x)c(Tx)<c(x);
    • if (c(Tnx))n=0∞(c(Tⁿx))_{n=0}^∞ eventually only increases, then c(x)∈Sc(x)∈S.

    Then A∁=(P∖A0)∪(P∁∖A1)A^∁=(P∖A₀)∪(P^∁∖A₁) is the set of points xx satisfying

    • if (c(Tnx))n=0∞(c(Tⁿx))_{n=0}^∞ decreases infinitely often, then c(Tx)>c(x)c(Tx)>c(x);
    • if (c(Tnx))n=0∞(c(Tⁿx))_{n=0}^∞ eventually only increases, then c(x)∉Sc(x)∉S.

    To see that X′X' is comeager, notice that if x∈X′∁x∈X'^∁ then it can only fail the second case (where x∈P∁x∈P^∁), and so x∈P∁∖Y(S)x∈P^∁∖Y(S). So X′∁⊆P∁∖Y(S)X'^∁⊆P^∁∖Y(S), but recall that Y(S)Y(S) is comeager in P∁P^∁, so X′X' is comeager as well.

  • X′X' and X′∁X'^∁ are TT-invariant, which means that there are no edges between GT[X′]G_T[X'] and GT[X′∁]G_T[X'^∁]. So color these components separately:

    • In X′X', both AA and A∁A^∁ are recurrent, so use the Borel construction to 33-color GT[X′]G_T[X'].

    • X′∁X'^∁ is comeager, so 33-color it arbitrarily (using the general result that χ(GT)≤3χ(G_T)≤3, via De Bruijn–Erdős).