On the Koml\'os, Major and Tusn\'ady strong approximation for some classes of random iterates
Christophe Cuny (ERIM), J\'er\^ome Dedecker (MAP5), Florence, Merlev\`ede (LAMA)

TL;DR
This paper extends the Komlós, Major and Tusnádý strong approximation results to functions of random iterates within a Markovian framework, providing new dependent conditions for approximation with rate o(n^{1/p}).
Contribution
It adapts existing methods to Markovian settings, introducing natural coupling conditions that broaden applicability to various stochastic models.
Findings
Established strong approximation with rate o(n^{1/p}) for functions of random iterates.
Provided new dependent conditions based on L-infinity or L-1 coupling.
Demonstrated the optimality of the L-1 coupling condition.
Abstract
The famous results of Koml\'os, Major and Tusn\'ady (see [15] and [17]) state that it is possible to approximate almost surely the partial sums of size n of i.i.d. centered random variables in L p (p > 2) by a Wiener process with an error term of order o(n 1/p). Very recently, Berkes, Liu and Wu [3] extended this famous result to partial sums associated with functions of an i.i.d. sequence, provided a condition on a functional dependence measure in L p is satisfied. In this paper, we adapt the method of Berkes, Liu and Wu to partial sums of functions of random iterates. Taking advantage of the Markovian setting, we shall give new dependent conditions, expressed in terms of a natural coupling (in L or in L 1), under which the strong approximation result holds with rate o(n 1/p). As we shall see our conditions are well adapted to a large variety of models, including left random…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbability and Risk Models · Stochastic processes and financial applications · Financial Risk and Volatility Modeling
On the Komlós, Major and Tusnády strong approximation for some classes of random iterates
Christophe Cuny111Université de la Nouvelle-Calédonie, Equipe ERIM. Email: [email protected], Jérôme Dedecker222Université Paris Descartes, Sorbonne Paris Cité, Laboratoire MAP5 (UMR 8145). Email: [email protected] and Florence Merlevède333Université Paris-Est, LAMA (UMR 8050), UPEM, CNRS, UPEC. Email: [email protected]
Abstract
The famous results of Komlós, Major and Tusnády (see [15] and [17]) state that it is possible to approximate almost surely the partial sums of size of i.i.d. centered random variables in () by a Wiener process with an error term of order . Very recently, Berkes, Liu and Wu [3] extended this famous result to partial sums associated with functions of an i.i.d. sequence, provided a condition on a functional dependence measure in is satisfied. In this paper, we adapt the method of Berkes, Liu and Wu to partial sums of functions of random iterates. Taking advantage of the Markovian setting, we shall give new dependent conditions, expressed in terms of a natural coupling (in or in ), under which the strong approximation result holds with rate . As we shall see our conditions are well adapted to a large variety of models, including left random walks on , contracting iterated random functions, autoregressive Lipschitz processes, and some ergodic Markov chains. We also provide some examples showing that our -coupling condition is in some sense optimal.
1 Introduction
In this paper we shall adapt the approach of Berkes-Liu-Wu [3] to certain classes of Markov chains. To motivate this work, let us describe in detail the example of the left random walk on , (the group of invertible -dimensional real matrices).
Let be independent random matrices taking values in , with common distribution . Let be the euclidean norm on . We shall say that has a moment of order if
[TABLE]
where .
Let and for every , . Recall that if admits a moment of order then
[TABLE]
where is the so-called first Lyapunov exponent (see for instance [14]). For any , we want to describe as precisely as possible the asymptotic behavior of the quantity
[TABLE]
The left random walk of law started at is the Markov chain defined by and for . As usual, to handle the quantity (3), we consider the partial sums associated with the random variables given by
[TABLE]
where for every and every ,
[TABLE]
By definition of , and since , we easily see that, for any ,
[TABLE]
Hence, the asymptotic behavior of (3) can be deduced from the asymptotic behavior of partial sums of functions of the Markov chain .
This problem can be tackled under some assumptions on (strong irreducibility and proximality, see subsection 3.1 for more details) which implies that the chain admits an unique invariant measure defined on the projective space of . Under these assumptions on , and assuming moreover that has a moment of order , Cuny-Dedecker-Jan [7] proved the following strong approximation result: there exists such that, for every (fixed) , one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
If has a moment of order , the same authors showed that this strong approximation holds with a rate of order .
To prove (5), Cuny-Dedecker-Jan used a martingale approximation (as described for instance in Cuny-Merlevède [9]), together with some appropriate upper bounds on the quantities
[TABLE]
The main drawback of this approach is that it cannot give a better rate than , because it is based on the Skorokhod representation theorem for martingales.
On another hand, since the stationary Markov chain is a function of the starting point and of the “innovations” , one can also apply the approximation results by Berkes-Liu-Wu (in fact, this is not completely immediate because it does not fit exactly into the framework described by these authors, and some extra work is required there). Doing so, one can reach a rate of order for any , but only by assuming that has a moment of order . More precisely, their functional measure of dependence in , say , can be bounded by . Hence, applying Proposition 3 in [7], one can see that condition (2.3) in [3] is satisfied provided has at least a moment of order . This is somewhat surprising: on the one hand, one can go beyond the rate of order , and on the other hand we need stronger assumptions than in Cuny-Dedecker-Jan [7] to get the rate when .
This gave us a strong motivation to understand completely the proof by Berkes-Liu-Wu [3], and to see whether it is possible to take advantage of the Markovian setting to get the rate in (5) under a moment of order , for any . As we shall see in this paper, the answer is positive.
As already mentioned, in the case of the left random walk on , one can get a control on the quantities defined in (6). However, in many other cases of random iterates, such a control is not possible, while one can get some upper bounds on
[TABLE]
where is the invariant distribution of the chain .
Consequently, we shall establish two distinct results, with different range of applicability. In Theorem 1, we give a strong approximation result under conditions involving some quantities similar to (6). In Theorem 2 the conditions are expressed in terms of the quantities (7). The second Theorem applies to a large variety of examples, including some well known examples of irreducible and aperiodic Markov Chains with countable or continuous state space. These examples of ergodic Markov chains will allow us to prove that the conditions given in Theorem 2 are in some sense optimal.
In all the paper, we shall use the notation , which means that there exists a positive constant not depending on such that , for all positive integers .
2 Main results
Let be a probability space, and let be iid random variables defined on , with values in a measurable space and with common distribution . Let be a random variable defined on with values in a measurable space , independent of , and let be a measurable function from to . For any , define
[TABLE]
and assume that has a stationary distribution . Let now be a measurable function from to and define, for any ,
[TABLE]
Then forms a stationary sequence with stationary distribution, say . Let be the non-decreasing filtration defined as follows: for any , , and for any , . It follows that for any , is -measurable.
Our first result proves that the strong approximation result holds with rate when the stationary distribution has a moment of order and we impose that the sequence of coupling coefficients defined in (10) decreases arithmetically to zero plus the condition (12). As we shall see in Section 3, these conditions are satisfied for instance for the left random walk on .
Let and be random variables with law , and such that is independent of . For any , let
[TABLE]
Define then
[TABLE]
where, above and in all the rest of the paper, the infinite norm is the usual essential supremum norm.
Theorem 1
Let be the stationary sequence defined by (8) and assume that its stationary distribution has moment of order . Assume in addition that there exists a positive constant such that for any ,
[TABLE]
where is defined in (10), and that
[TABLE]
Let . Then n^{-1}\mathbb{E}\big{(}(S_{n}-n\mathbb{E}(X_{1}))^{2}\big{)}\rightarrow\sigma^{2} as and one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
In the rest of this section, we shall give conditions expressed in terms of the quantities for the strong approximation (13) to hold. Before stating the result, we need to introduce some notations:
For any , let us define the sequence as follows
[TABLE]
These quantities are finite if has a moment of order .
For any , denote by
[TABLE]
and, for any , let
[TABLE]
Denote also by the quantile function associated with where is a random variable with law : it is then the generalized inverse of the tail function . Let be the function from to defined by . We shall assume the following condition
[TABLE]
Theorem 2
Let be a stationary sequence defined by (8) and assume that its stationary distribution has a moment of order . Assume in addition that condition (14) holds. Let . Then n^{-1}\mathbb{E}\big{(}(S_{n}-n\mathbb{E}(X_{1}))^{2}\big{)}\rightarrow\sigma^{2} as and one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
Remark 3
If we define
[TABLE]
then condition (14) can be rewritten as
[TABLE]
which also reads as
[TABLE]
Remark 4
Sufficient conditions for (14) to hold in terms of moments (or weak moments) of can be given by using Lemma 2 in Dedecker and Doukhan [10]. For instance, if
[TABLE]
then condition (14) is satisfied. Note that in the case where , condition (14) is equivalent to .
If we define the following meeting time
[TABLE]
it follows that, for any ,
[TABLE]
Therefore the following corollary holds.
Corollary 5
Let be the stationary sequence defined by (8) and assume that its stationary distribution has a moment of order . Assume in addition that
[TABLE]
Then the conclusions of Theorem 2 hold.
According to the computations given in Annex C of Rio [23], if
[TABLE]
then condition (20) is satisfied. In the case where , condition (20) is equivalent to
[TABLE]
Propositions 15 and 18 in Section 3.3 will show that condition (22) is optimal in some sense.
3 Applications
3.1 Left random
walk on
As in the introduction, let be independent random matrices taking values in , , with common distribution . let and for every , .
Let be the euclidean norm on . Recall that has a moment of order if (1) holds. Recall also that if admits a moment of order then (2) holds, and the quantity is well defined.
Let be the projective space of and write as the projection of to . We assume that is strongly irreducible (i.e. that no proper finite union of subspaces of are invariant by , the closed semi-group generated by the support of ) and proximal (i.e. that there exists a matrix in admitting a unique (with multiplicity one) eigenvalue with maximum modulus). Under those assumptions (see e.g. Bougerol-Lacroix [4] or Benoist-Quint [2]) it is well-known that there exists a unique invariant measure on , meaning that for any continuous and bounded function from to ,
[TABLE]
The left random walk of law is the process defined by and for where we assume that is independent of . As explained in the introduction, our aim is to study the partial sums associated with the random sequence given by
[TABLE]
where for every and every ,
[TABLE]
As usual, we shall denote by the random variable for which . We then define and recall that the identity (4) holds: for any ,
[TABLE]
Applying Theorem 1, the following strong approximation with rate holds.
Corollary 6
Let be a proximal and strongly irreducible probability measure on . Assume that has a moment of order . Then n^{-1}\mathbb{E}_{\nu}\big{(}(S_{n}-n\lambda_{\mu})^{2}\big{)}\rightarrow\sigma^{2} as and for every (fixed) , one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
Remark 7
It follows from item of Theorem 4.11 of Benoist-Quint [2] that if is strongly irreducible and the image of in is unbounded.
Proof of Corollary 6. Using the same arguments as in Cuny-Dedecker-Jan [7] (see the proof of their Theorem 1), we infer that it suffices to prove the result on stationary regime. More precisely, it suffices to prove that one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
Note also that the fact that n^{-1}\mathbb{E}_{\nu}\big{(}(S_{n}-n\lambda_{\mu})^{2}\big{)}\rightarrow\sigma^{2} as comes from Theorem 2 (ii) in [7]. Now the strong invariance principle (23) is a direct application of Theorem 1. To see this, note first that the following estimate is valid (see Proposition 3 in [7]):
[TABLE]
Since \big{(}\sup_{{\bar{x}},{\bar{y}}\in X}\mathbb{E}\big{(}\big{|}X_{k,{{\bar{x}}}}-X_{k,{{\bar{y}}}}\big{|}\big{)}_{k\geq 1} is non increasing, \sup_{{\bar{x}},{\bar{y}}\in X}\mathbb{E}\big{(}\big{|}X_{k,{{\bar{x}}}}-X_{k,{{\bar{y}}}}\big{|}\big{)}\ll k^{-(p-1)}. Hence condition (11) holds with . To end the proof it suffices to notice that condition (12) also holds since, for any ,
[TABLE]
3.2 Contracting iterated random functions
3.2.1 Uniform contraction
Assume that there is a distance on , and that there exist and such that, for any ,
[TABLE]
where is defined in (9). Note that condition (24) holds if the chain is “one step contracting” in the following sense
[TABLE]
Let us now define a class of observables from to for which one can easily compute the coefficient . Let be a measurable function from to such that , and let be a concave non-decreasing function from to such that .
One says that belongs to the class if,
[TABLE]
Lemma 8
Assume that the stationary Markov chain satisfies the contraction condition (24), and let be defined by (8) for some . Then, there exists a constant such that, for any ,
[TABLE]
Proof. Let . Since belongs to , and since is concave,
[TABLE]
Hence, since is non-decreasing and satisfies (24),
[TABLE]
Applying Theorem 1, the following result holds:
Corollary 9
Assume that the stationary Markov chain satisfies the contraction condition (24), and let be defined by (8) for some . Assume moreover that for some , and that there exists such that and . If for some , then the conclusion of Theorem 1 holds.
Remark 10
Note that Corollary 9 applies to a large class of continuous observales (as functions of ), including all Hölder observables (case where for some ). More precisely it applies to any concave non-decreasing function such that in a neighborhood of [math], for some .
Proof of Corollary 9. Applying Lemma 8, we infer that for some . Hence, if one can prove that
[TABLE]
for some finite constant , the result will follow directly from Theorem 1. To prove (25), we note that
[TABLE]
For the first term on the right-hand side of (26), we use the fact that , which gives
[TABLE]
Under the assumptions of Corollary 9, it follows from (26) and (27) that the upper bound (25) holds.
3.2.2 -contraction
Assume that there is a distance on , and that there exist and such that, for any ,
[TABLE]
where is defined in (9). Note that condition (28) holds if the chain is “one step contracting” in the following sense:
[TABLE]
and
[TABLE]
Note also that, under the two conditions above, there exists an unique stationary distribution (see Theorem 2 of [25]).
Let us now define a class of observables from to for which one can easily compute the coefficients . Let be a concave non-decreasing function from to such that .
One says that belongs to the class if,
[TABLE]
Lemma 11
Assume that the stationary Markov chain satisfies the contraction condition (28), and let be defined by (8) for some . Then, for ,
[TABLE]
Proof. Let . Since belongs to , and since is concave,
[TABLE]
Hence, since is non-decreasing and satisfies (28),
[TABLE]
The result follows from the definition of and the fact that is non-decreasing.
Recall that the function and related to the tail function have been defined in Section 2. Combining Theorem 2 and Lemma 11, the following result holds:
Corollary 12
Assume that the stationary Markov chain satisfies the contraction condition (28), and let be defined by (8) for some . Assume moreover that
[TABLE]
Then the conclusion of Theorem 2 holds.
Remark 13
From Remark 4, it follows that (29) holds as soon as
[TABLE]
The condition (30) is equivalent to the following integral condition on the function
[TABLE]
3.3 Ergodic Markov chains
3.3.1 A discrete ergodic Markov chain example
Let be a sequence of iid real-valued random variables distributed as with
[TABLE]
Let be a random variable with values in independent of , and define for any ,
[TABLE]
Hence is a Markov chain with state space , initial distribution and transition probabilities satisfying
[TABLE]
Assume that and along . Then the chain is irreducible and aperiodic. Moreover, the stationary distribution exists if and only if and is given by
[TABLE]
Corollary 14
Let and be a function from to such that with . Assume that
[TABLE]
*Then condition (21) is satisfied and the conclusions of Theorem 2 hold for where is the Markov chain defined by (31) with . *
For bounded observables (case ), condition (32) reads as . As we shall see in the proof of the next proposition (see (39)), is equivalent to , where is the meeting time defined in (19). The next proposition shows that this latter condition is in some sense optimal.
Proposition 15
Let and be the Markov chain described above with , , where . Then
[TABLE]
Moreover, for any stationary and Gaussian centered sequence with convergent series of covariances,
[TABLE]
Proof of Corollary 14. Define
[TABLE]
By definition, . Hence for any ,
[TABLE]
Next, it is easy to see that for any ,
[TABLE]
with
[TABLE]
where is the Markov chain defined as follows: Let be an independent copy of and independent of . Let be independent of and, for any , set
[TABLE]
According to Lindvall [16], if where and is a non-decreasing function from to such that is non-increasing and converges to [math], then . Note now that
[TABLE]
Hence under (32), with . It follows that which in turn implies that by taking into account (35) and (36). Therefore condition (21) is satisfied and Corollary 5 applies.
Proof of Proposition 15. Note first that the following coupling inequality holds: for any ,
[TABLE]
where denotes the total variation norm of a signed measure and is the transition function of the Markov chain . But for any , where is the sequence of strong mixing coefficients of the chain which starts from the stationary distribution. As quoted in Chapter 30 of Bradley [6],
[TABLE]
It follows that for any ,
[TABLE]
which together with the arguments developed in the proof of Corollary 14 show that
[TABLE]
This proves the first part of (33). To prove its second part, it suffices to use again the arguments developed in the proof of Corollary 14 and to notice that, for , , the upper bound (37) entails that with where . This ends the proof of (33).
To prove the second part of the proposition, we shall use similar arguments as those developed in the proof of Theorem 2.2 in Dedecker-Merlevède-Rio [11] and adopt the following notations: the regeneration times of the Markov chain are defined by induction as follows: and . Let for . Note that are iid and that their common law is the law of when the chain starts at zero. Note that
[TABLE]
Since the regeneration times are independent, by the converse Borel-Cantelli lemma, it follows that
[TABLE]
Now we take
[TABLE]
is obviously a bounded function and . Note that, for any ,
[TABLE]
Since converges to almost surely, it follows that, for some positive constant depending on ,
[TABLE]
Consider now a stationary and Gaussian centered sequence with convergent series of covariances. If follows from both the Borel-Cantelli lemma and the usual tail inequality for Gaussian random variables that, for any positive ,
[TABLE]
Taking in the above inequality and using (40), we then infer that
[TABLE]
which implies (34).
3.3.2 An example of ergodic Markov chain with continuous state space
In this section, we consider an homogenous Markov chain with state space and transition probability kernel given by
[TABLE]
where denotes the Dirac measure at point and
[TABLE]
Note that the chain is irreducible and aperiodic and admits a unique invariant probability measure given by
[TABLE]
As in Section 9.3 in Rio [23], we now construct a stationary Markov chain with initial law and transition probability measure . Let be a random variable with law . We assume that the underlying probability space is rich enough to contain a sequence of independent random variables with uniform law over , and that this random sequence is independent of . The stationary Markov chain is then constructed via the following recursive equation: and, for any ,
[TABLE]
where is the inverse of the cumulative function of . It is easy to see that is a Markov chain with initial distribution and transition probability kernel given by (41).
Corollary 16
Let and be the stationary Markov chain defined by (42) with . Then condition (22) is satisfied and the conclusions of Theorem 2 hold for , for any bounded function defined on .
The proof of this corollary is a direct application of Corollary 5 by taking into account the following lemma whose proof is postponed to the Appendix (see Section 5.2).
Lemma 17
For any there exist positive constants and depending only on such that for any ,
[TABLE]
where is the meeting time defined in (19).
In addition, this lemma together with Theorem 2.2 in Dedecker-Merlevède-Rio [11] proves the sharpness of condition (22) also in case of Markov chains with continuous state space. This is summarized in the next proposition.
Proposition 18
Let and be the stationary Markov chain defined by (42) with . Then condition (22) fails. In addition, for any map from to with continuous and strictly positive derivative on , and any stationary and Gaussian centered sequence with convergent series of covariances,
[TABLE]
3.4 Lipschitz autoregressive models
We consider the autoregressive Lipschitz model as in Dedecker-Rio [13]. Let , and a -Lipschitz function such that
[TABLE]
Let be iid real-valued random valued with common law and define for any
[TABLE]
Let for any measurable function .
The model above corresponds to the previously considered situation with and given by , for every .
Let and assume that admits a moment of order . It follows from Dedecker-Rio [13] that there exists a unique invariant probability on , such that
[TABLE]
The following strong approximation with rates holds.
Corollary 19
Let and assume that admits a moment of order for some . Let be defined by (45) with . Then, for any Lipschitz function such that , as and one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
Proof. The result comes from an application of Theorem 2 by taking into account Remark 4. As already mentionned, admits a moment of order . Hence, one can prove that condition (18) holds with , by using the last statement of the following lemma (taking ).
Lemma 20
Let and . Assume that . Then
[TABLE]
In particular, for any Lipschitz function , if then .
The proof of the lemma above is postponed to the Appendix (see Section 5.3).
4 Proofs of Theorems 1 and 2
The proofs of Theorems 1 and 2 follow the scheme of proof of Theorem 2.1 in Berkes-Liu-Wu [3] by applying the following general Proposition 21, which comes from a careful analysis of the proof of their strong approximation result. To state this general proposition several preliminary notations are needed.
A Preliminary result. For Proposition 21 below, we consider a strictly stationary sequence of real-valued random variables in () and a sequence of iid random variables. Let be a sequence of positive real numbers and define
[TABLE]
Then, define
[TABLE]
Let now be a non-decreasing sequence of positive integers such that , as , and define
[TABLE]
Finally set and define
[TABLE]
The general proposition coming from a careful analysis of the proof of Theorem 2.1 in Berkes-Liu- Wu [3] reads as follows
Proposition 21** (Berkes-Liu-Wu [3])**
Let . Assume that we can find a sequence of positive real numbers a non-decreasing sequence of positive integers such that , as , in such a way that the following conditions are satisfied:
[TABLE]
there exists such that
[TABLE]
and there exists such that
[TABLE]
Assume in addition that
[TABLE]
*and *
[TABLE]
Then, one can redefine without changing its distribution on a (richer) probability space on which there exist iid random variables with common distribution , such that,
[TABLE]
Note that (54) implies that converges to (which is therefore non-negative). Let us now briefly explain how the proposition follows from the work of Berkes-Liu-Wu [3].
Condition (51) together with condition (52) prove that it is enough to show (56) with
[TABLE]
instead of , where, for , (so that is the unique integer such that ). Next, condition (53) allows first to show that the proof of the proposition is reduced to prove (56) with replacing where
[TABLE]
with if and for ,
[TABLE]
A careful analysis of the steps 3.2 and 3.3 of the proof of Theorem 2.1 in Berkes-Liu-Wu [3] reveals that condition (53) is also sufficient to apply Theorem 1 in Sakhanenko [24] (at different steps of their proof) and this leads to the following strong approximation result: one can redefine without changing its distribution on a (richer) probability space on which there exists a standard Brownian motion such that,
[TABLE]
where
[TABLE]
The last step 3.4 of their proof then consists in showing that one can construct another standard Brownian motion (depending on ) such that
[TABLE]
This step is achieved provided that we can prove that , , as , and condition (55) holds.
Some preliminary considerations. The following considerations allowing to extend the stationary sequence defined by (8) to a stationary sequence on will be useful.
For any , let . Hence is a functional of the Markov chain with state space and stationary distribution . The Markov chain being stationary, by Kolmogorov’s theorem, there exists a probability on the measurable space invariant by the shift on and such that the law of the coordinate process (with values in ) under is the same as the one of under . Hence, if we define for any integer , , it follows that forms a stationary sequence with stationary distribution , whose law under is the same as the one of under . To prove the theorem, it suffices then to prove that it holds for the extended sequence which is a stationary sequence adapted to the stationary filtration where To avoid additional notations, in the rest of the proof we write for , for and for .
4.1 Proof of Theorem 1
By the reverse martingale convergence theorem and stationarity, is decreasing to , as . Hence, by condition (11), a.s. Applying Lemma 22 of the Appendix and taking into account condition (11), we get (since ),
[TABLE]
This proves that the series converge absolutely and condition (54) of Proposition 21 holds.
Assume first that . To prove that a.s., we shall use Theorem 4.7 in Cuny-Merlevède [8]. Hence, it suffices to prove that
[TABLE]
With this aim, we start by noticing that by condition (11),
[TABLE]
Theorem 2.3 in [8] then asserts that there exists a stationary sequence of martingale differences in , adapted to and such that , as . Together with the fact that , it follows that a.s, for any . Therefore, the upper bound (4) in [8] and condition (11) entail that
[TABLE]
which proves (57) since . The theorem is then proved in the case where .
Assume from now that . We choose
[TABLE]
Note that the sequence satisfies , as . We prove below that conditions (51), (52), (53) and (55) of Proposition 21 are satisfied with the above choices of and .
Since the ’s are in , it is easy to see that with the choice of , condition (51) is satisfied (it suffices to write that and to use Fubini’s Theorem). Next, for , Lemma 24 of the Appendix combined with condition (11) implies that
[TABLE]
Therefore,
[TABLE]
since . Condition (52) is then satisfied with . We prove now that we can find a real number such that (53) holds. Let ,
[TABLE]
and
[TABLE]
With these notations, we have
[TABLE]
By Rosenthal’s inequality for martingales,
[TABLE]
Note that
[TABLE]
where . Here, recall the following well known fact: if is an integrable random variable, and and are two -algebras such that is independent of , then
[TABLE]
Applying (59) with , and , we get
[TABLE]
Hence, by assumption (12),
[TABLE]
On another hand, by stationarity,
[TABLE]
So, overall,
[TABLE]
We handle now the second term in the right-hand side of (58). We apply Proposition 23 of the Appendix with , where is the unique positive integer such that ,
[TABLE]
and
[TABLE]
We then get
[TABLE]
where . By fact (59), we note that, for any ,
[TABLE]
Therefore, by condition (12),
[TABLE]
Next, since for and the ’s are centered , for any ,
[TABLE]
Moreover, for any and any ,
[TABLE]
But, for any , any and any ,
[TABLE]
Hence, if ,
[TABLE]
and if , by using (59),
[TABLE]
But, by using stationarity, the Markov property and the fact that is 1-Lipschitz,
[TABLE]
Hence, for any , any and any ,
[TABLE]
Since , the above considerations imply that
[TABLE]
Combined with (61) and (62), the upper bound above implies that
[TABLE]
Hence, starting from (58) and taking into account (60) and (64), we get that for any ,
[TABLE]
This implies that (53) holds with r>\max\big{\{}2,\varepsilon^{-1}\big{(}p-2(1-\varepsilon)\big{)}\big{\}}.
To end the proof it remains to prove condition (55). Note first that since is assumed to be strictly positive, we have
[TABLE]
and therefore condition (55) reads as
[TABLE]
To verify condition (65), let us define, for ,
[TABLE]
Using stationarity, we have
[TABLE]
Therefore
[TABLE]
We first prove that
[TABLE]
With this aim we use the arguments developed in [3] to get their inequality (3.56). Hence, we start by noting that since is -Lipschitz, \big{(}\|\mathbb{E}(\varphi_{k}(X_{n})|{\mathcal{F}}_{0})-\mathbb{E}(\varphi_{k}(X_{n})\|_{2})\big{)}_{n\geq 0} is a decreasing sequence such that . Hence, by the same arguments as those developed in the first lines of the proof of Theorem 1, we infer that, under condition (11), there exists a constant not depending on such that . Therefore, . On another hand, the following convergence clearly holds: . In addition, for all ,
[TABLE]
The above considerations imply
[TABLE]
To take care of , we apply Proposition 23 of the Appendix with, this time, , where is the unique positive integer such that ,
[TABLE]
and
[TABLE]
Hence
[TABLE]
where . Lemma 24 of the Appendix combined with condition (11) implies that
[TABLE]
Next, since for , for any ,
[TABLE]
Moreover, by (63), we infer that for any , any and any ,
[TABLE]
On another hand, Lemma 24 of the Appendix combined with condition (11) implies that
[TABLE]
Hence, for any , any and any , we also have
[TABLE]
The considerations above imply that, for any , any and any ,
[TABLE]
Hence, since ,
[TABLE]
Starting from (69) and considering the upper bounds (70) and (71), we get
[TABLE]
Hence starting from (68) and taking into account (72) together with the fact that , the upper bound (67) follows.
Let now and note that (see Relation (3.54) in [3], where the same truncation level is used)
[TABLE]
Let
[TABLE]
Since , it follows that
[TABLE]
But
[TABLE]
Set and note that, by the reverse martingale convergence theorem and condition (11), a.s. and a.s. Hence, applying Lemma 22 of the Appendix and taking into account condition (11), we get
[TABLE]
where . But, by Lemma 22 of the Appendix,
[TABLE]
Note now that, since ,
[TABLE]
So, overall,
[TABLE]
Next, we note that
[TABLE]
and that, for , by condition (11),
[TABLE]
Hence, since , we infer that
[TABLE]
We handle now the series
[TABLE]
Applying again Lemma 22 of the Appendix, we first write that
[TABLE]
By condition (11) and since ,
[TABLE]
So, taking into account (75) and the fact that ,
[TABLE]
Considering the upper bounds (73), (76) and (77), we then derive
[TABLE]
which combined with (67) gives
[TABLE]
Let us verify that (65) holds, namely:
[TABLE]
The choice of implies that and (since ). Moreover, when , we clearly have and . It is also clear that . Next, since ,
[TABLE]
proving (since ) that . Also, since ,
[TABLE]
which proves that . Next, we note that
[TABLE]
since .
Now, if then (since ). Hence since , we get that . Finally, using again that and that , we derive that . This ends the proof of (65) and then of the theorem.
4.2 Proof of Theorem 2
By Remark 3, we know that condition (14) is equivalent to (17), namely:
[TABLE]
where, for any , and .
Notice first that, by Proposition 1 in Dedecker-Doukhan [10],
[TABLE]
by condition (17). Hence the series converge absolutely and condition (54) of Proposition 21 holds.
Assume first that . To prove the theorem, we shall verify that the other conditions of Proposition 21 are satisfied and with this aim we need to define suitable sequences and . Since we have , it follows that . Hence since otherwise we would have a.s. and then a.s. for all , contradicting the fact that . Let (hence ) and define
[TABLE]
Obviously since which implies that and . Next, for any , let
[TABLE]
and for . Since , it follows that and therefore since is non-increasing and , , for . Let now, for any ,
[TABLE]
and for any . Since is assumed to be strictly less than (since ), (indeed ). In addition, since is right continuous and non-increasing, . Hence, for all , implying that
[TABLE]
Therefore, for any , since ,
[TABLE]
which proves that , as .
To prove now that the conditions (51), (52), (53) and (55) of Proposition 21 are satisfied, we first notice the following useful facts:
[TABLE]
Let us start by proving that condition (51) holds. By using (79), we get
[TABLE]
But
[TABLE]
by condition (17) (which is equivalent to condition (14)). Hence condition (51) is satisfied. Next we note that by Lemma 24 of the Appendix,
[TABLE]
Therefore, by using (80),
[TABLE]
Hence, condition (52) is satisfied with . We prove now that we can find a real number such that (53) holds. With this aim we start by noticing that, for any , by Lemma 24 of the Appendix,
[TABLE]
Hence, since , for any ,
[TABLE]
which is finite by taking into account (81). Hence to prove that condition (53) holds, it suffices to prove that we can find a real number such that
[TABLE]
To prove (82), we apply the Rosenthal inequality for -dependent sequences as given in Corollary 1 in Dedecker-Prieur [12]. Let us first recall the definition of the -dependence coefficients: for any random variable with values in and any -algebra ,
[TABLE]
where, for any integer , is the set of -Lipschitz function from to with respect to the norm . Taking , the coefficients of the sequence are then defined by: for any ,
[TABLE]
In the stationary case, Corollary 1 in Dedecker-Prieur [12] implies that, for any ,
[TABLE]
where is the generalized inverse of the function defined by .
To compare the coefficients with the coefficients , we consider an independent copy of and define and for any . Note that for any , by using the relation (97) of the Appendix, we have
[TABLE]
Define now, for any ,
[TABLE]
Clearly for any , is distributed as and is independent of . Hence, by stationarity and Lemma 3 in Dedecker-Prieur [12],
[TABLE]
where the second inequality comes from the fact that and is -Lipschitz. Therefore, since is non-increasing, for any ,
[TABLE]
Moreover, for any , we obviously get that . It follows that for any ,
[TABLE]
Therefore, since both and are non-increasing,
[TABLE]
In addition, since is -Lipschitz and such that ,
[TABLE]
since is non-decreasing. Therefore, using additionally the fact that , we get
[TABLE]
and then, since ,
[TABLE]
Recall now that , therefore since is non-increasing,
[TABLE]
Using also the fact that , we get
[TABLE]
Using the fact that and (80), we get that, for any ,
[TABLE]
On another hand, for any ,
[TABLE]
by condition (17) (which is equivalent to condition (14)). Finally using again that , we derive that, for any ,
[TABLE]
since condition (17) obviously implies that . So, overall, (82) holds provided we select .
To end the proof it remains to show that condition (55) holds. With this aim, we start by recalling the equation (66), namely:
[TABLE]
where, for ,
[TABLE]
But, by using Lemma 24 of the Appendix, we have, for any ,
[TABLE]
Hence, since ,
[TABLE]
by condition (17) (which is equivalent to condition (14)). Taking into account (86) together with the fact that , we get
[TABLE]
Next, by using Proposition 1 in Dedecker-Doukhan [10], we derive
[TABLE]
But, since , note that
[TABLE]
Hence
[TABLE]
by condition (17). On another hand, by using inequality (1.11a) in [23] and (79), we derive that, for any ,
[TABLE]
Hence, by taking into account (88),
[TABLE]
So, by the computations in (89),
[TABLE]
Hence, starting from (87) and taking into account (89) and (90), it follows that
[TABLE]
implying, since , that
[TABLE]
This proves that (65) holds and then that (55) is satisfied since . The proof is complete for the case .
Assume now that . Let be a positive real number. According to inequality (5.42) in Merlevède-Rio [21], for any positive integer , any real number , and any positive integer and such that , we have
[TABLE]
Choose now , and . Since is right continuous, we have , hence . Note also that
[TABLE]
In addition,
[TABLE]
Since , it follows that
[TABLE]
Starting from (91) and taking into account the considerations above, we get that, for any ,
[TABLE]
Hence, for any , selecting , we derive
[TABLE]
The second series in the right-hand side is finite under condition condition (17) (which is equivalent to condition (14)). Hence, if we can prove that
[TABLE]
then we will get that, for any ,
[TABLE]
which will imply a.s. and therefore the proof of the theorem will be complete. In the case where , (93) is almost immediate. To see this, we first note that condition (17) implies . Indeed, by Proposition 1 in Dedecker-Doukhan [10],
[TABLE]
which is finite under condition (17). Therefore, by Lemma 1 in Bradley [5], is bounded which obviously entails (93). To handle the case where , we first note that, by inequality (4.84) in [19],
[TABLE]
But, . Hence
[TABLE]
Hence condition (14) entails
[TABLE]
which implies (since ) that
[TABLE]
We use now the same arguments as developed at the beginning of the proof of Theorem 1. The fact that the series in (94) converge implies that there exists a stationary sequence of martingale differences in , adapted to and such that
[TABLE]
Together with the fact that , it follows that a.s, for any . Hence, using the upper bound (4) in Cuny-Merlevède [8] (see also Proposition 1 in [18]), it follows that, for any ,
[TABLE]
Therefore, for any ,
[TABLE]
which is finite since . This ends the proof of the theorem.
5 Appendix
5.1 Some technical results
In this section, we collect some technical results that are useful for the proofs of Theorems 1 and 2.
Lemma 22
Let be a stationary sequence of real-valued random variables adapted to an increasing and stationary filtration . Let and be two functions in such that a.s. and a.s. Then, for any positive integer ,
[TABLE]
and
[TABLE]
where .
Proof. Since a.s. and a.s., we first write
[TABLE]
Hence, by orthogonality, for any ,
[TABLE]
and then, by Cauchy-Schwarz’s inequality and stationarity,
[TABLE]
But, for any , by Cauchy-Schwarz’s inequality,
[TABLE]
giving
[TABLE]
Since is non-increasing, we get that for any ,
[TABLE]
which combined with (95) gives the first inequality of the lemma. To prove the second one, it suffices to write that \sum_{i=0}^{L}\|P_{0}(g(Y_{i}))\|_{2}=\sum_{i=0}^{L}(i+1)^{-1}\|P_{0}(g(Y_{i}))\|_{2}\big{(}\sum_{k=1}^{i+1}1\big{)} and to use Cauchy-Schwarz’s inequality as in (96).
The following proposition is a non stationary version of the Peligrad-Utev-Wu [22] inequality. As in [22], the proof can be done by induction (a complete proof appears in Section 3.2.1 of [20]).
Proposition 23
Let and be a sequence of real-valued random variables in and adapted to a non-decreasing filtration . Then, for any ,
[TABLE]
where , if , and is the unique positive integer such that .
Lemma 24
For any , for any and any ,
[TABLE]
where and are defined in (48) and (49) respectively.
Proof. Let be an independent copy of and define , . For , let be the function from to defined in an iterative way as follows
[TABLE]
Note that for any integer such that ,
[TABLE]
Hence, for any ,
[TABLE]
On another hand, for any ,
[TABLE]
Hence, for any ,
[TABLE]
where the second inequality comes from the fact that is -Lipschitz. By stationarity, it follows that
[TABLE]
Hence, if we define by
[TABLE]
with independent of and such that , we get that for any ,
[TABLE]
But,
[TABLE]
which combined with (98) gives the lemma.
5.2 Proof of Lemma 17
The first inequality in (43) comes from the coupling inequality (38) and the fact that (see Theorem 9.4 in Rio [23]). We prove now the second inequality in (43).
Let be the chain starting at . Note first that for any any ,
[TABLE]
But
[TABLE]
For , define , , and note that
[TABLE]
So, overall, setting ,
[TABLE]
Using the fact that for any ,
[TABLE]
we get that
[TABLE]
By easy computations (that are left to the reader), we infer that Lemma 17 will hold provided one can prove that:
Lemma 25
For any , there exists a positive constant depending only on such that for any ,
[TABLE]
Obviously, inequality (101) holds for any positive integer . It is then enough to prove it for . Let us do it by recurrence. Hence we assume that for any , and we want to prove it at step . With this aim, we argue as above and infer that
[TABLE]
Hence,
[TABLE]
Using the recurrence assumption, it follows that
[TABLE]
Then, taking into account (99), we infer that
[TABLE]
So, overall, since , we get
[TABLE]
where
[TABLE]
So choosing large enough so that (which is always possible since ), inequality (101) is proved at step which ends the recurrence.
5.3 Proof of Lemma 20
We start by recalling the inequality line 5 page 27 of Dedecker-Rio [13], which holds for every , every and any :
[TABLE]
where , for every , and , for every .
Denote and let . Notice that is non-decreasing and bounded by . Hence, for any , using that , we get
[TABLE]
By Theorems 3 and 4 in Baum and Katz [1], since has a moment of order ,
[TABLE]
provided that . Since , the latter holds as soon as . Hence, we choose . On another hand,
[TABLE]
Finally,
[TABLE]
where is a constant depending on , and . Starting from (102) and taking into account (103), (104) and (105) together with the fact that, by (46), has a moment of order and that , we get the first part of the lemma.
To prove the last statement, it suffices to notice that for any Lipschitz function with Lipschitz coefficient equal to , we have, for any ,
[TABLE]
Next simple arguments entail that, for any ,
[TABLE]
Acknowledgement. The second author is very thankful to the laboratories MAP5 and LAMA for their invitations that made possible the present collaboration.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Baum, L. and Katz, M. Convergence rates in the law of large numbers. Bull. Amer. Math. Soc. 69 (1963), 771-772.
- 2[2] Y. Benoist and J.-F. Quint, Central limit theorem for linear groups , Ann. Probab. 44 (2016), no. 2, 1308-1340.
- 3[3] Berkes, I., Liu, W. and Wu, W. B. Komlós-Major-Tusnády approximation under dependence. Ann. Probab. 42 (2014), no. 2, 794-817.
- 4[4] P. Bougerol and J. Lacroix, Products of random matrices with applications to Schrödinger operators. Progress in Probability and Statistics, 8. Birkhäuser Boston, Inc., Boston, MA, 1985
- 5[5] Bradley, R. C. On quantiles and the central limit question for strongly mixing sequences. J. Theor. Probab. 10 (1997), 507-555.
- 6[6] Bradley, R. C. Introduction to strong mixing conditions . Vol. 1,2,3. Kendrick Press, Heber City, UT, 2007.
- 7[7] Cuny, C., Dedecker, J. and Jan, C. Limit theorems for the left random walk on G L d ( ℝ ) 𝐺 subscript 𝐿 𝑑 ℝ GL_{d}({\mathbb{R}}) . (2017). hal-01283929 . To appear in Ann. Inst. H. Poincaré Probab. Statist.
- 8[8] Cuny, C. and Merlevède, F. On martingale approximations and the quenched weak invariance principle. Ann. Probab. 42 (2014), no. 2, 760-793.
