Back to search
2006.15348

Simple Toeplitz subshifts: combinatorial properties and uniformity of cocycles

Daniel Sell

correcthigh confidence
Category
math.DS
Journal tier
Strong Field
Processed
Sep 28, 2025, 12:55 AM

Audit review

The paper proves that every locally constant SL(2,R) cocycle over an (LSC) subshift is uniform (Theorem 5.44) via a careful split into the cases c=0 and c>0, using (i) a uniform upper bound when c=0 and (ii) a uniform positive lower bound combined with Lenz’s criterion when c>0. This argument is complete and grounded in Ruelle’s theorem, Lenz’s characterization, and earlier consequences of (LSC) such as minimality and unique ergodicity. By contrast, the model’s solution hinges on an unproven "two-cut" concatenation inequality for 2×2 products that is neither stated nor derived in the provided paper; deriving such a uniform quasi-multiplicativity from (LSC γ) alone is nontrivial and, as stated, lacks justification. Hence the paper is correct, while the model relies on a critical, unsupported step.

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} strong field

\textbf{Justification:}

The chapter delivers a clear, correct, and useful criterion (LSC) implying uniformity of locally constant SL(2,R) cocycles, unifying known results for Sturmian systems and extending them to simple Toeplitz subshifts. The proof combines standard ergodic cocycle tools (Ruelle, Lenz) with original combinatorial structure (leading sequences). Minor clarifications about the treatment of the case c=0 and explicit reminders where minimality/unique ergodicity are invoked would further enhance readability. Overall, the result is solid and significant.