2105.00446
HOST-KRA FACTORS FOR ⊕ p∈P Z/pZ ACTIONS AND FINITE DIMENSIONAL NILPOTENT SYSTEMS
Or Shalom
correctmedium confidence
- Category
- math.DS
- Journal tier
- Strong Field
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves that for G = ⊕_{p∈P} Z/pZ and any ergodic system X of order < k+1, there exists m = O_k(1) and an m-extension Y of X that is an inverse limit of finite-dimensional k-step nilpotent homogeneous systems, with precise “moreover” structure via Host–Kra groups (Theorem 2.11) . It also establishes that systems of order < k are inverse limits of finite-dimensional systems with bounded exponent (Theorem 4.3) . The candidate solution reaches the same conclusion via a nilspace-based route, invoking bounded-depth phase polynomials and compact nilspace structure; this is a different argument from the paper’s Host–Kra/Conze–Lesigne approach. The model contains two issues that do not affect the main conclusion: it (i) conflates pulling back along ϕ_m with the paper’s cohomological m-extensions, and (ii) incorrectly asserts the translation group’s connected component is trivial. Neither is relied upon to attain the core theorem. Overall, both establish the same structural result; the paper’s proof is complete and precise, and the model’s proof is largely correct but would need minor corrections and details.
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} strong field
\textbf{Justification:}
The paper proves a natural and significant generalization of the Host–Kra/Ziegler structure theorem to G = ⊕ Z/pZ-actions, establishing that the order-<k+1 factor becomes an inverse limit of finite-dimensional k-step nilpotent homogeneous systems after a bounded-exponent extension. The strategy is well-tailored to the non-finitely generated torsion setting and is technically sophisticated, particularly in the Conze–Lesigne and lifting components (e.g., the structured statement and moreover part of Theorem 2.11 and the finite-dimensional approximation Theorem 4.3). The results are clearly positioned with respect to prior work, and the paper’s structure is logical. Minor clarifications would further improve readability.