← All problems

Erdős Problem #1127 — Countably colouring Euclidean space with no repeated distance

83 years old · traced to

For each positive integer dd, does Euclidean space Rd\mathbb{R}^d admit a partition into countably many sets A0,A1,…A_0,A_1,\ldots such that no positive distance occurs between two distinct unordered pairs of points in the same set? Writing ∥⋅∥2\|\cdot\|_2 for the Euclidean norm, the condition is that, for every kk and all x,y,u,v∈Akx,y,u,v\in A_k with x≠yx\ne y and u≠vu\ne v,

∥x−y∥2=∥u−v∥2⟹{x,y}={u,v}.\|x-y\|_2=\|u-v\|_2\quad\Longrightarrow\quad \{x,y\}=\{u,v\}.

Erdős Problems #1127 Davies, Partitioning the plane into denumerably many sets without repeated distances (1972)

Background

The problem belongs to a broader line of questions about partitioning Euclidean space to avoid prescribed geometric configurations. A set with the stated distance property cannot contain an isosceles triangle, since its two equal sides would give distinct pairs at the same positive distance. Davies discussed both avoiding isosceles triangles and the stronger requirement that every four points determine six distinct distances; he gave the distance-partition result under the continuum hypothesis (CH). Davies, Partitioning the plane into denumerably many sets without repeated distances (1972)

There is also a one-dimensional algebraic connection. Erdős and Kakutani proved that CH is equivalent to partitioning R\mathbb{R} into countably many sets linearly independent over Q\mathbb{Q}. Such independence prevents a nontrivial rational linear relation among points in one part, and thus forces distinct unordered pairs in that part to have distinct distances. Davies’s converse shows that the distance condition itself, even on the line, has a strong set-theoretic consequence. Erdős Problems #1127 Davies, Partitioning the plane into denumerably many sets without repeated distances (1972)

References

P. Erdős, Some remarks on subgroups of real numbers, Colloquium Mathematicum 42 (1979), 119–120.

Source: P. Erdős, Some remarks on subgroups of real numbers, Colloquium Mathematicum 42 (1979), 119–120.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.