Analysis · Oct 6, 2026
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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model