OctoInformBeta

OpenAI preprint, September 2026 · §3. Separated index windows

Lemma 3.1 [Spatial stability of earlier grid keys]: A periodic set of centers controls normalized displacements and every Boolean selector table

Separated windows preserve earlier grid indices.

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

For a natural index nn, a displacement x↦x+t2−nx\mapsto x+t2^{-n}, with 1≤t≤21\le t\le2, can cross a boundary of an earlier dyadic grid. Spatial stability concerns the centers at which these displacements retain the earlier cell indices. Write {x}=x−⌊x⌋\{x\}=x-\lfloor x\rfloor and ρ(A)=|A∩[0,1]|\rho(A)=|A\cap[0,1]|, where |⋅||\cdot| denotes Lebesgue measure.

For real qq, the periodic mesh index kq(x)k_q(x) is the integer in (1); for a natural level bb, the dyadic cell indices Jb(x)J_b(x) and jb(x)j_b(x) are given there. kq(x)=⌊q{x}⌋,Jb(x)=k2b+2(x),jb(x)=Jb(x)∈{0,…,2b+2−1}.\begin{gathered} k_q(x)=\lfloor q\{x\}\rfloor,\qquad J_b(x)=k_{2^{b+2}}(x),\\ j_b(x)=J_b(x)\in\{0,\ldots,2^{b+2}-1\}. \end{gathered}(1) The corresponding cells, indexed by integers kk, are the half-open intervals [k2−b−2,(k+1)2−b−2)[k2^{-b-2},(k+1)2^{-b-2}) modulo one, including their left boundaries.

For a natural grid parameter qq and real displacement δ\delta, the boundary-crossing set B(q,δ)⊆ℝB(q,\delta)\subseteq\mathbb R is the union in (2). B(q,δ)=⋃k∈ℤ[kq−δ,kq).B(q,\delta)=\bigcup_{k\in\mathbb Z} \left[\frac{k}{q}-\delta,\frac{k}{q}\right).(2)✦ For natural level families a,b:I→ℕa,b:I\to\mathbb N, the stable-center set G(a,b)⊆ℝG(a,b)\subseteq\mathbb R is the complement in (3). G(a,b)=ℝ\⋃i∈IB(2bi+2,2⋅2−ai).G(a,b)=\mathbb R\setminus\bigcup_{i\in I} B\bigl(2^{b_i+2},2\cdot2^{-a_i}\bigr).(3)✦

Windows and Selectors

The placed windows We⊆ℕW_e\subseteq\mathbb N associated with a length sequence ℓ:ℕ→ℕ\ell:\mathbb N\to\mathbb N and a natural gap gg are the sets in (4), with starts ses_e and endpoints beb_e. s0=3,se+1=se+ℓ(e)+g,be=se+ℓ(e)−1,We=[se,be]∩ℕ.s_0=3,\qquad s_{e+1}=s_e+\ell(e)+g,\qquad b_e=s_e+\ell(e)-1,\qquad W_e=[s_e,b_e]\cap\mathbb N.(4)

A router with parameter MM has child set CM={0,…,M}C_M=\{0,\ldots,M\}, with nondefault children IM={0,…,M−1}I_M=\{0,\ldots,M-1\} and default child MM.✦ The paper’s parameter counting all children is M+1M+1 in this notation. A decision node PP of depth dd is a finite word over CMC_M with |P|<d|P|<d; write 𝒩M,d\mathcal N_{M,d} for their set.✦ A valid window edge QQ over CMC_M at depth dd is a nonempty word over CMC_M of length at most dd.✦ Concatenation is denoted by juxtaposition, and P≼QP\preceq Q means that PP is a prefix of QQ.

Separated window data 𝒲=(r,a,b,b*)\mathcal W=(r,a,b,b^*) on an alphabet of qq children, with depth dd, gap gg and threshold r0r_0, consist of a natural sequence rr and natural endpoints aP,bP,bP*a_P,b_P,b^*_P for finite words. With L(P)=r(d+1−|P|)L(P)=r(d+1-|P|), their defining conditions are (5), where every displayed edge is valid, i,ji,j are child labels, P≺QP\prec Q means a proper prefix, and RR is any finite tail. max⁡{1,r0}≤L(P),3≤aP,bP+1=aP+L(P),bP+g<aQ(P≺Q),bPi+g<aPjR(i<j),bP≤bQ≤bP*(P≼Q),bP*+1≤aP+2L(P).\begin{gathered} \max\{1,r_0\}\le L(P),\qquad 3\le a_P,\qquad b_P+1=a_P+L(P),\\ b_P+g<a_Q\quad(P\prec Q),\qquad b_{Pi}+g<a_{PjR}\quad(i<j),\\ b_P\le b_Q\le b^*_P\quad(P\preceq Q),\qquad b^*_P+1\le a_P+2L(P). \end{gathered}(5)✦

For levels B:𝒩M,d×IM→ℕB:\mathcal N_{M,d}\times I_M\to\mathbb N, a selector address (P,i,k)(P,i,k) is a triple belonging to the set 𝒜B\mathcal A_B in (6), and a Boolean selector table ω\omega on 𝒜B\mathcal A_B is a function ω:𝒜B→{0,1}\omega:\mathcal A_B\to\{0,1\}. The queried address αB(P,i,x)\alpha_B(P,i,x) and the extended selector value σB(ω,P,i,x)\sigma_B(\omega,P,i,x) are defined in the same display. 𝒜B={(P,i,k):P∈𝒩M,d,i∈IM,k∈ℕ,0≤k<2B(P,i)+2},αB(P,i,x)=(P,i,jB(P,i)(x)),σB(ω,P,i,x)={ω(αB(P,i,x)),|P|<d,0,|P|≥d.\begin{gathered} \mathcal A_B=\{(P,i,k):P\in\mathcal N_{M,d},\ i\in I_M, \ k\in\mathbb N,\ 0\le k<2^{B(P,i)+2}\},\\ \alpha_B(P,i,x)=(P,i,j_{B(P,i)}(x)),\\ \sigma_B(\omega,P,i,x)= \begin{cases} \omega\bigl(\alpha_B(P,i,x)\bigr),&|P|<d,\\ 0,&|P|\ge d. \end{cases} \end{gathered}(6) For separated window data on CMC_M, put B𝒲(P,i)=bPiB_{\mathcal W}(P,i)=b_{Pi}.

The Claim

Theorem 1. Let a,b:I→ℕa,b:I\to\mathbb N be natural level families. If II is countable, then G(a,b) is measurable.G(a,b)\text{ is measurable}.(7)✦ For arbitrary II and every x∈ℝx\in\mathbb R, x+1∈G(a,b)⇔x∈G(a,b).x+1\in G(a,b)\quad\Longleftrightarrow\quad x\in G(a,b).(8)✦ If II is finite, g≥2g\ge2 and ai=bi+g+1a_i=b_i+g+1 for every i∈Ii\in I, then ρ(G(a,b)c)≤|I|4⋅2−g.\rho\bigl(G(a,b)^c\bigr)\le |I|\,4\cdot2^{-g}.(9)✦ If x∈G(a,b)x\in G(a,b), i∈Ii\in I, c≤bic\le b_i, ai≤na_i\le n and t∈[1,2]t\in[1,2], where c,nc,n are natural, then Jc(x+t2−n)=Jc(x).J_c(x+t2^{-n})=J_c(x).(10)✦

Let KK be natural and let p>0p>0. There is a natural g≥2g\ge2, depending only on KK and pp, for which each length sequence ℓ\ell admits a set G⊆ℝG\subseteq\mathbb R satisfying G measurable,G+1=G,ρ(Gc)≤p,jbf(x+t2−n)=jbf(x)(x∈G,f<e<K,n∈We,t∈[1,2]).\begin{gathered} G\text{ measurable},\qquad G+1=G,\qquad \rho(G^c)\le p,\\ j_{b_f}(x+t2^{-n})=j_{b_f}(x) \quad\left(\begin{gathered} x\in G,\quad f<e<K,\\ n\in W_e,\quad t\in[1,2] \end{gathered}\right). \end{gathered}(11)✦ Let M,dM,d be natural and let p>0p>0. There is a natural g≥2g\ge2, depending only on M,dM,d and pp, with the following property: given a natural threshold r0r_0 and a separated window system 𝒲\mathcal W on CMC_M with depth dd, gap gg and threshold r0r_0, there is a set G⊆ℝG\subseteq\mathbb R satisfying G measurable,G+1=G,ρ(Gc)≤p,σB𝒲(ω,P,i,x+t2−n)=σB𝒲(ω,P,i,x)(x∈G,P∈𝒩M,d,i∈IM,n∈ℕ,bPi+g<n,t∈[1,2],ω:𝒜B𝒲→{0,1}).\begin{gathered} G\text{ measurable},\qquad G+1=G,\qquad \rho(G^c)\le p,\\ \sigma_{B_{\mathcal W}}(\omega,P,i,x+t2^{-n}) =\sigma_{B_{\mathcal W}}(\omega,P,i,x)\\ \left(\begin{gathered} x\in G,\quad P\in\mathcal N_{M,d},\quad i\in I_M,\\ n\in\mathbb N,\quad b_{Pi}+g<n,\quad t\in[1,2],\\ \omega:\mathcal A_{B_{\mathcal W}}\to\{0,1\} \end{gathered}\right). \end{gathered}(12)✦

In the paper, the result reads: for the parameters and windows fixed above, GG is measurable and 11-periodic with ρ(Gc)<p\rho(G^c)<p, and if x∈Gx\in G, n∈Wen\in W_e, t∈[1,2]t\in[1,2] and the window WfW_f precedes the window WeW_e, then Jbf(x+t2−n)=Jbf(x)J_{b_f}(x+t2^{-n})=J_{b_f}(x), including centers on grid boundaries.

What Is Checked

The assertions (7), (8) and (10) are stated over natural level families, (9) over finite families with a common gap, (11) over arbitrary placed length sequences, and (12) over separated tree window systems and all Boolean tables on their selector addresses.