OctoInformBeta

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

§2.1 (displayed): composition of restrictions, equation (2.1): Basic dyadic intervals II and JJ give successive coordinate restrictions of partitions respecting II and their affine composition I⋅JI\cdot J

Normalized restrictions compose through affine charts.

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

A dyadic subdivision within an interval uses coordinates normalized to [0,1][0,1]. Choosing another interval in those coordinates gives two scales at which to restrict a partition.

A basic dyadic interval II is a closed cell in [0,1][0,1] specified by a depth n∈ℕn\in\mathbb N and an integer index 0≤k<2n0\leq k<2^n, with endpoints and open interior as in (1): ℓ(I)=k2n,r(I)=k+12n,I=[ℓ(I),r(I)],I∘=(ℓ(I),r(I)).\ell(I)=\frac{k}{2^n},\qquad r(I)=\frac{k+1}{2^n},\qquad I=[\ell(I),r(I)],\qquad I^\circ=(\ell(I),r(I)).(1) For basic dyadic intervals KK and II, containment means the endpoint condition in (2): K⊆I⇔ℓ(I)≤ℓ(K) and r(K)≤r(I).K\subseteq I \quad\Longleftrightarrow\quad \ell(I)\leq\ell(K)\ \text{ and }\ r(K)\leq r(I).(2)✦

The affine chart sI:ℝ→ℝs_I:\mathbb R\to\mathbb R of an interval II of depth nn and index kk is the map defined by (3): sI(x)=k+x2n.s_I(x)=\frac{k+x}{2^n}.(3)✦ For basic dyadic intervals II of depth nn and index kk and JJ of depth mm and index jj, the affine interval composition I⋅JI\cdot J is the basic dyadic interval in (4): I⋅J=sI(J)=[k2m+j2n+m,k2m+j+12n+m].I\cdot J=s_I(J) =\left[ \frac{k2^m+j}{2^{n+m}}, \frac{k2^m+j+1}{2^{n+m}} \right].(4)

A basic dyadic partition TT is a finite set of basic dyadic intervals whose closed cells cover [0,1][0,1] and whose distinct cells have disjoint open interiors.✦ A basic dyadic partition TT respects a basic dyadic interval II if its cells contained in II cover II, as expressed by (5): I=⋃K∈TK⊆IK.I=\bigcup_{\substack{K\in T\\K\subseteq I}}K.(5)✦ The normalized restriction TIT_I of a basic dyadic partition TT respecting II is the basic dyadic partition whose cells are specified by (6). TI={K:K is a basic dyadic interval and I⋅K∈T}.T_I=\{K: K\text{ is a basic dyadic interval and }I\cdot K\in T\}.(6) For any basic dyadic partition TT and basic dyadic interval II, the normalized restriction cells are the basic dyadic intervals KK for which I·KI·K is a cell of TT.

The Claim

Theorem 1. Let II and JJ be basic dyadic intervals. For every x∈ℝx\in\mathbb R, sI⋅J(x)=sI(sJ(x)).s_{I\cdot J}(x)=s_I\bigl(s_J(x)\bigr).(7)✦ Let TT be a basic dyadic partition that respects both II and I⋅JI\cdot J. Then TI respects J,T_I\text{ respects }J,(8)✦ and (TI)J=TI⋅J.(T_I)_J=T_{I\cdot J}.(9)✦

What Is Checked

The chart identity (7) is stated over basic dyadic intervals; (8) and (9) concern finite basic dyadic partitions respecting II and I⋅JI\cdot J.

For basic dyadic intervals KK and II, KK is contained in II exactly when K=I⋅JK=I\cdot J for some basic dyadic interval JJ.