OctoInformBeta

OpenAI preprint, September 2026 · §6. Opening cycles of planned links · §6

Lemma 6.1: The walk returns to a boundary window after touching every layer

A band bound controls the connecting cost.

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

Opening periodic layers calls for a closed walk that touches each layer while spending few symbol appends.

A substring-closed vertex set VV over an alphabet Σ\Sigma is a set of finite words that contains every contiguous substring of each of its words, including the empty word ε\varepsilon.✦ For an integer-indexed text A:ℤ→ΣA\colon\mathbb Z\to\Sigma and integer endpoints a,ba,b, the finite text window A[a,b)A[a,b) is the word defined by (1). A[a,b)={A(a)A(a+1)⋯A(b−1),a<b,ε,b≤a.A[a,b)= \begin{cases} A(a)A(a+1)\cdots A(b-1),& a<b,\\ \varepsilon,& b\le a. \end{cases}(1)✦

A hierarchical walk PP in VV is a finite walk whose steps append a symbol at the right or delete a symbol at the left, with every vertex in VV; a walk may have no steps.✦ The cost c(P)c(P) of a hierarchical walk PP is the number of append steps in PP.✦ A walk visits a word when that word is one of its vertices, including its endpoints.✦

Periodic Layers

A periodic layer DD for VV, AA and a nonnegative integer parameter pp is a nondecreasing exit function zD:ℤ→ℤz_D\colon\mathbb Z\to\mathbb Z satisfying (2) for all integer positions xx and endpoints ee. x≤zD(x−1),zD(x+p)=zD(x)+p,zD(x−1)≤e≤zD(x)⇒A[x,e)∈V.\begin{gathered} x\le z_D(x-1),\qquad z_D(x+p)=z_D(x)+p,\\ z_D(x-1)\le e\le z_D(x)\quad\Longrightarrow\quad A[x,e)\in V. \end{gathered}(2)✦ The first and last exit positions first⁡D(x)\operatorname{first}_D(x) and last⁡D(x)\operatorname{last}_D(x) of a periodic layer DD at an integer position xx are the integer endpoints specified by (3). first⁡D(x)=zD(x−1),last⁡D(x)=zD(x).\operatorname{first}_D(x)=z_D(x-1),\qquad \operatorname{last}_D(x)=z_D(x).(3)

A hierarchical walk PP touches a layer DD if it visits a window A[x,e)A[x,e) for some integers x,ex,e with first⁡D(x)≤e≤last⁡D(x)\operatorname{first}_D(x)\le e\le\operatorname{last}_D(x).✦

The Claim

Theorem 1 (One free period). Let VV be substring-closed, let A:ℤ→ΣA\colon\mathbb Z\to\Sigma be a text whose one-letter words [A(x)][A(x)] all belong to VV, and let p,k∈ℕp,k\in\mathbb N satisfy A(x+p)=A(x)A(x+p)=A(x) for every integer xx. Let (Di)i∈I(D_i)_{i\in I} be periodic layers for V,A,pV,A,p, with indices ℓ,h∈I\ell,h\in I such that zDℓ(x)≤zDi(x)≤zDh(x)z_{D_\ell}(x)\le z_{D_i}(x)\le z_{D_h}(x) for every i∈Ii\in I and every integer xx. Suppose an integer tt satisfies first⁡Dh(t)−last⁡Dℓ(t)≤max⁡{k−1,0}p\operatorname{first}_{D_h}(t)-\operatorname{last}_{D_\ell}(t) \le \max\{k-1,0\}p. There is a closed hierarchical walk PP in VV, based at A[t,last⁡Dℓ(t))A[t,\operatorname{last}_{D_\ell}(t)), satisfying (4). c(P)≤max⁡{k−1,0}p,P touches Di for every i∈I.c(P)\le\max\{k-1,0\}p, \qquad P\text{ touches }D_i\text{ for every }i\in I.(4)✦

What Is Checked

The claim is stated over hierarchical walks in a substring-closed vertex set containing the text’s one-letter words, with a periodic text and a family of layers satisfying the extremal ordering and band hypothesis.