• No results found

Applied Mathematics Letters

N/A
N/A
Protected

Academic year: 2021

Share "Applied Mathematics Letters"

Copied!
7
0
0

Loading.... (view fulltext now)

Full text

(1)

Applied Mathematics Letters 22 (2009) 1803–1809

Contents lists available atScienceDirect

Applied Mathematics Letters

journal homepage:www.elsevier.com/locate/aml

On a result of Flett for Cesáro matrices

Dansheng Yu

Department of Mathematics, Hangzhou Normal University, Hangzhou Zhejiang 310036, China

a r t i c l e i n f o

Article history:

Received 21 April 2008

Received in revised form 17 June 2009 Accepted 17 June 2009

Keywords:

Cesáro matrix Conservative matrix Absolute summability

a b s t r a c t

Let snbe the partial sums of the seriesP

n=0an.We consider the sufficient conditions for a matrix T=(tnk)such that

X

n=1

αn|snsn1|k< ∞

implies

X

n=1

βn|tntn1|s< ∞

where{αn}and{βn}are two given positive sequences and k,s > 0, and{tn}is the T - transformation of{sn}.Our results extend the related results of Flett [T.M. Flett, On an extension of absolute summability and some theorems of Littlewood and Paley, Proc.

London Math. Soc. 7 (1957) 113–141] and Savas and Sevli [E. Savaş, H. Sevli, On extension of a result of Flett for Cesáro matrices, Appl. Math. Lett. 20 (2007) 476–478].

© 2009 Elsevier Ltd. All rights reserved.

Let snbe the partial sums of the series

P

n=0an. The Cesáro means of order

α

of the series

P

n=0anare defined by

σ

nα

:=

1

Aαn

n

X

j=0

Aα−nj1sj

,

n

=

0

,

1

, . . . ,

where

Aαn

:=

0

(

n

+ α +

1

)

0

(α +

1

)

0

(

n

+

1

) ,

n

=

0

,

1

, . . . .

Let

(

C

, α)

, the Cesáro matrix of order

α

, be the lower triangular matrix Aα−nν1

/

Aαn

 .

Flett [1] introduced the concept of absolute summability of order k. A series

P

n=0anis said to be summable

|

C

, α|

k

,

k

1

, α > −

1, if

X

n=1

nk1

σ

nα1

− σ

nα

k

< ∞.

Das [2] defined a matrix T

:=

tnj



to be absolutely kth-power conservative for k

1, denoted by T

B

(

Ak

)

, that is, if

{

sn

}

satisfies

X

n=1

nk1

|

sn

sn1

|

k

< ∞,

(1)

E-mail address:danshengyu@yahoo.com.cn.

0893-9659/$ – see front matter©2009 Elsevier Ltd. All rights reserved.

doi:10.1016/j.aml.2009.06.023

CORE View metadata, citation and similar papers at core.ac.uk

provided by Elsevier - Publisher Connector

(2)

then

X

n=1

nk1

|

tn

tn1

|

k

< ∞,

(2)

where tn

=

n

X

j=0

tnjsj

.

Flett [1] established the following inclusion theorem for

|

C

, α|

k. If the series

P

n=0an is summable

|

C

, α|

k, it is also summable

|

C

, α|

rfor each r

k

1

, α > −

1

, β > α +

1k

1

r. Especially, a series

P

n=0anwhich is

|

C

, α|

ksummable is also

|

C

, β|

ksummable for k

1

, β > α > −

1

.

If one sets

α =

0, from the above inclusion result, we have Theorem A. Let k

1, then

(

C

, β) ∈

B

(

Ak

) (

k

1

)

for

β ≥

0

.

Recently, Savaş and Şevli [3] claimed thatTheorem Aholds for all

β > −

1

.

However, in their proof (see P. 477, [3]), they said that Applying Hölder’s inequality, we have

X

n=1

1 n

τ

nβ

k

=

X

n=1

1 n

1 Aβn

n

X

v=1

Aβ−nv1

v

av

k

X

n=1

1 n



Aβn



k n

X

v=1

Aβ−nv1

v

k

|

av

|

k

n

X

v=1

Aβ−nv1

!

k1

.

(3)

Unfortunately,(3)is not true when

1

< β <

0. In fact, take a1

=

1

,

a2

=

a3

= · · · =

0, then the middle term of(3)equals

X

n=1

1 n

Aβ−n11 Aβn

k

>

Aβ−

1 0

Aβ1

!

k

=

1

(β +

1

)

k

,

while the right-hand side of(3)is

X

n=1

Aβ−n11 n



Aβn



k Aβn

Aβ−n 1



k1

<

Aβ−

1 0



Aβ1



k



Aβ1

Aβ−1 1



k1

=

1

(β +

1

)

k

,

where we used the following facts:

Aβ−n11

<

0

,

Aβ−n 1

<

0 and Aβn

>

0

,

n

2

, −

1

< β <

0

.

Since(3)plays an essential role, their proof of the result is not true. The correctness ofTheorem Afor

1

< β <

0 need to be further verified. In spite of this, Savaş and Şevli [3] have given a simple proof ofTheorem Aby adopting some new ideas.

Motivated byTheorem A, a natural problem is that what are the sufficient conditions for T such that

X

n=1

α

n

|

sn

sn1

|

k

< ∞

(4)

implies that

X

n=1

β

n

|

tn

tn1

|

s

< ∞

(5)

where

{ α

n

}

and

{ β

n

}

are two given positive sequences and k

,

s

>

0?

The object of this note is to answer the above problem by establishing the followingTheorem 1. We also prove few corollaries(1)–(4)on absolute Cesáro summability andCorollary 5on absolute Riesz summability.

Theorem 1. Let

{ α

n

}

and

{ β

n

}

be positive sequences and k

>

0

,

s

1. Assume that T

:=

tnj



is a lower triangular matrix satisfying

P

n

j=0tnj

=

1 for any n

0. If

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O i1k

α

i

 ,

i

=

1

,

2

, . . . ,

(6)

and

(

i

|

si

si1

| )

sk

=

O

(

1

) ,

(7)

(3)

where

e

tni

:=

 

 

n

X

j=i

tnj

n1

X

j=i

tn1,j

,

0

i

n

1

,

tnn

,

i

=

n

,

then(4)implies(5).

Proof. Since (set s1

:=

0)

tn

=

n

X

j=0

tnjsj

=

n

X

j=0

tnj

j

X

i=0

(

si

si1

)

!

=

n

X

i=0

(

si

si1

) X

n

j=i

tnj

! ,

then

tn

tn1

=

n

X

i=0

(

si

si1

)

n

X

j=i

tnj

!

n1

X

i=0

(

si

si1

)

n1

X

j=i

tn1,j

!

=

n

X

i=0

e

tni

(

si

si1

) =

n

X

i=1

e

tni

(

si

si1

) ,

where in the last inequality, we used the fact that

e

tn0

=

0, which follows from

P

n

j=0tnj

=

1 and the definition of

e

tn0

.

By Hölder’s inequality,(6)and(7), we have

X

n=1

β

n

|

tn

tn1

|

s

=

X

n=1

β

n

n

X

i=1

e

tni

(

si

si1

)

s

X

n=1

β

n n

X

i=1

e

tni

i

!

s1 n

X

i=1

e

tni

i is

|

si

si1

|

s

!

=

O

(

1

)

X

n=1

β

n n

X

i=1

e

tni

i

!

s1 n

X

i=1

e

tni

ik1

|

si

si1

|

k

!

=

O

(

1

)

X

i=1

ik1

|

si

si1

|

k

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O

(

1

)

X

i=1

α

i

|

si

si1

|

k

.

Theorem 1is proved. 

A non-negative sequence

{

an

}

is said to be almost decreasing, if there is a positive constant K such that an

Kam

holds for all n

m, and it is said to be quasi-

β

-power decreasing with some real number

β

, if



nβan

is almost decreasing.

It should be noted that every decreasing sequence is an almost decreasing sequence, and every almost decreasing sequence is a quasi-

β

-power decreasing sequence for any non-positive index

β

, but the converse is not true.

The following properties of Aαnare well known (see [4], P.77):

Lemma 1. (i) Aαnis positive for

α > −

1, increasing (as a function of n) for

α >

0 and decreasing for

1

< α <

0

;

and A0n

=

1 for all n

.

(ii) Aαn

=

0(α+

1) 1

+

O 1n



.

We give some applications ofTheorem 1now.

Corollary 1. Let T be the Cesáro matrix of order

α ≥

0 and k

>

0

,

s

1. Assume that

{ β

n

}

is a positive sequence such that



n1s

β

n

is quasi-

ε

-power decreasing for some

ε > −

1

.

If (7)holds, then(4)implies(5)with

α

n

=

nks

β

n

.

Proof. Let

tnj

:=

A

α−1 nj

Aαn

,

j

=

0

,

1

, . . . ,

n

.

It is clear that

(4)

n

X

j=0

tnj

=

1 Aαn

n

X

j=0

Aα−nj1

=

1

.

For 0

i

n

1, a direct calculation yields

e

tni

=

1 Aαn

n

X

j=i

Aα−nj1

1 Aαn1

n

X

j=i

Aα−n11j

=

1 Aαn

ni

X

j=0

Aα−j 1

1 Aαn1

n1i

X

j=0

Aα−j 1

=

A

αni

Aαn

A

αn1i

Aαn1

=

i n

Aα−ni1

Aαn

,

(8)

and

e

tnn

=

A

α−1 0

Aαn

=

1

Aαn

.

(9)

By(8)and(9)andLemma 1, we have

n

X

v=1

e

tnv

v =

1

nAαn

n

X

v=1

Aα−nv1

=

1 nAαn

n

X

v=0

Aα−nv1

A

α−1 n

nAαn

=

O



1 n



.

(10)

Since



n1s

β

n

is quasi-

ε

-power decreasing for some

ε > −

1, by(10), we have

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O

(

1

)

X

n=i

n1s

β

n

e

tni

=

O

(

1

)

X

n=i

n1s+ε

β

n

e

tni

nε

=

O i2s+ε

β

i



X

n=i

Aα−ni1 n1+εAαn

.

Therefore, byLemma 1and the condition

ε > −

1, we have

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O i2s+ε

β

i



1

i1+εAαi

2i

X

n=i

Aα−ni1

+

X

n=2i+1

Aα−ni1 n1+εAαn

!

=

O i2s+ε

β

i



1

i1+εAαi

i

X

n=0

Aα−n 1

+

X

n=2i+1

(

n

i

)

α−1 n1+ε+α

!

=

O i2s+ε

β

i



i1ε

+

X

n=2i+1

n2ε

!

=

O i1s

β

i

 =

O i1k

α

i

 .

Therefore, we obtainCorollary 1by applyingTheorem 1. 

Let

β

n

=

nδk+k1logγn

,

n

1

,

k

>

0

,

s

1. If

δ <

1+ksk

,

then there is an

ε

such that

1

< ε < −δ

k

k

+

s. Thus, by noting that nε n1s

β

n

 =

nε−(−δkk+s)logγn, we see that



n1s

β

n

is quasi-

ε

-power decreasing for

γ ∈

R

.

Now, applying Corollary 1, we have

Corollary 2. Let T be the Cesáro matrix of order

α ≥

0, and let k

>

0

,

s

1 and

γ ∈

R. If

δ <

1+skkand(7)holds, then

X

n=1

nδk+2ks1logγn

|

sn

sn1

|

k

< ∞

implies

X

n=1

nδk+k1logγn

σ

nα

− σ

nα1

s

< ∞, α ≥

0

.

(5)

In particular (by taking s

=

k), if

δ <

1k, then

X

n=1

nδk+k1logγn

|

sn

sn1

|

k

< ∞

implies

X

n=1

nδk+k1logγn

σ

nα

− σ

nα1

k

< ∞, α ≥

0

.

Remark 1. By taking s

=

k

, δ = γ =

0 inCorollary 2, we obtainTheorem A.

Corollary 3. Let T be the Cesáro matrix of order

1

< α <

0 and k

>

0

,

s

1. Assume that

{ β

n

}

is a positive sequence such that



n(1+α)(1s)

β

n

is quasi-

ε

-power decreasing for some

ε > −

1

.

If (7)holds, then(4)implies(5)with

α

n

=

nk(1+α)s

β

n

.

Proof. When

1

< α <

0, it is clear that Aα−n 1

<

0 for n

=

1

,

2

, . . . ,

and Aα−0 1

=

1. ByLemma 1,(8)and(9), we get

n

X

v=1

e

tnv

v =

1

nAαn

n1

X

v=1

Aα−nv1

+

A

α−1 0

nAαn

=

1 nAαn

n

X

v=0

Aα−nv1

Aα−n 1

Aα−0 1

+

1 nAαn

=

1 nAαn

Aαn

Aα−n 1

Aα−0 1

+

1 nAαn

=

O



1 n1+α



,

(11)

2i

X

n=i+1

Aα−ni1

=

2i

X

n=i+1

Aα−ni1

=

i

X

n=0

Aα−n 1

Aα−0 1

=

Aαi

Aα−0 1

=

O

(

1

) ,

(12)

and

X

n=2i+1

Aα−ni1

n1+εAαn

=

O

(

1

)

X

n=2i+1

(

n

i

)

α−1 n1+ε+α

=

O

(

1

)

X

n=2i+1

n2ε

=

O i1ε



(13)

for

ε > −

1. Combining(11)–(13)and noting that



n(1+α)(1s)

β

n

is quasi-

ε

-power decreasing with

ε > −

1, we have

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O

(

1

)

X

n=i

n(1+α)(1s)

β

n

e

tni

=

O

(

i

)

X

n=i

n(1+α)(1s)

β

n

Aα−ni1 nAαn

=

O



i1+(1+α)(1s)

β

i

1 iAαi

 +

O

(

i

)

X

n=i+1

n(1+α)(1s)

β

n

Aα−ni1 nAαn

=

O



i1+(1+α)(1s)

β

i

1 iAαi

 +

O

(

i

)

X

n=i+1

n(1+α)(1s)+

β

n

Aα−ni1 n1+Aαn

=

O i1(1+α)s

β

i

 +

O i1+(1+α)(1s)+ε

β

i



X

n=i+1

Aα−ni1

n1+εAαn

=

O i1(1+α)s

β

i

 +

O i1+(1+α)(1s)+

β

i



2i

X

n=i+1

Aα−ni1

n1++α

+

O i1+(1+α)(1s)+ε

β

i



X

n=2i+1

Aα−ni1

n1+εAαn (byLemma 1again)

(6)

=

O i1(1+α)s

β

i

 +

O i(1+α)(1s)−α

β

i



2i

X

n=i+1

Aα−ni1

+

O i1+(1+α)(1s)+ε

β

i



X

n=2i+1

Aα−ni1

n1+εAαn

=

O i1(1+α)s

β

i

 +

O i(1+α)(1s)

β

i



=

O i1(1+α)s

β

i

 =

O i1k

α

i

 .

Therefore, we obtainCorollary 3byTheorem 1. 

Similar to the deduction ofCorollary 2, we have the following corollary ofCorollary 3:

Corollary 4. Let T be the Cesáro matrix of order

1

< α <

0 and let k

>

0

,

s

1 and

γ ∈

R

.

If

δ <

2+(1+α)(ks1)−kand(7) holds, then

X

n=1

nδk+2k(1+α)s1logγn

|

sn

sn1

|

k

< ∞

implies

X

n=1

nδk+k1logγn

σ

nα

− σ

nα1

s

< ∞, α ≥

0

.

In particular (by taking s

=

k), if

δ <

αkkα+1

,

then

X

n=1

nδk+kαk1logγn

|

sn

sn1

|

k

< ∞

implies

X

n=1

nδk+k1logγn

σ

nα

− σ

nα1

k

< ∞, α ≥

0

.

Corollary 5. Let s

=

k

1

, δ ∈

R

, {

pn

}

be a positive sequence, such that Pn

= P

n

n=0pi

→ ∞

as n

→ ∞ ,

and

n

X

i=1

Pi

i

=

O

(

Pn

) ,

(14)

X

n=i



Pn pn



δk+ks

pn PnPn1

=

O



Pi pi



δk+ks

1 Pi1

!

.

(15)

If (7)is satisfied, then(4)implies(5)with

α

n

=

nk1



Pn pn



δk+ks

, β

n

=



Pn pn



δk+k1

. Proof. Let

tnj

:=

pj

Pn

,

j

=

0

,

1

, . . . ,

n

,

then

P

n

j=0tnj

=

1 for any n

0. Direct calculations yield

e

tni

=

n

X

j=i

tnj

n1

X

j=i

tn1,j

=

pn Pn

+



1 Pn

1

Pn1



n1

X

j=i

pj

=

pnPi1 PnPn1

,

1

i

n

1

,

(16)

and

e

tn0

=

0

, e

tnn

=

pn

Pn

.

(17)

Therefore, by(14), we have

(7)

n

X

v=1

e

tnv

v =

pn

PnPn1 n

X

v=1

Pv−1

v =

O



pn Pn

 .

Now, by(15), we have

X

n=i

β

n n

X

v=1

e

tnv

v

!

s1

e

tni

=

O

X

n=i



Pn pn



δk+k1



pn Pn



s1

pnPi1

PnPn1

!

=

O

(

Pi1

)

X

n=i



Pn pn



δk+ks

pn PnPn1

=

O



Pi pi



δk+ks

! ,

which completes the proof ofCorollary 5. 

Remark 2. If

δ =

0

,

s

=

k

,

(15)can be deduced from the facts that Pn

→ ∞

as n

→ ∞

, and Ppn

nPn1

=

1

Pn1

1

Pn

.

Remark 3. If

{

pn

}

, in addition, satisfies npn

Pn, then

α

ninCorollary 5becomes nδk+k1when s

=

k

.

Acknowledgements

The author is grateful to the referees for their careful reading and kind suggestions which improved the presentation of the paper. The research is supported by Research Project of Hangzhou Normal University.

References

[1] T.M. Flett, On an extension of absolute summability and some theorems of Littlewood and Paley, Proc. London Math. Soc. 7 (1957) 113–141.

[2] G. Das, A tauberian theorem for absolute summability, Proc. Cambridge Philos. Soc. 67 (1970) 321–326.

[3] E. Savaş, H. Sevli, On extension of a result of Flett for Cesáro matrices, Appl. Math. Lett. 20 (2007) 476–478.

[4] A. Zygmund, Trigonometric Series, Cambridge Univ. Press, Cambridge, 1977.

References

Related documents

7KH ILEUHV PHQWLRQHG DERYH UHSUHVHQW D VHSDUDWH FODVV RI SHUWXUEHG ILEUHV ZLWK SHULRGLFDO SHUWXUEDWLRQ RI WKHLU FURVVVHFWLRQ 6XFK SHUWXUEDWLRQV FDQ EH FUHDWHG ZKLOH PDQXIDFWXULQJ

• While both internal and external data centers operators commit capital to build larger data centers the average square footage of the larger data centers are also expected

Genetic Algorithm (GA) is applied to the optimization of the phase shifter proposed in [4] and a better performance of this type of phase shifter is obtained.. Genetic Algorithm (GA)

We found that Hbp1 controls the length of the cell cycle in neural stem/progenitor cells by modulating the expression levels of cyclin D1, thereby regulating the timing of

Primary data on post-harvest handling, storage &amp; gaps, increment in yield and yield loss, marketing, income, access to agricultural inputs, food shortage and

The combination of variable weights of internal network of processing units and variable number of processing units that can be used to encode the data makes the process

The main objectives of this study were to assess patient satisfaction with the services provided in hospitals affiliated to Tehran University of Medical Sciences, Iran, identify