HAL Id: hal-00713797
https://hal.archives-ouvertes.fr/hal-00713797
Submitted on 2 Jul 2012
HAL
is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire
HAL, estdestinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
for non adapted sequences. Application to ergodic automorphisms of the torus
Jérôme Dedecker, Florence Merlevède, Françoise Pene
To cite this version:
Jérôme Dedecker, Florence Merlevède, Françoise Pene. Rates of convergence in the strong invari-
ance principle for non adapted sequences. Application to ergodic automorphisms of the torus. High
dimensional probability 6, Oct 2011, Banff, Canada. pp.113-138. �hal-00713797�
ance principle for non adapted sequences.
Application to ergodic automorphisms of the torus
J´ erˆ ome Dedecker, Florence Merlev` ede and Fran¸coise P` ene
Abstract. In this paper, we give rates of convergence in the strong invari- ance principle for non-adapted sequences satisfying projective criteria.
The results apply to the iterates of ergodic automorphismsT of thed- dimensional torusTd, even in the non hyperbolic case. In this context, we give a large class of unbounded functionf fromTdtoR, for which the partial sumf◦T+f◦T2+· · ·+f◦Tnsatisfies a strong invariance principle with an explicit rate of convergence.
Mathematics Subject Classification (2010).60F17; 37D30.
Keywords.almost sure invariance principle, strong approximations, non adapted sequences, ergodic automorphisms of the torus.
1. Introduction and notations
Let (Ω,A,P) be a probability space, andT : Ω7→Ω be a bijective bimeasur- able transformation preserving the probability P. For a σ-algebra F0 sat- isfying F0 ⊆ T−1(F0), we define the nondecreasing filtration (Fi)i∈Z by Fi=T−i(F0). TheLp norm of a random variableX is denoted bykXkp = (E(|X|p))1/p.
Let X0 be a real-valued and square integrable random variable such thatE(X0) = 0, and define the stationary sequence (Xi)i∈ZbyXi=X0◦Ti. Define then the partial sum by Sn = X1+X2+· · ·+Xn. According to the Birkhoff-Khinchine theorem,Sn satisfies a strong law of large numbers.
One can go further in the study of the statistical properties ofSn. We study here the rate of convergence in the almost sure invariance principle (ASIP).
More precisely, we give conditions under which there exists a sequence of
F. P`ene is partially supported by the French ANR projects MEMEMO2 and PERTURBATIONS.
independent identically distributed (iid) Gaussian random variables (Zi)i≥1
such that sup
1≤k≤n
k
X
i=1
(Xi−Zi)
=o(n1/pL(n)) almost surely, (1.1) forp∈]2,4] and Lan explicit slowly varying function. Let us recall that, in the iid case, Koml´os, Major and Tusn´ady [13] and Major [18] obtained an ASIP with the optimal rateo(n1/p) in (1.1) as soon as the random variables admit a moment of orderp.
Since the seminal paper by Philipp and Stout [25], many authors have considered this problem in a dependent context, but most of the papers deal with the adapted case, when X0 is F0 measurable (for instance, F0 is the pastσ-algebraσ(Xi, i≤0)). Unfortunately, it is quite common to encounter dynamical systems for which the natural filtration does not permit the control of any quantity involving terms of the typekE(Xn|F0)kp.
In this paper, we shall not assume thatX0 is F0-measurable, and we shall give conditions on the quantities kE(Xn|F0)kp, kX−n−E(X−n|F0)kp
andkE(Sn2|F−n)−E(Sn2)kp/2 for (1.1) to hold (see Theorems 3.1 and 3.2 of Section 3). These conditions are in the same spirit as those given by Gordin [7] forp= 2 to get the usual central limit theorem. Our proof is based on the approximation
n
X
i=1
Xi=Mn+Rn
by the martingaleMn=d1+d2+· · ·+dn, wherediis the martingale difference di=X
k∈Z
(E(Xk|Fi)−E(Xk|Fi−1))
introduced by Gordin [7] and Heyde [10]. In the adapted case, similar condi- tions are given in the recent paper [2], together with a long list of applications.
In the non adapted case, it is easy to see that our results apply to a large class of two-sided functions of iid sequences, or two-sided functions of absolutely regular sequences. But they also apply to very complicated dynamical systems, for which such a representation by functions of absolutely regular sequences is not available. In the next section, we consider the case where T is an ergodic automorphism of the d-dimensional torusTd, and P is the Lebesgue measure on Td. In this context, we use the σ-algebras Fi
considered by Le Borgne [14]. As a consequence of Theorem 2.1, we obtain that (1.1) holds forp= 4 andXi=f◦Ti, wheref :Td→R, as soon as the Fourier coefficients (ck)k∈Zd off are such that
|ck| ≤A
d
Y
i=1
1
(1 +|ki|)3/4logα(2 +|ki|) for someα >13/8.
We also get that there exists a positiveεsuch that sup
1≤k≤n
k
X
i=1
(Xi−Zi)
=o(n1/2−ε) almost surely, as soon as
|ck| ≤A
d
Y
i=1
1
(1 +|ki|)δ for some δ >1/2.
These rates of convergence in the almost sure invariance principle complement the results by Leonov [16] and Le Borgne [14] for the central limit theorem and the almost sure invariance principle respectively. Let us mention that Dolgopyat [5] established an ASIP with the rateo(n1/2−ε) (for someε >0) valid for ergodic automorphisms of the torus and f a H¨older continuous function. Thanks to the decorrelation estimates obtained in [15], the rate for H¨older observables can be improved by applying the general result of Gou¨ezel in [8] to get the rateo(n1/4+ε) for everyε >0, and by applying the results of the present paper to get the rateo(n1/4L(n)). To our knowledge, the present work gives the first strong approximation results for such partially hyperbolic transformationsT for unbounded (and then non continuous) functionsf.
To conclude, let us mention some previous works in the context of dy- namical systems: several results have been established with the rateo(n1/2−ε) for someε >0 (see [11, 4, 5, 24, 19]). Results giving a rate in o(n1/4+ε) for every ε > 0 can be found in [21, 6, 20, 8]. Most of these results hold for bounded functionsf.
Let us reiterate that we can reach the rate o(n1/4L(n)) instead of o(n1/4+ε) for everyε >0. Moreover, our conditions giving the rateo(n1/pL(n)) are related to moments of orderpoff. Such results are not very common in the context of dynamical systems (let us mention [8] in the particular case of Gibbs-Markov maps, and [3, 23] for generalized Pommeau-Manneville maps).
2. ASIP with rates for ergodic automorphisms of the torus
A probability dynamical system (Ω,F,P, T) is given by a probability space (Ω,F,P) and a measurableP-preserving transformationT : Ω→Ω. Such a dynamical system is said to be ergodic if the onlyA∈ Fsuch thatT−1A=A a.s. are the sets of probability 0 or 1.
If (Ω,F,P, T) is ergodic, the study of the stochastic properties of the stationary sequence (f◦Tk)k≥1starts with the Birkhoff-Khintchine theorem [1, 12]. This theorem ensures that, for every integrable functionf : Ω→R, the sequencen−1Pn
k=1f ◦Tk converges almost surely to E(f). This means that (f◦Tk)k≥1satisfies a strong law of large number. A natural question is then to investigate further stochastic properties of (f◦Tk)k≥1.
We illustrate our general Theorems 3.1 and 3.2 by a concrete example of invertible non hyperbolic dynamical system, which is actually partially hyperbolic. We shall prove a strong invariance principle for a large class of unbounded functionsf, with a rate depending on the rate of convergence to
zero of the Fourier coefficients off. In this context, we use theσ-algebrasFi
considered by Le Borgne [14]. The stationary sequence (Ti)i∈Zis non adapted to this filtration (Fi)i∈Z, in the sense thatTiis notFimeasurable. This is an important difference with the classical probabilistic situation, where the study of stationary sequences can often be done with the help of a natural “past”
filtration (think of stationary Markov chains, or of causal linear processes).
Let d ≥ 2. We consider a group automorphism T of the torus Td = Rd/Zd. For everyx∈Rd, we write ¯xits class inTd. We recall thatT is the quotient map of a linear map ˜T :Rd→Rd given by ˜T(x) =S·x, whereS is a d×d-matrix with integer entries and with determinant 1 or -1. The map x7→S·xpreserves the infinite Lebesgue measure λonRd and T preserves the probability Lebesgue measure ¯λ. We suppose that T is ergodic, which is equivalent to the fact that no eigenvalue of S is a root of the unity. In this case, it is known that the spectral radius of S is larger than one (and so S admits at least an eigenvalue of modulus larger than one and at least an eigenvalue of modulus smaller than one). This hypothesis holds true in the case of hyperbolic automorphisms of the torus (i.e. in the case when no eigenvalue ofS has modulus one) but is much weaker. Indeed, as mentioned in [14], the following matrix gives an example of an ergodic non hyperbolic automorphism ofT4:
S :=
0 0 0 −1
1 0 0 2
0 1 0 0
0 0 1 2
.
WhenT is ergodic and non hyperbolic, the dynamical system (Td, T,λ) has¯ no Markov partition. However, it is possible to construct some measurable partition [17], to prove a central limit theorem [16]. Moreover, in [14], Le Borgne proved the functional central limit theorem and the Strassen strong invariance principle for (Xk=f◦Tk)k under weak hypotheses onf, thanks to Gordin’s method and to the partitions studied by Lind in [17].
We give here rates of convergence in the strong invariance principle for (Xk =f ◦Tk)k under conditions on the Fourier coefficients of f :Td →R. In what follows, fork∈Zd, we denote by|k|= maxi∈{1,...,d}|ki|.
Theorem 2.1. Let T be an ergodic automorphism of Td with the notations as above. Let p∈]2,4]and q be its conjugate exponent. Let f :Td →Rbe a centered function with Fourier coefficients(ck)k∈Zdsatisfying, for any integer b≥2,
X
|k|≥b
|ck|q ≤Rlog−θ(b) for someθ > p2−2
p(p−1), (2.2) and
X
|k|≥b
|ck|2≤Rlog−β(b) for someβ > 3p−4
p . (2.3)
Then the series
σ2= ¯λ((f−λ(f¯ ))2) + 2X
k>0
λ((f¯ −λ(f))f¯ ◦Tk)
converges absolutely and, enlarging Td if necessary, there exists a sequence (Zi)i≥1of iid gaussian random variables with zero mean and varianceσ2such that, for anyt >2/p,
sup
1≤k≤n
k
X
i=1
f ◦Ti−
k
X
i=1
Zi
=o n1/p(logn)(t+1)/2
almost surely, asn→ ∞. (2.4) Observe that (2.3) follows from (2.2) provided thatθ >(3p−4)/(2p−2).
Hence, (2.2) and (2.3) are both satisfied as soon as X
|k|≥b
|ck|q ≤Rlog−θ(b) for someθ > 3p−4 2(p−1).
Example. Let p∈]2,4]. If we assume that the Fourier coefficients of f are such that
|ck| ≤A
d
Y
i=1
1
(1 +|ki|)1/qlogα(2 +|ki|), (2.5) for some positive constant A, then the conditions (2.2) and (2.3) are both satisfied provided thatα >(2p2−p−2)/p2.
Let us now compare our hypotheses on Fourier coefficients with those appearing in other works. In [16], Leonov proved a central limit theorem (possibly degenerated) when
|ck| ≤A
d
Y
i=1
1
(1 +|ki|)1/2logα(2 +|ki|) for some α >3/2. (2.6) In [14], Le Borgne proved the functional central limit theorem and the Strassen strong invariance principle when (2.3) holds true withβ >2 (and whenf is not a coboundary), which is a weaker condition than (2.6). Observe that, as pconverges to 2, (p2−2)/(p(p−1)) and (3p−4)/pboth converge to 1.
3. Probabilistic results
In the rest of the paper, we shall use the following notations: Ek(X) = E(X|Fk), and an ≪bn means that there exists a numerical constant C not depending onnsuch thatan ≤Cbn, for all positive integersn.
In this section, we give rates of convergence in the strong invariance principle under projective criteria for stationary sequences that are non nec- essarily adapted toFi.
Theorem 3.1. Let 2 < p < 4 and t > 2/p. Assume that X0 belongs to Lp, that
X
n≥2
np−1
n2/p(logn)(t−1)p/2 kE0(Xn)kpp+kX−n−E0(X−n)kpp
<∞, (3.1) and that
X
n≥2
n3p/4
n2(logn)(t−1)p/2 kE0(Xn)kp/22 +kX−n−E0(X−n)kp/22
<∞. (3.2) Assume in addition that there exists a positive integerm such that
X
n≥2
1 n2(logn)(t−1)p/2
E−nm(Sn2)−E(Sn2)
p/2
p/2<∞. (3.3) Then n−1E(Sn2) converges to σ2 = P
k∈ZCov(X0, Xk) and, enlarging Ω if necessary, there exists a sequence (Zi)i≥1 of iid Gaussian random variables with zero mean and varianceσ2 such that
sup
1≤k≤n
Sk−
k
X
i=1
Zi
=o n1/p(logn)(t+1)/2
almost surely, as n→ ∞. (3.4) Theorem 3.2. Let t >1/2. Assume thatX0 belongs to L4 and that the con- ditions (3.1)and (3.3)hold with p= 4. Assume in addition that
X
n≥2
n(logn)4−2t kE0(Xn)k22+kX−n−E0(X−n)k22
<∞. (3.5) Then the conclusion of Theorem3.1 holds withp= 4.
Of course, if (Xi)i∈Z is a sequence of iid random variables inLp, then, takingFi =σ(Xk, k ≤i), all the conditions (3.1), (3.2), (3.3) and (3.5) are satisfied. In that particular case, we obtain an extra power of log(n) compared to the optimal raten1/p.
The conditions (3.1), (3.2) and (3.5) are similar to the conditions given by Gordin [7] whenp= 2 for the central limit theorem, and hence Theorem 3.1 and 3.2 have the same range of applicability as Gordin’s result.
For the proof of Theorems 3.1 and 3.2, we shall use the approximating martingale Mn introcuded by Gordin [7], and we shall give an appropriate upper bound onRn=Sn−Mn. The next step is to get a strong approximation result for the martingaleMn. This will be done by applying Proposition 5.1 in [2], which itself is based on the Skorohod embedding for martingales, as in [26].
3.1. Proofs of Theorems3.1and3.2
Proof. We first notice that sincep >2, (3.1) implies that X
n>0
n−1/pkE0(Xn)kp<∞ and X
n>0
n−1/pkX−n−E0(X−n)kp<∞
(apply H¨older’s inequality to see this). LetPk(X) =Ek(X)−Ek−1(X). Using Lemma 5.1 of the appendix withq= 1, we infer that
X
k∈Z
kP0(Xk)kp<∞. (3.6) In addition the condition (3.6) implies thatn−1E(Sn2) converges to the quan- tityσ2=P
k∈ZCov(X0, Xk).
Let nowd0:=P
j∈ZP0(Xj). Thend0belongs toLpandE(d0|F−1) = 0.
Let di := d0◦Ti for all i ∈ Z. Then (di)i∈Z is a stationary sequence of martingale differences inLp. Let
Mn:=
n
X
i=1
di and Rn:=Sn−Mn. The theorems will be proven if we can show that
Rn =o n1/p(logn)(t+1)/2
almost surely as n→ ∞, (3.7) and that (3.4) holds true withMkreplacingSk. SinceE(d20) =σ2andt > p/2, according to Proposition 5.1 in [2] (applied with ψ(n) := n2/p(logn)t), to prove that (3.4) holds true withMk replacingSk, it suffices to prove that
X
n≥2
1 n2(logn)(t−1)p/2
E0(Mn2)−E(Mn2)
p/2
p/2<∞. (3.8) By standard arguments, (3.7) will be satisfied if we can show that
X
r>0
kmax1≤ℓ≤2r|Rℓ|kpp
2rr(t+1)p/2 <∞. (3.9)
Now, by stationarity,kmax1≤ℓ≤2r|Rℓ|kp ≪2r/pPr
k=02−k/pkR2kkp (see for instance inequality (6) in [27]) and for alli, j≥0,kRi+jkq ≤ kRikq+kRjkq. Applying then Item 1 of Lemma 37 in [22], we derive that for any integern in [2r,2r+1[,
max
1≤ℓ≤2r|Rℓ| p
≪n1/p
n
X
k=1
k−(1+1/p)kRkkp. (3.10) Therefore using (3.10) followed by an application of H¨older’s inequality, we get that for anyα <1,
X
r>0
kmax1≤ℓ≤2r|Rℓ|kpp
2rr(t+1)p/2 ≪X
n≥2
1 n(logn)(t+1)p/2
Xn
k=1
k−(1+1/p)kRkkp
p
≪X
n≥2
(logn)(p−1)(1−α) n(logn)(t+1)p/2
n
X
k=1
k−2(logk)α(p−1)kRkkpp.
Hence takingα∈]1−p/(2(p−1)),1[ and changing the order of summation, we infer that (3.9) and then (3.7) hold provided that
X
n≥1
kRnkpp
n2(logn)(t−1)p/2 <∞. (3.11) On an other hand, we shall prove that condition (3.8) is implied by:
there exists a positive finite integermsuch that X
n≥2
1 n2(logn)(t−1)p/2
E−nm(Mn2)−E(Mn2)
p/2
p/2<∞. (3.12) For any nonnegative integer i, we set Vi := kE0(Mi2)−E(Mi2)kp/2. Using thatMn is a martingale, we infer that, for any nonnegative integersiandj,
Vi+j≤Vi+Vj. (3.13)
Let nown∈[2k,2k+1−1]∩N, and write its binary expansion:
n=
k
X
ℓ=0
2ℓbℓ wherebk= 1 and bj∈ {0,1}forj= 0, . . . , k−1. Inequality (3.13) combined with H¨older’s inequality implies that, for any η >0,
Vnp/2≤Xk
ℓ=0
V2ℓ
p/2
≪2ηp(k+1)/2
k
X
ℓ=0
V2ℓ
2ηℓ p/2
. (3.14)
Therefore X
n≥2
1
n2(logn)(t−1)p/2Vnp/2≪X
k>0
2ηp(k+1)/2 2kk(t−1)p/2
k
X
ℓ=0
V2ℓ 2ηℓ
p/2
.
Changing the order of summation and takingη∈]0,2/p[, it follows that (3.8) is implied by
X
k≥1
1 2kk(t−1)p/2
E0(M22k)−E(M22k)
p/2
p/2<∞ (3.15) (actually due to the subadditivity of the sequence (Vi) both conditions are equivalent, see the proof of item 1 of Lemma 37 in [22] to prove that (3.8) entails (3.15)). Now, since (Mn) is a martingale,
E0(M22k)−E(M22k) =
k
X
j=1
E0((M2j −M2j−1)2)−E((M2j −M2j−1)2) +E0(d21)−E(d21),
which implies by stationarity that
E0(M22k)−E(M22k) p/2≤
k−1
X
j=0
E
−2j(M22j)−E(M22j) p/2
+
E0(d21)−E(d21) p/2. Therefore by using H¨older’s inequality as done in (3.14) withη∈]0,2/p[, we infer that (3.15) is implied by
X
k≥1
1 2kk(t−1)p/2
E−2k(M22k)−E(M22k)
p/2
p/2<∞. (3.16) Notice now that the sequence (Wn)n>0 defined by
Wn :=
E−n(Mn2)−E(Mn2) p/2
is subadditive. Indeed, for any non negative integersiand j, using thatMn
is a martingale together with the stationarity, we derive that Wi+j=
E−(i+j)(Mi2)−E(Mi2) +E−(i+j)((Mi+j−Mi)2)
−E((Mi+j−Mi)2) p/2
≤
E−i(Mi2)−E(Mi2) p/2+
E−j(Mj)2)−E(Mj)2) p/2
≤Wi+Wj.
ThereforeWi+jp/2≤2p/2Wip/2+ 2p/2Wjp/2. This implies that, for any integerℓ and any integer 0≤j≤ℓ,Wℓp/2≤2p/2(Wjp/2+Wℓp/2−j) in such a way that
(ℓ+ 1)Wℓp/2≤21+p/2
ℓ
X
j=1
Wjp/2. (3.17)
Therefore using (3.17) withℓ= 2k, we infer that condition (3.16) is implied by
X
n≥2
1 n2(logn)(t−1)p/2
E−n(Mn2)−E(Mn2)
p/2
p/2<∞. (3.18) It remains to prove that (3.12) implies (3.18). With this aim, we have, for any positive integerm,
Mn=
m
X
k=1
Mk[nm−1]−M(k−1)[nm−1]
+Mn−Mm[nm−1].
Using thatMn is a martingale together with the stationarity, we then infer that
E−n(Mn2)−E(Mn2)
p/2
p/2≤2p/2mp/2
E−n(M[nm2 −1])−E(M[nm2 −1])
p/2 p/2
+ 2p/2
E−n(Mn2−m[nm−1])−E(Mn2−m[nm−1])
p/2 p/2,
which, together with the fact thatn−m[nm−1]< m, implies that
E−n(Mn2)−E(Mn2)
p/2 p/2
≤2p/2mp/2
2p/2kd0kpp+
E−n(M[nm2 −1])−E(M[nm2 −1])
p/2 p/2
≤2p/2mp/2
2p/2kd0kpp+
E−m[nm−1](M[nm2 −1])−E(M[nm2 −1])
p/2 p/2
, (3.19) where for the last line we have used the fact thatn≥m[nm−1]. We notice now that due to the martingale property of (Mn) and to stationarity, the sequence (Ui)i≥0 defined for any non negative integeriby
Ui:=
E−mi(Mi2)−E(Mi2)
p/2 p/2
satisfies, for any positive integersiandj, Ui+j ≤
E−m(i+j)(Mi2)−E(Mi2) p/2 +
E−m(i+j)((Mi+j−Mi)2)−E((Mi+j−Mi)2) p/2
p/2
≤2p/2Ui+ 2p/2Uj. Hence by (3.17) applied withWip/2=Ui,
U[nm−1] ≤21+p/2([nm−1] + 1)−1
[nm−1]
X
k=1
Uk≤21+p/2
[nm−1]
X
k=1
Uk
k . (3.20) Therefore starting from (3.19), considering (3.20) and changing the order of summation, we infer that (3.18) (and so (3.8)) holds provided that (3.12) does. To end the proof, it remains to show that under the conditions of Theorems 3.1 and 3.2, the conditions (3.11) and (3.12) are satisfied. This is
achieved by using the two following lemmas.
Lemma 3.1. Letp∈[2,4]. Assume that (3.1)holds. Then X
n≥1
max1≤ℓ≤nkRℓkpp
n2(logn)(t−1)p/2 <∞, and (3.11) holds.
Proof. Since (3.1) implies (3.6), Item 2 of Proposition 5.1 given in the ap- pendix implies that, for any positive integersℓandN,
kRℓkp≪ max
k=ℓ,NkE0(Sk)kp+ max
k=ℓ,NkSk−Ek(Sk)kp+ℓ1/2 X
|j|≥N
kP0(Xj)kp.
Next, applying Lemma 5.1 given in the appendix withq= 1, and using the fact that by stationarity, for any positive integerk,
kE0(Sk)kp≤
k
X
ℓ=1
kE0(Xℓ)kp and kSk−Ek(Sk)kp ≤
k−1
X
ℓ=0
kX−ℓ−E0(X−ℓ)kp, (3.21) we derive that for, any positive integersN ≥n,
1max≤ℓ≤nkRℓkp≪
N
X
k=1
kE0(Xk)kp+
N−1
X
k=0
kX−k−E0(X−k)kp
+n1/2 X
k≥[N/2]
kE0(Xk)kp
k1/p +n1/2 X
k≥[N/2]
kX−k−E0(X−k)kp
k1/p . (3.22) The lemma follows from (3.22) withN = [np/2] by using H¨older’s inequality (see the computations in the proof of Proposition 2.2 in [2]).
Lemma 3.2. Let p ∈ [2,4] and assume that (3.1) and (3.3) are satisfied.
Assume in addition that (3.2) holds when 2 < p < 4 and (3.5) does when p= 4 . Then (3.12) is satisfied.
Proof. Letmbe a positive integer such that (3.3) is satisfied. We first write that
kE−nm(Mn2)−E(Mn2)
p/2≤ kE−nm(Sn2)−E(Sn2) p/2
+ 2kE−nm(SnRn)−E(SnRn)kp/2+ 2kRnk2p. By using Lemma 3.1, and since (3.3) holds, Lemma 3.2 will follow if we can prove that
X
n≥1
1
n2(logn)(t−1)p/2kE−nm(SnRn)kp/2p/2<∞. (3.23) With this aim we shall prove the following inequality. For any non negative integerrand any positive integerun such thatun≤n, we have that
kE−r(SnRn)kp/2≪√un kE0(Sn)k2+kSn−En(Sn)k2
+ max
k={n,n−un}kRkk2p+√ n kE−u
n(Sn)k2+kSn−En+u
n(Sn)k2
+ max
k={n,un}kE−r(Sk2)−E(Sk2)kp/2+√ nXn
k=1
X
|j|≥k+n
P0(Xj)
2 2
1/2
. (3.24) Let us show how, thanks to (3.24), the convergence (3.23) can be proven.
Let us first consider the case where 2 < p < 4. Notice that the following elementary claim is valid:
Claim 3.1. If F and G are two σ-algebras such that G ⊂ F, then for any random variableX inLq forq≥1,kX−E(X|F)kq ≤2kX−E(X|G)kq.
Starting from (3.24) withr=nmandun=n, and using Claim 3.1, we derive that
kE−nm(SnRn)kp/2≪ kE−nm(Sn2)−E(Sn2)kp/2
+√
n kE0(Sn)k2+kSn−En(Sn)k2
+kRnk2p+n X
|j|≥n
kP0(Xj)k2. This last inequality combined with condition (3.3) and Lemma 3.1 shows that (3.23) will be satisfied if we can prove that
X
n≥1
np/4
n2(logn)(t−1)p/2 kE0(Sn)k2+kSn−En(Sn)k2p/2
<∞, (3.25) and
X
n≥1
np/2 n2(logn)(t−1)p/2
X
|j|≥n
kP0(Xj)k2p/2
<∞. (3.26) To prove (3.25), we use the inequalities (3.21) withp= 2. Hence setting
aℓ=kE0(Xℓ)k2+kX−ℓ+1−E0(X−ℓ+1)k2, (3.27) and using H¨older’s inequality, we derive that for anyα <1,
X
n≥1
np/4
n2(logn)(t−1)p/2 kE0(Sn)k2+kSn−En(Sn)k2p/2
≪X
n≥1
np/4 n2(logn)(t−1)p/2
Xn
ℓ=1
aℓ
p/2
≪X
n≥1
np/4n(1−α)(p/2−1) n2(logn)(t−1)p/2
n
X
ℓ=1
ℓα(p/2−1)ap/2ℓ . Takingα∈](3p−8)/(2p−4),1[ (this is possible since p <4) and changing the order of summation, we infer that (3.25) holds provided that (3.2) does.
It remains to show that (3.26) is satisfied. Using Lemma 5.1 and the notation (3.27), we first observe that
X
n≥1
np/2 n2(logn)(t−1)p/2
X
|j|≥n
kP0(Xj)k2
p/2
≪X
n≥1
np/2 n2(logn)(t−1)p/2
X
ℓ≥[n/2]
ℓ−1/2aℓ
p/2
.
Therefore by H¨older’s inequality, it follows that for anyα <1, X
n≥1
np/2 n2(logn)(t−1)p/2
X
|j|≥n
kP0(Xj)k2
p/2
≪X
n≥1
np/2n(1−α)(p/2−1) n2(logn)(t−1)p/2
X
ℓ≥[n/2]
ℓα(p/2−1)ℓ−p/4ap/2ℓ .
Therefore taking α ∈]1,2[ and changing the order of summation, we infer that (3.25) holds provided that (3.2) does. This ends the proof of (3.23) whenp∈]2,4[.
Now, we prove (3.23) whenp= 4. With this aim we start from (3.24) withr=nmandun= [√n]. This inequality combined with condition (3.3), Lemma 3.1 and the arguments developed to prove (3.25) and (3.26) shows that (3.23) will be satisfied forp= 4 if we can prove that
X
n≥1
1
n(logn)2(t−1) kE
−[√
n](Sn)k2+kSn−En+[√
n](Sn)k22
<∞, (3.28)
and
X
n≥2
1 n2(logn)2(t−1)
E−nm(S[2√n])−E(S[2√n])
2
2<∞. (3.29) We start by proving (3.28). With this aim, using the notation (3.27), we first write that
kE−[√n](Sn)k2+kSn−En+[√n](Sn)k2≤
n+[√n]
X
k=[√n]+1
ak.
Therefore by Cauchy-Schwarz’s inequality
X
n≥1
1
n(logn)2(t−1) kE
−[√
n](Sn)k2+kSn−En+[√
n](Sn)k22
≪X
n≥1
logn n(logn)2(t−1)
n+[√ n]
X
k=[√ n]+1
ka2k
≪X
n≥1
1 n
n+[√ n]
X
k=[√n]+1
klogk (logk)2(t−1)a2k. Changing the order of summation, this proves that (3.28) holds provided that (3.5) does. It remains to prove (3.29). With this aim, we set for any positive realx,
h([x]) = E
−m[x](S[x]2 )−E(S2[x])
2 2, and we notice that, for any integern≥0,
E−nm(S[2√n])−E(S[2√n])
2
2≤h([√ n]).
In addition, ifx∈[n, n+ 1[, then [√ n] = [√
x] or [√ n] = [√
x]−1. Therefore X
n≥3
1
n2(logn)(t−1)p/2h([√
n])≪X
n≥3
h([√ n])
Z
[n,n+1[
1
x2(logx)(t−1)p/2dx
≪ Z ∞
3
1
x2(logx)(t−1)p/2h([√ x])dx+
Z ∞ 3
1
x2(logx)(t−1)p/2h([√
x]−1)dx
≪ Z ∞
2
1
y3(logy)(t−1)p/2h([y])dy≪X
n≥2
1
n3(logn)(t−1)p/2h(n)dy . For the last inequality, we have used that if y ∈ [n, n+ 1[, then [y] = n.
Therefore condition (3.3) implies (3.29). This ends the proof of (3.23) when p= 4.
It remains to prove (3.24). With this aim, we start with the decompo- sition ofRn given in Proposition 5.1 of the appendix withN =n. Therefore setting
An:=
n
X
k=1
X
j≥2n+1
Pk(Xj) +
n
X
k=1
X
j≥n
Pk(X−j), we write that
Rn=E0(Sn)−E0(Sn)◦Tn+E−n(Sn)◦Tn+Sn−En(Sn)
−(E2n(Sn−En(Sn))◦T−n−An. (3.30) Starting from (3.30) and noticing that
kE−r(Sn(E−n(Sn)◦Tn)kp/2≤ kE0(Sn(E−n(Sn)◦Tn)kp/2
≤ kE0(Sn)kpkE0(S2n−Sn)kp, and thatE−r(Sn(Sn−En(Sn)) =E−r((Sn−En(Sn))2), we first get
kE−r(SnRn)kp/2≤2kE0(Sn)k2p+kSn−En(Sn)k2p
+kE−r(SnEn(S2n−Sn))kp/2
+kE−r(SnEn(Sn◦T−n−E0(Sn◦T−n)))kp/2
+kE−r(SnAn)
p/2. (3.31)
Next, we use the following fact: if X and Y are two variables in Lp with p∈[2,4], then for any integeru,
kEu(XY)kp/2≤ kEu(X2)−E(X2)kp/2+kYk2p+p
E(X2)kYk2. (3.32) Indeed, it suffices to write that
kEu(XY)kp/2≤ kE1/2u (X2)E1/2u (Y2)kp/2
≤ k|Eu(X2)−E(X2)|1/2E1/2
u (Y2)kp/2+ (E(X2))1/2kE1/2
u (Y2)kp/2
≤ kEu(X2)−E(X2)kp/2+kYk2p+ (E(X2))1/2kE1/2u (Y2)kp/2,
and to notice that, since p∈ [2,4], kE1/2u (Y2)kp/2 ≤ kE1/2u (Y2)k2 =kYk2. Therefore, starting from (3.31) and using (3.32) together with E(Sn2)≪ n, we infer that
kE−r(SnRn)kp/2≪kE0(Sn)k2p+kSn−En(Sn)k2p
+kE−r(SnEn(S2n−Sn))kp/2
+kE−r(SnEn(Sn◦T−n−E0(Sn◦T−n)))kp/2
+kE−r(Sn2)−E(Sn2)
p/2+kAnk2p+n1/2kAnk2, and since kE0(Sn)kp ≤ kRnkp, kSn −En(Sn)kp ≤ 2kRnkp and kAnkp ≤ 8kRnkp, we have overall that
kE−r(SnRn)kp/2≪kRnk2p+kE−r(SnEn(S2n−Sn))kp/2
+kE−r(SnEn(Sn◦T−n−E0(Sn◦T−n)))kp/2
+kE−r(Sn2)−E(S2n)
p/2+n1/2kAnk2. (3.33) By orthogonality and by stationarity,
kAnk2≤Xn
k=1
X
j≥2n+1
Pk(Xj)
2 2
1/2
+Xn
k=1
X
j≥n
Pk(X−j)
2 2
1/2
≤Xn
k=1
X
ℓ≥k+n
P0(Xℓ)
2 2
1/2
+Xn
k=1
X
ℓ≥k+n
P0(X−ℓ)
2 2
1/2
. (3.34) Now for any integerun such thatun≤n,
kE−r(SnEn(S2n−Sn))kp/2≤kE−r((Sn−Sn−un)En(S2n−Sn))kp/2
+kE−r(Sn−unEn(S2n−Sn))kp/2
≪kE−r(Su2n)−E(S2un) p/2
+kE0(Sn)k2p+√unkE0(Sn)k2
+kE−r(Sn−unEn(S2n−Sn))kp/2, (3.35) where for the last inequality we have used (3.32) together withE(Su2n)≪un. Next, we write that
kE−r(Sn−unEn(S2n−Sn))kp/2
≤kE−r((Sn−un−En−u
n(Sn−un))En(S2n−Sn))kp/2
+kE−r(En−u
n(Sn−un)En(S2n−Sn))kp/2
≤kSn−un−En−un(Sn−un)kpkE0(Sn)kp +kE−r(En−u
n(Sn−un)En−u
n(S2n−Sn))kp/2
≤kSn−un−En−u
n(Sn−un)k2p+kE0(Sn)k2p
+kE−r(SnEn−u
n(S2n−Sn))kp/2
+kE−r((Sn−Sn−un)En−un(S2n−Sn))kp/2.