Erdős Problem #655
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
Suppose we place \(n\) distinct points in the plane, with one restriction: from any point, no three of the other points may be equally distant. Erdős Problem #655 asks whether this restriction forces the point set to determine at least
different pairwise distances, for some fixed constant \(c>0\) whenever \(n\) is sufficiently large. Here a distance is counted once even if many pairs attain it. The statement has the quantifier order \(\exists c>0\,\exists N\,\forall n\geq N\,\forall X\) satisfying the restriction.
The literal displayed assertion is false. A regular polygon has very few distinct distances even though each individual distance from a vertex occurs at most twice. The maintained page credits this observation to Zach Hunter, but, as of the 13 October 2026 inspection of its publicly indexed text, still displays the catalogue status OPEN. The original intended hypotheses require separate source-fidelity treatment.
A small example
Take the seven vertices of a regular heptagon on the unit circle:
The chord length between vertices separated by \(k\) steps is
Consequently the entire seven-point set determines precisely three nonzero distances, namely \(d_1,d_2,d_3\). At any chosen vertex, each of those three distances occurs at exactly two other vertices, so no circle centred at that vertex passes through three other members of \(X\).
For comparison, the proposed bound would require \(3\geq(1+c)7/2>7/2\), impossible. A seven-point example alone would not refute an eventual assertion; the crucial point is that the same construction works for every \(n\geq3\).
What is known
Let
For any two distinct vertices, their Euclidean distance depends only on their cyclic separation \(k\), with \(1\leq k\leq\lfloor n/2\rfloor\). The distance is
These \(\lfloor n/2\rfloor\) values are distinct because \(\sin t\) is strictly increasing on \([0,\pi/2]\). Each vertex has at most two other vertices at any one distance (one in each direction around the polygon; for even \(n\), the antipodal vertex occurs only once). Thus all \(X_n\) obey the stated restriction while determining exactly \(\lfloor n/2\rfloor\) nonzero distances. For every fixed \(c>0\),
The asserted universal bound therefore fails for arbitrarily large \(n\), indeed for every \(n\geq3\). This is an elementary, complete argument for the literal formulation, attributed to Hunter rather than to a new GCL discovery.
The maintained Erdős problem page both displays OPEN and describes the counterexample. It suggests that the intended question may have assumed general position (for example, no three collinear and no four concyclic). That stronger version excludes regular \(n\) gons for \(n\geq4\), and this counterexample does not decide it. The primary original reference is Erdős's 1997 article [Er97e]; its exact passage and historical hypotheses have not been independently inspected in this cohort.
The pinned GCL formal-provider file makes the distinction explicit: Erdos655.erdos_655 encodes the literal proposition with answer(False), whereas Erdos655.erdos_655.variants.general_position additionally assumes InGeneralPosition X. Both theorem bodies in this pinned file contain sorry; neither is a certified GCL proof. The first theorem's annotation links to an external, later Lean proof source at commit 4aaaf544, whose literal-disproof theorem has a proof body and whose general-position variant still has sorry. This source-level inspection is not a GCL compilation or transitive-axiom audit.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition PARTIAL. 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: Regular n-gons refute the literal center-circle restriction with >n/2 distances; source's OPEN label may refer to a stronger general-position regime.
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
- Source-fidelity task: obtain Some of my favourite unsolved problems, Math. Japon. (1997), pp. 527–537, identify the exact reference passage for #655, and resolve whether additional general-position hypotheses were implicit. Record precise page/quotation provenance, without conflating the displayed literal statement with reconstructed intent.
- Bounded mathematical task for the variant: under the extra
InGeneralPositioncondition and the no-three-equal-pinned-distances condition, establish a new explicit lower bound or supply a family of counterexamples. The acceptance test must state the numerical constants, assumptions, sample sizes or uniform asymptotic proof, and exact configuration witnesses. The regular polygon is not a witness for this stronger version. - Formal verification task (optional, justified): if a GCL-formal-proof claim is desired, replay the exact external 655 Lean proof and dependencies, check the target semantics, proof holes and axioms, and report the exact hashes. Do not infer this from a repository annotation.
- Editorial governance: critically check the authenticated source return and resolve its precise primary-source limitation before protected production, public MathJax verification and separate V2 admission.
Sources and claim boundaries
- T. F. Bloom, Erdős Problem #655, maintained OPEN label and explicit Zach Hunter regular-polygon counterexample, publicly indexed text checked 13 October 2026.
- Erdős Problem #655 discussion: comments emphasize ambiguity of historical intent, not a settled version of additional hypotheses.
- P. Erdős, Some of my favourite unsolved problems, Math. Japon. (1997), 527–537, MR1487304, reference key Er97e: bibliographic attribution only; original passage not inspected.
- GCL pinned Formal Conjectures, 655.lean, formal provider lock; theorem declarations contain holes.
- External formal-proof source, commit 4aaaf544: inspected Lean source, not GCL-replayed or GCL-certified.
Authority boundary: an attributed, elementary disproof of the displayed literal assertion; a genuinely unresolved historical-source/stronger-variant question; no claim of new discovery, validated Lean proof, protected production publication, mathematical certification or editorial admission.
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: #1926 — 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.