In this paper, we give a criterion of the absolutely Cesàro bounded weighted backward shift in spirit of the comparison method. Our approach is to construct the proper product of weight functions
by the fraction of two monomials of the indexes, then we apply proper scaling to give Cesàro boundedness. In particular, we present a new example of non Cesàro bounded weighted backward shift on
.
Let X be a complex Banach space and B ( X ) be the Banach algebra of all linear bounded operators on X. Given T ∈ B ( X ) , the Cesàro mean of T is the family of operators { M T ( n ) } n ∈ ℕ ⊂ B ( X ) which is defined by
M T ( n ) x : = 1 n + 1 ∑ j = 0 n T j x
for x ∈ X . The operator T ∈ B ( X ) is called Cesàro bounded if { M T ( n ) } n ∈ ℕ is bounded in B ( X ) . That is sup n ‖ M T ( n ) ‖ < ∞ . The operator T ∈ B ( X ) is called absolutely Cesàro bounded if there is C > 0 such that
sup n ∈ ℕ 1 n + 1 ∑ j = 0 n ‖ T j x ‖ ≤ C ‖ x ‖ , ∀ x ∈ X .
It is clear that absolutely Cesàro bounded operators are Cesàro bounded. The concept of Cesàro boundness is highly connected with the dynamic of linear operators. It was firstly introduced by Hou and Luo in [
w k : = 2 k 2 k − 1 , ( k ∈ ℕ ) is absolutely Cesàro bounded. Then it attracts lots of attentions by several mathematicians. Interested readers can refer [
w k : = ( k k − 1 ) α on the l p ( ℕ ) ( 1 ≤ p < ∞ ) is absolutely Cesàro bounded for 0 < α < 1 p , and operator T with weights w k : = ( k k − 1 ) 1 / p is not Cesàro bounded. [
type D C 2 1 2 is not absolutely Cesàro bounded. [
If 1 ≤ p < ∞ , denote by l p ( ℕ ) the space of p-th summable sequences. Let { e n : n = 1,2, ⋯ } be the canonical basis of l p ( ℕ ) . Any vector x ∈ l p ( ℕ ) has
the unique representation x = ∑ j = 1 ∞ α j e j where { α j : j = 1, ⋯ } ⊂ ℂ . Let w = ( w 1 , w 2 , ⋯ ) be a weight sequence. We define the weighted backward shift operator B w on l p ( ℕ ) as B w e 1 = 0 and B w e k : = w k e k − 1 for integer k > 1 . That is for x = ( α 1 , α 2 , ⋯ ) ∈ l p ( ℕ ) , B w ( α 1 , α 2 , ⋯ ) = ( w 2 α 2 , w 3 α 3 , ⋯ ) .
The boundedness of the weighted backward shifts is studied intensively for decades. Our motivation is to characterize the Cesàro bounded weighted backward shift and give a practical method to distinguish the Cesàro bounded backward shifts. Our results include those concrete examples in [
We first study the case when the weighted backward shift B w is not Cesàro bounded. Our method is to estimate the products of the weights ∏ i j w n by the a fraction of two monomials of the indexes. In the sequel, to make the argument more compact, we set ∏ n = i j a n = 1 whenever j < i .
Theorem 1. For 1 ≤ p < ∞ , let w be a weight sequence and B w the weighted backward shift on l p ( ℕ ) . Suppose ∏ n = i j w n ≳ j s / p i t / p and the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > 1 and s > 1 ;
(2) t = 1 and s ≥ 1 ;
(3) t < 1 and t < s .
Then B w is not Cesàro bounded on l p ( ℕ ) .
Proof. Let y N + 1 : = 1 ( N + 1 ) 1 / p ∑ n = 1 N + 1 e n , where N is an even integers. Therefore ‖ y N + 1 ‖ p = 1 . We compute directly that
‖ 1 N + 1 ∑ j = 0 N T j y N + 1 ‖ p p = ‖ 1 ( N + 1 ) 1 + 1 / p ∑ k = 1 N + 1 ( ∑ j = k N + 1 ∏ n = k + 1 N − j + k + 1 w n ) e k ‖ p p = 1 ( N + 1 ) p + 1 ∑ k = 1 N + 1 ( ∑ j = k N + 1 ∏ n = k + 1 N − j + k + 1 w n ) p ≳ 1 ( N + 1 ) p + 1 ∑ k = 1 N + 1 ( ∑ j = k N + 1 ( N − j + k + 1 ) s / p k t / p ) p ≳ 1 ( N + 1 ) p + 1 ∑ k = 1 N / 2 + 1 1 k t ( ∑ j = N / 2 + 1 N + 1 ( N − j + k + 1 ) s / p ) p ≥ { 1 ( N + 1 ) p + 1 ( ∑ k = 1 N / 2 + 1 1 k t ) ( ∑ j = N / 2 + 1 N + 1 ( N − j + 2 ) s / p ) p , if s > 0 ; 1 ( N + 1 ) p + 1 ( ∑ k = 1 N / 2 + 1 1 k t ) ( ∑ j = N / 2 + 1 N + 1 ( 3 N 2 − j + 1 ) s / p ) p , if s ≤ 0.
For short, we define
I = ∑ k = 1 N 2 + 1 k − t , I I = ∑ j = N 2 + 1 N + 1 ( N − j + 2 ) s p and I I I = ∑ j = N 2 + 1 N + 1 ( 3 N 2 − j + 1 ) s p .
If t > 1 ,
I ≳ ∫ 1 N 2 + 2 1 x t d x = 1 t − 1 [ 1 − 1 ( N 2 + 2 ) t − 1 ] ≥ 2 t − 1 − 1 ( t − 1 ) 2 t − 1 ≃ 1.
Meanwhile s > 1 implies
I I = ∑ j = 1 N 2 + 1 j s p ≥ ∫ 1 N 2 + 1 x s p d x = ( N 2 + 1 ) s p + 1 + s p s p + 1 ≃ N s p + 1 .
Then
I ⋅ I I p ( N + 1 ) p + 1 ≳ N s − 1 → ∞ , as N → ∞ .
If t = 1 ,
I ≳ ∫ 1 N 2 + 2 1 x d x = log ( N 2 + 2 ) .
Meanwhile s ≥ 1 implies I I ≳ N s p + 1 . Then
I ⋅ I I p ( N + 1 ) p + 1 ≳ N s − 1 log N → ∞ , as N → ∞ .
If t < 1 and s > max { t ,0 } ,
I ≳ ∫ 1 N 2 + 2 x − t d x = ( N 2 + 2 ) 1 − t − 1 1 − t ≃ N 1 − t .
Meanwhile we have I I ≳ N s p + 1 . Then
I ⋅ I I p ( N + 1 ) p + 1 ≳ N s − t → ∞ , as N → ∞ .
If t < 0 and t < s ≤ 0 , I ≥ ∫ 1 N 2 + 2 x − t d x ≃ N 1 − t . To estimate III, we have
I I I = ∑ j = N / 2 N j s / p .
If t < s ( ≠ − p ) ≤ 0 ,
I I I ≥ ∫ N 2 N x s / p d x = N s / p + 1 − ( N / 2 ) s / p + 1 1 + s / p = N s / p + 1 ⋅ 1 − 2 − s / p − 1 1 + s / p .
Then
I ⋅ I I I p ( N + 1 ) p + 1 ≳ N s − t → ∞ , as N → ∞ .
If t < s = − p ,
I I I ≥ ∫ N 2 N x − 1 d x = log N − log N / 2 = log 2.
Then
I ⋅ I I I p ( N + 1 ) p + 1 ≳ N − t − p → ∞ , as N → ∞ .
We use the same strategy to consider the absolutely Cesàro bounded weighted backward shift.
Theorem 2. For 1 ≤ p < ∞ , let w be a weight sequence and B w be the weighted backward shift on l p ( ℕ ) . Suppose ∏ m = i j | w m | ≲ j s / p i t / p and the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > 1 and s ≤ 1 ,
(2) t = 1 and s < 1 ,
(3) t < 1 and s ≤ t .
Then B w is absolutely Cesàro bounded on l p ( ℕ ) .
Proof. For every x ∈ l p ( ℕ ) , denote by x = ∑ j = 1 ∞ α j e j for some complex sequence { α j } . Let N be a positive integer, we have
∑ n = 0 N ‖ B w n x ‖ p p = ∑ n = 0 N ‖ ∑ j = n + 1 ∞ α j ∏ m = j + 1 − n j w m e j − n ‖ p p = ∑ n = 0 N ∑ j = n + 1 ∞ | α j | p ∏ m = j + 1 − n j | w m | p = ∑ j = 1 ∞ | α j | p ∑ n = 0 min { N , j − 1 } ∏ m = j + 1 − n j | w m | p ≲ ∑ j = 1 ∞ | α j | p ∑ n = 0 min { N , j − 1 } j s ( j − n ) t = ∑ j = 1 N | α j | p ∑ n = 0 j − 1 j s ( j − n ) t + ∑ j = N + 1 2 N | α j | p ∑ n = 0 N j s ( j − n ) t + ∑ j = 2 N + 1 ∞ | α j | p ∑ n = 0 N j s ( j − n ) t : = S 1 + S 2 + S 3 .
In either case, we have s ≤ t . Whenever j ≥ 2 N + 1 and n ≤ N it is clear that ( j j − n ) t ≤ 1 for t ≤ 0 and ( j j − n ) t ≤ 2 t for t > 0 . Then we get
S 3 ≤ ∑ j = 2 N + 1 ∞ | α j | p ∑ n = 0 N ( j j − n ) t ( 2 N + 1 ) s − t ≤ ( N + 1 ) ⋅ max { 2 t , 1 } ⋅ ∑ j = 2 N + 1 ∞ | α j | p ≲ N ∑ j = 2 N + 1 ∞ | α j | p .
If t > 1 and s ≤ 1 , we estimate S 1 and S 2 . For j ≤ N we have
∑ n = 0 j − 1 j s ( j − n ) t = j s ∑ n = 1 j n − t ≤ j s ( 1 + ∫ 1 j x − t d x ) = j s t − 1 ( t − 1 j t − 1 ) ≲ N .
And for j ∈ [ N + 1,2 N ] ,
∑ n = 0 N j s ( j − n ) t ≤ j s ∑ n = 0 j − 1 1 ( j − n ) t ≲ ( 2 N ) s ≲ N .
Hence S 1 + S 2 ≲ N ∑ j = 1 2 N | α j | p .
Suppose t = 1 and s < 1 . To estimate S 1 and S 2 , for j ≤ N we have
∑ n = 0 j − 1 j s j − n = j s ∑ n = 1 j 1 n ≤ j s ( 1 + ∫ 1 j 1 x d x ) = j s log j + j s ≲ N .
And for j ∈ [ N + 1,2 N ] ,
∑ n = 0 N j s j − n ≤ j s ∑ n = 0 j − 1 1 j − n ≲ j s log j ≲ N .
Hence S 1 + S 2 ≲ N ∑ j = 1 2 N | α j | p .
Now we suppose t < 1 and s ≤ t . For j ≤ N ,
∑ n = 0 j − 1 j s ( j − n ) t = j s ∑ n = 1 j n − t ≤ j s ( 1 + ∫ 1 j x − t d x ) = j s j 1 − t − t 1 − t ≲ N .
For j ∈ [ N + 1,2 N ] , we have
∑ n = 0 N j s ( j − n ) t ≤ j s ∑ n = 0 j − 1 1 ( j − n ) t ≲ ( 2 N ) s − t + 1 ≲ N .
To complete the proof, we use all the inequalities above in each case, and use Jensen's inequality to get
( 1 N + 1 ∑ n = 0 N ‖ B w n x ‖ p ) p ≤ 1 N + 1 ∑ n = 0 N ‖ B w n x ‖ p p ≲ ‖ x ‖ p p .
That is B w is absolutely Cesàro bounded.
We summarize the theorems above and give the following corollary.
Corollary 1. Suppose 1 ≤ p < ∞ . Let w be a weight sequence such that ∏ m = i j | w m | ≃ j s / p i t / p for a real pair ( t , s ) . The weighted backward shift B w on l p ( ℕ ) is absolutely Cesàro bounded if and only if the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > 1 and s ≤ 1 ,
(2) t = 1 and s < 1 ,
(3) t < 1 and s ≤ t .
To give a visualization, we have the following
It is clear that our result include the cases in [
Theorem 3. For 1 ≤ p < ∞ , let w be a weight sequence and B w the weighted backward shift on l p ( ℕ ) . Suppose ∏ n = i j w n ≳ ( j i ⋅ log t i log s j ) 1 / p and the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > − 1 and s < t + 1 ;
(2) t = − 1 and s ≤ 0 ;
(3) t < − 1 and s < 0 .
Then B w is not Cesàro bounded on l p ( ℕ ) .
Proof. Analogously to the proof of Theorem 1, let y N + 1 : = 1 ( N + 1 ) 1 / p ∑ n = 1 N + 1 e n , where N is a positive integer multiple of 4.
‖ 1 N + 1 ∑ j = 0 N B w j y N + 1 ‖ p p ≳ 1 ( N + 1 ) p + 1 ∑ k = 1 N + 1 ( ∑ j = k N + 1 ( N − j + k + 1 ) 1 / p ( k + 1 ) 1 / p log t / p ( k + 1 ) log s / p ( N − j + k + 1 ) ) p ≥ 1 ( N + 1 ) p + 1 ∑ k = 1 N / 4 + 1 log t ( k + 1 ) k + 1 ( ∑ j = N / 4 + 1 3 N / 4 + 1 ( N − j + k + 1 ) 1 / p log s / p ( N − j + k + 1 ) ) p ≥ { 1 ( N + 1 ) p + 1 ( ∑ k = 1 N / 4 + 1 log t ( k + 1 ) k + 1 ) ( ∑ j = N / 4 + 1 3 N / 4 + 1 ( N − j + 2 ) 1 / p log s / p ( 5 N / 4 − j + 2 ) ) p , if s > 0 ; 1 ( N + 1 ) p + 1 ( ∑ k = 1 N / 4 + 1 log t ( k + 1 ) k + 1 ) ( ∑ j = N / 4 + 1 3 N / 4 + 1 ( N − j + 2 ) 1 / p log s / p ( N − j + 2 ) ) p , if s ≤ 0.
For short, we define M 1 = ∑ k = 1 N 4 + 1 log t ( k + 1 ) k + 1 , M 2 = ∑ j = N 4 + 1 3 N 4 + 1 ( N − j + 2 ) 1 / p log s / p ( 5 N / 4 − j + 2 ) , and M 3 = ∑ j = N 4 + 1 3 N 4 + 1 ( N − j + 2 ) 1 / p log s / p ( N − j + 2 ) .
If − 1 < t ≤ 0 ,
M 1 = ∑ k = 2 N 4 + 2 log t k k ≥ ∫ 2 N 4 + 3 log t x x d x = log t + 1 ( N 4 + 3 ) − log t + 1 2 t + 1 ≳ log t + 1 N .
If t > 0 ,
M 1 = ∑ k = 2 N 4 + 2 log t k k ≳ log t 2 2 + ∫ 2 N 4 + 2 log t x x d x ≳ log t + 1 ( N 4 + 2 ) − log t + 1 2 t + 1 ≳ log t + 1 N .
Meanwhile s > 0 implies that
M 2 ≥ 1 log s / p ( N + 1 ) ∑ N 4 + 1 3 N 4 + 1 j 1 / p ≥ 1 log s / p ( N + 1 ) ∫ N 4 3 N 4 + 1 x 1 / p d x = ( 3 N 4 + 1 ) 1 / p + 1 − ( N 4 ) 1 / p + 1 ( log s / p ( N + 1 ) ) ( 1 p + 1 ) ≳ N 1 / p + 1 log s / p N .
Hence, t + 1 > s implies
M 1 ⋅ M 2 p ( N + 1 ) p + 1 ≳ log t + 1 − s N → ∞ , as N → ∞ .
When t > − 1 , we have M 1 ≳ log t + 1 N . If s ≤ 0 , then
M 3 ≥ 1 log s / p ( N 4 + 1 ) ∑ j = N 4 + 1 3 N 4 + 1 j 1 / p ≥ 1 log s / p ( N 4 + 1 ) ∫ j = N 4 3 N 4 + 1 x 1 / p d x = ( 3 N 4 + 1 ) 1 / p + 1 − ( N 4 ) 1 / p + 1 log s / p ( N 4 + 1 ) ( 1 p + 1 ) ≳ N 1 / p + 1 log s / p N .
hence,
M 1 ⋅ M 3 p ( N + 1 ) p + 1 ≳ log t + 1 − s N → ∞ , as N → ∞ ,
which proves the case (1).
If t = − 1 ,
M 1 = ∑ k = 2 N 4 + 2 1 k log k ≥ ∫ 2 N 4 + 3 1 x log x d x = log log ( N 4 + 3 ) − log log 2 ≳ log ( log N ) .
Meanwhile s ≤ 0 implies M 3 ≳ N 1 / p + 1 log s / p N . Hence,
M 1 ⋅ M 3 p ( N + 1 ) p + 1 ≳ log ( log N ) log s N
diverges when N goes to the infinity. That is the case (2).
If t < − 1 ,
M 1 = ∑ k = 2 N 4 + 2 log t k k ≳ ∫ 2 N 4 + 3 log t x x d x = log t + 1 2 − log t + 1 ( N 4 + 3 ) − t − 1 ≳ 1.
Also s < 0 implies M 3 ≳ N 1 / p + 1 log s / p N . Hence,
M 1 ⋅ M 3 p ( N + 1 ) p + 1 ≳ log − s N → ∞ , as N → ∞ .
That is the case (3).
Theorem 4. For 1 ≤ p < ∞ , let w be a weight sequence and B w the weighted backward shift on l p ( ℕ ) . Suppose ∏ n = i j | w n | ≲ ( j i ⋅ log t i log s j ) 1 / p and the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > − 1 and s ≥ t + 1 ;
(2) t = − 1 and s > 0 ;
(3) t < − 1 and s ≥ 0 .
Then B w is absolutely Cesàro bounded on l p ( ℕ ) . In the condition, we treat all log j to be positive. That is actually the case when j ≥ 3 . There are exceptions in our arguments. But the only cases are when j = 1 , 2 . We can concentrate to the cases when j large enough, because the exact values of w 1 and w 2 will not change the (absolute) Cesàro boundedness of the backward shift B w . From this point of view, we avoid to consider the trivial cases and abuse to treat all the log j to be positive.
Proof. Analogously to the proof of Theorem 2, for x = ∑ j = 1 ∞ α j e j , we have
∑ n = 0 N ‖ B w n x ‖ p p ≲ ∑ j = 1 N | α j | p ( ∑ n = 0 j − 1 j j − n ⋅ log t ( j − n ) log s j ) + ∑ j = N + 1 2 N | α j | p ( ∑ n = 0 N j j − n ⋅ log t ( j − n ) log s j ) + ∑ j = 2 N + 1 ∞ | α j | p ( ∑ n = 0 N j j − n ⋅ log t ( j − n ) log s j ) : = S 1 + S 2 + S 3 .
To estimate S 3 , we note that j ≥ 2 N + 1 , n ≤ N . Then
∑ n = 0 N j j − n ⋅ log t ( j − n ) log s j ≤ 2 ∑ n = 0 N log t ( j − n ) log s j ≲ { N log t j log s j , if t > 0 ; N log t ( j − N ) log s j , if t ≤ 0.
Let L 1 = N log t j log s j and L 2 = N log t ( j − N ) log s j .
In either case (1), (2) and (3), we have t − s ≤ − 1 . If t > 0 ,
L 1 = N log t − s j ≲ N log t − s N ≲ N .
If t ≤ 0 ,
L 2 ≲ N log t ( N + 1 ) log s j ≤ N log t ( N + 1 ) log s ( 2 N + 1 ) ≲ N log t − s N ≲ N .
Then, in either case (1), (2) and (3), we have
S 3 ≲ ∑ j = 2 N + 1 ∞ | α j | p ⋅ 2 N ≲ N ‖ x ‖ p p .
We split (1) into two cases, that is when − 1 < t ≤ 0 or t > 0 , to estimate S 1 and S 2 . If − 1 < t ≤ 0 and s ≥ t + 1 . To estimate S 1 , we note that j ≤ N and
∑ n = 0 j − 1 j j − n ⋅ log t ( j − n ) log s j = j log s j ∑ n = 2 j log t n n ≤ j log s j ( log t 2 2 + ∫ 2 j log t x x d x ) = j log s j ( log t 2 2 + log t + 1 j − log t + 1 2 t + 1 ) ≲ N log t + 1 − s j ≲ N .
If t > 0 and s ≥ t + 1 , we can estimate S 1 by the following computation
j log s j ∑ n = 2 j log t n n ≤ j log s j ∫ 2 j + 1 log t x x d x = j log s j ⋅ log t + 1 ( j + 1 ) − log t + 1 2 t + 1 ≲ N log t + 1 − s j ≲ N . (1)
Thus, in the case (1) we have S 1 ≲ N ∑ j = 1 N | α j | p ≲ N ‖ x ‖ p p .
The estimate for S 2 is similar. We note that j ≥ N + 1 and
S 2 ≤ ∑ j = N + 1 2 N | α j | p ( j log s j ∑ n = 2 j log t n n ) ≲ N ‖ x ‖ p p .
Now we consider the case (2), that is t = − 1 and s > 0 . Since
j log s j ∑ n = 2 j 1 n log n ≤ j log s j ( 1 2 log 2 + ∫ 2 j 1 x log x d x ) ≲ N log log j log s j ≲ N log − s j ≲ N ,
we have
S 1 ≲ N ∑ j = 1 N | α j | p ≲ N ‖ x ‖ p p .
And similarly,
S 2 ≤ ∑ j = N + 1 2 N | α j | p ( j log s j ∑ n = 2 j 1 n log n ) ≲ N ‖ x ‖ p p .
We have the last case (3) to consider. That is t < − 1 and s ≥ 0 . Similarly to (1), we can obtain S 1 ≲ N ‖ x ‖ p p and S 2 ≲ N ‖ x ‖ p p .
In the end of the proof, by the Jensen's inequality again, we have B w is absolutely Cesàro bounded on l p ( ℕ ) .
We summarize the above two theorem as a corollary.
Corollary 2. Suppose 1 ≤ p < ∞ . Let w be a weight sequence such that
∏ m = i j | w m | ≃ ( j i ⋅ log t i log s j ) 1 / p for a real pair ( t , s ) . The weighted backward shift B w
on l p ( ℕ ) is absolutely Cesàro bounded if and only if the real pair ( t , s ) satisfies one of the following three conditions:
(1) t > − 1 and s ≥ t + 1 ,
(2) t = − 1 and s > 0 ,
(3) t < 1 and s ≥ 0 .
We also give the following
According to our result, we can construct lots of absolutely Cesàro bounded weighted backward shift.
Example 1. If 0 < s ≤ t < 1 , let
w = ( w 1 , ⋯ , w n , ⋯ ) = ( ( 2 + log 2 ) s / p ( 1 + log 1 ) t / p , ⋯ , [ n + 1 + log ( n + 1 ) ] s / p ( n + log n ) t / p , ⋯ ) .
The operator B w is absolutely Cesàro bounded on l p ( ℕ ) . It follows from i + log i ≥ i and l i m j → ∞ j + log j j = 1 and hence
∏ n = i j | w n | p = [ j + 1 + log ( j + 1 ) ] s ( i + log i ) t ∏ n = i + 1 j ( n + log n ) s − t ≲ j s i t
for any j ≥ i ∈ ℕ .
Example 2. If 0 < s < t < 1 , let
w = ( w 1 , ⋯ , w n , ⋯ ) = ( ( 2 log 3 ) s / p ( log 2 ) t / p , ⋯ , [ ( n + 1 ) log ( n + 2 ) ] s / p [ n log ( n + 1 ) ] t / p , ⋯ ) .
The operator B w is absolutely Cesàro bounded on l p ( ℕ ) . It follows from i log ( i + 1 ) ≳ i and log ( j + 1 ) ≲ j t − s 2 s and hence
∏ n = i j | w n | p = [ ( j + 1 ) log ( j + 2 ) ] s ( i log ( i + 1 ) ) t ∏ n = i + 1 j − 1 [ n log ( n + 1 ) ] s − t ≲ j s + t 2 i t
for any j ≥ i ∈ ℕ .
Example 3. If t ≥ 0 , let
w = ( w 1 , ⋯ , w m , ⋯ ) = ( 0, ⋯ , ( m + 1 ) 1 / p log t + 1 p ( m + 1 ) ⋅ log t p m m 1 / p , ⋯ ) .
The operator B w is absolutely Cesàro bounded on l p ( ℕ ) by Theorem 4. One can conduct the following computation that
∏ m = i j | w m | = ( j + 1 ) 1 p i 1 p ⋅ log t p i log t + 1 p ( j + 1 ) ⋅ ∏ k = i + 1 j 1 log 1 p k ≤ ( 2 log 2 ) 1 p ⋅ ( j i ⋅ log t i log t + 1 j ) 1 p .
We will also find a new example of non Cesàro bounded backward shift as follows.
Example 4. If t ∈ ℝ , let
w = ( w 1 , ⋯ , w m , ⋯ ) = ( 0 , ⋯ , ( m + 1 log t ( m + 1 ) ⋅ log t m m ) 1 / p , ⋯ ) .
The operator B w is not Cesàro bounded on l p ( ℕ ) by Theorem 3.
In this paper, we proved Cesàro boundedness by constructing the proper product of weight functions ∏ a b w n by the fraction of two monomials of the indexes. The method of proof is to obtain the characterization of absolutely Cesàro bounded and non Cesàro bounded by proper scaling and Jensen’s inequality. we give some examples after our results.
The author declares no conflicts of interest regarding the publication of this paper.
Gao, H. (2021) Cesàro Bounded Weighted Backward Shift. Journal of Applied Mathematics and Physics, 9, 197-209. https://doi.org/10.4236/jamp.2021.91014