Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ladder system uniformization on trees I & II

Published 11 Jun 2018 in math.LO | (1806.03867v2)

Abstract: Given a tree TT of height ω1\omega_1, we say that a ladder system colouring (fα)<em>αlimω1(f_\alpha)<em>{\alpha\in \lim\omega_1} has a TT-uniformization if there is a function φ\varphi defined on a subtree SS of TT so that for any sS</em>αs\in S</em>\alpha of limit height and almost all ξdom(fα)\xi\in {dom} (f_\alpha), φ(sξ)=fα(ξ)\varphi(s\upharpoonright \xi)=f_\alpha(\xi). In sharp contrast to the classical theory of uniformizations on ω1\omega_1, J. Moore proved that CH is consistent with the statement that any ladder system colouring has a TT-uniformization (for any Aronszajn tree TT). Our goal is to present a fine analysis of ladder system uniformization on trees pointing out the analogies and differences between the classical and this new theory. We show that if SS is a Suslin tree then (i) CH implies that there is a ladder system colouring without SS-uniformization; (ii) the restricted forcing axiom MA(S)MA(S) implies that any ladder system colouring has an ω1\omega_1-uniformization. For an arbitrary Aronszajn tree TT, we show how diamond-type assumptions affect the existence of ladder system colourings without a TT-uniformization. Furthermore, it is consistent that for any Aronszajn tree TT and ladder system C\mathbf C there is a colouring of C\mathbf C without a TT-uniformization; however, and quite surprisingly, <sup>+\diamondsuit<sup>+ implies that for any ladder system C\mathbf C there is an Aronszajn tree TT so that any monochromatic colouring of C\mathbf C has a TT-uniformization. We also prove positive uniformization results in ZFC for some well-studied trees of size continuum, and finish with a list of open problems.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.