Erdős Problem #653
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Stand at each point of a finite planar configuration and count how many different distances that point has to the other points. Some points may have the same count, even when their actual distances differ.
For a set \(X\) of \(n\) distinct points define
and let
Erdős Problem #653 asks whether \(g(n)\geq(1-o(1))n\). In plain language: for every small positive proportion \(\varepsilon\), and every sufficiently large \(n\), can some arrangement of \(n\) points exhibit at least \((1-\varepsilon)n\) different counts of distinct distances? This is a question about diversity among local counts, not about the total number of pairwise distances.
Status discrepancy, observed 13 October 2026: the maintained Erdős catalogue still says OPEN, while an external service, Conjectures.io, reports an affirmative Lean proof certified in September 2026. No GCL proof replay has occurred, and neither description can be silently substituted for the other.
A small example
Let
Comparing squared distances suffices: two nonnegative distances agree if and only if their squares agree. We obtain:
| Centre | Squared distances to other points | Count |
|---|---|---|
| \((-1,0)\) | \(\{1,2,4,9\}\) | 4 |
| \((0,0)\) | \(\{1,4\}\) | 2 |
| \((1,0)\) | \(\{1,2,4\}\) | 3 |
| \((0,1)\) | \(\{1,2,5\}\) | 3 |
| \((2,0)\) | \(\{1,4,5,9\}\) | 4 |
Thus the pinned-distance count vector is \((4,2,3,3,4)\); its value spectrum is \(\{2,3,4\}\). Hence
The calculation was independently recomputed using exact integer arithmetic. A finite example illustrates the definition but does not resolve the asymptotic question.
What is known
The maintained problem page attributes historical lower estimates of \(g(n)>3n/8\) to Erdős–Fishburn and \(g(n)>7n/10\) to Csizmadia–Ismailescu; it also reports an upper bound \(g(n)<n-cn^{2/3}\) for an absolute \(c>0\). These are catalogue-reported results, not independently reproduced proofs: the original papers' relevant theorem pages have not yet been inspected here. Note that a sublinear-defect upper bound is logically compatible with the proposed lower bound.
A Conjectures.io result for #653 describes an affirmative proof submitted by gus, checked in Lean on 15 September 2026, reviewed on 16 September and externally certified on 17 September. Its public source viewer displays the beginning of a reported 28,608-line Lean proof. The external report says its target matches the task and its permitted axioms. This is substantial third-party evidence, but GCL has not independently compiled the 28,608-line file, examined its transitive dependencies or mathematically adjudicated the result.
The formal semantics require special attention. GCL's pinned Formal Conjectures file has SHA-1 c46288f94af438eec9d8b977bfbd8343c597937f and states an eventual asymptotic inequality for maximalDistinctDistancesFrom. It is marked research/open and still contains a sorry proof hole. It is a conjectural source interface, not an accepted proof.
A helper definition counts the zero distance from a point to itself. The original problem excludes that distance. On a set of distinct points, this shifts every individual count by exactly one:
Such a uniform shift preserves how many different count values occur. This removes one elementary concern about the formalization but does not establish complete semantic equivalence of the 2026 submitted theorem and the GCL-pinned file.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.
Source interpretation and unresolved mathematical qualification: The maintained conjecture remains OPEN, while an external Lean-provider result reports a proof for a possibly different formal target; no GCL kernel replay.
The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.
What remains
First obtain the exact 28,608-line proof, immutable task bundle and version-locked dependency environment from the external report. Replay it with an authorized GCL Lean runner, recording the exact target, compiled dependency hashes, transitive axioms, elapsed time and memory consumption. Then independently compare its definitions and quantifiers with the pinned source, and critically inspect the mathematical mechanism. A kernel success for a different target would not resolve the problem.
Separately locate the original [Er97e] passage in Erdős's 1997 survey and the primary texts supporting the historical numerical bounds. If the external certificate's source cannot be reproduced, record the precise missing file or dependency. Do not declare the maintained open label incorrect without a reviewed basis.
Compendium editorial review, a protected production merge, real public mathematical-rendering inspection and an exact-hash V2 admission are also outstanding.
Sources and claim boundaries
- T. F. Bloom, Erdős Problem #653, history: maintained question and OPEN label, historical bounds. The full source papers were not inspected in this audit.
- P. Erdős, Some of my favourite unsolved problems, Math. Japon. (1997), 527–537, MR1487304: original reference key Er97e; exact problem paragraph not yet inspected.
- P. Erdős and P. Fishburn, Distinct distances in finite planar sets, Discrete Mathematics 175 (1997), 97–132: relevant distinct separate paper, not Er97e.
- G. Csizmadia and D. Ismailescu, Maximum number of different distance counts, Intuitive Geometry, Bolyai Society Mathematical Studies 6 (1997), 301–309: historical numerical result; detailed proof unverified.
- Conjectures.io, Erdős problem 653, September 2026: external Lean verification/review report, not GCL replay.
- GCL #653 source return: dated source discrepancy and bounded verification plan.
Authority boundary: documentary mathematical explanation, source-conflict record and independently checked finite example. No new theorem, independent proof certificate, protected production merge, deployed browser rendering or editorial admission is asserted.
Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1924 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.