1 · The essentials
Imagine repeatedly applying a rule to a system whose outcomes have assigned probabilities. The rule is reversible and keeps those probabilities unchanged. It is called mixing if observations made far enough apart become nearly independent: knowing one tells you less and less about the other. The main result says that this two-observation property also holds for any fixed finite number of observations. The requirement is that every pair of observation times becomes increasingly far apart. The manuscript presents this as an affirmative answer to Rokhlin’s multiple-mixing problem for a single transformation. The main result has a Lean formalization, although the supplied material does not specify its detailed scope.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, picture taking snapshots of the same evolving scene at widely separated times. The result says that, under its assumptions, if pairs of snapshots become unrelated in the relevant probability sense, then any fixed finite collection does too—as long as no pair of snapshots stays close in time.
Why it matters
The result connects a condition involving two observations with a condition involving any finite number. For the transformations covered here, separate assumptions about three, four, or more observations are therefore unnecessary. The manuscript identifies this implication as the affirmative resolution of Rokhlin’s multiple-mixing problem for one transformation.
2 · Going further
The problem concerns a single invertible, probability-preserving transformation that is mixing. In probability notation, two-fold mixing means that as the time separation grows, for measurable sets and . The stated result extends this to every fixed finite collection : whenever all pairwise separations tend to infinity for . This is the meaning of mixing of all finite orders in the repository summary.
The main abstract states that every invertible mixing probability-preserving transformation has this property and identifies the conclusion as an affirmative answer to Rokhlin’s problem for a single transformation. It does not describe the argument, so no mechanism or intermediate steps can be extracted from the supplied text. Only one manuscript is supplied; there are no companion abstracts here to compare. The main result has a Lean formalization, but the provided information does not describe its precise coverage.
Useful notions
- Probabilities of events
- Independence of observations
- Repeated application of a reversible rule
- Limits as time separations grow
What was known before / what is new
Before
The source identifies Rokhlin’s multiple-mixing problem for a single transformation as the question being answered. It supplies no account of earlier partial results, methods, or historical development.
New
The manuscript states that mixing implies mixing of every finite order for an invertible probability-preserving transformation. The repository summary spells out the conclusion as convergence of finite joint correlations to products of probabilities whenever every pairwise time separation diverges.
Limits and assumptions
The statement assumes a single transformation that is invertible, probability-preserving, and mixing. It concerns each fixed finite collection of measurable sets and requires every pairwise time separation to diverge; it does not state a result about infinitely many observations or give a rate of convergence. The main result has a Lean formalization, but its detailed scope is not supplied. The provided abstract gives no argument and identifies no remaining open questions.
Mini glossary
- Invertible transformation —
- A rule for changing the state of a system that can be reversed.
- Probability-preserving transformation —
- A transformation that leaves the probabilities assigned to events unchanged.
- Measurable set —
- An event to which the system’s probability measure assigns a probability.
- Mixing —
- The property that joint probabilities for two events approach the product of their probabilities as their time separation grows.
- Mixing of all finite orders —
- The corresponding product-limit property for every fixed finite collection of events when every pair of observation times separates without bound.
Keywords : Mixing · Multiple mixing · Rokhlin’s problem
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
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.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Rokhlin's multiple-mixing problem for one transformation
23/09/2026Every 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.