OpenAI preprint, September 2026 · §1. Introduction
Theorem1.3:Starting from arbitrary color classes and retaining the same positive number of colors
Proper colorings admit 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 exactly when their distance is one. The transfer problem concerns the passage from arbitrary color classes to measurable ones when the exclusion of equal colors is required for almost every unit step.
Let be a positive integer, with color labels in .A proper -coloring is a map satisfying (1): (1)✦
The angle circle carries normalized angular Haar measure.The unit-direction map of the angle circle is the map given by (2): (2)✦
Write for Lebesgue measure on .A weak -coloring is a Lebesgue almost everywhere measurable map satisfying (3): (3)✦
The Claim
Theorem 1. Let be a positive integer, and let be a proper coloring. Then (4)✦Also, (5)✦
In the paper, the result reads: for every positive integer , in Zermelo-Fraenkel set theory with the axiom of choice, a proper -coloring of exists if and only if a weak measurable -coloring exists.
What Is Checked
The statements (4) and (5) concern arbitrary maps from to , with , whose unit-distance exclusion holds at every pair of points.