Metric Map (Nonexpansive Map)¶
A function between metric spaces that never increases pairwise distance, equivalently a Lipschitz map with constant at most one.
Core Idea¶
A metric map, usually called a nonexpansive map, is a function \(f:(X,d_X)\to(Y,d_Y)\) satisfying
It is exactly a Lipschitz map whose Lipschitz constant is at most one. The invariant is global pairwise distance nonincrease: the map may preserve a distance or shrink it, but it may not stretch any pair. This definition is standard in metric fixed-point theory and metric geometry.
Scope of Application¶
In fixed-point theory, nonexpansive self-maps sit at the limiting boundary of contraction methods. Results require additional geometry—convexity, compactness, normal structure, uniform convexity, or hyperconvexity—because the unit bound alone supplies no fixed point. Iterative schemes such as Krasnosel'skii–Mann averaging are designed precisely for this weaker regime.
In metric geometry, short maps are natural morphisms because they respect the observable meaning of distance without demanding invertibility. Distance-to-a-set functions, nearest-point projections in Hilbert space, retractions onto convex sets under appropriate hypotheses, and quotient-like collapses supply recurring cases.
Clarity¶
The abstraction separates three questions that ordinary “stability” language blurs. Does the map avoid magnifying input error? Does repeated application converge? Does a fixed point exist? Nonexpansiveness answers only the first. Convergence and existence need extra structure.
The decisive diagnostic is pairwise. For \(f(x)=|x|\) on the real line, the reverse triangle inequality gives \(\lvert |x|-|y|\rvert\le |x-y|\), so the map is nonexpansive even though it is not linear or injective.
Manages Complexity¶
One inequality replaces an unbounded collection of case-specific perturbation estimates. From it, every pair of trajectories satisfies
by induction. Approximation error is therefore never amplified merely by applying the map repeatedly. Composition also lets a long pipeline be verified componentwise: if every stage is nonexpansive, the whole pipeline is.
Abstract Reasoning¶
If \(f:X\to Y\) and \(g:Y\to Z\) are nonexpansive, then
so composition is closed. The identity map has equality, establishing categorical identities.
If \(f\) is bijective and both \(f\) and \(f^{-1}\) are nonexpansive, applying the two inequalities yields
Knowledge Transfer¶
The same inequality transfers literally among metric geometry, nonlinear functional analysis, optimization, and metric fixed-point theory. What changes is the chosen metric and the source of the map; the pairwise test and composition proof do not change.
The parent Function (Mapping) carries source, target, evaluation, and composition across domains. Metric supplies the pairwise quantitative structure. The named candidate remains domain-specific because the unit Lipschitz comparison literally presupposes two metric spaces. “This policy is nonexpansive” outside such a space is metaphor until a metric is defined.
Relationships to Other Abstractions¶
Current abstraction Metric Map (Nonexpansive Map) Domain-specific
Parents (1) — more general patterns this builds on
-
Metric Map (Nonexpansive Map) is a kind of Function (Mapping) Prime
Function (Mapping) is the proposed minimal parent: a nonexpansive map is a strict function specialization constrained by two metrics.
Hierarchy path (1) — routes to 1 parentless root
- Metric Map (Nonexpansive Map) → Function (Mapping)
Neighborhood in Abstraction Space¶
Metric Map (Nonexpansive Map) sits in a sparse region of the domain-specific corpus (82nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Metric Geometry & Approximation (13 abstractions)
Nearest neighbors
- Equilateral Dimension — 0.84
- Aleksandrov–Rassias Problem — 0.82
- Metric projection — 0.82
- Mapping Space — 0.81
- Uniformly disconnected space — 0.80
Computed from structural-signature embeddings · 2026-09-08