Erdős Problem #91
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
Among all sets of \(n\) distinct points in the Euclidean plane, some use as few different pairwise distances as possible. Call such configurations distance-minimizing. Two configurations are similar if one can be obtained from the other by a Euclidean isometry followed by a positive uniform rescaling.
Erdős #91 asks whether, for all sufficiently large \(n\), there exist at least two distance-minimizing configurations that are not similar. This asks about the uniqueness of minimizers, not about the minimum number of distances itself.
A small example
For \(n=3\), the equilateral triangle uniquely minimizes the number of distances up to similarity: it has just one nonzero distance. For \(n=4\), a square and two equilateral triangles sharing an edge both determine exactly two distances. In the square their ratio is \(\sqrt2\), while in the triangle-pair configuration their ratio is \(\sqrt3\). The two configurations therefore cannot be similar.
These contrasting finite cases show why the statement includes the phrase “sufficiently large.” Neither uniqueness at \(n=3\) nor nonuniqueness at \(n=4\) decides eventual nonuniqueness.
What is known
The eventual-nonuniqueness conjecture remains OPEN. The maintained Erdős #91, edited 13 April 2026, reports a unique minimizer for \(n=5\) (the regular pentagon, which has two distances) and points to a published 2024 proof by Kovács. Erdős had also recorded non-similar optimal configurations for \(6\le n\le9\).
The extremal value of the minimum number of distances is the subject of #89, and bounds for that value are insufficient to classify all equality cases. FormalConjectures' protected ErdosProblems/91.lean defines optimality and similarity, with a conjecture about eventual failure of uniqueness. Its proof holes and finite-variant statements are not kernel certifications.
GCL's current state
The pinned 2025 catalogue and maintained page both identify #91 as OPEN. The original assignment is #1360, where the protected formal-provider SHA is recorded. The precise 2024 Kovács theorem and the original Erdős 1987 publication have not been independently page-audited in this tranche. A historical statement remains distinct from unreviewed community proposals.
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 successor is to prove that the square and the pair of equilateral triangles both minimize the number of different distances for four distinct points, and that the two are non-similar. Acceptance: exactly two distinct positive squared distances in each example, a proof that a four-point planar set cannot have all six pairwise distances equal, and distinct distance ratios. Stop at \(n=4\); this cannot imply eventual nonuniqueness.
Sources and claim boundaries
- Maintained Erdős #91, finite examples and original references [Er87b] and [Ko24c].
- Pinned FormalConjectures 91.lean.
- GCL source issue #1360.
No eventual-nonuniqueness result, proof of the 2024 classification, or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1360 — 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.