Real tree

In mathematics, real trees (also called ${\displaystyle \mathbb {R} }$-trees) are a class of metric spaces generalising simplicial trees. They arise naturally in many mathematical contexts, in particular geometric group theory and probability theory. They are also the simplest examples of Gromov hyperbolic spaces.

Definition and examples

Formal definition

A triangle in a real tree

A metric space ${\displaystyle X}$ is a real tree if it is a geodesic space where every triangle is a tripod. That is, for every three points ${\displaystyle x,y,\rho \in X}$ there exists a point ${\displaystyle c=x\wedge y}$ such that the geodesic segments ${\displaystyle [\rho ,x],[\rho ,y]}$ intersect in the segment ${\displaystyle [\rho ,c]}$ and also ${\displaystyle c\in [x,y]}$. This definition is equivalent to ${\displaystyle X}$ being a "zero-hyperbolic space" in the sense of Gromov (all triangles are "zero-thin"). Real trees can also be characterised by a topological property. A metric space ${\displaystyle X}$ is a real tree if for any pair of points ${\displaystyle x,y\in X}$ all topological embeddings ${\displaystyle \sigma }$ of the segment ${\displaystyle [0,1]}$ into ${\displaystyle X}$ such that ${\displaystyle \sigma (0)=x,\,\sigma (1)=y}$ have the same image (which is then a geodesic segment from ${\displaystyle x}$ to ${\displaystyle y}$).

Simple examples

• If ${\displaystyle X}$ is a connected graph with the combinatorial metric then it is a real tree if and only if it is a tree (i.e. it has no cycles). Such a tree is often called a simplicial tree. They are characterised by the following topological property: a real tree ${\displaystyle T}$ is simplicial if and only if the set of singular points of ${\displaystyle X}$ (points whose complement in ${\displaystyle X}$ has three or more connected components) is closed and discrete in ${\displaystyle X}$.
• The ${\displaystyle \mathbb {R} }$-tree obtained in the following way is nonsimplicial. Start with the interval [0, 2] and glue, for each positive integer n, an interval of length 1/n to the point 1 − 1/n in the original interval. The set of singular points is discrete, but fails to be closed since 1 is an ordinary point in this ${\displaystyle \mathbb {R} }$-tree. Gluing an interval to 1 would result in a closed set of singular points at the expense of discreteness.
• The Paris metric makes the plane into a real tree. It is defined as follows: one fixes an origin ${\displaystyle P}$, and if two points are on the same ray from ${\displaystyle P}$, their distance is defined as the Euclidean distance. Otherwise, their distance is defined to be the sum of the Euclidean distances of these two points to the origin ${\displaystyle P}$.
• The plane under the Paris metric is an example of a hedgehog space, a collection of line segments joined at a common endpoint. Any such space is a real tree.

Characterizations

Visualisation of the four points condition and the 0-hyperbolicity. In green: ${\displaystyle (x,y)_{t}=(y,z)_{t}}$ ; in blue: ${\displaystyle (x,z)_{t}}$.

Here are equivalent characterizations of real trees which can be used as definitions:

1) (similar to trees as graphs) A real tree is a geodesic metric space which contains no subset homeomorphic to a circle. ^[1]

2) A real tree is a connected metric space ${\displaystyle (X,d)}$ which has the four points condition ^[2] (see figure):

For all ${\displaystyle x,y,z,t\in X,}$${\displaystyle d(x,y)+d(z,t)\leq \max[d(x,z)+d(y,t)\,;\,d(x,t)+d(y,z)]}$.

3) A real tree is a connected 0-hyperbolic metric space ^[3] (see figure). Formally,

For all ${\displaystyle x,y,z,t\in X,}$${\displaystyle (x,y)_{t}\geq \min[(x,z)_{t}\,;\,(y,z)_{t}],}$

where ${\displaystyle (x,y)_{t}}$ denotes the Gromov product of ${\displaystyle x}$ and ${\displaystyle y}$ with respect to ${\displaystyle t}$, that is, ${\displaystyle \textstyle {\frac {1}{2}}\left(d(x,t)+d(y,t)-d(x,y)\right).}$

4) (similar to the characterization of plane trees by their contour process). Consider a positive excursion of a function. In other words, let ${\displaystyle e}$ be a continuous real-valued function and ${\displaystyle [a,b]}$ an interval such that ${\displaystyle e(a)=e(b)=0}$ and ${\displaystyle e(t)>0}$ for ${\displaystyle t\in ]a,b[}$.

For ${\displaystyle x,y\in [a,b]}$, ${\displaystyle x\leq y}$, define a pseudometric and an equivalence relation with:

${\displaystyle d_{e}(x,y):=e(x)+e(y)-2\min(e(z)\,;z\in [x,y]),}$

${\displaystyle x\sim _{e}y\Leftrightarrow d_{e}(x,y)=0.}$

Then, the quotient space ${\displaystyle ([a,b]/\sim _{e}\,,\,d_{e})}$ is a real tree. ^[3] Intuitively, the local minima of the excursion e are the parents of the local maxima. Another visual way to construct the real tree from an excursion is to "put glue" under the curve of e, and "bend" this curve, identifying the glued points (see animation).

Partant d'une excursion e (en noir), la déformation (en vert) représente le « pliage » de la courbe jusqu'au « collage » des points d'une même classe d'équivalence, l'état final est l'arbre réel associé à e.

Examples

Real trees often appear, in various situations, as limits of more classical metric spaces.

Brownian trees

A Brownian tree ^[4] is a random metric space whose value is a (non-simplicial) real tree almost surely. Brownian trees arise as limits of various random processes on finite trees. ^[5]

Ultralimits of metric spaces

Any ultralimit of a sequence ${\displaystyle (X_{i})}$ of ${\displaystyle \delta _{i}}$-hyperbolic spaces with ${\displaystyle \delta _{i}\to 0}$ is a real tree. In particular, the asymptotic cone of any hyperbolic space is a real tree.

Limit of group actions

Let ${\displaystyle G}$ be a group. For a sequence of based ${\displaystyle G}$-spaces ${\displaystyle (X_{i},*_{i},\rho _{i})}$ there is a notion of convergence to a based ${\displaystyle G}$-space ${\displaystyle (X_{\infty },x_{\infty },\rho _{\infty })}$ due to M. Bestvina and F. Paulin. When the spaces are hyperbolic and the actions are unbounded the limit (if it exists) is a real tree. ^[6]

A simple example is obtained by taking ${\displaystyle G=\pi _{1}(S)}$ where ${\displaystyle S}$ is a compact surface, and ${\displaystyle X_{i}}$ the universal cover of ${\displaystyle S}$ with the metric ${\displaystyle i\rho }$ (where ${\displaystyle \rho }$ is a fixed hyperbolic metric on ${\displaystyle S}$).

This is useful to produce actions of hyperbolic groups on real trees. Such actions are analyzed using the so-called Rips machine. A case of particular interest is the study of degeneration of groups acting properly discontinuously on a real hyperbolic space (this predates Rips', Bestvina's and Paulin's work and is due to J. Morgan and P. Shalen ^[7] ).

Algebraic groups

If ${\displaystyle F}$ is a field with an ultrametric valuation then the Bruhat–Tits building of ${\displaystyle \mathrm {SL} _{2}(F)}$ is a real tree. It is simplicial if and only if the valuations is discrete.

Generalisations

Λ-trees

If ${\displaystyle \Lambda }$ is a totally ordered abelian group there is a natural notion of a distance with values in ${\displaystyle \Lambda }$ (classical metric spaces correspond to ${\displaystyle \Lambda =\mathbb {R} }$). There is a notion of ${\displaystyle \Lambda }$-tree ^[8] which recovers simplicial trees when ${\displaystyle \Lambda =\mathbb {Z} }$ and real trees when ${\displaystyle \Lambda =\mathbb {R} }$. The structure of finitely presented groups acting freely on ${\displaystyle \Lambda }$-trees was described. ^[9] In particular, such a group acts freely on some ${\displaystyle \mathbb {R} ^{n}}$-tree.

Real buildings

The axioms for a building can be generalized to give a definition of a real building. These arise for example as asymptotic cones of higher-rank symmetric spaces or as Bruhat-Tits buildings of higher-rank groups over valued fields.

See also

• Dendroid (topology)
• Tree-graded space

References

1. Chiswell, Ian (2001). Introduction to [lambda]-trees. Singapore: World Scientific. ISBN   978-981-281-053-3. OCLC   268962256.
2. Peter Buneman, A Note on the Metric Properties of Trees, Journal of combinatorial theory, B (17), p. 48-50, 1974.
3. Evans, Stevan N. (2005). Probability and Real Trees. École d’Eté de Probabilités de Saint-Flour XXXV.
4. Aldous, D. (1991), "The continuum random tree I", Annals of Probability , 19: 1–28, doi: 10.1214/aop/1176990534
5. Aldous, D. (1991), "The continuum random tree III", Annals of Probability , 21: 248–289
6. Bestvina, Mladen (2002), "${\displaystyle \mathbb {R} }$-trees in topology, geometry and group theory", Handbook of Geometric Topology, Elsevier, pp. 55–91, ISBN   9780080532851
7. Shalen, Peter B. (1987), "Dendrology of groups: an introduction", in Gersten, S. M. (ed.), Essays in Group Theory, Math. Sci. Res. Inst. Publ., vol. 8, Springer-Verlag, pp. 265–319, ISBN   978-0-387-96618-2, MR   0919830
8. Chiswell, Ian (2001), Introduction to Λ-trees, River Edge, NJ: World Scientific Publishing Co. Inc., ISBN   981-02-4386-3, MR   1851337
9. O. Kharlampovich, A. Myasnikov, D. Serbin, Actions, length functions and non-archimedean words IJAC 23, No. 2, 2013.