The problem
Put three points at positions 0, 1 and 3 on a line in the plane. Their possible distances are 0, 1, 2 and 3, including zero when a point is paired with itself. An infinite set of points can yield many more distances. Falconer asks whether sufficient geometric size forces its distances to occupy positive total length on a ruler. Size here means Hausdorff dimension, a way of measuring how much of space a set occupies at finer and finer scales. In the plane the conjectured threshold is dimension strictly above one; in higher-dimensional Euclidean space it is strictly above half the surrounding dimension.[1] [2]
Collect all straight-line distances between pairs of points in a closed and bounded set . If the set has enough fine-scale geometric size, must its distance values occupy positive length on a ruler? The precise size condition is Hausdorff dimension above , in ordinary -dimensional Euclidean space with . One way to express fine-scale size is to distribute total probability one across the set. For each positive , a suitable distribution satisfies for every ball , with one constant ; a ball contains the points within distance of its centre. The bound prevents too much probability from concentrating in small regions. The power records how this concentration can shrink with scale. The target is positive Lebesgue measure of , not just that it contains infinitely many values.[1] [2]
Scope
Compact subsets of Euclidean Rᵈ, d ≥ 2, with Hausdorff dimension greater than d/2; positive Lebesgue measure of the distance set.
What remains open
Infinitely many distance values need not occupy positive length: a countable collection of ruler marks can have length zero. The three-point example only illustrates how to collect distances and has dimension zero. The conjecture must work for every compact set—closed and bounded here—above the stated dimension threshold, without an extra regularity or product assumption.[1] [2]
Higher-threshold theorems and Pham’s results for structural subclasses do not handle every set above d/2. Hausdorff dimension one for the distance set alone does not guarantee positive one-dimensional measure. The conjecture uses the usual Euclidean distance and a strict dimension inequality; changing the metric or including the equality boundary would change the claim.[1] [2]
Why it matters
Many pairs of points can share a distance, so a set’s geometric spread might be lost when each pair is replaced by just one number. The conjecture predicts a limit to that collapse. It connects the complexity of where points lie with how varied their measurable separations must be, giving a continuous counterpart to asking how few distinct distances a large finite configuration can realize.[1] [2]
Sampling two points according to the geometric probability distribution and recording their distance produces a distribution supported on the distance set. A distribution can concentrate sharply on a few ranges even when the original set is spread out; controlling that concentration is part of the obstacle. This connects geometric counting to analytic estimates on functions and measures. Related methods also study distances from one fixed point, a stronger kind of geometric information, but a result for one structured or higher-dimensional-size class must remain distinguished from the full conjecture.[1] [2]
Definitions
3 terms
distance set
All straight-line lengths between two points of the given set. Equal lengths from different pairs count once; zero is included because a point may be paired with itself. The conjecture uses the usual Euclidean metric.[1] [2]
Hausdorff dimension
A notion of small-scale size using covers by pieces of arbitrarily small and possibly different diameters, and sums of powers of those diameters. The critical power distinguishes line-like, area-like and intermediate sizes. Equal-grid counts alone need not give this dimension.[1] [2]
Sources
- On Falconer type functions and the distance set problem
Notes on On Falconer type functions and the distance set problem
Primary paper read in its February 27, 2026 v2 revision; initial submission remains October 16, 2025. It states the unrestricted distance threshold and treats structural subclasses with additional hypotheses; selected definitions and statements, not the complete proof, were read.
- On Falconer’s distance set problem in the plane — arXiv v1
Notes on On Falconer’s distance set problem in the plane — arXiv v1
Primary paper introduction defines the distance target, its finite-configuration connection and a geometric-probability viewpoint. Its proved planar threshold is strictly above 5/4, rather than the full conjectured threshold above 1. Selected introduction and obstacle discussion were read, without a full proof audit.