Sensitive group actions on regular curves of almost ≤ n order

The paper’s Theorem 1.2 states exactly the goal: for a sensitive action on a regular curve of almost ≤ n order, a free noncommutative subsemigroup exists and geometric entropy is positive; hence G is not nilpotent. The proof proceeds by (i) extracting a transitive open subsystem (Proposition 4.2), (ii) a compactness/nesting lemma for connected open sets with uniformly bounded boundary (Lemma 3.1 and Proposition 3.2), and (iii) building a semi ping–pong in Section 5 to obtain both the free subsemigroup and positive geometric entropy (using the definition of entropy in §2.2). The candidate solution follows the same backbone and reaches the same conclusions via a ping–pong construction and a standard entropy-coding argument. Minor issues in the model include a slight misstatement of Proposition 3.2’s hypotheses and a notational slip (W0 ⊃ W) plus an unnecessary claim of pairwise disjointness for A− and B−; these do not affect correctness after routine fixes. On the paper’s side, the abstract and usage in Section 5 indicate the open sets with finite boundary can be chosen connected (needed to apply Proposition 3.2), and the steps are coherent. Overall, both are correct and substantially the same proof in structure (semi ping–pong leading to free subsemigroup and positive geometric entropy). Key touchpoints are the statement of the main theorem (Theorem 1.2), the entropy setup (§2.2), the transitive open subsystem (Proposition 4.2), the nesting lemma (Proposition 3.2), and the final semi ping–pong construction (Section 5) .