Erdős Problem #215
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
Is there a subset \(S\) of the real plane such that every rigid motion \(T\) places exactly one integer lattice point inside \(T(S)\)?
Here rigid motions include translations and rotations, and reflections may be included without changing the formulation. Applying the inverse motion makes this equivalent to asking for a set \(S\) that meets every isometric copy of \(\mathbb Z^2\) at exactly one point. This is the classical Steinhaus problem.
A small example
A lattice fundamental domain such as the half-open unit square \([0,1)^2\) contains exactly one lattice point after every translation, but rotations break that property. A rotated copy of the domain can contain zero or more than one lattice point. Thus a solution must be much more subtle than merely choosing one representative from each coset of \(\mathbb Z^2\).
The set's existence is not automatically a claim of measurability. Choice-dependent sets can have unexpected descriptive-set-theoretic properties; a construction in unrestricted set theory does not imply that one can algorithmically decide membership.
What is known
PROVED. Steve Jackson and R. Daniel Mauldin, On a lattice problem of H. Steinhaus, Journal of the American Mathematical Society 15 (2002), 817–856, constructed a subset of \(\mathbb R^2\) meeting every isometric copy of \(\mathbb Z^2\) in exactly one point. Their shorter primary account, Sets meeting isometric copies of the lattice \(\mathbb Z^2\) in exactly one point, PNAS 99 (2002), 15883–15887, states the same theorem.
The construction depends on the axiom of choice. The proof solves the existential set-theoretic question, not the separate question whether a Borel, Lebesgue-measurable or effectively computable example exists.
The maintained Erdős #215 records Erdős's historical belief that no such set exists; the existence theorem resolves the question in the opposite direction.
GCL's current state
Pinned and maintained status: PROVED. Original issue #1484. Both published primary theorem statements have been checked. The transfinite proof and its precise choice axioms were not independently replayed or formally kernel-certified by GCL.
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 semantic task proves the equivalence between the two isometry quantifiers by taking inverse motions, then tests translated lattice fundamental domains and records why they fail under rotations. Acceptance: both existential quantifications retain exactly one intersection, rather than “at least one”; no claim of a constructive algorithm or measurable set is added without proof.
Sources and claim boundaries
- Jackson–Mauldin, JAMS 15 (2002), full primary theorem.
- Jackson–Mauldin, PNAS 99 (2002), short primary exposition.
- Erdős #215; original issue #1484.
No new Steinhaus set, independently verified set-theoretic construction or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1484 — 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.