OctoInformBeta

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

§6 (setting): the attractor and similarity dimension: Finite nonempty families of strict nonzero similarities of the line

Coding the attractor and defining similarity dimension.

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

Let II be a finite nonempty alphabet and let Φ=(φi)i∈I\Phi=(\varphi_i)_{i\in I} be a family of affine similarities of the real line satisfying φi(x)=rix+ti,ri,ti∈ℝ,0<|ri|<1(i∈I).\varphi_i(x)=r_i x+t_i, \qquad r_i,t_i\in\mathbb R, \qquad 0<|r_i|<1 \quad (i\in I).(1) An infinite address is a sequence ω∈Iℕ\omega\in I^{\mathbb N}; a finite word is a string u=i0⋯in−1u=i_0\cdots i_{n-1} of symbols in II. Write ⌀\varnothing for the empty word and iuiu for the word obtained by placing ii before uu.

The Claim

Definition 1. The coding point π(ω)∈ℝ\pi(\omega)\in\mathbb R of an infinite address ω∈Iℕ\omega\in I^{\mathbb N} is defined by (2), with an empty product equal to 11: π(ω)=∑n=0∞(∏j=0n−1rωj)tωn.\pi(\omega) =\sum_{n=0}^{\infty} \left(\prod_{j=0}^{n-1}r_{\omega_j}\right)t_{\omega_n}.(2)✦ The coding attractor KΦ⊆ℝK_\Phi\subseteq\mathbb R is the range of the coding map, as in (3): KΦ={π(ω):ω∈Iℕ}.K_\Phi=\{\pi(\omega):\omega\in I^{\mathbb N}\}.(3)✦ The affine word coefficients (ru,tu)∈ℝ2(r_u,t_u)\in\mathbb R^2 are defined by the recursion (4); the associated map is φu(x)=rux+tu\varphi_u(x)=r_u x+t_u, with words composed in address order, φi0⋯in−1=φi0∘⋯∘φin−1\varphi_{i_0\cdots i_{n-1}}=\varphi_{i_0}\circ\cdots\circ\varphi_{i_{n-1}}: (r⌀,t⌀)=(1,0),(riu,tiu)=(riru,ritu+ti).(r_{\varnothing},t_{\varnothing})=(1,0), \qquad (r_{iu},t_{iu})=(r_i r_u,\,r_i t_u+t_i).(4)✦

Theorem 1. For every finite nonempty family satisfying (1), there is a unique nonnegative real number s*s_* satisfying (5); this number is the similarity dimension of Φ\Phi.✦ ∑i∈I|ri|s*=1.\sum_{i\in I}|r_i|^{s_*}=1.(5)✦

In the paper, the result reads: KΦK_\Phi is the compact attractor, equivalently the set of all coding limits, and s*s_* is the unique nonnegative solution of ∑i∈I|ri|s*=1\sum_{i\in I}|r_i|^{s_*}=1, which exists for every finite nonempty family of strict nonzero similarities and equals zero for a single symbol.

What Is Checked

The coding constructions and the similarity dimension theorem are stated over finite nonempty alphabets and real affine families satisfying (1).