OctoInformBeta

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

Definition 6.1: Local area ratios determine adjacency between five color labels at each point

Small translations define the cyclic core.

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

Let c:ℂ→Fin⁡kc\colon\mathbb C\to\operatorname{Fin}k be a coloring with kk labels, and let λ2\lambda_2 denote planar Lebesgue measure. For x∈ℂx\in\mathbb C and r>0r>0, write B(x,r)B(x,r) for the open ball with center xx and radius rr. Local transitions compare the labels at qq and q+hq+h for small translations h∈ℂh\in\mathbb C.

The Definition

Definition 1. For labels i,j∈Fin⁡ki,j\in\operatorname{Fin}k, the transition set Tij(x,r;h)⊆ℂT_{ij}(x,r;h)\subseteq\mathbb C is the set of points q∈B(x,r)q\in B(x,r) whose labels at qq and q+hq+h are i,ji,j in either order, as in (1). Tij(x,r;h)={q∈B(x,r):(c(q),c(q+h))∈{(i,j),(j,i)}}.T_{ij}(x,r;h)= \bigl\{q\in B(x,r): (c(q),c(q+h))\in\{(i,j),(j,i)\}\bigr\}.(1)✦

The transition ratio ρij(x,r;h)∈[0,∞]\rho_{ij}(x,r;h)\in[0,\infty] is the area of Tij(x,r;h)T_{ij}(x,r;h) divided by the translation length, with the quotient taken in the extended nonnegative reals as in (2). ρij(x,r;h)=λ2(Tij(x,r;h))|h|.\rho_{ij}(x,r;h)=\frac{\lambda_2(T_{ij}(x,r;h))}{|h|}.(2)✦

A transition edge at xx is a pair of distinct labels i,ji,j whose transition ratio has positive upper limit as hh tends to zero through nonzero complex translations, for every radius r>0r>0; write ℰij(x)\mathcal E_{ij}(x) for this condition, as in (3). ℰij(x)⇔i≠j and limsuph→0h≠0ρij(x,r;h)>0for every r>0.\mathcal E_{ij}(x)\quad\Longleftrightarrow\quad i\ne j\ \text{ and } \limsup_{\substack{h\to0\\h\ne0}}\rho_{ij}(x,r;h)>0 \quad\text{for every }r>0.(3)✦

For k=5k=5, the transition graph Γx\Gamma_x is the simple graph on the five labels whose adjacency is given by (4). V(Γx)=Fin⁡5,i∼Γxj⇔ℰij(x).V(\Gamma_x)=\operatorname{Fin}5, \qquad i\sim_{\Gamma_x}j\quad\Longleftrightarrow\quad\mathcal E_{ij}(x).(4)✦

The cyclic core 𝒞(c)⊆ℂ\mathcal C(c)\subseteq\mathbb C is the set of points whose transition graph contains a cycle, as in (5). 𝒞(c)={x∈ℂ:Γx contains a cycle}.\mathcal C(c)=\{x\in\mathbb C:\Gamma_x\text{ contains a cycle}\}.(5)✦

In the paper, the result reads: for distinct labels i,ji,j, Dij(B,h)D_{ij}(B,h) is the area of points q∈Bq\in B with ordered labels (i,j)(i,j) or (j,i)(j,i) at q,q+hq,q+h, and ijij is an edge of Γx\Gamma_x precisely when every ball BB centered at xx of positive finite radius satisfies limsup⁡h→0,h≠0Dij(B,h)/|h|>0\limsup_{h\to0,\,h\ne0}D_{ij}(B,h)/|h|>0, with no requirement that q+hq+h belong to BB.

What Is Checked

The transition sets, ratios and edges in (1), (2) and (3) are defined for arbitrary colorings c:ℂ→Fin⁡kc\colon\mathbb C\to\operatorname{Fin}k, while the transition graph and cyclic core in (4) and (5) use five labels.