OpenAI preprint, September 2026 · §4. Transfer between proper and weak measurable colorings
Proposition4.2:The same finite set of labels suffices
Proper colorings yield Borel weak colorings.
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 graph of the complex plane joins two points when their distance is one. An unrestricted coloring assigns a label to every point, with no measurability condition on the assignment. The weak measurable condition concerns unit segments parametrized by a point of the plane and an angle.
For a positive integer , a proper unit-distance coloring is a map to the labels in satisfying (1). (1)✦
The angle circle is the additive quotient in (2); the unit direction at an angle is its image on the complex unit circle under the map in the same display. (2)The normalized angular measure on is its Haar probability measure.✦ Write for planar Lebesgue measure on .
A weak measurable coloring is a function that is almost everywhere measurable with respect to and satisfies the exclusion condition (3) on the product of the plane and the angle circle. (3)✦
The Claim
Theorem 1. Let be a positive integer and let be a proper unit-distance coloring. Then (4)✦Also, (5)✦
In the paper, the result reads: for every positive integer , if the plane admits an unrestricted proper -coloring, then it admits a weak measurable -coloring.
What Is Checked
The assertions (4) and (5) are stated over the complex plane with its unit-distance condition, the label set for , planar Lebesgue measure, and normalized angular Haar measure.