• 検索結果がありません。

Characterizations Of (p; )-Convex Sequences

N/A
N/A
Protected

Academic year: 2022

シェア "Characterizations Of (p; )-Convex Sequences"

Copied!
8
0
0

読み込み中.... (全文を見る)

全文

(1)

Characterizations Of (p; )-Convex Sequences

Xhevat Zahir Krasniqi

y

Received 2 July 2016

Abstract

The class of convex sequences has important applications in several branches of mathematics as well as their generalizations. In this paper, we have introduced two new classes of convex sequences, the so-called(p; )-convex sequences and p-starshaped sequences. Moreover, the characterizations of sequences belonging to these class are discussed.

1 Introduction

The set of convex sequences is one of proper and important subset of the set of real sequences. This class is raised as a result of e¤orts to solve several problems in math- ematics. Since the beginning of time, the sequences that belong to that class, have considerable applications in some branches of mathematics, in particular in mathemat- ical analysis. For example, such sequences are widely used in theory of inequalities (see [12, 7, 8]), in absolute summability of in…nite series (see [1, 2]), and in theory of Fourier series, related to their uniform convergence and the integrability of their sum functions (see as example [6], page 587).

Let(an)1n=0be a real sequence and let the di¤erences of orders0;1;2of the sequence (an)1n=0 be de…ned by

40an =an; 41an=an+1 an; 42an=an+2 2an+1+an; n= 0;1; : : : ; and throughout the paper we shall write4an instead of41an.

Next de…nition presents the well-known notion of a convex sequence of order2.

DEFINITION 1. A sequence(an)1n=0is said to be convex of order2(or just convex) if

42an 0;

for alln 0.

Various generalizations of convexity were studied by many authors. For instance, in [5] was introduced next:

Mathematics Sub ject Classi…cations: 26A51, 26A48, 26D15.

yUniversity of Prishtina "Hasan Prishtina", Faculty of Education, Department of Mathematics and Informatics, Avenue "Mother Theresa " no. 5, Prishtinë 10000, Kosovo

77

(2)

DEFINITION 2. A sequence (an)1n=0 is said to be p-convex for a positive real number pif

Lp(an) 0;

for alln= 0;1; : : :, where the di¤erence operatorLp is de…ned by Lp(an) =an+2 (1 +p)an+1+pan:

Another generalization of the concept of convexity can be found in [4] and [3]. In [4] is given the following de…nition:

DEFINITION 3. If for a sequence(an)1n=0the inequality an pan+1 0;

holds true for everyn 0, then it is said that(an)1n=0 is ap-monotone sequence.

Here, we will say that(an)1n=0 is ap-increasing sequence if the inequality an+1 pan 0;

holds true for everyn 0.

Two other classes of sequences, the so-called, starshaped sequences and -convex sequences have been introduced in [9] and [10]. Indeed, let 2[0;1].

DEFINITION 4. A sequence(an)1n=0is called -convex if the sequence (an+1 an) + (1 )an a0

n

1

n=1

is increasing.

DEFINITION 5. A sequence(an)1n=0is called starshaped if an+1 a0

n+ 1

an a0

n forn 1:

Letpbe a real positive number.

Now, we introduce two new classes of sequences as follows:

DEFINITION 6. A sequence(an)1n=0is called p-starshaped if an+1 a0

n+ 1 pan a0

n forn 1: (1)

(3)

DEFINITION 7. A sequence(an)1n=0is called (p; )-convex if the sequence (an+1 an) + (1 )an a0

n

1

n=1

isp-increasing.

REMARK 8. We note that: (1; )-convexity is the same with -convexity, (p;1)- convexity is the same withp-convexity,(p;0)-convexity is the same withp-star-shapedness, (1;1)-convexity is the same with convexity, and(1;0)-convexity is the same with star- shapedness.

REMARK 9. Note also that: 1-star-shapedness of a sequence is the same with its star-shapedness.

Characterizing (p; )-convex sequences as well as p-starshaped sequences, we are going to accomplish the main aim of this paper.

2 Main Results

We begin …rst with:

THEOREM 10. The sequence(an)1n=0 is(p; )-convex if and only if Lp(an) + (1 ) an+1 a0

n+ 1 pan a0

n 0;

for alln2 f0;1; : : :g.

PROOF. The proof of this statement is an immediate result of the De…nition 1.

The proof is complete.

Forp= 1we obtain Corollary 11.

COROLLARY 11 ([10]). The sequence(an)1n=0 is -convex if and only if 42(an) + (1 ) an+1 a0

n+ 1

an a0

n 0;

for alln2 f0;1; : : :g.

THEOREM 12. The sequence(an)1n=0 is(p; )-convex if and only if (an a0+ [n(an+1 an) (an a0)])1n=1; is a p-starshaped sequence.

(4)

PROOF. First let us write

An:=an a0+ [n(an+1 an) (an a0)]; n2 f1;2; : : :g; which can be rewritten as

An= n(an+1 an) + (1 )(an a0); n2 f1;2; : : :g:

The proof of this Lemma follows as a direct result of Lemma 2, and the following obvious equivalences (A0= 0)

An+1

n+ 1 pAn

n () nAn+1 p(n+ 1)An

() n[ (n+ 1)(an+2 an+1) + (1 )(an+1 a0)]

p[ n(an+1 an) + (1 )(an a0)]

() n(n+ 1)Lp(an)

+(1 )[n(an+1 a0) p(n+ 1)(an+1 a0)] 0 () Lp(an) + (1 ) an+1 a0

n+ 1 pan a0

n 0:

The proof is complete.

Forp= 1 we obtain Corollary 13.

COROLLARY 13 ([10]). The sequence(an)1n=0 is -convex if and only if (an a0+ [n(an+1 an) (an a0)])1n=1;

is a starshaped sequence.

THEOREM 14. The sequence (an)1n=0 is p-starshaped if and only if it may be represented by

an=npn 1 Xn

k=1

ck

k (npn 1 1)c0; (2)

withck 0; k 2:

PROOF. Our reasoning is similar to the proof of Lemma 3 in [11], page 3. Namely, leta0=c0 anda1=c1and take n= 2in (1) we obtain

a2 2pc1 (2p 1)c0; which means that there exists a number c2 0such that

a2= 2p c1+c2

2 (2p 1)c0:

(5)

Now we assume that

an=npn 1 Xn

k=1

ck

k (npn 1 1)c0: Then forn+ 1there existscn+1pn 0so that we will have

an+1 a0

n+ 1 pan a0

n () an+1 pn+ 1

n (an c0) +c0 () an+1=cn+1pn+pn+ 1

n

"

npn 1 Xn

k=1

ck

k (npn 1 1)c0 c0

# +c0

() an+1= (n+ 1)pn

n+1X

k=1

ck

k [(n+ 1)pn 1)c0;

which by mathematical induction we obtain the representation (2). The proof is com- plete.

COROLLARY 15. If the sequence(an)1n=0is represented by (2), then

Lp(an) =pn

"

(p 1) Xn

k=1

ck

k 1

!

+ p

n+ 1 1 cn+1+pcn+2

# :

Takingp= 1in Theorem 2 and Corollary 2 we get the following:

COROLLARY 16 ([11]). The sequence(an)1n=0 is starshaped if and only if it may be represented by

an=n Xn

k=1

ck

k (n 1)c0 withck 0; k 2: (3)

COROLLARY 17 ([11]). If the sequence(an)1n=0 is represented by (3), then 42(an) =cn+2 n

n+ 1cn+1:

THEOREM 18. The sequence (an)1n=0 is (p; )-convex if and only if it may be represented by

an=npn 1 Xn

k=1

ck

k (npn 1 1)c0; (4)

(6)

with0< p 1,

Xn

k=1

ck

k 1; (5)

cn+2 1

p 1 1

(n+ 1) + 1

p 1 1

n+ 1 cn+1; andcn 0; n 2:

PROOF. On one hand, taking into account (4), we have Lp(an) = [an+2 (1 +p)an+1+pan]

= pn

"

(p 1) Xn

k=1

ck

k 1

!

+ p

n+ 1 1 cn+1+pcn+2

# : (6)

On the other hand, using (4), we also have (1 ) an+1 a0

n+ 1 pan a0

n

= (1 ) pn

n+1X

k=1

ck

k

[(n+ 1)pn 1]c0

n+ 1

c0

n+ 1 pn

Xn

k=1

ck

k +(npn p)c0 n +pc0

n

!

= (1 )pncn+1

n+ 1: (7) From (6) and (7) we obtain

Lp(an) + (1 ) an+1 a0

n+ 1 pan a0

n

= pn

"

(p 1) Xn

k=1

ck

k 1

!

+ p

n+ 1 1 cn+1+ pcn+2+ (1 )pn cn+1 n+ 1

# :

Subsequently, it follows that

Lp(an) + (1 ) an+1 a0

n+ 1 pan a0

n 0

if and only if 0< p 1,

Xn

k=1

ck

k 1;

and

cn+2

1

p 1 1

(n+ 1) + 1

p 1 1

n+ 1 cn+1: The proof is complete.

(7)

COROLLARY 19 ([10]). The sequence(an)1n=0is -convex if and only if it may be represented by

an=n Xn

k=1

ck

k (n 1)c0; with

cn+2 1 1

(n+ 1) cn+1 andcn 0; n 2:

THEOREM 20. If the sequence(an)1n=0is(p; )-convex, then it is(p; )-convex for 0 and0< p 1.

PROOF. The proof follows from Theorem 2. Indeed, let the sequence(an)1n=0 be (p; )-convex. Then, it may be represented by (4) with (5),

cn+2

1

p 1 1

(n+ 1) + 1

p 1 1

n+ 1 cn+1; andcn 0; n 2:However, since0 then we also have

cn+2 1

p 1 1

(n+ 1) + 1

p 1 1

n+ 1 cn+1;

with cn 0; n 2; which shows that the sequence(an)1n=0 is (p; )-convex as well.

The proof is complete.

Forp= 1, as a particular case, we obtain Corollary 21.

COROLLARY 21 ([10]). If the sequence (an)1n=0 is -convex, then it is -convex,

for0 .

References

[1] H. Bor, A new application of convex sequences, J. Class. Anal., 1(2012), 31–34.

[2] H. Bor and Xh. Z. Krasniqi, A note on absolute Cesào summability factors, Adv.

Pure Appl. Math., 3(2012), 259–264.

[3] Xh. Z. Krasniqi, Some properties of (p; q;r)-convex sequences, Appl. Math. E- Notes, 15(2015), 38–45.

[4] L. M. Koci´c, I. Z. Milovanovi´c, A property of (p; q)-convex sequences, Period.

Math. Hungar., 17(1986), 25–26.

[5] I. B. Lackovi´c and M. R. Jovanovi´c, On a class of real sequences which satisfy a di¤erence inequality, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat., 678(1980), 99–104.

(8)

[6] B. Makarov, A. Podkorytov, Real Analysis: Measures, Integrals and Applications, Springer–Verlag London, 2013.

[7] J. E. Pe¼cari´c, On some inequalities for convex sequences. Publ. Inst. Math., 33(1983), 173–178.

[8] F. Qi and B.-N. Guo, Monotonicity of sequences involving convex function and sequence, Math. Inequal. Appl., 9(2006), 247–254.

[9] Gh. Toader, A hierarchy of convexity for sequences. Anal. Numér. Théor. Approx., 12(1983), 187–192.

[10] Gh. Toader, -convex sequences. Itinerant seminar on functional equations, ap- proximation and convexity (Cluj-Napoca, 1983), 167–168, Preprint, 83-2, Univ.

"Babes-Bolyai”, Cluj–Napoca, 1983.

[11] Gh. Toader, A hierarchy of convexity for sequences. Anal. Numér. Thér. Approx., 12(1983), 187–192.

[12] S. Wu and L. Debnath, Inequalities for convex sequences and their applications, Comput. Math. Appl., 54(2007), 525–534.

参照

関連したドキュメント

Inequality (4.15) means that the error produced by considering weak solutions of (2.7) in two different domains, with conductivity function verifying (4.3), is proportional to

The 2-dimensional case is completely solved: given a left invariant field of forces ξ on a 2-dimensional Lie group G, we determine all the metrics g ∈ Riem(G, ξ) such that ξ

In this paper, we investigate a single period partial disassembly optimization SPPDO problem to generate an optimal disassembly sequence in product recovery of the end-of-life

For staggered entry, the Cox frailty model, and in Markov renewal process/semi-Markov models (see e.g. Andersen et al., 1993, Chapters IX and X, for references on this work),

This raises the questions whether ∗-autonomous categories do not, after all, provide an accurate semantic model for these proof nets and whether there could be

In this paper some characterizations of best approximation have been established in terms of 2-semi inner products and normalised duality mapping associated with a linear 2-normed

Linear recursive equations such as the family of second-order extended Lucas sequences described above have attracted considerable theoretic attention for more than a century..

Pruitt, Convergence of weighted averages of independent random variables, Z. Weiss, Introduction to Fourier Analysis on Euclidean Spaces, Princeton University Press, Princeton,