OctoInformBeta

OpenAI preprint, September 2026 · §2. Recursive colors and finite averages

Lemma 2.1: Under Thompson maps, with arbitrarily small cells and simultaneous refinement for finite sets of maps and basic intervals

Uniform dyadic grids eventually have basic images.

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

How does an increasing piecewise linear homeomorphism change a uniform dyadic grid when the grid is refined?

The unit interval is the closed real interval [0,1][0,1], with left endpoint 00 and right endpoint 11.✦ An interval homeomorphism ff is a homeomorphism from [0,1][0,1] onto itself.✦ A real number xx is dyadic if it has the form in (1): x=k2d,k∈ℤ,d∈ℤ≥0.x=\frac{k}{2^d},\qquad k\in\mathbb Z,\quad d\in\mathbb Z_{\ge0}.(1)✦

A dyadic affine decomposition of an interval homeomorphism ff is a finite subdivision 0=a0<a1<⋯<am=10=a_0<a_1<\cdots<a_m=1, with m≥1m\ge1 and dyadic knots aia_i, together with integer exponents eie_i satisfying (2) on each closed subdivision cell: f(x)=f(ai)+2ei(x−ai)(ai≤x≤ai+1,0≤i<m).f(x)=f(a_i)+2^{e_i}(x-a_i) \qquad(a_i\le x\le a_{i+1},\quad 0\le i<m).(2)✦ Dyadic piecewise linearity of an interval homeomorphism ff is the property that ff admits a dyadic affine decomposition. Thompson’s group FF is the group of strictly increasing interval homeomorphisms that admit a dyadic affine decomposition.

Dyadic Partitions

A basic dyadic interval I=Id,kI=I_{d,k} is a closed cell of depth d≥0d\ge0 and integer index 0≤k<2d0\le k<2^d.✦ Its left and right endpoints, denoted ℓ(I)\ell(I) and r(I)r(I), and its length |I||I| are given in (3): I=[ℓ(I),r(I)]=[k2d,k+12d],|I|=2−d.I=\left[\ell(I),r(I)\right] =\left[\frac{k}{2^d},\frac{k+1}{2^d}\right], \qquad |I|=2^{-d}.(3) The carrier of a basic interval II is the closed interval [ℓ(I),r(I)][\ell(I),r(I)]. The interior I∘I^\circ of a basic interval II is the open interval I∘=(ℓ(I),r(I))I^\circ=(\ell(I),r(I)). A basic interval KK is contained in a basic interval II, written K⊆IK\subseteq I, when ℓ(I)≤ℓ(K)\ell(I)\le\ell(K) and r(K)≤r(I)r(K)\le r(I).✦

A basic partition TT is a finite set of basic intervals whose closed carriers cover [0,1][0,1] and whose distinct cells have disjoint open interiors.✦ A basic partition TT respects a basic interval II when the cells of TT contained in II cover II, as in (4): T respects I⇔I=⋃K∈TK⊆IK.T\text{ respects }I \quad\Longleftrightarrow\quad I=\bigcup_{\substack{K\in T\\K\subseteq I}}K.(4)✦

For a nonnegative integer nn, the uniform dyadic grid consists of the points tn,jt_{n,j} in (5); the uniform partition T(n)T^{(n)} is the set of closed cells between successive grid points: tn,j=j2n(0≤j≤2n),T(n)={[tn,k,tn,k+1]:0≤k<2n}.t_{n,j}=\frac{j}{2^n}\quad(0\le j\le2^n), \qquad T^{(n)}=\left\{[t_{n,k},t_{n,k+1}]:0\le k<2^n\right\}.(5)

For g∈Fg\in F and n≥0n\ge0, an image interval Jg,n,kJ_{g,n,k} is the closed interval in (6): Jg,n,k=[g(tn,k),g(tn,k+1)](0≤k<2n).J_{g,n,k}=[g(t_{n,k}),g(t_{n,k+1})] \qquad(0\le k<2^n).(6) The basic image cell condition ℬ(g,n)\mathcal B(g,n) means that every Jg,n,kJ_{g,n,k} is a basic interval.✦ For g∈Fg\in F and a nonnegative integer nn satisfying ℬ(g,n)\mathcal B(g,n), the image cells are the intervals Jg,n,kJ_{g,n,k}. The image partition gT(n)gT^{(n)} of an element g∈Fg\in F at a nonnegative integer depth nn satisfying ℬ(g,n)\mathcal B(g,n) is the finite family of image intervals Jg,n,kJ_{g,n,k} in (7): gT(n)={Jg,n,k:0≤k<2n}.gT^{(n)}=\{J_{g,n,k}:0\le k<2^n\}.(7)✦

The Claim

Theorem 1 (Lemma 2.1). Let g∈Fg\in F. There is a nonnegative integer NN such that, for every n≥Nn\ge N, ℬ(g,n).\mathcal B(g,n).(8)✦ For every real ε>0\varepsilon>0, there is a nonnegative integer MM such that, for every n≥Mn\ge M, ℬ(g,n),|I|<εfor every I∈gT(n).\mathcal B(g,n),\qquad |I|<\varepsilon\quad\text{for every }I\in gT^{(n)}.(9)✦ Let K⊂FK\subset F be finite and let 𝒥\mathcal J be a finite set of basic intervals. There is a nonnegative integer LL such that, for every n≥Ln\ge L and every g∈Kg\in K, ℬ(g,n),gT(n) respects Jfor every J∈𝒥.\mathcal B(g,n),\qquad gT^{(n)}\text{ respects }J\quad\text{for every }J\in\mathcal J.(10)✦

In the paper, the result reads: for every g∈Fg\in F, gT(n)gT^{(n)} is a basic partition for all sufficiently large nn and its largest cell length tends to zero; in particular, for any finite K⊂FK\subset F and finite family 𝒥\mathcal J of basic intervals, there is n0n_0 such that gT(n)gT^{(n)} is basic and respects every J∈𝒥J\in\mathcal J whenever g∈Kg\in K and n≥n0n\ge n_0.

What Is Checked

The individual assertions (8) and (9) are stated for g∈Fg\in F at nonnegative integer grid depths, with a positive real bound ε\varepsilon in (9); (10) allows arbitrary finite K⊂FK\subset F and finite sets 𝒥\mathcal J of basic intervals. For every pair (g,n)(g,n) satisfying ℬ(g,n)\mathcal B(g,n), the image partition gT(n)gT^{(n)} is a basic partition.