Next Article in Journal
A Protocol for Solutions to DP-Complete Problems through Tissue Membrane Systems
Previous Article in Journal
Online Personalized Learning Path Recommendation Based on Saltatory Evolution Ant Colony Optimization Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Syndetic Sensitivity and Mean Sensitivity for Linear Operators

School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(13), 2796; https://doi.org/10.3390/math11132796
Submission received: 30 May 2023 / Revised: 18 June 2023 / Accepted: 19 June 2023 / Published: 21 June 2023

Abstract

:
We study syndetic sensitivity and mean sensitivity for linear dynamical systems. For the syndetic sensitivity aspect, we obtain some properties of syndetic sensitivity for adjoint operators and left multiplication operators. We also show that there exists a linear dynamical system ( X × Y , T × S ) such that ( X × Y , T × S ) is cofinitely sensitive but ( X , T ) and ( Y , S ) are not syndetically sensitive. For the mean sensitivity aspect, we show that if ( Y , S ) is sensitive and not mean sensitive, where Y is a complex Banach space, the spectrum of T meets the unit circle. We also obtain some results regarding mean sensitive perturbations.
MSC:
47A10; 47A16; 47B01; 47B37

1. Introduction

By a linear dynamical system (l.d.s.) ( Y , S ) , we mean a Banach space Y and a bounded linear operator S : Y Y . Throughout the manuscript, we let 0 Y be the zero element of the Banach space Y. We denote by I the identity operator. The collection of all positive integers (nonnegative integers, real numbers, respectively) is denoted by N ( Z + , R , respectively).
Ruelle [1] first used the notion of sensitivity. According to the works by Guckenheimer [2], Auslander and Yorke [3] introduced the notion of sensitivity on the compact metric space. The sensitivity of linear dynamics has been discussed in [4,5,6,7]. Recall that an l.d.s. ( Y , S ) is sensitive if there is δ > 0 such that, for any y Y and any neighborhood W of y, there are x W and v N with | | S v x S v y | | > δ . Let δ > 0 . For any nonempty open subset W Y , define
N S ( W , δ ) = v Z +   :   there   exist   y 1 , y 2 W   with   | | S v y 1 S v y 2 | | > δ .
Then, it can be verified that an l.d.s. ( Y , S ) is sensitive if and only if there is δ > 0 such that N S ( W , δ ) for any nonempty open subsets W X .
Before proceeding, let us recall some notions related to the families. Denote by Q = Q ( Z + ) the collection of all subsets of Z + . A subset S of Q is a family if E 1 E 2 and E 1 S imply E 2 S . A subset S = a 1 < a 2 < Z + is
  • thick if, for each u N , there exists a u Z + such that { a u , a u + 1 , , a u + u } S ;
  • syndetic if there exists M Z + such that a u + 1 a u M for any u N .
Moothathu [8] introduced three stronger forms of sensitivity: cofinite sensitivity, multi-sensitivity and syndetic sensitivity. Subsequently, F -sensitivity for some families was studied in [9,10,11,12,13]. We adapt the notions of syndetic sensitivity and cofinite sensitivity for the linear systems. An l.d.s. ( Y , S ) is called syndetically sensitive (cofinitely sensitive, respectively) if there exists δ > 0 such that N S ( W , δ ) is syndetic (cofinite, respectively) for any nonempty open subset W Y . Inspired by [8], we have the following query: Is there a sensitive l.d.s. ( Y , S ) that is not syndetically sensitive? The answer is yes (see Example 1).
Let ( Y , S ) be an l.d.s. The collection of all continuous linear functionals on Y is denoted by B ( Y , F ) . Notice that B ( Y , F ) is the dual space of Y and is denoted by Y * . If y * Y * , then we write y * ( y ) = y , y * , y Y . Let S * : Y * Y * be defined by S * y * = y * S for any y * Y * . Then, S * is called the adjoint of S and ( Y * , S * ) is an l.d.s. (see, for instance, ([5] Appendix A)).
Inspired by the approach in ([5], Chapter 10), and [14,15], the operator S induces a bounded operator L S : K K defined by
L S T = S T for   each T K ,
where K = s p a n { < · , y * > y : y * Y * , y Y } ¯ is endowed with the operator norm. It can be verified that ( K , L S ) is an l.d.s.
There are many different notions of sensitivity on the compact space, such as mean sensitivity [16], diam-mean sensitivity [17] and mean n-sensitivity [18]. Let ( Y , S ) be an l.d.s. For every y Y and any ε > 0 , define
B ( y , ε ) = { x Y : | | x y | | < ε } .
If there is δ > 0 such that, for any y Y and any ε > 0 , there is x B ( y , ε ) satisfying lim sup v 1 v u = 0 v 1 S u x S u y > δ , we say that ( Y , S ) is mean sensitive. If there exists δ > 0 such that for any neighborhood W of Y satisfying lim sup v 1 v u = 0 v 1 d i a m S u W > δ , we say that ( Y , S ) is diam-mean sensitive. Let b 2 . We say that an l.d.s. ( Y , S ) is mean b-sensitive if there exists δ > 0 such that, for any nonempty open subset W Y , there exist b pairwise distinct points y 1 , , y b W with lim sup v 1 v u = 0 v 1 min 1 c d b | | S u y c S u y d | | > δ . Naturally, we have the following query: Is there a mean sensitive l.d.s. that is not mean b-sensitive? The answer is no (see Theorem 6).
Matache [19] showed that if ( Y , S ) is hypercyclic, then σ ( S ) has a nonvoid intersection with the unit circle. We have established that σ ( S ) intersects the unit circle for the sensitive l.d.s ( Y , S ) , where ( Y , S ) is not mean sensitive and Y is a complex Banach space (Theorem 7), and that there is a sensitive l.d.s. ( Y , S ) that is neither hypercyclic nor mean sensitive (Example 2).
The paper is organized as follows. In Section 2, we recall some results in linear dynamics, which will be used later. In Section 3, we study the adjoint operator. In Section 4, we study the left multiplication operators. In Section 5, we show that there exists an l.d.s. such that
  • ( X × Y , T × S ) is cofinitely sensitive;
  • ( Y , S ) is not syndetically sensitive; and
  • ( X , T ) is not syndetically sensitive (Example 1).
In Section 6, we study the mean sensitive system. Let Y = l p , 1 p < , or c 0 . We prove that ( Y , I + B ω ) and ( Y , I + F ω ) are mean sensitive (see Propositions 1, 2 and 4). In Section 7, we study the spectrum property of linear dynamical systems.

2. Preliminaries

In this section, we recall some results in linear dynamics, used in the later discussion.
Let Z 1 and Z 2 be Banach spaces over F . The map S : Z 1 Z 2 is called a linear operator if S ( α z 1 + β z 2 ) = α S z 1 + β S z 2 for any α , β F and any z 1 , z 2 Z 1 . The collection of all bounded linear operators S : Z 1 Z 2 is denoted by B ( Z 1 , Z 2 ) . A linear operator S : Z 1 Z 2 is bounded if there is a positive constant M satisfying | | S z 1 | | M | | z 1 | | for any z 1 Z 1 . A linear operator S : Z 1 Z 2 is continuous if and only if S : Z 1 Z 2 is bounded.
Let ( Y , S ) be an l.d.s. Recall that the number | | S | | = sup y Y , y 0 Y | | S y | | | | y | | is called the norm of the operator S, and | | S | | = sup | | y | | = 1 | | S y | | = sup | | y | | 1 | | S y | | (see, for instance, [20]). For y Y , we call o r b ( y , S ) = { y , S y , S 2 y , } the orbit of y under S. An l.d.s ( Y , S ) is hypercyclic if there is some y Y such that o r b ( y , S ) ¯ = Y .
Let W 1 W 2 be the subspaces of Y if Y = W 1 + W 2 and W 1 W 2 = { 0 Y } . Then, we say that Y is the direct sum of the subspaces W 1 and W 2 , and write Y = W 1 W 2 (see, for instance, [21], p. 68).
Let N ( S ) = { y Y : S y = 0 Y } , R ( S ) = { y Y : S x = y forsome x Y } . We define the resolvent set of S by ρ ( S ) = { λ C : N ( S λ I ) = 0 Y and R ( S λ I ) = Y } and the spectrum of S by σ ( S ) = C ρ ( S ) .
We state some theorems that will be used in the following.
Theorem 1
([20], Corollary 4.5.2). If y is a non-zero element of a Banach space Y, then there is y * Y * such that | | y * | | = 1 and y * ( y ) = < y , y * > = | | y | | .
Theorem 2.
Let ( Y , S ) be an l.d.s., where Y is a complex Banach space. There exist closed subsets σ 1 , σ 2 such that σ ( S ) = σ 1 σ 2 and σ 1 , σ 2 are disjoint. Then, Y = M 1 M 2 , where M 1 and M 2 are S-invariant closed subspaces, σ ( S | M 1 ) = σ 1 and σ ( S | M 2 ) = σ 2 (see, for instance, [5], Theorem B.9).
Theorem 3.
Let X, Y be Banach spaces and { T u } u N B ( X , Y ) . If, for every x X , sup u N | | T u x | | < , then sup u N | | T u | | < (see, for instance, [20], Theorem 4.3.1).

3. Adjoint Operator

In this section, we study the adjoint operator.
Theorem 4.
Let ( Y , S ) be an l.d.s. Then, ( Y , S ) is syndetically sensitive if and only if ( Y * , S * ) is syndetically sensitive.
Proof. 
Necessity. Assume that ( Y , S ) is syndetically sensitive; then, there is δ > 0 such that N S ( B ( 0 Y , ε ) , δ ) is syndetic for every ε > 0 . Let ε > 0 and take v N S ( B ( 0 Y , ε ) , δ ) . Then, there exists x v B ( 0 Y , ε ) such that | | S v x v | | > δ 2 . Note that S v x v 0 Y . By Theorem 1, there exists x v * Y * such that | | x v * | | = 1 and x v * ( S v x v ) = < S v x v , x v * > = | | S v x v | | . Set y v * = | | x v | | x v * . Then, | | y v * | | = | | x v | | < ε and
| | ( S * ) v y v * | | = | | y v * S v | | | y v * S v ( x v ) | | | x v | | = | | x v | | · | x v * ( S n x v ) | | | x v | | = x v * ( S v x v ) > δ 2 ,
which implies that v N S * B ( 0 Y * , ε ) , δ 2 . Hence, N S ( B ( 0 Y , ε ) , δ ) N S * B ( 0 Y * , ε ) , δ 2 , and so N S * B ( 0 Y * , ε ) , δ 2 is syndetic. Let x * Y * . By linearity, N S * B ( x * , ε ) , δ 2 = N S * B ( 0 Y * , ε ) , δ 2 , and then N S * B ( x * , ε ) , δ 2 is syndetic. Since x * Y * and ε > 0 are arbitrary, we find that ( Y * , S * ) is syndetically sensitive.
Sufficiency. Suppose that ( Y * , S * ) is syndetically sensitive; then, there exists δ > 0 satisfying that N S * ( B ( 0 Y * , ε ) , δ ) is syndetic for any ε > 0 . Let ε > 0 and take v N S * ( B ( 0 Y * , ε ) , δ ) . Then, there exists x * B ( 0 Y * , ε ) such that | | ( S * ) v x * | | > δ 2 . Since | | ( S * ) v x * | | = sup | | x | | = 1 | | ( S * ) v x * ( x ) | | , there exists x v Y with | | x v | | = 1 such that | ( S * ) v x * ( x v ) | > δ 2 . Set y v = | | x * | | x v . Then, | | y v | | = | | x * | | < ε and
| | S v y v | | = | | x * | | · | | S v x v | | | x * ( S v x v ) | = | ( S * ) v x * ( x v ) | > δ 2 ,
which implies that v N S B ( 0 Y , ε ) , δ 2 . Hence, N S * ( B ( 0 Y * , ε ) , δ ) N S B ( 0 Y , ε ) , δ 2 , and so N S ( B ( 0 Y , ε ) , δ 2 ) is syndetic. Let y Y be arbitrary. By linearity, N S B ( y , ε ) , δ 2 is syndetic, and so ( Y , S ) is syndetically sensitive. □
Similar to Theorem 4, we have the following.
Remark 1.
Let ( Y , S ) be an l.d.s. Then, the cofinite sensitivities of ( Y , S ) and ( Y * , S * ) are equivalent properties.
Corollary 1.
Let ( Y , S ) be an l.d.s. Then, ( Y , S ) is diam-mean sensitive if and only if ( Y * , S * ) is diam-mean sensitive.
Proof. 
Necessity. Let ε > 0 and v N . Then, d i a m ( S v B ( 0 Y , ε ) ) > 0 by the diam-mean sensitivity of ( Y , S ) , and so there exists x v B ( 0 Y , ε ) with x v 0 Y such that | | S v x v | | > d i a m ( S v B ( 0 Y , ε ) ) 3 > 0 . Similarly to the proof of the necessity of Theorem 4, there is y v * B ( 0 Y * , ε ) with | | ( S * ) v y v * | | > d i a m ( S v B ( 0 Y , ε ) ) 3 . This implies that d i a m ( ( S * ) v B ( 0 Y * , ε ) ) > d i a m ( S v B ( 0 Y , ε ) ) 3 . By linearity, one has ( Y * , S * ) is diam-mean sensitive.
Sufficiency. Let ε > 0 and v N . Then, d i a m ( ( S * ) v B ( 0 Y * , ε ) ) > 0 by the diam-mean sensitivity of ( Y * , S * ) , and so there is A v B ( 0 Y * , ε ) such that | | ( S * ) v A v | | > d i a m ( ( S * ) v B ( 0 Y * , ε ) ) 3 . Similarly to the proof of the sufficiency of Theorem 4, there exists y v B ( 0 Y , ε ) such that | | S v y v | | > d i a m ( S * ) v B ( 0 Y * , ε ) 3 . This implies that d i a m ( S v B ( 0 Y , ε ) ) > d i a m ( S * ) v B ( 0 Y * , ε ) 3 . Let y Y . By linearity,
lim sup w 1 w u = 0 w 1 d i a m ( S u B ( y , ε ) ) > 1 3 lim sup w 1 w u = 0 w 1 d i a m ( ( S * ) u B ( 0 Y * , ε ) ) .
Since y Y and ε > 0 are arbitrary, we find that ( Y , S ) is diam-mean sensitive. □

4. Left Multiplication Operators

In this section, we study the left multiplication operators.
Theorem 5.
Let ( Y , S ) be an l.d.s. Then, ( Y , S ) is syndetically sensitive if and only if ( K , L S ) is syndetically sensitive.
Proof. 
Necessity. Since ( Y , S ) is syndetically sensitive, there is δ > 0 satisfying that N S ( B ( 0 Y , ε ) , δ ) is syndetic for any ε > 0 . Let ε > 0 and take v N S ( B ( 0 Y , ε ) , δ ) . Then, there exists y v B ( 0 Y , ε ) such that | | S v y v | | > δ 2 . Note that y v 0 Y . By Theorem 1, there exists y v * Y * such that y v * = 1 and y v * ( y v ) = < y v , y v * > = y v . Let T v : Y Y be defined by T v y = < y , y v * > y v for any y Y . Then,
| | T v | | = sup | | y | | 1 | | T v y | | = sup | | y | | 1 | | < y , y v * > y v | | sup | | y | | 1 | | y | | · | | y v * | | | y v | | | | y v | | < ε
and
S v T v S v T v ( y v ) y v = S v y v < y v , y v * > y n = S v y v > δ 2 ,
which implies that v N L S B ( 0 K , ε ) , δ 2 . Thus, N S ( B ( 0 Y , ε ) , δ ) N L S B ( 0 K , ε ) , δ 2 , and so N L S B ( 0 K , ε ) , δ 2 is syndetic. Let G K . By linearity, N L S B ( 0 K , ε ) , δ 2 = N L S B ( G , ε ) , δ 2 , and so N L S B ( G , ε ) , δ 2 is syndetic. This implies that ( K , L S ) is syndetically sensitive.
Sufficiency. Since ( K , L S ) is syndetically sensitive, there is δ > 0 such that N L S ( B ( 0 K , ε ) , δ ) is syndetic for any ε > 0 . Let ε > 0 and take v N L S ( B ( 0 K , ε ) , δ ) . Then, there exists A v B ( 0 K , ε ) such that | | ( L S v ) ( A v ) | | > δ 2 . Since | | ( L S v ) ( A v ) | | = | | S v A v | | = sup | | y | | = 1 | | S n ( A n y ) | | , there exists y v Y such that
  • | | y v | | = 1 ;
  • | | S v A v ( y v ) | | > δ 2 ;
  • | | A v y v | | | | A v | | · | | y v | | < ε .
This implies that v N S B ( 0 Y , ε ) , δ 2 . Thus,
N L S ( B ( 0 K , ε ) , δ ) N S B ( 0 Y , ε ) , δ 2 ,
and so N S B ( 0 Y , ε ) , δ 2 is syndetic. By linearity, ( Y , S ) is syndetically sensitive. □
Similar to Theorem 5, we have the following.
Remark 2.
Let ( Y , S ) be an l.d.s. Then, the cofinite sensitivities of ( Y , S ) and ( K , L S ) are equivalent properties.
Corollary 2.
Let ( Y , S ) be an l.d.s. Then, ( Y , S ) is diam-mean sensitive if and only if ( K , L S ) is diam-mean sensitive.
Proof. 
Necessity. Let ε > 0 and v N . Then, d i a m ( S v B ( 0 Y , ε ) ) > 0 by the diam-mean sensitivity of ( Y , S ) , and so there exists y v B ( 0 Y , ε ) with y v 0 Y such that | | S v y v | | > d i a m ( S v B ( 0 Y , ε ) ) 3 > 0 . Similarly to the proof of the necessity of Theorem 5, there exists T v B ( 0 K , ε ) such that | | S v T v | | | | S v y v | | > d i a m ( S v B ( 0 Y , ε ) ) 3 . This implies that d i a m ( S v B ( 0 K , ε ) ) d i a m ( S v B ( 0 Y , ε ) ) 3 . By linearity, we find that ( K , L S ) is diam-mean sensitive.
Sufficiency. Let ε > 0 and v N . Then, d i a m ( ( L S ) v B ( 0 K , ε ) ) > 0 by the diam-mean sensitivity of ( K , L S ) , and so there is A v B ( 0 K , ε ) such that | | ( L S ) v A v | | > d i a m ( ( L S ) v B ( 0 K , ε ) ) 3 . Similarly to the proof of the sufficiency of Theorem 5, there exists y v B ( 0 Y , ε ) such that | | S v y v | | > d i a m ( ( L S ) v B ( 0 K , ε ) ) 3 . This implies that d i a m ( S v B ( 0 Y , ε ) ) > d i a m ( ( L S ) v B ( 0 K , ε ) ) 3 . Let y Y . Then,
lim sup w 1 w u = 0 w 1 d i a m ( S u B ( y , ε ) ) lim sup w 1 w u = 0 w 1 d i a m ( ( L S ) u B ( 0 K , ε ) ) 3 .
Thus, ( Y , S ) is diam-mean sensitive. □

5. Sensitivity but Not Cofinite Sensitivity

In this section, we show that there exists an l.d.s. ( X × Y , T × S ) such that
  • ( X × Y , T × S ) is cofinitely sensitive;
  • ( X , T ) and ( Y , S ) are not syndetically sensitive.
Lemma 1
([5] Exercise 2.3.1). An l.d.s. ( Y , S ) is sensitive if and only if sup v N S v = .
Example 1.
There is an l.d.s. ( X × Y , T × S ) such that
1. 
( X , T ) is sensitive;
2. 
( X , T ) is not syndetically sensitive;
3. 
( Y , S ) is sensitive;
4. 
( Y , S ) is not syndetically sensitive;
5. 
( X × Y , T × S ) is cofinitely sensitive.
Proof. 
Let A 1 = 1 , 2 1 , , a 1 a 1 1 a 1   times , B 1 = 1 a 1 1   times . If A 1 , , A t and B 1 , , B t are well defined for t 1 , then we set
A t + 1 = 1 + u = 1 t ( a u + u ) u = 1 t ( a u + u ) , 2 + u = 1 t ( a u + u ) 1 + u = 1 t ( a u + u ) , , a t + 1 + u = 1 t ( a u + u ) a t + 1 1 + u = 1 t 1 ( a u + u ) a t + 1   times and
B t + 1 = u = 1 t ( a u + u ) a t + 1 + u = 1 t ( a u + u ) t + 1   times .
Put
ω = ( ω u ) u N = ( A 1 B 1 A 2 B 2 ) .
Let C 1 = 1 , 2 1 , , c 1 c 1 1 c 1   times , D 1 = 1 c 1 1   times . If C 1 , , C t and D 1 , , D t are well defined for t 1 , then we set
C t + 1 = 1 + u = 1 t ( c u + u ) u = 1 t ( c u + u ) , 2 + u = 1 t ( c u + u ) 1 + u = 1 t ( c u + u ) , , c t + 1 + u = 1 t ( c u + u ) c t + 1 1 + u = 1 t ( c u + u ) c t + 1   times and
D t + 1 = u = 1 t ( c u + u ) c t + 1 + u = 1 t ( c u + u ) t + 1   times .
Put
μ = ( μ v ) v N = ( C 1 D 1 C 2 D 2 ) .
The sequences { a u } u N , { c u } u N satisfy the following conditions:
  • a 1 > 1 , c 1 > 2 a 1 , a 1 + c 1 + 1 a 1 + 1 > 2 a 1 ;
  • a 1 + a 2 + 1 a 1 + 1 > 2 c 1 , c 1 + a 2 + 1 c 1 + 1 > 2 c 1 ;
  • a v + 1 + u = 1 v ( a u + u ) u = 1 v ( a u + u ) > 2 c v + u = 1 v 1 ( c u + u ) u = 1 v 1 ( c u + u ) , a v + 1 + u = 1 v ( c u + u ) u = 1 v ( c u + u ) > 2 c v for each v 2 ;
  • c v + 1 + u = 1 v ( c u + u ) u = 1 v ( c u + u ) > 2 a v + 1 + u = 1 v ( a u + u ) u = 1 v ( a u + u ) , c v + 1 + u = 1 v + 1 ( a u + u ) u = 1 v + 1 ( a u + u ) > 2 a v + 1 for each v 1 .
Let X = Y = x = ( x u ) u N R N : u = 1 | x u | < with the norm | | x | | = u = 1 | x u | .
Let T : X X be defined by
T ( x 1 , x 2 , x 3 , ) = ( 0 , ω 1 x 1 , ω 2 x 2 , ω 3 x 3 , )
for any ( x 1 , x 2 , x 3 , ) X .
Let S : Y Y be defined by
S ( y 1 , y 2 , y 3 , ) = ( 0 , μ 1 y 1 , μ 2 y 2 , μ 3 y 3 , )
for any ( y 1 , y 2 , y 3 , ) Y .
Now, let us check that the l.d.s. ( X , T ) has the properties via Claims 4 and 5. We need firstly the following three claims. □
Claim 1. 
For any v 3 , we have a v + 1 > 2 v + 1 a 1 .
Proof of Claim 1. 
Let v 3 . By the construction of { a u } u N , { c u } u N , one has
a v + 1 + u = 1 v ( a u + u ) u = 1 v ( a u + u ) > 2 c v + u = 1 v 1 ( c u + u ) u = 1 v 1 ( c u + u ) > 2 2 a v + u = 1 v 1 ( a u + u ) u = 1 v 1 ( a u + u ) .
and so one has
a v + 1 + u = 1 v ( a u + u ) u = 1 v ( a u + u ) > ( 2 2 ) v 1 a 1 + a 2 + 1 a 1 + 1 > ( 2 2 ) v 1 2 c 1 > 2 2 v a 1 ( by   the   construction   of   { a u } u N , { c u } u N ) .
Thus,
a v + 1 > 2 2 v a 1 u = 1 v ( a u + u ) u = 1 v ( a u + u ) = 2 2 v a 1 1 u = 1 v ( a u + u ) > 2 v + 1 a 1 .
 □
Claim 2. 
Let t 1 . Then, v = r u = 1 t ( a u + u ) | ω v | 1 for any r u = 1 t ( a u + u ) .
Proof of Claim 2. 
By the construction of ( ω u ) u N , one has that
v = 1 + u = 1 t ( a u + u ) u = 1 t + 1 ( a u + u ) | ω v | 1 for   any t 1 and v = 1 a 1 + 1 | ω v | = 1 .
Let t = 1 . Then, v = r u = 1 t ( a u + u ) | ω v | = v = r a 1 + 1 | ω v | 1 for any r a 1 + 1 by the construction of ( ω u ) u N .
Now, let t > 1 and take r u = 1 t ( a u + u ) . Consider the following three cases.
  • Case 1: If 1 r a 1 + 1 , then
    v = r u = 1 t ( a u + u ) | ω v | 1 ( by ( 4 ) ) .
  • Case 2: If u = 1 p ( a u + u ) < r u = 1 p + 1 ( a u + u ) , 1 p t 2 , then
    v = r u = 1 t ( a u + u ) | ω v | v = r u = 1 p + 1 ( a u + u ) | ω v | 1 ( by ( 4 ) ) .
  • Case 3: If u = 1 t 1 ( a u + u ) < r u = 1 t ( a u + u ) , then v = r u = 1 t ( a u + u ) | ω v | 1 by the construction of ( ω u ) u N . In summary, v = r u = 1 t ( a u + u ) | ω v | 1 for any r u = 1 t ( a u + u ) and any t 1 .
 □
Claim 3. 
Let s > 1 . For any a s + 1 + u = 1 s 1 ( a u + u ) t u = 1 s ( a u + u ) and l 1 , one has v = l l + t 1 | ω v | 2 .
Proof of Claim 3. 
Let s > 1 and take a s + 1 + u = 1 s 1 ( a u + u ) t u = 1 s ( a u + u ) , l 1 . Then, l + t 1 a s + 1 + u = 1 s 1 ( a u + u ) . Consider the following three cases.
  • Case 1: If a s + 1 + u = 1 s 1 ( a u + u ) l + t 1 u = 1 s ( a u + u ) , then l s , and so
v = l l + t 1 | ω v | = v = l u = 1 s 1 ( a u + u ) | ω v | v = 1 + u = 1 s 1 ( a u + u ) l + t 1 | ω v | v = l u = 1 s 1 ( a u + u ) | ω v | 1 ( by   Claim   2 and   by   the   construction   of ( ω u ) u N ) .
  • Case 2: If l + t 1 > u = 1 s ( a u + u ) and l u = 1 s ( a u + u ) , then
v = l l + t 1 | ω v | = v = l u = 1 s ( a u + u ) | ω v | v = 1 + u = 1 s ( a u + u ) l + t 1 | ω v | ( by   Claim   2 ) v = 1 + u = 1 s ( a u + u ) l + t 1 | ω v | v = 0 u = 1 s ( a u + u ) 1 v + 1 + u = 1 s ( a u + u ) v + u = 1 s ( a u + u ) = 2 observe   that | ω v | v v 1 for   any v > 1 .
  • Case 3: If l + t 1 > u = 1 s ( a u + u ) and l > u = 1 s ( a u + u ) , then
v = l l + t 1 | ω v | v = 0 u = 1 s ( a u + u ) 1 v + 1 + u = 1 s ( a u + u ) v + u = 1 s ( a u + u ) = 2
by the construction of ( ω u ) u N .
In summary, v = l l + t 1 | ω v | 2 for any a s + 1 + u = 1 s 1 ( a u + u ) t u = 1 s ( a u + u ) and l 1 , where s > 1 . □
Claim 4. 
( X , T ) is sensitive.
Proof of Claim 4. 
Let s > 4 and take x s = ( 0 , , 0 , 1 1 + u = 1 s ( a u + u ) , 0 , ) X . Then, | | x s | | = 1 and
| | T a s + 1 x s | | = a s + 1 + u = 1 s ( a u + u ) u = 1 s ( a u + u ) > 2 2 s a 1 ( by ( 3 ) and ( 1 ) ) .
and so | | T a s + 1 | | = sup | | x | | = 1 | | T a s + 1 x | | | | T a s + 1 x s | | > 2 2 s a 1 . This implies that sup v N | | T v | | = . By Lemma 1, ( X , T ) is sensitive. □
Claim 5. 
( X , T ) is not syndetically sensitive.
Proof of Claim 5. 
Assume that ( X , T ) is syndetically sensitive. Then, there exists δ > 0 such that N T B ( 0 X , δ 12 ) , δ is syndetic. Let s > 1 , a s + 1 + u = 1 s 1 ( a u + u ) v u = 1 s ( a u + u ) and take x = ( x u ) u N B ( 0 X , δ 12 ) . By (1),
| | T v x | | = u = 1 r = u u + v 1 | ω r | | x u | 2 u = 1 | x u | = 2 | | x | | < δ 6 ,
and so, for any x 1 , x 2 B ( 0 X , δ 12 ) ,
| | T v x 1 T v x 2 | | < | | T v x 1 | | + | | T v x 2 | | < δ 3 .
This implies that a s + 1 + u = 1 s 1 ( a u + u ) , , u = 1 s ( a u + u ) s 2 N N T B ( 0 X , δ 12 ) , δ . In other words, N N T B ( 0 X , δ 12 ) , δ is thick. Thus, N T ( B ( 0 X , δ 12 ) , δ ) is not syndetic. This is a contradiction. □
We will check that ( Y , S ) has the required properties via Claims 9 and 10. We need firstly the following three claims.
Claim 6. 
For any v 2 , we have c v + 1 > 2 v + 1 a 1 .
Proof of Claim 6. 
Let v 2 . By the construction of { a u } u N , { c u } u N , one has
c v + 1 + u = 1 v ( c u + u ) u = 1 v ( c u + u ) > 2 a v + 1 + u = 1 v ( a u + u ) u = 1 v ( a u + u ) > 2 2 c v + u = 1 v 1 ( c u + u ) u = 1 v 1 ( c u + u ) ,
and so
c v + 1 + u = 1 v ( c u + u ) u = 1 v ( c u + u ) > ( 2 2 ) v 1 c 2 + c 1 + 1 c 1 + 1 > ( 2 2 ) v 1 2 a 1 + a 2 + 1 a 1 + 1 > 2 2 v c 1 > 2 2 v a 1 ( by   the   construction   of   { a u } u N , { c u } u N ) .
Thus,
c v + 1 > 2 2 v a 1 1 u = 1 v ( c u + u ) > 2 v + 1 a 1 .
 □
Claim 7. 
Let t 1 . Then, v = r u = 1 t ( c u + u ) | μ v | 1 for any r u = 1 t ( c u + u ) .
Proof of Claim 7. 
By the construction of ( μ v ) v N , one has that
v = 1 + u = 1 t ( c u + u ) u = 1 t + 1 ( c u + u ) | μ v | 1 for   any t 1 and v = 1 m 1 + 1 | μ v | = 1 .
Let t = 1 . Then, v = r u = 1 t ( c u + u ) | μ v | = v = r c 1 + 1 | μ v | 1 for any r c 1 + 1 by the construction of ( μ v ) v N .
Now, let t > 1 and take r u = 1 t ( c u + u ) . Consider the following three cases.
  • Case 1: If 1 r c 1 + 1 , then
    v = r u = 1 t ( c u + u ) | μ v | v = r c 1 + 1 | μ v | 1 ( by ( 6 ) ) .
  • Case 2: If u = 1 p ( c u + u ) < r u = 1 p + 1 ( c u + u ) , 1 p t 2 , then
    v = r u = 1 t ( c u + u ) | μ v | v = r u = 1 p + 1 ( c u + u ) | μ v | 1 ( by ( 6 ) ) .
  • Case 3: If u = 1 t 1 ( c u + u ) < v u = 1 t ( c u + u ) , then v = r u = 1 t ( c u + u ) | μ v | 1 by the construction of ( μ v ) v N . In summary, v = r u = 1 t ( c u + u ) | μ v | 1 for any r u = 1 t ( c u + u ) and t 1 .
 □
Claim 8. 
Let s > 1 . For any c s + 1 + u = 1 s 1 ( c u + u ) t u = 1 s ( c u + u ) and l 1 , one has v = l l + t 1 | μ v | 2 .
Proof of Claim 8. 
Let s > 1 and take c s + 1 + u = 1 s 1 ( c u + u ) t u = 1 s ( c u + u ) , l 1 . Then, l + t 1 c s + 1 + u = 1 s 1 ( c u + u ) . Consider the following three situations.
  • Case 1: If c s + 1 + u = 1 s 1 ( c u + u ) l + t 1 u = 1 s ( c u + u ) , then l s , and so
v = l l + t 1 | μ v | = v = l u = 1 s 1 ( c u + u ) | μ v | v = 1 + u = 1 s 1 ( c u + u ) l + t 1 | μ v | v = l u = 1 s 1 ( c u + u ) | μ v | 1 ( by   Claim   7 and   by   the   construction   of ( μ v ) v N ) .
  • Case 2: If l + t 1 > u = 1 s ( c u + u ) and l u = 1 s ( c u + u ) , then
v = l l + t 1 | μ v | = v = l u = 1 s ( c u + u ) | μ v | v = 1 + u = 1 s ( c u + u ) l + t 1 | μ v | ( by   Claim   7 ) v = 1 + u = 1 s ( c u + u ) l + t 1 | μ v | v = 0 u = 1 s ( c u + u ) 1 v + 1 + u = 1 s ( c u + u ) v + u = 1 s ( c u + u ) = 2 observe   that | μ v | v v 1 for   any v > 1 .
  • Case 3: If l + t 1 > u = 1 s ( c u + u ) and l > u = 1 s ( c u + u ) , then
v = l l + t 1 | μ v | v = 0 u = 1 s ( c u + u ) 1 v + 1 + u = 1 s ( c u + u ) v + u = 1 s ( c u + u ) = 2
by the construction of ( μ v ) v N .
In summary, v = l l + t 1 | μ v | 2 for any c s + 1 + u = 1 s 1 ( c u + u ) t u = 1 s ( c u + u ) and l 1 , where s > 1 . □
Claim 9. 
( Y , S )  is sensitive.
Proof of Claim 9. 
Let s > 4 and take y s = ( 0 , , 0 , 1 1 + u = 1 s ( c u + u ) , 0 , ) X . Then, | | y s | | = 1 and
| | S c s + 1 y s | | = c s + 1 + u = 1 s ( c u + u ) u = 1 s ( c u + u ) > 2 2 s a 1 ( by ( 5 ) and ( 2 ) ) .
and so | | S c s + 1 | | = sup | | y | | = 1 | | S c s + 1 y | | | | S c s + 1 y s | | > 2 2 s a 1 . This implies that sup v N | | T v | | = . Thus, ( Y , S ) is sensitive by Lemma 1. □
Claim 10. 
( Y , S )  is not syndetically sensitive.
Proof of Claim 10. 
Assume that ( Y , S ) is syndetically sensitive. Then, there exists δ > 0 such that N S B ( 0 Y , δ 12 ) , δ is syndetic. Let s > 1 , c s + 1 + u = 1 s 1 ( c u + u ) v u = 1 s ( c u + u ) and take y = ( y u ) u N B ( 0 Y , δ 12 ) . By (2),
| | S v y | | = u = 1 r = u u + v 1 | μ r | | y u | 2 u = 1 | y u | = 2 | | y | | < δ 6 ,
and so, for any y 1 , y 2 B ( 0 Y , δ 12 ) ,
| | S v y 1 S v y 2 | | < | | S v y 1 | | + | | S v y 2 | | < δ 3 .
This implies that c s + 1 + u = 1 s 1 ( c u + u ) , , u = 1 s ( c u + u ) s 2 N N S B ( 0 Y , δ 12 ) , δ . In other words, N N S B ( 0 Y , δ 12 ) , δ is thick. Thus, N S ( B ( 0 Y , δ 12 ) , δ ) is nor syndetic. This is a contradiction. □
Claim 11. 
( X × Y , T × S )  is cofinitely sensitive.
Proof of Claim 11. 
Let ε > 0 . Then, there is N > 4 such that 1 2 v a 1 < ε for all v N . Now, we show that [ a N + 1 , ) N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 . By the construction of { a u } u N , { c u } u N , one has [ a N + 1 , ) = u N [ a u + 1 , c u + 1 ] u N [ c u + 1 , a u + 2 ] .
Let s N , a s + 1 v c s + 1 and take y v = ( 0 , , 0 , 1 2 N a 1 1 + u = 1 s ( c u + u ) , 0 , ) Y . Then, | | y v | | = 1 2 N a 1 < ε and
| | S v y v | | = r = 1 + u = 1 s ( c u + u ) v + u = 1 s ( c u + u ) | μ r | 1 2 N a 1 ( by ( 2 ) ) = v + u = 1 s ( c u + u ) u = 1 s ( c u + u ) 1 2 N a 1 a s + 1 + u = 1 s ( c u + u ) u = 1 s ( c u + u ) 1 2 N a 1 > 2 c s 2 N a 1 ( by   the   construction   of { a u } u N , { c u } u N ) > 2 s a 1 2 N a 1 1 ( by   Claim 6 ) .
This implies that u N [ a u + 1 , c u + 1 ] N S ( B ( 0 Y , ε ) , 1 ) . Obviously,
N S ( B ( 0 Y , ε ) , 1 ) N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 ,
and so
u N [ a u + 1 , c u + 1 ] N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 .
Now, let s N , c s + 1 v a s + 2 and take x v = ( 0 , , 0 , 1 2 N a 1 1 + u = 1 s ( c u + u ) , 0 , ) X . Then, | | x v | | = 1 2 N a 1 < ε and
| | T v x v | | = v + u = 1 s + 1 ( a u + u ) u = 1 s + 1 ( a u + u ) 1 2 N a 1 ( by ( 1 ) ) c s + 1 + u = 1 s + 1 ( a u + u ) u = 1 s + 1 ( a u + u ) 1 2 N a 1 > 2 a s + 1 2 N a 1 ( by   the   construction   of { a u } u N , { c u } u N ) > 2 s + 1 a 1 2 N a 1 > 1 ( by   Claim 1 ) .
This implies that u N [ c u + 1 , a u + 2 ] N T ( B ( 0 X , ε ) , 1 ) . Observe that
N T ( B ( 0 X , ε ) , 1 ) N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 ,
and so u N [ c u + 1 , a u + 2 ] N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 ; hence,
[ a N + 1 , ) N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2
by (7). Let ( x , y ) X × Y be arbitrary. By linearity,
N T × S B ( ( 0 X , 0 Y ) , ε ) , 1 2 = N T × S B ( ( x , y ) , ε ) , 1 2 .
This implies that ( X × Y , T × S ) is cofinitely sensitive. □

6. Mean Sensitivity

In this section, we study mean sensitive systems. We obtain some results regarding mean sensitive perturbations.
Recall that ( Y , S ) is absolutely Cesàro bounded if there exists a constant C > 0 such that sup v N 1 v u = 1 v S u y C y for all y Y .
Theorem 6.
An l.d.s. ( Y , S ) is mean sensitive if and only if ( Y , S ) is mean b-sensitive.
Proof. 
Necessity. Since ( Y , S ) is mean sensitive, one knows that ( Y , S ) is not absolutely Cesáro bounded, and so there exists y 0 Y such that sup v N 1 v u = 1 v | | S u y 0 | | = by [22], Theorem 4; hence, sup v N 1 v u = 0 v 1 | | S u y 0 | | = . Let b 2 and take ε > 0 . Then, there exists a strictly increasing sequence { m v } v N with 1 m v u = 0 m v 1 S u y 0 > b ( b + 1 ) | | y 0 | | ε . Since
min 2 c d b + 1 S u y 0 | | y 0 | | ε c S u y 0 | | y 0 | | ε d = ε | | y 0 | | S u y 0 min 2 c d b + 1 1 c 1 d ε | | y 0 | | S u y 0 1 b ( b + 1 )
for every u 0 , one has
1 m v u = 0 m v 1 min 2 c d b + 1 S u y 0 | | y 0 | | ε c S u y 0 | | y 0 | | ε d > 1
for every v N . Let y Y . By linearity, y + y 0 | | y 0 | | ε u B ( y , ε ) for each 2 u b + 1 and
1 m v u = 0 m v 1 min 2 c d b + 1 S u y + y 0 | | y 0 | | ε c S u y + y 0 | | y 0 | | ε d > 1
for every v N , which implies that ( Y , S ) is mean b-sensitive.
Sufficiency. The proof is trivial. □
Inspired by the approaches in [23], Theorem 3.3, [5,24], Corollary 8.3, we obtain the following result.
Let 1 p < . Let l p = y = ( y u ) u N F N : u = 1 | y u | p < with the norm | | y | | = u = 1 | y u | p 1 1 p p and let c 0 = { y = ( y u ) u N F N : lim u y u = 0 } with the norm | | y | | = sup u N | y u | . Then, l p and c 0 are Banach spaces.
Let ω = ( ω u ) u N with sup u N | ω u | < . Let B ω : Y Y be defined by
B ω ( s 1 , s 2 , s 3 , ) = ( ω 2 s 2 , ω 3 s 3 , ω 4 s 4 , )
for all ( s 1 , s 2 , s 3 , ) Y .
Proposition 1.
Let Y = l p , 1 p < , and let ω = ( ω u ) u N with sup u N | ω u | < . Then, ( Y , I + B ω ) is mean sensitive.
Proof. 
Let ε > 0 . Then, there is N > 0 satisfying 1 v < ε for every v N . Take y ε = 0 , 1 N , 0 , 0 , Y . Then, | | y ε | | = 1 N < ε and
( I + B ω ) v ( y ε ) = u = 0 v v u B ω u ( y ε ) ( by ( 8 ) ) > 1
for any v > N | ω 2 | , which implies that there is M > 0 satisfying 1 v u = 0 v 1 | | ( I + B ω ) u y ε | | > 1 2 for any v M . By linearity, one finds that ( Y , I + B ω ) is mean sensitive. □
Let ω = ( ω u ) u N with sup u N | ω u | < . Let F ω : Y Y be defined by
F ω ( s 0 , s 1 , s 2 , ) = ( 0 , ω 0 s 0 , ω 1 s 1 , ω 2 s 2 , )
for all ( s 0 , s 1 , s 2 , ) Y (see [5], p. 98).
Proposition 2.
Let Y = l p , 1 p < , and let ω = ( ω u ) u N with sup u N | ω u | < . Then, ( Y , I + F ω ) is mean sensitive.
Proof. 
Let ε > 0 . There exists L > 0 such that 1 v < ε for any v L . Take y ε = ( 1 L , 0 , 0 , ) Y . Then, | | y ε | | = 1 L < ε . By (9),
F ω v ( y ε ) = 0 , , 0 v   times , u = 1 v | ω u | L , 0 , ,
and so
( I + F ω ) v ( y ε ) = u = 0 v v u F ω u ( y ε ) > 1 ,
which implies that there is M > 0 satisfying 1 v u = 0 v 1 | | ( I + F ω ) u y ε | | > 1 2 for any v M . Thus, ( Y , I + F ω ) is mean sensitive. □
Proposition 3.
Let Y = l p , 1 p < , and let ω = ( ω u ) u N with sup u N | ω u | < . Then, ( Y , I + F ω ) is not hypercyclic.
Proof. 
Let x 1 = ( 1 , 0 , 0 , ) Y . Now, we show that for any y = ( y u ) u N B x 1 , 1 4 , o r b ( y , I + F ω ) is not dense in Y. Since y = ( y u ) u N B ( x 1 , 1 4 ) , one has | y 1 | > 1 2 and | y 2 | | y 1 1 | p + | y 2 | p + u = 3 | y u | p 1 1 p p = | | y x 1 | | < 1 4 . In fact, if | y 1 | 1 2 , then
| | y x 1 | | = | y 1 1 | p + u = 2 | y u | p 1 1 p p | y 1 1 | | | y 1 | 1 | 1 2 .
This is a contradiction.
By (9),
| | ( I + F ω ) v y | | = u = 0 v v u F ω u y = | | ( y 1 , y 2 + v ω 1 y 1 , ) | | | y 2 + v ω 1 y 1 | | v ω 1 y 1 | | y 2 | > | v ω 1 | 2 1 4
for any v > 1 | ω 1 | , which implies that lim v | | ( I + F ω ) v y | | = . Thus, ( Y , I + F ω ) is not hypercyclic. □
Similar to Propositions 1–3, we have the following.
Proposition 4.
Let Y = c 0 and let ω = ( ω u ) u N , satisfying sup u N | ω u | < . Then,
1. 
( Y , I + F ω ) is not hypercyclic;
2. 
( Y , I + F ω ) is mean sensitive;
3. 
( Y , I + B ω ) is mean sensitive.

7. Spectrum Property

In this section, we study the spectrum property for sensitive operators.
Lemma 2
([5], Lemma 5.2). Let ( Y , S ) be an l.d.s, where Y is a complex Banach space. Let s > 0 . Then, one has the following:
1. 
if σ ( S ) { w C : | w | < s } , then there exist 0 < η < s and W > 0 such that | | S v y | | W ( s η ) v | | y | | for any y Y and any v N ;
2. 
if σ ( S ) { w C : | w | > s } , then there exist η > 0 and W > 0 such that | | S v y | | W ( s + η ) v | | y | | for any y Y and any v N .
Theorem 7.
If a sensitive l.d.s. ( Y , S ) is not mean sensitive, then σ ( S ) S , where S = { w C : | w | = 1 } and Y is a complex Banach space.
Proof. 
Assume that σ ( S ) does not intersect the unit circle.
If σ ( S ) w C : | w | < 1 , then there exist 0 < ε 1 < 1 and M 1 > 0 satisfying | | S v y | | M 1 ( 1 ε 1 ) v | | y | | for every y Y and any v N by Lemma 2. This implies that, for any y Y , sup v N | | S v y | | < . This is a contradiction. In fact, since ( Y , S ) is sensitive, by Lemma 1 sup v N S v = , and then by Theorem 3, there is y 0 Y satisfying sup v N | | S v y 0 | | = .
If σ ( S ) { w C : | w | > 1 } , then there exist ε 2 > 0 and M 2 > 0 satisfying | | S v y | | M 2 ( 1 + ε 2 ) v | | y | | for every y Y and any v N by Lemma 2. This implies that lim v | | S v y | | = for any y Y with y 0 Y . Thus, lim v 1 v u = 0 v 1 | | S u y | | = for any y Y with y 0 Y . Take y 0 0 Y . Then, lim v 1 v u = 0 v 1 | | S u y 0 | | = . Let ε > 0 . There is N ε > 0 satisfying 1 v u = 0 v 1 S u y 0 | | y 0 | | ε 2 > 1 for any v N ε . By linearity, one finds that ( Y , S ) is mean sensitive. This is a contradiction.
Set σ 1 = σ ( S ) { w C : | w | < 1 } and σ 2 = σ ( S ) { w C : | w | > 1 } . Then,
  • σ 1 and σ 2 are closed and disjoint;
  • σ ( T ) = σ 1 σ 2 .
By Theorem 2, there exist M 1 and M 2 such that
  • M 1 and M 2 are nontrivial S-invariant closed subspaces;
  • Y = M 1 M 2 ;
  • σ ( S | M 1 ) = σ 1 ;
  • σ ( S | M 2 ) = σ 2 .
Note that σ ( S | M 2 ) = σ 2 . Similarly, we have that ( M 2 , S | M 2 ) is mean sensitive by Lemma 2. Thus, there is δ > 0 such that, for any ε > 0 , there exists y B ( 0 Y , ε ) such that lim sup v 1 v u = 0 v 1 | | S i y | | > δ . This implies that ( Y , S ) is mean sensitive. This is a contradiction. In summary, σ ( S ) S , where S = { w C : | w | = 1 } . □
Recall that a linear dynamical system ( Y , S ) is Li–Yorke sensitive if there is δ > 0 such that, for any y Y and any ε > 0 , there exists x B ( y , ε ) with lim sup v | | S v x S v y | | > δ and lim inf v | | S v x S v y | | = 0 .
Example 2.
There is a non hypercyclic, sensitive l.d.s. ( Y , S ) that is not mean sensitive.
Proof. 
Let L 1 = 1 , 1 , , 1 l 1 1   times , ( 1 l 1 1 ) 1 ε 0 ,
L 2 = ( v v 1 ) 1 ε 0 l 1 + 1 v u = 1 2 l u = l 1 + 1 l 1 1 ε 0 , l 1 + 2 l 1 + 1 1 ε 0 , , u = 1 2 l u ( u = 1 2 l u ) 1 1 ε 0 .
If L 1 , L 2 , , L 2 t 1 , L 2 t are are well defined for t 1 , then we set
L 2 t + 1 = 1 , 1 , , 1 l 2 t + 1 1   times , 1 l 2 t + 1 1 1 ε 0 and
L 2 ( t + 1 ) = v v 1 1 ε 0 u = 1 2 t + 1 l u + 1 v u = 1 2 ( t + 1 ) l u .
In order to obtain the desired properties, we further require { l t } t N N , ε 0 to satisfy the following conditions:
  • l 1 > 4 , l t > l t 1 ;
  • l 2 t = ( l 2 t 1 2 ) u = 1 2 t 1 l u ;
  • l 2 t + 1 = l 2 t + 1 ;
  • ε 0 ( 0 , 1 5 ) .
Put
ω = ( ω u ) u N = ( L 1 L 2 L 3 L 4 ) .
Let Y = y = ( y 1 , y 2 , , y u , ) C N : u = 1 | y u | < with the norm | | y | | = u = 1 | y u | . Let S : Y Y be defined by
S ( y 1 , y 2 , y 3 , ) = ( ω 2 y 2 , ω 3 y 3 , )
for any ( y 1 , y 2 , y 3 , ) Y .
Now, we show that ( Y , S ) is not hypercyclic. Note that
v = 1 u = 1 2 t l u | ω v | = v = 1 t u = 1 2 v l u ( l 2 v 1 1 ) u = 1 2 v 1 l u 1 ε 0 = 1 .
for all t 1 .
Let t N . Then, there exists k t N such that v = 1 t | ω v | v = 1 u = 1 2 k t l u | ω v | = 1 by the construction of ω . Thus, sup t N v = 1 t | ω v | = 1 , and so ( Y , S ) is not hypercyclic by [5], Example 4.9(a).
Define B ω 0 : Y Y by
B ω 0 y 1 , y 2 , y 3 , = ω 2 0 y 2 , ω 3 0 y 3 , ω 4 0 y 4 ,
for any ( y 1 , y 2 , y 3 , ) Y , where ω 0 = ω u 0 u N , ω u 0 = u u 1 1 ε 0 for any u 2 .
Let y = ( y u ) u N Y and any v N . Then,
S v y = u = 2 v + 1 ω u y v + 1 , u = 3 v + 2 ω u y v + 2 , , u = t + 1 v + t ω u y v + t , ,
and so
S v y = r = v + 1 u = r v + 1 r | ω u | | y r | r = v + 1 u = r v + 1 r | ω u 0 | | y r | = B ω 0 v x ( observe   that ω u ω u 0 for   any u 1 ) .
Since Y , B ω 0 is absolutely Cesàro bounded as in [25], Example 23(A), there is C > 0 satisfying sup v N 1 v u = 1 v B ω 0 u y C | | y | | for all y Y . This implies that sup v N 1 v u = 0 v 1 | | S u y | | ( C + 1 ) | | y | | for any y Y . Thus, ( Y , S ) is not mean sensitive.
Since
v = 1 + u = 1 2 t 1 l u u = 1 2 t l u | ω v | = ( l 2 t 1 1 ) 1 ε 0 .
for any t 1 , one has that ( Y , S ) is Li–Yorke sensitive by [26], Theorem 5 and [7], Theorem 1, and then ( Y , S ) is sensitive. □

8. Conclusions

In this study, we focus on syndetic sensitivity and diam-mean sensitivity for linear operators, addressing a gap existing in the literature. We obtain some properties regarding syndetic sensitivity and diam-mean sensitivty for adjoint operators and left multiplication operators. We also show that there exists an l.d.s. ( X × Y , T × S ) such that
  • ( X × Y , T × S ) is cofinitely sensitive;
  • ( X , T ) and ( Y , S ) are not syndetically sensitive.
However, the following question remains unresolved.
Question 1.
Is there a syndetically sensitive l.d.s. ( Y , S ) that is not cofinitely sensitive?
For the mean sensitivity aspect, we obtain some results regarding mean sensitive perturbations; we also obtain a spectrum property for the sensitive systems. If an l.d.s. ( Y , S ) is mean sensitive, then ( Y , S ) is not absolutely Cesàro bounded. In the future, we intend to explore which conditions imply that an l.d.s. ( Y , S ) is absolutely Cesàro bounded.

Author Contributions

Writing—original draft, writing—review and editing, Q.Y.; funding acquisition, P.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the NNSF of China (11501391).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ruelle, D. Dynamical Systems with Turbulent Behavior. In Mathematical Problems in Theoretical Physics, Lecture Notes in Physics; Springer: Berlin/Heidelberg, Germany, 1978; Volume 80, pp. 341–360. [Google Scholar]
  2. Guckenheimer, J. Sensitive dependence to initial conditions for one-dimensional maps. Commun. Math. Phys. 1979, 70, 133–160. [Google Scholar] [CrossRef]
  3. Auslander, J.; Yorke, J.A. Interval maps, factors of maps, and chaos. Tôhoku Math. J. 1980, 32, 177–188. [Google Scholar] [CrossRef]
  4. Bayart, F.; Matheron, É. Dynamics of Linear Operators; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  5. Grosse-Erdmann, K.G.; Peris-Manguillot, A. Linear Chaos; Universitext; Springer: London, UK, 2011. [Google Scholar]
  6. Huang, W.; Khilko, D.; Kolyada, S.; Peris, A.; Zhang, G. Finite Intersection Property and Dynamical Compactness. J. Dyn. Differ. Equ. 2018, 30, 1221–1245. [Google Scholar] [CrossRef] [Green Version]
  7. Wu, X.; Zhu, P. On the equivalence of four chaotic operators. Appl. Math. Lett. 2012, 25, 545–549. [Google Scholar] [CrossRef] [Green Version]
  8. Moothathu, T.K.S. Stronger forms of sensitivity for dynamical systems. Nonlinearity 2007, 20, 2115–2126. [Google Scholar] [CrossRef]
  9. Huang, W.; Kolyada, S.; Zhang, G. Analogues of Auslander-Yorke theorems for multi-sensitivity. Ergod. Theory Dyn. Syst. 2018, 38, 651–665. [Google Scholar] [CrossRef] [Green Version]
  10. Li, J.; Ye, X. Recent development of chaos theory in topological dynamics. Acta Math. Sin. 2016, 32, 83–114. [Google Scholar] [CrossRef] [Green Version]
  11. Li, J.; Oprocha, P.; Wu, X. Furstenberg families, sensitivity and the space of probability measures. Nonlinearity 2017, 30, 987–1005. [Google Scholar] [CrossRef]
  12. Wu, X.; Wang, J.; Chen, G. F-sensitivity and multi-sensitivity of hyperspatial dynamical systems. J. Math. Anal. Appl. 2015, 429, 16–26. [Google Scholar] [CrossRef]
  13. Ye, X.; Yu, T. Sensitivity, proximal extension and higher order almost automorphy. Trans. Am. Math. Soc. 2018, 370, 3639–3662. [Google Scholar] [CrossRef]
  14. Aron, R.; Bès, J.; León, F.; Peris, A. Operators with common hypercyclic subspaces. J. Operator. Theory 2005, 54, 251–260. [Google Scholar]
  15. Chan, K.C.; Taylor, R.D., Jr. Hypercyclic subspaces of a Banach space. Integral Equ. Oper. Theory 2001, 41, 381–388. [Google Scholar] [CrossRef]
  16. Li, J.; Tu, S.; Ye, X. Mean equicontinuity and mean sensitivvity. Ergod. Theory Dyn. Syst. 2015, 35, 2587–2612. [Google Scholar] [CrossRef] [Green Version]
  17. García-Ramos, F.; Li, J.; Zhang, R. When is a dynamical system mean sensitive? Ergod. Theory Dyn. Syst. 2019, 39, 1608–1636. [Google Scholar] [CrossRef] [Green Version]
  18. Li, J.; Ye, X.; Yu, T. Equicontinuity and Sensitivity in Mean Forms. J. Dyn. Differ. Equ. 2022, 34, 133–154. [Google Scholar] [CrossRef]
  19. Matache, V. Notes on hypercyclic operators. Acta Sci. Math. 1993, 58, 401–410. [Google Scholar]
  20. Huang, Y. Functional Analysis: An Introduction, 2nd ed.; Science Press: Beijing, China, 2019. [Google Scholar]
  21. Limaye, B.V. Linear Functional Analysis for Scientists and Engineers; Springer: Singapore, 2016. [Google Scholar]
  22. Bernardes, N.C., Jr.; Bonilla, A.; Peris, A. Mean Li-Yorke chaos in Banach spaces. J. Funct. Anal. 2020, 278, 108343. [Google Scholar] [CrossRef] [Green Version]
  23. Salas, H.N. Hypercyclic weighted shifts. Trans. Am. Math. Soc. 1995, 347, 993–1004. [Google Scholar] [CrossRef]
  24. Desch, W.; Schappacher, W.; Webb, G.F. Hypercyclic and chaotic semigroups of linear operators. Ergod. Theory Dyn. Syst. 1997, 17, 793–819. [Google Scholar] [CrossRef]
  25. Bernardes, N.C., Jr.; Bonilla, A.; Peris, A.; Wu, X. Distributional chaos for operators on Banach spaces. J. Math. Anal. Appl. 2018, 459, 797–821. [Google Scholar] [CrossRef]
  26. Bermúdez, T.; Bonilla, A.; Marttínez-Giménez, F.; Peris, A. Li-Yorke and distributionally chaotic operators. J. Math. Anal. Appl. 2011, 373, 83–93. [Google Scholar] [CrossRef] [Green Version]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yao, Q.; Zhu, P. Syndetic Sensitivity and Mean Sensitivity for Linear Operators. Mathematics 2023, 11, 2796. https://doi.org/10.3390/math11132796

AMA Style

Yao Q, Zhu P. Syndetic Sensitivity and Mean Sensitivity for Linear Operators. Mathematics. 2023; 11(13):2796. https://doi.org/10.3390/math11132796

Chicago/Turabian Style

Yao, Quanquan, and Peiyong Zhu. 2023. "Syndetic Sensitivity and Mean Sensitivity for Linear Operators" Mathematics 11, no. 13: 2796. https://doi.org/10.3390/math11132796

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop