Erdős Problem #756
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
Can n points in R² determine at least c n DISTINCT distances, each occurring among more than n unordered pairs of distinct points? Erdős and Pach asked this in #756, which is PROVED by Bhowmick [Bh24]: a construction has floor(n/4) different distances, each occurring at least n+1 times. A stronger demand for EVERY distance except the diameter is a SEPARATE unresolved question.
A small example
Four vertices of a unit square have four unit-distance pairs (its sides) and two diagonal-distance pairs. Since n=4, even the most frequent distance occurs only n, not strictly more than n. The square is not a counterexample to the existence claim for arbitrarily large n; its example demonstrates how to count UNORDERED pairs and distinguish ≥n from >n.
What is known
The maintained source credits Bhowmick [Bh24] with the floor(n/4) ≥n+1 construction and more generally floor(n/(2(m+1))) distinct distances each occurring at least n+m pairs, for fixed m and n sufficiently large. Clemen–Dumitrescu–Liu [CDL25] studied lattice point frequency as a separate construction; the 'all distances except largest' version remains unproved. Hopf–Pannowitz [HoPa34] bounded diameter pairs by n, but this does not impose the same limit on smaller distances. External LEAN status reported, not a GCL protected kernel replay.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: bhowmick many high multiplicity distances proved; diameter all distances stronger unresolved; external lean gcl unreplayed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Inspect Bhowmick 2024 construction and prove an exact small finite example count with unique unordered pairs; source-lock the n/(2(m+1)) qualifier and m≥1. Trace formal-status proof hash and axioms if external Lean is reported; do not transfer diameter bounds to arbitrary distances.
Sources and claim boundaries
Maintained #756; GCL source return. Original papers and full formal proof status not independently checked. no new independent primary theorem certification batch publication, deployed MathJax or editorial admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2027 — 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.