Skip to content

Erdős Problem #755

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: geometry.

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 points in Euclidean R^6, what is the maximum number of equilateral triangles of unit side length? Erdős conjectured T₆ᵘ(n)≤(1/27+o(1))n³. The maintained problem is PROVED: Clemen, Dumitrescu and Liu [CDL25b] established the stronger asymptotic T₆(n)=(1/27+o(1))n³ even counting triangles of ALL side lengths, not just unit triangles.

A small example

Split R^6 into three mutually orthogonal 2-dimensional planes through the origin. Put a points on a circle of radius 1/√2 in the first plane, b on the same-radius circle in the second, and c in the third, where a+b+c=n. Every point from different circles is at squared distance 1/2+1/2=1; hence every triple with one from each circle is a unit equilateral triangle. Its count is abc, which equals n³/27 when a=b=c=n/3, up to rounding O(n²). This is a constructive lower bound, not the 2025 upper proof.

What is known

Erdős–Purdy [ErPu75] first gave the three mutually orthogonal circle construction; later historical sources attributed it to Lenz, so provenance must be preserved. Clemen–Dumitrescu–Liu (2025) proved a stronger any-size extremal asymptotic and reportedly exact formulas for even dimensions d≥6 for large n. The original 2025 theorem's exact qualifiers and triangle counting convention (unordered triples) are not independently reread in full. The source's PROVED badge does not mean GCL formal Lean certification.

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: clemen dumitrescu liu all side length strengthening proved; original 2025 full proof pending. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Source-lock Clemen–Dumitrescu–Liu 2025 theorem and the original ErPu75 construction, prove the orthogonal-circle distance identity and floor/ceiling balanced product abc≥n³/27−O(n²). Compare fixed unit-side triangle counts versus all-size counts with unordered vertex triples.

Sources and claim boundaries

Maintained #755; 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: #2026 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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