OctoInformBeta

OpenAI preprint, September 2026 · §6. Overlap conventions and dimension of the attractor

§6 (setting): overlap conventions: Injectivity on finite words agrees with the nonempty-word and fixed-length conditions

The overlap conventions are equivalent.

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 overlap conventions concern whether different finite addresses determine the same complete affine map. A weighted affine iterated function system SS on a finite alphabet ι\iota consists of real signed slopes rir_i, real translations tit_i and strictly positive normalized weights pip_i, with φi(x)=rix+ti,0<|ri|<1,pi>0,∑i∈ιpi=1.\varphi_i(x)=r_i x+t_i,\qquad 0<|r_i|<1,\qquad p_i>0,\qquad \sum_{i\in\iota}p_i=1.(1)✦

Let 𝒲\mathcal W be the set of all finite words over ι\iota, including the empty word ⌀\varnothing. For the maps in (1), the word affine composition associated with w=i1⋯inw=i_1\cdots i_n is the complete affine map φw\varphi_w, composed in address order; its word map F:𝒲→ℝ2F:\mathcal W\to\mathbb R^2 records the signed slope and translation: φw=φi1∘⋯∘φin,φw(x)=rwx+tw,F(w)=(rw,tw),F(⌀)=(1,0).\varphi_w=\varphi_{i_1}\circ\cdots\circ\varphi_{i_n},\qquad \varphi_w(x)=r_wx+t_w,\qquad F(w)=(r_w,t_w),\qquad F(\varnothing)=(1,0).(2)✦ For n≥0n\geq0, the length nn complete-map function Fn:ιn→ℝ2F_n:\iota^n\to\mathbb R^2 assigns to an indexed word the pair in (2): Fn(w1,…,wn)=F(w1⋯wn).F_n(w_1,\ldots,w_n)=F(w_1\cdots w_n).(3)✦

The Claim

Definition 1. The no-exact-overlap property 𝖭(S)\mathsf N(S) of SS is injectivity of the word map FF in (2): 𝖭(S)⇔F:𝒲→ℝ2 is injective.\mathsf N(S)\quad\Longleftrightarrow\quad F:\mathcal W\longrightarrow\mathbb R^2\text{ is injective}.(4)✦ The same-length no-exact-overlap property 𝖭=(S)\mathsf N_{=}(S) of SS is injectivity of every complete-map function FnF_n in (3): 𝖭=(S)⇔Fn:ιn→ℝ2 is injective for every n≥0.\mathsf N_{=}(S)\quad\Longleftrightarrow\quad F_n:\iota^n\longrightarrow\mathbb R^2\text{ is injective for every }n\geq0.(5)✦

Theorem 1. Let SS be a weighted affine iterated function system on a finite alphabet, with the properties 𝖭(S)\mathsf N(S) and 𝖭=(S)\mathsf N_{=}(S) defined in (4) and (5). Then 𝖭(S)⇔F|𝒲\{⌀} is injective,\mathsf N(S)\quad\Longleftrightarrow\quad F\big|_{\mathcal W\setminus\{\varnothing\}}\text{ is injective},(6)✦ and 𝖭(S)⇔𝖭=(S).\mathsf N(S)\quad\Longleftrightarrow\quad\mathsf N_{=}(S).(7)✦

In the paper, the result reads: an exact overlap is equality φu=φv\varphi_u=\varphi_v of complete affine maps for distinct positive-length words u,vu,v of the same length; one may instead allow distinct nonempty words of arbitrary lengths, and Lemma 6.1 reconciles these conventions.

What Is Checked

The equivalences (6) and (7) are stated over every weighted affine iterated function system on a finite alphabet, with word compositions valued in pairs of real signed slopes and translations.