Pith. sign in

REVIEW 1 major objections 6 minor 20 references

Limit Sets and Internal Transitivity in Free Group Actions

T0 review · 1 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper shows that, for free group and monoid actions with a shadowing property, directional limit sets coincide exactly with a new class of consistently internally chain transitive sets.

desk verdict Solid SFT characterizations, but the shadowing theorems overclaim exact equality without proving W_w is closed—a real gap that a referee should catch. read the letter →

arxiv 1908.07382 v1 pith:3RQAH2O4 submitted 2019-08-20 math.DS

Kyle Binder , Jonathan Meddaugh This is my paper · ORCID
classification math.DS MSC 37B5037B1037B2054H20
keywords freegroupactionsomega-limitsetsinternalchaintransitivityconsistentshadowingpropertyshiftsoffinitetypeblockHausdorfftopology
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

For ordinary dynamical systems, the $\omega$-limit sets of a point are known to be internally chain transitive, and under shadowing the converse holds up to Hausdorff closure. This paper transplants that program to actions of finitely generated free groups and free monoids on compact metric spaces, where there is no single 'future' and hence many candidate limit sets. The authors define several directional limit sets — the set $\omega(x)$ of all limit behaviors, the set $\omega_w(x)$ of behaviors along a fixed infinite reduced word $w$, and the looser set $\omega_w^F(x)$ — and introduce matching internal transitivity notions, most notably consistent internal chain transitivity ($\mathrm{CICT}$). Their central result is that, for shifts of finite type and for actions with the shadowing property, the class of directional limit sets $\omega_w$ is exactly the class of $\mathrm{CICT}$ sets; analogous equalities hold for $\omega_w^F$ with a block-transitivity condition. If correct, this gives a purely combinatorial handle on which closed sets can arise as limit behavior along a prescribed direction, mirroring the classical theorem for $\mathbb{Z}$-actions.

What carries the argument

The load-bearing mechanism is the consistency condition embedded in $\mathrm{CICT}$ together with a word-building construction. Given a closed set $Y$ in $\mathrm{CICT}$, each point carries a pair $(i(x), t(x))$ of generator letters that control how chains enter and leave $x$. The proof covers $Y$ with finitely many points, strings together $\varepsilon$-chains between successive cover points (respecting the entry/exit letters), and concatenates the indexing words to form an infinite reduced word $w$. Under shadowing, the resulting chain data define a pseudo-orbit that is shadowed by some point $x$; the limits along the prefixes of $w$ then reconstruct exactly the points of $Y$. A separate block-transitivity notion ($IBT^*$, $IBT^\circ$) plays the same role for the less directed limit sets $\omega_w^F$, using pseudo-orbits indexed by arbitrary group elements rather than chains.

What would settle it

Look for a compact metric space with a free group action that has the shadowing property, and a sequence of directional limit sets whose limit is not a directional limit set; finding one refutes the equality, while proving the collection is always closed would confirm it.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is two-fold. First, plain internal chain transitivity is too weak in the free group case: the paper exhibits a shift space subset that is internally chain transitive yet is not any $\omega_w$-limit set (Example 4.8). The missing ingredient is a directional consistency: for each point $x$ in the set one must be able to choose an entry letter $i(x)$ and an exit letter $t(x)$ with $i(x) \neq t(x)^{-1}$, so that chains between any two points start with the first point's entry letter and end with the second's exit letter. Second, with this 'consistent' version in hand, the full correspondence holds: Corollary 4.14 states that for a shift of finite type over $G$, $W_w = \mathrm{CICT}$, and Theorem 5.6 states that for any $G$-action with $G$-shadowing, $W_w = \mathrm{CICT}$. The paper also establishes that a shift space over a free group/monoid has the shadowing property exactly when it is a shift of finite type, and it obtains analogue characterizations of the coarser limit sets $\omega_w^F$ by internally block transitive sets with a final point (variants $IBT^*$ and $IBT^\circ$).

Load-bearing premise

The argument assumes that a limit of directional limit sets is again a directional limit set, but the paper never proves that the collection of such sets is closed under taking limits; if this fails, the shadowing theorem only shows containment in the closure.

Editorial extensions

If this is right

  • In any shift of finite type over a free group, a closed set is a directional limit set if and only if it satisfies the finite combinatorial condition $\mathrm{CICT}$, so the class of limit sets can be decided without constructing the word or point.
  • For actions with the shadowing property, the equality $\mathrm{CICT} = W_w$ transfers the classical characterization from $\mathbb{Z}$-actions to free group actions, so questions about the existence of points with prescribed limit behavior reduce to checking chain data.
  • The theorem that a shift space over a free group has the shadowing property exactly when it is a shift of finite type gives a way to recognize SFTs among group shift spaces.
  • Under the weaker hypothesis of asymptotic shadowing, the same equalities hold, so the characterization is stable and covers systems where ordinary shadowing fails.
  • For free monoid actions, the consistency condition collapses to plain internal chain transitivity, giving an even simpler characterization of directional limit sets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The entry/exit letter pair $i(x), t(x)$ in $\mathrm{CICT}$ assigns a direction at each point of the set; this strongly resembles the structure of the boundary of the free group, suggesting that directional limit sets are governed by the ends of the Cayley graph rather than by the full shift structure.
  • The unproved closedness of $W_w$ in the shadowing theorem points to a concrete research question: determine whether shadowing forces the family of directional limit sets to be Hausdorff closed, or find a shadowing system where it is not. Answering this would either repair or refute the main theorem.
  • Since the free monoid case avoids inverses and drops the consistency condition entirely, the technically simpler setting may be the better testbed for extending these results to other graph-directed semigroups, such as actions of groups defined by finite presentations.
  • The word-concatenation construction used here might be adaptable to actions of other groups with a normal form and a notion of reduced word, yielding analogous limit-set characterizations beyond free groups.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 6 minor

Summary. The paper studies continuous actions of finitely generated free groups and free monoids on compact metric spaces. It defines several limit-set notions—the undirected ω(x), the direction-constrained ω_w(x), and the relaxed direction-constrained ω_w^F(x)—and introduces corresponding internal transitivity notions ICT, CICT, IBT, IBT*, and IBT^o. The main claims are that, for shifts of finite type, the limit-set collections are exactly characterized by the new transitivity classes (Corollary 4.14 and Corollaries 4.28, 4.30); that a subshift over a free group has the G-shadowing property if and only if it is a shift of finite type (Theorem 5.5); and that, under G-shadowing or a weak asymptotic shadowing hypothesis, these limit sets coincide with the transitivity classes in general systems (Theorems 5.6–5.8 and 5.13–5.15).

Significance. The free-group setting is a nontrivial and not-yet-standard extension of the classical Z-action theory, and the paper gives useful, explicit constructions for the SFT case. Theorem 5.5 is a clean analogue of Walters' theorem for free-group subshifts. The paper is also careful in distinguishing the group and monoid cases, which genuinely change the internal transitivity notions. However, the central shadowing equalities in Theorems 5.6–5.8 are not fully proved as written: they depend on a Hausdorff-closedness property of the limit-set collections that is neither stated nor established. If that gap is repaired, the paper would make a solid contribution; as it stands, the major advertised conclusion 'limit sets are completely characterized by internal transitivity... under shadowing' is not yet justified.

major comments (1)
  1. [§5.6, Theorem 5.6] The final inference of the proof is invalid as written. For each n the proof constructs a word w_n and a point x_n with d_H(ω_{w_n}(x_n), Y) < 1/n, and then concludes 'As n was arbitrary, Y ∈ W_w'. This requires the family W_w to be closed in the Hausdorff metric. The paper proves in Theorem 4.10 that CICT is closed, and in Lemma 4.11 that W_w ⊆ CICT, but closedness of a superset does not imply closedness of a subset. Moreover, for Z-actions with shadowing the known result of Meddaugh and Raines is that internal chain transitivity equals the closure of the collection of ω-limit sets, not necessarily the collection itself, so closedness of W_w is not a consequence of shadowing alone. As written, the proof establishes only CICT ⊆ closure(W_w). The same missing-closedness step appears at the end of Theorems 5.7 and 5.8. The authors should either prove the needed closedness of W_w and WF_w under G-shadowing, replace the conclusion with the weaker closure equality, or supply a compactness/diagonal argument that produces a single limit word w and a single limit point x with exact equality Y = ω_w(x).
minor comments (6)
  1. [§4.13, proof of Theorem 4.13] The function O is initially declared to have codomain Y, but the later definition O(v) = σ_{v'}(z_{n_v}) for non-prefix words v need not lie in Y unless Y is invariant. The proof only seems to need O(v) ∈ X for arbitrary v and O(u) ∈ Y for prefixes of the constructed word w; please clarify and correct the stated codomain.
  2. [§5.6, final line] The closing sentence of the proof of Theorem 5.6, 'We have already shown that Ww ⊆ CICT and CICT is closed; thus Ww ⊆ CICT', is tautological and does not address the missing converse. This appears to be a typographical or logical slip that should be corrected.
  3. [§5.7, final line] The proof of Theorem 5.7 ends with 'Thus Y ∈ IBT*', which is the hypothesis rather than the desired conclusion Y ∈ WF_w; this is presumably a typo.
  4. [§5.5, proof of Theorem 5.5] In the construction of the shadowing point, 'O(uv)(1)' should presumably be 'O(uv)(e)', using the identity element notation introduced earlier.
  5. [§4.13, proof of Theorem 4.13] The sentence 'We claim that x ∈ X and that ω_w(x) = A' should read 'ω_w(x) = Y'.
  6. [§4.9–4.10] In Definition 4.9 the symbol x is used both for the point whose indices i(x), t(x) are chosen and for the starting point of the chain; and in the proof of Theorem 4.10 the notation j(x) and t(x) is used interchangeably. Please make the notation uniform.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the free-group characterizations are proved by explicit constructions and the cited prior work is motivational only.

full rationale

The paper does not exhibit any step in which a conclusion is assumed by definition or produced from fitted data. The transitivity notions CICT, IBT*, and IBT° are abstract chain/pseudo-orbit conditions; although they are motivated by the directional structure of omega_w- and omega^F_w-limit sets, none is defined in terms of those sets, and the inclusions Ww ⊆ CICT and WFw ⊆ IBT*/IBT° are proved directly (Lemmas 4.11, 4.25, 4.26). The converses (Theorem 4.13, Corollary 4.14, Theorem 4.27, Corollary 4.28, Theorem 4.29, Corollary 4.30) are constructive: from a set satisfying the transitivity condition the authors build an explicit point x and word w with the desired limit set. The shadowing results (Theorems 5.6–5.8) do not invoke an external theorem that already contains the target statement; they use the same construction and shadowing. Self-citations to Meddaugh–Raines [16,17] and Good–Meddaugh [12] are used as motivation and as the Z-action analogue, not as a substitute for the new proofs. For completeness, a non-circular correctness gap should be noted: the final inference in Theorem 5.6 ('As n was arbitrary, Y ∈ W_w') and the analogous conclusions in Theorems 5.7–5.8 require the family W_w (resp. WF_w) to be closed in the Hausdorff topology, a property neither proved nor implied by the preceding estimates. This would only establish membership in the closure of W_w; however, this is a missing justification in the proof, not a circular definition or an imported self-citation.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No parameters are fitted; the construction parameters (M, delta, k, i(x), t(x)) are chosen in the proofs, not fitted to data. The new transitivity classes CICT, IBT*, and IBT^o are definitions introduced by the paper, not entities with independent evidence. The main nondeductive input is the unproved closedness of W_w, which is used as a domain assumption in the shadowing theorems.

assumptions (5)
  • standard math The metric d on A^G satisfies: if d(x,y)<1 then x(e)=y(e), and shifts are continuous with d(sigma_i(x), sigma_i(y)) <= 2^{-n+1} when d(x,y)=2^{-n}.
    Used throughout Lemmas 4.12 and 5.4 to compare central symbols of shifted points; standard for shift spaces over groups.
  • standard math W_infinity, the set of infinite reduced words over a finite generating set, is compact and every element has a unique representation.
    Used for diagonal arguments in Theorems 4.13 and 5.6 and to define limit sets along infinite words.
  • standard math Continuous maps on a compact metric space are uniformly continuous.
    Used throughout to convert delta-chains into epsilon-chains and to build pseudo-orbits.
  • domain assumption The collection W_w of omega_w-limit sets is closed in the Hausdorff topology.
    Invoked in Theorem 5.6 when concluding Y in W_w from d_H(omega_{w_n}(x_n),Y)<1/n for all n; not proved in the paper.
  • standard math The family of forbidden blocks characterization of shift spaces and the equivalence of SFT to finitely many forbidden blocks.
    Used in Lemma 5.3 and Theorem 5.5 to characterize shifts of finite type via shadowing.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Limit Sets and Internal Transitivity in Free Group Actions." pith.science (2026). https://pith.science/paper/3RQAH2O4

@misc{pith2026190807382,
  author       = {Pith},
  title        = {Pith review of: Limit Sets and Internal Transitivity in Free Group Actions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3RQAH2O4}},
  note         = {Machine review of arXiv:1908.07382}
}
abstract

It has been recently shown that, under appropriate hypotheses, the $\omega$-limit sets of a dynamical system are characterized by internal chain transitivity. In this paper, we examine generalizations of these ideas in the context of the action of a finitely generated free group or monoid. We give general definitions for several types of limit sets and analogous notions of internal transitivity. We then demonstrate that these limit sets are completely characterized by internal transitivity properties in shifts of finite type and general dynamical systems exhibiting a form of the shadowing property.

Figures

Figures reproduced from arXiv: 1908.07382 by the authors.

Figure 1
Figure 1. A representation of an element of {0, 1} F2 with the middle 3-block filled in. the binary operation is simply concatenation. The collection of infinite words of H is the set H∞ = {hwiii∈ω : wi ∈ P}. The length of elements, prefixes, and restrictions w|n are defined the same as in the free group case. For the sake of generality, we take G be either a free group or monoid with W the set of words, W∞ the set of infinit… view at source ↗
Figure 2
Figure 2. One step of the construction. Dk0 define O(u) = O′ M (u). Then for u ∈ Dk−0+n define Ok0 (wn−1(u k0+n i ) −1u) = O′ k0+n (u). We will show that this step is well-defined. Suppose for some n < m there is v, v′ in Dn, Dm respectively such that wn−1(u k0+n i ) −1v = wm−1(u k0+m i ) −1v ′ . Write wm−1 = wn−1(u k0+n i ) −1u k0+n j · · ·(u k0+m−1 i ) −1u k0+m−1 j . Thus (u k0+n i ) −1v = (u k0+n i ) −1u k0+n j · · ·(u k0+… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    C. J. Braga Barros, J. A. Souza, and R. A. Reis. Dynamic mor se decompositions for semi- groups of homeomorphisms and control systems. Journal of Dynamical and Control Systems , 18(1):1–19, Jan 2012

    work page 2012

  2. [2]

    Braga Barros and Josiney A

    Carlos J. Braga Barros and Josiney A. Souza. Attractors a nd chain recurrence for semigroup actions. Journal of Dynamics and Differential Equations , 22(4):723–740, Dec 2010

    work page 2010

  3. [3]

    A. D. Barwell, Gareth Davies, and Chris Good. On the ω -limit sets of tent maps. Fund. Math., 217(1):35–54, 2012

    work page 2012

  4. [4]

    A. D. Barwell, C. Good, R. Knight, and B. E. Raines. A chara cterization of ω -limit sets in shift spaces. Ergodic Theory Dynam. Systems , 30(1):21–31, 2010

    work page 2010

  5. [5]

    A. D. Barwell, C. Good, P. Oprocha, and B. E. Raines. Chara cterizations of ω -limit sets of topologically hyperbolic spaces. Discrete Contin. Dyn. Syst. , 33(5):1819–1833, 2013

    work page 2013

  6. [6]

    Barwell, Jonathan Meddaugh, and Brian E

    Andrew D. Barwell, Jonathan Meddaugh, and Brian E. Raine s. Shadowing and ω -limit sets of circular Julia sets. Ergodic Theory Dynam. Systems , 35(4):1045–1055, 2015

    work page 2015

  7. [7]

    Barwell and Brian E

    Andrew D. Barwell and Brian E. Raines. The ω -limit sets of quadratic Julia sets. Ergodic Theory Dynam. Systems , 35(2):337–358, 2015

    work page 2015

  8. [8]

    The undecidability of the domino problem

    Robert Berger. The undecidability of the domino problem . Mem. Amer. Math. Soc. No. , 66:72, 1966

    work page 1966

Show all 20 references
  1. [9]

    Blokh, A

    A. Blokh, A. M. Bruckner, P. D. Humke, and J. Sm ´ ıtal. The s pace of ω -limit sets of a continuous map of the interval. Trans. Amer. Math. Soc. , 348(4):1357–1372, 1996

    1996

  2. [10]

    R. Bowen. ω -limit sets for axiom A diffeomorphisms. J. Differential Equations , 18(2):333–339, 1975

    1975

  3. [11]

    Brian, Jonathan Meddaugh, and Brian E

    William R. Brian, Jonathan Meddaugh, and Brian E. Raine s. Chain transitivity and varia- tions of the shadowing property. Ergodic Theory Dynam. Systems , 35(7):2044–2052, 2015

    2015

  4. [12]

    Orbital shadowing, i nternal chain transitivity and ω -limit sets

    Chris Good and Jonathan Meddaugh. Orbital shadowing, i nternal chain transitivity and ω -limit sets. Ergodic Theory Dynam. Systems , 38(1):143–154, 2018

    2018

  5. [13]

    M. W. Hirsch, Hal L. Smith, and X.-Q. Zhao. Chain transit ivity, attractivity, and strong repellors for semidynamical systems. J. Dynam. Differential Equations , 13(1):107–131, 2001

    2001

  6. [14]

    On the dynamics and recursive propert ies of multidimensional symbolic systems

    Michael Hochman. On the dynamics and recursive propert ies of multidimensional symbolic systems. Invent. Math. , 176(1):131–167, 2009

    2009

  7. [15]

    A characterizati on of the entropies of multidimen- sional shifts of finite type

    Michael Hochman and Tom Meyerovitch. A characterizati on of the entropies of multidimen- sional shifts of finite type. Ann. of Math. (2) , 171(3):2011–2038, 2010

    2011

  8. [16]

    Jonathan Meddaugh and Brian E. Raines. Shadowing and in ternal chain transitivity. Fund. Math., 222(3):279–287, 2013

    2013

  9. [17]

    Jonathan Meddaugh and Brian E. Raines. The structure of limit sets for Zd actions. Discrete Contin. Dyn. Syst. , 34(11):4765–4780, 2014

    2014

  10. [18]

    Chain recurrence in multidimensional t ime discrete dynamical systems

    Piotr Oprocha. Chain recurrence in multidimensional t ime discrete dynamical systems. Dis- crete Contin. Dyn. Syst. , 20(4):1039–1056, 2008

    2008

  11. [19]

    Shadowing in multi-dimensional shift s paces

    Piotr Oprocha. Shadowing in multi-dimensional shift s paces. Colloq. Math. , 110(2):451–460, 2008

    2008

  12. [20]

    On the pseudo-orbit tracing property an d its relationship to stability

    Peter W alters. On the pseudo-orbit tracing property an d its relationship to stability. In The structure of attractors in dynamical systems (Proc. Conf., North Dakota State Univ., Fargo, N.D., 1977) , volume 668 of Lecture Notes in Math. , pages 231–244. Springer, Berlin, 197...

    1977

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.