OctoInformBeta

OpenAI preprint, September 2026 · §4. Copies are confined to the leaf diagonal

Corollary 4.5: Raw matches and ordered copies satisfy the same row and column constraints

Common anchor representatives determine body roles.

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

Corollary 4.5 concerns the locations of the two body rows and columns of an induced matrix copy whose anchor representatives have a common mode. Write [q]={0,…,q−1}[q]=\{0,\ldots,q-1\}. A binary matrix of order nn is an array A:[n]×[n]→{0,1}A\colon[n]\times[n]\to\{0,1\}.✦

The anchor matrix SS has order s=64s=64 and is defined by (1); the binary digit η(a,b)\eta(a,b) uses nonnegative integer arguments. η(a,b)=𝟏⌊a/2max⁡{5−b,0}⌋≡1(mod⁡2),Suv={η(u−32,v−58),32≤u≤63,59≤v≤63,𝟏u≠v,otherwise.\begin{aligned} \eta(a,b)&=\mathbf1_{\lfloor a/2^{\max\{5-b,0\}}\rfloor\equiv1\pmod2},\\ S_{uv}&= \begin{cases} \eta(u-32,v-58),&32\le u\le63,\quad59\le v\le63,\\ \mathbf1_{u\ne v},&\text{otherwise}. \end{cases} \end{aligned}(1) The fixed forbidden matrix HH has order k=66k=66 and the block form (2), where EE has rows indexed by [64][64] and columns by [2][2]. An anchor index u∈[64]u\in[64] occupies position uu in HH, and a body index b∈[2]b\in[2] occupies position 64+b64+b. H=(SEE𝖳P),Eub=𝟏u=b,P=(1011).H=\begin{pmatrix}S&E\\E^{\mathsf T}&P\end{pmatrix}, \qquad E_{ub}=\mathbf1_{u=b}, \qquad P=\begin{pmatrix}1&0\\1&1\end{pmatrix}.(2)✦

An increasing index map f:[k]→[n]f\colon[k]\to[n] is a strictly increasing map between these ordered sets.✦ An ordered copy of HH in AA is a pair of independently chosen increasing row and column maps α,β:[k]→[n]\alpha,\beta\colon[k]\to[n] satisfying (3), including at the zero entries of HH.✦ Aα(i),β(j)=Hij(i,j∈[k]).A_{\alpha(i),\beta(j)}=H_{ij}\qquad(i,j\in[k]).(3)

Positions and Roles

For a nonnegative height hh, put m=2hm=2^h. A constraint mode tt at height hh is an index in [6h][6h], with mode type q(t)q(t) and mode level L(t)L(t) as in (4). q(t)=tmod⁡6,L(t)=⌊t/6⌋+1.q(t)=t\bmod6,\qquad L(t)=\lfloor t/6\rfloor+1.(4) An anchor position a(t,u,z)a(t,u,z) is a triple in 𝒜h=[6h]×[64]×[m]\mathcal A_h=[6h]\times[64]\times[m].✦ A variable position v=(a,z)v=(a,z) is a pair in Vh=[2h+1]×[m]V_h=[2h+1]\times[m].✦ The dummy positions form a disjoint set DhD_h indexed by [m][m], and the host position set is Xh=𝒜h⊔Vh⊔DhX_h=\mathcal A_h\sqcup V_h\sqcup D_h.✦

For a variable position v=(a,z)v=(a,z), its tree depth d(v)d(v), positive sign σ(v)\sigma(v) and tree node index ν(v)\nu(v) are defined by (5). d(v)=⌊a/2⌋,σ(v)=𝟏a≡0(mod⁡2),ν(v)=⌊z2h−d(v)⌋.d(v)=\lfloor a/2\rfloor,\qquad \sigma(v)=\mathbf1_{a\equiv0\pmod2},\qquad \nu(v)=\left\lfloor\frac{z}{2^{h-d(v)}}\right\rfloor.(5) For a tree level ii and a sign ε\varepsilon, the signed level class ViεV_i^\varepsilon of VhV_h is the subset specified by (6); the two signs share the leaf class and have distinct internal classes. The parity class Vi,eεV_{i,e}^\varepsilon of ViεV_i^\varepsilon is the subset of positions vv satisfying ν(v)≡e(mod⁡2)\nu(v)\equiv e\pmod2. Viε={v∈Vh:d(v)=i,i=horσ(v)=ε},ε∈{0,1}.V_i^\varepsilon= \{v\in V_h:d(v)=i,\quad i=h\ \text{or}\ \sigma(v)=\varepsilon\}, \qquad \varepsilon\in\{0,1\}.(6)✦

The row role sets R1(t),R2(t)R_1(t),R_2(t) and column role sets C1(t),C2(t)C_1(t),C_2(t) are subsets of Vh⊔DhV_h\sqcup D_h specified by (7), with q=q(t)q=q(t), L=L(t)L=L(t) and e=qmod⁡2e=q\bmod2. qR1(t)R2(t)C1(t)C2(t)0VL1VL−11DhVL−111VL−10VL0DhVL−102,3VL,e1DhVL−11VL,e14,5VL,e0DhVL,e0VL−10\begin{array}{c|cccc} q&R_1(t)&R_2(t)&C_1(t)&C_2(t)\\ \hline 0&V_L^1&V_{L-1}^1&D_h&V_{L-1}^1\\ 1&V_{L-1}^0&V_L^0&D_h&V_{L-1}^0\\ 2,3&V_{L,e}^1&D_h&V_{L-1}^1&V_{L,e}^1\\ 4,5&V_{L,e}^0&D_h&V_{L,e}^0&V_{L-1}^0 \end{array}(7)

For variable positions v,w∈Vhv,w\in V_h, the variable matrix entry W(v,w)W(v,w) is the binary value specified by (8), where i=d(v)i=d(v), j=d(w)j=d(w), a=ν(v)a=\nu(v) and b=ν(w)b=\nu(w). W(v,w)={𝟏a≤b,i=j,i=horσ(v)=σ(w)=1,𝟏a<b,i=j<h,σ(v)=σ(w)=0,𝟏⌊a/2⌋≤b,i=j+1,j<h,σ(w)=1,i=horσ(v)=1,𝟏⌊a/2⌋<b,i=j+1,j<h,σ(w)=0,i=horσ(v)=0,0,otherwise.W(v,w)= \begin{cases} \mathbf1_{a\le b},&i=j,\quad i=h\ \text{or}\ \sigma(v)=\sigma(w)=1,\\ \mathbf1_{a<b},&i=j<h,\quad\sigma(v)=\sigma(w)=0,\\ \mathbf1_{\lfloor a/2\rfloor\le b},&i=j+1,\ j<h,\ \sigma(w)=1, \quad i=h\ \text{or}\ \sigma(v)=1,\\ \mathbf1_{\lfloor a/2\rfloor<b},&i=j+1,\ j<h,\ \sigma(w)=0, \quad i=h\ \text{or}\ \sigma(v)=0,\\ 0,&\text{otherwise}. \end{cases}(8)✦ The raw host matrix B:Xh×Xh→{0,1}B\colon X_h\times X_h\to\{0,1\} is the array in (9), where x,yx,y range over the nonanchor set Nh=Vh⊔DhN_h=V_h\sqcup D_h. B(a(t,u,z),a(t′,v,w))=𝟏t=t′Suv,B(a(t,u,z),x)=𝟏(u=0∧x∈C1(t))∨(u=1∧x∈C2(t)),B(x,a(t,v,w))=𝟏(v=0∧x∈R1(t))∨(v=1∧x∈R2(t)),B(v,w)=W(v,w)(v,w∈Vh),B(x,y)=1(x∈Dhory∈Dh).\begin{aligned} B(a(t,u,z),a(t',v,w))&=\mathbf1_{t=t'}S_{uv},\\ B(a(t,u,z),x)&= \mathbf1_{(u=0\,\wedge\,x\in C_1(t))\,\vee\,(u=1\,\wedge\,x\in C_2(t))},\\ B(x,a(t,v,w))&= \mathbf1_{(v=0\,\wedge\,x\in R_1(t))\,\vee\,(v=1\,\wedge\,x\in R_2(t))},\\ B(v,w)&=W(v,w)\qquad(v,w\in V_h),\\ B(x,y)&=1\qquad(x\in D_h\ \text{or}\ y\in D_h). \end{aligned}(9)✦

The Claim

Theorem 1. Fix a mode tt and offset maps zr,zc:[64]→[m]z_r,z_c\colon[64]\to[m]. Suppose r,c:[66]→Xhr,c\colon[66]\to X_h satisfy B(r(i),c(j))=HijB(r(i),c(j))=H_{ij} for all i,j∈[66]i,j\in[66], and their anchor positions satisfy r(u)=a(t,u,zr(u))r(u)=a(t,u,z_r(u)) and c(u)=a(t,u,zc(u))c(u)=a(t,u,z_c(u)) for every u∈[64]u\in[64]. Then, for every b∈[2]b\in[2], r(64+b)∈Rb+1(t),c(64+b)∈Cb+1(t).r(64+b)\in R_{b+1}(t),\qquad c(64+b)\in C_{b+1}(t).(10)✦

Let AA be a binary matrix of order nn, with separate row and column maps ρ,γ:[n]→Xh\rho,\gamma\colon[n]\to X_h satisfying Aij=B(ρ(i),γ(j))A_{ij}=B(\rho(i),\gamma(j)). Suppose α,β\alpha,\beta give an ordered copy of HH in AA, with ρ(α(u))=a(t,u,zr(u))\rho(\alpha(u))=a(t,u,z_r(u)) and γ(β(u))=a(t,u,zc(u))\gamma(\beta(u))=a(t,u,z_c(u)) for every u∈[64]u\in[64]. Then, for every b∈[2]b\in[2], ρ(α(64+b))∈Rb+1(t),γ(β(64+b))∈Cb+1(t).\rho(\alpha(64+b))\in R_{b+1}(t),\qquad \gamma(\beta(64+b))\in C_{b+1}(t).(11)✦

The paper denotes its ordered host matrix by AhA_h. In the paper, the result reads: in every ordered copy of HH in the ordered host AhA_h, the first 6464 rows and columns are anchor representatives of one mode tt, the two body rows belong respectively to R1(t),R2(t)R_1(t),R_2(t), and the two body columns belong respectively to C1(t),C2(t)C_1(t),C_2(t).

What Is Checked

The assertions (10) and (11) are stated over the raw host and matrices read along separate row and column maps, with exact common-mode anchor representatives and, for the ordered assertion, increasing selections in the two index orders.