Aleksandrov–Rassias Problem¶

Ask when a mapping between real normed spaces that preserves one prescribed distance must preserve every distance and therefore be an isometry.

Version: v3 · 2026-09-06 · History
Domain-specific #: 1256
Origin domain: mathematics
Subdomain: functional analysis
Aliases: Aleksandrov problem for unit-distance preservers, Rassias problem, Distance-one preserving problem

Core Idea¶

The Aleksandrov–Rassias Problem is a family of rigidity questions about maps between real normed linear spaces. Let \(X\) and \(Y\) be such spaces and let \(f:X\to Y\). Suppose \(f\) has the distance-one preserving property: whenever \(\|x-y\|=1\), one has \(\|f(x)-f(y)\|=1\). Under which additional assumptions—such as continuity, surjectivity, dimension, or geometric properties of the range—does this single-distance condition force \(f\) to preserve all distances? The identity is the local-to-global rigidity implication, not one answer detached from its hypotheses.

The question lies between two classic results. The Mazur–Ulam theorem says a surjective isometry between real normed spaces is affine, but it begins with preservation of every distance. The Beckman–Quarles theorem shows strong rigidity for unit-distance preserving self-maps of Euclidean spaces of dimension at least two, without assuming continuity. Aleksandrov's 1970 work on mappings of families of sets and subsequent formulations motivated asking how far a one-distance premise survives beyond Euclidean geometry.^[1]

Rassias posed the general normed-space question and highlighted the role of regularity assumptions; his Monthly problem article records why distance-one preservation alone is a nontrivial preserver condition rather than a disguised isometry definition.^[2] In arbitrary spaces, chains of unit segments may not recover every metric distance, and the geometry of unit spheres can admit behavior absent in Euclidean space. Results therefore take the form: for a specified class of domain and codomain, plus stated mapping assumptions, DOPP does or does not imply an isometry.

The literature also studies stability variants. Exact DOPP asks whether an exact unit relation forces exact global distance preservation. Approximate versions ask whether a map that nearly preserves a designated distance lies near an isometry under controlled bounds. Tan and Xiang explicitly connect the Aleksandrov–Rassias problem with Hyers–Ulam–Rassias stability while keeping the exact and approximate questions distinct.^[3] The encyclopedia node preserves the reusable research template: choose spaces, distance set, regularity, and direction of preservation; determine the resulting rigidity or construct a counterexample.

Structural Signature¶

Normed domain. A real normed linear space \(X\) supplies the source metric.
Normed codomain. A real normed linear space \(Y\) supplies the target metric.
Mapping. A function \(f:X\to Y\) is the object whose rigidity is tested.
Prescribed distance. A fixed nonzero distance, conventionally one, defines the local preservation premise.
DOPP implication. Every source pair at that distance maps to a target pair at the same distance.
Auxiliary hypotheses. Continuity, surjectivity, injectivity, dimension, or range geometry are declared.
Global target property. The conclusion sought is preservation of all pairwise distances.
Affine aftermath. When surjectivity and isometry hold, Mazur–Ulam supplies affine structure.
Rigidity mechanism. Geometry or chains propagate information from the prescribed distance to other distances.
Counterexample route. Failure identifies which geometric or regularity assumption is load-bearing.
Exact/stable split. Exact preservation and bounded perturbation are separate problem regimes.
Status indexing. Every positive or negative result is attached to its space class and hypotheses.

What It Is Not¶

Not the definition of isometry. The premise preserves only one distance; the conclusion concerns all distances.
Not the Mazur–Ulam theorem. That theorem assumes an already surjective isometry and derives affinity.
Not exactly the Beckman–Quarles theorem. That is a Euclidean rigidity result supplying a motivating special case.
Not one settled universal theorem. Different normed-space and regularity assumptions yield different results.
Not continuity alone. Continuity is one possible hypothesis and does not replace geometric analysis.
Not approximate isometry. Stability questions introduce error bounds absent from exact DOPP.
Not norm preservation at the origin alone. Pairwise distance preservation is translation-invariant and stronger.
Not a claim over complex spaces without qualification. Scalar field and geometric assumptions must be stated.

Scope of Application¶

The Aleksandrov–Rassias Problem is literal when a result or counterexample tests whether preservation of one prescribed distance by a map of normed spaces forces preservation of every distance under explicit hypotheses.

Real normed spaces. The general formulation compares DOPP with global isometry.
Euclidean spaces. Beckman–Quarles-type rigidity provides a benchmark special case.
Hilbert and inner-product spaces. Orthogonality and sphere geometry can strengthen propagation arguments.
Strictly convex ranges. Range geometry may exclude ambiguous midpoint or segment behavior.
Finite-dimensional settings. Dimension-specific geometric constructions can prove or refute rigidity.
Generalized distance sets. Researchers ask which nonzero distances or sets of distances are conservative.
Approximate preservers. Stability branches quantify how local error controls global deviation.
Preserver problems. The template informs broader questions about mappings fixed by limited invariants.

Clarity¶

State scalar field, dimensions, norms, map direction, preserved distance, whether implication is one-way or bidirectional, and every regularity assumption. Define isometry as equality of all pairwise distances and distinguish it from linear isometry or affine isometry. Do not silently infer injectivity unless the assumptions establish it. Separate a theorem for self-maps from a theorem between two spaces and a universal statement from a named class. If using normalization from a distance \(r>0\) to one, show that the rescaling respects the spaces and map. For stability, state the error model and bound; do not mix an approximate conclusion into exact DOPP. Report counterexamples with the exact hypothesis they defeat.

Manages Complexity¶

A general map has infinitely many pairwise distances, so testing global isometry directly is an unbounded constraint family. The problem asks whether one level set of the metric can act as a rigidity generator. This converts a global preservation question into a sparse premise plus geometric propagation. The economy is powerful only when the unit-distance graph and norm geometry carry enough structure. In spaces with weak connectivity or flat unit spheres, local constraints can leave freedom. Organizing results by domain, range, regularity, and exactness prevents isolated theorems from being mistaken for a universal answer and exposes which assumptions perform the propagation.

Abstract Reasoning¶

Fix the real normed spaces and the mapping under study.
Normalize and state the prescribed nonzero distance.
Write the exact DOPP implication for all qualifying source pairs.
List continuity, surjectivity, dimensional, convexity, and direction assumptions independently.
Determine which additional distances can be constructed from unit-distance configurations.
Use the geometry to propagate preservation to rational or dense distance subsets where justified.
Invoke continuity only at the declared step needed to close a limit argument.
If propagation fails, search for a mapping exploiting the missing geometry or regularity.
Conclude all-distance isometry or record the precise counterexample boundary.
Treat approximate preservation in a separate stability analysis with explicit error bounds.

Knowledge Transfer¶

Problem Space is the strict parent by composition and presupposition. The Aleksandrov–Rassias Problem defines admissible objects—normed spaces, maps, and a one-distance constraint—and asks which hypotheses partition the space into rigid and non-rigid cases. The parent contributes variables, constraints, candidate solutions, and boundary exploration. The mathematical residual is DOPP and the sought implication to global isometry.

Examples¶

Canonical¶

Let \(f:\mathbb R^n\to\mathbb R^n\) with \(n\ge 2\) satisfy \(\|x-y\|=1\Rightarrow\|f(x)-f(y)\|=1\). The Euclidean case asks whether unit-distance configurations force every other distance. A positive rigidity theorem answers yes under its exact hypotheses. The example illustrates the template; replacing Euclidean norms with arbitrary norms changes the geometry and can require additional assumptions.

Mapped back: map + unit-distance constraint + Euclidean geometry → propagation across constructed distances → global isometry conclusion.

Applied / In Practice¶

A paper studies a surjective map from one real normed space to a strictly convex range and proves that preservation of unit distance in the specified direction forces all distances. Its contribution is not merely 'the problem is solved': it closes one cell of the hypothesis matrix. A different result with approximate errors belongs to the stability branch and must report a bound.^[3]

Mapped back: specified spaces and regularity → DOPP rigidity argument → conditional theorem located in the broader problem space.

Structural Tensions¶

Local premise vs. global conclusion. One distance carries little apparent data. Diagnostic: Which configurations propagate it to a dense distance set?
Generality vs. geometry. Broad normed spaces weaken Euclidean rigidity. Diagnostic: Which property of the unit sphere is actually used?
Continuity vs. combinatorial rigidity. A proof may or may not need limits. Diagnostic: Where precisely does regularity enter?
Exactness vs. stability. Small error is not exact preservation. Diagnostic: Is the conclusion equality or a quantified deviation?
Named problem vs. solved subcase. A theorem can close one regime only. Diagnostic: Which domain–codomain–hypothesis cell remains addressed?
Autonomous residual vs. generic Problem Space. Many problems classify maps. Diagnostic: Is one-distance preservation being tested as a generator of all-distance isometry?

Structural–Framed Character¶

Spaces, norms, map, prescribed distance, preservation direction, auxiliary hypotheses, global isometry target, and exact/stability split are structural. Dimension, norm class, convexity, continuity, surjectivity, and proof technique are framed. A positive result guarantees rigidity only inside its hypothesis cell and does not settle every generalized preserver problem.

Structural Core vs. Domain Accent¶

The transferable skeleton is Problem Space: define objects and constraints, partition cases by assumptions, and seek solutions or counterexamples. The mathematical accent is a norm-induced metric, DOPP at one distance, and the global-isometry target. Remove the single-distance premise and the result is a generic preserver problem; assume all distances from the start and the result moves to Mazur–Ulam's affine conclusion.

Problem Space is the strict parent by composition/presupposition: the named problem organizes a constrained family of mappings and conditional answer regions. Stability is a branch rather than the parent, because the canonical question is exact and can be posed without perturbation bounds.

The prospective workspace queue contains one strict upward edge to prime:problem_space. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Aleksandrov–Rassias Problem Domain-specific

Parents (1) — more general patterns this builds on

Aleksandrov–Rassias Problem is a kind of Problem Space Prime

Problem Space is the strict parent by composition/presupposition: the named problem organizes a constrained family of mappings and conditional answer regions.

Hierarchy paths (3) — routes to 2 parentless roots

Aleksandrov–Rassias Problem → Problem Space → Representation → Abstraction

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Aleksandrov–Rassias Problem sits in a sparse region of the domain-specific corpus (77^th 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

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Beckman–Quarles Theorem. A Euclidean unit-distance rigidity theorem.
Mazur–Ulam Theorem. Surjective real isometries are affine.
Hyers–Ulam–Rassias Stability. Quantitative closeness of approximate solutions to exact mappings.
Isometry. The conclusion property, not the one-distance problem.
Norm Preserver. Preserving \(\|x\|\) relative to an origin rather than all pair distances.
Unit-Distance Graph. A combinatorial encoding used in some rigidity arguments.

References¶

[1] A. D. Aleksandrov, “Mapping of Families of Sets,” Soviet Mathematics Doklady 11 (1970): 116–120. registry ↩

[2] Themistocles M. Rassias, “Is a Distance One Preserving Mapping between Metric Spaces Always an Isometry?” American Mathematical Monthly 90, no. 3 (1983): 200, https://doi.org/10.1080/00029890.1983.11971189. registry ↩

[3] Liyun Tan and Shuhuang Xiang, “On the Aleksandrov–Rassias Problem and the Hyers–Ulam–Rassias Stability Problem,” Banach Journal of Mathematical Analysis 1, no. 1 (2007): 11–22, https://doi.org/10.15352/bjma/1240321551. registry ↩a ↩b