OctoInformBeta

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

§2.3 (setting): the fixed transport set and boundary defect: Finite averages and boundary defects for a family of parents and descendants

Fixed transports and a common dyadic level.

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

Finite averages on Thompson’s group are compared with their left translates by transports between prescribed dyadic intervals. The partitions involved must resolve the parent and descendant intervals after the group elements act.

An interval homeomorphism ff of [0,1][0,1] is a homeomorphism of the closed real interval [0,1][0,1] onto itself.✦ A dyadic real number xx is a real number of the form k/2nk/2^n, with k∈ℤk\in\mathbb Z and n≥0n\geq0.✦ A dyadic affine decomposition 𝒟\mathcal D of an interval homeomorphism ff is a collection consisting of a positive integer mm, dyadic knots 0=a0<⋯<am=10=a_0<\cdots<a_m=1, and integers eie_i satisfying (1) on the closed cells [ai,ai+1][a_i,a_{i+1}], which cover [0,1][0,1]: 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\leq x\leq a_{i+1},\quad 0\leq i<m.(1) An interval homeomorphism ff is dyadically piecewise linear when it admits a dyadic affine decomposition. Thompson’s group FF consists of the strictly increasing interval homeomorphisms with this property.✦ Multiplication is composition, hg=h∘ghg=h\circ g.

A standard dyadic interval II is a closed cell of depth n≥0n\geq0 and index 0≤k<2n0\leq k<2^n as in (2); write ℓI,rI\ell_I,r_I for its endpoints, I∘I^\circ for its open interior, and sIs_I for its affine chart: I=[ℓI,rI]=[k2n,k+12n],I∘=(ℓI,rI),sI(x)=k+x2n.I=[\ell_I,r_I]=\left[\frac{k}{2^n},\frac{k+1}{2^n}\right], \qquad I^\circ=(\ell_I,r_I),\qquad s_I(x)=\frac{k+x}{2^n}.(2) For x∈[0,1]x\in[0,1], the chart point sI(x)s_I(x) belongs to [0,1][0,1]. For standard dyadic intervals KK and II, containment K⊆IK\subseteq I means ℓI≤ℓK\ell_I\leq\ell_K and rK≤rIr_K\leq r_I.✦ For standard dyadic intervals II and JJ, strict separation I<JI<J means rI<ℓJr_I<\ell_J.✦ The interval composition I⋅J=sI(J)I\cdot J=s_I(J) has depth n+mn+m and index k2m+ℓk2^m+\ell when I,JI,J have depths n,mn,m and indices k,ℓk,\ell.✦

Fix an integer D≥2D\geq2. The selected parent intervals IiI_i, indexed by 1≤i≤D1\leq i\leq D, and their children are given in (3). Parent and child indices belong to the disjoint union QD={1,…,D}⊔{1,…,D}2Q_D=\{1,\ldots,D\}\sqcup\{1,\ldots,D\}^2✦; write JqJ_q for the interval with index qq: Ii=[2i−122D,2i22D],Ji=Ii,J(i,j)=Ii⋅Ij.I_i=\left[\frac{2i-1}{2^{2D}},\frac{2i}{2^{2D}}\right], \qquad J_i=I_i,\qquad J_{(i,j)}=I_i\cdot I_j.(3) The first and second reference parents are I1I_1 and I2I_2. The ordered separated pairs form the finite set PD={(q,r)∈QD2:Jq<Jr}P_D=\{(q,r)\in Q_D^2:J_q<J_r\}.✦ An affine transport from a standard dyadic interval II to a standard dyadic interval JJ is an element h∈Fh\in F satisfying (4): h(sI(x))=sJ(x),x∈[0,1].h(s_I(x))=s_J(x),\qquad x\in[0,1].(4)✦

Partitions and Admissibility

A dyadic partition TT is a finite collection of standard dyadic cells covering [0,1][0,1], with disjoint open interiors for distinct cells.✦ A partition TT respects an interval II when every point of II belongs to a cell KK of TT contained in II.✦ A dyadic partition TT is family admissible for DD when it respects JqJ_q for every q∈QDq\in Q_D.✦

The uniform partition T(n)T^{(n)} has cells [k/2n,(k+1)/2n][k/2^n,(k+1)/2^n], for 0≤k<2n0\leq k<2^n; its grid points are pn,j=j/2np_{n,j}=j/2^n, for 0≤j≤2n0\leq j\leq2^n, including the endpoints 00 and 11.✦ An element g∈Fg\in F has basic dyadic cell images at level nn when every interval Ig,n,kI_{g,n,k} in (5) is a standard dyadic interval: Ig,n,k=[g(pn,k),g(pn,k+1)],0≤k<2n.I_{g,n,k}=[g(p_{n,k}),g(p_{n,k+1})],\qquad 0\leq k<2^n.(5)✦ For an element g∈Fg\in F with basic dyadic cell images at level nn, the image partition gT(n)gT^{(n)} is the collection of intervals Ig,n,kI_{g,n,k} in (5). An element g∈Fg\in F is globally family admissible at level nn for DD, written 𝒜D(n,g)\mathcal A_D(n,g), when gg has basic dyadic cell images at level nn and its image partition is family admissible for DD.✦ For g∈Fg\in F with basic dyadic cell images at level nn, the image cell Ig,n,kI_{g,n,k} is the standard dyadic interval obtained as the image under gg of the kkth closed cell of T(n)T^{(n)}, for 0≤k<2n0\leq k<2^n.

The Claim

Theorem 1 (Fixed transports and common admissible levels). Let D≥2D\geq2. For each (q,r)∈PD(q,r)\in P_D, choose an affine pair transport hq,r∈Fh_{q,r}\in F carrying JqJ_q onto I1I_1 and JrJ_r onto I2I_2 in the sense of (4).✦ The fixed transport set is S={hq,r:(q,r)∈PD}.S=\{h_{q,r}:(q,r)\in P_D\}.(6)✦ The choices in (6) precede the choice of an averaging set. For a finite subset AA of a set XX and a function ψ:X→ℝ\psi:X\to\mathbb R, the finite average EAψE_A\psi is the real number given by (7): EAψ=|A|−1∑g∈Aψ(g).E_A\psi=|A|^{-1}\sum_{g\in A}\psi(g).(7)✦ The left translate of a finite subset AA of a group GG by h∈Gh\in G is hA={hg:g∈A}hA=\{hg:g\in A\}. For a finite subset AA of a group GG and an element h∈Gh\in G, the boundary ratio bA(h)b_A(h) is the real number given by (8), where △\triangle denotes symmetric difference: bA(h)=|hA△A||A|.b_A(h)=\frac{|hA\triangle A|}{|A|}.(8)✦ The empty average and the boundary ratio of the empty set are assigned the value 00. The maximal boundary ratio η\eta for a finite subset AA of a group GG and a nonempty finite transport set S⊆GS\subseteq G is the real number given by (9): η=maxh∈SbA(h).\eta=\max_{h\in S}b_A(h).(9)✦ For every finite subset A⊆FA\subseteq F, there is a common admissible level n≥0n\geq0 as in (10), with SS the fixed set in (6): 𝒜D(n,g)(g∈A),𝒜D(n,hg)(h∈S,g∈A).\mathcal A_D(n,g)\quad(g\in A),\qquad \mathcal A_D(n,hg)\quad(h\in S,\ g\in A).(10)✦

In the paper, the result reads: for every ordered pair I<JI<J in the parent and descendant family choose a transport hI,Jh_{I,J} carrying it onto the reference parents I1,I2I_1,I_2, let SS be the finite set of these transports chosen before any averaging set AA, and for nonempty finite AA set EAψ=|A|−1∑g∈Aψ(g)E_A\psi=|A|^{-1}\sum_{g\in A}\psi(g) and η=max⁡h∈S|hA△A|/|A|\eta=\max_{h\in S}|hA\triangle A|/|A|.

What Is Checked

The common-level statement is over the increasing dyadic piecewise linear homeomorphisms of [0,1][0,1], the selected parent and child family, and a finite subset of FF together with its left translates by the fixed transports. For an element with basic dyadic cell images, the image partition covers [0,1][0,1] and its distinct cells have disjoint open interiors.