Open coloring and the cardinal invariant b

Nik Weaver asked for a direct proof of the fact that Todorcevic’s axiom implies the failure of CH fails. Here goes.

Notation. For a set X, we write [X]2 for the set of unordered pairs {{x,x}x,xX,xx}.

Definition (Todorcevic’s axiom). If X is a separable metric space, and [X]2=K0K1, with K0 open in [X]2, then at least one of the following hold:

  • there exists an uncountable subset YX such that [Y]2K0;
  • there is a partition X=n<ωYn such that [Yn]2K1 for all n<ω.

Lemma. If 20=1, then b=1, i.e., there exists a sequence f=fαα<ω1 such that:

  1. fαωω is an increasing function for all α<ω1;
  2. {n<ωfα(n)fβ(n)} is finite, whenever α<β<ω1;
  3. for every gωω, there exists some α<ω1 such that {n<ωg(n)<fβ(n)} is infinite, whenever α<β<ω1.

Proof.  Since 20=1, we can list ωω, as gαα<ω1. We then construct fαα<ω1 by recursion on α<ω1. Suppose that fββ<α has already been constructed. Let {hnn<ω} be some enumeration of {fββ<α}{gα}. Define fα by letting fα(n):=1+i=0nj=0nhi(j) for all n<ω. ◻

Theorem (Todorcevic). Todorcevic’s axiom implies that b>1.
Proof.  Assume TA. Towards a contradiction, suppose that fαα<ω1 satisfies the above items (1)–(3). Consider X:={fαα<ω1} as a subspace of the Baire space ωω. Let K1:=[X]2K0, where K0:={{f,g}i,j<ω f(i)<g(i) & g(j)<f(j)}. It is easy to see that K0 is open. Now, let us examine each of the alternatives:

Alternative 2. There is a partition X=n<ωYn such that [Yn]2K1 for all n<ω:
In particular, we may fix an uncountable subset YX with [Y]2K1. Then, for every α<β such that fα,fβY, we have that {n<ωfα(n)>fβ(n)} is empty. Write B:={β<ω1fβY}. Notice that if supβBfβ(n) is finite for all n<ω, then we get a contradiction to item (3), hence, we may fix some m<ω such that sup{fβ(m)βB}=ω. Pick a large enough δB such that sup{fβ(m)βBδ}=ω. Then fδ(m) cannot be an integer. This is a contradiction.

Alternative 1. There exists an uncountable subset Y with [Y]2K0:
In particular, for every α<β such that fα,fβY, we have that {n<ωfα(n)fβ(n)} is nonempty. Write B:={β<ω1fβY}. Then, for all α<β in B, we have Δ(α,β)>0, where Δ(α,β):=min{m<ωmn<ω(fα(n)fβ(n))}.

Thus, to meet the desired contradiction, it suffices to establish the following.

Subclaim. There exists α<β in B such that Δ(α,β)=0.
Proof. Since <ωω is countable, let us fix a large enough δB such that for every t<ωω: if there exists αB with tfα, then there exists such αB below δ.

Write Bn:={βB(δ+1)Δ(δ,β)=n}. As B(δ+1)=n<ωBn, let us fix some n<ω such that Bn is uncountable. By item (3) above, we get that the set M:={m<ωsup{fβ(m)βBn}=ω} is nonempty (in fact, infinite), so consider its minimal element, m:=min(M).
For tmω, denote Bnt:={βBntfβ}. By minimality of m, the set {tmωBnt} is finite, so  we can easily find some tmω such that sup{fβ(m)βBnt}=ω. Since {βBtfβ} is nonempty, let us fix some αB below δ such that tfα. Put k:=Δ(α,δ), and then pick βBnt such that fβ(m)>fα(k+n). Of course, α<δ<β. We claim that Δ(α,β)=0. This is best seen by dividing into three cases:

  • if i<m, then fα(i)=t(i)=fβ(i);
  • if mik+n, then fα(i)fα(k+n)<fβ(m)fβ(i) (recall that the elements of f are increasing functions!);
  •  if k+n<i<ω, then Δ(α,δ)=k<i and fα(i)fδ(i), as well as Δ(δ,β)=n<i and fδ(i)fβ(i). Altogether, fα(i)fβ(i). End of subclaim

This complete the proof. ◻

Ari B. pointed out (see his comment bel0w) that the proof shows that the axiom SOCA already implies that b>ω1, where SOCA is the outcome of weakening the second alternative of TA to “there exists an uncountable subset YX such that [Y]2K1”.

 

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

13 Responses to Open coloring and the cardinal invariant b

  1. Ari B. says:

    There’s a problem with your statement of Todorcevic’s Axiom. What you’ve stated here is actually the Semi-Open Colouring Axiom.

    So it seems that you’ve shown the stronger result that SOCA implies b>1 and therefore contradicts CH.

    Incidentally, Kunen’s new textbook shows that SOCA implies that there are no weakly Luzin sets in Rn when n2 and therefore contradicts CH.

  2. Dani says:

    – We might simplify your proof if we note that since fα are increasing, K0 is the set of couples that are not “totally” increasing (has at least one contra-example).

    – Now since in alternative 2 we get 1 such pairs of functions, there must be some n<ω that is the witness for 1 decreasinesses-pairs. Looking only at this coordinate, since a decreasing serie of fα(n) can only be finite, we get a contradication to the fact that we have 1 witnesses.

  3. Dani says:

    Hi Assaf,
    Isn’t Todorcevic OCA states that either there is uncoutable 0 homogeneous set or a countable decomposition of X into 1-homogeneous pieces?

  4. Nik Weaver says:

    Thank you for the detailed proof. This is essentially the argument I was already using in my book when I asked the question. I guess the consensus is that it is the most direct proof that OCA to ¬,CH, although I still wonder if anyone has seriously tried to directly construct a counterexample to OCA using CH.

    Incidentally, your proof of “Alternative 2” is not correct — you only have {n<ωfα(n)>fβ(n)}=. I noticed the same error in Velickovic’s paper. I don’t have access to Todorcevic’s book at the moment, I wonder if the error tracks back to it?

  5. saf says:

    Thanks, Nik. I’m afraid I don’t have a copy of neither, but you are of course right concerning Alternative 2.

    Nevertheless, this is easy to fix: by item (3), we may find some n<ω such that sup{fβ(n)βB}=ω. Pick δB such that supfβ(n)βBδ=ω. Then fδ(n) cannot be an integer.

    The post has just been corrected.

    • Nik Weaver says:

      Nice! I had a slightly different way of fixing the problem, but yours is faster. (Extend each fβ to a piecewise linear function from R+ to R+, then look at the graphs of these functions in R2. The gap between the graph of each function and its successor is open, and you can’t have uncountably many disjoint open subsets of R2.)

      • saf says:

        btw, there is a somewhat different proof: use properties (1)–(3) of the b-scale to construct a subfamily F of P(ω×ω) such that F, admits no uncoutnable chains or antichains. Then, prove that SOCA entails that any uncountable subposet of P(ω), either contains an uncounatble chain, or an uncountable antichain.

  6. Literature says:

    I think that the discussion went deeper than it should if one is interested only in why OGA (TA) implies non-CH. However, it should be pointed out that the
    relevance of the bω1 proof is of twofold independent interest.
    First, it forms a part of the much deeper fact that OGA (TA) implies that b=ω2 (see Todorcevic’s ‘Partition Problem in Topology’ , Theorems 3.4 and 8.5 , or the proof of Theorem 8.6). Second, it shows that there exist two sets of reals of cardinality b which are orthogonal to each other in the sense that they contain no isomorphic copy of the same linear ordering of cardinality b. Thus, b=ω1 also contradicts Baumgartner’s axiom.
    If you are interested in mathematically and historically more basic reasons of why OGA (TA) implies non-CH simply remember that there is a mapping from the reals into the reals which is not continuous on any set of reals of cardinality continuum or remember that under CH were is a Luzin subset of the Cantor set and consider the natural open graphs associated to these objects.

Leave a Reply

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