2010.04035
ON DYNAMICAL FINITENESS PROPERTIES OF ALGEBRAIC GROUP SHIFTS
Xuan Kien Phung
correctmedium confidence
- Category
- math.DS
- Journal tier
- Strong Field
- Processed
- Sep 28, 2025, 12:55 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves that for polycyclic-by-finite G, every descending chain of algebraic group subshifts in V^G stabilizes (Theorem 1.3) and that, for countable G, this DCC is equivalent to every algebraic group subshift being of finite type (Proposition 6.1), yielding Theorem 1.6 that every algebraic group subshift is of finite type . The candidate reproduces the same strategy: define the descending chain of finite-type over-approximations Σ[V^G; D, Σ_D], invoke DCC for polycyclic-by-finite groups, and conclude stabilization at a finite window, hence finite type. This mirrors the paper’s construction used in the proof of Proposition 6.1 (see the chain Σ_n := Σ(V^G; E_n, Σ_{E_n}) with Σ = ⋂_n Σ_n) .
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} strong field
\textbf{Justification:}
The paper rigorously generalizes finiteness properties from compact Lie alphabets to algebraic group alphabets, establishing DCC for algebraic group subshifts over polycyclic-by-finite groups and the equivalence of DCC with finite-typeness for countable universes. The core arguments (inverse limits of finite restrictions and stabilization of window-approximations) are sound and clearly organized. Minor clarifications—especially around countability assumptions and the inverse-limit step equating Σ with the intersection of its finite-window constraints—would aid readability, but do not affect correctness. The candidate solution mirrors the paper’s method closely and is correct.