OctoInform Beta

OpenAI preprint, September 2026 · §3. Ordered arrays and conditional locality · §3.1

§3.1 (setting): the initial array laws ρ_n: Laws ρn\rho_n on XInX^{I^n}, invariant, consistent, with independent proper plane families; ultralimits from an invariant μ\mu along properly mixing layouts give them

Initial array laws and their construction by weak ultralimits.

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

Let TT be a measurable automorphism of a standard Borel space XX and let II be a finite set. The item is about probability laws on arrays of points of XX indexed by words in II: for each n≥0n\ge0, a law ρn\rho_n on the set XInX^{I^n} of arrays indexed by the words of length nn in II. A word of length one is a letter, so an array of that length is a tuple (yi)i∈I(y_i)_{i\in I}, and the laws asked for make ρ1\rho_1 a self-joining of order |I||I| of the system (X,ρ0,T)(X,\rho_0,T) in which every proper subfamily (yj)j∈J(y_j)_{j\in J} is independent.

The library defines such families of laws and builds one on a compact metrizable space by weak ultralimits of the laws of orbit tuples (Td(i)x)i∈I(T^{d(i)}x)_{i\in I} of a point xx of the space, for maps d:I→ℕd\colon I\to\mathbb N called layouts, carrying a lower bound on the correlations along these tuples over to ρ1\rho_1.

Arrays and Planes

For n≥0n\ge0, InI^n is the set of words v=(v0,…,vn−1)v=(v_0,\dots,v_{n-1}) of length nn in II.✦ An array of level nn over a set YY is a map y:In→Yy\colon I^n\to Y, and YInY^{I^n} is the set of these arrays, with the product topology or the product σ\sigma-algebra when YY is a topological or a measurable space.✦ The only word of length zero is the empty word, so XI0X^{I^0} is identified with XX.✦ A map f:Y→Zf\colon Y\to Z acts on arrays entrywise, through f(n):YIn→ZInf^{(n)}\colon Y^{I^n}\to Z^{I^n}, (f(n)y)(v)=f(y(v))(f^{(n)}y)(v)=f(y(v)).✦

For an axis a∈{0,…,n}a\in\{0,\dots,n\} and a slot i∈Ii\in I, the plane restriction πa,i:YIn+1→YIn\pi_{a,i}\colon Y^{I^{n+1}}\to Y^{I^n} fixes axis aa of an array at slot ii: (πa,iy)(v0,…,vn−1)=y(v0,…,va−1,i,va,…,vn−1).(\pi_{a,i}y)(v_0,\dots,v_{n-1})=y(v_0,\dots,v_{a-1},i,v_a,\dots,v_{n-1}).(1)✦ For a subset JJ of II, the family of last-axis planes indexed by JJ is the map πJ:YIn+1→(YIn)J\pi_J\colon Y^{I^{n+1}}\to(Y^{I^n})^J, πJy=(πn,jy)j∈J\pi_Jy=(\pi_{n,j}y)_{j\in J}.✦

The Ultralimit Construction

In the construction, XX is a compact metrizable space, TT a homeomorphism of XX and μ\mu a Borel probability measure on XX. The duplication map Dd:XIn→XIn+1D_d\colon X^{I^n}\to X^{I^{n+1}} of a layout dd is the map that adds a new first axis, whose slot ii holds the array moved by Td(i)T^{d(i)}: (Ddy)(v0,v1,…,vn)=Td(v0)(y(v1,…,vn)).(D_dy)(v_0,v_1,\dots,v_n)=T^{d(v_0)}\bigl(y(v_1,\dots,v_n)\bigr).(2)✦

Given a sequence of layouts (db)b∈ℕ(d_b)_{b\in\mathbb N} and an ultrafilter 𝒰\mathcal U on ℕ\mathbb N, the weak array laws are the probability measures ρn𝒰\rho^{\mathcal U}_n on XInX^{I^n} given by ρ0𝒰=μ,ρn+1𝒰=limb→𝒰(Ddb)*ρn𝒰,\rho^{\mathcal U}_0=\mu,\qquad \rho^{\mathcal U}_{n+1}=\lim_{b\to\mathcal U}\,(D_{d_b})_*\rho^{\mathcal U}_n,(3)✦ with the limit along 𝒰\mathcal U taken in the weak topology on probability measures on XIn+1X^{I^{n+1}}.

For a layout dd and a subset JJ of II, the measure νdJ=(πJ∘Dd)*μ\nu^J_d=(\pi_J\circ D_d)_*\mu on XJX^J is the law of the tuple (Td(j)x)j∈J(T^{d(j)}x)_{j\in J} when xx has law μ\mu.

The layouts dbd_b are properly mixing for μ\mu when, for every proper subset JJ of II and all Borel sets sj⊆Xs_j\subseteq X, j∈Jj\in J, limb→∞μ(⋂j∈JT−db(j)sj)=∏j∈Jμ(sj).\lim_{b\to\infty}\mu\Bigl(\bigcap_{j\in J}T^{-d_b(j)}s_j\Bigr)=\prod_{j\in J}\mu(s_j).(4)

Let 𝒰∞\mathcal U_\infty be a fixed ultrafilter on ℕ\mathbb N that contains every cofinite set.

The Claim

Definition 1. Let XX be a nonempty standard Borel space, TT a measurable automorphism of XX and II a finite set. A family of initial laws for XX and TT is a sequence (ρn)n≥0(\rho_n)_{n\ge0} of probability measures, ρn\rho_n on XInX^{I^n}, invariant under the entrywise action of TT, consistent under every plane restriction (1), and with the last-axis planes at the slots of any proper subset of II independent: for every n≥0n\ge0, every axis a∈{0,…,n}a\in\{0,\dots,n\}, every slot i∈Ii\in I and every proper subset JJ of II, (T(n))*ρn=ρn,(πa,i)*ρn+1=ρn,(πJ)*ρn+1=⨂j∈Jρn.\begin{aligned} (T^{(n)})_*\rho_n&=\rho_n,\\ (\pi_{a,i})_*\rho_{n+1}&=\rho_n,\\ (\pi_J)_*\rho_{n+1}&=\textstyle\bigotimes_{j\in J}\rho_n. \end{aligned}(5)✦

Theorem 1. Let XX be a compact metrizable space, TT a homeomorphism of XX, μ\mu a Borel probability measure on XX, (db)b∈ℕ(d_b)_{b\in\mathbb N} a sequence of layouts and 𝒰\mathcal U an ultrafilter on ℕ\mathbb N, with the weak array laws ρn𝒰\rho^{\mathcal U}_n of (3).

  1. If μ\mu is TT-invariant, then for every n≥0n\ge0 (T(n))*ρn𝒰=ρn𝒰,(T^{(n)})_*\rho^{\mathcal U}_n=\rho^{\mathcal U}_n,(6)✦ and for every axis a∈{0,…,n}a\in\{0,\dots,n\} and every slot i∈Ii\in I (πa,i)*ρn+1𝒰=ρn𝒰.(\pi_{a,i})_*\rho^{\mathcal U}_{n+1}=\rho^{\mathcal U}_n.(7)✦

  2. If νdbJ→μ⊗J\nu^J_{d_b}\to\mu^{\otimes J} weakly as b→𝒰b\to\mathcal U for every proper subset JJ of II, then for every n≥0n\ge0 and every proper subset JJ of II (πJ)*ρn+1𝒰=⨂j∈Jρn𝒰.(\pi_J)_*\rho^{\mathcal U}_{n+1}=\textstyle\bigotimes_{j\in J}\rho^{\mathcal U}_n.(8)✦

  3. If the layouts are properly mixing (4), then for every proper subset JJ of II limb→𝒰∞νdbJ=μ⊗J\lim_{b\to\mathcal U_\infty}\nu^J_{d_b}=\mu^{\otimes J}(9)✦ in the weak topology, and if moreover μ\mu is TT-invariant, the laws ρn𝒰∞\rho^{\mathcal U_\infty}_n form a family of initial laws for XX and TT, the weak initial laws.✦

  4. If μ\mu is TT-invariant, the layouts are properly mixing, fif_i for i∈Ii\in I are continuous real functions on XX and δ\delta is a real number with δ≤∫X∏i∈Ifi(Tdb(i)x)dμ(x)\delta\le\int_X\prod_{i\in I}f_i(T^{d_b(i)}x)\,d\mu(x) for every bb, then ∫XI∏i∈Ifi(yi)dρ1𝒰∞(y)≥δ.\int_{X^I}\prod_{i\in I}f_i(y_i)\,d\rho^{\mathcal U_\infty}_1(y)\ge\delta.(10)✦

In the paper, the result reads: there are laws ρn\rho_n on XInX^{I^n}, built by iterated ultralimits along the layouts that witness the lower bound δ\delta for the functions fif_i, with ρ0=μ\rho_0=\mu, each ρn\rho_n invariant under the simultaneous action of TT, ρn−1\rho_{n-1} the law obtained from ρn\rho_n by fixing one axis, every proper family of last-axis planes independent, and the bound ∫∏i∈Ifi(xi)dρ1(x)≥δ\int\prod_{i\in I}f_i(x_i)\,d\rho_1(x)\ge\delta for the witness.

What Is Checked

The definition (5) is stated over a nonempty standard Borel space XX with a measurable automorphism TT, a finite set II, the arrays XInX^{I^n}, the entrywise action T(n)T^{(n)}, the plane restrictions πa,i\pi_{a,i}, the families πJ\pi_J of last-axis planes and product measures. The theorem, (6) to (10), is stated over a compact metrizable space XX with a homeomorphism TT and a Borel probability measure μ\mu, a sequence of layouts with their duplication maps (2), the weak array laws (3) along an ultrafilter and along 𝒰∞\mathcal U_\infty, proper mixing (4), and the identification of arrays of level zero with points of XX.

The library also proves that, for the product topologies on arrays, the entrywise action of a continuous map from XX to a topological space YY is continuous from arrays over XX to arrays over YY, and that the plane restrictions, the families of last-axis planes and the duplication maps, the last for a homeomorphism TT of XX, are continuous on arrays over XX.