Ultrametric space

In mathematics, an ultrametric space is a metric space in which the triangle inequality is strengthened to \( d(x,z)\leq\max\left\{d(x,y),d(y,z)\right\} \). Sometimes the associated metric is also called a non-Archimedean metric or super-metric. Although some of the theorems for ultrametric spaces may seem strange at a first glance, they appear naturally in many applications.

Formal definition

An ultrametric on a set M is a real-valued function

\( d\colon M\times M\rightarrow {\mathbb {R}} \)

(where ℝ denote the real numbers), such that for all x, y, z ∈ M:

d(x, y) ≥ 0;
d(x, y) = d(y, x) (symmetry)
d(x, x) = 0;
if d(x, y) = 0 then x = y (Identity of indiscernibles);
d(x, z) ≤ max { d(x, y), d(y, z)} (strong triangle or ultrametric inequality).

Definition: An ultrametric space is a pair (M, d) consisting of a set M together with an ultrametric d on M, which is called the space's associated distance function (also called a metric).

Definition:[1] If d satisfies all of the conditions except possibly condition 4 (i.e. identity of indiscernibles), then d is called an ultrapseudometric on M. An ultrapseudometric space is a pair (M, d) consisting of a set M and an ultrapseudometric d on M.

In the case when M is a group (written additively) and d is generated by a length function \( \|\cdot \| \) (so that \( d(x,y)=\|x-y\| \) ), the last property can be made stronger using the Krull sharpening[2] to:

\( \|x+y\|\leq \max \left\{\|x\|,\|y\|\right\} \) with equality if \( \|x\|\neq \|y\| \).

We want to prove that if \( \|x+y\|\leq \max \left\{\|x\|,\|y\|\right\} \), then the equality occurs if \( \|x\|\neq \|y\| \) . Without loss of generality, let us assume that \( \|x\|>\|y\| \). This implies that \( \|x+y\|\leq \|x\| \) . But we can also compute \( \|x\|=\|(x+y)-y\|\leq \max \left\{\|x+y\|,\|y\|\right\} \) . Now, the value of \( \max \left\{\|x+y\|,\|y\|\right\} \) cannot be \( \|y\| \) , for if that is the case, we have \( \|x\|\leq \|y\| \) contrary to the initial assumption. Thus, max \( \max \left\{\|x+y\|,\|y\|\right\}=\|x+y\| \) , and ‖\( \|x\|\leq \|x+y\| \). Using the initial inequality, we have\( \|x\|\leq \|x+y\|\leq \|x\| \) and therefore \( \|x+y\|=\|x\| \).

Properties

In the triangle on the right, the two bottom points x and y violate the condition d(x, y) ≤ max(d(x, z), d(y, z)).

From the above definition, one can conclude several typical properties of ultrametrics. For example, for all \( {\displaystyle x,y,z\in M} \), at least one of the three equalities \( {\displaystyle d(x,y)=d(y,z)} \) or \( {\displaystyle d(x,z)=d(y,z)} \) or \( {\displaystyle d(x,y)=d(z,x)} \) holds. That is, every triple of points in the space forms an isosceles triangle, so the whole space is an isosceles set.

Defining the (open) ball of radius r > 0 centred at \( x\in M \) as \( {\displaystyle B(x;r):=\{y\in M\mid d(x,y)<r\}} \), we have the following properties:

Every point inside a ball is its center, i.e. if d(x,y)<r then B(x;r)=B(y;r).
Intersecting balls are contained in each other, i.e. if \( B(x;r)\cap B(y;s) i \) s non-empty then either \( {\displaystyle B(x;r)\subseteq B(y;s)} \) or \( {\displaystyle B(y;s)\subseteq B(x;r)} \).
All balls of strictly positive radius are both open and closed sets in the induced topology. That is, open balls are also closed, and closed balls (replace < with \( \leq \) ) are also open.
The set of all open balls with radius r and center in a closed ball of radius r>0 forms a partition of the latter, and the mutual distance of two distinct open balls is (greater or) equal to r.

Proving these statements is an instructive exercise.[3] All directly derive from the ultrametric triangle inequality. Note that, by the second statement, a ball may have several center points that have non-zero distance. The intuition behind such seemingly strange effects is that, due to the strong triangle inequality, distances in ultrametrics do not add up.

Examples

The discrete metric is an ultrametric.
The p-adic numbers form a complete ultrametric space.
Consider the set of words of arbitrary length (finite or infinite), Σ*, over some alphabet Σ. Define the distance between two different words to be 2−n, where n is the first place at which the words differ. The resulting metric is an ultrametric.
The set of words with glued ends of the length n over some alphabet Σ is an ultrametric space with respect to the p-close distance. Two words x and y are p-close if any substring of p consecutive letters (p < n) appears the same number of times (which could also be zero) both in x and y.[4]
If r = (rn) is a sequence of real numbers decreasing to zero, then |x|r := lim supn→∞ |xn|rn induces an ultrametric on the space of all complex sequences for which it is finite. (Note that this is not a seminorm since it lacks homogeneity — If the rn are allowed to be zero, one should use here the rather unusual convention that 00=0.)
If G is an edge-weighted undirected graph, all edge weights are positive, and d(u,v) is the weight of the minimax path between u and v (that is, the largest weight of an edge, on a path chosen to minimize this largest weight), then the vertices of the graph, with distance measured by d, form an ultrametric space, and all finite ultrametric spaces may be represented in this way.[5]

Applications

A contraction mapping may then be thought of as a way of approximating the final result of a computation (which can be guaranteed to exist by the Banach fixed point theorem). Similar ideas can be found in domain theory. p-adic analysis makes heavy use of the ultrametric nature of the p-adic metric.
In condensed matter physics, the self-averaging overlap between spins in the SK Model of spin glasses exhibits an ultrametric structure, with the solution given by the full replica symmetry breaking procedure first outlined by Giorgio Parisi and coworkers.[6] Ultrametricity also appears in the theory of aperiodic solids.[7]
In taxonomy and phylogenetic tree construction, ultrametric distances are also utilized by the UPGMA and WPGMA methods.[8] These algorithms require a constant-rate assumption and produce trees in which the distances from the root to every branch tip are equal. When DNA, RNA and protein data are analyzed, the ultrametricity assumption is called the molecular clock.
Models of intermittency in three dimensional turbulence of fluids make use of so-called cascades, and in discrete models of dyadic cascades, which have an ultrametric structure.[9]
In geography and landscape ecology, ultrametric distances have been applied to measure landscape complexity and to assess the extent to which one landscape function is more important than another.[10]

References

Narici & Beckenstein 2011, pp. 1-18.
Planet Math: Ultrametric Triangle Inequality
"Ultrametric Triangle Inequality". Stack Exchange.
Osipov, Gutkin (2013), "Clustering of periodic orbits in chaotic systems", Nonlinearity, 26 (26): 177–200, Bibcode:2013Nonli..26..177G, doi:10.1088/0951-7715/26/1/177.
Leclerc, Bruno (1981), "Description combinatoire des ultramétriques", Centre de Mathématique Sociale. École Pratique des Hautes Études. Mathématiques et Sciences Humaines (in French) (73): 5–37, 127, MR 0623034.
Mezard, M; Parisi, G; and Virasoro, M: SPIN GLASS THEORY AND BEYOND, World Scientific, 1986. ISBN 978-9971-5-0116-7
Rammal, R.; Toulouse, G.; Virasoro, M. (1986). "Ultrametricity for physicists". Reviews of Modern Physics. 58 (3): 765–788. Bibcode:1986RvMP...58..765R. doi:10.1103/RevModPhys.58.765. Retrieved 20 June 2011.
Legendre, P. and Legendre, L. 1998. Numerical Ecology. Second English Edition. Developments in Environmental Modelling 20. Elsevier, Amsterdam.
Benzi, R.; Biferale, L.; Trovatore, E. (1997). "Ultrametric Structure of Multiscale Energy Correlations in Turbulent Models". Physical Review Letters. 79 (9): 1670–1674. arXiv:chao-dyn/9705018. Bibcode:1997PhRvL..79.1670B. doi:10.1103/PhysRevLett.79.1670.

Papadimitriou, Fivos (2013). "Mathematical modelling of land use and landscape complexity with ultrametric topology". Journal of Land Use Science. 8 (2): 234–254. doi:10.1080/1747423x.2011.637136. ISSN 1747-423X.

Bibliography

Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834.
Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135.