Equilateral Dimension¶

Measure how large an exactly pairwise-equidistant subset a metric space can support, with the distance scale and attainment convention stated explicitly.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1778
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Metric Geometry → Mathematics
Aliases: Equilateral number

Core Idea¶

The Equilateral Dimension of a metric space measures the largest size of an exactly equidistant configuration that the space can support. A subset S of (X,d) is lambda-equilateral, for lambda>0, when.

d(x,y)=lambda for every distinct x,y in S`.

For a fixed distance lambda, the careful convention writes e_lambda(X) for the largest cardinality when a largest set exists and writes e_lambda(X)=infinity when no finite largest size exists. In a general metric space, the distance scale matters. A scale-free version may be stated as.

How would you explain it like I'm…

All-Same-Distance Dots

How many dots can you put down so that every dot is exactly the same distance from every other dot? On flat paper, you can fit three, like the corners of a triangle. In the air around you, you can fit four. That biggest number is the equilateral dimension, and it depends on how you measure distance.

Most Equally-Spaced Points

An equilateral set is a group of points where every two points are exactly the same distance apart. The equilateral dimension of a space is the largest number of points you can arrange that way. On a flat sheet the answer is 3 (a triangle), and in ordinary 3D space it's 4 (a pyramid made of triangles). Despite the name, it isn't counting directions like up or sideways — it counts how many perfectly equal-distance points fit. It also depends on how you measure distance, and some ways of measuring give different answers.

Largest Equidistant Point Set

In a space with a distance function, a set of points is equilateral if every pair of distinct points is the same distance λ apart. The equilateral dimension is the largest possible size of such a set. In ordinary n-dimensional Euclidean space it is n + 1, achieved by a regular simplex (triangle, tetrahedron, and so on). With the "max-coordinate" distance on n-dimensional space, the cube's 2ⁿ corners are all equally far apart, so the value is 2ⁿ. For any n-dimensional normed space, it is at most 2ⁿ. The word "dimension" is misleading: it doesn't count coordinates, and two different ways of measuring distance on the same space can give different answers.

In a metric space (X, d), a subset S is λ-equilateral (λ > 0) if d(x, y) = λ for all distinct x, y in S. The equilateral dimension measures the largest cardinality of such a set. In a general metric space the scale matters, so one defines e_λ(X) as the largest cardinality when a largest set exists and ∞ otherwise, and a scale-free version e(X) = sup over λ of e_λ(X), with ∞ marking unboundedness; this avoids assuming a maximizer exists. In a normed space, scaling an equilateral set changes λ but not its size, so λ can be dropped. In finite-dimensional normed spaces e(X) is finite and attained: e(ℓ₂ⁿ) = n + 1 via a regular simplex, e(ℓ∞ⁿ) = 2ⁿ via cube vertices, and every n-dimensional normed space satisfies e(X) ≤ 2ⁿ. The word 'dimension' is conventional rather than literal: it is an extremal cardinality depending on the full metric, and different norms on the same vector space can give different values.

Scope of Application¶

Equilateral dimension organizes extremal questions across several parts of metric and discrete geometry.

Finite-dimensional normed spaces. The unit-ball geometry determines which large exact equilateral configurations exist. Bounds for l_p^n, general Minkowski spaces, and Banach–Mazur neighborhoods are central examples.
Euclidean and convex geometry. Regular simplices realize the Euclidean value n+1; cube vertices realize the L-infinity value 2^n. Upper-bound proofs connect equilateral sets to convex hulls, packing, linear algebra, and topology.
General metric spaces. Tori, Hamming spaces, manifolds, projective spaces, and compacta support distinct equilateral-number problems because their metrics impose different exact-distance relations.
Infinite-dimensional spaces. Arbitrarily large finite equilateral sets need not assemble into one infinite equilateral set.

Clarity¶

Three questions must be separated.

Fixed scale or any scale? e_lambda(X) asks about one distance. In a normed space, homothety makes all positive scales equivalent. In an arbitrary metric space they can differ, so e(X) must declare whether it takes a supremum across lambda.

Manages Complexity¶

The invariant compresses a space's entire exact-distance feasibility landscape into a cardinal bound. It lets researchers compare metrics, state extremal theorems, separate construction problems from upper-bound problems, and quantify how a norm's unit-ball geometry supports symmetric configurations.

The signature also decomposes proofs. A lower bound exhibits an equilateral set and checks all pair distances. An upper bound shows that any set satisfying the equality constraints has limited cardinality.

Abstract Reasoning¶

Construct for lower bounds. Propose coordinates or combinatorial objects, calculate every pair distance, and count the set. A regular simplex, signed basis set, or cube vertex set supplies a certificate only for its own metric.

Prove upper bounds globally. Translate equal distances into linear independence, rank, convexity, volume, or combinatorial restrictions. A proof must cover every feasible equilateral set, not only a symmetric candidate.

Knowledge Transfer¶

The abstraction transfers literally among metric spaces when four items survive: a genuine metric, an exact common distance, a cardinality objective, and a declared attainment convention. This supports movement between normed spaces, discrete cubes, tori, manifolds, and graph metrics without changing the logical role.

What does not transfer is a numerical value or its geometric explanation. The cube construction is equilateral for L-infinity but not for Euclidean distance. A constant-distance error-correcting code and a regular simplex instantiate the same signature, yet their upper-bound tools and interpretations differ.

Relationships to Other Abstractions¶

Current abstraction Equilateral Dimension Domain-specific

Parents (2) — outgoing typed relations

Equilateral Dimension is a kind of Cardinality Prime

Equilateral Dimension instantiates prime:cardinality by strict subsumption.
Equilateral Dimension presupposes Metric Prime

Equilateral Dimension instantiates prime:cardinality by strict subsumption.

Hierarchy paths (6) — routes to 3 parentless roots

Equilateral Dimension → is a kind of Cardinality → presupposes Bijectivity → is a kind of Function (Mapping)

Show alternative paths (5)

Neighborhood in Abstraction Space¶

Equilateral Dimension sits in a moderately populated region (52^nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Metric Space Structures & Distance Maps (11 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25