In this paper, chaos generated by a class of nonconstant weighted shift operators is studied. First, we prove that for the weighted shift operator Bμ : Σ(X) → Σ(X) defined by Bμ(x0, x1, …) = (μ(0)x1, μ(1)x2, …), where X is a normed linear space (not necessarily complete), weak mix, transitivity (hypercyclity) and Devaney chaos are all equivalent to separability of X and this property is preserved under iterations. Then we get that [Formula: see text] is distributionally chaotic and Li–Yorke sensitive for each positive integer N. Meanwhile, a sufficient condition ensuring that a point is k-scrambled for all integers k > 0 is obtained. By using these results, a simple example is given to show that Corollary 3.3 in [Fu & You, 2009] does not hold. Besides, it is proved that the constructive proof of Theorem 4.3 in [Fu & You, 2009] is not correct.
Some Chaos Notions on Dendrites
