OctoInformBeta

OpenAI preprint, September 2026 · §3. Periodic layers · §3

Lemma 3.5: A distinct period-qq text whose forward rotations are bounded by it disagrees within qq symbols

Early disagreement with a maximal forward rotation.

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

Let Σ\Sigma be a linearly ordered alphabet. A period rr of an integer-indexed text X:ℤ→ΣX:\mathbb{Z}\to\Sigma is a positive integer satisfying (1); it need not be the least positive period. X(i+r)=X(i)(i∈ℤ).X(i+r)=X(i) \qquad (i\in\mathbb{Z}).(1)

The forward rotation FX(t)F_X(t) of a text X:ℤ→ΣX:\mathbb{Z}\to\Sigma at a position t∈ℤt\in\mathbb{Z} is the infinite stream given by (2).✦ Forward rotations are ordered lexicographically using the order on Σ\Sigma. FX(t)(n)=X(t+n)(n∈ℕ).F_X(t)(n)=X(t+n) \qquad (n\in\mathbb{N}).(2)

The Claim

Theorem 1 (Lemma 3.5). Let A,D:ℤ→ΣA,D:\mathbb{Z}\to\Sigma be distinct texts with positive periods pp and qq, respectively. Let t∈ℤt\in\mathbb{Z} be a position such that FA(t)F_A(t) is at least as large as every forward rotation of AA and every forward rotation of DD. Then (3) holds: ∃n∈{0,…,q−1},A(t+n)≠D(t+n).\exists n\in\{0,\ldots,q-1\},\qquad A(t+n)\ne D(t+n).(3)✦

What Is Checked

The claim is stated over integer-indexed texts on a linearly ordered alphabet, with arbitrary positive periods and lexicographically ordered forward rotations.