Erdős Problem #1127
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: independent (not automatically the live result).
Subject areas: geometry, distances, set 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.
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
Can Euclidean space \(\mathbb R^n\) be divided into countably many sets such that no two distinct unordered pairs of points within any one set have the same distance?
Erdős Problem #1127 requires each class \(S\) to satisfy, whenever \(\{a,b\}\ne\{c,d\}\),
The maintained catalogue labels the statement independent of ZFC, but the claimed negative direction needs a specific source-fidelity check.
A small example
The points \(\{0,1,3\}\subset\mathbb R\) have pair distances \(1\), \(2\) and \(3\), all distinct, while \(\{0,1,2\}\) repeats distance \(1\).
More generally, any set of real numbers linearly independent over \(\mathbb Q\) has pairwise distinct distances: an equality \(|a-b|=|c-d|\) yields a rational linear relation \(a-b=\pm(c-d)\), impossible for distinct unordered pairs in a linearly independent set.
This proves a useful implication, not that all real numbers can be partitioned into countably many such sets.
What is known
Assuming the continuum hypothesis, Erdős–Kakutani (1943) established a countable decomposition of the line into rational-linearly-independent sets. Davies (1972) extended the positive distance-partition conclusion to the plane, and Kunen (1987) to every fixed finite dimension.
The maintained catalogue reports an obstruction when CH fails, but its explanatory sentence explicitly describes finite-colouring rather than countable-colouring failure. A statement that finitely many classes do not suffice is logically weaker than saying countably many classes do not suffice. That gap must be closed with an appropriate theorem before independently certifying the claimed ZFC independence.
GCL's current state
Authenticated source return #2398 records the distinction as a status-evidence conflict without claiming the catalogue is necessarily wrong.
The publisher record for Kunen (1987), Partitioning Euclidean space, Mathematical Proceedings of the Cambridge Philosophical Society 102, pp. 379–383, is verified. The full original argument and the non-CH obstruction have not been independently replayed.
What remains
Inspect Erdős–Kakutani, Davies and Kunen primary papers; locate a genuine countable-colouring obstruction under a consistent \(\neg\mathrm{CH}\) hypothesis or adjust the status if none is established. Document exactly which direction and which dimension each proof supports.
Sources and claim boundaries
Erdős #1127; Erdős–Kakutani (1943); Davies (1972); Kunen (1987); GCL source audit. Finite examples and the linear-independence implication verified. Independence externally reported but converse not certified; unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2398 — 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.