OctoInformBeta

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

§2.1 (setting): basic intervals, partitions and normalized restriction: Affine insertion and normalized restriction for finite partitions respecting a dyadic interval

Dyadic subdivisions at a chosen scale.

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

The question is how to pass between a dyadic subdivision of the unit interval and the subdivision inside a dyadic cell.

The Definition

Definition 1. A basic dyadic interval II is a closed subinterval of [0,1][0,1] of the form (1), with left endpoint aIa_I and right endpoint bIb_I: I=Ir,k=[aI,bI],aI=k2−r,bI=(k+1)2−r,r∈ℤ≥0,k∈ℤ,0≤k<2r.\begin{gathered} I=I_{r,k}=[a_I,b_I],\qquad a_I=k2^{-r},\qquad b_I=(k+1)2^{-r},\\ r\in\mathbb Z_{\geq 0},\qquad k\in\mathbb Z,\qquad 0\leq k<2^r. \end{gathered}(1)✦ The interior I∘I^\circ of a basic dyadic interval II is the open interval (2): I∘=(aI,bI).I^\circ=(a_I,b_I).(2)✦ For basic dyadic intervals KK and II, containment K⊆IK\subseteq I is the relation (3): K⊆I⇔aI≤aKandbK≤bI.K\subseteq I\quad\Longleftrightarrow\quad a_I\leq a_K\ \text{and}\ b_K\leq b_I.(3)✦

The affine chart sIs_I of a basic dyadic interval I=Ir,kI=I_{r,k} is the function ℝ→ℝ\mathbb R\to\mathbb R given by (4): sI(x)=k+x2r,x∈ℝ.s_I(x)=\frac{k+x}{2^r},\qquad x\in\mathbb R.(4)✦ For basic dyadic intervals I=Ir,kI=I_{r,k} and J=Is,ℓJ=I_{s,\ell}, their affine composition I⋅JI\cdot J is the interval in (5): I⋅J=Ir+s,k2s+ℓ=sI(J).I\cdot J=I_{r+s,\,k2^s+\ell}=s_I(J).(5)✦

A basic partition TT of [0,1][0,1] is a finite set of basic dyadic intervals whose cells satisfy (6): [0,1]=⋃I∈TI,I∘∩J∘=⌀(I,J∈T,I≠J).[0,1]=\bigcup_{I\in T}I,\qquad I^\circ\cap J^\circ=\varnothing \quad(I,J\in T,\ I\neq J).(6)✦ A basic partition TT respects a basic dyadic interval II when the cells of TT contained in II cover II, as in (7): I=⋃K∈TK⊆IK.I=\bigcup_{\substack{K\in T\\K\subseteq I}}K.(7)✦ For any basic partition TT and basic dyadic interval II, the normalized restriction cells are the finite set of basic dyadic intervals JJ such that I⋅JI\cdot J is a cell of TT.

Let TT be a basic partition and let II be a basic dyadic interval respected by TT. The normalized restriction TIT_I of TT to II is the basic partition whose cells are given by (8): TI={J:J is a basic dyadic interval and I⋅J∈T}.T_I=\{J:J\text{ is a basic dyadic interval and }I\cdot J\in T\}.(8)✦ For a nonnegative integer nn, the cells In,kI_{n,k} of depth nn are the basic dyadic intervals with first index nn, and the uniform partition T(n)T^{(n)} of [0,1][0,1] is the basic partition consisting of these cells, as in (9): T(n)={In,k:k∈ℤ,0≤k<2n}.T^{(n)}=\{I_{n,k}:k\in\mathbb Z,\ 0\leq k<2^n\}.(9)✦

In the paper, the result reads: a basic dyadic interval is Ir,k=[k2−r,(k+1)2−r]I_{r,k}=[k2^{-r},(k+1)2^{-r}], with integers r≥0r\geq0 and 0≤k<2r0\leq k<2^r; a basic partition is a finite cover of [0,1][0,1] by such intervals with disjoint interiors and respects II when II is a union of its cells; with sI:[0,1]→Is_I:[0,1]\to I the increasing affine chart, one sets I⋅J=sI(J)I\cdot J=s_I(J) and TI={sI−1(K):K∈T,K⊆I}T_I=\{s_I^{-1}(K):K\in T,\ K\subseteq I\} whenever TT respects II; the uniform partition T(n)T^{(n)} has cell length 2−n2^{-n}.

What Is Checked

The definitions concern closed dyadic cells in [0,1][0,1] and finite partitions of that interval; normalized restriction is stated for a partition TT and a basic interval II that TT respects. At every depth nn, different indices give different cells✦. A basic dyadic interval KK is contained in a basic dyadic interval II exactly when K=I⋅JK=I\cdot J for some basic dyadic interval JJ.