• Nem Talált Eredményt

A Hájek-Rényi type inequality and its applications

N/A
N/A
Protected

Academic year: 2022

Ossza meg "A Hájek-Rényi type inequality and its applications"

Copied!
9
0
0

Teljes szövegt

(1)

33(2006) pp. 141–149

http://www.ektf.hu/tanszek/matematika/ami

A Hájek–Rényi type inequality and its applications

Tibor Tómács

a

, Zsuzsanna Líbor

b

aDepartment of Applied Mathematics, Eszterházy Károly College e-mail: tomacs@ektf.hu

bDepartment for Methodology of Economic Analysis, Szolnok College e-mail: liborne@szolf.hu

Submitted 8 August 2006; Accepted 18 September 2006

Abstract

A general method is presented to obtain strong laws of large numbers.

Then it is applied for certain dependent random variables to obtain some strong laws.

1. Introduction

It is well-known that the Hájek–Rényi inequality (see [7]) is a generalization of the Kolmogorov inequality. In this paper we show (Theorem 2.1) that Kolmogorov’s inequality implies a certain Hájek–Rényi type inequality. Using this fact we give a general method to obtain strong laws of large numbers (Theorem 2.4). Actually our method is the same as the one applied in Fazekas and Klesov [5] and Fazekas et al. [6] but here we use probabilities instead of moments. In the proof we follow the lines of [5].

Our theorem offers a general tool: if a maximal inequality is known for a certain sequence of random variables then one can easily obtain a strong law of large numbers. Our scheme helps to find the conditions and the normalizing constants.

In section 3 we apply our theorem to give alternative proofs for some known strong laws of large numbers. We deal with associated, negatively associated ran- dom variables and demimartingales.

141

(2)

2. Results

Let N be the set of the positive integers and R the set of real numbers. If a1, a2, . . . ∈ R then in case A = ∅ let maxk∈Aak = 0 and P

k∈Aak = 0. Let {Xk, k∈N}be a sequence of random variables defined on some probability space (Ω,F,P)andSk=Pk

i=1Xi for allk∈N.

Theorem 2.1. Let {αk, k ∈ N} be a sequence of nonnegative real numbers and r >0. Then the following two statements are equivalent.

(i)There existsc >0such that for anyn∈Nand any ε >0 P

maxk6n|Sk|>ε 6cε−r

n

X

k=1

αk.

(ii) There exists c >0 such that for any nondecreasing sequence {βk, k ∈N} of positive real numbers, anyn∈N and anyε >0

P

maxk6n|Skk−1>ε 6cε−r

n

X

k=1

αkβk−r.

Proof. The proof is based on the idea of the proof of Theorem 1.1 in Fazekas and Klesov [5]. It is clear that (ii) implies (i). Now we turn to (i) ⇒ (ii). Let 0 < β12 6. . ., n∈Nandε >0 are fixed. Without loss of generality we can assume thatβ1= 1. Introduce the following notation

Ai ={m : 16m6nand2irm<2i+1}, i= 0,1,2, . . . , I= max{i : Ai6=∅},

mi =

(maxAi, ifAi6=∅,

mi−1, ifAi=∅, i= 0,1,2, . . . and m−1= 0.

Then we have

P

maxk6n|Skk−1>ε 6

I

X

i=0

P

maxk∈Ai|Sk|>ε2i/r

6

I

X

i=0

P

k6mmaxi|Sk|>ε2i/r 6

I

X

i=0

−r2−i

mi

X

k=1

αk

=cεr

I

X

k=0

X

jAk

αj I

X

i=k

2i62cεr

I

X

k=0

2k X

jAk

αj

62cε−r

I

X

k=0

X

j∈Ak

αjj−r= 4cε−r

n

X

k=1

αkβk−r.

Thus the theorem is proved.

(3)

The following two lemmas are due to Fazekas and Klesov (see [4, Lemma 2.1 and Lemma 2.2]).

Lemma 2.2. Let{λk, k∈N}be a sequence of nonnegative real numbers. Assume that P

k=1λk2−k < ∞. Then there exists a nondecreasing unbounded sequence {γk, k∈N} of positive real numbers such that

X

k=1

λkγ−1k <∞ and lim

k→∞γk2k= 0. (2.1) Proof. If finitely manyλk are positive then the statements are obvious. Suppose that there are infinitely many positive λk. Letz=P

k=1λk2−k and letni be the smallest integer such that

X

k=ni

λk2−k 6z2−i, i= 0,1, . . . .

Letq−1= 0,qi= min{nj : j= 0,1, . . . andnj> qi−1} (i= 0,1, . . .), Bi ={k∈N : qi6k < qi+1} (i= 0,1, . . .)

and γk = 2k−i/2 fork ∈Bi. Property γkk+1 has to be verified only for k= qi+1−1,i= 0,1, . . .. In this caseγk+1k=√

2so{γk, k∈N}is nondecreasing.

This equality implieslimi→∞γqi=∞, so{γk, k∈N}is unbounded. Now we turn to (2.1).

X

k=1

λkγ−1k =

X

i=0

X

kBi

λkγk−16

X

i=0

2i/2

X

k=ni

λk2−k 6z

X

i=0

2−i/2<∞. The last statement follows from the definition ofγk. Lemma 2.3. Let{αk, k∈N}be a sequence of nonnegative real numbers,{bk, k∈ N}a nondecreasing unbounded sequence of positive real numbers andr >0. Assume that P

k=1αkb−rk < ∞. Then there exists a nondecreasing unbounded sequence {βk, k∈N} of positive real numbers such that

X

k=1

αkβk−r<∞ and lim

k→∞βkb−1k = 0. (2.2) Proof. Letw0= 0,wi= max{k∈N : brk62i}(i∈N),

Ci={k∈N : wi−1+ 16k6wi} (i∈N) andλi=P

k∈Ciαk. Since

X

k=1

αkb−rk =

X

i=1

X

k∈Ci

αkb−rk >

X

i=1

λi2−i

(4)

we get that P

i=1λi2−i < ∞. So all conditions of Lemma 2.2 are satisfied. Let {γk, k∈N}be fixed by Lemma 2.2. Now we put

βki1/r for k∈Ci. Then

∞>

X

i=1

λiγi−1

X

i=1

X

k∈Ci

αkγi−1=

X

k=1

αkβk−r.

The other statements are obvious.

Theorem 2.4. Let {αk, k∈N} be a sequence of nonnegative real numbers,r >0 and {bk, k ∈ N} a nondecreasing unbounded sequence of positive real numbers.

Assume that

X

k=1

αkb−rk <∞

and there existsc >0 such that for anyn∈Nand any ε >0 P

maxk6n|Sk|>ε 6cε−r

n

X

k=1

αk. (2.3)

Then

n→∞lim Snb−1n = 0 almost surely (a.s.).

Proof. The proof is based on the idea of the proof of Theorem 2.1 in Fazekas and Klesov [4]. Let {βk, k∈N} be fixed by Lemma 2.3. Then (2.3) and Theorem 2.1 imply that there existsc >0 such that for anyn∈Nand anyε >0

P

maxk6n |Skk−1>ε 6cε−r

n

X

k=1

αkβk−r. By this fact we get for any fixedm∈N

P sup

k |Sk−1k > εm

6 lim

n→∞P

maxk6n |Skk−1m

6cε−rm

X

k=1

αkβk−r, where{εm, m∈N}a nondecreasing unbounded sequence of positive real numbers.

So we have by (2.2)

m→∞lim P sup

k |Skk−1> εm

= 0.

Hence, using continuity of probability, we have P

sup

k |Skk−1> εmfor allm∈N

= 0.

Consequentlysupk|Skk−1<∞a.s. Thus by (2.2) we get

klim→∞|Sk(ω)|b−1k = lim

k→∞ |Sk(ω)|βk−1

βkb−1k

= 0

for almost everyω∈Ω. Thus the theorem is proved.

(5)

3. Some applications

We shall prove that some known results (i.e. Theorem 3.3, Theorem 3.4, Theo- rem 3.7, Theorem 3.8 and Theorem 3.12) are special cases of Theorem 2.4.

Associated random variables

Definition 3.1 (Esary et al. [3]). A finite family {X1, . . . , Xn} of random vari- ables is calledassociated if

cov f(X1, . . . , Xn), g(X1, . . . , Xn)

>0

for any real coordinatewise nondecreasing functionsf,gonRnsuch that the above covariance exists. An infinite family of random variables is associated if its every finite subfamily is associated.

Lemma 3.2 (Matuła [11], Lemma 1). Assume thatX1, . . . , Xn are associated ze- ro mean random variables with finite second moments. Then for every ε >0

P

maxk6n|Sk|>ε

68ε−2ESn2.

Theorem 3.3 (Matuła [11], Theorem 1). Let{Xk, k∈N}be a sequence of asso- ciated random variables with finite second moments and{ak, k∈N}a sequence of positive real numbers satisfyingP

k=1ak =∞. Letbn=Pn

i=1ai. Assume that

X

j=1 j

X

i=1

aiajcov(Xi, Xj)b−2j <∞. Then

n→∞lim(Sn−ESn)b−1n = 0 a.s., whereSn=Pn

i=1aiXi.

Proof. Without loss of generality we can assume thatEXk = 0for allk∈N. Let αk= ESk∗2−ESk−1∗2 , where S0= 0. Then for allk∈N

06αk 62

k

X

i=1

aiakcov(Xi, Xk), so we have

X

k=1

αkb−2k 6

X

k=1 k

X

i=1

2aiakcov(Xi, Xk)b−2k <∞. It is easy to see that{akXk, k∈N}is associated thus, by Lemma 3.2,

P

maxk6n|Sk|>ε

68ε−2ESn∗2= 8ε−2

n

X

k=1

αk

for anyε >0. Consequently, by Theorem 2.4, we getlimn→∞Snb−1n = 0a.s.

(6)

Theorem 3.4 (Birkel [1], Theorem 2 and Christofides [2], Corollary 2.2). Let {Xk, k ∈N} be a sequence of associated random variables with finite second mo- ments. If

X

k=1

k−2cov(Xk, Sk)<∞ then

n→∞lim(Sn−ESn)n−1= 0 a.s.

Proof. Without loss of generality we can assume thatEXk = 0for allk∈N. Let αk= cov(Xk, Sk), bk=kand S0= 0. Then, by Lemma 3.2, we have

P

maxk6n|Sk|>ε

68ε−2ESn2= 8ε−2

n

X

k=1

ESk2−ESk−12

616ε−2

n

X

k=1

αk.

Thus Theorem 2.4 implies the statement.

Negatively associated random variables

Definition 3.5 (Joag-Dev and Proschan [8]). A finite family{X1, . . . , Xn}of ran- dom variables is called negatively associated if for any disjoint nonempty subsets A, B⊂ {1, . . . , n},A={i1, . . . , il},B={il+1, . . . , in}and any real coordinatewise nondecreasing functionsf onRlandg onRn−l

cov f(Xi1, . . . , Xil), g(Xil+1, . . . , Xin) 60.

An infinite family of random variables is negatively associated if every finite sub- family is negatively associated.

The following lemma is a special case of Theorem 2.1 of Liu et al. [9]. (See Lemma 1 of Matuła [10], too.)

Lemma 3.6. Assume thatX1, . . . , Xn are negatively associated zero mean random variables with finite second moments. Then for every ε >0

P

maxk6n|Sk|>ε

632ε−2

n

X

k=1

EXk2.

Theorem 3.7 (Matuła [11], Theorem 2). Let {Xk, k ∈N} be a sequence of neg- atively associated random variables with finite second moments and {ak, k ∈ N} a sequence of positive real numbers satisfying P

k=1ak = ∞. Let bn =Pn i=1ai. Assume that

X

k=1

a2kb−2k D2Xk<∞. Then

n→∞lim(Sn−ESn)b−1n = 0 a.s., whereSn=Pn

i=1aiXi.

(7)

Proof. Without loss of generality we can assume that EXk = 0 for all k ∈ N. Let αk =a2kEXk2. It is clear that{akXk, k∈N} is negatively associated, so by Lemma 3.6 we have

P

maxk6n|Sk|>ε

632ε−2

n

X

k=1

αk

for anyε >0. Thus Theorem 2.4 implies the statement.

Theorem 3.8 (Liu et al. [9], Theorem 3.1). Let {Xk, k ∈ N} be a sequence of negatively associated random variables with finite second moments and{bk, k∈N} a nondecreasing and unbounded sequence of positive real numbers. Assume that

X

k=1

b−2k D2Xk <∞. Then

n→∞lim(Sn−ESn)b−1n = 0 a.s.

Proof. Without loss of generality we can assume thatEXk = 0for allk∈N. Let αk= EXk2. Then Lemma 3.6 and Theorem 2.4 imply the statement.

Demimartingales

We shall use the following notations:

X+= max{0, X} and X=−min{0, X}.

Definition 3.9 (Newman and Wright [12]). Let {Sk, k ∈N} be anL1 sequence of random variables. Assume that for j∈N

E (Sj+1−Sj)f(S1, . . . , Sj)

>0

for all coordinatewise nondecreasing functions f onRj such that the expectation is defined. Then {Sk, k ∈ N} is called a demimartingale. If in addition the function f is assumed to be nonnegative, the sequence {Sk, k ∈ N} is called a demisubmartingale.

Lemma 3.10 (Christofides [2], Theorem 2.1). Let{Sk, k∈N∪{0}}be a demisub- martingale with S0 = 0. Let{bk, k ∈N} be a nondecreasing sequence of positive real numbers. Then for allε >0

P

maxk6nSkb−1k >ε 6ε−1

n

X

k=1

b−1k E Sk+−Sk−1+ .

The following lemma is a corollary of Lemma 2.1 and Corollary 2.1 of Christofi- des [2].

(8)

Lemma 3.11. If {Sk, k ∈ N} is demimartingale then {(Sk+)r, k ∈ N} and {(Sk)r, k∈N} are demisubmartingales for all r>1.

Theorem 3.12 (Christofides [2], Theorem 2.2). Let{Sk, k∈N∪ {0}}be a demi- martingale with S0 = 0. Let {bk, k ∈ N} be a nondecreasing and unbounded sequence of positive real numbers. Let r > 1 and E|Sk|r < ∞ for each k ∈ N.

Assume that

X

k=1

b−rk E (|Sk|r− |Sk−1|r)<∞. Then

n→∞lim Snb−1n = 0 a.s.

Proof. Letαk= E (|Sk|r− |Sk−1|r)for allk∈Nandε >0. By Lemma 3.11 and 3.10

P

maxk6n |Sk|>ε 6P

maxk6n(Sk+)rr/2 + P

maxk6n(Sk)rr/2 62εr

n

X

k=1

E (Sk+)r+ (Sk)r−(Sk−1+ )r−(Sk−1)r

= 2εr

n

X

k=1

αk.

Thus Theorem 2.4 implies the statement.

Acknowledgements. Our paper was inspired by the ideas of Oleg Klesov and István Fazekas. The authors would like to thank István Fazekas for several helpful discussions and for his attention to our paper.

References

[1] Birkel, T., Moment bounds for associated sequences,Ann. Probab.16 (1988) 1184–

1193.

[2] Christofides, T. C., Maximal inequalities for demimartingales and a strong law of large numbers,Stat. & Prob. Letters 50 (2000) 357–363.

[3] Esary, J., Proschan, F.andWalkup, D., Association of random variables with applications,Ann. Math. Statist.38 (1967) 1466–1474.

[4] Fazekas, I.andKlesov, O., A general approach to the strong law of large numbers, Technical Report No. 4/1998, Universitas Debrecen, Hungary.

[5] Fazekas, I.andKlesov, O., A general approach to the strong laws of large num- bers,Theory of Probab. Appl., 45/3 (2000) 568–583.

[6] Fazekas, I., Klesov, O. I., Noszály, Cs., Tómács, T., Strong laws of large numbers for sequences and fields, (Proceedings of the Third Ukrainian-Scandinavian Conference in Probability Theory and Mathematical Statistics 8–12 June 1999. Kyiv, Ukraine)Theory of Stochastic Processes, Vol.5 (21) no. 3–4 (1999) 91–104.

(9)

[7] Hájek, J. and Rényi, A., Generalization of an inequality of Kolmogorov, Acta Math. Acad. Sci. Hungar.6 no. 3–4 (1955) 281–283.

[8] Joag-Dev, K.andProschan, F., Negative association of random variables with applications,Ann. Statist.11 (1983) 286–295.

[9] Liu, J.,Gan, S.and Chen, P., The Hájeck-Rényi inequality for the NA random variables and its application,Stat. & Prob. Letters43 (1999) 99–105.

[10] Matuła, P., A note on the almost sure convergence of sums of negatively dependent random variables,Stat. & Prob. Letters15 (1992) 209–213.

[11] Matuła, P., Convergence of weighted averages of associated random variables, Prob. and Math. Statist.16, Fasc. 2 (1996) 337–343.

[12] Newman, C. M.andWright, A. L., Associated random variables and martingale inequalities,Z. Wahrsch. Verw. Geb.59 (1982) 361–371.

Tibor Tómács

Department of Applied Mathematics Károly Eszterházy College

P.O. Box 43 H-3301 Eger Hungary

Zsuzsanna Líbor

Department for Methodology of Economic Analysis Szolnok College

Ady Endre u. 9.

H-5000 Szolnok Hungary

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

We extend a general Bernstein-type maximal inequality of Kevei and Mason (2011) for sums of random variables.. Keywords: Bernstein inequality, dependent sums, maximal

and Volodin, A., A note on the growth rate in the Fazekas- Klesov general law of large numbers and some applications to the weak law of large numbers for tail series, Submitted

Tómács in [6] proved a general convergence rate theorem in the law of large numbers for arrays of Banach space valued random elements.. We shall study this theorem in case Banach

Legyen szabad reménylenünk (Waldapfel bizonyára velem tart), hogy ez a felfogás meg fog változni, De nagyon szükségesnek tar- tanám ehhez, hogy az Altalános Utasítások, melyhez

Our result is a characterisation of the matrices with maximal determinant in the set of matrices with given entry sum and square sum, and a general inequality for the absolute value

By our main results we obtain a general form of multidimensional strengthened Hardy and Pólya-Knopp-type inequalities.. Key words and phrases: Inequalities, Hardy’s

Abstract: A new weighted geometric inequality is established by Klamkin’s polar moment of inertia inequality and the inversion transformation, some interesting applica- tions of

YANG, A new Hardy-Hilbert type inequality and its applications (Chi- nese),