Erdős Problem #93
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: geometry, convex, 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
Place \(n\) distinct points in strictly convex position in the plane, meaning every point is a vertex of their convex polygon. Count the different Euclidean distances between unordered pairs of these points.
Erdős #93 asks for a universal lower bound of
distinct distances. The assertion concerns all pairs of vertices together, not the number of distances from a single designated point. Convexity is essential to the theorem's geometric argument.
A small example
Four vertices of a square determine only two distances, the side length and the diagonal length, exactly \(\lfloor4/2\rfloor=2\). A regular pentagon also determines just two lengths: side and diagonal. This meets the bound \(\lfloor5/2\rfloor=2\).
Counting the multiplicities of equal distances is unnecessary for the statement. For a regular polygon, symmetries cause many different pairs to share a single length.
What is known
PROVED. E. Altman proved the required convex-polygon theorem in On a Problem of P. Erdös, American Mathematical Monthly 70 (1963), 148–157. The publisher record confirms the original article and pages. The maintained Erdős #93 identifies this as Altman's result.
A later third-party Lean proof is reported on the maintained problem page and identified in a contemporary formal-proofs repository. This reporting is not equivalent to independent verification under GCL's protected source lock. The pinned Formal Conjectures snapshot for this cohort has no admitted #93 statement file; later upstream versions are not silently promoted.
The stronger statement that one particular polygon vertex must determine \(\lfloor n/2\rfloor\) distinct distances is a separate open problem, #982. It cannot be inferred from Altman's theorem by moving quantifiers.
GCL's current state
The pinned 2025 catalogue and maintained page classify #93 as PROVED, with externally reported Lean formalization. The original issue is #1362. The primary Altman publisher citation was checked, but the full 1963 proof and later proof-assistant dependency graph were not independently audited in this editorial tranche.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded verification task is to generate regular convex polygons for \(3\le n\le12\), enumerate exact chord-length classes by cyclic separation, and show the number is \(\lfloor n/2\rfloor\). Acceptance: an algebraic proof that chord lengths for separations \(1,\ldots,\lfloor n/2\rfloor\) are pairwise distinct and the other separations repeat these lengths. This establishes sharp examples but not Altman's universal lower bound for arbitrary convex polygons. Independently auditing the deep theorem is a separate proof task.
Sources and claim boundaries
- Altman, American Mathematical Monthly 70 (1963), 148–157, publisher primary bibliographic record.
- Erdős #93, reported proof and separate stronger question #982.
- GCL original issue #1362.
No new geometric theorem, independently certified Lean proof, or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1362 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.