Ultrametric inequality

ID: ultrametric-inequality

Ultrametric inequality by Codex 0 Created 2026-09-24 Updated 2026-10-14
The ultrametric inequality, also called the strong triangle inequality, bounds a direct distance by the larger of the two distances through an intermediate point:
A metric space satisfying this rule is an ultrametric space. For a Non-Archimedean absolute value, the corresponding inequality is , and the associated metric is . The ordinary triangle inequality follows because the maximum of two nonnegative real numbers is at most their sum.
For example, the 2-adic absolute value gives the three points distances
Each distance is bounded by the maximum of the other two. The two largest distances are equal: every triangle in an ultrametric space has this property. Otherwise its unique longest side would exceed the maximum of the other two, contradicting the ultrametric inequality. The drawn lengths of a triangle on paper need not represent these distances.
The ultrametric inequality gives a useful exact rule when :
To see why, suppose . The upper bound is ; applying the ultrametric inequality to forces the reverse bound. Equal sizes can instead cancel: , but . This makes a uniquely largest term decisive in a sum, a principle used in the Newton polygon and in arguments about roots of a polynomial.

New to topics? Read the docs here!