OctoInformBeta

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

Lemma 6.2: A maximal forward rotation controls short contact with a distinct periodic text

A closed walk meets every layer.

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 comparison here uses two periodic texts that agree on a chosen window and orders their forward streams lexicographically.

Let α\alpha be a linearly ordered alphabet. An integer-indexed text AA is a function from ℤ\mathbb Z to α\alpha. The finite window A[a,b)A[a,b) of an integer-indexed text AA, for integers a,ba,b, is the word of symbols at the integer positions in [a,b)[a,b), in increasing order; it is empty when b≤ab\le a.✦ The forward rotation stream FA(t)F_A(t) of an integer-indexed text AA at an integer position tt is the infinite word defined by (1), with streams ordered lexicographically: FA(t)(n)=A(t+n)(n∈ℕ).F_A(t)(n)=A(t+n)\qquad(n\in\mathbb N).(1)✦ Two texts AA and DD agree on [a,b)[a,b) when A(x)=D(x)A(x)=D(x) for every integer xx with a≤x<ba\le x<b.✦

A substring-closed vertex set VV is a set of finite words containing every contiguous substring of each of its words, including the empty word.✦ A hierarchical graph walk PP in VV is a finite concatenation of steps that append one symbol at the end or delete the first symbol, with every source and target in VV; a stationary walk at any vertex of VV is also allowed.✦ A hierarchical graph walk PP in VV visits a word ww in VV when ww is an actual vertex of PP, including either endpoint.✦ The cost of a hierarchical graph walk PP in VV is its number of append steps, and concatenation adds costs.✦

Periodic Layers and Contact

A periodic layer LL for VV, a text AA and a period parameter p∈ℕp\in\mathbb N is an exit function zL:ℤ→ℤz_L:\mathbb Z\to\mathbb Z satisfying (2) for all integer x,y,ex,y,e: x≤y⇒zL(x)≤zL(y),x≤zL(x−1),zL(x+p)=zL(x)+p,zL(x−1)≤e≤zL(x)⇒A[x,e)∈V.\begin{aligned} x\le y&\ \Longrightarrow\ z_L(x)\le z_L(y),\\ x&\le z_L(x-1),\qquad z_L(x+p)=z_L(x)+p,\\ z_L(x-1)\le e\le z_L(x)&\ \Longrightarrow\ A[x,e)\in V. \end{aligned}(2)✦ The first and last exit positions of LL at start xx are the endpoints fL(x)f_L(x) and ℓL(x)\ell_L(x) defined in (3): fL(x)=zL(x−1),ℓL(x)=zL(x).f_L(x)=z_L(x-1),\qquad \ell_L(x)=z_L(x).(3)

A hierarchical graph walk PP in VV touches a periodic layer LL for V,A,pV,A,p when there are integers x,ex,e with fL(x)≤e≤ℓL(x)f_L(x)\le e\le\ell_L(x) such that PP visits A[x,e)A[x,e).✦ A periodic layer LL for V,A,pV,A,p has a short vertex at threshold qq when some integers x,ex,e satisfy fL(x)≤e≤ℓL(x)f_L(x)\le e\le\ell_L(x) and |A[x,e)|≤q|A[x,e)|\le q, where word length counts symbols.✦

The Claim

Theorem 1. Let VV be a substring-closed set of words over a linearly ordered alphabet, and let A,DA,D be distinct integer-indexed texts. Let p,qp,q be positive integers and k≥1k\ge1 an integer. Suppose A(x+p)=A(x)A(x+p)=A(x) and D(x+q)=D(x)D(x+q)=D(x) for every integer xx, and suppose VV contains every one-letter word [A(x)][A(x)].

Let (Li)i∈I(L_i)_{i\in I} be a family of periodic layers for V,A,pV,A,p, with distinguished indices −,+∈I-,+\in I; write zi,fi,ℓiz_i,f_i,\ell_i for their exit functions and exit positions. Choose integers a,t,ba,t,b with a≤t<ba\le t<b such that R=A[a,b)R=A[a,b) belongs to VV and A,DA,D agree on [a,b)[a,b). Assume the bounds in (4), with the first line holding for every i∈Ii\in I and integer xx, and the second for every integer xx: z−(x)≤zi(x)≤z+(x),FA(x)≤lexFA(t),FD(x)≤lexFA(t),f+(t)≤b+kp,f+(a)−ℓ−(a)≤kp,b≤ℓ−(a)+kp.\begin{aligned} z_-(x)&\le z_i(x)\le z_+(x),\\ F_A(x)&\le_{\mathrm{lex}} F_A(t),\qquad F_D(x)\le_{\mathrm{lex}} F_A(t),\\ f_+(t)&\le b+kp,\\ f_+(a)-\ell_-(a)&\le kp,\qquad b\le\ell_-(a)+kp. \end{aligned}(4) There is a hierarchical graph walk PP from RR to itself with the properties in (5): cost⁡(P)=kp,P touches every Li,either some Li has a short vertex at threshold q,or P visits a word w with |w|≤q.\begin{gathered} \operatorname{cost}(P)=kp,\qquad P\text{ touches every }L_i,\\ \text{either some }L_i\text{ has a short vertex at threshold }q,\\ \text{or }P\text{ visits a word }w\text{ with }|w|\le q. \end{gathered}(5)✦

What Is Checked

The statement concerns hierarchical graph walks in a substring-closed vertex set and an indexed family of periodic layers, under interval agreement and lexicographic bounds on two distinct periodic texts and the stated bounds on layer exits.