Criteria for Borel-Cantelli lemmas with applications to Markov chains and dynamical systems
J\'er\^ome Dedecker (MAP5 - UMR 8145), Florence Merlev\`ede (LAMA),, Emmanuel Rio (UVSQ)

TL;DR
This paper establishes criteria for the Borel-Cantelli lemmas in the context of stationary sequences, Markov chains, and dynamical systems, highlighting conditions for almost sure occurrence of events based on dependence and mixing properties.
Contribution
It provides new conditions under which Borel-Cantelli properties hold for dependent sequences, including Markov chains and dynamical systems, with specific focus on mixing rates and dependence structures.
Findings
Borel-Cantelli property holds if μ(lim sup A_n) > 0 for absolutely regular sequences.
Nested A_k sets require a convergence rate of mixing coefficients.
Results extend to weaker dependence notions, applicable to non-irreducible Markov chains and dynamical systems.
Abstract
Let (X k) be a strictly stationary sequence of random variables with values in some Polish space E and common marginal , and (A k) k>0 be a sequence of Borel sets in E. In this paper, we give some conditions on (X k) and (A k) under which the events {X k A k } satisfy the Borel-Cantelli (or strong Borel-Cantelli) property. In particular we prove that, if (lim sup n A n) > 0, the Borel-Cantelli property holds for any absolutely regular sequence. In case where the A k 's are nested, we show, on some examples, that a rate of convergence of the mixing coefficients is needed. Finally we give extensions of these results to weaker notions of dependence, yielding applications to non-irreducible Markov chains and dynamical systems.
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
TopicsMathematical Dynamics and Fractals
Criteria for Borel-Cantelli lemmas with applications to Markov chains and dynamical systems
Jérôme Dedecker a, Florence Merlevède b and Emmanuel Rio c.
a Université Paris Descartes, Laboratoire MAP5, UMR 8145 CNRS, 45 rue des Saints-Pères, F-75270 Paris cedex 06, France. E-mail: [email protected]
b Université Paris-Est, LAMA (UMR 8050), UPEM, CNRS, UPEC, F-77454 Marne-La-Vallée, France. E-mail: [email protected]
b Université de Versailles, Laboratoire de mathématiques, UMR 8100 CNRS, Bâtiment Fermat, 45 Avenue des Etats-Unis, F-78035 Versailles, France. E-mail: [email protected]
Key words: Borel-Cantelli, Stationary sequences, absolute regularity, strong mixing, weak dependence, Markov chains, intermittent maps.
Mathematical Subject Classification (2010): Primary 60F15. Secondary 60G10, 60J05.
Abstract
Let be a strictly stationary sequence of random variables with values in some Polish space and common marginal , and be a sequence of Borel sets in . In this paper, we give some conditions on and under which the events satisfy the Borel-Cantelli (or strong Borel-Cantelli) property. In particular we prove that, if , the Borel-Cantelli property holds for any absolutely regular sequence. In case where the ’s are nested, we show, on some examples, that a rate of convergence of the mixing coefficients is needed. Finally we give extensions of these results to weaker notions of dependence, yielding applications to non-irreducible Markov chains and dynamical systems.
1 Introduction
Let be a probability space. Let be a sequence of random variables defined on and with values in some Polish space , and be a sequence of Borel sets in . Assume that
[TABLE]
Our aim in this paper is to find nice sufficient conditions implying the so-called Borel-Cantelli property
[TABLE]
or the stronger one
[TABLE]
usually called strong Borel-Cantelli property. The focus will be mainly on irreducible or non-irreducible Markov chains. Nevertheless we will apply some of our general criteria to dynamical systems and compare them with the results of Kim (2007) and Gouëzel (2007) concerning the transformation defined by Liverani-Saussol-Vaienti (1999).
Let us now recall some known results on this subject. On one hand, if the sequence is strictly stationary, ergodic, and if for any positive , then a.s., where denotes the law of . Hence (1.2) holds. However, as pointed out for instance by Chernov and Kleinbock (2001), the ergodic theorem cannot be used to handle sequences of sets such that . On the other hand, if the random variables are independent, then (1.2) holds for any sequence of Borel sets in satisfying (1.1) (see Borel (1909), page 252). Extending this result to non necessarilly independent random variables has been the object of intensive researches. Let and recall that . Lévy (1937, p. 249) proved that, with probability ,
[TABLE]
However the second assertion is still difficult to check in the case of sequences of dependent random variables. As far as we know, the first tractable criterion for (1.2) to hold is due to Erdős and Rényi (1959) and reads as follows:
[TABLE]
Suppose now that the sequence satisfies the following uniform mixing condition:
[TABLE]
Then, if
[TABLE]
the criterion (1.5) is satisfied and consequently (1.2) holds. Furthermore, if (1.7) holds, then the strong Borel-Cantelli property (1.3) also holds, according to Theorem 8 and Remark 7 in Chandra and Ghosal (1998). This result has applications to dynamical systems. For example, Philipp (1967) considered the Gauss map (mod 1) and the -transforms (mod 1) with , with viewed as a random sequence on the probability space , where is the unique -invariant probability measure absolutely continuous w.r.t. the Lebesgue measure. For such maps and sequences of intervals satisfying
[TABLE]
he proved that (1.7) is satisfied. More recently, Chernov and Kleinbock (2001) proved that (1.7) is satisfied when are the iterates of Anosov diffeomorphisms preserving Gibbs measures and belongs to a particular class of rectangles (called EQR rectangles). We also refer to Conze and Raugi (2003) for non-irreducible Markov chains satisfying (1.7).
However some dynamical systems do not satisfy (1.7). We refer to Haydn et al. (2013) and Luzia (2014) for examples of such dynamical systems and Borel-Cantelli type results, including the strong Borel-Cantelli property. In particular, estimates as in (1.7) are not available for non uniformly expanding maps such as the Liverani-Saussol-Vaienti map (1999) with parameter . Actually, for such maps, Kim (2007) proved in his Proposition 4.2 that for any , the sequence of intervals satisfies (1.8) but does not satisfy (1.2). Moreover, there are many irreducible, positively recurrent and aperiodic Markov chains which do not satisfy (1.6) with even for regular sets , such as the Markov chain considered in Remark 5.1 in the case where (see Chapter 9 in Rio (2017) for more about irreducible Markov chains). However, these Markov chains are -mixing in the sense of Volkonskiǐ and Rozanov (1959), and therefore strongly mixing in the sense of Rosenblatt (1956).
The case where the sequence of events satisfies a strong mixing condition has been considered first by Tasche (1997). For , let
[TABLE]
Tasche (1997) obtained sufficient conditions for (1.2) to hold. However these conditions are more restrictive than (1.1): even in the case where the sequence decreases at a geometric rate and is non-increasing, Theorem 2.2 in Tasche (1997) requires the stronger condition . Under slower rates of mixing, as a consequence of our Theorem 3.2 (see Remark 3.4), we obtain that if is non-increasing and for some , satisfies the Borel-Cantelli property (1.2) provided that
[TABLE]
which improves Item (i) of Theorem 2.2 in Tasche (1997). Furthermore, we will prove that this result cannot be improved in the specific case of irreducible, positive recurrent and aperiodic Markov chains for some particular sequence of nested sets (see Remark 3.5 and Section 5). Consequently, for this class of Markov chains, the size property (1.1) is not enough for to satisfy (1.2).
In the stationary case, denoting by the common marginal distribution, a natural question is then: for sequences of sets satisfying the size property (1.8), what conditions could be added to get the Borel-Cantelli property? Our main result in this direction is Theorem 3.1 (i) stating that if
[TABLE]
then satisfies the Borel-Cantelli property (1.2) without additional conditions on the sizes of the sets (see (3.3) for the definition of the coefficients ). Notice that the first part of (1.10) implies the size property (1.8) : this follows from the direct part of the Borel-Cantelli lemma. For the weaker coefficients defined in (4.2) (resp. defined in Remark 4.2) and when the ’s are intervals, Item (i) of our Theorem 4.1 implies the Borel-Cantelli property under the conditions
[TABLE]
The proof of this result is based on the following characterization of sequences of intervals satisfying the above condition: For a sequence of intervals, if and only if there exists a sequence of intervals such that for any positive , and fulfills the asymptotic equirepartition property
[TABLE]
where denotes the supremum norm with respect to . Up to our knowledge, this elementary result is new. We then prove that, under the mixing condition given in (1.11), the sequence has the strong Borel-Cantelli property (see Item (ii) of Theorem 4.1). In the case of the Liverani-Saussol-Vaienti map (1999) with parameter , the mixing condition in (1.11) holds for and any in . For in , our result can be applied to prove that satisfies the Borel-Cantelli property (1.2) for any sequence of intervals satisfying , and the strong Borel-Cantelli property (1.3) under the additional condition (1.12) with . However, for the LSV map, Gouëzel (2007) obtains the Borel-Cantelli property (1.2) under the condition
[TABLE]
(but not the strong Borel-Cantelli property). Now
[TABLE]
by the direct part of the Borel-Cantelli lemma. Hence, for the LSV map, (1.13) is weaker than (1.11). Actually the condition (1.13) is the minimal one to get the Borel-Cantelli property in the case (see Example 4.1 of Section 4.3).
A question is then to know if a similar condition to (1.13) can be obtained in the setting of irreducible Markov chains. In this direction, we prove that, for aperiodic, irreducible and positively recurrent Markov chains, the renewal measure plays the same role as the Lebesgue measure for the LSV map. More precisely, if and are respectively the stationary Markov chain and the renewal measure defined in Section 5, we obtain the Borel-Cantelli property in Theorem 5.2 (but not the strong Borel-Cantelli property) for sequences of Borel sets such that
[TABLE]
without additional condition on the rate of mixing. Furthermore we prove in Theorem 5.4 that this condition cannot be improved in the nested case.
The paper is organized as follows. In Section 2, we give some general conditions on a sequence of events to satisfy the Borel-Cantelli property (1.2), or some stronger properties (such as the strong Borel-Cantelli property (1.3)). The results of this section, including a more general criterion than (1.5) stated in Proposition 2.3, will be applied all along the paper to obtain new results in the case where , under various mixing conditions on the sequence . In Section 3, we state our main results for -mixing and -mixing sequences; in Section 4, we consider weaker type of mixing for real-valued random variables, and we give three examples (LSV map, auto-regressive processes with heavy tails and discrete innnovations, symmetric random walk on the circle) to which our results apply; in Section 5, we consider the case where is an irreducible, positively recurrent and aperiodic Markov chain: we obtain very precise results, which show in particular that some criteria of Section 3 are optimal in some sense. Section 6 is devoted to the proofs, and some complementary results are given in Appendix (including Borel-Cantelli criteria under pairwise correlation conditions).
2 Criteria for the Borel-Cantelli properties
In this section, we give some criteria implying Borel-Cantelli type results. Let be a probability space and be a sequence of events.
Definition 2.1**.**
The sequence is said to be a Borel-Cantelli sequence in if , or equivalently, almost surely.
From the first part of the classical Borel-Cantelli lemma, if is a Borel-Cantelli sequence, then .
We now define stronger properties. The first one is the convergence in .
Definition 2.2**.**
We say that the sequence is a Borel-Cantelli sequence in if and , where and .
Notice that, if is a Borel-Cantelli sequence, then converges to in probability as tends to . Since is a non-decreasing sequence, it implies that almost surely. Therefrom is a Borel-Cantelli sequence.
The second one is the so-called strong Borel-Cantelli property.
Definition 2.3**.**
With the notations of Definition 2.2, the sequence is said to be a strongly Borel-Cantelli sequence if and almost surely.
Notice that . Since the random variables are nonnegative, by Theorem 3.6, page 32 in Billingsley [2], if is a strongly Borel-Cantelli sequence, then is a uniformly integrable sequence and consequenly converges in to . Hence any strongly Borel-Cantelli sequence is a Borel-Cantelli sequence.
We start with the following characterizations of the Borel-Cantelli property.
Proposition 2.1**.**
Let be a sequence of events in and be a real number. The two following statements are equivalent:
.
- 2.
There exists a sequence of events such that , and
[TABLE]
Furthermore, if there exists a triangular sequence of events with , such that , and \bigl{(}{\tilde{E}}_{n}^{-1}\sum_{k=1}^{n}{\bf 1}_{A_{k,n}}\bigr{)}_{n\geq 1} is uniformly integrable, then .
Before going further on, we give an immediate application of this proposition which shows that a Borel-Cantelli sequence is characterized by the fact that it contains a subsequence which is a Borel-Cantelli sequence.
Corollary 2.1**.**
Let be a sequence of events in and be a real number. Then the following statements are equivalent:
.
- 2.
There exists a Borel-Cantelli sequence of events such that .
Now, if the sets are intervals of the real line, then one can construct intervals satisfying the conditions of Proposition 2.1, as shown by the proposition below, which will be applied in Section 4 to the LSV map.
Proposition 2.2**.**
Let be an interval of the real line and let be a probability measure on its Borel -field. Let be a sequence of subintervals of and be a real number. The two following statements are equivalent:
.
- 2.
There exists a sequence of intervals such that , and (2.1) holds true.
Let us now state some new criteria, which differ from the usual criteria based on pairwise correlation conditions. Here it will be necessary to introduce a function with bounded derivatives up to order .
Definition 2.4**.**
Let be the application from in defined by for in and for in .
We now give criteria involving the so defined function .
Proposition 2.3**.**
Let be the real-valued function defined in Definition 2.4 and be a sequence of events in such that and .
(i)* Suppose that there exists a triangular sequence of non-negative Borel functions such that for any in , and that this sequence satisfies the criterion below: if and , there exists some increasing sequence of positive integers such that*
[TABLE]
Then is a Borel-Cantelli sequence.
(ii)* Let and . If*
[TABLE]
then is a Borel-Cantelli sequence.
(iii)* If*
[TABLE]
then is a strongly Borel-Cantelli sequence.
Remark 2.1**.**
Since for any real , (2.3) is implied by the usual criterion (1.5), which is the sufficient condition given in Erdős and Rényi (1959) to prove that is a Borel-Cantelli sequence. Moreover, (2.4) is implied by the more elementary criterion
[TABLE]
which is a refinement of Corollary 1 in Etemadi (1983) (see also Chandra and Ghosal (1998) for a review).
3 -mixing and -mixing sequences
In order to state our results, we need to recall the definitions of the -mixing, -mixing and -mixing coefficients between two -fields of .
Definition 3.1**.**
The -mixing coefficient between two -fields and of is defined by
[TABLE]
One also has , which is the usual definition. Now, if and are random variables with values in some Polish space and and are the -fields generated respectively by and , one can define the -mixing coefficient and the -mixing coefficient between the -fields and by
[TABLE]
where is a regular version of the conditional probability given . In contrast to the other coefficients in the general case.
From these definitions . According to Bradley (2007), Theorem 4.4, Item (a2), one also has
[TABLE]
Let us now define the the -mixing an -mixing coefficients of the sequence . Throughout the sequel
[TABLE]
Define the -mixing coefficients of by
[TABLE]
and note that the sequence is non-increasing. is said to be absolutely regular or -mixing if . Similarly, define the -mixing coefficients by
[TABLE]
and note that the sequence is non-increasing. is said to be strongly mixing or -mixing if .
3.1 Mixing criteria for the Borel-Cantelli properties
We start with some criteria when the underlying sequence is -mixing and (see Remark 3.1).
Theorem 3.1**.**
Let be a strictly stationary sequence of random variables with values in some Polish space . Denote by the common marginal law of the random variables . Assume that . Let be a sequence of Borel sets in satisfying . Set for any positive .
(i)* If , then is a Borel-Cantelli sequence.*
(ii)* Set and . If is a uniformly integrable sequence in , then is a Borel-Cantelli sequence.*
(iii)* Let be the cadlag inverse of the tail function . Set*
[TABLE]
If
[TABLE]
then is a strongly Borel-Cantelli sequence in .
Remark 3.1**.**
By the second part of Proposition 2.1 applied with , if is uniformly integrable, then . Hence (ii) does not apply if . On another hand, the map is non-decreasing. Thus, if for any , (3.6) implies that . Then, by Proposition A.1, is uniformly integrable and therefrom . Consequently, if , (iii) cannot be applied if for any .
Remark 3.2**.**
If the sequence is bounded in for some in , as tends to [math]. Then, by Proposition A.1, this sequence is uniformly integrable and consequently, by (ii), is a Borel-Cantelli sequence as soon as . If furthermore , then, by (iii), is a strongly Borel-Cantelli sequence. In particular, if for any with , for some constant , is bounded in , and consequently is a strongly Borel-Cantelli sequence as soon as .
Remark 3.3**.**
Let and . Inequality (6.31) in the proof of the above theorem applied with gives
[TABLE]
for any , where is defined in (6.22), and . It follows that
[TABLE]
for any positive integer . Now, from inequality (6.22) in the proof of Theorem 3.1, we have . Hence, if converges to [math] as tends to , then \lim_{n}{\mathbb{E}}\bigl{(}f_{n}(S_{n}-E_{n})\bigr{)}=0 and consequently is a Borel-Cantelli sequence (see Item (ii) of Proposition 2.3). Similarly, one can prove that, if converges to [math] as tends to , then is a Borel-Cantelli sequence. For other results in the -mixing setting, see Chapter 1 in Iosifescu and Theodorescu (1969).
Let us now turn to the general case where is not necessarily positive. In this case, assuming absolute regularity does not yield any improvement compared to the strong mixing case (see Remark 3.5 after Corollary 3.1). Below, we shall use the following definition of the inverse function associated with some non-increasing sequence of reals.
Definition 3.2**.**
For any non-increasing sequence of reals, the function is defined by .
Theorem 3.2**.**
Let be a strictly stationary sequence of random variables with values in some Polish space . Let be its associated sequence of strong-mixing coefficients defined by (3.4). Denote by the law of . Let be a sequence of Borel sets in satisfying . Set for any positive . Assume that there exist , , and a non-increasing sequence such that for all ,
[TABLE]
Suppose in addition that is a non-increasing sequence,
[TABLE]
Then is a Borel-Cantelli sequence.
Remark 3.4**.**
Let us first notice that Theorem 3.2 still holds with defined in (1.9) instead of (the proof is unchanged). To compare Theorem 3.2 with Theorem 2.2 (i) in Tasche (1997), let us consider
[TABLE]
with . Theorem 2.2 (i) in Tasche (1997) requires and whereas an application of Theorem 3.2 gives the weaker conditions: if and if .
Theorem 3.3**.**
Let be a strictly stationary sequence of random variables with values in some Polish space . Let be its associated sequence of strong-mixing coefficients defined by (3.4). Denote by the law of . Let be a sequence of Borel sets in satisfying . Set for any positive . Let .
Let . Assume that . Then is a Borel-Cantelli sequence.
- 2.
Assume that there exist a sequence of positive reals such that
[TABLE]
Then is a strongly Borel-Cantelli sequence.
We now apply these results to rates of mixing for some positive constant .
Corollary 3.1**.**
Let be a sequence of Borel sets in satisfying . For any , let . Assume that there exists such that , for .
If , and is non-increasing, then is a Borel-Cantelli sequence.
- 2.
If then is a Borel-Cantelli sequence.
- 3.
If then is a strongly Borel-Cantelli sequence.
Remark 3.5**.**
According to the second item of Remark 5.1, Item 1. of Corollary 3.1 cannot be improved, even in the -mixing case.
Remark 3.6**.**
Theorems 3.2 and 3.3 (and therefore Corollary 3.1) also hold if the coefficients are replaced by the reversed ones (see Section 6.2.3 for a short proof of this remark).
Remark 3.7**.**
Let . From the criteria based on pairwise correlation conditions stated in Annex B, if with then is a Borel-Cantelli sequence if (see Remark B.1), which is the same condition as in Corollary 3.1. Now if with , is a Borel-Cantelli sequence when (see Remark B.1), which is more restrictive. Recall that, for Markov chains . Hence criteria based on pairwise correlation conditions are less efficient in the context of -mixing Markov chains and slow rates of -mixing.
4 Weakening the type of dependence
In this section, we consider stationary sequences of real-valued random variables. In order to get more examples than -mixing or -mixing sequences, we shall use less restrictive coefficients, where the test functions are indicators of half lines instead of indicators of Borel sets. Some exemples of slowly mixing dynamical systems and non-irreducible Markov chains to which our results apply will be given in Subsection 4.3.
4.1 Definition of the coefficients
Definition 4.1**.**
The coefficients and between a -field and a real-valued random variable are defined by
[TABLE]
The coefficient between and is defined by
[TABLE]
From this definition it is clear that .
Let be a stationary sequence of real-valued random variables. We now define the dependence coefficients of used in this section. The coefficients are defined by
[TABLE]
Here (see (3.2)). The coefficients and are defined by
[TABLE]
4.2 Results
Theorem 4.1**.**
Let be a strictly stationary sequence of real-valued random variables. Denote by the common marginal law of the random variables . Let be a sequence of intervals such that and . Set for any positive , and .
(i)* If and , then is a Borel-Cantelli sequence.*
(ii)* Let and be the conjugate exponent of . If*
[TABLE]
then is a Borel-Cantelli sequence.
(iii)* Let and be the conjugate exponent of . If*
[TABLE]
then is a strongly Borel-Cantelli sequence.
(iv)* If , then is a Borel-Cantelli sequence.*
(v)* If , then is a strongly Borel-Cantelli sequence.*
Remark 4.1**.**
Item (v) on the uniform mixing case can be derived from Theorem 8 and Remark 7 in Chandra and Ghosal (1998). Note that, if , the condition in Item (iii) becomes
[TABLE]
Note that, for intervals satisfying the condition on right hand, we get the same condition as in (v), but for instead of .
Remark 4.2**.**
Theorem 4.1 remains true if we replace the coefficients (resp. ) by (resp. ).
Remark 4.3**.**
Comparison with usual pairwise correlation criteria. Let us compare Theorem 4.1 wit the results stated in Annex B in the case . From the definition of the coefficients ,
[TABLE]
Hence the assumptions of Proposition B.1 hold true with and . In particular, from Proposition B.1(i), if
[TABLE]
is a Borel-Cantelli sequence. For example, if for some constant , then, from Remark B.1, (4.3) holds if . In contrast Theorem 4.1(i) ensures that is Borel-Cantelli sequence as soon as , without conditions on the sizes of the intervals . Next, if for some , then, according to Remark B.1, (4.3) is fulfilled if . Under the same condition, Theorem 4.1(ii) ensures that is a Borel-Cantelli sequence if, for some real in ,
[TABLE]
where . Consequently Theorem 4.1(ii) provides a weaker condition on the sizes of the intervals if the sequence is bounded in for some .
As quoted in Remark 3.1, if then (i), (ii), (iii) of Theorem 4.1 cannot be applied. Instead, the analogue of Theorems 3.2 and 3.3 and of Corollary 3.1 hold (the proofs are unchanged).
Theorem 4.2**.**
Let be a strictly stationary sequence of real-valued random variables. Denote by the common marginal law of the random variables . Let be a sequence of intervals such that and . Set for any positive , and . Then the conclusion of Theorem 3.2 (resp. Theorem 3.3, Corollary 3.1) holds by replacing the conditions on and in Theorem 3.2 (resp. Theorem 3.3, Corollary 3.1) by the same conditions on and .
Remark 4.4**.**
Theorem 4.2 remains true if we replace the coefficients by where (see the arguments given in the proof of Remark 3.6).
4.3 Examples
Example 4.1**.**
Let us consider the so-called LSV map (Liverani, Saussol and Vaienti (1999)) defined as follows:
[TABLE]
Recall that if , there is only one absolutely continuous invariant probability whose density satisfies . Moreover, it has been proved in [8], that the coefficients of weak dependence associated with , viewed as a random sequence defined on , satisfy for any and some .
Let us first recall Theorem 1.1 of Gouëzel (2007): let be the Lebesgue measure over and let be a sequence of intervals such that
[TABLE]
Then is a Borel-Cantelli sequence. If furthermore the intervals are included in then is a strongly Borel-Cantelli sequence (this follows from inequality (1.3) in [16], and Item (ii) of Proposition B.1.) If is a decreasing sequence of intervals included in with satisfying (4.6), then is strongly Borel-Cantelli as shown in Kim (2007, Prop. 4.1).
We consider here two particular cases:
- •
Consider with a decreasing sequence of real numbers in converging to [math]. Set . Using the same arguments as in Proposition 4.2 in Kim (2007), one can prove that, if , then . Conversely, if , which is exactly condition (4.6), then is a Borel-Cantelli sequence.
Now, to apply Theorem 4.2 (and its Remark 4.4), we first note that it has been proved in [9], that the coefficients of weak dependence associated with , viewed as a random sequence defined on , satisfy for any and some positive constants and . Hence, in that case, Theorem 4.2 gives the same condition (4.6) for the Borel-Cantelli property, up to the mild additional assumption . This shows that the approach based on the dependence coefficients provides optimal results in this case. Now, if , then is a Borel-Cantelli sequence. Finally, if , then is a strongly Borel-Cantelli sequence.
- •
Let now and be two sequences of real numbers in such that and mod . Define, for any , if and if . It follows that is a sequence of consecutive intervals on the torus . Assume that (which is exactly (4.6)). Since , the divergence of the series implies that . Applying Theorem 4.1 (iii), it follows that for any , is a strongly Borel-Cantelli sequence. Now if , applying Theorem 4.1 (ii) and (iii) with , we get that is a Borel-Cantelli sequence as soon as , and a strongly Borel-Cantelli sequence as soon as for some . If , we get that is a Borel-Cantelli sequence as soon as , and a strongly Borel-Cantelli sequence as soon as for some .
Example 4.2**.**
Let be a sequence of iid random variables with values in , such that . We consider here the stationary process
[TABLE]
which is defined almost surely (this is a consequence of the three series theorem). The process is a Markov chain, since . However this chain fails to be irreducible when the innovations are with values in . Hence the results of Sections 3 and 5 cannot be applied in general. Nevertheless, under some mild additional conditions, the coefficients of this chain converge to [math] as shown by the lemma below.
Lemma 4.1**.**
Let be the law of . Assume that has a bounded density. If
[TABLE]
then .
Remark 4.5**.**
The assumption that has a bounded density can be verified in many cases. For instance, it is satisfied if where and are two independent sequences of iid random variables, and has the Bernoulli distribution. Indeed, in that case, with and . Since is uniformly distributed over , it follows that the density of is uniformly bounded by .
Since is a stationary Markov chain, . Hence, under the assumptions of Lemma 4.1, we also have that . Let then . As a consequence, we infer from Lemma 4.1, Theorems 4.1 and 4.2 that
- •
If , has a bounded density and (4.8) holds for some , then is a Borel-Cantelli sequence.
- •
If has a bounded density, (4.8) holds, \sum_{n\geq 1}\bigl{(}\mu(I_{n})\bigr{)}^{(p+1)/(p-1)}=\infty, is non-increasing, and , then is a Borel-Cantelli sequence.
Example 4.3**.**
We consider the symmetric random walk on the circle, whose Markov kernel is defined by
[TABLE]
on the torus with irrational in . The Lebesgue-Haar measure is the unique probability which is invariant by . Let be the stationary Markov chain with transition kernel and invariant distribution . We assume that is badly approximable in the weak sense meaning that, for any positive , there exists some positive constant such that
[TABLE]
From Roth’s theorem the algebraic numbers are badly approximable in the weak sense (see for instance Schmidt [27]). Note also that the set of numbers in satisfying (4.10) has Lebesgue measure 1. For this chain, we will obtain the bound below on the coefficients .
Lemma 4.2**.**
Let be badly approximable in the weak sense, and let be the stationary Markov chain with transition kernel and invariant distribution . Then, for any in , .
Since is a stationary Markov chain, . Hence, under the assumptions of Lemma 4.2, for any in . As a consequence, we infer from Lemma 4.2, Theorems 4.1 and 4.2 the corollary below on the symmetric random walk on the circle with linear drift.
Corollary 4.1**.**
Let be a real in . Set . For any positive integer , let . Set . If , is a strongly Borel-Cantelli sequence for any in . Now, if is badly approximable in the strong sense, which means that (4.10) holds with , is a strongly Borel-Cantelli sequence for any .
5 Harris recurrent Markov chains
In this section, we are interested in the Borel-Cantelli lemma for irreducible and positively recurrent Markov chains. Let be a Polish space and be its Borel -field. Let be a stochastic kernel. We assume that there exists a measurable function with values in and a probability measure such that and
[TABLE]
Then the chain is aperiodic and irreducible. Let us then define the sub-stochastic kernel by
[TABLE]
Throughout this section, we assume furthermore that
[TABLE]
Then the probability measure
[TABLE]
is the unique invariant probability measure under . Furthermore the stationary Markov chain with kernel is positively recurrent (see Rio (2017), Chapter 9 for more details) and -mixing according to Corollary 6.7 (ii) in Nummelin (1984). Thus a direct application of Theorem 3.1 (i) gives the following result.
Theorem 5.1**.**
Let be a sequence of Borel subsets of such that . Then a.s.
Obviously the result above does not apply in the case where the events are nested and . However in this case, the regeneration technique can be applied to prove the following result.
Theorem 5.2**.**
Let be a sequence of Borel subsets of such that and for any positive . Then a.s.
Suppose now that and that the events are not necessarily nested. Then applying Corollary 3.1 and using Proposition 9.7 in Rio (2017) applied to arithmetic rates of mixing (see Rio (2017) page 164 and page 165 lines 8-11), we derive the following result:
Theorem 5.3**.**
Let be the first renewal time of the extended Markov chain (see (6.75) for the exact definition). Assume that there exists such that for . Suppose furthermore that is a sequence of Borel subsets of such that , and is non-increasing. Then a.s.
If the stochastic kernel defined in (6.72) is equal to , then Theorem 5.2 cannot be further improved, as shown in Theorem 5.4 below
Theorem 5.4**.**
Let be a Polish space. Let be a probability measure on and be a measurable function with values in such that . Suppose furthermore that
[TABLE]
Let
[TABLE]
Then is irreducible, aperiodic and positively recurrent. Let denote the strictly stationary Markov chain with kernel and be a sequence of Borel subsets of such that and for any positive . Then a.s.
Remark 5.1**.**
Let us compare Theorems 5.2 and 5.3 when is the Markov kernel defined by (5.6) with , and with (here is the Lebesgue measure on ). For this example, and . Furthermore, from Lemma 2, page 75 in Doukhan, Massart and Rio (1994), if denotes the sequence of -mixing coefficients of the stationary Markov chain with kernel , then
[TABLE]
Now, for any , let .
- •
Assume that , which means that is non-decreasing and is non-increasing. Then Theorem 5.2 applies if whereas Theorem 5.3 applies if and . Note that the first condition is always weaker than the second one. Note also that, if , the first condition is equivalent to , which is then strictly weaker than . Since , the condition is the best possible for the Borel-Cantelli property (this is due to the direct part of the Borel-Cantelli lemma).
- •
Assume now that and is non-increasing. In that case, , for any . According to Theorem 5.4, it follows that is a necessary condition to get the Borel-Cantelli property.
- •
Assume now that with . Since in this case, Theorem 5.2 does not apply whereas the conditions of Theorem 5.3 hold provided that and .
6 Proofs
6.1 Proofs of the results of Section 2
6.1.1 Proof of Proposition 2.1.
We start by showing that Let . It suffices to prove that . Note first that
[TABLE]
by (2.1). Hence it is enough to prove that
[TABLE]
This follows directly from (2.1) and the fact that, by definition of the and since ,
[TABLE]
We prove now that Proceeding by induction on one can construct an increasing sequence of integers such that and
[TABLE]
Define now the sequence of Borel sets by
[TABLE]
From the definition of
[TABLE]
Consequently, for any and any in ,
[TABLE]
Furthermore, from (6.1),
[TABLE]
for any and any in . Hence, if G_{n}=\big{(}\sum_{i=1}^{n}{\mathbb{P}}(\Gamma_{i})\big{)}^{-1}\sum_{i=1}^{n}{\bf 1}_{\Gamma_{i}}, then for in , which ensures that .
We now prove the second part of Proposition 2.1. Suppose that there exists a triangular sequence of events with , such that and that the sequence defined by is uniformly integrable. Set . For any ,
[TABLE]
since on . Using Lemma 2.1 (a) in Rio (2017), it follows that
[TABLE]
where denotes the cadlag inverse of the tail function . Hence,
[TABLE]
Now, if , then . If furthermore is uniformly integrable, then, by Proposition A.1, the term on right hand in the above inequality tends to [math] as tends to , which is a contradiction. The proof of Proposition 2.1 is complete.
6.1.2 Proof of Corollary 2.1.
The fact that 2. implies 1. is immediate. Now, if 1. holds true, then, by Proposition 2.1, there exists a sequence of events such that , and (2.1) holds with . Since , it follows that
[TABLE]
Now
[TABLE]
which, together with (6.2), implies that the above sequence is a Borel-Cantelli sequence. Hence Corollary 2.1 holds.
6.1.3 Proof of Proposition 2.2.
The fact that follows immediately from Proposition 2.1. We now prove the direct part. Proceeding by induction on one can construct an increasing sequence of integers such that and
[TABLE]
Now, for any , we construct the intervals for in . This will be done by using the lemma below.
Lemma 6.1**.**
Let be a sequence of intervals of . Then there exists a sequence of disjoint intervals such that and for any in .
Proof of Lemma 6.1. We prove the Lemma by induction on . Clearly the result holds true for . Assume now that Lemma 6.1 holds true at range . Let then be a sequence of intervals. By the induction hypothesis, there exists a sequence of disjoint intervals such that and for any in . Now, at the range , define now the intervals for in by if and if . Clearly these intervals are disjoint. Set
[TABLE]
If , then . Otherwise, from the definition of , is a nonempty interval and , which implies that is an interval. Hence is a finite intersection of intervals, which ensures that is an interval. By 6.4, does not intersect for any in . Hence the so defined intervals are disjoint, for any in . Finally
[TABLE]
Hence, if Lemma 6.1 holds true at range , then Lemma 6.1 holds true at range , which ends the proof of the lemma.
End of the proof of Proposition 2.2. For any , by Lemma 6.1 applied to , there exists a sequence of disjoint intervals such that
[TABLE]
From now on the end of the proof is exactly the same as the end of the proof of the first part of Proposition 2.1.
6.1.4 Proof of Proposition 2.3.
We start by proving Item (ii). Let be the function defined in Definition 2.4 and be any integrable real-valued random variable. Then
[TABLE]
Consequently, if (2.3) holds, then , which proves Item (ii).
Proof of Item (i). Applying (6.7), we get that . Hence, by the Markov inequality, , which proves that converges to in probability as tends to . Now any in . Therefrom and consequently converges to in probability as tends to . Since is a non-decreasing sequence of random variables, it implies immediately that almost surely, which completes the proof of Item (i).
Proof of Item (iii). For any non-negative real , define . is a non-decreasing and cadlag function defined on with values in . Let be its generalized inverse on defined by . Hence
[TABLE]
Note that . Let for a fixed and define
[TABLE]
Hence is a non-decreasing sequence of integers. Note also that there exists a positive integer depending on such that, for any , . Indeed, let assume that there exists such that . By definition and . This implies that
[TABLE]
Since , there exists an integer such that the above inequality fails to hold for any . This contradicts the fact that there exists such that . Let us then show that
[TABLE]
By the first part of the Borel-Cantelli lemma, (6.9) will hold provided that
[TABLE]
Hence, setting, for any real ,
[TABLE]
to prove (6.10), it suffices to show that
[TABLE]
Write
[TABLE]
Note now that, for any real , . Therefore
[TABLE]
Next, for any , , and
[TABLE]
for any . Hence, for any and any ,
[TABLE]
So, overall, setting ,
[TABLE]
proving (6.11) (and subsequently (6.9)) under (2.4). The rest of the proof is quite usual but we give it for completeness. Since is a non-decreasing sequence as well as the normalizing sequence , if ,
[TABLE]
But, for any positive integer , . Therefore , as . Hence, by using (6.9), almost surely,
[TABLE]
Taking the intersection of all such events for rationals , Item (iii) follows.
6.2 Proofs of the results of Section 3
6.2.1 Proof of Theorem 3.1 (-mixing case)
Throughout this section, . Items (i) and (ii) will be derived from the proposition below.
Proposition 6.1**.**
With the notations of Theorem 3.1, let be a double array of Borel sets in . Set and . Suppose that for any positive , and is a uniformly integrable sequence in . Let and . If , then
[TABLE]
**Proof of Proposition 6.1. ** From (6.7), it is enough to prove that
[TABLE]
Now, by setting , we first write
[TABLE]
Let then and, for ,
[TABLE]
With these notations, by the Taylor integral formula at order ,
[TABLE]
Now . Moreover, from the definition of , is -Lipschitzian. Hence
[TABLE]
for any in , which implies that
[TABLE]
Now, using (6.14), (6.16), taking the expectation and noticing that , we get that
[TABLE]
Next, let be a fixed integer. For ,
[TABLE]
Taking the expectation in the above equality, we then get that
[TABLE]
In order to bound up the terms appearing in (6.18), we will use Delyon’s covariance inequality, which we now recall. We refer to Rio (2017, Theorem 1.4) for an available reference with a proof.
Lemma 6.2**.**
- Delyon (1990) - Let and be two -fields of . Then there exist random variables and respectively -measurable with values in and -measurable with values in , satisfying and such that, for any in with and any random vector in ,
[TABLE]
where \bigl{(}{\mathbb{E}}(d_{\cal A}|X|^{p})\bigr{)}^{1/p}=\|X\|_{\infty} if and \bigl{(}{\mathbb{E}}(d_{\cal B}|Y|^{q})\bigr{)}^{1/q}=\|Y\|_{\infty} if .
We now bound up the first term in the right-hand side of equality (6.18). If , then , whence
[TABLE]
Set
[TABLE]
If , using the stationarity of , we obtain that
[TABLE]
Let us now apply Lemma 6.2 with , , , , and : there exists some measurable function satisfying
[TABLE]
such that, for any ,
[TABLE]
Next . Since , it follows that . Summing (6.23) on and using this bound, we finally get that
[TABLE]
where is defined in Proposition 6.1.
We now bound up the other terms in the right-hand side of equality (6.18). If , then , which implies that
[TABLE]
If , using the stationarity of , we obtain that
[TABLE]
where and are defined in (6.20). Applying Lemma 6.2 with , , , and , we obtain that there exist some -measurable random variable and some -measurable random variable with values in , satisfying
[TABLE]
and such that
[TABLE]
Next, from the definitions of and , and is -Lipschitzian. Consequently
[TABLE]
which implies that
[TABLE]
with . Combining the above inequality, (6.27) and the elementary inequality , we infer that
[TABLE]
Recall now that is -measurable and is -measurable. Hence there exists Borelian functions and with values in such that and . Using now the stationarity of , we get
[TABLE]
Next, applying the elementary inequality
[TABLE]
noticing that and putting together (6.25), (6.28) and the above inequalities, we get
[TABLE]
for some Borelian functions and with values in satisfying
[TABLE]
Finally, summing (6.29) on and , using (6.17), (6.18) and (6.24), we obtain
[TABLE]
where
[TABLE]
Let denote the Lebesgue measure on and let be the cadlag inverse function of the the tail function of . Then, by Lemma 2.1 (a) in Rio (2017) applied to the functions and ,
[TABLE]
In a similar way
[TABLE]
Putting the two above inequalities in (6.31), we get:
[TABLE]
We now complete the proof of Proposition 6.1. Since , the above inequality ensures that
[TABLE]
It follows that
[TABLE]
for any integer . Now . Consequently, if the sequence is uniformly integrable, then, by Proposition A.1, the term on right hand in the above inequality tends to [math] as tends to , which ends the proof of Proposition 6.1.
End of the proof of Theorem 3.1. Item (ii) follows immediately from Proposition 6.1 applied with . To prove Item (i), we note that applying Proposition 2.1 with , there exists a sequence of events such that satisfies the assumptions of Proposition 6.1. Item (i) then follows by applying Proposition 6.1.
It remains to prove Item (iii). Here we will apply Proposition 2.3 (iii). Thoughout the proof of Item (iii), by convention. For any positive integer , let and . Since is convex and ,
[TABLE]
for any in . Applying now Inequality (6.35) in the case , we get that
[TABLE]
Now, from the definition of ,
[TABLE]
The three above inequalities ensure that
[TABLE]
Let be the smallest integer such that . For , choose in the above inequality. For this choice of , noticing that , we get
[TABLE]
We now bound up the first term on the right-hand side. Clearly
[TABLE]
Next, noticing that , we get that . It follows that
[TABLE]
where is the smallest integer such that . Since , . Hence
[TABLE]
under condition (3.6). To complete the proof of (iii), it remains to prove that
[TABLE]
under condition (3.6), where . For any integer , let be the set of integers such that . By definition, is an interval of . Furthermore, from the fact that , . Since , this interval is finite. Consequently
[TABLE]
Now, recall that is the first integer such that . Consequently and
[TABLE]
under condition (3.6). This ends the proof of Item (iii). Theorem 3.1 is proved.
6.2.2 Proofs of Theorems 3.2 and 3.3 (-mixing case)
Proof of Theorem 3.2. To apply Item (i) of Proposition 2.3, we shall prove that under (3.7) and (3.8), there exists a sequence of positive integers such that setting , and (so here if and [math] otherwise), we have
[TABLE]
To construct the sequence , let us make the following considerations. By the second part of (3.8), there exists a positive decreasing sequence such that , as , and
[TABLE]
Now, note that, by the second part of (3.7), there exist and such that for any , . Hence setting and , it follows that , which combined with (6.43) implies that
[TABLE]
Definition 6.1**.**
Let be the sequence of integers defined by
[TABLE]
and . Set and for any , Finally, for any , we set and for any with , .
Recall the notation, f_{2^{N}}(x)=f\bigl{(}x/{\tilde{E}}_{2^{N}}\bigr{)}. Noticing that and recalling that , we have
[TABLE]
Using Taylor’s formula (as to get (6.16)) and taking the expectation, we derive
[TABLE]
Since , it follows from (3.1) that
[TABLE]
Now, since and , we get
[TABLE]
Note then that, since is a non-increasing sequence,
[TABLE]
Thus
[TABLE]
This shows that (6.42) will be satisfied if
[TABLE]
Since is a non-increasing sequence, condition (6.44) is equivalent to
[TABLE]
Together with (6.46) and the definition of , (6.48) implies the first part of (6.47). Next, taking into account the definition of ,
[TABLE]
by the first parts of conditions (3.7) and (3.8). This ends the proof.
Proof of Theorem 3.3. Starting from (6.17), taking into account (6.18) and the facts that
[TABLE]
and
[TABLE]
we infer that, for any positive integer and any integer in ,
[TABLE]
Item 1. follows by choosing and by taking into account Item (ii) of Proposition 2.3. To prove Item 2., we choose . Item 2. then follows by taking into account Item (iii) of Proposition 2.3.
6.2.3 Proof of Remark 3.6
To prove that Theorem 3.2 still holds with replacing , it suffices to modify the decomposition (6.45) as follows:
[TABLE]
Next, as in the proof of Theorem 3.2, we use Taylor’s formula and the fact that, by (3.1), for any ,
[TABLE]
The rest of the proof is unchanged.
To prove that Theorem 3.3 still holds with replacing , we start by setting
[TABLE]
Then, setting , instead of (6.14), we write
[TABLE]
By the Taylor integral formula at order , it follows that
[TABLE]
Then, instead of (6.18), we use the following decomposition:
[TABLE]
Hence, the only difference with the proof of Theorem 3.3 is the following estimate:
[TABLE]
This ends the proof of the remark.
6.3 Proofs of the results of Section 4
6.3.1 Proof of Theorem 4.1.
To prove Item (i), we first apply Proposition 2.2. Since , it follows from that proposition that there exists a sequence of intervals such that , and
[TABLE]
where is the essential supremum norm with respect to .
Let us prove now that is a -Borel-Cantelli sequence. Since , this will imply that is a Borel-Cantelli sequence. From (1.5) applied to , it is enough to prove that
[TABLE]
By stationarity,
[TABLE]
Let . Clearly, since is an interval,
[TABLE]
Setting , we infer from (6.51) and (6.52) that
[TABLE]
Since , we infer from (6.53) that
[TABLE]
the last inequality being true because . Hence (6.50) follows from (6.49), (6.54), and the fact that and . The proof of Item (i) is complete.
We now prove Item (ii). Let . Arguing as for (i), it is enough to prove (6.50) with instead of . Since the are intervals, the same computations as for (i) lead to
[TABLE]
for any . Set . Applying Hölder’s inequality, we get that, for any ,
[TABLE]
(the last inequality follows from Remark 1.6 and Inequality (C.5) in [25]). Consequently
[TABLE]
Hence Item (ii) follows via (1.5). In addition, Item (iii) follows from (6.56) by applying (2.5).
To prove (iv) and (v), we start from (6.55), and we get that, for any ,
[TABLE]
Then (iv) follows from (6.57) with and (1.5) and (v) from (6.57) and (2.5).
6.3.2 Proof of Lemma 4.1
We consider the natural coupling
[TABLE]
where is an independent copy of . Note that distributed as and independent of . Let then
[TABLE]
We first give a bound on . By definition
[TABLE]
By sub-additivity and stationarity,
[TABLE]
Hence
[TABLE]
and, consequently,
[TABLE]
with . This gives the upper bound
[TABLE]
Now, if (4.8) holds,
[TABLE]
and it follows then easily from (6.58) that there exists some positive constant such that
[TABLE]
Now let be the distribution function of . By Lemma 2, Item 2. in [10], for any
[TABLE]
Since has a bounded density, is Lipshitz. Moreover . Hence
[TABLE]
Now, by (6.60), (6.61) and the Markov inequality, for any positive . Consequently . The conclusion of Lemma 4.1 follows then from (6.59).
6.3.3 Proof of Lemma 4.2
We first note that, for any function in , one has
[TABLE]
where are the Fourier coefficients of .
Next, we need to approximate the function by smooth functions. To do this, we start from an infinitely differentiable density supported in , and we define
[TABLE]
Now, for , and , we have
[TABLE]
where
[TABLE]
Hence, for
[TABLE]
On the other hand
[TABLE]
From (6.63) and (6.64), we get
[TABLE]
where .
Note that the functions belonging to are infinitely differentiable, so that one can easily find some upper bounds on their Fourier coefficients. More precisely, by two elementary integrations by parts, we obtain that there exist a positive constant such that, for any ,
[TABLE]
From (6.62) and (6.66), we get that
[TABLE]
Take . By the properties of the Gamma function there exists a positive constant such that,
[TABLE]
Since , we derive that
[TABLE]
Note that, if is badly approximable by rationals in the weak sense, then so is . Therefore if satisfies (4.10), proceeding as in the proof of Lemma 5.1 in [11], we get that, for any ,
[TABLE]
Therefore, since , taking close enough to 0, we get
[TABLE]
From (6.67) and (6.68), for any in there exists a constant such that
[TABLE]
From (6.65) and (6.69), we infer that, for any in there exists a constant such that
[TABLE]
Taking in the above inequality, we then get Lemma 4.2.
6.3.4 Proof of Corollary 4.1
The first part of Corollary 4.1 follows immediately from Lemma 4.2 and Theorem 4.2 applied to and the sequence of intervals on the circle defined by . In order to prove the second part, we will apply Theorem 4.1(iii) to the sequence . The main step is to prove that
[TABLE]
Now as . Therefrom one can easily see that (6.70) follows from the inequality below: for some positive constant ,
[TABLE]
Now . Furthermore, if is badly approximable, then, from (4.10) with , for any such that , which ensures that for any . This inequality and the above facts imply (6.71) and, consequently, (6.70). Now Corollary 4.1 follows easily from Lemma 4.2, (6.70) and Theorem 4.1(iii)
6.4 Proofs of the results of Section 5
6.4.1 Proof of Theorem 5.2.
Recall that, for any Polish space , there exists a one to one bimeasurable mapping from onto a Borel subset of . Consequently we may assume without loss of generality that . We define the Markov chain and the renewal process in the same way as in Subsection 9.3 in Rio (2017). Let be a sequence of independent random variables with the uniform law over and be a random variable with law independent of . Let be a sequence of independent random variables with law . Suppose furthermore that this sequence is independent of the -field generated by and . Define the stochastic kernel by
[TABLE]
and the conditional distribution function by
[TABLE]
Define the sequence by induction in the following way: and
[TABLE]
Then the sequence is a Markov chain with kernel and initial law . The incidence process is defined by and the renewal times by
[TABLE]
We also set for any . Under the assumptions of Theorem 5.2, is a sequence of integrable, independent and indentically distributed random variables. Note also that (5.3) implies that almost surely (see Rio (2017), Subsection 9.3). Hence, by the strong law of large numbers,
[TABLE]
Let be a positive integer such that . Then there exists some random integer such that for any . Since the sequence of sets is non-increasing, it follows that for any . Furthermore
[TABLE]
Consequently, if a.s., then a.s. . Now, from the construction of the Markov chain, the random variables are iid with law . Next, since the sequence of sets is non-increasing and , the series is divergent. Hence, by the second Borel-Cantelli lemma for sequences of independent events, a.s., which completes the proof of Theorem 5.2.
6.4.2 Proof of Theorem 5.4.
From Lemma 9.3 in Rio (2017), the stochastic kernel is irreducible, aperiodic and positively recurrent. Furthermore
[TABLE]
is the unique invariant law under . Now, let denote the strictly stationary Markov chain with kernel . Define the renewal times as in (6.75). Then the random variables are iid with law . Since , it follows that almost surely. Now , from which . Hence
[TABLE]
Since , for any in . Furthermore for any . Consequently, if does not belong to , then, for any in , does not belong . Now (6.78) and the above fact imply Theorem 5.4.
Appendix A Uniform integrability
In this section, we recall the definition of the uniform integrability and we give a criterion for the uniform integrability of a family of nonnegative random variables. We first recall the usual definition of uniform integrability, as given in Billingsley (1999).
Definition A.1**.**
A family of nonnegative random variable is said to be uniformly integrable if \lim_{M\rightarrow+\infty}\sup_{i\in I}{\mathbb{E}}\bigl{(}Z_{i}{\bf 1}_{Z_{i}>M}\bigr{)}=0.
Below we give a proposition, which provides a more convenient criterion. In order to state this proposition, we need to introduce some quantile function.
Notation A.1**.**
Let be a real-valued random variable and be the tail function of , defined by for any real . We denote by the cadlag inverse of .
Proposition A.1**.**
A family of nonnegative random variables is uniformly integrable if and only if
[TABLE]
Proof. Assume that the family is uniformly integrable. Let be a random variable with uniform distribution over . Since has the same distribution as ,
[TABLE]
Choosing in the above inequality, we then get (A.1). Conversely, assume that condition (A.1) holds true. Then one can easily prove that . It follows that , which ensures that . Consequently, for any ,
[TABLE]
which implies the uniform integrability of .
Appendix B Criteria under pairwise correlation conditions
Proposition B.1**.**
Let be a sequence of events in such that and . Set . Assume that there exist a non-increasing sequence of reals in and sequences and of reals in such that for any integers and ,
[TABLE]
(i)* Assume that*
[TABLE]
Then is a Borel-Cantelli sequence.
(ii)* Assume that*
[TABLE]
Then is a strongly Borel-Cantelli sequence.
Remark B.1**.**
If with , then . Hence the third condition in (B.2) holds as soon as . On the other hand, the third condition in (B.3) holds as soon as (note that this latter condition is satisfied when for some ).
If then . Hence the third condition in (B.2) holds as soon as . On the other hand, the third condition in (B.3) holds as soon as (note that this latter condition is satisfied when for some ).
If with , then \sum_{j=1}^{\infty}\min(\alpha_{j},{\mathbb{P}}(B_{k}))={\cal O}\bigl{(}{\mathbb{P}}(B_{k})^{1-1/a}\bigr{)}. Hence the third condition in (B.2) holds if (use the fact that ). Next, the third condition in (B.3) holds as soon as (note that this latter condition is satisfied when for some ).
If with then \sum_{j=1}^{\infty}\min(\alpha_{j},{\mathbb{P}}(B_{k}))=O\bigl{(}{\mathbb{P}}(B_{k})\log\big{(}e/{\mathbb{P}}(B_{k})\bigr{)}. Hence the third condition in (B.2) holds as soon as . On the other hand, the third condition in (B.3) holds as soon as for some .
Proof of Proposition B.1. Note that
[TABLE]
Moreover, for any positive integer ,
[TABLE]
Now, from (B.4) and (B), one easily infers that criteria (1.5) holds true under (B.2), which proves Item (i) of Proposition B.1.
To prove Item (ii), we shall apply criteria (2.5). Starting from (B.4) and using the facts that and , we get that
[TABLE]
By the second and the third conditions in (B.3), it follows that (2.5) will be satisfied if
[TABLE]
Define the function by and let denote the cadlag generalized inverse function of . Let . Then and
[TABLE]
since . Using the fact that is non-decreasing, it follows that
[TABLE]
which is finite under the first part of condition (B.3). This ends the proof of Item (ii).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] Billingsley, P. Convergence of Probability Measures, Second Edition John Wiley & Sons, New York , 1999.
- 3[3] Borel, E. Les probabilités dénombrables et leurs applications arithmétiques. Palermo Rend. 27 , (1909), 247-271 .
- 4[4] Bradley, R. C. Introduction to strong mixing conditions. Vol. 1. Kendrick Press, Heber City, UT , 2007.
- 5[5] Chandra, T. K. and Ghosal, S. Some elementary strong laws of large numbers: a review. Frontiers in probability and statistics (Calcutta, 1994/1995), 61–81, Narosa, New Delhi, 1998.
- 6[6] Chernov, N. and Kleinbock, D. Dynamical Borel-Cantelli lemmas for Gibbs measures. Israel J. Math. 22 (2001), 1–27.
- 7[7] Conze, J. and Raugi, A. Convergence of iterates of a transfer operator, application to dynamical systems and to Markov chains. ESAIM Probab. Stat. 7 , (2003), 115-146.
- 8[8] Dedecker, J., Dehling, H.G. and Taqqu, M.S. Weak convergence of the empirical process of intermittent maps in L 2 superscript 𝐿 2 L^{2} under long-range dependence. Stochastics and Dynamics 15 , (2015), 29 pages.
