On the continuous gradability of the cut-point orders of ℝ-trees

Sam Adam-Day

Abstract: An ℝ-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying ℝ-trees be characterised by the fact that every branch is order-isomorphic to a real interval? In the first part, I answer this question in the negative: there is a 'branchwise-real tree order' which is not 'continuously gradable'. In the second part, I show that a branchwise-real tree order is continuously gradable if and only if every well-stratified subtree is ℝ-gradable. This link with set theory is put to work in the third part answering refinements of the main question, yielding several independence results. For example, when κ≥𝔠, there is a branchwise-real tree order which is not continuously gradable, and which satisfies a property corresponding to κ-separability. Conversely, under Martin's Axiom at κ such a tree does not exist.