OctoInformBeta

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

Lemma 3.4: Positive periods bound aligned agreement, with a sharper bound for a common period

Distinct periodic texts have bounded agreement.

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

An aligned comparison of periodic texts compares symbols at the same integer positions. The quantity of interest is the length of a consecutive interval of agreement.

An integer-indexed text AA over an alphabet Σ\Sigma is a function A:ℤ→ΣA:\mathbb{Z}\to\Sigma. A positive integer pp is a period of AA if A(x+p)=A(x)A(x+p)=A(x) for every integer xx.

Interval agreement of texts A,D:ℤ→ΣA,D:\mathbb{Z}\to\Sigma on a half-open interval [a,b)[a,b), with integer endpoints a,ba,b, is equality of their symbols throughout that interval: A(x)=D(x)for every x∈ℤ with a≤x<b.A(x)=D(x)\qquad \text{for every }x\in\mathbb{Z}\text{ with }a\le x<b.(1)✦

The Claim

Theorem 1. Let A,D:ℤ→ΣA,D:\mathbb{Z}\to\Sigma be distinct texts with positive periods pp and qq, respectively. Let a,ba,b be integers such that AA and DD have interval agreement as in (1). Then b−a<p+q.b-a<p+q.(2)✦

Theorem 2. Let A,D:ℤ→ΣA,D:\mathbb{Z}\to\Sigma be distinct texts with a common positive period pp. Let a,ba,b be integers such that AA and DD agree on [a,b)[a,b). Then b−a<p.b-a<p.(3)✦

What Is Checked

The bounds (2) and (3) are stated over distinct integer-indexed texts on an arbitrary alphabet, with positive periods and integer interval endpoints.