Triangle inequality Created 2026-09-24 Updated 2026-10-14
A metric satisfies : visiting an intermediate point cannot beat the direct endpoint distance. A norm satisfies the corresponding inequality .
Take , , and . For Euclidean distance, the triangle inequality reads . The direct line segment has metric path length , while the route through has metric path length . For Manhattan distance, the same comparison becomes : both routes are shortest. The line segment and the bent route both become metric geodesics when progress is measured by metric path length. For Chebyshev distance, the direct line segment has metric path length , while the same bent route still costs .
Repeated application of the triangle inequality bounds the endpoint distance by the sum along any finite chain of intermediate points. This explains why metric path length is always at least the distance between endpoints. Equality reveals a shortest route, but its shape and uniqueness depend on the chosen metric.
Triangle inequality for pretentious distance Created 2026-09-24 Updated 2026-11-05
For multiplicative functions bounded in modulus by one, the pretentious distance satisfiesHere products mean pointwise products of arithmetic functions. For complex numbers of modulus at most one, write and . The bounds and giveApply this with and at each prime , divide by , and use the triangle inequality for the resulting finite Euclidean norm. This proves the displayed product inequality.[ref]
Ultrametric inequality 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 distancesEach 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.
Uniform Cauchy criterion 2026-10-25
A sequence of functions has a uniform limit if and only if, for every , there is such that for every and every . Necessity follows from the triangle inequality. For sufficiency, completeness of the real numbers first gives a pointwise limit . Letting in the bound with tolerance gives uniformly in . The same proof works for a complete metric space as codomain; completeness is essential.
Suppose continuous functions converge by uniform convergence to on a domain of a function , and with all these inputs in . The uniform limit theorem makes a continuous function, and the triangle inequality givesThe first term handles the changing approximation and the second handles the changing input. For on , the inputs instead give , , and . Pointwise convergence cannot supply the first uniform bound, and this pointwise limit also lacks continuity at one.
Uniform limit theorem Created 2026-09-29 Updated 2026-10-14
A uniform limit of continuous functions is a continuous function. No compactness assumption on the domain of a function is required.[ref]
For a proof, fix an input and tolerance . Uniform convergence supplies one with . Its continuity at supplies with for allowed inputs satisfying . The triangle inequality givesOne approximating function controls both endpoints of this estimate. Under pointwise convergence, selecting an index for supplies no common control at nearby . This explains why the polynomial functions can have a discontinuous pointwise limit on .
Uniformly continuous function Created 2026-09-24 Updated 2026-10-18
A uniformly continuous function has one input tolerance valid throughout its domain of a function. For , with , uniform continuity meansChoose the output tolerance first, then a positive valid for every pair of function inputs. It may depend on , the function and its domain of a function, but not on the pair’s location. The absolute values measure input and output distance.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §3.4, Definition 3.4.1: a single positive input tolerance for all pairs in the specified real domain
Compare the quantifier order with the epsilon-delta definition of continuity:Both lines end with . In the first, can depend on the point ; in the second, it is chosen before . Thus uniform continuity implies continuity at every point. Each requested gets its own shared tolerance.
For an exact example, take the polynomial function on the closed interval . For every pair of function inputs in that interval, polynomial factorization givesConsequently works everywhere on this domain of a function. With , the common tolerance is . Near the right endpoint, for example, and have input distance and output distance . The bound is sufficient; it does not claim the largest admissible input window at each point.
On the whole real line, the same polynomial function is a continuous function but fails uniform continuity. Take the sequences and , for positive integers . ThenFor any proposed , choose an integer . The inputs are closer than , yet their outputs violate the fixed tolerance . The sequences need not themselves have a finite limit: their mutual distance is what tends to zero. This is the obstruction captured by the sequential criterion for uniform continuity. Restricting the domain of a function to removes these escaping pairs.
A uniformly continuous function need not be a bounded function. The identity function on the real line has , so always works, although its image of a function is the unbounded real line. Uniform continuity controls changes between nearby inputs, not the overall size of outputs. Likewise, an unbounded domain of a function does not by itself prevent uniform continuity.
The square root supplies a different common tolerance on the interval . Assuming , put and . Since ,Interchanging the inputs when necessary provesThus guarantees uniform continuity on the entire domain of a function, including zero. For , any input distance below suffices. The pairs and both have input distance ; their output distances are respectively and . The common guarantee accommodates quite different local sensitivities.
This Hölder continuity bound allows a curved tolerance rule. It is weaker than a Lipschitz bound: at zero the output change divided by the input change isNo finite Lipschitz constant works near zero, even though uniform continuity does. A Lipschitz function does have uniform continuity, choosing when its Lipschitz bound is positive; when it is a constant function.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §3.4, Proposition 3.4.8 and Example 3.4.10: Lipschitz continuity implies uniform continuity; the square root on the nonnegative half-line separates the properties
Square-root input changes share an output tolerance even though amplification near zero is unbounded
. At left, the exact output changes for base points stay inside whenever and . The right panel computes the amplification for inputs : it grows without bound as decreases. These are calculated function graphs, with no experimental measurements. Details.For general metric spaces, replace the absolute values by the respective distance functions. The Heine-Cantor theorem gives an existence guarantee: every continuous function on a compact metric space is uniformly continuous. In particular, continuity on a finite closed interval provides a common tolerance, even when no simple formula for it is known.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §7.5, Definition 7.5.10 and Theorem 7.5.11: uniform continuity between metric spaces and the compact-domain theorem
For a short proof outline, fix . Continuity gives each point an open ball of radius within which outputs differ from by less than . The open balls of half these radii still cover the domain of a function. Compactness supplies a finite subcover. Take to be the smallest half-radius in this finite set. Two inputs closer than lie together in one of the original open balls, so the triangle inequality bounds their output distance by . The beautiful step is that the compact set turns local choices into finitely many choices, whose minimum stays positive.
A shared tolerance also makes uniformly continuous functions preserve Cauchy sequences: after choosing for , all sufficiently late input pairs are closer than , so all corresponding output pairs are closer than . Unlike a convergent sequence argument, this does not require an input limit inside the domain of a function. It is why uniform continuity is useful for extending a function toward missing endpoints and for the decay argument below.
Unique decoding 2026-11-05
Unique decoding recovers a single codeword from a corrupted received word, with a guarantee that the transmitted codeword is the only candidate within the allowed error radius. If a block code has minimum distance , then every pattern of at mostsymbol errors can be corrected in principle. Indeed, if two codewords were both within Hamming distance of , the triangle inequality would put them at distance at most , a contradiction.[ref]
Bridging Shannon and Hamming: List Error-Correction with Optimal Rate by Venkatesan Guruswami. section 1, minimum-distance barrier
The repetition code has , so one error is correctable: identifies . Two errors can produce , which lies closer to ; no decoder can guarantee success for all two-error patterns. The distance bound proves uniqueness, but does not itself give a fast decoding algorithm.
Uniqueness of a limit in probability Created 2026-09-24 Updated 2026-11-05
If converges in Probability to both and , then almost surely. Indeed, the triangle inequality and a union bound show that for every .
Unit sphere net from ball covering Created 2026-10-06 Updated 2026-11-05
Suppose the unit ball of a -dimensional normed vector space has metric covering number at , where . Cover by at most balls of radius . Discard every ball missing the unit sphere, and select one point of the unit sphere from each remaining ball. These selected points form a radius- metric net of the unit sphere, withIndeed, a unit sphere point and the selected point from the same covering ball each lie within of its center, so the triangle inequality bounds their distance by . The selection ensures that all centers of the new metric net have unit norm; the original covering centers need not. For Euclidean balls, the volumetric bound for Euclidean metric nets supplies the initial metric covering number estimate.
Wall metric Created 2026-09-24 Updated 2026-11-05
For a wallspace , defineThe wallspace axiom makes this finite. It is always a pseudometric: it is symmetric, vanishes on the diagonal and satisfies the triangle inequality. For the last claim, every wall separating and must separate from or from , so counting walls gives the inequality.[ref]
It is a metric exactly when the walls separate every pair of distinct points. For example, on with only the wall , the distinct points have distance zero. Identifying pairs at distance zero gives a genuine metric space.
The principal vertex of a dual cube complex sends indistinguishable points to the same vertex. The wall-count distance equals the combinatorial distance between their principal vertices, making this pseudometric useful for the wall-metric properness criterion.
Wall of marginal stability 2026-10-14
A wall of marginal stability is a locus in the parameter or vacuum space where the complex central charges in supersymmetry of possible decay products align in phase. The triangle inequality then becomes an equality, , permitting a BPS state to reach the threshold for decay into other BPS states. Away from such alignment, the strict triangle inequality can prohibit the decay. Supersymmetry protects the mass-charge relation of an existing short state; it does not guarantee that the state exists or remains stable everywhere in parameter space.
Weighted binary-sequence metric 2026-10-14
On this sum is a metric, since each summand obeys the triangle inequality and a zero sum forces coordinatewise equality. A prefix cylinder set fixing the first coordinates contains the open ball of radius about each of its points and has diameter at most . These bounds show that the metric topology equals the prefix cylinder set topology, the usual Cantor space topology.
Weighted Hamilton cycle 2026-10-14
A weighted Hamilton cycle is a Hamilton cycle in a weighted graph, with cost equal to the sum of its traversed edge weights. Here weights represent symmetric nonnegative costs, rather than conductances. Asking whether a Hamilton cycle exists is a feasibility question; asking for the cheapest one is an instance of the travelling salesman problem. A complete graph supplies every possible connection between distinct vertices, making feasibility automatic for , while choosing the cheapest visiting order remains a separate mathematical optimization problem.
A fictitious weighted graph on four vertices: its three Hamilton cycles, identified under reversal and cyclic rotation, have costs 14, 19 and 21
. Details. Assign the complete graph the symmetric edge costs , , , , and , in arbitrary units. Fix the start at and identify each Hamilton cycle with its reverse. The three possibilities areThese exhaust the possibilities: the permutations of the other three vertices give orders, paired into three reversals. Hence the perimeter tour really is optimal for this toy instance. The diagram's geometric lengths are not costs, and no triangle inequality is assumed.
The usefulness of this model is to distinguish visiting required sites from covering required connections. If tasks are assigned to vertices and the route must return after one visit to each, a weighted Hamilton cycle captures the ordering requirement. If the job instead requires each edge once, the relevant object is an Euler circuit. The shortest path problem asks only for a cheapest route between specified endpoints. A 1954 primary research paper gave a concrete motivation for the travelling salesman problem: certify that a particular tour through 49 cities has minimum road-distance cost.[ref]
Solution of a Large-Scale Traveling-Salesman Problem by George B. Dantzig and others. Solution of a Large-Scale Traveling-Salesman Problem by G. Dantzig, R. Fulkerson and S. Johnson, abstract; Journal of the Operations Research Society of America 2(4), pp. 393–410 (1954)
These are abstract route models. If a cost stands for a whole graph path through an underlying network, travelling between consecutive task vertices can pass through intermediate network vertices more than once. One visit per task therefore does not imply one visit per physical junction. One-way connections require a directed graph; changing costs or extra timing constraints require a richer model than the fixed symmetric toy instance.
Weighted metric for local uniform convergence Created 2026-10-14 Updated 2026-11-05
Let have nested compact sets covering it, with . Then every point has a neighborhood in some , and every compact subset is contained in one . For continuous scalar functions, take positive weights with and defineThe bounded metric transform makes the sum finite and gives its triangle inequality; the covering property gives definiteness. On , one may use and .
If , each fixed compact supremum norm tends to zero, since its summand is bounded by the whole metric. Conversely, control finitely many compact supremum norms and then the summable weight tail. This proves that realizes locally uniform convergence under the stated exhaustion conditions.
Merely writing a space as a union of compact sets is insufficient. Enumerate the points of the compact space and take finite initial subsets as . The resulting metric detects pointwise control on those finite sets, not uniform control on the entire compact space. The neighborhood and compact-containment conditions explain the difference.
Word metric Created 2026-09-24 Updated 2026-10-14
The word metric measures how many allowed moves are needed to change one group element into another. For a finite symmetric generating set of a group with , it is the graph distance between vertices of the Cayley graph, equivalentlyHere word length counts letters in a shortest representative of . The path metric on the entire Cayley graph also permits points inside edges; the word metric is its restriction to the group itself.[ref]
https://people.maths.ox.ac.uk/bridson/papers/BATH97.pdf. Bridson, Section 1.6 and the remark after Example 1.8
The word metric is left invariant:This corresponds to the label-preserving group action on the Cayley graph. Symmetry follows by reversing a shortest graph path; concatenating routes gives the triangle inequality.[ref]
https://webusers.imj-prg.fr/~kathryn.mann/classes/GGRminicourse.pdf. Mann, Groups, geometry, and rigidity, Definition 1.1
Right invariance can fail in a non-abelian group, because right multiplication replaces by through conjugation. In the free group with , we have , whereas : the latter freely reduced word has three letters. In an abelian group, conjugation fixes each element, so right invariance does hold. Cayley graphs of the integers and word metric balls in the integer lattice give examples where the word metric can be calculated explicitly.



