OctoInformBeta

OpenAI preprint, September 2026 · §6. Transitions and local finiteness of cyclic centers

Theorem 6.5: Compact sets contain only finitely many cyclic centers for a weak measurable five-coloring

Cyclic centers form a closed set.

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

For a coloring of the complex plane, a local transition graph records pairs of colors that exchange area under small translations near a center. The centers considered here are those at which this graph contains a cycle.✦

Let c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k be a coloring with kk labels, and let λ\lambda denote planar Lebesgue measure. The angle circle AA is the additive quotient group in (1), and e(θ)e(\theta) is the unit direction at angle θ\theta: A=ℝ/(2πℤ),e(θ)=eiθ.A=\mathbb R/(2\pi\mathbb Z),\qquad e(\theta)=e^{i\theta}.(1) The normalized angular measure μ\mu is Haar probability measure on AA.✦

A weak measurable coloring c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k is a function that is almost everywhere measurable for planar Lebesgue measure λ\lambda and satisfies the unit-distance exclusion in (2): c(x)≠c(x+e(θ))for almost every (x,θ)∈ℂ×A with respect to λ×μ.c(x)\ne c\bigl(x+e(\theta)\bigr) \quad\text{for almost every }(x,\theta)\in\mathbb C\times A \text{ with respect to }\lambda\times\mu.(2)✦

Local Transitions

For labels i,j∈Fin⁡ki,j\in\operatorname{Fin}k, a center x∈ℂx\in\mathbb C, a radius r>0r>0, and a displacement h∈ℂh\in\mathbb C, the local color transition set Tij(x,r;h)T_{ij}(x,r;h) is the subset of the open ball B(x,r)B(x,r) defined in (3): Tij(x,r;h)={q∈B(x,r):(c(q)=i∧c(q+h)=j)∨(c(q)=j∧c(q+h)=i)}.T_{ij}(x,r;h)= \bigl\{q\in B(x,r): (c(q)=i\ \land\ c(q+h)=j)\ \lor\ (c(q)=j\ \land\ c(q+h)=i)\bigr\}.(3)✦ The transition area ratio τij(x,r;h)\tau_{ij}(x,r;h) of the local color transition set Tij(x,r;h)T_{ij}(x,r;h) is the quotient in the extended nonnegative reals given by (4): τij(x,r;h)=λ(Tij(x,r;h))|h|∈[0,∞].\tau_{ij}(x,r;h)=\frac{\lambda\bigl(T_{ij}(x,r;h)\bigr)}{|h|} \in[0,\infty].(4)

A color transition edge at xx is a pair of distinct labels i,ji,j satisfying (5) at every positive radius: i≠j,limsuph→0h≠0τij(x,r;h)>0for every r>0.i\ne j,\qquad \limsup_{\substack{h\to0\\h\ne0}}\tau_{ij}(x,r;h)>0 \quad\text{for every }r>0.(5)✦

For k=5k=5, the color transition graph Γx\Gamma_x is the simple undirected graph on Fin⁡5\operatorname{Fin}5 whose adjacency relation is (6): i∼Γxj⇔i,j form a color transition edge at x.i\sim_{\Gamma_x}j \quad\Longleftrightarrow\quad i,j\text{ form a color transition edge at }x.(6)✦ The cyclic core LcL_c of a five-label coloring cc is the set of centers defined in (7): Lc={x∈ℂ:Γx contains a cycle}.L_c=\{x\in\mathbb C:\Gamma_x\text{ contains a cycle}\}.(7)✦

The Claim

Theorem 1. Let c:ℂ→Fin⁡5c:\mathbb C\to\operatorname{Fin}5 be a coloring. Then Lc is closed in ℂ.L_c\text{ is closed in }\mathbb C.(8)✦ If cc is a weak measurable coloring and K⊆ℂK\subseteq\mathbb C is compact, then K∩Lc is finite.K\cap L_c\text{ is finite}.(9)✦

In the paper, the result reads: the set L={x:Γx contains a cycle}L=\{x:\Gamma_x\text{ contains a cycle}\} is closed and has finite intersection with every compact subset of the plane.

What Is Checked

The closedness assertion (8) is stated over the cyclic core of an arbitrary five-label coloring of ℂ\mathbb C; the finiteness assertion (9) assumes the weak measurable coloring condition (2) and a compact subset of ℂ\mathbb C.