OctoInformBeta

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

§2.2 (setting): the recursive coloring: A ball self-map acts on finite means of colors on internal dyadic restrictions

Coloring partitions by recursive restriction.

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

Dyadic subdivisions of the unit interval are to receive colors in a real normed vector space EE. The closed unit ball BB of EE is the set B={x∈E:∥x∥≤1}.B=\{x\in E:\|x\|\leq 1\}.(1)✦ The origin of the ball in (1) is the zero vector 0∈B0\in B.✦

A standard dyadic interval In,kI_{n,k} in [0,1][0,1] is a closed cell of depth n∈ℕn\in\mathbb N and integer index 0≤k<2n0\leq k<2^n✦; its left and right endpoints aI,bIa_I,b_I and its open interior I∘I^\circ are given by (2): I=In,k=[aI,bI]=[k2n,k+12n],I∘=(aI,bI).I=I_{n,k}=[a_I,b_I] =\left[\frac{k}{2^n},\frac{k+1}{2^n}\right], \qquad I^\circ=(a_I,b_I).(2) A standard dyadic interval KK is contained in a standard dyadic interval II when aI≤aKa_I\leq a_K and bK≤bIb_K\leq b_I, and this is written K⊆IK\subseteq I.✦ An internal interval II is a standard dyadic interval with 0<aI0<a_I and bI<1b_I<1.✦

For a standard dyadic interval II, let sI:[0,1]→Is_I:[0,1]\to I be the affine map sI(t)=aI+(bI−aI)ts_I(t)=a_I+(b_I-a_I)t. The dyadic interval composition In,k⋅Im,ℓI_{n,k}\cdot I_{m,\ell} of the standard dyadic intervals In,kI_{n,k} and Im,ℓI_{m,\ell} is the standard dyadic interval given by (3): In,k⋅Im,ℓ=sIn,k(Im,ℓ)=In+m,k2m+ℓ.I_{n,k}\cdot I_{m,\ell} =s_{I_{n,k}}(I_{m,\ell}) =I_{n+m,k2^m+\ell}.(3)✦

Partitions and Their Restrictions

A dyadic partition TT of [0,1][0,1] is a finite collection 𝒞(T)\mathcal C(T) of standard dyadic intervals that covers [0,1][0,1] and whose distinct cells have disjoint open interiors.✦ The cell count of a dyadic partition TT is N(T)=|𝒞(T)|N(T)=|\mathcal C(T)|.✦

A dyadic partition TT respects a standard dyadic interval II when the cells of TT contained in II cover II, as expressed in (4): I=⋃K∈𝒞(T)K⊆IK.I=\bigcup_{\substack{K\in\mathcal C(T)\\K\subseteq I}}K.(4)✦ When a dyadic partition TT of [0,1][0,1] respects a standard dyadic interval II, the normalized restriction TIT_I is the dyadic partition of [0,1][0,1] obtained by affinely rescaling the cells inside II; its cells are the finite set in (5): 𝒞(TI)={J:J is a standard dyadic interval and I⋅J∈𝒞(T)}.\mathcal C(T_I) =\{J:\ J\text{ is a standard dyadic interval and }I\cdot J\in\mathcal C(T)\}.(5)

For a nonnegative integer dd and vectors x1,…,xd∈Ex_1,\ldots,x_d\in E, the finite arithmetic mean Md(x1,…,xd)M_d(x_1,\ldots,x_d) is the vector in EE given by (6); the mean of the empty family is zero. Md(x1,…,xd)=1d∑j=1dxj.M_d(x_1,\ldots,x_d)=\frac1d\sum_{j=1}^d x_j.(6) For a positive integer dd and vectors x1,…,xd∈Bx_1,\ldots,x_d\in B, the unit ball mean Md(x1,…,xd)M_d(x_1,\ldots,x_d) is the vector in BB given by (6).

The Claim

Definition 1. Fix a positive integer DD, internal standard dyadic intervals I1,…,IDI_1,\ldots,I_D, and a map f:B→Bf:B\to B. Let TT be a dyadic partition. For every internal standard dyadic interval JJ respected by TT, N(TJ)<N(T).N(T_J)<N(T).(7)✦ The recursive partition coloring pp is a map from dyadic partitions to BB with the following values. If TT respects every IjI_j, then p(T)=f(MD(p(TI1),…,p(TID))).p(T)=f\bigl(M_D(p(T_{I_1}),\ldots,p(T_{I_D}))\bigr).(8)✦ If there is an index jj for which TT does not respect IjI_j, then p(T)=0.p(T)=0.(9)✦ For an index ii, suppose that TT respects IiI_i and every Ii⋅IjI_i\cdot I_j. Then p(TIi)=f(MD(p(TIi⋅I1),…,p(TIi⋅ID))).p(T_{I_i}) =f\bigl(M_D(p(T_{I_i\cdot I_1}),\ldots,p(T_{I_i\cdot I_D}))\bigr).(10)✦

In the paper, the result reads: fix a real Hilbert space HH, its closed unit ball BB, a map f:B→Bf:B\to B, and L,δ>0L,\delta>0 such that ∥f(x)−f(y)∥≤L∥x−y∥\|f(x)-f(y)\|\leq L\|x-y\| and ∥f(x)−x∥≥δ\|f(x)-x\|\geq\delta for all x,y∈Bx,y\in B, choose an integer D≥2D\geq2 with D>4L2/δ2D>4L^2/\delta^2 and internal standard dyadic intervals I1<⋯<IDI_1<\cdots<I_D, where I<JI<J means bI<aJb_I<a_J, and define p(T)=f(D−1∑j=1Dp(TIj))p(T)=f(D^{-1}\sum_{j=1}^D p(T_{I_j})) when TT respects every IjI_j and p(T)=0p(T)=0 otherwise, with proper internal restriction having fewer cells and making the recursion well founded.

What Is Checked

The restriction inequality (7) and the coloring identities (8), (9), and (10) are stated over finite dyadic partitions and their normalized restrictions, with the coloring taking values in the closed unit ball of a real normed vector space, for an arbitrary positive integer DD, a family of DD internal standard dyadic intervals, and a self-map f:B→Bf:B\to B.