OctoInformBeta

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

Lemma 2.2: A single element of Thompson’s group FF carries both basic dyadic intervals to their prescribed targets

Separated internal pairs admit affine transport.

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 unit interval [0,1][0,1] is the closed real interval with endpoints 00 and 11.✦ An interval homeomorphism ff is a homeomorphism of [0,1][0,1] onto itself.✦ The question concerns affine restrictions of one such map on two separated closed cells.

A dyadic rational xx is a real number of the form (1), with k∈ℤk\in\mathbb Z and n∈ℕn\in\mathbb N: x=k2n.x=\frac{k}{2^n}.(1)✦

A dyadic affine decomposition DD of an interval homeomorphism ff is a finite subdivision 0=a0<⋯<am=10=a_0<\cdots<a_m=1, with m≥1m\geq1 and all aia_i dyadic, together with integers e0,…,em−1e_0,\ldots,e_{m-1} for which (2) holds on each closed cell: f(x)=f(ai)+2ei(x−ai)(0≤i<m,ai≤x≤ai+1).f(x)=f(a_i)+2^{e_i}(x-a_i) \qquad (0\leq i<m,\ a_i\leq x\leq a_{i+1}).(2)✦

An interval homeomorphism ff has dyadic piecewise linearity if it admits a dyadic affine decomposition.✦ Thompson’s group FF consists of the strictly increasing interval homeomorphisms with dyadic piecewise linearity.

For n∈ℕn\in\mathbb N and an integer kk with 0≤k<2n0\leq k<2^n, a basic dyadic interval I=In,kI=I_{n,k} is the closed cell in (3).✦ Its left and right endpoints are denoted by ℓ(I)\ell(I) and r(I)r(I): In,k=[ℓ(In,k),r(In,k)]=[k2n,k+12n].I_{n,k}=[\ell(I_{n,k}),r(I_{n,k})] =\left[\frac{k}{2^n},\frac{k+1}{2^n}\right].(3)

A basic dyadic interval II is internal if its endpoints satisfy (4): 0<ℓ(I),r(I)<1.0<\ell(I),\qquad r(I)<1.(4)✦

For basic dyadic intervals II and JJ, the notation I<JI<J means strict separation by a positive gap, as in (5): I<J⇔r(I)<ℓ(J).I<J\quad\Longleftrightarrow\quad r(I)<\ell(J).(5)✦

For a basic dyadic interval I=In,kI=I_{n,k}, its affine chart sI:ℝ→ℝs_I:\mathbb R\to\mathbb R is defined by (6); its restriction to [0,1][0,1] is also a map from the unit interval to itself: sI(x)=k+x2n(x∈ℝ).s_I(x)=\frac{k+x}{2^n}\qquad(x\in\mathbb R).(6) An element h∈Fh\in F carries a basic dyadic interval II affinely onto a basic dyadic interval JJ if (7) holds: h(sI(x))=sJ(x)(x∈[0,1]).h(s_I(x))=s_J(x)\qquad(x\in[0,1]).(7)✦

The Claim

Theorem 1 (Affine transport of pairs). Let I,J,I′,J′I,J,I',J' be internal basic dyadic intervals with I<JI<J and I′<J′I'<J'. There is an element h∈Fh\in F satisfying the two affine restrictions in (8): h(sI(x))=sI′(x),h(sJ(x))=sJ′(x)(x∈[0,1]).h(s_I(x))=s_{I'}(x),\qquad h(s_J(x))=s_{J'}(x) \qquad(x\in[0,1]).(8)✦

In the paper, the result reads: if two pairs of internal basic intervals satisfy I<JI<J and I′<J′I'<J', there is h∈Fh\in F carrying II affinely onto I′I' and JJ affinely onto J′J'.

What Is Checked

The claim is stated over Thompson’s group FF, with affine transport defined through interval charts and internality and separation defined by the endpoints of basic dyadic intervals.