Ladder system uniformization on trees I & II
Abstract: Given a tree of height , we say that a ladder system colouring has a -uniformization if there is a function defined on a subtree of so that for any of limit height and almost all , . In sharp contrast to the classical theory of uniformizations on , J. Moore proved that CH is consistent with the statement that any ladder system colouring has a -uniformization (for any Aronszajn tree ). 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 is a Suslin tree then (i) CH implies that there is a ladder system colouring without -uniformization; (ii) the restricted forcing axiom implies that any ladder system colouring has an -uniformization. For an arbitrary Aronszajn tree , we show how diamond-type assumptions affect the existence of ladder system colourings without a -uniformization. Furthermore, it is consistent that for any Aronszajn tree and ladder system there is a colouring of without a -uniformization; however, and quite surprisingly, implies that for any ladder system there is an Aronszajn tree so that any monochromatic colouring of has a -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.
Paper Prompts
Sign up for free to create and run prompts on this paper.