Skip to content

Documentary state: EDITORIALLY_ADMITTED. The manuscript has a protected editorial admission, not a theorem certification.

OAI-26 family 073: Falconer's distance conjecture

Editorial status: DRAFT_UNACCEPTED. Mathematical status: NO_CERTIFICATION.

The question in plain language

How large must a fractal point set be before its collection of pairwise Euclidean distances occupies a set of positive length?

A small example

A planar line segment determines every distance from zero up to its length. The difficult cases are irregular fractal sets with no segments.

What is known

The pinned manuscript claims that for every integer dimension of at least two, a compact set in that Euclidean space whose Hausdorff dimension is strictly greater than half the ambient dimension determines a distance set of positive one-dimensional Lebesgue measure. Its introduction explicitly excludes an endpoint or sharp pinned-distance claim. The described proof uses directional cap bounds, multiscale profiles, oscillatory graph reductions and Fourier-shell reconstruction. These remain publisher claims, not GCL-certified theorems.

GCL verification state

The abstract and full theorem statement were read from source TeX pinned to openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. Full proof replay and independent Lean validation are not established.

What remains

Audit the angular estimates, dimension-dependent cases, oscillatory and recursive steps, positive-measure conclusion, and source/formal statement parity. Exact manuscript hashes, the separate critical review, regression tests and protected admission are required.

Sources and claim boundaries

Pinned primary manuscript. No theorem certification.


Indexed primary manuscript paths: