Uniform, rigid branchwise-real trees

Sam Adam-Day

Abstract

A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. This paper presents constructions of such trees that are both rigid (possessing no non-trivial order-automorphisms) and uniform. Specifically, it demonstrates the existence of rigid branchwise-real trees where every branching point has the same degree, where every point is a branching point of the same degree, and where every point is branching of the same degree but the tree admits no order-preserving function into the reals. These trees are constructed iteratively in stages using a "Generic Colouring Lemma" to break symmetry.

Introduction

In order theory and set theory, uniformity and rigidity are often seen as opposing properties. A uniform structure, like a grid or a symmetric tree, typically possesses many automorphisms—transformations that preserve its structure. Conversely, a rigid structure is so uniquely arranged that it has no symmetries.

This research investigates this tension within branchwise-real trees, which are partial orders where every path (or "branch") is isomorphic to a real interval. These structures are fundamental to $\mathbb{R}$-trees used in geometric group theory. The central question addressed is: Can we construct a tree where every point branches in an identical fashion (uniformity), yet the global structure remains perfectly unique (rigidity)?

Methods

The author employs an iterative growth process to build these trees in transfinite stages, starting from a single root.

Iterative growth stages of the tree construction.
  1. Spine Addition: At each stage, "spines" (copies of the interval $(0, \infty)$) are added to the existing structure.
  2. Generic Colouring Lemma: This is the paper's primary technical innovation. The author proves the existence of a family of "sufficiently generic" colourings of the real line. These colourings are complex enough that any attempt to map one coloured interval to another via a symmetry is defeated by mismatched patterns.
  3. Symmetry Breaking: By assigning unique generic colourings to each new spine, the author ensures that no two parts of the tree can be mapped onto each other by an automorphism.
  4. Limit Stages: At transfinite steps (such as $\omega$ or $\omega_1$), the author determines which branches to "cap off" with new points based on the sequences of colours encountered along those branches.

While the constructions are carried out in standard set theory (ZFC), the logic is heavily inspired by forcing, a technique typically used to prove the consistency of mathematical statements.

Key Insights and Ideas

  • Encoding Information in Intervals: The author uses the distinction between open and half-open intervals to encode sets of natural numbers into the tree's structure, creating mutually non-isomorphic sets of reals that underpin rigidity.
  • The "Comb" Structure: A useful mental model for these trees is the "comb" structure—a "shaft" (the real interval $[0,1]$) with "teeth" (new branches) growing out of every point.
The 'comb' structure serves as a mental model for branchwise-real trees.
  • Gradability vs. Metric Trees: The paper distinguishes between trees that can be mapped into the reals (continuously gradable) and those that cannot. It shows that rigidity can be achieved even when the tree is too complex to fit into the standard real line.
  • Uniformity Levels: The research distinguishes between "weakly uniform" (where only branching points have a fixed degree $\kappa$) and "uniformly $\kappa$-branching" (where every single point is a branching point of degree $\kappa$).

Key Results

The paper presents three landmark constructions of rigid branchwise-real trees for any cardinal $\kappa$ between 2 and the successor of the continuum ($\mathfrak{c}^+$):

  • Theorem 18: Construction of a rigid tree where every branching point has the same degree $\kappa$.
  • Theorem 21: Construction of a rigid tree where every point is a branching point of degree $\kappa$, and the tree is "gradable" (it maps to the reals).
  • Theorem 29: A rigid, uniformly $\kappa$-branching tree that cannot be mapped into the reals, proving that rigidity and uniformity can coexist in non-metric contexts.

Limitations and Future Work

The author identifies several open questions for future study:

  1. Cardinality Limits: Can these trees be constructed for branching degrees larger than $\mathfrak{c}^+$?
  2. Prescribed Symmetry: Instead of total rigidity, can we construct trees with specific desired symmetry groups?
  3. Complexity Stratification: Is there a canonical way to measure the complexity of these trees, perhaps using "minimum supremum rank" as an invariant?

Summary updated

Abstract

A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e. without non-trivial order-automorphisms) and uniform (in two different senses). Specifically, I show that there is a rigid branchwise-real tree in which every branching point has the same degree, one in which every point is branching and of the same degree, and finally one in which every point is branching of the same degree and which admits no order-preserving function into the reals. Trees are grown iteratively in stages, and a key technique is the construction (in ZFC) of a family of colourings of $(0,\infty)$ which is 'sufficiently generic', using these colourings to determine how to proceed with the construction.
BibTeX
@misc{adamday2022uniform,
  author = {Sam Adam-Day},
  title = {{Uniform, rigid branchwise-real trees}},
  year = {2022},
  eprint = {2206.15344},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2206.15344},
}
Figure