Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: Family 145. Rokhlin's multiple-mixing problem
Family claims › Dynamical systems and ergodic theory · lines 1038–1043
OpenAI@2026-10-07#rem:oai-145
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.
The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- remark: Remark: Family 143. Uniform limit-cycle bounds in Hilbert's sixteenth problem
- remark: Remark: Family 144. Banach's simple Lebesgue-spectrum problem
- remark: Remark: Family 146. Sinai's positive-entropy conjecture for the standard map
- remark: Remark: Family 147. The near-boundary Birkhoff conjecture
- remark: Remark: Family 148. The dimension formula for self-similar measures on the line
- remark: Remark: Family 149. Permanence for weakly reversible reaction networks
- remark: Remark: Family 150. Weak mixing of irrational triangular billiards
- remark: Remark: Family 151. A C 1 counterexample to Shub’s entropy conjecture