R E S E A R C H
Open Access
A note to the convergence rates in precise
asymptotics
Jianjun He
**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=nk=1Xk,EX2=
σ
2> 0, andλ
r,p(
) = ∞
n=1nr/p–2P(|Sn| ≥n1/p
). In this paper, the
author discusses the rate of approximation ofrp–pE|N|2(r–p)/(2–p)by
2(r–p)/(2–p)
λ
r,p(
)
under suitable moment conditions, whereNis normal with zero mean and variance
σ
2> 0, which improves the results of Gut and Steinebach (J. Math. Anal. Appl.390:1-14, 2012) and extends the work He and Xie (Acta Math. Appl. Sin. 29:179-186, 2013). Specially, for the caser= 2 andp= 1
β+1,
β
> – 12, the author discusses the rate of
approximation of2βσ+12 by
2
λ
2,1/(β+1)(
) under the conditionEX2I(|X|>t) =O(t–δl(t))
for some
δ
> 0, wherel(t) is a slowly varying function at infinity.MSC: 60F15; 60G50
Keywords: convergence rate; precise asymptotics; slowly varying function
1 Introduction
Let{X,Xn,n≥}be a sequence of i.i.d. random variables. SetSn=
n
k=Xkandλr,p() =
∞
n=nr/p–P(|Sn| ≥n/p). Heyde [] proved that
lim
→
λ
,() =σ,
wheneverEX= andEX=σ<∞. Klesov [] studied the rate of the approximation of σ byλ,() under the conditionE|X|<∞. He and Xie [] improved the results of Klesov []. Gut and Steinebach [] extended the results of Klesov [] and obtained the following TheoremA. Gut and Steinebach [] studied the general idea of proving precise asymptotics.
Theorem A Let{X,Xn,n≥}be a sequence of i.i.d.random variables with zero mean and
<p< ,r≥.
() IfEX=σ> andE|X|q<∞for somer<q≤,then
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)=op((qq––)(p)(–r–pp)).
() IfEX=σ> andE|X|q<∞for someq≥withq>r–p
–p ,then
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)=o(–p)(pp(r+–pq)–pq),
whereNis normal with meanand varianceσ> .
The purpose of this paper is to strengthen TheoremAand extend the theorem of He and Xie [] under suitable moment conditions. In addition, we shall discuss the rate at which λ,/(β+)() converges to σ
β+under the conditionT(t) =O(t
–δl(t)) for someδ> , where
T(t) =EXI(|X|>t),l(t) is a slowly varying function at infinity. Throughout this paper, C represents a positive constant, though its value may change from one appearance to the next, and [x] denotes the integer part ofx.(x) is the standard normal distribution function,(x) =√
π
x
–∞e–t
/
dt,ϕ(x) =(x).
2 Main results
From Gut and Steinebach [], it is easy to obtain the following lemma.
Lemma . Let{X,Xn,n≥}be a sequence of i.i.d.normal distribution random variables
with zero mean and varianceσ> .Set <p< and r≥,then
(r–p)/(–p)
∞
n=
n(r/p)–P|Sn| ≥n/p
– p
r–pE|N|
(r–p)/(–p)
= ⎧ ⎨ ⎩
O((r–p)/(–p)), r< p,
O(p/(–p)), r≥p. (.)
Lemma .(Binghamet al.[]) Let l(t)be a slowly varying function.We have
()for anyη> ,
lim
t→∞t
η
l(t) =∞, lim
t→∞t
–η
l(t) = ;
()if <δ< ,then
t a
s–δl(s)ds∼
–δt
–δ
l(t), t→ ∞;
()ifδ> ,then
∞
t
s–δl(s)ds∼– –δt
–δ
l(t), t→ ∞;
()ifδ= ,then L(t) =t∞l(ss)ds,m(t) =at l(ss)ds are slowly varying functions;and
lim
t→∞
l(t)
L(t)= , tlim→∞
l(t)
m(t)= .
Theorem . Let{X,Xn,n≥}be a sequence of i.i.d.random variables with zero mean
and <p< ,r≥.
()If EX=σ> and E|X|<∞for some r< ,then
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O((r–p)/(–p)), ≤r<p,
O(p/(–p)log), r=p,
O(p/(–p)), p<r< .
()If EX=σ> and E|X|+δ<∞for some <δ< ,r< +δ,then
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)
= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O((r–p)/(–p)), ≤r< ( +δ/)p,
O(pδ/(–p)log
), r= ( +δ/)p,
o(pδ/(–p)), ( +δ/)p<r< +δ.
(.)
()If EX=σ> and E|X|q<∞for some q≥with q>r–p
–p ,then
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O((r–p)/(–p)), ≤r<p,
O(p/(–p)log
), r= p/,
O(p/(–p)), r> p/,
(.)
where N is normal with meanand varianceσ> .
Remark . Clearly, Theorem and Theorem in He and Xie [] are special cases of
Theorem ., by takingr= andp= .
Remark . If <p< ,r≥, we havemin((–r–pp),–pδp) >(+pδδ–(rp–)(–p)p) forr< +δ=q≤ andmin((–r–pp),–pp) > (–p()(rp–+p)qp–pq) for someq≥ withq> –r–pp. So, the results of Theo-rem . are stronger than those of TheoTheo-rem A.
Theorem . Let{X,Xn;n≥}be a sequence of i.i.d random variables with zero mean,
and let T(t) =O(t–δl(t))for someδ> ,where l(t)is a slowly varying function at infinity.
Set EX=σ> andβ> –. ()Ifδ> ,then
λ,/(β+)() –
σ β+ =
⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O(), –<β< –,
O(log), β= –,
O(/(β+)), β> –.
(.)
()If <δ< ,then
λ,/(β+)() –
σ β+ =
⎧ ⎨ ⎩
O(), –<β< –+δ,
O(δ/(β+)l(–/(β+))), β≥– +
δ
.
(.)
()Ifδ= ,then
λ,/(β+)() –
σ β+ =
⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O(+–/(β+)l(tt)dt), –<β< –,
O(( +–
l(t)
t dt)log
), β= –
,
O(/(β+)( +–(β+)/(β+)l(tt)dt)), β> – .
(.)
δ= . But the conditionT(t) =O(t–δ) is weaker than the conditionE|X|+δ<∞. Ifl(t)→
ast→ ∞, then the result of Theorem . is the same as that of Theorem . for <δ< .
Remark . Forδ> , the conditionE|X|+δ<∞is neither sufficient nor necessary for
the conditionT(t) =O(t–δl(t)). Here are some suitable examples.
Example LetXbe a random variable with densityf(x) =|Cx|(++δδlnln|x|x|)|I(|x|>e), whereCis
a normalizing constant, and <δ< , thenEX= andT(t) = tδClntI(t>e),l(t) = lnt is a
slowly varying function at infinity. ButE|X|+δ=C
|x|>e
+δln|x|
|x|ln|x|dx=∞.
Example LetX be a random variable with density f(x) = C|(δln|x|+|x|(ln|x|–))
x|δ+ln|x|e|x|/ln|x| I(|x|>e), where <δ < , then EX= andT(t) = C
tδet/ln(t)I(t>e), h(t) = et/lnt, E|X|+
δ <∞. But
h(t) = et/lnt is not a slowly varying function at infinity.
In fact, we have the following result.
Theorem . Suppose X is a real random variable andδ> .Then E|X|+δ<∞if and
only if tδT(t)→and∞
t s
δ–T(s)ds→as t→ ∞.
Remark . IftδT(t) is bounded ast→ ∞for someδ> , then we haveE|X|+α<∞for
everyα∈(,δ) from Theorem ..
Remark . LetXbe a random variable with zero mean. If there exist positive constants
CandCsuch thatCl(t)≤tδT(t)≤Cl(t) for sufficiently largetand someδ> , where
l(t) is a slowly varying function at infinity, then from Lemma .() and Theorem ., we have
E|X|+δ<∞ ⇔ ∞
t
l(s)
s ds→ ast→ ∞.
3 Proofs of the main results
Proof of Theorem. Without loss of generality, we suppose thatσ= , << . Since
P|Sn| ≥n/p
= –n(–p)/p+Rn, (.)
where
Rn=P
Sn≤–n/p
––n/p–/+n/p–/–PSn≤n/p
.
From (.), we have
(r–p)/(–p)λr,p() –
p r–pE|N|
(r–p)/(–p)
= (r–p)/(–p)
∞
n=
nr/p– –n(–p)/p– p
r–pE|N|
(r–p)/(–p)
+(r–p)/(–p)
∞
n=
By Lemma ., in order to prove Theorem ., we only need to estimate (r–p)/(–p)× ∞
n=nr/p–Rn.
() On account of a non-uniform estimate of the central limit theorem by Nagaev [], for everyx∈R,
P
Sn
√
n<x
–(x)≤ CE|X| √
n( +|x|). (.)
By (.),|Rn| ≤ CE|X|
√
n(+n(–p)/p).
(a) Ifr< p/, then
(r–p)/(–p)
∞
n=
nr/p–Rn≤C(r–p)/(–p)
∞
n=
nr/p–/=O(r–p)/(–p). (.)
(b) If p/ <r< , then
(r–p)/(–p)
∞
n=
nr/p–Rn
≤C(r–p)/(–p)
∞
n=
nr/p– √
n( +n(–p)/p)
≤C(r–p)/(–p)
[–p/(–p)]
n=
nr/p– √
n +
– ∞
n=[–p/(–p)]+
nr/p–/–(–p)/p
=Op/(–p). (.)
(c) Ifr= p/, then
(r–p)/(–p)
∞
n=
nr/p–Rn≤Cp/(–p)
[–p/(–p)]
n=
n+
– ∞
n=[–p/(–p)]+
n––(–p)/p
=O
p/(–p)log
. (.)
From (.), (.), (.), (.) and (.), we obtain (.). This completes the proof of part (). () By the inequality in Osipov and Petrov [], there exists a bounded and decreasing functionψ(u) on the interval (,∞) such thatlimu→∞ψ(u) = and
P
√
nσSn<x
–(x)≤ψ( √
n( +|x|)) nδ/( +|x|)+δ.
Letx=n(–p)/p, we have|Rn| ≤ψ(
√
n(+n(–p)/p))
nδ/(+n(–p)/p)+δ, so that:
(a) If <r< ( +δ/)p, then
(r–p)/(–p)
∞
n=
nr/p–Rn≤(r–p)/(–p)
∞
n=
(b) If ( +δ/)p<r< +δ, then by noticing thatlimu→∞ψ(u) = for anyη> , there exists a natural numberNsuch thatψ(√n) <ηwhenevern>N. We conclude that
(r–p)/(–p)
∞
n=
nr/p–Rn
≤C(r–p)/(–p)
∞
n=
nr/p–ψ(√n( +n(–p)/p))
nδ/( +n(–p)/p)+δ
≤C(r–p)/(–p) N
n=
nr/p––δ/ψ(√n) +η
[–p/(–p)]
n=N+
nr/p––δ/
+C(r–p)/(–p)––δψ–p/(–p)
∞
n=[–p/(–p)]+
nr/p––δ/–(/p–/)(+δ)
≤(r–p)/(–p)Nr/p––δ/+Cηpδ/(–p)+Cψ–p/(–p)pδ/(–p)
=opδ/(–p). (.)
(c) Ifr= ( +δ/)p, then
(r–p)/(–p)
∞
n=
nr/p–Rn=O
pδ/(–p)log
. (.)
By (.) and combining with (.), (.), (.) and (.), we obtain (.), which completes the proof of part ().
() We make use of the following large deviation estimate in Petrov []:
P
√
nσSn<x
–(x)≤√ C
n( +|x|)q, x> .
So,|Rn| ≤√n(+nC(–p)/p)q. Hence we have the following.
(a) Ifr< p/, then
(r–p)/(–p)
∞
n=
nr/p–Rn≤(r–p)/(–p)
∞
n=
nr/p–/=O(r–p)/(–p). (.)
(b) Ifr> p/, thenpr––q–ppq< –. By noting thatq>r––pp, we obtain
(r–p)/(–p)
∞
n=
nr/p–Rn≤C(r–p)/(–p)
∞
n=
nr/p– ( +n(–p)/p)q√n
≤C(r–p)/(–p)
[–p/(–p)]
n=
nr/p––/
+C(r–p)/(–p)–q
∞
n=[–p/(–p)]+
nr/p––/–(–p)q/p
(c) Ifr= p/, then
(r–p)/(–p)
∞
n=
nr/p–Rn≤Cp/(–p)
[–p/(–p)]
n=
n+C
p/(–p)–q
∞
n=[–p/(–p)]+
n––(–p)q/p
=O
p/(–p)log
. (.)
By (.), from (.), (.), (.) and (.), we have (.), which completes the proof of
part ().
Proof of Theorem. We write
λ,/(β+)() – β+
=
√
π
∞
n=
nβ
∞
nβ+/e
–t/dt– β+
+
[–/(β+)]
n= +
∞
n=[–/(β+)]+
nβ
P|Sn| ≥nβ+
–√
π ∞
nβ+/e
–t/dt
=:I+I+I. (.)
First, according to Lemma ., we have
I= ⎧ ⎨ ⎩
O(), –<β<,
O(/(β+)), β≥. (.)
ForI, applying Lemma . of Xie and He [], and lettingx= y=nβ+, we obtain
P|Sn| ≥nβ+
≤nP
|X| ≥
n
β+
+ e–n–β–. (.)
Observing the following fact
√
π ∞
nβ+/e
–t/dt= –nβ+≤ϕ(n
β+/)
nβ+/ =O
–n–β–/, (.)
from (.) and (.), we have
I≤ ∞
n=[–/(β+)]+
nβP|Sn| ≥nβ+
+
∞
n=[–/(β+)]+
nβ
√ π
∞
nβ+/e
–t/dt
≤
∞
n=[–/(β+)]+
nβ+P
|X|>n
β+
+C–
∞
n=[–/(β+)]+
n–β–
+C–
∞
≤
∞
n=[–/(β+)]+ nβ+
|x|≥nβ+ dF(x) +O
+O
≤
∞
n=[–/(β+)]+
nβ+ ∞
k=n
kβ+≤x<(k+)β+
dF(x) +O
≤
∞
k=[–/(β+)]+
k
n=
nβ+
kβ+≤x<(k+)β+
dF(x) +O
≤C
∞
k=[–/(β+)]+ kβ+
kβ+≤x<(k+)β+
dF(x) +O
≤C
∞
k=[–/(β+)]+
kβ+≤x<(k+)β+
xdF(x) +O
≤C
x≥
–(β+)/(β+)
xdF(x) +O
=CT–(β+)/(β+)+O.
Using the assumption onT(t) and Lemma .(), we can obtain
I= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O(), –<β≤min(δ,)–,
O(/(β+)), β≥– ,δ≥,
O(δ/(β+)l(–/(β+))), β≥– +
δ
, <δ< .
(.)
ForI, by Bikelis’s inequality (see []), we have
I≤
[–/(β+) ]
n=
Cnβ
( +nβ+/)√n
(+nβ+/)√n
T(v)dv
≤
[–/(β+) ]
n=
nβ–/
(+nβ+/)√n
T(v)dv
+–
[–/(β+) ]
n=[–/(β+)]+ n–β–
(+nβ+/)√n
T(v)dv.
Now, the proof of Theorem . will be divided into the following cases. Case ofδ> .
Noting thatT(t)≤EX= , letδ
be a real number such that <δ<δ, by Lemma .(),
limt→∞tδ–δl(t) = . Therefore, there is a real numberT
> such that|tlδ–δ(t)|< whenever t>T. Then
∞
T(t)dt≤
T(t)dt+ ∞
T(t)dt≤C+ ∞
T
We have
I≤C
[–/(β+) ]
n=
nβ–/+C–
[–/(β+) ]+
n=[–/(β+)]+ n–β–
= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O(), –<β≤–,
O(log
), β= –
,
O(/(β+)), β> – .
(.)
From (.), (.), (.) and (.), we obtain (.). Case of <δ< .
(a) If –<β< –+δ
, then ∞
n=nβ–/<∞and ∞
t
β+–δl(t)dt<∞. Making use of
Lemma .()-(), we have
I≤C
[–/(β+) ]
n=
nβ–/
+
√n
T(t)dt
+C–
[–/(β+) ]
n=[–/(β+)]+ n–β–
+
nβ+
T(t)dt
≤C
[–/(β+) ]
n=
nβ–/(√n)–δl(√n) +O
+C/(β+)+C–
[–/(β+) ]
n=[–/(β+)]+
n–β–nβ+–δlnβ+
≤C
–/(β+)
xβ–/(√x)–δl(√x)dx
+C–δ ∞
–/(β+)x
–β–lxβ+x(β+)(–δ)dx+O
≤C
–/(β+)
tβ+–δl(t)dt+C
∞
–/(β+) l(t)
t+δdt+O
≤C+Cδ/(β+)l–/(β+)
=O. (.)
(b) Ifβ≥– +
δ
, then we have
I≤C–(β+)/(β+)
+
–/(β+)
T(t)dt
+C/(β+)+Cδ/(β+)l–/(β+)
≤C/(β+)( +–(–δ)/(β+)l–/(β+)+Cδ/(β+)l–/(β+)
Therefore
I= ⎧ ⎨ ⎩
O(), –<β≤–+δ
,
O(δ/(β+)l(/(β+))), β≥– +
δ
.
(.)
Combining the estimate with (.) and (.), by (.), this implies that (.) follows. Case ofδ= .
(a) If –<β< –, then∞n=nβ–<∞. We have
I≤C
+
–/(β+)
T(t)dt
[–/(β+) ]
n=
nβ–/
+C– + – β+ β+
T(t)dt
[–/(β+) ]
n=[–/(β+)]+ n–β–
≤C
+
–/(β+)
l(t)
t dt
+/(β+) + – β+ β+
l(t)
t dt
≤C
+
–/(β+)
l(t)
t dt
. (.)
(b) Ifβ> –, then we have
I≤C
– β+(β+/)
+
–/(β+)
l(t)
t dt
+C/(β+)
+
–(β+)/(β+)
l(t)
t dt
≤C/(β+)
+
–/(β+)
l(t)
t dt
+/(β+)
+
–(β+)/(β+)
l(t)
t dt
≤C/(β+)
+
–(β+)/(β+)
l(t)
t dt
. (.)
(c) Ifβ= –
, then we have
I≤Clog + –
l(t)
t dt
+C
+
–
l(t)
t dt
≤Clog
+ –
l(t)
t dt
so that
I= ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩
O(( +–/(β+)
l(t)
t dt)), –
<β≤– ,
O(( +–l(tt)dt)log
), β= –
,
O(/(β+)( +–(β+)/(β+)
l(t)
t dt)), β> –
.
(.)
Combining the estimate with (.) and (.), by (.), this implies that (.) follows, and
Proof of Theorem. SetT(t) =E|X|+δI(|X|>t). First, note that
E|X|+δI|X|>t=
|x|>t
|x|+δdF(x)
=
|x|>t
x
|x| t
δyδ–dy
dF(x) +tδ
|x|>t
xdF(x)
= ∞
t
δyδ–
|x|>y
xdF(x)
dy+tδT(t)
=δ ∞
t
sδ–T(s)ds+tδT(t).
We have
T(t) =δ ∞
t
sδ–T(s)ds+tδT(t).
Sincet∞sδ–T(s)ds≥,tδT(t)≥, we have
T(t)→ ⇔ tδT(t)→ and ∞
t
sδ–T(s)ds→ ast→ ∞.
Next, it is easy to get
E|X|+δ<∞ ⇔ T
(t)→ ast→ ∞.
From the above facts, the proof of Theorem . is complete.
Competing interests
The author declares that they have no competing interests.
Acknowledgements
The author would like to thank the referee for helpful comments.
Received: 3 February 2013 Accepted: 18 July 2013 Published: 11 August 2013 References
1. Heyde, CC: A supplement to the strong law of large numbers. J. Appl. Probab.12, 903-907 (1975) 2. Klesov, OI: On the convergence rate in a theorem of Heyde. Theory Probab. Math. Stat.49, 83-87 (1994) 3. He, JJ, Xie, TF: Asymptotic property for some series of probability. Acta Math. Appl. Sin.29, 179-186 (2013) 4. Gut, A, Steinebach, J: Convergence rates in precise asymptotics. J. Math. Anal. Appl.390, 1-14 (2012) 5. Gut, A, Steinebach, J: Precise asymptotics-a general approach. Acta Math. Hung.138, 365-385 (2013) 6. Gut, A, Steinebach, J: Correction to ‘Convergence rates in precise asymptotics’. Preprint
(http://www2.math.uu.se/~allan/90correction.pdf) (2012)
7. Bingham, NH, Goldie, CM, Teugels, JL: Regular Variation. Cambridge University Press, Cambridge (1987) 8. Nagaev, SV: Some limit theorems for large deviation. Theory Probab. Appl.10, 214-235 (1965)
9. Osipov, LV, Petrov, VV, On an estimate of remainder term in the central limit theorem. Theory Probab. Appl.12, 281-286 (1967)
10. Petrov, VV: Limit Theorems of Probability Theory. Oxford University Press, Oxford (1995) 11. Xie, TF, He, JJ: Rate of convergence in a theorem of Heyde. Stat. Probab. Lett.82, 1576-1582 (2012) 12. Bikelis, A: Estimates of the remainder in the central limit theorem. Liet. Mat. Rink.6, 323-346 (1966)
doi:10.1186/1029-242X-2013-378
Cite this article as:He:A note to the convergence rates in precise asymptotics.Journal of Inequalities and Applications