• No results found

An Application of δ-Quasi Monotone Sequence

N/A
N/A
Protected

Academic year: 2020

Share "An Application of δ-Quasi Monotone Sequence"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

ISSN 2291-8639

Volume 14, Number 2 (2017), 134-139

http://www.etamaths.com

AN APPLICATION OF δ-QUASI MONOTONE SEQUENCE

H˙IKMET SEYHAN ¨OZARSLAN∗

Abstract. In this paper, a known theorem dealing with|A, pn|k summability method of infinite

series has been generalized to|A, pn;δ|ksummability method. Also, some results have been obtained.

1. Introduction

A sequence (dn) is said to be δ-quasi-monotone, if dn → 0, dn > 0 ultimately and ∆dn ≥ −δn, where ∆dn=dn−dn+1 andδ= (δn) is a sequence of positive numbers (see [1]). Let Pan be a given

infinite series with partial sums (sn). Let (pn) be a sequence of positive numbers such that

Pn=

n

X

v=0

pv→ ∞ as n→ ∞, (P−i=p−i= 0, i≥1). (1.1)

The sequence-to-sequence transformation

zn=

1

Pn n

X

v=0

pvsv (1.2)

defines the sequence (zn) of the Riesz mean or simply the N , pn¯

mean of the sequence (sn), generated by the sequence of coefficients (pn) (see [5]). The seriesPan is said to be summable

N , p¯ n

k,k≥1, if (see [2])

X

n=1

Pn

pn

k−1

|∆zn−1|k <∞, (1.3)

where

∆zn−1=−

pn PnPn−1

n

X

v=1

Pv−1av, n≥1.

LetA= (anv) be a normal matrix, i.e., a lower triangular matrix of nonzero diagonal entries. Then

Adefines the sequence-to-sequence transformation, mapping the sequence s= (sn) toAs= (An(s)), where

An(s) = n

X

v=0

anvsv, n= 0,1, ... (1.4)

The seriesP

an is said to be summable|A, pn;δ|k,k≥1 andδ≥0, if (see [6])

X

n=1

Pn

pn

δk+k−1

|∆¯An(s)|k<, (1.5)

where

¯

∆An(s) =An(s)−An−1(s).

If we set δ = 0, then |A, pn;δ|k summability reduces to |A, pn|k summability (see [8]). If we take anv = Ppvn andδ= 0, then|A, pn;δ|k summability reduces to|N , p¯ n|k summability.

2010Mathematics Subject Classification. 26D15, 40D15, 40F05, 40G99.

Key words and phrases. summability factors; absolute matrix summability; quasi-monotone sequences; infinite series; H¨older inequality; Minkowski inequality.

c

2017 Authors retain the copyrights of their papers, and all open access articles are distributed under the terms of the Creative Commons Attribution License.

(2)

In the special caseδ= 0 andpn = 1 for alln,|A, pn;δ|k summability is the same as|A|k summability

(see [9]). Also, if we takeanv= pv

Pn, then|A, pn;δ|k summability is the same as|

¯

N , pn;δ|k summability

(see [4]).

Before stating the main theorem we must first introduce some further notations.

Given a normal matrixA= (anv), we associate two lower semimatrices ¯A= (¯anv) and ˆA= (ˆanv) as follows:

¯

anv=

n

X

i=v

ani, n, v= 0,1, ... (1.6)

and

ˆ

a00= ¯a00=a00, ˆanv= ¯anv−¯an−1,v, n= 1,2, ... (1.7)

It may be noted that ¯A and ˆA are the well-known matrices of series-to-sequence and series-to-series transformations, respectively. Then, we have

An(s) =

n

X

v=0

anvsv =

n

X

v=0 ¯

anvav (1.8)

and

¯

∆An(s) =

n

X

v=0 ˆ

anvav. (1.9)

2. Known Results

In [3], Bor has proved the following theorem dealing with|N , pn¯ |k summability.

Theorem 2.1. Let (Xn) be a positive non-decreasing sequence, (λn) →0 asn → ∞ and(pn) be a

sequence of positive numbers such that

Pn=O(npn) as n→ ∞. (2.1)

Suppose that there exist a sequence of numbers (Bn) which is δ-quasi monotone with

PnXnδn<,PBnXn is convergent and|λn| ≤ |Bn|for alln. If

m

X

n=1

pn Pn|tn|

k=O(Xm) as m→ ∞, (2.2)

then the seriesP

anλn is summable|N , pn¯ |k,k≥1.

Later on, in [7], ¨Ozarslan and S¸akar have proved the following theorem dealing with|A, pn|k

summa-bility factors of infinite series.

Theorem 2.2. Let A= (anv)be a positive normal matrix such that

¯

an0= 1, n= 0,1, ..., (2.3)

an−1,v≥anv f or n≥v+ 1, (2.4)

ann=O

pn

Pn

, (2.5)

|ˆan,v+1|=O(v|∆vˆanv|). (2.6)

If(Xn)is a positive non-decreasing sequence and the conditions of Theorem 2.1 are satisfied, then the seriesP

(3)

3. Main Result

The purpose of this paper is to generalize Theorem 2.2 for |A, pn;δ|k summability.

Now, we shall prove the following more general theorem.

Theorem 3.1. Let A= (anv)be a positive normal matrix such that

m+1

X

n=v+1

Pn

pn

δk

|∆vˆanv|=O

( Pv

pv

δk−1)

as m→ ∞. (3.1)

If all conditions of Theorem 2.2 with condition (2.2) replaced by:

m

X

n=1

P

n pn

δk−1

|tn|k=O(Xm) as m→ ∞, (3.2)

are satisfied, then the seriesPanλn is summable|A, pn;δ|

k ,k≥1 and0≤δ <1/k.

We require the following lemmas for the proof of Theorem 3.1.

Lemma 3.1. ( [3]). Under the conditions of Theorem 3.1, we have that

|λn|Xn=O(1) as n→ ∞. (3.3)

Lemma 3.2. ( [3]). Let(Xn)be a positive non-decreasing sequence. If(Bn)isδ-quasi monotone with P

nXnδn<∞andP

BnXn is convergent, then

nBnXn=O(1) as n→ ∞, (3.4)

X

n=1

nXn|∆Bn|<∞. (3.5)

4. Proof of Theorem 3.1

Let (In) denotes A-transform of the seriesPanλn. Then, by (1.8) and (1.9), we have

¯ ∆In =

n

X

v=0 ˆ

anvavλv= n

X

v=1 ˆ

anvλv v vav.

Applying Abel’s transformation to this sum, we get that

¯ ∆In =

n−1

X

v=1 ∆v

ˆanvλv

v

v

X

r=1

rar+ˆannλn

n n

X

r=1

rar

=

n−1

X

v=1

v+ 1

v ∆v(ˆanv)λvtv+ n−1

X

v=1

v+ 1

v ˆan,v+1∆λvtv

+

n−1

X

v=1 ˆ

an,v+1λv+1

tv v +

n+ 1

n annλntn

= In,1+In,2+In,3+In,4.

To complete the proof of Theorem 3.1, by Minkowski’s inequality, it is sufficient to show that

X

n=1

Pn

pn

δk+k−1

(4)

First, whenk >1, applying H¨older’s inequality with indiceskandk0, where k1+k10 = 1, we have that

m+1

X

n=2

Pn

pn

δk+k−1

|In,1|k = O(1) m+1

X

n=2

Pn

pn

δk+k−1 n−1 X

v=1

|∆v(ˆanv)||λv||tv|

!k

= O(1)

m+1

X

n=2

Pn pn

δk+k−1 n−1 X

v=1

|∆v(ˆanv)||λv|k|tv|k

!

×

n−1

X

v=1

|∆v(ˆanv)|

!k−1

.

By (1.6) and (1.7), we have that

∆v(ˆanv) = ˆanv−ˆan,v+1= ¯anv−an¯ −1,v−¯an,v+1+ ¯an−1,v+1=anv−an−1,v.

Thus using (1.6), (2.3) and (2.4)

n−1

X

v=1

|∆v(ˆanv)|= n−1

X

v=1

(an−1,v−anv)≤ann.

Hence, we get

m+1

X

n=2

Pn

pn

δk+k−1

|In,1|k = O(1) m+1

X

n=2

Pn

pn

δk n−1 X

v=1

|∆v(ˆanv)||λv|k|tv|k

!

= O(1)

m

X

v=1

|λv|k−1|λv||tv|k m+1

X

n=v+1

Pn

pn

δk

|∆v(ˆanv)|

= O(1)

m

X

v=1

P

v pv

δk−1

|λv||tv|k

= O(1)

m−1

X

v=1 ∆|λv|

v

X

r=1

Pr

pr

δk−1

|tr|k

+ O(1)|λm| m

X

v=1

P

v pv

δk−1

|tv|k

= O(1)

m−1

X

v=1

|∆λv|Xv+O(1)|λm|Xm

= O(1)

m−1

X

v=1

BvXv+O(1)|λm|Xm

= O(1) as m→ ∞,

(5)

Again, by using H¨older’s inequality, we have that m+1 X n=2 Pn pn

δk+k−1

|In,2|k = O(1)

m+1

X

n=2

Pn

pn

δk+k−1 n−1 X

v=1

|an,vˆ +1||∆λv||tv|

!k

= O(1)

m+1 X n=2 Pn pn

δk+k−1 n−1 X

v=1

v|∆v(ˆanv)| |Bv||tv|k

!

×

n−1

X

v=1

v|∆v(ˆanv)| |Bv|

!k−1

.

By using (3.4), we get

m+1 X n=2 P n pn

δk+k−1

|In,2| k

= O(1)

m+1 X n=2 P n pn

δk n−1 X

v=1

v|∆v(ˆanv)| |Bv||tv|k

!

= O(1)

m

X

v=1

v|Bv||tv|k m+1

X

n=v+1

Pn

pn

δk

|∆v(ˆanv)|

= O(1)

m X v=1 P v pv δk−1

v|Bv||tv|k.

Now, applying Abel’s transformation to this sum, we have that

m+1

X

n=2

Pn

pn

δk+k−1

|In,2|k = O(1)

m−1

X

v=1

|∆ (v|Bv|)|

v X r=1 Pr pr δk−1

|tr|k

+ O(1)m|Bm| m X v=1 Pv pv δk−1

|tv|k

= O(1)

m−1

X

v=1

v|∆Bv|Xv+O(1)

m−1

X

v=1

BvXv+O(1)mBmXm

= O(1) as m→ ∞,

by virtue of the hypotheses of Theorem 3.1 and Lemma 3.2. Also, as inIn,1, we have that

m+1 X n=2 Pn pn

δk+k−1

|In,3|k ≤

m+1 X n=2 Pn pn

δk+k−1 n−1 X

v=1

|ˆan,v+1||λv+1||tv|

v

!k

= O(1)

m+1 X n=2 P n pn

δk+k−1 n−1 X

v=1

|∆v(ˆanv)| |λv+1|k|tv|k

!

×

n−1

X

v=1

|∆v(ˆanv)|

!k−1

= O(1)

m

X

v=1

|λv+1||tv|k m+1

X

n=v+1

Pn pn

δk

|∆v(ˆanv)|

= O(1)

m X v=1 Pv pv δk−1

|λv+1||tv|k

= O(1) as m→ ∞,

(6)

Finally, as inIn,1, we have that

m

X

n=1

Pn

pn

δk+k−1

|In,4|k = O(1)

m

X

n=1

Pn

pn

δk+k−1

|λn|k|tn|kaknn

= O(1)

m

X

n=1

P

n pn

δk−1

|λn||λn|k−1|tn|k

= O(1)

m

X

n=1

P

n pn

δk−1

|λn||tn|k

= O(1) as m→ ∞,

by using (2.5), (3.1), (3.2) and (3.3). This completes the proof of Theorem 3.1.

It should be noted that if we take δ = 0 in Theorem 3.1, then we get Theorem 2.2. In this case, condition (3.2) reduces to condition (2.2). Also, if we takeδ= 0 and anv = pv

Pn, then we get Theorem

2.1.

References

[1] R. P. Boas, Quasi-positive sequences and trigonometric series, Proc. London Math. Soc. 14A (1965), 38-46. [2] H. Bor, On two summability methods, Math. Proc. Cambridge Philos. Soc. 97 (1985), 147-149.

[3] H. Bor, On quasi-monotone sequences and their applications, Bull. Austral. Math. Soc. 43 (1991), 187-192. [4] H. Bor, On local property of|N , p¯ n;δ|ksummability of factored Fourier series, J. Math. Anal. Appl. 179 (1993),

646–649.

[5] G. H. Hardy, Divergent Series, Oxford University Press, Oxford, 1949.

[6] H. S. ¨Ozarslan and H. N. ¨O˘gd¨uk, Generalizations of two theorems on absolute summability methods, Aust. J. Math. Anal. Appl. 1 (1) (2004), Article 13, 7 pp.

[7] H. S. ¨Ozarslan and M. ¨O. S¸akar, A new application of absolute matrix summability, Math. Sci. Appl. E-Notes 3 (2015), 36-43.

[8] W. T. Sulaiman, Inclusion theorems for absolute matrix summability methods of an infinite series. IV, Indian J. Pure Appl. Math. 34 (11) (2003), 1547-1557.

[9] N. Tanovi˘c-Miller, On strong summability, Glas. Mat. Ser. III 14 (34) (1979), 87-97.

Department of Mathematics, Erciyes University, 38039 Kayseri, Turkey

References

Related documents

If the figure of Miss Aldclyffe represents androgyny pushed to such an extreme that her sexual identity is in question, a type which Hardy tempered in later novels, her responses

Global sweat odour intensity was significantly higher in non-AP users (median 3.11) than in AP users (median 1.57) [Figure 1 and Additional file 3: Table S2].. Three other de-

the foregoing researcher (hitt, 2003 and arcavi &amp; hadas, 2002) also points out that mathematical visualization of a problem plays an important role, and involves understanding

Under the addition of formate, H 2 production increased more than 2-fold in BL21 cells with recombinant hydrogenase 1, compared to the culture without formate (bars (e) vs (b),

The cause of Errors in a text are Forgetfulness, Errors due to misunderstanding, Errors in identification, Errors made by amateurs, Willful errors, Inadvertent errors, Errors

In many queueing systems the arriving customers may not join the queue due to impatience if the number of customers is greater than the predetermined threshold

In this paper we proposed E-BCH code as channel coding and biasing technique is used to control the PAPR further.. The remainder of this paper is organized

Authors in [10] proposed DE-MAC (Distributed Energy Aware MAC) which exploits the inherent features of TDMA (Time Division Multiple Access) in order to avoid energy loss