OpenAI preprint, September 2026 · §1. Introduction
Theorem1.1:Seven labels admit a measurable proper coloring of the Euclidean plane
Five labels force a monochromatic unit segment.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
The unit-distance chromatic number is the least number of labels needed to color the Euclidean plane so that points at distance one receive different labels. For , the set of color labels is . The lower-bound statement uses the complex plane . The seven-color statements use the Euclidean space with Euclidean distance .
A proper unit-distance coloring of with labels is a map satisfying (1): (1)The Euclidean plane is -colorable if it admits a map assigning different labels to every pair of points at Euclidean distance one.✦
The Claim
Theorem 1. Let be a map. There are points satisfying (2): (2)✦There is a map satisfying (3): (3)✦There is a measurable map satisfying (4): (4)✦
In the paper, the result reads: the Euclidean plane has no proper five-coloring, even with arbitrary color classes, and consequently .
What Is Checked
The five-label statement ranges over all maps , while the upper-bound statements concern colorings of the Euclidean space , with measurability required in the final existence statement.