R E S E A R C H
Open Access
A supplement to the convergence rate in a
theorem of Heyde
Jianjun He
*and Tingfan Xie
*Correspondence: [email protected]
Department of Mathematics, China Jiliang University, Hangzhou, 310018, China
Abstract
Let{X,Xn,n≥1}be a sequence of i.i.d. random variables with zero mean, set
Sn=
n
k=1Xk,EX2=
σ
2> 0, andλ
() =
∞
n=1P(|Sn| ≥n
). In this paper, the authors
discuss the rate of approximation of
σ
2by2
λ
() under suitable conditions, improve the results of Klesov (Theory Probab. Math. Stat. 49:83-87, 1994), and extend the work He and Xie (Acta Math. Appl. Sin. 2012, doi:10.1007/s10255-012-0138-6).
MSC: 60F15; 60G50
Keywords: convergence rate; i.i.d. random variable; theorem of Heyde
1 Introduction and main results
Let{X,Xn,n≥}be a sequence of i.i.d. random variables, setSn=
n
k=Xk, andλ() =
∞
n=P(|Sn| ≥n). Heyde [] proved that
lim →
λ() =σ,
wheneverEX=σ<∞andEX= .
There are various extensions of this result: Chen [], Gut and Spˇatara [], Lanzinger and Stadtmüller []. Liu and Lin [] introduced a new kind of complete moment convergence; Klesov [] studied the rate of approximation ofσ byλ() and proved the following Theorem A.
Theorem A Let{X,Xn,n≥}be a sequence of i.i.d. random variables with zero mean, if
EX=σ> , and E|X|<∞, then
λ() –σ=o/, as→.
Recently, He and Xie [] obtained Theorem B which improved Theorem A. Gut and Steinebach [] extended the results of Klesov [].
Theorem B Let{X,Xn,n≥}be a sequence of i.i.d. random variables, and <δ≤, if
EX= , EX=σ> and E|X|+δ<∞,
then
λ() –σ= ⎧ ⎨ ⎩
O(), δ= ,
o(δ), <δ< .
LetGbe the set of functionsg(x) that are defined for all realxand satisfy the following conditions: (a)g(x) is nonnegative, even, nondecreasing in the intervalx> , andg(x)= forx= ; (b)g(xx) is nondecreasing in the intervalx> .
Let G be the set of functions g(x)∈G satisfying the supplementary condition (c) limx→∞g(x
)
xg(x)= . Obviously, the functiong(x) =|x|
δwith <δ< belongs toG
and does
not belong toGifδ= . The purpose of this paper is to generalize Theorem B to the case
where the conditionE|X|+δ<∞is replaced by a more general conditionE|X|g(X) <∞
in which the functiong belongs to some subset ofG. DenoteTg(v) =EXg(X)I(|X|>v),
Tg(v) is a nonnegative nonincreasing function in the intervalv> , andlimv→∞Tg(v) =
withEXg(X) <∞. Now we state our results as follows.
Theorem . Let{X,Xn;n≥}be a sequence of i.i.d. random variables with zero mean
and EX=σ> , if EXg(X) <∞for some function g(x)∈G, and
∞
n=
ng(√n)<∞, (.)
then
λ() –σ=O/+o()h() +f()
, as→, (.)
where f() =
∞
n=[
]+
ng(√n), h() = [
] n= g(√n).
Theorem . Under the conditions of Theorem ., and g(x)∈G, then
λ() –σ=o()h() +f()
, as→. (.)
Throughout this paper, we suppose that C denotes a constant which only depends on some given numbers and may be different at each appearance, and that [x] denotes the integer part ofx.
2 Proofs of the main results
Before we prove the main results we state some lemmas. Lemma . is from [].(x) is the standard normal distribution function,(x) = √
π x –∞e–t
/
dt.
Lemma . Let{X,Xn,n≥}be a sequence of i.i.d. standard normal distribution random
variables. Then
λ() =
∞
n=
√
π
∞
√n
e–t/dt= –
+O
If{Xn,n≥}is a sequence of independent random variables with zero mean and finite
variance, and put EX
j =σj, Bn=nj=σj, Bikelis [] obtained the following inequality:
P
√
Bn n
j=
Xj<x
–(x)
≤C
B–n +|x|–
n
j=
|u|>(+|x|)B/n
udVj(u)
+B–/n +|x|–
n
j=
|u|≤(+|x|)B/n
|u|dVj(u)
,
for every x, where Vj(x) =P(Xj<x)is the distribution function of the random variable Xj.
By applying the above inequality to the sequence of i.i.d. random variables with zero mean and variance , and letting|x|=√n, we have the following lemma.
Lemma . Let{X,Xn,n≥}be a sequence of i.i.d. random variables with zero mean and
EX= . Then for any given> , we have
P|Sn|>n
–√
π
∞
√n
e–t/dt
≤C( +√n)–
|u|>(+√n)√n
udV(u)
+Cn–/( +√n)–
|u|≤(+√n)√n
|u|dV(u),
where V(x) =P(X<x)is the distribution function of a random variable X.
Proof of Theorem . Without loss of generality, we suppose thatσ= , << , and
write
λ() =I+
∞
n=
√
π
∞
√n
e–t/dt,
where
I=
∞
n=
P|Sn|>n
–√
π
∞
√n
e–t/dt
.
Applying Lemma ., we obtain
λ() =I+ –
+O
,
then
λ() – = –
+
∞
n=
Rn+O
hereRn=P(|Sn|>n) – √π ∞√ne–t /
dt. By Lemma .,
|Rn| ≤Rn+Rn,
where
Rn=C( +
√
n)–
|u|>(+√n)√n
udV(u),
Rn=Cn–/( +
√
n)–
|u|≤(+√n)√n
|u|dV(u).
We obtain
λ() – =
∞
n=
Rn+ ∞
n=
Rn+O
. (.)
Firstly, we estimate∞n=Rn. Note that
∞
n=
Rn= [
]
n=
Rn+ ∞
n=[
]+
Rn=:T+T.
Applying the conditionEXg(X) <∞, we have
lim n→∞
|u|>√n
ug(u)dV(u) = .
Therefore, for anyη> , there is an integerNsuch that |u|>√nug(u)dV(u)≤η,
when-evern>N. Hence
T≤C N
n=
|u|>√n
udV(u) +C
[
]
n=N+
( +√n)–
|u|>(+√n)√n
udV(u)
≤CN+Cη [
]
n=N+
( +√n)g(√n( +√n))
≤C
N+η [
]
n=
g(√n)
=Ch()
N
[
] n= g(√n)
+η
≤Ch()(N+η)
=oh()
whereh() =
[
]
n= g(√n). ForT, noting thatg(x)∈G, we have the following inequality:
T≤C ∞
n=[
]+
n
|u|>√n(+√n)
udV(u)
≤C
∞
n=[
]+
ng(√n( +√n))
|u|>√n(+√n)
ug(u)dV(u)
≤C
∞
n=[
]+
ng(√n)
|u|>
ug(u)dV(u)
≤CTg
f(). (.)
Next, we estimate the second term of (.). Note that
∞
n=
Rn =C ∞
n=
n–/( +√n)–
|u|≤(√n(+√n))/|u| dV(u)
+C
∞
n=
n–/( +√n)–
(√n(+√n))/<|u|<√n(+√n)|
u|dV(u)
=:J+J.
ForJ, we can write
J =C
[
]
n=
+
∞
n=[
]+
n–/( +√n)–
|u|≤(√n(+√n))/|u| dV(u)
=:J+J.
Noting thatg(xx)is nondecreasing in the intervalx> , we have
J=C [
]
n=
√
n( +√n)
|u|≤(√n(+√n))/|u| dV(u)
≤C
[
]
n=
n/( +√n)/g((√n( +√n))/)
|u|≤(√n(+√n))/u
g(u)dV(u)
≤C
[
]
n=
n/g(n/)
=Ch(), (.)
whereh() =
[
]
Similarly, we can obtain
J=C ∞
n=[
]+
√
n( +√n)
|u|≤(√n(+√n))/|
u|dV(u)
≤C
∞
n=[
]+
n/( +√n)/g((√n( +√n))/)
|u|≤(√n(+√n))/u
g(u)dV(u)
≤C
∞
n=[
]+ /n/g(n/)
=C√
f(), (.)
wheref() =∞n=[
]+
n/g(n/).
ForJ, we write
J =C
[
]
n=
+
∞
n=[
]+
n–/( +√n)–
(√n(+√n))/<|u|<√n(+√n)|u| dV(u)
=:J+J.
Using the properties ofg(x) by simple calculation, it follows that
J=C [
]
n=
n–/( +√n)–
(√n(+√n))/<|u|<√n(+√n)|u| dV(u)
≤C
N
n=
+
[
]
n=N+
( +√n)g(√n( +√n))
×
(√n(+√n))/<|u|<√n(+√n)u
g(u)dV(u)
≤C
N
n=
+
[
]
n=N+
g(√n)
|u|>n/u
g(u)dV(u)
≤C
N+η [
]
n=
g(√n)
=oh()
, (.)
and
J≤C ∞
n=[
]+
n–( +√n)–
(√n(+√n))/<|u|<√n(+√n)|u| dV(u)
≤C
∞
n=[
]+
ng(√n)
(√n(+√n))/<|u|<√n(+√n)u
≤CTg
√
∞
n=[
]+
ng(√n)
≤CTg
√
f(). (.)
From (.) to (.), we conclude that
λ() – ≤C√
f() +CTg
√
f() +o()h() +Ch(). (.)
Since
√
f()≤
C
√
∞
n=[
]+
n/ ≤C
√ ,
and
h() = [
]
n=
√
ng(√n)≤C
[
]
n=
√
n≤C
√ ,
by (.), we have
λ() – =O/+o()f() +h()
.
This completes the proof of Theorem ..
Proof of Theorem . By the conditionsg(x)∈G, andlimx→∞g(x )
xg(x)= , for anyη> , there
is an integerNsuch that g( √
n) √
ng(√n)≤η, whenevern>N. We have
h()≤ N
n=
√
ng(√n)+
[
]
n=N
η
g(√n)
≤CN+ [
]
n=N+
η
g(√n)
≤CN+ [
]
n=
η
g(√n)
=o()h(), (.)
and
√
f()≤ √
∞
n=[
]+ η
n/g(√n)
≤
∞
n=[
]+ η
By (.)-(.), note thatTg(√) =o(), as→, we have
λ() –σ=o()h() +f()
, as→.
This completes the proof of Theorem ..
Remark . Ifg(x) =|x|δ, <δ< , thenf
() =O(δ),h() =O(δ). By Theorem ., we
get
λ() –σ=oδ, as→.
Remark . Ifg(x) =|x|,δ= , then√
f() =O(),f() =O(),h() =O(),h() =O().
By (.), we get
λ() –σ=O(), as→.
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript.
Acknowledgements
The authors are very grateful to the referees and editors for their valuable comments and some helpful suggestions that improved the clarity and readability of the paper.
Received: 27 May 2012 Accepted: 20 August 2012 Published: 4 September 2012
References
1. Heyde, CC: A supplement to the strong law of large numbers. J. Appl. Probab.12, 903-907 (1975) 2. Chen, R: A remark on the strong law of large numbers. Proc. Am. Math. Soc.61, 112-116 (1976)
3. Gut, A, Spˇataru, A: Precise asymptotics in the Baum-Kate and Davis law of large numbers. J. Math. Anal. Appl.248, 233-246 (2000)
4. Lanzinger, H, Stadtmüller, U: Refined Baum-Katz laws for weighted sums of iid random variables. Stat. Probab. Lett.
69, 357-368 (2004)
5. Liu, WD, Lin, ZY: Precise asymptotic for a new kind of complete moment convergence. Stat. Probab. Lett.76, 1787-1799 (2006)
6. Klesov, OI: On the convergence rate in a theorem of Heyde. Theory Probab. Math. Stat.49, 83-87 (1994) 7. He, JJ, Xie, TF: Asymptotic property for some series of probability. Acta Math. Appl. Sin. (2012).
doi:10.1007/s10255-012-0138-6
8. Gut, A, Steinebach, J: Convergence rates in Precise asymptotics. J. Math. Anal. Appl.390, 1-14 (2012) 9. Bikelis, A: Estimates of the remainder in the central limit theorem. Litovsk. Mat. Sb.6, 323-346 (1966)
doi:10.1186/1029-242X-2012-195