OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.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 kk be a positive integer, with color labels in Fin⁡k\operatorname{Fin}k. A proper kk-coloring c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k is a map satisfying (1): c(x)≠c(y)whenever x,y∈ℂ and |x−y|=1.c(x)\ne c(y)\qquad \text{whenever }x,y\in\mathbb C\text{ and }|x-y|=1.(1)✦

The angle circle Θ=ℝ/(2πℤ)\Theta=\mathbb R/(2\pi\mathbb Z) carries normalized angular Haar measure σ\sigma. The unit-direction map u:Θ→ℂu:\Theta\to\mathbb C of the angle circle Θ\Theta is the map given by (2): u(θ)=eiθ.u(\theta)=e^{i\theta}.(2)✦

Write λ\lambda for Lebesgue measure on ℂ\mathbb C. A weak kk-coloring d:ℂ→Fin⁡kd:\mathbb C\to\operatorname{Fin}k is a Lebesgue almost everywhere measurable map satisfying (3): d(x)≠d(x+u(θ))for (λ⊗σ)-almost every (x,θ)∈ℂ×Θ.d(x)\ne d\bigl(x+u(\theta)\bigr) \qquad\text{for }(\lambda\otimes\sigma)\text{-almost every }(x,\theta) \in\mathbb C\times\Theta.(3)✦

The Claim

Theorem 1. Let kk be a positive integer, and let c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k be a proper coloring. Then ∃d:ℂ→Fin⁡k,d is Borel measurable and is a weak k-coloring.\exists d:\mathbb C\to\operatorname{Fin}k,\qquad d\text{ is Borel measurable and is a weak }k\text{-coloring}.(4)✦ Also, ∃d:ℂ→Fin⁡k,d is a weak k-coloring.\exists d:\mathbb C\to\operatorname{Fin}k,\qquad d\text{ is a weak }k\text{-coloring}.(5)✦

In the paper, the result reads: for every positive integer kk, in Zermelo-Fraenkel set theory with the axiom of choice, a proper kk-coloring of ℝ2\mathbb R^2 exists if and only if a weak measurable kk-coloring exists.

What Is Checked

The statements (4) and (5) concern arbitrary maps from ℂ\mathbb C to Fin⁡k\operatorname{Fin}k, with k>0k>0, whose unit-distance exclusion holds at every pair of points.