OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.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 χ(ℝ2)\chi(\mathbb R^2) is the least number of labels needed to color the Euclidean plane so that points at distance one receive different labels. For k∈ℕk\in\mathbb N, the set of color labels is Fin⁡k={i∈ℕ:i<k}\operatorname{Fin}k=\{i\in\mathbb N:i<k\}. The lower-bound statement uses the complex plane ℂ\mathbb C. The seven-color statements use the Euclidean space E=ℝFin⁡2E=\mathbb R^{\operatorname{Fin}2} with Euclidean distance dd.

A proper unit-distance coloring c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k of ℂ\mathbb C with kk labels is a map satisfying (1): for all x,y∈ℂ,∥x−y∥=1⇒c(x)≠c(y).\text{for all }x,y\in\mathbb C,\qquad \|x-y\|=1\ \Longrightarrow\ c(x)\ne c(y).(1) The Euclidean plane EE is kk-colorable if it admits a map c:E→Fin⁡kc:E\to\operatorname{Fin}k assigning different labels to every pair of points at Euclidean distance one.✦

The Claim

Theorem 1. Let c:ℂ→Fin⁡5c:\mathbb C\to\operatorname{Fin}5 be a map. There are points x,y∈ℂx,y\in\mathbb C satisfying (2): ∥x−y∥=1,c(x)=c(y).\|x-y\|=1,\qquad c(x)=c(y).(2)✦ There is a map c:E→Fin⁡7c:E\to\operatorname{Fin}7 satisfying (3): for all x,y∈E,d(x,y)=1⇒c(x)≠c(y).\text{for all }x,y\in E,\qquad d(x,y)=1\ \Longrightarrow\ c(x)\ne c(y).(3)✦ There is a measurable map m:E→Fin⁡7m:E\to\operatorname{Fin}7 satisfying (4): for all x,y∈E,d(x,y)=1⇒m(x)≠m(y).\text{for all }x,y\in E,\qquad d(x,y)=1\ \Longrightarrow\ m(x)\ne m(y).(4)✦

In the paper, the result reads: the Euclidean plane has no proper five-coloring, even with arbitrary color classes, and consequently 6≤χ(ℝ2)≤76\leq\chi(\mathbb R^2)\leq7.

What Is Checked

The five-label statement ranges over all maps ℂ→Fin⁡5\mathbb C\to\operatorname{Fin}5, while the upper-bound statements concern colorings of the Euclidean space EE, with measurability required in the final existence statement.