OctoInformBeta

OpenAI preprint, September 2026 · §7. Extraction of common exclusion continua

§7 setting: Unit-distance straddling for arbitrary subsets of the complex plane

Spatial supports and directional approach data.

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 setting for common interfaces combines area in color classes with the geometry of subsets of the complex plane. For a natural number kk, let c:ℂ→Fin⁡kc:\mathbb C\to\operatorname{Fin}k be a coloring, let λ\lambda be planar Lebesgue measure, and put Ai={z∈ℂ:c(z)=i}A_i=\{z\in\mathbb C:c(z)=i\} for each color i∈Fin⁡ki\in\operatorname{Fin}k. Write B(z,ε)B(z,\varepsilon) for the open disk of radius ε\varepsilon centered at zz.

The Definition

Definition 1. The spatial essential support Hi⊆ℂH_i\subseteq\mathbb C of the color class AiA_i is the support of its restricted area measure, given by (1): Hi=supp⁡(λ|Ai)={z∈ℂ:λ(B(z,ε)∩Ai)>0 for every ε>0}.H_i=\operatorname{supp}(\lambda|_{A_i}) =\bigl\{z\in\mathbb C: \lambda\bigl(B(z,\varepsilon)\cap A_i\bigr)>0 \text{ for every }\varepsilon>0\bigr\}.(1)✦ For a set K⊆ℂK\subseteq\mathbb C, the unit-distance straddling region Δ(K)\Delta(K) is the set defined in (2): Δ(K)={z∈ℂ:there exist p,q∈K with |z−p|<1<|z−q|}.\Delta(K)=\bigl\{z\in\mathbb C: \text{there exist }p,q\in K\text{ with }|z-p|<1<|z-q|\bigr\}.(2)✦ Directional approach data for a set K⊆ℂK\subseteq\mathbb C at a point x∈ℂx\in\mathbb C toward v∈ℂv\in\mathbb C consist of a real sequence (rn)(r_n) and a complex sequence (wn)(w_n) satisfying (3): x∈K,rn>0,|wn|=1,x+rnwn∈K(n∈ℕ),rn→0,wn→v(n→∞).\begin{gathered} x\in K,\qquad 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}(3)✦

In the paper, the result reads: HiH_i is the closed spatial essential support of AiA_i; for nonempty compact KK, Δ(K)={z∈ℂ:min⁡q∈K|z−q|<1<max⁡q∈K|z−q|}\Delta(K)=\{z\in\mathbb C:\min_{q\in K}|z-q|<1<\max_{q\in K}|z-q|\}; and the directional data consist of x∈Kx\in K and points x+rnwn∈Kx+r_nw_n\in K with rn>0r_n>0, rn→0r_n\to0, |wn|=1|w_n|=1 and wn→vw_n\to v.

What Is Checked

The definitions (1), (2) and (3) are stated over arbitrary finite colorings of ℂ\mathbb C and arbitrary subsets K⊆ℂK\subseteq\mathbb C, with x,v∈ℂx,v\in\mathbb C for the directional data; compactness and connectedness are separate hypotheses on KK.