OctoInformBeta

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

§2.3 (displayed): finite translation and correlation comparisons: Translation errors and separated correlations controlled by the same finite boundary ratios

Boundary bounds for finite color averages.

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 subsets of Thompson’s group sample vector colors of dyadic partitions through images of a uniform grid. The correlations in question are real inner products of colors attached to two intervals, with their signs retained.

An interval homeomorphism is a homeomorphism of the closed interval [0,1][0,1] onto itself.✦ A dyadic rational is a number k/2mk/2^m, with k∈ℤk\in\mathbb Z and m≥0m\geq0.✦ A dyadic affine decomposition of an interval homeomorphism consists of finitely many dyadic knots 0=a0<⋯<ad=10=a_0<\cdots<a_d=1, with d>0d>0, and integer exponents eie_i such that the map is affine of slope 2ei2^{e_i} on each closed piece [ai,ai+1][a_i,a_{i+1}].✦ An interval homeomorphism has dyadic piecewise linearity when it admits such a decomposition.✦ Thompson’s group FF consists of the strictly increasing interval homeomorphisms with dyadic piecewise linearity; multiplication is hg=h∘ghg=h\circ g.✦

For a group GG, a finite set A⊂GA\subset G and h∈Gh\in G, the left translate is hA={hg:g∈A}hA=\{hg:g\in A\}.✦ For a real function φ\varphi on GG, the normalized finite average 𝔼Aφ\mathbb E_A\varphi is its arithmetic mean on AA, with value 00 when AA is empty; for nonempty AA, this average and the relative boundary of AA at hh are given by (1). 𝔼Aφ=1|A|∑g∈Aφ(g),bA(h)=|hA△A||A|.\mathbb E_A\varphi=\frac{1}{|A|}\sum_{g\in A}\varphi(g), \qquad b_A(h)=\frac{|hA\triangle A|}{|A|}.(1)

Intervals and Colors

A basic dyadic interval I=[k/2m,(k+1)/2m]I=[k/2^m,(k+1)/2^m] is a closed cell, where m≥0m\geq0 and 0≤k<2m0\leq k<2^m.✦ Write aI,bIa_I,b_I for its left and right endpoints and I∘=(aI,bI)I^\circ=(a_I,b_I) for its interior. A basic dyadic interval II is internal when 0<aI0<a_I and bI<1b_I<1.✦ For basic intervals, K⊂IK\subset I means aI≤aKa_I\leq a_K and bK≤bIb_K\leq b_I.✦ Write I<JI<J when bI<aJb_I<a_J✦; two intervals are strictly separated when I<JI<J or J<IJ<I.✦

For a basic dyadic interval I=[k/2m,(k+1)/2m]I=[k/2^m,(k+1)/2^m], the affine chart sI:ℝ→ℝs_I:\mathbb R\to\mathbb R and affine interval composition are given by (2); on [0,1][0,1], the chart is a map into II: sI(x)=k+x2m,I⋅J=sI(J).s_I(x)=\frac{k+x}{2^m},\qquad I\cdot J=s_I(J).(2) An element h∈Fh\in F carries II affinely onto JJ when h(sI(x))=sJ(x)h(s_I(x))=s_J(x) for every x∈[0,1]x\in[0,1].✦

A dyadic partition TT is a finite collection of basic dyadic intervals covering [0,1][0,1], with disjoint open interiors for distinct cells✦; its number of cells is |T||T|.✦ A dyadic partition TT respects a basic dyadic interval II when every point of II belongs to a cell of TT contained in II.✦ For a dyadic partition TT that respects a basic dyadic interval II, the normalized restriction TIT_I is the dyadic partition whose cells are specified in (3): TI={J basic dyadic:I⋅J∈T}.T_I=\{J\text{ basic dyadic}:I\cdot J\in T\}.(3) For a natural number nn, 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 j/2nj/2^n for 0≤j≤2n0\leq j\leq2^n.

Fix an integer D≥2D\geq2 and put P={1,…,D}P=\{1,\ldots,D\}. The selected intervals IiI_i and the parent and child intervals KqK_q, indexed by the disjoint union Q=P⊔(P×P)Q=P\sqcup(P\times P), are defined by (4): Ii=[2i−122D,2i22D],Ki=Ii,K(i,j)=Ii⋅Ij.I_i=\left[\frac{2i-1}{2^{2D}},\frac{2i}{2^{2D}}\right], \qquad K_i=I_i,\qquad K_{(i,j)}=I_i\cdot I_j.(4) The first and second reference intervals are I1I_1 and I2I_2. A dyadic partition TT is family-admissible when it respects every interval KqK_q indexed by q∈Qq\in Q.✦

For each ordered pair (q,r)∈Q×Q(q,r)\in Q\times Q with Kq<KrK_q<K_r, choose hq,r∈Fh_{q,r}\in F carrying KqK_q affinely onto I1I_1 and KrK_r affinely onto I2I_2.✦ The fixed transport set and its maximum boundary ratio on a nonempty finite A⊂FA\subset F are defined in (5): S={hq,r:q,r∈Q,Kq<Kr},η=maxh∈SbA(h).S=\{h_{q,r}:q,r\in Q,\ K_q<K_r\}, \qquad \eta=\max_{h\in S}b_A(h).(5)

Let EE be a real inner product space and B={x∈E:∥x∥≤1}B=\{x\in E:\|x\|\leq1\} its closed unit ball, with origin 00. For a finite vector family x1,…,xdx_1,\ldots,x_d, its arithmetic mean is d−1∑i=1dxid^{-1}\sum_{i=1}^d x_i when d>0d>0, and the empty mean is 00.✦ For d>0d>0 and xi∈Bx_i\in B, the ball mean of the finite vector family x1,…,xdx_1,\ldots,x_d is its arithmetic mean in the closed unit ball BB.✦

Fix a self-map f:B→Bf:B\to B. For a positive finite family of internal basic intervals, the recursive partition color assigns a point of BB to each dyadic partition by recursion using ff and normalized restrictions to that family. Write Cf(T)C_f(T) for this color with the selected family I1,…,IDI_1,\ldots,I_D. For a dyadic partition TT and an index q∈Qq\in Q, the admissible family color at qq is the point of BB equal to Cf(TKq)C_f(T_{K_q}) when TT is family-admissible, and to 00 otherwise.✦

For g∈Fg\in F, the basic image cells condition at level nn requires each actual image g([k/2n,(k+1)/2n])g([k/2^n,(k+1)/2^n]) to be a basic dyadic interval, with endpoints g(k/2n)g(k/2^n) and g((k+1)/2n)g((k+1)/2^n).✦ For an element g∈Fg\in F satisfying the basic image cells condition at level nn, the image partition gT(n)gT^{(n)} is the dyadic partition formed by the images under gg of the cells of T(n)T^{(n)}; otherwise the image partition is undefined.✦ The zero-extended family color at an index q∈Qq\in Q assigns to a dyadic partition its admissible family color at qq, a point of BB, and has value 00 when no partition is supplied.✦ For g∈Fg\in F and q∈Qq\in Q, the global family color XKq(g)∈BX_{K_q}(g)\in B at level nn is the zero-extended family color at qq for gg at level nn.✦ An element g∈Fg\in F is globally admissible at level nn when its image partition exists and is family-admissible.✦

For intervals I,JI,J in the indexed family, the global color correlation and its signed reference average are defined in (6): φI,J(g)=⟨XI(g),XJ(g)⟩E,α=𝔼AφI1,I2.\varphi_{I,J}(g)=\langle X_I(g),X_J(g)\rangle_E, \qquad \alpha=\mathbb E_A\varphi_{I_1,I_2}.(6)

The Claim

Theorem 1. Let GG be a group, A⊂GA\subset G a nonempty finite set, h∈Gh\in G, and φ:G→ℝ\varphi:G\to\mathbb R a function satisfying |φ(g)|≤1|\varphi(g)|\leq1 for every g∈Gg\in G. Then |𝔼g∈Aφ(hg)−𝔼g∈Aφ(g)|≤bA(h).\left|\mathbb E_{g\in A}\varphi(hg) -\mathbb E_{g\in A}\varphi(g)\right| \leq b_A(h).(7)✦ In the color setting above, let n∈ℕn\in\mathbb N and let A⊂FA\subset F be a nonempty finite set. Suppose every g∈Ag\in A and every hghg with h∈Sh\in S and g∈Ag\in A is globally admissible at level nn. For q,r∈Qq,r\in Q whose intervals Kq,KrK_q,K_r are strictly separated, |𝔼AφKq,Kr−α|≤η.\left|\mathbb E_A\varphi_{K_q,K_r}-\alpha\right|\leq\eta.(8)✦

In the paper, the result reads: for a nonempty finite A⊂FA\subset F, h∈Fh\in F and a globally defined φ:F→[−1,1]\varphi:F\to[-1,1], |𝔼g∈Aφ(hg)−𝔼g∈Aφ(g)|≤|hA△A|/|A||\mathbb E_{g\in A}\varphi(hg)-\mathbb E_{g\in A}\varphi(g)| \leq|hA\triangle A|/|A|, and at a common admissible level for AA and SA={hg:h∈S,g∈A}SA=\{hg:h\in S,\ g\in A\}, with α=𝔼AφI1,I2\alpha=\mathbb E_A\varphi_{I_1,I_2}, every strictly separated I,JI,J in the family satisfies |𝔼A⟨XI,XJ⟩E−α|≤η|\mathbb E_A\langle X_I,X_J\rangle_E-\alpha|\leq\eta.

What Is Checked

The translation estimate (7) is stated over arbitrary groups and globally bounded real functions. The correlation estimate (8) is stated over real inner product spaces and self-maps of their closed unit balls, with a common admissible level on AA and all its translates by SS.

The selected intervals in (4) are internal.✦ For D≥2D\geq2, the fixed transport set in (5) is nonempty.✦