Skip to content

Erdős Problem #94

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

Choose the vertices of a convex polygon with \(n\) points and group the unordered pairs by their distance. For each distinct positive distance \(u\), let \(f(u)\) count the number of pairs at that distance. Erdős #94 asks for an upper bound on the distance energy,

\[ E(A)=\sum_u f(u)^2\ll n^3. \]

The sum counts pairs of pairs sharing the same distance. It is not the sum of distances or the number of different lengths. Here the implicit constant must be absolute and independent of the polygon.

A small example

For the vertices of a unit square, four unordered pairs have distance \(1\) and two have distance \(\sqrt2\). The energy is therefore \(4^2+2^2=20\). Independently, \(\sum_u f(u)=4+2=\binom42=6\). For larger regular polygons, many different pairs share each chord length, making the energy substantial.

More generally, \(E(A)\) equals the number of ordered pairs of unordered vertex pairs with equal lengths. This double-counting interpretation avoids a common factor-of-two error when translating a proof involving ordered quadruples.

What is known

PROVED. Hanno Lefmann and Torsten Thiele's Point sets with distinct distances, Combinatorica 15 (1995), 379–408, is credited by the maintained catalogue with the stronger result \(E(A)\ll n^3\) whenever no three points of \(A\) are collinear. Every strictly convex polygon satisfies that condition, so the claimed extension includes the original problem. The original Erdős papers had attributed a solution to Fishburn without supplying a source; the maintained catalogue distinguishes that historical report from the cited 1995 theorem.

The publisher's original-paper record and bibliography have been checked. The full energy argument in the 1995 article has not been independently reconstructed from its proof pages in this tranche, so attribution to its precise theorem remains a source-fidelity qualification rather than a new GCL certification. Separately, the maintained catalogue reports a third-party Lean proof from January 2026; its exact dependencies and kernel execution have not been audited.

GCL's current state

The pinned 2026 catalogue and maintained Erdős #94 classify the question PROVED. The original issue is #1363, which requests an authenticated source-provenance audit, not a new Solve campaign. The stronger maximization conjecture that regular \(n\) gons maximize distance energy is separate and remains unproved here.

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 derive the identity between distance energy and equal-distance pair-of-pairs, then calculate exact squared distances and multiplicities for all regular polygons with \(3\le n\le10\). Acceptance: unordered pairs counted exactly once, \(\sum f(u)=\binom n2\), and the unit-square energy \(20\). Falsification: any inconsistent ordered/unordered normalization. Stop before claiming a proof of the universal cubic bound.

Sources and claim boundaries

No new extremal theorem, independent third-party Lean replay or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1363 — 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.

Back to catalogue · Compendium introduction