Skip to content

Erdős Problem #1087

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Among four distinct planar points there are six pairwise distances. A four-point set is called degenerate in Erdős Problem #1087 when two of those pair distances coincide.

How many such quadruples can appear in a configuration of \(n\) points? The problem asks for the maximum number \(f(n)\) and, in particular, whether

\[ f(n)\le n^{3+o(1)}. \]

This is not ordinary collinearity degeneracy. The original Erdős–Purdy (1971) formulation, section 4, printed p. 251, counts a quadruple whenever its six pairwise distances are not all distinct. Equal-length segments may therefore share an endpoint or be disjoint; disjointness is not an additional condition. This resolves the earlier definition ambiguity, but does not prove the historical extremal bounds.

A small example

For the four corners of a unit square, the six squared pair distances, including multiplicity, are

\[ 1,1,1,1,2,2. \]

The only four-element subset is degenerate. Because a four-point configuration contains at most one quadruple, \(f(4)=1\).

Equal lengths may also appear in a collinear quadruple: positions \(0,1,3,6\) on a line determine two length-three segments, \([0,3]\) and \([3,6]\), sharing one endpoint.

In contrast, the four points \((0,0),(2,0),(0,3),(4,5)\) determine six different squared distances. Thus repeated distances are not automatic.

What is known

Erdős and Purdy (1971) obtained the historical bounds reported by the catalogue:

\[ n^3\log n\ \ll\ f(n)\ \ll\ n^{7/2}. \]

The open question is whether the exponent on the upper bound can be reduced essentially to three. A small example cannot distinguish these asymptotic possibilities.

GCL's current state

This is one of the 20 predetermined critical-review problems. Authenticated source audit #2358 identifies a potential ambiguity in the phrase “degenerate four points” and supplies exact integer-distance examples.

The primary 1971 statement has now been checked against the reproduced printed p. 251; the six-distance definition includes shared-endpoint equal segments. The same paragraph asserts the historical lower and upper estimates without displaying their derivations. The bounds therefore still require a separate proof-provenance audit. The critical review remains pending, not completed.

What remains

The primary definition is resolved: count unordered four-point subsets with at least one repeated value among their six distances. The shared-endpoint witness at positions \(0,1,3,6\) has squared distances \(1,4,9,9,25,36\); this is a direct exact check, not a proof of either asymptotic estimate. Independently locate and verify the mathematical derivations of the \(n^3\log n\) lower and \(n^{7/2}\) upper bounds, and complete the remaining critical exposition review before adjudicating this article.

Sources and claim boundaries

Erdős Problem #1087; Erdős–Purdy, Some extremal problems in geometry, JCTA 10 (1971), 246–252, section 4, printed p. 251 (reproduced source text); authenticated GCL audit #2358; source-critical REVISE finding. The finite computations are independent; the proposed sharper upper bound remains open. This is an unaccepted draft and critical approval has not been issued.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2358 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_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.

Back to catalogue · Compendium introduction