Dynamical systems and ergodic theory·OpenAI Math·Result 145·Lean formalisation listed
Rokhlin’s multiple-mixing problem
One of the 372 results in OpenAI's public mathematics catalogue, filed under dynamical systems and ergodic theory: 1 preprint, the latest dated 23 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
Rokhlin's multiple-mixing problem for one transformation
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Proves that every invertible mixing probability-preserving transformation is mixing of all finite orders, resolving Rokhlin's multiple-mixing problem for a single transformation. Correlations among any finite collection of measurable sets converge to the product of their measures whenever all pairwise time separations diverge. (Lean)
Paper
Rokhlin's multiple-mixing problem for one transformation
Every invertible mixing probability-preserving transformation is mixing of every finite order. Thus Rokhlin's multiple-mixing problem for a single transformation has an affirmative answer.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Dynamical systems and ergodic theory
- 146Positive metric entropy for the standard mapLean
- 147The near-boundary Birkhoff conjecture
- 148The entropy-rate dimension formula for self-similar measuresLean
- 149Classwise permanence for weakly reversible mass-action systemsLean
- 150Weak mixing of triangular billiards with an irrational angleVideoLean
- 151A C1 counterexample to the entropy conjectureLean
