Pith. sign in

REVIEW 4 major objections 6 minor 24 references

Hypercyclic algebras for weighted shifts on trees

T0 review · 4 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read For weighted backward shifts on rooted trees, a hypercyclic algebra exists exactly when the weights explode along every branch.

desk verdict This is a genuine contribution: on tree sequence spaces, hypercyclicity no longer implies a hypercyclic algebra, and the paper gives a sharp characterization for rooted trees plus a clean fertile-vertex dichotomy for mixing shifts. read the letter →

arxiv 2411.14609 v1 pith:ROOSG4ET submitted 2024-11-21 math.FA math.DS

Arafat Abbar , Fernando Costa Jr This is my paper · ORCID
classification math.FAmath.DS MSC 47A16
keywords weightedbackwardshiftsdirectedtreeshypercyclicoperatorsalgebrasalgebrabilitymixingsequencespacesoncoordinatewiseproduct
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

The paper asks when the hypercyclic vectors of a weighted backward shift on a tree also contain a whole algebra under coordinatewise multiplication. On a rooted directed tree it answers completely: a hypercyclic algebra exists if and only if there is a sequence of times along which, at every vertex, the maximal weight-product to a descendant of that depth tends to infinity. On the spaces $\ell^1$ and $c_0$, that condition coincides with ordinary hypercyclicity, so every hypercyclic backward shift on these spaces automatically admits a dense, countably generated, free hypercyclic algebra. On $\ell^p$ for $1 < p < \infty$ the two notions separate: the paper constructs hypercyclic (even mixing) shifts that support no hypercyclic algebra, and it characterises when a rooted tree admits a mixing shift without a hypercyclic algebra in terms of a purely geometric 'fertile vertex' condition.

What carries the argument

The machinery has three parts. The surrounding space is the sequence space of the tree with pointwise (coordinatewise) product, so a vector's $m$-th power is taken coordinatewise and hypercyclic algebras are searched for inside the algebra of sequences. The engine for building dense algebras is a Baire-category criterion (Theorem 2.3, quoted from earlier work) that produces a dense, countably generated, free hypercyclic algebra whenever, for any finite list of monomials, one can move the selected monomial into a prescribed open set while pushing every other monomial toward zero; a convex-geometry lemma (Lemma 2.5) picks the winning monomial through a system of linear inequalities on the exponent vectors. For $c_0$ spaces an infimum identity, equation (1), supplies the right-inverse vectors that let the construction separate one branch from all others. Theorem 3.1(iv) reduces all of this to a single quantitative condition on the weights: along some sequence of depths, the products of weights to descendants at that depth grow without bound at every vertex.

What would settle it

If one constructs a weighted backward shift on a rooted tree that satisfies condition (iv) of Theorem 3.1 yet provably has no hypercyclic algebra, the equivalence collapses; the paper's Example 3.5 is the natural test case, since its power sums stay bounded and the theorem forbids an algebra there.

Watch

Extended reading notes

Core claim

The central result, Theorem 3.1, states that for a bounded weighted backward shift $B_\lambda$ on $\ell^p(A)$, $1 \le p < \infty$, of a rooted directed tree $A$, the following are equivalent: the shift supports a dense, countably generated, free hypercyclic algebra; it supports a hypercyclic algebra; some power $f^m$ with $m \ge p$ of a vector is hypercyclic; and there is an increasing sequence $(n_k)$ such that for every vertex $v$, $\sup_{u \in \mathrm{Chi}^{n_k}(v)} |\lambda(v \to u)| \to \infty$. Under the coordinatewise algebra structure, this last growth condition is the entire mechanism. For $\ell^1(A)$ and $c_0(A)$ the condition is exactly the previously known hypercyclicity criterion for these shifts, so hypercyclicity automatically upgrades to a dense, countably generated, free hypercyclic algebra (Corollary 3.2 and Theorem 3.3). For $1 < p < \infty$ the condition is strictly stronger, and the paper exhibits hypercyclic, even mixing, shifts on dyadic and $N$-adic trees that have no hypercyclic algebra (Example 3.5 and Corollary 3.4).

Load-bearing premise

The $\ell^1$ and $c_0$ equivalences rest on two facts quoted without proof from an earlier paper: the hypercyclicity characterization for weighted backward shifts on rooted trees and an infimum identity for constructing right inverses; if either fact carries hidden hypotheses beyond boundedness and leaflessness, those equivalences would need to be re-examined.

Editorial extensions

If this is right

  • On $\ell^1$ and $c_0$ spaces of rooted trees, hypercyclicity of a weighted backward shift automatically gives a dense, countably generated, free hypercyclic algebra; no extra condition on the weights is needed (Corollary 3.2 and Theorem 3.3).
  • On $\ell^p(A)$ with $1 < p < \infty$, hypercyclicity is not enough: the paper gives mixing, even chaotic, Rolewicz-type shifts on $N$-adic trees and a dyadic-tree family that are hypercyclic but support no hypercyclic algebra.
  • A hypercyclic algebra on $\ell^p(A)$ for $p>1$ forces the shift to be hypercyclic on $\ell^1(A)$, because condition (iv) of Theorem 3.1 is exactly the $\ell^1$ hypercyclicity criterion.
  • For unrooted trees with a free left end, hypercyclicity and the existence of a dense hypercyclic algebra are equivalent on $\ell^1$ and $c_0$ spaces (Corollary 4.10).
  • Every leafless directed tree supports both a mixing and a non-mixing weighted backward shift that carries a dense, countably generated, free hypercyclic algebra (Theorem 5.1).

Reading between the lines

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

  • Because the paper builds algebras through a Baire argument, every algebra it constructs has a residual set of generators; if a dense hypercyclic algebra with no residual set of generators exists anywhere, it would have to come from a genuinely different construction, which is exactly the paper's open Question 4.
  • The coordinatewise product makes the problem local in the tree, so the weight-explosion condition should be read as branch-by-branch growth rather than a spectral or global condition; this suggests that moving to convolution-type products on trees, as the paper's Question 1 proposes, will require a substantially different mechanism.
  • Theorem 5.2 shows that the existence of a mixing shift without a hypercyclic algebra on $\ell^p$, $p>1$, is governed by the purely geometric presence of a fertile vertex; a natural testable extension is whether the same geometric condition answers the paper's open Question 5 for unrooted trees.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 6 minor

Summary. The paper studies hypercyclic algebras for weighted backward shifts on sequence spaces over directed trees, equipped with the coordinatewise product. For rooted trees, Theorem 3.1 characterizes, on ℓ^p(A) with 1 ≤ p < ∞, when a bounded weighted backward shift supports a dense, countably generated, free hypercyclic algebra, in terms of the growth of products of weights along nth-generation branches. Corollary 3.2 and Theorem 3.3 establish, for ℓ^1(A) and c_0(A), that hypercyclicity is equivalent to the existence of such algebras. For 1 < p < ∞, Section 3.2 gives examples of hypercyclic shifts without hypercyclic algebras, including Rolewicz operators and a dyadic-tree example, as well as a positive example on a comb-like tree. Section 4 treats unrooted trees, giving necessary conditions for dense hypercyclicity of powers (Theorem 4.1), a sufficient condition for existence of hypercyclic algebras (Theorem 4.4), and corresponding results for c_0 (Theorems 4.7 and 4.8), with several corollaries for trees with a free left end and for symmetric weights. Section 5 discusses existence of mixing and non-mixing shifts with and without hypercyclic algebras, including a characterization involving a new notion of 'fertile vertex' (Theorem 5.2). The paper closes with open problems.

Significance. If the proofs are completed, the main characterization in Theorem 3.1 is a substantial contribution: it gives a clean equivalence between hypercyclicity of powers and the existence of dense, countably generated, free hypercyclic algebras for a large class of operators on tree sequence spaces. The ℓ^1 and c_0 results (Corollary 3.2 and Theorem 3.3) are natural extensions of the known classical backward-shift results, and the counterexamples in Section 3.2 show genuinely new phenomena for 1 < p < ∞. The unrooted-tree results are more partial but contain useful necessary conditions and several corollaries that are likely to be of continued interest. The paper is also commendable for its transparent use of the Baire criterion from [6] and for explicitly pointing out the limitations and open problems in Section 6. The main results are parameter-free and do not rely on circular reasoning; the dependence on the quoted characterization from [15] is external but standard.

major comments (4)
  1. [Theorem 3.1, proof of (iv)⇒(i)] In the proof of (iv)⇒(i), the argument fixes arbitrary f_j ∈ U_j and g with finite support F, then asserts the identity h_k^α = f^α + Σ_{a∈F} (g(a)g_{a,k})^{L_α(s)} and, after applying B^{n_k}, that only the perturbation terms survive. This identity is not valid for arbitrary f_j: the coordinatewise multinomial expansion contains mixed products f^γ (g g_{a,k})^δ, and B^{n_k}(f^α) is nonzero unless each f_j has finite support and n_k is larger than the depth of that support. The manuscript states that Chi^{n_k}(A) ∩ F = ∅ for large k, but it never states that the f_j are chosen with finite support (nor that the vertices u_{a,k} can be chosen pairwise distinct). Because finite-support vectors are dense in ℓ^p(A), the gap is repairable, but as written the central equivalence is not proved.
  2. [Theorem 3.3, proof of (i)⇒(iii)] The same omission occurs in Theorem 3.3: after defining h_{k,j} = f_j + Σ_{a∈F} g(a)^{s_j} R_{a,k}^{s_j}, the proof asserts 'we get B^{n_k}_λ h^β_k = g' without accounting for B^{n_k}(f^β) or for mixed products. The justification requires choosing the f_j with finite support contained in F and k large enough that Chi^{n_k}(A) ∩ F = ∅, which is not stated. In addition, the estimate ∥R_{a,k}^{s_j}∥_∞ → 0 depends on |g_{a,k}(u)| ≤ 1 (which follows from ∥g_{a,k}∥_1 = 1) together with condition (4); this should be made explicit.
  3. [Theorems 4.4 and 4.8] The proofs of Theorems 4.4 and 4.8 contain the same structural gap as Theorem 3.1: the expansion h_k^α = f^α + Σ_{a∈F} (g(a)g_{a,k})^{L_α(s)} and the subsequent formula for B^{n_k}_λ h^α_k implicitly assume that the f_j have finite support and that the perturbation supports are disjoint from the supports of all f_j. Without stating these choices, the displayed identities are not justified for arbitrary f_j ∈ U_j. The gap is again repairable by density of finite-support vectors, but the proofs should be rewritten accordingly.
  4. [Theorem 5.1] The proof of Theorem 5.1 is more of a sketch than a proof: for unrooted trees on ℓ^p, it refers to the 'exact same' weights as in [15, Theorem 6.1] and asserts that they 'satisfy the hypothesis of Theorem 4.4' without showing the verification. If the verification is genuinely immediate, a sentence outlining it would suffice; otherwise the claim should be proved. This is not the central result of the paper, but it is stated as a theorem.
minor comments (6)
  1. [Theorem 3.1, proof of (iii)⇒(iv)] The simultaneous choice of n satisfying (2) and Chi^n(A) ∩ F = ∅ should be justified: it uses the fact that, for a hypercyclic vector and a nonempty open set, the return times are infinite, and that for a fixed finite set F only finitely many n have Chi^n(A) ∩ F ≠ ∅.
  2. [Throughout] The phrase 'positive entire numbers' should be 'positive integer numbers' or simply 'positive integers'; this typo appears several times.
  3. [Section 6] In the paragraph before Question 2, 'Is it not clear if the necessary conditions...' should read 'It is not clear whether the necessary conditions...'.
  4. [Section 2.2] The term 'free hypercyclic algebra' is used in the statements of Theorem 3.1, Corollary 3.2, and elsewhere, but it is not defined. Please add a definition or a reference.
  5. [Notation] The expression Chi^n(A), used in several proofs, is not defined; it should be defined as ⋃_{v∈A} Chi^n(v) to avoid ambiguity.
  6. [Theorem 4.1, condition (v)] The maximum in condition (v) contains a stray vertical bar after the first term: '|λ(par^{n_k}(v) → v)|' is missing a closing absolute-value symbol in the displayed formula. This is a typesetting issue but should be corrected.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular reduction: the main equivalences do not reduce to their inputs or self-citations.

full rationale

The derivation chain is not circular. The paper's central results (Theorem 3.1, Corollary 3.2, Theorem 3.3) characterize hypercyclic algebras for weighted shifts on rooted trees. The proof uses the general Baire criterion Theorem 2.3 and Lemma 2.5 from [6], a paper coauthored by the second author. This is a self-citation, but it is not load-bearing in a circular way: Theorem 2.3 is an abstract sufficient condition for dense-algebrability, does not assume any tree-shift conclusion, and is checked independently in the proof. The remaining external tools, the hypercyclicity characterization Theorem 2.2 and the infimum identity (1), come from [15], a separate published paper, and are not restatements of the conclusions being proved. No parameter is fitted to a subset and renamed as a prediction, and no known result is re-labeled as an organizing principle. One genuine but non-circular gap occurs in the proof of (iv) implies (i) of Theorem 3.1: when expanding h_k^alpha, the term B^{n_k}(f^alpha) and all mixed products are silently omitted; this requires f_j to have finite support and n_k to exceed the depth of that support, which is not stated. That is a correctness gap, repairable by finite-support density, not a circularity. Overall circularity score is low.

Assumptions & free parameters 0 free parameters · 8 assumptions · 1 invented entities

No empirical fitting occurs. The central theorems are conditional on standard results imported from [15] (boundedness, hypercyclicity characterization, right-inverse identity) and [6] (Baire criterion for hypercyclic algebras). The example in Section 3.2 chooses an exponent alpha in an interval to make a construction work; that is an existence choice, not a fitted parameter. The only newly introduced notion is the combinatorial definition fertile vertex, which is used in a proved equivalence.

assumptions (8)
  • standard math Baire Category Theorem and residual set arguments in Theorems 2.3 and Proposition 2.4
    Used to obtain residual sets of generators for hypercyclic algebras. Standard and unproblematic.
  • domain assumption Theorem 2.2, the Grosse-Erdmann and Papathanasiou hypercyclicity characterization for weighted backward shifts on rooted trees
    Imported from [15, Theorem 4.4] and used in Corollary 3.2, Theorem 3.3, Theorem 4.1, and Theorem 4.7. Load-bearing external input.
  • domain assumption Proposition 2.1, the boundedness characterization for weighted backward shifts on trees
    Imported from [15, Proposition 2.3] and used to ensure constructed shifts are bounded.
  • domain assumption Identity (1) from [15, Lemma 4.2] for the infimum of sup norms
    Used in c_0 proofs (Theorems 3.3, 4.7, 4.8) to construct right inverses.
  • domain assumption Trees are leafless and have at most countable branching
    Stated in Section 2 and necessary for hypercyclicity and for the spaces to be separable Banach algebras.
  • domain assumption Coordinatewise product makes ell-p(A) and c_0(A) commutative Banach algebras
    The notion of hypercyclic algebra is with respect to this product. Standard verification.
  • domain assumption Theorem 2.3, the Bayart-Costa-Papathanasiou Baire criterion for hypercyclic algebras
    Used as the main sufficient criterion in the (iv) implies (i) directions. Published in [6].
  • standard math Lemma 2.5, the finite-dimensional separation lemma producing s and beta with L_beta(s) = 1 < L_alpha(s)
    Proved in the paper by a simple linear separation argument. Standard.
invented entities (1)
  • fertile vertex independent evidence
    purpose: A vertex whose descendant generations have unbounded size, used to characterize rooted trees supporting a mixing shift without a hypercyclic algebra in Theorem 5.2.
    This is a definitional combinatorial property, not a postulated object. It is used in a proved if-and-only-if statement.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Hypercyclic algebras for weighted shifts on trees." pith.science (2026). https://pith.science/paper/ROOSG4ET

@misc{pith2026241114609,
  author       = {Pith},
  title        = {Pith review of: Hypercyclic algebras for weighted shifts on trees},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ROOSG4ET}},
  note         = {Machine review of arXiv:2411.14609}
}
abstract

We study the existence of algebras of hypercyclic vectors for weighted backward shifts on sequence spaces of directed trees with the coordinatewise product. When $V$ is a rooted directed tree, we show the set of hypercyclic vectors of any backward weighted shift operator on the space $c_0(V)$ or $\ell^1(V)$ is algebrable whenever it is not empty. We provide necessary and sufficient conditions for the existence of these structures on $\ell^p(V), 1<p<+\infty$. Examples of hypercyclic operators not having a hypercyclic algebra are found. We also study the existence of mixing and non-mixing backward weighted shift operators on any rooted directed tree, with or without hypercyclic algebras. The case of unrooted trees is also studied.

Figures

Figures reproduced from arXiv: 2411.14609 by the authors.

Figure 1
Figure 1. Graphical representation with d = 1 and β = min A. In [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Lexicographical order on the dyadic partition Proof. We note I2 = {1, 2} and we define Chi(r) = {v1, v2} and, for any n ∈ N and any i ∈ I n 2 , Chi(vi) = {vi,1, vi,2} (see [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Directed tree in Example 3.6 Example 3.6. Let us consider the rooted tree A, represented in [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Tree with no fertile vertex One last comment on mixing shifts with no hypercyclic algebra. In [15, Example 4.8], the authors define a big class of mixing weighted backward shifts Bλ,q acting ℓ 2 (A), where A is a rooted tree with finitely many children for each vertex …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 23 canonical work pages

  1. [15]

    Grosse-Erdmann and D

    K.-G. Grosse-Erdmann and D. Papathanasiou. Dynamics of weighted shifts on directed trees. Indiana Univ. Math. J. , 72:263–299, 2023

    work page 2023

  2. [6]

    Bayart, F

    F. Bayart, F. Costa J´ unior, and D. Papathanasiou. Baire theorem and hypercyclic algebras. Advances in Mathematics , 376:107419, 2021

    work page 2021

  3. [1]

    Abakumov and A

    E. Abakumov and A. Abbar. On several dynamical properties of shifts acting on directed trees. Canadian Journal of Mathematics (to appear)

    work page

  4. [2]

    R. M. Aron, L. Bernal-Gonzalez, D. M. Pellegrino, and J. B. S. Sep´ ulveda.Lineability: the search for linearity in mathematics , volume 14. CRC Press, 2015

    work page 2015

  5. [3]

    R. M. Aron, J. A. Conejero, A. Peris, and J. Seoane-Sep´ ulveda. Powers of hypercyclic functions for some classical hypercyclic operators. Integral Equations and Operator Theory , 58(4):591–596, 2007

    work page 2007

  6. [4]

    Hypercyclic shifts on lattice graphs

    A. Baranov, A. Lishanskii, and D. Papathanasiou. Hypercyclic shifts on lattice graphs. arXiv preprint arXiv:2312.13934v2, 2023

    work page Pith review arXiv 2023

  7. [5]

    F. Bayart. Hypercyclic algebras. Journal of Functional Analysis , 276(11):3441–3467, 2019

    work page 2019

  8. [7]

    Bayart and E

    F. Bayart and E. Matheron. Dynamics of linear operators , volume 179 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2009. 32 ARAF AT ABBAR AND FERNANDO COSTA JR

    work page 2009

Show all 24 references
  1. [8]

    Bernal-Gonz´ alez and A

    L. Bernal-Gonz´ alez and A. Montes-Rodr ´ ıguez. Universal functions for composition operators. Complex Variables and Elliptic Equations , 27(1):47–56, 1995

    1995

  2. [9]

    B` es, J

    J. B` es, J. A. Conejero, and D. Papathanasiou. Hypercyclic algebras for convolution and compo- sition operators. Journal of Functional Analysis , 274(10):2884–2905, 2018

    2018

  3. [10]

    B` es, R

    J. B` es, R. Ernst, and A. Prieto. Hypercyclic algebras for convolution operators of unimodular constant term. Journal of Mathematical Analysis and Applications , 483(1):123595, 2020

    2020

  4. [11]

    B` es and D

    J. B` es and D. Papathanasiou. Algebrable sets of hypercyclic vectors for convolution operators. Israel Journal of Mathematics , 238:91–119, 2020

    2020

  5. [12]

    Falc´ o and K.-G

    J. Falc´ o and K.-G. Grosse-Erdmann. Algebrability of the set of hypercyclic vectors for backward shift operators. Advances in Mathematics , 366:107082, 2020

    2020

  6. [13]

    W. H. Gottschalk and G. A. Hedlund. Topological dynamics. American Mathematical Society Colloquium Publications, Vol. 36. American Mathematical Society, Providence, R.I., 1955

    1955

  7. [14]

    Grosse-Erdmann and D

    K.-G. Grosse-Erdmann and D. Papathanasiou. Chaotic weighted shifts on directed trees. arXiv preprint arXiv:2303.03980v2, 2023

    2023 arXiv

  8. [16]

    Grosse-Erdmann and A

    K.-G. Grosse-Erdmann and A. Peris Manguillot. Linear chaos . Universitext. Springer, London, 2011

    2011

  9. [17]

    Z. J. Jabl´ onski, I. B. Jung, and J. Stochel.Weighted shifts on directed trees. Number 1017. Amer- ican Mathematical Soc., 2012

    2012

  10. [18]

    L´ opez-Mart ´ ınez and D

    A. L´ opez-Mart ´ ınez and D. Papathanasiou. Shifts on trees versus classical shifts in chain recurrence. arXiv preprint arXiv:2402.01377 , 2024

    2024 arXiv

  11. [19]

    R. A. Mart ´ ınez-Avenda˜ no and E. Rivera-Guasco. The forward and backward shift on the Lipschitz space of a tree. Integral Equations Operator Theory, 92(1):Paper No. 3, 34, 2020

    2020

  12. [20]

    R. A. Mart ´ ınez-Avenda˜ no. Hypercyclicity of shifts on weighted lp spaces of directed trees.Journal of Mathematical Analysis and Applications , 446(1):823–842, 2017

    2017

  13. [21]

    Q. Menet. Hypercyclic subspaces and weighted shifts. Advances in Mathematics , 255:305–337, 2014

    2014

  14. [22]

    H. N. Salas. Hypercyclic weighted shifts. Transactions of the American Mathematical Society , 347(3):993–1004, 1995

    1995

  15. [23]

    J.-P. Serre. Trees. Springer Science & Business Media, 2002

    2002

  16. [24]

    S. Shkarin. On the set of hypercyclic vectors for the differentiation operator. Israel Journal of Mathematics, 180:271–283, 2010. (A. Abbar) Univ Gustave Eiffel, Univ Paris Est Creteil, CNRS, LAMA UMR8050 F- 77447 Marne-la-V all´ee, France Email address : abbar.arafat@gmail.co...

    2010

Pith tools

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