OctoInformBeta

OpenAI preprint, September 2026 · §7. Boundary activity and the packing contradiction

Lemma 7.1: For scalar cuts with uniformly bounded errors and planar cuts with nearby normal vectors

Boundary transfers bound activity outside three strips.

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 a finite label set TT and injective maps fi:T→Xf_i:T\to X, for i=0,…,mi=0,\ldots,m, into a set XX; write Mi=fi(T)M_i=f_i(T). An active set AA for a sequence of subsets M0,…,MmM_0,\ldots,M_m of XX is a finite subset of XX such that each of its points belongs to some MiM_i and fails to belong to some MjM_j. For a finite region B⊂XB\subset X, the boundary token count CBC_B in (1) counts labels that enter or leave BB between consecutive times, where 𝟏B\mathbf 1_B denotes the indicator of BB: CB=∑j=0m−1|{u∈T:𝟏B(fj(u))≠𝟏B(fj+1(u))}|.C_B=\sum_{j=0}^{m-1} \bigl|\{u\in T:\mathbf 1_B(f_j(u))\ne\mathbf 1_B(f_{j+1}(u))\}\bigr|.(1)

For a scalar coordinate t:X→ℝt:X\to\mathbb R, a nonnegative error bound ρ\rho, and real thresholds c0,…,cmc_0,\ldots,c_m, the three strips SqS_q in XX are the inverse images under tt of the closed intervals in (2): c−=min0≤i≤mci,c+=max0≤i≤mci,Sq={x∈X:|t(x)−q|≤3ρ},q∈{c0,c−,c+},S=Sc0∪Sc−∪Sc+.\begin{aligned} c_-&=\min_{0\le i\le m}c_i, &c_+&=\max_{0\le i\le m}c_i,\\ S_q&=\{x\in X:|t(x)-q|\le3\rho\}, &q&\in\{c_0,c_-,c_+\},\\ S&=S_{c_0}\cup S_{c_-}\cup S_{c_+}. \end{aligned}(2)

A planar point is an ordered pair of real numbers, so the plane is ℝ2=ℝ×ℝ\mathbb R^2=\mathbb R\times\mathbb R.✦ The scalar product of u,v∈ℝ2u,v\in\mathbb R^2 and the squared Euclidean norm of uu are given by (3): u⋅v=u1v1+u2v2,∥u∥22=u12+u22.u\cdot v=u_1v_1+u_2v_2, \qquad \|u\|_2^2=u_1^2+u_2^2.(3)

The Claim

Theorem 1. For finite subsets A,B⊂XA,B\subset X and arbitrary subsets U,V,W⊂XU,V,W\subset X, |A∩B|≤|(A∩B)\(U∪V∪W)|+|B∩U|+|B∩V|+|B∩W|.|A\cap B|\le |(A\cap B)\setminus(U\cup V\cup W)| +|B\cap U|+|B\cap V|+|B\cap W|.(4)✦

Let Mi=fi(T)M_i=f_i(T) be injectively labelled as above, let AA be active, and let B⊂XB\subset X be finite. Suppose ρ≥0\rho\ge0 and functions ei:X→ℝe_i:X\to\mathbb R satisfy |ei(x)|≤ρ|e_i(x)|\le\rho and e0(x)=0e_0(x)=0 for all x∈Bx\in B and 0≤i≤m0\le i\le m. Suppose also that, for every such ii and xx, membership in MiM_i is given by x∈Mi⇔t(x)+ei(x)<cix\in M_i\Longleftrightarrow t(x)+e_i(x)<c_i. With CBC_B and SS as in (1) and (2), |(A∩B)\S|≤2CB.|(A\cap B)\setminus S|\le2C_B.(5)✦

For planar maps fi:T→ℝ2f_i:T\to\mathbb R^2, let AA be active and let B⊂ℝ2B\subset\mathbb R^2 be finite. Suppose D,θ≥0D,\theta\ge0, and vectors ν0,…,νm\nu_0,\ldots,\nu_m satisfy ∥νi−ν0∥22≤θ2\|\nu_i-\nu_0\|_2^2\le\theta^2 for every ii. Suppose ∥x∥22≤D2\|x\|_2^2\le D^2 for every x∈Bx\in B, and membership in MiM_i on BB is given by x∈Mi⇔νi⋅x<cix\in M_i\Longleftrightarrow\nu_i\cdot x<c_i. With t(x)=ν0⋅xt(x)=\nu_0\cdot x and ρ=Dθ\rho=D\theta in (2), |(A∩B)\(Sc0∪Sc−∪Sc+)|≤2CB.|(A\cap B)\setminus(S_{c_0}\cup S_{c_-}\cup S_{c_+})|\le2C_B.(6)✦

In the paper, the result reads: for finite P⊂ℝ2P\subset\mathbb R^2, bounded open B⊂ℝ2B\subset\mathbb R^2, and D≥1D\ge1 with ∥x∥2≤D\|x\|_2\le D on BB, let M0,…,Mm⊂PM_0,\ldots,M_m\subset P be strictly separated cuts of equal cardinality, Mi={x∈P:νi⋅x<ci}M_i=\{x\in P:\nu_i\cdot x<c_i\}, with unit vectors νi\nu_i satisfying ∥νi−ν0∥2≤θ\|\nu_i-\nu_0\|_2\le\theta, choose a bijection from the lost points to the gained points at each step, let CBC_B count the resulting transfers with exactly one endpoint in BB, and set A=⋃i=1m(Mi−1△Mi)A=\bigcup_{i=1}^m(M_{i-1}\mathbin{\triangle}M_i), ρ=Dθ\rho=D\theta, c−=min⁡icic_-=\min_i c_i, c+=max⁡icic_+=\max_i c_i, and Sq={x∈ℝ2:|ν0⋅x−q|≤3ρ}S_q=\{x\in\mathbb R^2:|\nu_0\cdot x-q|\le3\rho\} for q∈{c0,c−,c+}q\in\{c_0,c_-,c_+\}; then |(A∩B)\(Sc0∪Sc−∪Sc+)|≤2CB|(A\cap B)\setminus(S_{c_0}\cup S_{c_-}\cup S_{c_+})|\le2C_B and |A∩B|≤2CB+∑q∈(c0,c−,c+)|P∩B∩Sq||A\cap B|\le2C_B+\sum_{q\in(c_0,c_-,c_+)}|P\cap B\cap S_q|, where repeated thresholds are counted repeatedly in the sum.

What Is Checked

The counting statement (4) concerns arbitrary finite sets and three subsets of their ambient set, while the activity statements concern injectively labelled finite configurations and finite regions, with bounded scalar errors in (5) and squared Euclidean bounds from (3) in (6).