Skip to content

Erdős Problem #89

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

Choose \(n\) distinct points in the Euclidean plane and list the distances between distinct unordered pairs of points. Some pairs may have equal lengths, so the number of different distances can be much smaller than \(\binom n2\).

Erdős #89 asks whether every such point set determines at least

\[ c\,\frac{n}{\sqrt{\log n}} \]

distinct distances for some absolute \(c>0\) and all sufficiently large \(n\). The crucial word is every: an example achieving this scale cannot prove the lower bound for arbitrary configurations.

A small example

Take the \(3\times3\) integer grid. The possible nonzero squared distances are \(1,2,4,5,8\). It determines five distinct distances among its 36 unordered point pairs. Squared lengths are a convenient exact computational representation because taking square roots is injective on nonnegative reals.

Larger approximately square integer grids yield few distinct distances because the squared lengths are integers represented as sums of two squares. Classical number theory gives the upper scale \(O(n/\sqrt{\log n})\) for such grid examples, explaining why the conjectured lower bound would be asymptotically sharp.

What is known

The conjecture remains OPEN. Guth and Katz, On the Erdős distinct distances problem in the plane, Annals of Mathematics 181 (2015), 155–190, prove a lower bound of order

\[ \frac{n}{\log n}. \]

Their primary publisher abstract explicitly states that result. Its proof transforms a distinct-distances problem into incidence geometry for rigid motions and uses polynomial partitioning and ruled surfaces. It establishes the sharp exponent of \(n\) but leaves a factor \(\sqrt{\log n}\) between the proved lower bound and Erdős's conjectured estimate.

Requiring one vertex to have many distinct distances to the others is a stronger pinned-distance condition. It cannot be silently substituted for the original total-distance question.

GCL's current state

The pinned catalogue and maintained Erdős #89, edited January 2026, report OPEN. GCL independently enumerated the exact \(3\times3\) grid squared-distance set \(\{1,2,4,5,8\}\); the finite receipt is stored on CHAD. The original GCL issue #1358 classifies further native research as deferred until a new mechanism is available. The 2015 Annals primary theorem was checked at the abstract level, but its deep incidence proof was not independently reproduced.

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 fixture is to enumerate exact squared distances for rectangular integer grids through \(5\times5\). Acceptance: for \(3\times3\) the distinct squared-length set equals \(\{1,2,4,5,8\}\) and unordered pairs are counted once. Test integer representations of \(a^2+b^2\) separately. Stop at finite enumeration; it neither proves a new universal lower bound nor selects a Solve campaign.

Sources and claim boundaries

No new distinct-distance theorem, proof certification or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1358 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: DEFER_UNTIL_NEW_MECHANISM.
  • 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.

Back to catalogue · Compendium introduction