OctoInformBeta

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

Lemma 6.1: Weighted and uniformly weighted affine systems on a finite alphabet

Exact overlaps occur at equal word lengths.

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 exact overlap of an affine iterated function system SS is an equality of affine maps associated with two distinct symbolic addresses of SS. The lengths of the addresses need not agree in the definition.

A weighted affine iterated function system SS on a finite nonempty alphabet II is a family of affine contractions with real signed slopes rir_i, real translations tit_i, and strictly positive normalized weights pip_i, as in (1): φi(x)=rix+ti,0<|ri|<1,pi>0,∑i∈Ipi=1.\varphi_i(x)=r_i x+t_i,\qquad 0<|r_i|<1,\qquad p_i>0,\qquad \sum_{i\in I}p_i=1.(1)✦

A word ww over II is a finite sequence of symbols; its length is |w||w|, and ⌀\varnothing denotes the empty word. For a word ww over the alphabet II of the affine iterated function system SS, the word affine composition φw\varphi_w is the affine map obtained by composing the maps of SS in address order, with signed slope RwR_w and translation TwT_w, as specified in (2): φ⌀=id⁡ℝ,φi1⋯in=φi1∘⋯∘φin,φw(x)=Rwx+Tw.\varphi_{\varnothing}=\operatorname{id}_{\mathbb R},\qquad \varphi_{i_1\cdots i_n} =\varphi_{i_1}\circ\cdots\circ\varphi_{i_n},\qquad \varphi_w(x)=R_wx+T_w.(2)✦ Equality of word maps means equality of both RwR_w and TwT_w.

The uniformly weighted system S¯\overline S associated with the maps in (1) is the affine iterated function system that assigns the same weight to every symbol, as in (3); write φ¯w\overline\varphi_w for its word composition: φ¯i(x)=rix+ti,p¯i=1#I(i∈I).\overline\varphi_i(x)=r_i x+t_i,\qquad \overline p_i=\frac{1}{\# I}\quad(i\in I).(3)

The Claim

Theorem 1. Let SS be a weighted affine iterated function system satisfying (1). Suppose u,vu,v are distinct nonempty words with φu=φv\varphi_u=\varphi_v. There are words a,ba,b satisfying (4): a≠⌀,b≠⌀,|a|=|b|,a≠b,φa=φb.a\ne\varnothing,\qquad b\ne\varnothing,\qquad |a|=|b|,\qquad a\ne b,\qquad \varphi_a=\varphi_b.(4)✦ For real families ri,tir_i,t_i on a finite nonempty alphabet II with 0<|ri|<10<|r_i|<1, let S¯\overline S be the uniform system in (3). Suppose u,vu,v are distinct nonempty words with φ¯u=φ¯v\overline\varphi_u=\overline\varphi_v. There are words c,dc,d satisfying (5): c≠⌀,d≠⌀,|c|=|d|,c≠d,φ¯c=φ¯d.c\ne\varnothing,\qquad d\ne\varnothing,\qquad |c|=|d|,\qquad c\ne d,\qquad \overline\varphi_c=\overline\varphi_d.(5)✦

In the paper, the result reads: for a finite family φi(x)=rix+ti\varphi_i(x)=r_i x+t_i with 0<|ri|<10<|r_i|<1, equality of maps for two distinct nonempty words of arbitrary lengths implies equality of maps for two distinct words of the same length.

What Is Checked

The statements concern finite nonempty words and their complete affine compositions (2), over weighted systems satisfying (1) and the uniform systems of (3).