Erdős Problem #224
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
Erdős asked whether every set of \(2^d+1\) distinct points in \(\mathbb R^d\) contains three of its points forming a strictly obtuse angle. At a vertex \(y\), the angle between vectors \(x-y\) and \(z-y\) is obtuse precisely when
Strict inequality matters: right angles with dot product zero are not obtuse. Equivalently, a set of points in which all angles are at most \(90\) degrees has at most \(2^d\) members.
A small example
In the plane, the four vertices of a square form only acute or right angles: no triple determines a strictly obtuse angle. Adding a fifth distinct planar point necessarily creates one. Thus the threshold \(2^2+1=5\) is sharp.
In \(\mathbb R^d\), the \(2^d\) vertices of the unit cube \(\{0,1\}^d\) also have no strictly obtuse angle. Indeed, in each coordinate the two differences from a fixed cube vertex point in the same direction or one is zero, so each term of their dot product is nonnegative. Summing gives a nonnegative dot product, including possible right angles.
What is known
PROVED, with a sharp cardinality. Ludwig Danzer and Branko Grünbaum, Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V. L. Klee, 1962, proved that a set of points in \(\mathbb R^d\) with no obtuse angle has at most \(2^d\) members. The hypercube construction attains the bound.
This is related to but distinct from problems that forbid right or obtuse angles, and from Danzer–Grünbaum's antipodal-set theorem. Changing the condition from \(<0\) to \(\le0\) excludes right angles and changes the extremal examples.
The maintained Erdős #224 also attributes an unpublished dimension-three argument to Kuiper and Boerdijk; the Danzer–Grünbaum theorem handles arbitrary finite dimension.
GCL's current state
Pinned and maintained classification: PROVED. Original issue #1493. The exact source statement's strict obtuseness and sharp \(2^d\) threshold are preserved. No independent full geometric proof or GCL Lean kernel certification is claimed.
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 task enumerates the cube vertices for \(d=1,2,3,4\) and checks every ordered choice of an angle vertex and two other vertices using exact integer dot products. Acceptance: all such dot products are nonnegative, each cube has exactly \(2^d\) distinct points, and the difference between zero and strictly negative dot products is explicit. Stop at sharpness fixtures; the upper theorem needs its original proof.
Sources and claim boundaries
- Erdős #224, Danzer–Grünbaum 1962 and historical sources.
- GCL source issue #1493.
No new extremal geometry theorem, independent proof replay or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1493 — 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.