Erdős Problem #214
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: geometry, distances, ramsey theory.
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
Suppose \(S\subseteq\mathbb R^2\) contains no pair of points at Euclidean distance one. Must its complement contain the vertices of a unit square? The complement consists of every planar point not in \(S\), regardless of whether \(S\) is measurable or finite.
Equivalently, colour the plane red and blue so that there is no blue unit-distance pair. The conjecture asks whether a red unit square is unavoidable.
A small example
Take \(S=\{(0,0)\}\). It contains no unit-distance pair, and the complement contains innumerable unit squares away from the origin. This verifies the conclusion in one easy case but says nothing about adversarial infinite sets \(S\).
A unit square has four points with side lengths one, perpendicular adjacent sides and diagonals of length \(\sqrt2\). A rotated square still counts. Requiring only four points that form some square would weaken the statement.
What is known
PROVED. András Juhász (1979) showed the much stronger result: for every configuration of four planar points, the complement of a unit-distance-free set contains a congruent copy of that configuration. A unit square is a special case, so its existence follows immediately.
The maintained Erdős #214 also records a separate extremal question: the largest number \(k\) such that every unit-distance-avoiding two-colouring has a red congruent copy of every \(k\) point set. The current bounds are
Juhász's universal four-point theorem gives the lower bound; Csizmadia and Tóth (1994) supplied the upper bound seven, improving earlier bounds. The exact value of this stronger Ramsey parameter is not known. Proving the original square existence does not settle it.
GCL's current state
Pinned and maintained status for the original square question: PROVED. Original issue #1483. The primary historical attribution and quantified four-point strengthening were reviewed in the catalogue; Juhász's complete proof was not independently reconstructed.
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 finite fixture enumerates placements and orientations of unit squares in a small rational-coordinate grid, checks that no pair in the forbidden blue set has squared distance one, and tests red-square witnesses. Acceptance: all four side lengths equal one, the diagonal lengths equal \(\sqrt2\), and restrictions of a whole-plane problem to a finite grid are labelled exploratory only. Replaying Juhász's theorem is a separate proof task.
Sources and claim boundaries
- Erdős #214, Juhász 1979 and Csizmadia–Tóth 1994.
- Original source issue #1483.
No new Euclidean Ramsey theorem, independent proof certification or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1483 — 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.