OctoInformBeta

OpenAI preprint, September 2026 · §8. Angular obstructions and the final contradiction

Proposition 8.2: A weak measurable five-coloring admits no such exclusions for sets approaching a common point along unit directions

Five cyclic exclusions are incompatible.

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

Consider five subsets of the complex plane that approach a common point along prescribed unit directions. Their unit-distance straddling regions are subject to cyclic restrictions: for each set, the two adjacent color labels prescribe the essential supports that its straddling region must avoid.

The angle circle and its unit directions are 𝕋=ℝ/(2πℤ),e(θ)=exp⁡(iθ).\mathbb T=\mathbb R/(2\pi\mathbb Z), \qquad e(\theta)=\exp(\mathrm i\theta).(1) Let μ\mu be normalized angular Haar probability measure on the circle (1), and let λ\lambda be planar Lebesgue measure on ℂ\mathbb C.✦ A weak measurable coloring with kk labels is a function c:ℂ→Finkc:\mathbb C\to\mathrm{Fin}\,k that is almost everywhere measurable for λ\lambda and satisfies c(z)≠c(z+e(θ))for almost every (z,θ) under λ⊗μ.c(z)\ne c\bigl(z+e(\theta)\bigr) \quad\text{for almost every }(z,\theta)\text{ under }\lambda\otimes\mu.(2)✦

The essential color support HiH_i of a label i∈Finki\in\mathrm{Fin}\,k is the support of planar Lebesgue measure restricted to its color class: Hi=supp⁡(λ|{z∈ℂ:c(z)=i}).H_i=\operatorname{supp}\!\left(\lambda\big|_{\{z\in\mathbb C:c(z)=i\}}\right).(3)✦ The unit-distance straddling region of a set K⊆ℂK\subseteq\mathbb C is the set Str⁡(K)={z∈ℂ:∃p,q∈K,|z−p|<1<|z−q|}.\operatorname{Str}(K) =\left\{z\in\mathbb C: \exists p,q\in K,\ |z-p|<1<|z-q|\right\}.(4)✦

Directional approach data for K⊆ℂK\subseteq\mathbb C at x∈ℂx\in\mathbb C toward v∈ℂv\in\mathbb C consists of membership x∈Kx\in K and sequences of radii rn∈ℝr_n\in\mathbb R and directions wn∈ℂw_n\in\mathbb C satisfying rn>0,|wn|=1,x+rnwn∈K(n∈ℕ),rn→0,wn→v(n→∞).\begin{gathered} r_n>0,\qquad |w_n|=1,\qquad x+r_nw_n\in K \quad(n\in\mathbb N),\\ r_n\longrightarrow0,\qquad w_n\longrightarrow v \quad(n\longrightarrow\infty). \end{gathered}(5)✦

The Claim

Theorem 1. Let c:ℂ→Fin5c:\mathbb C\to\mathrm{Fin}\,5 be a weak measurable coloring satisfying (2). Let x∈ℂx\in\mathbb C, and for each i∈Fin5i\in\mathrm{Fin}\,5 let Ki⊆ℂK_i\subseteq\mathbb C have directional approach data (5) at xx toward a unit vector viv_i. Use the essential supports (3) and straddling regions (4), and interpret i+1i+1 modulo five. For some i∈Fin5i\in\mathrm{Fin}\,5, the following relation (6) holds: Str⁡(Ki)∩(Hi∪Hi+1)≠⌀.\operatorname{Str}(K_i)\cap(H_i\cup H_{i+1})\ne\varnothing.(6)✦

In the paper, the result reads: the extracted interface cycle cannot have length five.

What Is Checked

The claim is stated for weak measurable colorings of the complex plane with five labels, their essential color supports, and five sets with directional approach data at a common point toward unit vectors.