Erdős Problem #660
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances, convex.
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
How many different distances must appear between the vertices of a three-dimensional convex polyhedron? Unlike an arbitrary collection of points, the vertices are all extreme points of one solid: none lies inside the convex hull of the others.
The maintained Erdős Problem #660 asks whether every such \(n\) vertex polyhedron determines at least
distinct pairwise Euclidean distances, as \(n\) becomes large. The phrase \(1-o(1)\) means that the coefficient may fall slightly below one-half, but the relative shortfall must tend to zero.
There is a historical wording ambiguity: an earlier rendering of Erdős's question concerned the existence of configurations with fewer distances, whereas the currently maintained problem asks for a universal lower bound. The current, mathematically interesting question remains OPEN.
A small example
Put six equally spaced points on the unit circle in the plane \(z=0\), and add one vertex above its centre:
These seven points are the vertices of a full three-dimensional convex pyramid, with a regular hexagonal base.
The base determines the three positive chord lengths
Every distance from the apex to a base vertex equals
The apex adds no new distance. The seven vertices therefore determine precisely three positive distances,
This does not disprove the asymptotic conjecture: it shows how close to \(n/2\) a legitimate three-dimensional convex polyhedron can get.
What is known
The preceding geometry generalizes to every sufficiently large vertex count. Take a regular \(m\) gon of radius one in the plane \(z=0\). Its positive chord lengths are
They are strictly increasing over the indicated range, so the base has exactly \(\lfloor m/2\rfloor\) distances. Its longest chord \(L=L_{\lfloor m/2\rfloor}\) exceeds \(1\) for \(m\geq3\).
Add an apex of height
directly above the centre. All base-to-apex distances become exactly \(L\), one of the distances already present among the base vertices. Every base point is a genuine extreme vertex of the resulting pyramid, and the apex is outside the base plane. Thus for \(n=m+1\),
Consequently the minimum number of distinct distances among all \(n\) vertex convex polyhedra is at most \(\lfloor(n-1)/2\rfloor\). This is an elementary construction, also discussed in the public source comments. It proves that no universal bound with a leading constant larger than \(1/2\) could be correct. But an upper bound on the minimum is not the requested lower bound for every polyhedron.
The planar analogue is a theorem. In the plane, the vertices of a convex polygon determine at least \(\lfloor n/2\rfloor\) distances, a result attributed to Elte Altman's 1963 paper On a problem of P. Erdős, American Mathematical Monthly 70, 148–157. It is not legitimate simply to apply that proof to arbitrary vertices in \(\mathbb R^3\): those vertices need not all lie in one plane, and a planar polygon theorem does not automatically give an appropriate large planar subset of a three-dimensional convex polyhedron.
The maintained #660 entry also reports that Erdős once attributed a linear three-dimensional distance bound to Altman without supplying a corresponding reference. This is an unverified historical attribution, not an inspected primary proof.
An important quantifier distinction. The original wording discussed on the public #660 thread could be read as asking whether there exists a polyhedron with unusually few distances for each large \(n\). The current version asks whether every polyhedron has nearly \(n/2\) distances. The regular-pyramid family addresses an existence upper bound and does not settle the universal lower-bound question.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition PARTIAL. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.
Source interpretation and unresolved mathematical qualification: A regular-pyramid construction is an upper example, not a universal convex-polyhedron lower bound.
The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.
What remains
The immediate documentary task is to obtain and compare the relevant 1997 Erdős page, Altman's 1963 theorem and Erdős's later attribution. The result should preserve the exact quantifier structure of each historical version, while clearly naming the current mathematical conjecture.
The substantive problem is then to establish a uniform lower bound for the number of different distances determined by every three-dimensional convex polyhedron. A bounded preliminary approach is to investigate whether the vertex set contains an appropriately large subset whose geometry permits a planar or near-planar counting lemma. But claiming that every convex polyhedron has many vertices on one plane would itself require proof and is generally not an available premise.
A satisfactory advance must give a proved estimate with explicit assumptions, an honest comparison with existing general three-dimensional point-set results, and either a new geometric constraint or a certified counterexample. Numerical experiments on small pyramids cannot settle an asymptotic universal statement.
The editorial production path still requires critical source checking, consolidated protected publication, public browser MathJax inspection and exact-hash V2 admission.
Sources and claim boundaries
- T. F. Bloom, Erdős Problem #660: maintained OPEN three-dimensional formulation and historical caveat.
- Erdős #660 discussion and editorial history: reproduced ambiguous original wording, quantifier correction and known pyramid examples.
- E. Altman, On a problem of P. Erdős, American Mathematical Monthly 70 (1963), 148–157, cited by the solved planar analogue #93. Full original proof not independently read in this audit.
- Authenticated GCL #660 source audit: exact pyramid and statement-variant documentation.
- P. Erdős, Some of my favourite unsolved problems, Math. Japon. (1997), p.531 [Er97e]; also [Er75f]: exact historical passages not independently inspected.
Authority boundary: a verified elementary family giving an upper bound on the extremal minimum and an acknowledged historical-quantifier discrepancy. No new universal lower bound, independent certification, protected merge, deployed MathJax readback or editorial admission.
Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1931 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
- 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.