OctoInformBeta

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

Lemma 4.1: Density bounds accompany a complete set of five-bit words in the modified rectangle

The anchor distinguishes rows and columns.

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 anchor in the ordered matrix construction is a fixed binary matrix SS of size 64×6464\times64. Lemma 4.1 concerns the patterns in its rows and columns and the words obtained by restricting a row to the last five columns.

Use zero-based indices, with I={0,…,63}I=\{0,\ldots,63\} for each of the row and column index sets. Put A={0,…,31}A=\{0,\ldots,31\} and B={0,…,4}B=\{0,\ldots,4\}.

For nonnegative integers aa and bb, the binary digit η(a,b)∈{0,1}\eta(a,b)\in\{0,1\} is the parity of the quotient in (1), where the exponent is truncated at zero: η(a,b)=⌊a2max⁡{5−b,0}⌋mod⁡2.\eta(a,b)= \left\lfloor\frac{a}{2^{\max\{5-b,0\}}}\right\rfloor\bmod 2.(1)✦

The anchor S∈{0,1}I×IS\in\{0,1\}^{I\times I} is the binary matrix defined by (2), where 𝟏u≠v\mathbf{1}_{u\ne v} is 11 when u≠vu\ne v and 00 otherwise: S(u,v)={η(u−32,v−58),32≤u≤63,59≤v≤63,𝟏u≠v,otherwise.S(u,v)= \begin{cases} \eta(u-32,v-58),&32\le u\le63,\quad59\le v\le63,\\ \mathbf{1}_{u\ne v},&\text{otherwise}. \end{cases}(2)✦

The anchor word W(a)∈{0,1}BW(a)\in\{0,1\}^{B} associated to row a+32a+32, for a∈Aa\in A, is its restriction to the last five columns in their order, as in (3): W:A→{0,1}B,W(a)(b)=S(a+32,b+59)(a∈A,b∈B).W:A\longrightarrow\{0,1\}^{B},\qquad W(a)(b)=S(a+32,b+59)\quad(a\in A,\ b\in B).(3)✦

The Claim

Theorem 1. Let SS be the anchor in (2), and let WW be its word map in (3). Its row and column maps satisfy (4) and (5): S(u,⋅)≠S(u′,⋅)(u,u′∈I,u≠u′).S(u,\cdot)\ne S(u',\cdot) \qquad(u,u'\in I,\ u\ne u').(4)✦ S(⋅,v)≠S(⋅,v′)(v,v′∈I,v≠v′).S(\cdot,v)\ne S(\cdot,v') \qquad(v,v'\in I,\ v\ne v').(5)✦ The zero entries satisfy (6) and (7): S(u,v)=0⇔u=v(u,v∈I,u<32).S(u,v)=0\quad\Longleftrightarrow\quad u=v \qquad(u,v\in I,\ u<32).(6)✦ S(u,v)=0⇔u=v(u,v∈I,v<32).S(u,v)=0\quad\Longleftrightarrow\quad u=v \qquad(u,v\in I,\ v<32).(7)✦ The row and column weights obey (8) and (9): |{v∈I:S(u,v)=1}|≥58(u∈I).\bigl|\{v\in I:S(u,v)=1\}\bigr|\ge58\qquad(u\in I).(8)✦ |{u∈I:S(u,v)=1}|≥48(v∈I).\bigl|\{u\in I:S(u,v)=1\}\bigr|\ge48\qquad(v\in I).(9)✦ The word map satisfies (10): W:A→∼{0,1}B.W:A\xrightarrow{\;\sim\;}\{0,1\}^{B}.(10)✦

In the paper, the result reads: the rows of SS are pairwise distinct, as are its columns; every column has at most one zero in the first 3232 rows, and every row has at most one zero in the first 3232 columns; each row has at least 5858 ones and each column has at least 4848 ones; the restrictions of rows 32,…,6332,\ldots,63 to columns 59,…,6359,\ldots,63 are the 3232 distinct binary words of length five.

What Is Checked

The statements concern the explicit binary matrix SS of (2) and its word map WW of (3), defined using the binary digit function η\eta of (1).