Reach (Mathematics)¶

Measure the largest open Euclidean tube around a closed set in which every point has a unique nearest point on the set, exposing the first scale at which metric projection becomes ambiguous.

Version: v3 · 2026-09-06 · History
Domain-specific #: 2628
Origin domain: mathematics
Subdomain: geometric measure theory
Aliases: Reach of a set, Federer reach

Core Idea¶

The reach of a nonempty closed set \(A\subseteq\mathbb R^n\) is the supremal radius of an open offset neighborhood on which nearest-point projection onto (A) is single-valued. Write

\[ d_A(x)=\inf_{a\in A}\|x-a\|, \qquad \Pi_A(x)=\{a\in A:\|x-a\|=d_A(x)\}. \]

Then

\[ \operatorname{reach}(A) =\sup\{r\ge 0:|\Pi_A(x)|=1\text{ whenever }d_A(x)<r\}. \]

Closedness matters: in finite-dimensional Euclidean space it ensures that a nearest point exists, so the test isolates uniqueness rather than mixing uniqueness with nonattainment of the distance minimum. Federer introduced positive-reach sets as a class broad enough to include convex sets and compact closed sufficiently regular embedded manifolds, or manifolds with a positive global normal-tube radius, while still supporting curvature measures and tube formulas.

Scope of Application¶

Reach belongs to geometric measure theory and extrinsic differential geometry. It applies to nonempty closed subsets of Euclidean space, including closed convex sets, sufficiently regular embedded manifolds, and more general positive-reach sets that may have boundary or nonsmooth but controlled features. Federer used the condition to extend curvature measures beyond smooth submanifolds.

In computational geometry and manifold inference, a positive lower bound on reach supplies a geometric conditioning scale. Sampling and noise must resolve distances smaller than that scale if a point cloud is to support reliable reconstruction of a manifold's topology.

Clarity¶

Reach clarifies four layers that informal geometric language often collapses.

Existence: does a nearest point on the set exist? Closedness in finite-dimensional Euclidean space handles this.
Uniqueness: is that nearest point the only one? This is what fails on the medial axis.
Uniform clearance: how far from the entire set does uniqueness hold simultaneously? This is the tube quantified by \(r\).
Threshold status: is the reported radius a supremum, and is it finite, zero, infinite, or attained?

Manages Complexity¶

The geometry of an arbitrary embedded set can involve infinitely many points, directions, curvature values, and self-approach relations. Reach compresses that field into one operational scale with a precise guarantee: below it, nearest-point assignment is globally unambiguous. Once a positive lower bound \(\tau\) is established, arguments can work inside a certified tube rather than re-proving projection uniqueness point by point.

Abstract Reasoning¶

Reach supports reasoning through the duality between a universal tube property and an obstruction set. To prove \(\operatorname{reach}(A)\ge r\), establish that every point with \(d_A(x)<r\) has a unique footpoint. To prove \(\operatorname{reach}(A)\le r\), exhibit ambiguous-projection points at distance at most \(r\), or a sequence whose distances decrease to \(r\). The sequential route is essential when the infimum is not attained.

Knowledge Transfer¶

The transferable core is a radius of unambiguous decoding: objects near a structured set can be assigned to one source point until competing explanations become possible. This pattern helps interpret robust reconstruction, tubular coordinates, denoising to a manifold, and condition-number arguments. It also suggests a disciplined question in adjacent settings: what is the largest perturbation neighborhood in which the inverse assignment remains unique?

Relationships to Other Abstractions¶

Current abstraction Reach (Mathematics) Domain-specific

Parents (1) — more general patterns this builds on

Reach (Mathematics) presupposes Metric Prime

Metric — prospective strict parent (composition / presupposes). Reach literally requires ambient Euclidean distance, distance-to-set, and metric balls.

Hierarchy path (1) — routes to 1 parentless root

Reach (Mathematics) → Metric → Function (Mapping)

Neighborhood in Abstraction Space¶

Reach (Mathematics) sits in a sparse region of the domain-specific corpus (67^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

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