2203.12017
A Rokhlin Lemma for Noninvertible Totally-Ordered Measure-Preserving Dynamical Systems
Adam Erickson
correctmedium confidence
- Category
- Not specified
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves a Rokhlin lemma for nigh aperiodic shuffleable systems by a self-contained argument that does not assume standardness; it builds n-chains using a pseudometric tied to the order-generated σ-algebra, applies Zorn’s lemma to obtain a maximal m-chain, and then constructs an n-chain covering ≥1−ε of the space (Theorem 9) . The candidate solution reduces “nigh aperiodic” to aperiodic (which is fine) but then applies Avila–Candela’s towers theorem, which requires a standard probability space; shuffleable systems need not be standard or complete, as the paper explicitly discusses and illustrates with pathologies (Definition 5; Example and discussion; completed shuffleable systems; Proposition 16) . Thus, the model’s Step 2 invokes a result outside its domain of validity and does not ensure the base set E lies in the original F(<).
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions \textbf{Journal Tier:} specialist/solid \textbf{Justification:} The result is a thoughtful extension of Rokhlin’s lemma to a nonstandard measurable setting motivated by order-generated σ-algebras. The proof is rigorous and self-contained, importing only standard tools (distribution functions, Zorn’s lemma, tower layering). The connections section situates the work relative to Heinemann–Schmitt and Avila–Candela appropriately. Minor clarifications would strengthen the exposition at technical junctures.