Skip to content

Erdős Problem #754

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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

For n distinct points A in R^4, let f(n) maximize over A the minimum, over x∈A, of the number of OTHER points y at a common distance d(x)>0 from x, where the distance may depend on x. Erdős asked whether f(n)≤n/2+O(1). Swanepoel (2013) proved this in a stronger directed-incidence form, bounding Σ_x #{y∈A: |x−y|=d(x)} by n²/2+O(n) for ANY choice of radii d(x).

A small example

A regular tetrahedron has four vertices and can be embedded in R^4. Each vertex sees the three other vertices at the same distance, so f(4)≥3, larger than n/2=2 but consistent with an additive O(1) term. For n=2, any pair yields f(2)=1. Finite small-n examples cannot determine the uniform additive constant in the proved inequality.

What is known

Avis–Erdős–Pach [AEP88] gave n/2+2≤f(n)≤(1+o(1))n/2. Swanepoel [Sw13] sharpened the upper error to O(1) and established a directed spherical incidence bound; summing n radii gives f(n)≤n/2+O(1). The frozen GCL packet says PROVED and unformalized. A public September 16 2026 status aggregator subsequently lists #754 as PROVED (LEAN), but GCL's admitted FC-GDM-85F86371 snapshot has no #754 file and no protected kernel replay. The formal-status update must be verified against its exact proof hashes before certification.

GCL's current state

The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.

Critical source-scope distinction: Swanepoel directed radius choice n²/2+O(n) proves f(n)≤n/2+O(1), external Lean not GCL certified.

What remains

Inspect Swanepoel's published theorem for strict inequality conventions, directed versus undirected counting and constants; independently verify the tetrahedron fixture and summation implication. Retrieve the September 2026 external Lean proof identity and axiom report, without relabeling the admitted GCL snapshot.

Sources and claim boundaries

Maintained Erdős #754, authenticated original issue return. Original source papers and any external Lean certificate not fully replayed; Primary mathematical proofs and any external Lean claims are not certified.

Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.

Catalogue and evidence provenance

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