A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Rokhlin's multiple-mixing problem
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Snaky <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:things that move forever Levels:1
Category:Dynamical systems and ergodic theory Lean version:YES! ✔
Rate this game! 4.2 out of 5 (255 votes)

>>> How to Play <<<
Rokhlin’s multiple-mixing problem. 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.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 15 lemmas · 24 proofs · 18,236 words  |  PLAY LEVEL 1 »  (pdf)
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.

More Dynamical systems and ergodic theory Games!
Sinai's positive-entropy conjecture for the standard mapThe near-boundary Birkhoff conjectureThe dimension formula for self-similar measures on the linePermanence for weakly reversible reaction networks
Weak mixing of irrational triangular billiardsA $C^1$ counterexample to Shub’s entropy conjectureZero entropy does not guarantee a smooth positive-volume modelArithmetic classification of Bernoulli convolutions

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games