
TL;DR
This paper extends classical results on i.i.d. random iterations to Markovian settings, establishing a correspondence between stationary and invariant measures, and demonstrates local synchronization for circle homeomorphisms.
Contribution
It introduces a novel correspondence between stationary and invariant measures for Markovian random iterations, generalizing classical i.i.d. results.
Findings
Established a one-to-one correspondence between stationary and invariant measures.
Proved local synchronization for Markovian random iterations of circle homeomorphisms.
Extended classical results to Markovian frameworks.
Abstract
In this paper, we study Markovian random iterations of maps on standard measurable spaces. We establish a one-to-one correspondence between stationary measures and a certain class of invariant measures of a Markovian random iteration, extending a similar classical result of independent and identically distributed random iterations. As an application, we prove a local synchronization property for Markovian random iterations of homeomorphisms of the circle .
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 · Stochastic processes and statistical mechanics · Geometry and complex manifolds
Markovian random iterations of maps
Edgar Matias
Departamento de Matemática, Universidade Federal da Bahia, Av. Adhemar de Barros s/n, 40170-110 Salvador, Brazil
Abstract.
In this paper, we study Markovian random iterations of maps on standard measurable spaces. We establish a one-to-one correspondence between stationary measures and a certain class of invariant measures of a Markovian random iteration, extending a similar classical result of independent and identically distributed random iterations. As an application, we prove a local synchronization property for Markovian random iterations of homeomorphisms of the circle .
Key words and phrases:
Random iteration of maps, synchronization, stationary measure, skew product, invariant measure.
2010 Mathematics Subject Classification:
60J05, 37C40, 60G10.
This work was partially completed while the author was supported by postdoctoral fellowships at Federal University of Rio de Janeiro and ICMC-USP. The author thanks to CAPES and Serrapilheira for the financial support. The author warmly thanks Anna Zdunik and Tiago Pereira for their useful comments. The author is also very grateful to Katrin Gelfert and Tiago Pereira for the generous hospitality.
1. Introduction
Let be a homogeneous Markov chain moving through a measurable space and consider a family of homeomorphisms of the circle . These two ingredients specify, for every , a Markovian random iteration given by
[TABLE]
For an independent and identically distributed (i.i.d.) sequence , it was proved by Malicet in [19] that if the maps do not have an invariant measure in common, then there is such that for every , with probability 1, there is an interval containing such that
[TABLE]
In this paper, we extend this result to the case where is a Markov chain. We will obtain this generalization as an application of a general result on Markovian random iterations of maps on standard measurable spaces (see Theorem 1 below) relating stationary measures and invariant measures, which we start to describe now.
Now, we let denote a family of measurable transformations of a standard measurable space . A classical approach in the study of a random iteration is to consider a dynamical system, the so-called skew product, whose dynamical behavior is closely related to the random iteration. This allows to apply several results from the deterministic theory to the setting of random iterations. To this end, the Markov chain is taken to be in its canonical form, that is, is the natural projection on the product space , given by . Then, we consider the induced skew product defined by
[TABLE]
where is the shift map on . This map plays a key role in the study of random iterations.
In the i.i.d. case the sequence of random variables is a homogeneous Markov chain with a well-defined transition probability (see Section 2.2). Thus, for an i.i.d. random iteration, there are two classes of “invariant measures” that we can consider: the stationary measures of this Markov chain and the invariant measures of the induced skew product. An important fact about these two sets of probability measures is that there is a one-to-one correspondence between stationary measures and a certain class of invariant measures of the induced skew product. More precisely, a probability measure on is a stationary measure if and only if the product measure is invariant for the skew product, where is the probability measure considered on the space for which is an i.i.d. sequence.
There are various situations in the study of i.i.d. random iterations where this correspondence is invoked and explored in both directions, that is, studying random iterations using results on skew products as well as studying skew products using results from the general theory of Markov chains. A good example of this is the main theorem of [19]. Therein, using the correspondence between stationary measures and invariant product measures, Malicet combined results on skew products (the invariance principle) and a kind of Krylov-Bogolyubov theorem for general Markov chains to prove the surprising local synchronization property mentioned above in (1.1).
It is worth mentioning that this correspondence has found several applications to problems of a different nature. To mention some of them: in the theory of random matrices (e.g. the invariance principle in the i.i.d. case [17] and the continuity of Lyapunov exponents of two-dimensional matrices [7]), in the theory of random pertubations [1, 3, 4] and also in the study of Poincaré recurrence theorems for random dynamical systems [20].
A natural question then would be whether there is such a correspondence in the Markovian case. The first obstacle we encounter is that, for Markovian random iterations, the sequence is no longer a Markov chain. However, it turns out that the sequence of random variables
[TABLE]
is a homogeneous Markov chain. Thus we can consider stationary measures related to a Markovian random iteration and ask whether there is a set of invariant measures of the skew product that is in one-to-one correspondence to this set of stationary measures. In Theorem 1, we consider a Markovian random iteration of maps on a standard measurable space, and we establish a one-to-one correspondence between stationary measures of the Markov chain and a certain class of invariant measures of the skew product (see Section 2.2 for the precise definition of this class). This bijection is given explicitly using the disintegration of probability measures. Our result generalizes the classical correspondence of the i.i.d. setting, providing a tool that could be useful to several branches of random dynamical systems.
Moreover, under some additional assumptions, we show that a stationary measure is ergodic if and only if its image under this bijection is an ergodic invariant measure, see Theorem 2. In the i.i.d. case, this result was first proved by Kakutani [13] under the hypothesis that the maps have a common fixed point. This hypothesis was removed by Ohno [21]. Let us observe that for Markovian random iterations of finitely many maps, Markov chains as in (1.2) were considered already in [6, 10, 11, 15]. Therein conditions are provided ensuring the uniqueness or finiteness of ergodic stationary measures.
Finally, as an application of the obtained results, we prove a local synchronization property as in (1.1) for Markovian random iterations of homeomorphisms of , see Theorem 3. This local synchronization has several consequences in the study of the topological and the ergodic behavior of a random iteration. In the i.i.d. case for example, in [19], Malicet obtains the Antonov Theorem [2, 16] in a non-minimal context. Another example is the central limit theorem for random iterations of finitely many homeomorphisms of , obtained in [24]. In a forthcoming paper, we will explore applications of the local synchronization property obtained in Theorem 3 for Markovian random iterations.
Organization of the paper
In Section 2 we state precisely the main definitions and results of this work. In Section 3 we characterize stationary measures and invariant measures using the disintegration of measures, and we prove Theorem 1. Theorem 2 is proved in Section 4. In Section 5 we apply Theorem 1 to deduce Theorem 3.
2. Statement of results
2.1. Markovian random iterations
Let be a standard measurable space and consider a transition probability , that is, for every the mapping is a probability measure on and for every the mapping is measurable with respect to .
Let be the product space endowed with the product -algebra and be a probability measure on . Associated with the pair there is a unique probability measure on , called Markov measure, for which the sequence of natural projections is a stationary Markov chain on the probability space with transition probability and starting measure , see [22]. Recall that a probability measure on is called a stationary measure of the transition probability if
[TABLE]
Throughout this paper, we assume that the transition probability has a unique stationary measure , and stands for the Markov measure associated with .
Let be a standard measurable space. Let be a measurable map and denote by the map . Then, the map defined by
[TABLE]
is called a Markovian random iteration of maps. The term Markovian means that in the study of this map under a probabilistic point of view, we consider the space endowed with a Markov measure. We often refer to as a Markovian random iteration of maps associated with the pair and the map .
For every , the sequence of random variables is a Markov chain with range on the space with transition probability given by
[TABLE]
where indicates the characteristic function of . A stationary measure for this transition probability is called a stationary measure for the Markovian random iteration and the set of stationary measures of is denoted by .
The skew product induced by is the map defined by
[TABLE]
where is the shift map on . We also say that is the skew product induced by the map . We say that a probability measure is -invariant if , where denotes the push-forward of a measure.
2.2. Correspondence between stationary measures and invariant measures
Let be a measurable space and consider a probability measure on the product space . Let be the natural projection on the first factor given by . Then there is a unique (a.e.) family of probability measures on the space such that for every measurable rectangle , the map is measurable and
[TABLE]
The family is called the disintegration of with respect to , see Rokhlin [23]. The probability measure on is called the first marginal of . Reciprocally, let be a family of probability measures on the space such that for every measurable set the map is measurable. Then for every probability measure on there is unique probability measure on the product space with first marginal whose disintegration with respect to is given by this family. Indeed, we define as in (2.3) with in the place of .
Let be the Markovian random iteration associated with the pair and the map . We observe that if is a stationary measure of , then the first marginal of is a stationary measure of the transition probability (see Proposition 3.1 below). Therefore, since we are assuming that has a unique stationary measure , we conclude that is the first marginal of . In particular, we can consider the disintegration of with respect to .
Let be the skew product induced by . An -invariant measure with first marginal is called a -invariant measure. Let be the set of -invariant measures for which there is a family of probability measures on such that
[TABLE]
for every , where the family is the disintegration of with respect to . In other words, consists of -invariant measures whose disintegration depends only on the zeroth coordinate of .
Our first main theorem state a one-to-one correspondence between the sets and . This bijection is given explicitly, and the proof relies on the characterization of stationary measures and invariant measures of using disintegration of measures (see Propositions 3.1 and 3.2). To this end, we need the following definition. We say that a transition probability on is in duality with the transition probability relative to the stationary measure if for every measurable sets and we have
[TABLE]
On standard measurable spaces, there is an essentially unique transition probability in duality with relative to , see [22, Lemma 4.7 and Theorem ].
Theorem 1**.**
Let be a Markovian random iteration associated with the pair and the map . Let be the transition probability in duality with relative to . Then, there is a one-to-one correspondence between the sets and given by
[TABLE]
and
[TABLE]
This correspondence is classical in the i.i.d. case. Let us explain this a bit more precisely. If is the product measure , then for every , the sequence of random variables is a homogeneous Markov chain whose transition probability is given by
[TABLE]
In [21], Ohno has shown that a probability measure is a stationary measure of if and only if the product measure is -invariant measure.
Moreover, Ohno proved that a stationary measure is ergodic if and only if the product measure is an ergodic -invariant measure. See [14, 25] for different proofs of this fact. Assuming a certain condition on the pair , we obtain the same result for Markovian random iterations (see Theorem 2 below). To introduce this condition denote by the probability measure . We say that the pair is bounded if is absolutely continuous with respect to for every and there is a constant with such that
[TABLE]
for every and in . Moreover, we say that a Markovian random iteration associated with is bounded if the pair is bounded.
Denoting by the bijection of Theorem 1, we are now ready to state our second main result.
Theorem 2**.**
Let be a bounded Markovian random iteration. Then, a stationary measure is ergodic if and only if the the -invariant measure is ergodic.
We now present some examples of bounded transition probabilities.
Example 2.1 (Random iteration driven by random walks).
Consider a sequence of i.i.d. random variables taking values in whose common distribution is the Lebesgue measure of . Then the sequence
[TABLE]
is a Markov chain with transition probability given by . Note that is a stationary measure of this Markov chain. In particular, the Radon-Nikodym derivative of with respect to the Lebesgue measure is equal to one. Hence, the pair is bounded.
More generally, let be a compact topological group endowed with its Borel -algebra . Recall that a left random walk on with law is a Markov chain with transition probability given by
[TABLE]
where denotes the convolution of measures. We observe that the Haar measure of is a stationary measure of . Let us assume that is absolutely continuous with respect to and let denote the Radon-Nikodym derivative . We claim that
[TABLE]
Indeed, we have
[TABLE]
where in the last equality we use that the Haar measure on a compact topological group is invariant for left and right translations.
In particular, if there is such that the Radon-Nikodym derivative satisfies
[TABLE]
for every , then the pair is bounded.
Example 2.2 (Random iteration of finitely many maps).
Consider a transition matrix with positive entries. Then it follows from Perron-Frobenius theorem that the matrix has a unique stationary probability vector with positive entries. Thus, condition (2.4) is verified for the pair .
2.3. Local synchronization
Finally, we combine the correspondence between and with the invariance principle [19, Theorem F] to obtain a local synchronization property for Markovian random iterations of homeomorphisms of the circle .
In what follows in this section, is a transition probability on a compact metric space (endowed with its Borel -algebra) having a unique stationary measure , the pair is bounded, and we assume that the mapping is continuous in the weak-topology.
Theorem 3**.**
Let be a Markovian random iteration associated with the pair and a measurable map . Assume that the map is a homeomorphism of for every and there is no probability measure such that for -almost every . Then there is such that for any , for -almost every , there is a neighbourhood of such that
[TABLE]
Theorem 3 is new even in the setting of random iterations of diffeomorphisms and extends Theorem A of [19] for Markovian random iterations. Let us observe that this synchronization phenomenon for Markovian random iterations of finitely many maps on compact subsets of a finite dimensional Euclidean space was studied already in [10]. Assuming a purely topological condition on the maps, called splitting condition, the authors proved a contraction exponentially fast of the whole space under the action of the random iteration. However, in the circle , this splitting condition is never satisfied.
3. Proof of Theorem 1
Let and be standard measurable spaces, be a measurable map and be a transition probability on with a unique stationary measure . Let be the Markovian random iteration associated with the pair and the map , as defined in Section 2.1. We start by giving a characterization of the elements of and using the disintegration of measures. In what follows, denotes the transition probability in duality with relative to .
3.1. Stationary measures
Let be the transition probability on induced by as defined in (2.1). The Markov operator induced by is defined as follows: given a probability measure on we define by
[TABLE]
Note that by definition, a stationary measure of is a fixed point of .
The following proposition is a useful characterization of stationary measures using the disintegration of measures:
Proposition 3.1**.**
Let be a probability measure on . The following statements hold:
- (i)
If is a stationary measure of , then has first marginal . 2. (ii)
If has first marginal , then has first marginal and its disintegration with respect to is given by
[TABLE]
for -almost every . 3. (iii)
If has first marginal , then is a stationary measure if and only if
[TABLE]
for -almost every .
Proof.
We stat by proving item (i). Assume that is a stationary measure and let . Then given a measurable set , we have
[TABLE]
Hence is a stationary measure of . Since we are assuming that is the unique stationary measure of , we conclude that .
To prove item (ii), assume that has first marginal . Then for every measurable set , we have
[TABLE]
which implies that the first marginal of is .
We now compute the disintegration of with respect to . First, we have
[TABLE]
Next, we need the following well-known property of transition probabilities in duality: for every measurable map we have
[TABLE]
Applying this property to the right term of the last equality in (3.1) we obtain:
[TABLE]
This implies that for -almost every .
Finally, item (iii) follows immediately from items (i) and (ii).
∎
3.2. Invariant measures
The following proposition is a useful characterization of the elements of , recall the definition of this set in Section 2.2. In what follows denotes the Markov measure on associated with the pair , as defined in Section 2.1.
Proposition 3.2**.**
Let be a probability measure on with first marginal and assume that there is a family of probability measures on such that for every . Then is -invariant if and only if
[TABLE]
for -almost every .
Remark 3.3**.**
In [18], Malheiro and Viana introduced a notion of stationary measure for Markovian random products of finitely many matrices . Let us observe that their notion is different from the one considered in this paper. Indeed, let be a transition matrix with a unique stationary probability vector . A stationary measure in [18] is defined to be a -tuple of probability measures such that*
[TABLE]
It turns out that the transition matrix in duality with relative to is given by
[TABLE]
Hence, Proposition 3.2 implies that the -tuple is the disintegration of an -invariant measure whose disintegration depends only on the zeroth coordinate. Therefore, in view of Proposition 3.1 and Proposition 3.2, we conclude that the notion of stationary measures considered in this paper and the one considered in [18] are different.**
Proof of Proposition 3.2 .
Let be the skew product induced by as defined in (2.2). Let us compute the disintegration of . First, note that
[TABLE]
Now, we need the following lemma:
Lemma 3.4**.**
Given measurable maps and , we have
[TABLE]
Proof.
We start by recalling the Markov property (see Revuz [22, Proposition ]). Let be the Markov measure associated with , where is the Dirac measure centred on . Then, the Markov property says that
[TABLE]
where denotes the expectation with respect the Markov measure .
Using (3.4) and the definition of we have
[TABLE]
Applying (3.2) to the right term of the last equality above we obtain
[TABLE]
where the second equality follows from Fubini’s theorem.
We recall that every Markov measure associated with the transition probability can be obtained by the family of Markov measures . That is, if a is Markov measure induced by , then
[TABLE]
In particular, this implies that
[TABLE]
The proof of the lemma is now complete.
∎
To conclude the proof of the proposition, we apply Lemma 3.4 in (3.3) to obtain
[TABLE]
which implies that
[TABLE]
for -almost every . Therefore, is -invariant if and only if
[TABLE]
for -almost every , or equivalently, for -almost every . ∎
3.3. Proof of Theorem 1
Let be the map that associates to each the probability measure on given by
[TABLE]
Let be the map that associates to each the probability measure on given by
[TABLE]
We claim that takes into and takes into . We start by proving the first claim. To this end, let . It follows from the definition of that, for every and , we have
[TABLE]
Now, recall from Proposition 3.2 that for -almost every . Hence
[TABLE]
for -almost every . We conclude then, from Proposition 3.1, that is a stationary measure.
We now prove that . To see this, take and let be the family of probability measures defined by
[TABLE]
By definition, is the unique probability measure on whose disintegration with respect to is given by .
It follows from Proposition 3.1 that
[TABLE]
for -almost every . Combining (3.5) with (3.6), we obtain
[TABLE]
Therefore, Proposition 3.2 implies that is a -invariant measure whose disintegration depends only on the zeroth coordinate.
We now conclude the proof of Theorem 1. Note that to this end, it is sufficient to prove that for every and for every .
We start by proving that . Let and consider the family of probability measures defined by
[TABLE]
By definition, is the probability measure whose disintegration with respect to is given by Then, we have
[TABLE]
for -almost every , where in the last equality we use Proposition 3.1. Thus we conclude that , which means that .
We now prove that . Let be the family of probability measures for which for -almost every . Then, by definition the stationary measure is given by . Hence, the -invariant measure is given by
[TABLE]
where is the last equality we use Proposition 3.2. This implies that .
The proof of the theorem is now complete.
∎
4. Proof of Theorem 2
We start by proving a technical result on bounded Markovian random iterations. Let and be standard measurable spaces, be a measurable map and be a transition probability on with a unique stationary measure . In what follows the pair is bounded, that is, is absolutely continuous with respect to for every and there is a constant with such that
[TABLE]
Throughout this section denotes a constant satisfying condition (4.1). We denote by the -algebra on generated by the canonical projections , . The following lemma is a general result on Markovian random iterations, also needed in the proof of Theorem 3. In what follows, denotes the conditional expectation of a measurable map with respect to a -algebra and the Markov measure .
Lemma 4.1**.**
Let be the skew product induced by the map . Let be a measurable map such that for every . Let be the map defined by
[TABLE]
Then for every and we have
[TABLE]
for -almost every .
Proof.
By the definition of conditional expectations, we need to prove that for every measurable set
[TABLE]
We start by proving that (4.2) holds for every characteristic function , where . Note that . Hence, we have
[TABLE]
Recall that if is a measurable map and is a -measurable map, then the Markov property (see [22, Proposition ]) implies that
[TABLE]
Applying (4.4) on the right hand side of (4.3) with and ( is -measurable, and in particular, it is -measurable), we obtain
[TABLE]
Since the mapping is -measurable, it follows from the definition of the Markov measure that
[TABLE]
Since the mapping does not depend on , we have
[TABLE]
Recalling that by hypothesis
[TABLE]
for every , we conclude
[TABLE]
This shows that (4.2) holds for .
We now observe that if is an element of the algebra generated by the measurable rectangles, then the map satisfies (4.2). It is readily checked that the class of measurable sets of for which the map satisfies (4.2) is a monotone class. Since the class of measurable rectangles generates the product -algebra of , it follows from the monotone class theorem that if is a subset of , then the map satisfies (4.2). Now, by standard arguments of measure theory, it is easily verified that every non-negative measurable map satisfies (4.2). This completes the proof of the lemma. ∎
We also need the following lemma. Let be the projection on the second factor given by .
Lemma 4.2**.**
Let be a bounded Markovian random iteration and let be the bijection of Theorem 1. Given , let denote . Then,
[TABLE]
Proof.
We start by presenting a formula for the transition probability . Recall that for every , we have
[TABLE]
Set . We claim that is given by
[TABLE]
Indeed,
[TABLE]
This proves our claim.
Then, it follows from the characterization of in (4.5) that
[TABLE]
for -almost every , which implies that
[TABLE]
for -almost every . Next, it is easily seen from the definition of the disintegration of measures that . Hence, for -almost every we have
[TABLE]
and
[TABLE]
In particular, for every measurable rectangle , we have
[TABLE]
and
[TABLE]
which is the desired result.
∎
4.1. Proof of Theorem 2
Let be the bijection of Theorem 1. We need to prove that a stationary measure is ergodic if and only if the -invariant measure is ergodic.
We first assume that is ergodic. Let denote . To prove that is ergodic, let be an -invariant set (that is, ) and assume . We claim that . To prove this, define by and note that for every we have
[TABLE]
Let be the -algebra generated by the canonical projections , . From Levy’s law we have that for every and -almost everywhere , and so we also have the convergence of the Cesaro averages
[TABLE]
for every and -almost everywhere .
Because of (4.6), we have that for every and . This implies that for every
[TABLE]
for every and -almost every . We now apply Lemma 4.1 to the -invariant map to obtain that for every
[TABLE]
for every and -almost every , where the map is given by
[TABLE]
Thus, it follows from (4.7), (4.8) and (4.9) that
[TABLE]
for every and -almost every . We need the following claim, which is just a direct corollary of the Birkhoff ergodic theorem for Markov chains.
Claim 4.3**.**
For -almost every , we have
[TABLE]
for -almost every , where is the projection on the second factor of .
Proof.
Define by Recalling that for every the sequence
[TABLE]
is a Markov chain with transition probability , then it follows from the Birkhoff ergodic theorem for Markov chains and the fact that is an ergodic stationary measure of that, for -almost every ,
[TABLE]
for -almost every . Since (4.11) does not depend on , the definition of implies that, for -almost every ,
[TABLE]
for -almost every . This completes the proof of the claim. ∎
Now, it follows from (4.10) and the previous claim that
[TABLE]
for -almost every . Next, Lemma 4.2 says that , which implies that probability measure is absolutely continuous with respect to . Therefore,
[TABLE]
for -almost every . Recalling that and , it follows from (4.12) that
[TABLE]
for -almost every , and then we conclude that for -almost every , which means that . This proves that is ergodic.
We now assume that the probability measure is ergodic. To see that is ergodic it is enough to prove that for -almost every the Markov chain defined by
[TABLE]
satisfies
[TABLE]
for -almost every , which is equivalent to prove that
[TABLE]
for -almost every . In order to show this, we consider a bounded measurable map and define by
[TABLE]
Since is ergodic, it follows from the Birkhoff ergodic theorem that
[TABLE]
for -almost every . We claim that Indeed, it follows from Theorem 1 that
[TABLE]
for -almost every . Therefore
[TABLE]
which proves our claim.
Since for every , we conclude from (4.13) that
[TABLE]
for -almost every . Now, Lemma 4.2 implies that is absolutely continuous with respect to . Therefore, from (4.14) we conclude that
[TABLE]
for -almost every , which implies that is ergodic.
This completes the proof of the theorem. ∎
5. Local synchronization
In this section, we prove Theorem 3. We start with a preliminary technical result. In what follows in this section, is a transition probability on a compact metric space (endowed with its Borel -algebra) having a unique stationary measure , the pair is bounded, and denotes a constant satisfying (4.1). We also assume that the map is continuous in the weak-topology.
Theorem 5.1**.**
Let be a compact metric space and consider a measurable map such that is continuous for every . Let be the skew product induced by the Markovian random iteration associated with and the map . Let be a measurable map such that:
- (i)
For every , the map is lower semi-continuous. 2. (i)
* for every .*
Then for every , for -almost every there is a subset of such that
[TABLE]
Remark 5.2**.**
In this paper, we will use Theorem 5.1 only for the case where and is -invariant, that is, for every . However, we chose to state Theorem 5.1 in such generality because the proof is the same in any case and we believe that it can be a useful tool in the study of Markovian random iterations. See [19, Lemma 3.20] for the i.i.d. version of Theorem 5.1.***
Proof of Theorem 5.1.
Denote by the set of accumulations points of the sequence of probability measures . We need the following estimative:
Proposition 5.3**.**
For every , for -almost every we have
[TABLE]
Proof.
Given , by definition there is a subsequence such that
[TABLE]
Let be the -algebra generated by the canonical projections , . From Levy’s law we have that for -almost everywhere . In particular,
[TABLE]
for -almost everywhere . Since for every , we have for every and , which implies that
[TABLE]
Then, it follows from (5.2), (5.1) and Lemma 4.1 that for -almost every , we have
[TABLE]
Next, because is lower semi-continuous, the map is also lower semi-continuous. Hence, it follows from Portmanteau theorem that
[TABLE]
for -almost every . This completes the proof of the proposition. ∎
Fix . Let be the transition probability of the Markov chain , recall the definition in (2.1). Let be the set of accumulation points of the sequence of probability measures
[TABLE]
By hypothesis, is continuous for every and the mapping is continuous in the weak-topology. Hence, it is readily checked that the map
[TABLE]
is also continuous in the weak-topology. Since is a compact metric space, it follows from a result on general Markov chains due to Furstenberg, see [12, Lemma ], that there is a subset of -full measure such that for every the set is constituted by stationary measures of the Markovian random iteration , that is, . Let be the bijection of Theorem 1. Then, for every , we define
[TABLE]
We are now ready to prove Theorem 5.1. To this end, let . By definition, there is a stationary measure such that . On the other hand, by definition of , there is a subsequence such that
[TABLE]
Let be the projection on the second factor of . We observe that , and hence we can apply Proposition 5.3 to obtain
[TABLE]
We now apply Lemma 4.2 to equation (5.3) to obtain
[TABLE]
The proof of the theorem is now complete.
∎
5.1. Reformulation of Theorem 3
We now state a reformulation of Theorem 3 using the exponent of contraction of a random iteration of homeomorphisms introduced in [19].
Let be a Markovian random iteration of homeomorphisms of the circle , as in the statement of Theorem 3. The exponent of contraction of at the point is the non-positive quantity
[TABLE]
where denotes the Lebesgue measure on and denotes the arc of smaller length determined by the points and .
Theorem 5.4**.**
Under assumptions of Theorem 3 there is such that for every we have
[TABLE]
for -almost every in .
The proof of Theorem 5.4 is a consequence of Theorem 5.1 combined with the invariance principle [19, Theorem F]. To state this invariance principle for , we need the following definition. Let be a -invariant measure. The exponent of contraction of is the non-positive quantity
[TABLE]
Theorem 5.5** (Invariance principle).**
Let be a -invariant measure such that . Then
[TABLE]
for -almost every .
The theorem above is just a particular case of a general result proved by Malicet in [19, Theorem F] for random iterations of homeomorphisms of . We observe that the invariance principle for random iterations of homeomorphisms of has the same flavor of the classical invariance principle of Ledrappier [17] for random products of matrices.
Proof of Theorem 5.4.
We start by showing that for every we have . Indeed, assume that . Applying Theorem 5.5 we obtain
[TABLE]
for -almost every . Let be the family of probability measures for which . Hence, it follows from (5.4) that
[TABLE]
for -almost every , or equivalently, for -almost every we have
[TABLE]
for -almost every . Because for -almost every , we get from (5.5) that is constant (-a.e.). This shows that the maps have an invariant measure in common, which is a contradiction. Therefore, the exponent of contraction is negative.
We now observe that is an -invariant map and for every , the map is upper semi-continuous. In particular, is -invariant and for every the map is lower semi-continuous. Hence, all conditions required in Theorem 5.1 are met for the map and so we can apply this theorem to get that for every , for -almost every , we have
[TABLE]
where is a subset of . Since for every , we conclude that for every , for -almost every , we have
[TABLE]
It remains to see the existence of a uniform bound as claimed in Theorem 5.4. To this end, we apply Proposition 5.3 to the map to obtain that for every , for -almost every , we have
[TABLE]
We now use the fact that is upper semi-continuous on the second variable to conclude that the map defined by
[TABLE]
is also upper semi-continuous. Because of (5.6), we have that for every . Since any upper semi-continuous map on a compact metric space has a maximum value, we conclude that there is such that
[TABLE]
for every . Therefore, because , it follows from (5.7) that for every , for -almost every , we have
[TABLE]
which is the desired result. ∎
5.2. Proof of Theorem 3
Theorem 3 follows directly from the definition of limit superior and Theorem 5.4.
∎
6. Related and future work
A natural question would be whether we can obtain generalizations of Theorem 3 for non-Markovian random iterations of homeomorphisms of . This question leads us to a general question on ergodic theory. Indeed, recall that we have proved Theorem 3 using a generalization of the Breiman ergodic theorem [8] for Markov chains obtained by Furstenberg in [12, Lemma 7.1]. This result is a kind of Krylov-Bogolyubov theorem for Markov chains and stationary measures. Thus, a good start to generalize Theorem 3 would be to obtain a version for skew products of this Breiman-Furstenberg theorem.
To be more precise, we need some definitions. Let be a measure preserving dynamical system. Consider a measurable space and let be a measurable map. Denote by the map defined by . Then, the map defined by
[TABLE]
is called a random iteration of maps. A probability measure on is called -invariant if has first marginal and is invariant by the skew product map defined by
[TABLE]
The past of a random iteration is the -algebra defined by
[TABLE]
that is, is the smallest -algebra that makes all maps in the above family measurable, see [9] for details. We will say that the disintegration of a -invariant measure with respect to depends only on the past if for every measurable set the map is -measurable.
We recall that if is a product space , is the shift map and is a product measure , then there is a one-to-one correspondence between the set of stationary measures and the set of -invariant measures whose disintegration depends only on the past, see Arnold [5, Theorem 2.1.8]. Note that Theorem 1 combined with [5, Theorem 1.7.2] implies that there is such a correspondence also in the Markovian case.
Thus, when we can not consider stationary measures, it seems natural to take the set of -invariant measures whose disintegration depends only on the past to generalize results on which stationary measures play a role. Having these remarks in mind, we ask the following:
Question**.**
For every , for -almost every , is every accumulation point of
[TABLE]
a -invariant measure whose disintegration depends only on the past?
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Alves, J. F., and Araújo, V. Random perturbations of nonuniformly expanding maps. Astérisque , 286 (2003), xvii, 25–62. Geometric methods in dynamics. I.
- 2[2] Antonov, V. A. Modelling of processes of cyclic evolution type. Synchronization by a random signal. Vestnik Leningrad. Univ. Mat. Mekh. Astronom. , vyp. 2 (1984), 67–76.
- 3[3] Araújo, V. Attractors and time averages for random maps. Ann. Inst. H. Poincaré Anal. Non Linéaire 17 , 3 (2000), 307–369.
- 4[4] Araújo, V., and Aytaç, H. Decay of correlations and laws of rare events for transitive random maps. Nonlinearity 30 , 5 (2017), 1834–1852.
- 5[5] Arnold, L. Random dynamical systems . Springer Monographs in Mathematics. Springer-Verlag, Berlin, 1998.
- 6[6] Barnsley, M. F., Elton, J. H., and Hardin, D. P. Recurrent iterated function systems. Constr. Approx. 5 , 1 (1989), 3–31.
- 7[7] Bocker-Neto, C., and Viana, M. Continuity of Lyapunov exponents for random two-dimensional matrices. Ergodic Theory Dynam. Systems 37 , 5 (2017), 1413–1442.
- 8[8] Breiman, L. The strong law of large numbers for a class of Markov chains. Ann. Math. Statist. 31 (1960), 801–803.
