OctoInform Beta

OpenAI preprint, September 2026 · §1. Introduction · §1

§1 (setting): mixing and mixing of order k: μ(A∩T−nB)→μ(A)μ(B)\mu(A \cap T^{-n}B) \to \mu(A)\mu(B) as |n|→∞|n| \to \infty, and for kk sets the intersection’s measure tends to the product as all time gaps grow

Mixing and mixing of order kk of an invertible transformation.

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 powers of an invertible transformation of a measure space move events forward and back in time. The question is whether events far apart in time become independent in the limit, either two events at a large time distance or kk events whose consecutive times are all far apart. Rokhlin’s multiple-mixing problem asks whether the first kind of independence forces the second for every kk.

The Definition

Definition 1. Let μ\mu be a measure on a measurable space Ω\Omega, and let TT be a bijection of Ω\Omega that is measurable with a measurable inverse.

For an integer nn, the power TnT^n is the nn-th power of TT in the group of bijections of Ω\Omega: Tn={T∘⋯∘T(n factors),n>0,idΩ,n=0,T−1∘⋯∘T−1(|n| factors),n<0.T^{n} = \begin{cases} T \circ \cdots \circ T \quad (n \text{ factors}), & n > 0,\\ \mathrm{id}_{\Omega}, & n = 0,\\ T^{-1} \circ \cdots \circ T^{-1} \quad (|n| \text{ factors}), & n < 0. \end{cases}(1)✦

The transformation TT is mixing for μ\mu if, for all measurable sets A,B⊆ΩA, B \subseteq \Omega, μ(A∩T−nB)→μ(A)μ(B)as |n|→∞ through ℤ.\mu(A \cap T^{-n}B) \longrightarrow \mu(A)\,\mu(B) \qquad \text{as } |n| \to \infty \text{ through } \mathbb{Z}.(2)✦

For a natural number kk, the layout times of positive integer gaps n1,…,nk−1n_1, \dots, n_{k-1} are the natural numbers t1,…,tkt_1, \dots, t_k given by t1=0,ti=n1+n2+⋯+ni−1(2≤i≤k).t_1 = 0, \qquad t_i = n_1 + n_2 + \cdots + n_{i-1} \quad (2 \le i \le k).(3)✦

The transformation TT is mixing of order kk for μ\mu if, for all measurable sets A1,…,Ak⊆ΩA_1, \dots, A_k \subseteq \Omega, μ(⋂i=1kT−tiAi)→∏i=1kμ(Ai)as min⁡{n1,…,nk−1}→∞,\mu\Bigl(\bigcap_{i=1}^{k} T^{-t_i} A_i\Bigr) \longrightarrow \prod_{i=1}^{k} \mu(A_i) \qquad \text{as } \min\{n_1, \dots, n_{k-1}\} \to \infty,(4)✦ where t1,…,tkt_1, \dots, t_k are the layout times of the gaps n1,…,nk−1n_1, \dots, n_{k-1}.

In the paper, the result reads: an invertible measurable transformation TT with measurable inverse preserving the probability μ\mu is mixing when μ(A∩T−nB)→μ(A)μ(B)\mu(A \cap T^{-n}B) \to \mu(A)\mu(B) as |n|→∞|n| \to \infty, and mixing of order kk when the measure of the translated intersection A1∩T−t2A2∩⋯∩T−tkAkA_1 \cap T^{-t_2}A_2 \cap \cdots \cap T^{-t_k}A_k tends to μ(A1)⋯μ(Ak)\mu(A_1)\cdots\mu(A_k) along layouts whose least consecutive gap tends to infinity.

What Is Checked

The definitions are stated over an arbitrary measure μ\mu on a measurable space Ω\Omega and a measurable bijection TT of Ω\Omega with measurable inverse, through the integer powers of TT in (1) and, for mixing of order kk, the layout times of k−1k-1 positive gaps in (3).