Precise large deviation asymptotics for products of random matrices
Hui Xiao, Ion Grama, Quansheng Liu

TL;DR
This paper derives precise large deviation asymptotics for the norms of products of i.i.d. random matrices, extending existing results and providing new limit theorems for matrix norms and related quantities.
Contribution
It establishes exact asymptotics for large deviation probabilities of matrix products, including invertible and positive matrices, and improves prior large deviation principles.
Findings
Precise asymptotics for large deviations of $\log | G_n x |\
Enhanced large deviation principles for matrix norms
Derived a local limit theorem with large deviations
Abstract
Let be a sequence of independent identically distributed real random matrices with Lyapunov exponent . For any starting point on the unit sphere in , we deal with the norm , where . The goal of this paper is to establish precise asymptotics for large deviation probabilities , where is fixed and is vanishing as . We study both invertible matrices and positive matrices and give analogous results for the couple with target functions, where . As applications we improve previous results on the large deviation principle for the matrix norm and obtain a precise local limit theorem with large deviations.
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.
11footnotetext: Université de Bretagne-Sud, LMBA UMR CNRS 6205, Vannes, France.22footnotetext: Corresponding author: [email protected]
Precise large deviation asymptotics for
products of random matrices
Hui Xiao1
,
Ion Grama1,2
and
Quansheng Liu1
(Date: March 17, 2024)
Abstract.
Let be a sequence of independent identically distributed real random matrices with Lyapunov exponent . For any starting point on the unit sphere in , we deal with the norm , where . The goal of this paper is to establish precise asymptotics for large deviation probabilities , where is fixed and is vanishing as . We study both invertible matrices and positive matrices and give analogous results for the couple with target functions, where . As applications we improve previous results on the large deviation principle for the matrix norm and obtain a precise local limit theorem with large deviations.
Key words and phrases:
Product of random matrices; Random walk on the general linear group; Random walk on the semigroup of positive matrices; spectral gap; large deviation; Bahadur-Rao theorem.
2010 Mathematics Subject Classification:
Primary 60F10, 60B20; Secondary 60J05
1. Introduction
1.1. Background and main objectives
One of the fundamental results in the probability theory is the law of large numbers. The large deviation theory describes the rate of convergence in the law of large numbers. The most important results in this direction are the Bahadur-Rao and the Petrov precise large deviation asymptotics that we recall below for independent and identically distributed (i.i.d.) real-valued random variables . Let Denote by the set of real numbers such that and by the interior of . Let be the Frenchel-Legendre transform of . Assume that and are related by . Set From the results of Bahadur and Rao [1] and Petrov [31] it follows that if the law of is non-lattice, then the following large deviation asymptotic holds true:
[TABLE]
where and is a vanishing perturbation as Bahadur and Rao [1] have established the equivalence (1.1) with . Petrov improved it by showing that (1.1) holds uniformly in as Actually, Petrov’s result is also uniform in and is therefore stronger than Bahadur-Rao’s theorem even with The relation (1.1) with and its extension to have multiple implications in various domains of probability and statistics. The main goal of the present paper is to establish an equivalence similar to (1.1) for products of i.i.d. random matrices.
Let be a sequence of i.i.d. real random matrices defined on a probability space with common law . Denote by the operator norm of a matrix and by the Euclidean norm in . Set for brevity . The study of asymptotic behavior of the product attracted much attention, since the fundamental work of Furstenberg and Kesten [15], where the strong law of large numbers for has been established. Under additional assumptions, Furstenberg [14] extended it to , for any starting point on the unit sphere A number of noteworthy results in this area can be found in Kesten [28], Kingman [29], Le Page [30], Guivarc’h and Raugi [22], Bougerol and Lacroix [5], Goldsheid and Guivarc’h [17], Hennion [24], Furman [13], Hennion and Hervé [26], Guivarc’h [20], Guivarc’h and Le Page [21], Benoist and Quint [2, 3] to name only a few.
In this paper we are interested in asymptotic behaviour of large deviation probabilities for where . Set For , let Define the convex function , , and consider its Fenchel-Legendre transform Our first objective is to establish the following Bahadur-Rao type precise large deviation asymptotic:
[TABLE]
where and are, respectively, the unique up to a constant eigenfunction and unique probability eigenmeasure of the transfer operator corresponding to the eigenvalue (see Section 2.2 for precise statements). In fact, to enlarge the area of applications in (1.2) it is useful to add a vanishing perturbation for . In this line we obtain the following Petrov type large deviation expansion: under appropriate conditions, uniformly in as
[TABLE]
As an consequence of (1.3) we are able to infer new results, such as large deviation principles for , see Theorem 2.5. From (1.3) we also deduce a local large deviation asymptotic: there exists a sequence converging to [math] such that, uniformly in ,
[TABLE]
Our results are established for both invertible matrices and positive matrices. For invertible matrices, Le Page [30] has obtained (1.2) for small enough under more restrictive conditions, such as the existence of exponential moments of and . The asymptotic (1.2) clearly implies a large deviation result due to Buraczewski and Mentemeier [8] which holds for invertible matrices and positive matrices: for and , there exist two constants such that
[TABLE]
Consider the Markov chain . Our second objective is to give precise large deviations for the couple with target functions. We prove that for any Hölder continuous target function on , and any target function on such that is directly Riemann integrable, it holds that
[TABLE]
As a special case of (1.1) with and compactly supported we obtain Theorem 3.3 of Guivarc’h [20]. With , the indicator function of the interval and , we get the main result in [8].
Our third objective is to establish asymptotics for lower large deviation probabilities: we prove that for with sufficiently close to [math], it holds, uniformly in ,
[TABLE]
This sharpens the large deviation principle established in [5, Theorem 6.1] for invertible matrices. Moreover, we extend the large deviation asymptotic (1.7) to the couple with target functions.
1.2. Proof outline
Our proof is different from the standard approach of Dembo and Zeitouni [11] based on the Edgeworth expansion, which has been employed for instance in [8]. In contrast to [8], we start with the identity
[TABLE]
where is the change of measure defined in Section 3 for the norm cocycle , and . Usually the expectation in the right-hand side of (1.2) is handled via the Edgeworth expansion for the distribution function {\mathbb{Q}_{s}^{x}}\big{(}\frac{\log|G_{n}x|-nq}{\sqrt{n}\sigma_{s}}\leqslant t\big{)}; however, the presence of the multiplier makes this impossible. Our idea is to replace the function with some upper and lower smoothed bounds using a technique from Grama, Lauvergnat and Le Page [18]. For simplicity we deal only with the upper bound , where , for some , and is a density function on the real line satisfying the following properties: the Fourier transform is supported on , has a continuous extension in the complex plane and is analytic in the domain , see Lemma 4.2. Let be the perturbed operator defined by for any Hölder continuous function on the unit sphere Using the inversion formula we obtain the following upper bound:
[TABLE]
where is the -th iteration of . The integral in the right-hand side of (1.2) is decomposed into two parts:
[TABLE]
Since is compactly supported on and is non-arithmetic, the second integral in (1.10) decays exponentially fast to [math]. To deal with the first integral in (1.10), we make use of spectral gap decomposition for the perturbed operator : Taking into account the fact that the remainder term decays exponentially fast to [math], the main difficulty is to investigate the integral:
[TABLE]
To find the exact asymptotic of this integral, we can apply the saddle point method (see Fedoryuk [12]). This is possible, since by the analyticity of the functions and , one can apply Cauchy’s integral theorem to change the integration path so that it passes through the saddle point , which is the unique solution of the saddle point equation .
The lower bound of the integral in (1.2) is a little more delicate, but can be treated in a similar way. The passage to the targeted version is done by using approximation techniques.
We end this section by fixing some notation, which will be used throughout the paper. We denote by , , eventually supplied with indices, absolute constants whose values may change from line to line. By , we mean constants depending only on the index The interior of a set is denoted by . Let . For any integrable function , define its Fourier transform by , . For a matrix , its transpose is denoted by For a measure and a function we write
2. Main results
2.1. Notation and conditions
The space is equipped with the standard scalar product and the Euclidean norm . For , let be the set of matrices with entries in equipped with the operator norm , for , where is the unit sphere.
We shall work with products of invertible or positive matrices (all over the paper we use the term positive in the wide sense, i.e. each entry is non-negative). Denote by the general linear group of invertible matrices of A positive matrix is said to be allowable, if every row and every column of has a strictly positive entry. Denote by the multiplicative semigroup of allowable positive matrices of . We write for the subsemigroup of with strictly positive entries.
Denote by the intersection of the unit sphere with the positive quadrant. To unify the exposition, we use the symbol to denote in the case of invertible matrices, and in the case of positive matrices. The space is equipped with the metric which we proceed to introduce. For invertible matrices, the distance is defined as the angular distance (see [21]), i.e., for any , , where is the angle between and . For positive matrices, the distance is the Hilbert cross-ratio metric (see [24]) defined by , where , for any two vectors and in .
Let be the space of continuous functions on . We write for the identity function , . Throughout this paper, let be a fixed small constant. For any , set
[TABLE]
and introduce the Banach space
For and , write for the projective action of on . For any , set For both invertible matrices and allowable positive matrices, it holds that Note that for any invertible matrix , we have .
Let be a sequence of i.i.d. random matrices of the same probability law on . Set for Our goal is to establish, under suitable conditions, a large deviation equivalence similar to (1.1) for the norm cocycle for invertible matrices and positive matrices. In both cases, we denote by the smallest closed semigroup of generated by (the support of ), that is, .
Set
[TABLE]
Applying Hölder’s inequality to , it is easily seen that is an interval. We make use of the following exponential moment condition:
A1**.**
There exist and such that
For invertible matrices, we introduce the following strong irreducibility and proximality conditions, where we recall that a matrix is said to be proximal if it has an algebraic simple dominant eigenvalue.
A2**.**
(i)(Strong irreducibility)* No finite union of proper subspaces of is -invariant.*
(ii)(Proximality)* contains at least one proximal matrix. *
The conditions of strong irreducibility and proximality are always satisfied for . If is proximal, denote by its dominant eigenvalue and by the associated normalized eigenvector (). In fact, is proximal iff the space can be decomposed as such that and the spectral radius of on the invariant subspace is strictly less than . For invertible matrices, condition 2 implies that the Markov chain has a unique -stationary measure, which is supported on
[TABLE]
For positive matrices, introduce the following condition:
A3**.**
(i) (Allowability)* Every is allowable.*
(ii) (Positivity)* contains at least one matrix belonging to .*
It can be shown (see [7, Lemma 4.3]) that for positive matrices, condition 3 ensures the existence and uniqueness of the invariant measure for the Markov chain supported on
[TABLE]
In addition, is the unique minimal -invariant subset (see [7, Lemma 4.2]). According to the Perron-Frobenius theorem, a strictly positive matrix always has a unique dominant eigenvalue, so condition 3(ii) implies condition 2(ii) for .
For any , for invertible matrices and for positive matrices, the following limit exists (see [21] and [8]):
[TABLE]
The function is convex and analytic on (it plays the same role as the -Laplace transform of in the real i.i.d. case). Introduce the Fenchel-Legendre transform of by We have that if for some , which implies on since and is convex on .
We say that the measure is arithmetic, if there exist , and a function such that for any and any , we have For positive matrices, we need the following condition:
A4**.**
(Non-arithmeticity)* The measure is non-arithmetic.*
A simple sufficient condition established in [28] for the measure to be non-arithmetic is that the additive subgroup of generated by the set is dense in (see [8, Lemma 2.7]).
Note that for positive matrices, condition 4 is used to ensure that . For invertible matrices, condition 2 implies the non-arithmeticity of the measure , hence, is also strictly positive (for a proof see Guivarc’h and Urban [23, Proposition 4.6]).
For any , the transfer operator and the conjugate transfer operator are defined, for any and , by
[TABLE]
which are bounded linear on . Under condition 2 for invertible matrices, or condition 3 for positive matrices, the operator has a unique probability eigenmeasure on corresponding to the eigenvalue : Similarly, the operator has a unique probability eigenmeasure corresponding to the eigenvalue : Set, for ,
[TABLE]
Then, is the unique, up to a scaling constant, strictly positive eigenfunction of : ; similarly is the unique, up to a scaling constant, strictly positive eigenfunction of : . We refer for details to Section 3.
Below we shall also make use of normalized eigenfunction defined by , , which is strictly positive and Hölder continuous on the projective space , see Proposition 3.1.
2.2. Large deviations for the norm cocycle
The following theorem gives the exact asymptotic behavior of the large deviation probabilities for the norm cocycle.
Theorem 2.1**.**
Assume that satisfies either conditions 1, 2 for invertible matrices, or conditions 1, 3, 4 for positive matrices. Let , where . Then for any positive sequence satisfying , we have, as , uniformly in and ,
[TABLE]
In particular, with , as , uniformly in ,
[TABLE]
The rate function admits the following expansion: for and in a small neighborhood of [math], we have
[TABLE]
where is the Cramér series, with and defined in Proposition 3.3. We refer for details to Lemma 4.1, where the coefficients are given in terms of the cumulant generating function .
For invertible matrices, a point-wise version of (2.3), without and with , namely the asymptotic (1.2), has been first established by Le Page [30, Theorem 8] for small enough under a stronger exponential moment condition. For positive matrices, the asymptotic (2.3) is new and implies the large deviation bounds (1.5) established in Buraczewski and Mentemeier [8, Corollary 3.2]. We note that there is a misprint in [8], where should be replaced by .
Now we consider the precise large deviations for the couple with target functions and on and , respectively.
Theorem 2.2**.**
Assume the conditions of Theorem 2.1 and let for . Then, for any , any measurable function on such that is directly Riemann integrable, and any positive sequence satisfying , we have, as , uniformly in and ,
[TABLE]
With and for we obtain Theorem 2.1. For invertible matrices and with , Theorem 2.2 strengthens the point-wise large deviation result stated in Theorem 3.3 of Guivarc’h [20], since we do not assume the function to be compactly supported and our result is uniform in . By the way we would like to remark that in Theorem 3.3 of [20] should be replaced by , and should be replaced by . For positive matrices, Theorem 2.2 is new. Since is a strictly positive and Hölder continuous function on (see Proposition 3.1), taking and , in Theorem 2.2, we get the main result of [8] (Theorem 3.1).
Unlike the case of i.i.d. real-valued random variables, Theorems 2.1 and 2.2 do not imply the similar asymptotic for lower large deviation probabilities , where . To formulate our results, we need an exponential moment condition, as in Le Page [30]. For , set , which reduces to for invertible matrices.
A5**.**
There exists a constant such that .
Under condition 5, the functions and can be extended analytically in a small neighborhood of [math] of the complex plane; in this case the expansion (2.4) still holds and we have for small enough. We also need to extend the function for small , which is positive and Hölder continuous on the projective space , as in the case of : we refer to Proposition 3.2 for details.
Theorem 2.3**.**
Assume that satisfies either conditions 2, 5 for invertible matrices or conditions 3, 4, 5 for positive matrices. Then, there exists such that for any and , for any positive sequence satisfying , we have, as , uniformly in and ,
[TABLE]
In particular, with , as , uniformly in ,
[TABLE]
For invertible matrices, this result sharpens the large deviation principle established in [5]. For positive matrices, our result is new, even for the large deviation principle.
More generally, we also have the precise large deviations result for the couple with target functions.
Theorem 2.4**.**
Assume the conditions of Theorem 2.3. Then, there exists such that for any and , for any , any measurable function on such that is directly Riemann integrable, and any positive sequence satisfying , we have, as , uniformly in and ,
[TABLE]
With and for we obtain Theorem 2.3.
2.3. Applications to large deviation principle for the matrix norm
We use Theorems 2.1 and 2.3 to deduce large deviation principles for the matrix norm . Our first result concerns the upper tail and the second one deals with lower tail.
Theorem 2.5**.**
Assume the conditions of Theorem 2.1. Let , where . Then, for any positive sequence with as , we have, uniformly in ,
[TABLE]
For invertible matrices, with , Theorem 2.5 improves the large deviation bounds in Benoist and Quint [3, Theorem 14.19], where the authors consider general groups, but without giving the rate function. For positive matrices, the result is new for and .
Theorem 2.6**.**
Assume the conditions of Theorem 2.3. Then, there exists such that for any and , for any positive sequence with as , we have, uniformly in ,
[TABLE]
This result is new for both invertible matrices and positive matrices.
2.4. Local limit theorems with large deviations
Local limit theorems and large and moderate deviations for sums of i.i.d. random variables have been studied by Gnedenko [16], Sheep [34], Stone [35], Breuillard [6], Borovkov and Borovkov [4]. Moderate deviation results in the local limit theorem for products of invertible random matrices have been obtained in [3, Theorems 17.9 and 17.10].
Taking and where and do not depend on , it is easy to understand that Theorem 2.2 becomes, in fact, a statement on large deviations in the local limit theorem. It turns out that with the Petrov type extension (2.2) we can derive the following more general statement where can increase with
Theorem 2.7**.**
Assume conditions of Theorem 2.1 and let . Then there exists a sequence converging to [math] as such that, for any , for any positive sequence with as and any fixed , we have, as uniformly in , and ,
[TABLE]
Taking , as uniformly in , and ,
[TABLE]
We can compare this result with Theorem 3.3 in [20], from which the above equivalence can be deduced for and fixed.
It is easy to see that, under additional assumption 5, the assertion of Theorem 2.7 remains true for small enough. This can be deduced from Theorem 2.4: the details are left to the reader.
3. Spectral gap theory for the norm
3.1. Properties of the transfer operator
Recall that the transfer operator and the conjugate operator are defined by (2.1). Below stands for the measure on such that for continuous functions on , and is defined similarly. The following result was proved in [7, 8] for positive matrices, and in [21] for invertible matrices.
Proposition 3.1**.**
Assume that satisfies either conditions 1, 2 for invertible matrices, or conditions 1, 3 for positive matrices. Let . Then the spectral radii and are both equal to , and there exist a unique, up to a scaling constant, strictly positive Hölder continuous function and a unique probability measure on such that
[TABLE]
Similarly, there exist a unique strictly positive Hölder continuous function and a unique probability measure on such that
[TABLE]
Moreover, the functions and are given by
[TABLE]
It is easy to see that the family of kernels satisfies the following cocycle property:
[TABLE]
The equation implies that, for any and , the probability measures form a projective system on . By the Kolmogorov extension theorem, there is a unique probability measure on , with marginals ; denote by the corresponding expectation.
If denotes the coordinate process on the space of trajectories , then the sequence is i.i.d. with the common law under However, for any and , the sequence is Markov-dependent under the measure . Let
[TABLE]
By the definition of , for any bounded measurable function on , it holds that
[TABLE]
Under the measure , the process is a Markov chain with the transition operator given by
[TABLE]
It has been proved in [7] for positive matrices, and in [21] for invertible matrices, that has a unique invariant probability measure supported on and that, for any ,
[TABLE]
Moreover, letting from the results of [7, 21], it follows that, under the assumptions of Theorem 2.1, for any , we have -a.s. and -a.s., where .
When for small enough , define the transfer operator as follows: for any ,
[TABLE]
which is well-defined under condition 5. The following proposition is proved in [36].
Proposition 3.2**.**
Assume that satisfies either conditions 2, 5 for invertible matrices, or conditions 3, 5 for positive matrices. Then there exists such that for any , the spectral radius of the operator is equal to . Moreover there exist a unique, up to a scaling constant, strictly positive Hölder continuous function and a unique probability measure on such that
[TABLE]
Based on Proposition 3.2, in the same way as for , one can define the measure for negative values sufficiently close to [math], and one can extend the change of measure formula (3.1) to . Under the measure , the process is a Markov chain with the transition operator and the assertion (3.3) holds true. We refer to [36] for details.
3.2. Spectral gap of the perturbed operator
Recall that the Banach space consists of all -Hölder continuous function on , where is a fixed small constant. Denote by the set of all bounded linear operators from to equipped with the operator norm . For and with , define a family of perturbed operators as follows: for any ,
[TABLE]
It follows from the cocycle property (3.1) that
[TABLE]
The following proposition collects useful assertions that we will use in the proofs of our results. Denote .
Proposition 3.3**.**
Assume that satisfies either conditions 1, 2 for invertible matrices, or conditions 1, 3 for positive matrices. Then, there exists such that for any ,
[TABLE]
Moreover, for any , the following assertions hold:
- (i)
* is a rank-one projection for , with for any and , and*
[TABLE]
For any fixed , there exist and such that
[TABLE]
In addition, the mappings and are analytic in the strong operator sense.
- (ii)
For any compact set , there exists a constant such that for any and , we have
[TABLE]
- (iii)
*The mapping is analytic, and *
[TABLE]
where
[TABLE]
and
[TABLE]
In addition, if the measure is non-arithmetic, then the asymptotic variance is strictly positive.
The assertions (i), (ii), (iii) of Proposition 3.3, except (3.6), have been proved in [8] for imaginary-valued , based on the perturbation theory (see [25]). The assertions (i), (iii) can be extended to the complex-valued without changes in the proof in [8].
The identity (3.6) is not proved in [8], but can be obtained by using the arguments from [36]. By the perturbation theory, the operator and its spectral radius can be extended to and the eigenvalue , respectively, with in the small neighborhood of [math], see [21]. By the definitions of and using the change of measure (3.1), we obtain for any , , and ,
[TABLE]
Since is uniformly bounded, using (3.7) and the fact that is the unique eigenvalue of , we deduce (3.6).
For negative values sufficiently close to [math], we can define the perturbed operator as in (3.4). The following spectral gap property of is established in [36].
Proposition 3.4**.**
Assume that satisfies conditions 2, 5 for invertible matrices, or conditions 3, 5 for positive matrices. Then, there exist and such that for any and ,
[TABLE]
Moreover, for any , the assertions (i), (ii), (iii) of Proposition 3.3 hold true.
4. Proof of Theorems 2.1 and 2.3
4.1. Auxiliary results
We need some preliminary statements. Following Petrov [32], under the changed measure , define the Cramér series by
[TABLE]
where and . The following lemma gives a full expansion of in terms of power series in in a neighborhood of [math], for and , where is from Proposition 3.4.
Lemma 4.1**.**
Assume conditions of Theorem 2.1 or Theorem 2.3. Let . Then, there exists such that, for any
[TABLE]
*where is linked to the Cramér series by the identity *
[TABLE]
Proof.
Let be the inverse function of With the notation , we have . By the definition of , it follows that . This, together with and Taylor’s formula, gives
[TABLE]
From and , we deduce that , so that, by Taylor’s formula,
[TABLE]
The rest of the proof is similar to that in Petrov [32] (chapter VIII, section 2). For small enough, the equation (4.3) has a unique solution given by
[TABLE]
Together with (4.2) and (4.3), this implies
[TABLE]
∎
Let us fix a non-negative Schwartz function on with , whose Fourier transform is supported on and has a continuous extension in the complex plane. Moreover, is analytic in the domain . Such a function can be constructed as follows. On the real line define if , and elsewhere. The function is compactly supported and has finite derivatives of all orders. Its inverse Fourier transform , however, is not non-negative. Let be the convolution of with itself. It is supported by and its inverse Fourier transform satisfies . We show below that has a continuous extension in the complex plane, and is analytic in the domain . Finally we rescale and renormalize by setting for .
Lemma 4.2**.**
* has a continuous extension in the complex plane, and is analytic in the domain .*
Proof.
The function can be extended to the complex plane as follows:
[TABLE]
It is easily verified that is continuous in the interior of the unit disc and outside it, but is not continuous at any point on the unit circle . Note also that is uniformly bounded on . Recall that the function is defined on the real line. We extend it to the complex plane by setting The latter integral is well defined for any , since is bounded. We are going to show that is continuous in . For any fixed and with small, we write
[TABLE]
The set of points of discontinuity of the function consists of at most two points. For any , , by the definition of , we have that as . Since the Lebesgue measure of is [math], applying the Lebesgue dominated convergence theorem and taking into account the boundedness of the function on , we see that is continuous in the complex plane.
We next show that is analytic in the domain . Fix . Let . Denote . One can verify that the derivative exists and is uniformly bounded by on the domain . For any with small enough, we have
[TABLE]
Since for any and , we have uniformly in . This implies that and thus is bounded, uniformly in and . Applying twice the Lebesgue dominated convergence theorem, we obtain that exists and is given by . Hence is analytic in the domain . ∎
For any , define the density , whose Fourier transform has a compact support in and is analytically extendable in a neighborhood of [math]. For any non-negative integrable function , following the paper [19], we introduce two modified functions related to and establish some two-sided bounds. For any and , set and
[TABLE]
Lemma 4.3**.**
Suppose that is a non-negative integrable function and that and are measurable for any , then for sufficiently small , there exists a positive constant with as , such that, for any ,
[TABLE]
The proof of the above lemma, being similar to that of Lemma 5.2 in [18], will not be detailed here.
The next assertion is the key point in establishing Theorem 2.1. Its proof is based on the spectral gap properties of the perturbed operator (see Proposition 3.3) and on the saddle point method, see Daniels [10], Richter [33], Ibragimov and Linnik [27] and Fedoryuk [12]. Let us introduce the necessary notation. In the following, let be a -Hölder continuous function on . Assume that is a continuous function with compact support in , and moreover, has a continuous extension in some neighborhood of [math] in the complex plane and can be extended analytically to the domain for some small . Recall that is the invariant measure of the Markov chain under the changed measure , see (3.3).
Proposition 4.4**.**
*Assume conditions of Theorem 2.1. Let , where Then, for any positive sequence satisfying as , we have, uniformly in , and , *
[TABLE]
Proof.
Denote . Taking sufficiently small , we write
[TABLE]
For , since is bounded and compactly supported on the real line, taking into account Proposition 3.3 (ii), the fact and equality (4.1), we get
[TABLE]
For , by Proposition 3.3 (i), we have
[TABLE]
Set for brevity . It follows that
[TABLE]
For the second term , applying Proposition 3.3 (i), we get that there exist constants and such that
[TABLE]
Combining this with the continuity of the function at the point [math] and the fact , we obtain that, uniformly in , and ,
[TABLE]
For the first term , we shall use the method of steepest descends to derive a precise asymptotic expansion. We make a change of variable to rewrite as an integral over the complex interval
[TABLE]
where (we choose the branch where ), which is an analytic function for by Proposition 3.3 (iii). Since the function is analytic in the neighborhood of [math], and the function has an analytic extension in the domain and has a continuous extension in the domain , by Cauchy’s integral theorem we can choose a special path of the integration which passes through the saddle point of the function . From (3.6), we have
[TABLE]
which implies that for ,
[TABLE]
where and . From this Taylor’s expansion and the fact that , it follows that the function is convex in the neighborhood of [math]. Consider the saddle point equation
[TABLE]
An equivalent formulation of (4.12) is , which by simple series inversion techniques gives the following solution:
[TABLE]
From (4.13), it follows that the solution is real for sufficiently small and that as Moreover, for sufficiently small , and for sufficiently small . By Cauchy’s integral theorem, can be rewritten as
[TABLE]
where , and . By (4.11), we get , which implies that , when is sufficiently small. Combining this with (4.13) and the continuity of in the neighborhood of [math] yields that, for sufficiently small , , for any . Since, for sufficiently small , , we get that, for , . Moreover, using the continuity of the function in a small neighborhood of [math] in the complex plane, there exists a constant such that, on and , we have . Therefore, we obtain, for sufficiently large, uniformly in and ,
[TABLE]
It follows that
[TABLE]
Without loss of generality, assume that . Making a change of variable gives
[TABLE]
From (4.12) and (4.13), we have . By Taylor’s formula, we get that for ,
[TABLE]
Using and (4.11), it follows that
[TABLE]
Combining this with (4.13) and Lemma 4.1 gives . Thus
[TABLE]
Since , for small enough , and , we obtain that . Therefore, using (4.15) and the fact that uniformly in , the function is continuous in a neighborhood of [math] in the complex plane, we obtain that, uniformly in and ,
[TABLE]
This, together with (4.1)-(4.15), implies
[TABLE]
Noting that and , we write
[TABLE]
We give a control of . Note that is bounded by , uniformly in . Note also that for and for large enough , we have . Hence using the inequality yields
[TABLE]
Now we control . Recalling that , using the fact that uniformly with respect to , the map is continuous in the neighborhood of [math] in the complex plane, we get that for ,
[TABLE]
We then obtain
[TABLE]
It is easy to see that . This, together with (4.1)-(4.17), proves that The desired result follows by combining this with (4.1)-(4.9). ∎
Assume that the functions and satisfy the same properties as in Proposition 4.4. The following result, for small enough, will be used to prove Theorem 2.3.
Proposition 4.5**.**
Assume conditions of Theorem 2.3. Then, there exists such that for any , and for any positive sequence satisfying as , we have, uniformly in , and ,
[TABLE]
Proof.
Using Propositions 3.2 and 3.4, the proof of Proposition 4.5 can be carried out as the proof of Proposition 4.4. We omit the details. ∎
4.2. Proof of Theorem 2.1
Recall that , , and , as . Taking into account that and using the change of measure (3.1), we write
[TABLE]
Setting and , from (4.2) we get
[TABLE]
Upper bound. Let and be defined as in (4.5) but with instead of . Using Lemma 4.3 leads to
[TABLE]
Denote by the Fourier transform of . Elementary calculations give
[TABLE]
By the inversion formula, for any
[TABLE]
Substituting , taking expectation with respect to , and using Fubini’s theorem, we get
[TABLE]
where
[TABLE]
Note that is compactly supported in since has a compact support. One can verify that has an analytic extension in a neighborhood of [math]. By Lemma 4.2, we see that the function has a continuous extension in the complex plane, and has an analytic in the domain . Using Proposition 4.4 with and , it follows that
[TABLE]
Since , from (4.19)-(4.23), we have that for sufficiently small ,
[TABLE]
Letting and noting that , we obtain the upper bound:
[TABLE]
Lower bound. For , let be defined as in (4.5) with instead of . From (4.19) and Lemma 4.3, we get
[TABLE]
For the first term , applying (4.22) with replaced by , we get
[TABLE]
In the same way as for the upper bound, using and Proposition 4.4 with and (one can check that the functions and satisfy the required conditions in Proposition 4.4), we obtain the lower bound:
[TABLE]
For the second term , noting that and applying Lemma 4.3 to , we get . We use the same argument as in (4.22) to obtain
[TABLE]
Notice that, from Lemma 4.1, for any fixed , it holds, uniformly in satisfying , that as . Applying Proposition 4.4 again with , , and using the Lebesgue dominated convergence theorem, we obtain
[TABLE]
since is integrable on . This, together with (4.2)-(4.26), implies the lower bound:
[TABLE]
as required. We conclude the proof of Theorem 2.1 by combining (4.24) and (4.27).
4.3. Proof of Theorem 2.3
Since the change of measure formula can be extended for small , under the conditions of Theorem 2.3, we have, similar to (4.2),
[TABLE]
Applying Proposition 4.5, we can follow the proof of Theorem 2.1 to show Theorem 2.3. We omit the details.
5. Proof of Theorems 2.2 and 2.4
We first establish the following assertion which will be used to prove Theorem 2.2, but which is of independent interest. Let be a measurable function on and Denote, for brevity, and
[TABLE]
Introduce the following condition: for any and the functions and are measurable and
[TABLE]
Theorem 5.1**.**
Suppose the assumptions of Theorem 2.1 hold true. Let , where . Assume that is a Hölder continuous function on and is a measurable function on satisfying condition (5.1). Then, for any positive sequence satisfying , we have
[TABLE]
Before proceeding with the proof of this theorem, let us give some examples of functions satisfying condition (5.1). It is easy to see that (5.1) holds for increasing non-negative functions satisfying in particular, for the indicator function , , where is a fixed constant. Another example for which (5.1) holds true is when is non-negative, continuous and there exists such that
[TABLE]
where the function is assumed to be measurable.
Proof of Theorem 5.1.
Without loss of generality, we assume that both and are non-negative (otherwise, we decompose the functions and ). Let . Since , using the change of measure (3.1), we have
[TABLE]
For brevity, set , and . Then,
[TABLE]
Upper bound. We wish to write the expectation in (5.4) as an integral of the Fourier transform of which, however, may not belong to the space . As in the proof of Theorem 2.1 (see Section 4.2), we make use of the convolution technique to overcome this difficulty. Applying Lemma 4.3 to , one has, for sufficiently small ,
[TABLE]
where , . Using the same arguments as for deducing (4.22), we have
[TABLE]
where and is the Fourier transform of . Note that is strictly positive and -Hölder continuous function on , and has a compact support in . Applying Proposition 4.4 with and (one can verify that the functions and satisfy the required conditions in Proposition 4.4), we obtain
[TABLE]
Since and , letting go to [math], using the condition (5.1) and the fact that as , we get the upper bound:
[TABLE]
Lower bound. Denote . From (5.4), using Lemma 4.3, we get
[TABLE]
For , we proceed as for (5) and (5.6), with replaced by . Using Proposition 4.4, with and and the fact that and , in an analogous way as in (5.7), we obtain that
[TABLE]
where the last convergence is due to the condition (5.1). For , noting that , applying Lemma 4.3 to we get . Similarly to (5.6), we show that
[TABLE]
From Lemma 4.1, for any fixed , it holds that , uniformly in as . Applying Proposition 4.4 with and , it follows, from the Lebesgue dominated convergence theorem, that
[TABLE]
as . Combining this with (5)-(5), we get the lower bound
[TABLE]
Putting together (5.7) and (5.10), and noting that , the result follows. ∎
In the sequel, we deduce Theorem 2.2 from Theorem 5.1 using approximation techniques.
Proof of Theorem 2.2.
Without loss of generality, we assume that and . Let , . We construct two step functions as follows: for any , and , set
[TABLE]
By the definition of the direct Riemann integrability, the following two limits exist and are equal:
[TABLE]
Since is directly Riemann integrable, we have . Let be fixed. Denote , I_{m}^{-}=\big{(}m\eta-\frac{\varepsilon}{M4^{|m|}},m\eta\big{)}, and I_{m}^{+}=\big{[}m\eta,m\eta+\frac{\varepsilon}{M4^{|m|}}\big{)}, . Set , . For the step function , in the neighborhood of every possible discontinuous point , , if , then for any , , we define
[TABLE]
If , then we define
[TABLE]
From this construction, the non-negative continuous function satisfies and . Similarly, for the step function , one can construct a non-negative continuous function which satisfies and . Consequently, in view of (5.11), we obtain that, for small enough,
[TABLE]
For brevity, set and . Recalling that , we write
[TABLE]
To control , we shall verify the conditions of Theorem 5.1. Noting that the function is non-negative and continuous, it remains to check the condition (5.3). By the construction of one can verify that there exists a constant such that
[TABLE]
where the series is finite since the function is directly Riemann integrable. Hence, applying Theorem 5.1 to , we get
[TABLE]
For , recall that . Using (5.12) and the fact that is uniformly bounded on , we get that there exists a constant such that
[TABLE]
For , note that , . Combining this with the positivity of , it holds that
[TABLE]
Using (5.15), it holds that, as , , uniformly in and . For , note that the function is non-negative and continuous. By the construction of , similarly to (5), one can verify that there exists such that We deduce from Theorem 5.1 that as , uniformly in and . For , we use (5.12) to get that . Consequently, we obtain that, as , , uniformly in and . This, together with (5), (5.15)-(5.16), implies that
[TABLE]
Since is arbitrary, we conclude the proof of Theorem 2.2. ∎
Proof of Theorem 2.4.
Following the proof of Theorem 5.1, one can verify that the asymptotic (5.1) holds true for small enough and for satisfying condition (5.1). The passage to a directly Riemann integrable function can be done by using the same approximation techniques as in the proof of Theorem 2.2. ∎
6. Proof of Theorems 2.5, 2.6 and 2.7
Proof of Theorems 2.5 and 2.6.
We first give a proof of Theorem 2.5. Since and the function is strictly positive and uniformly bounded on , applying Theorem 2.1 we get the lower bound:
[TABLE]
For the upper bound, since all matrix norms are equivalent, there exists a positive constant which does not depend on the product such that where is the canonical orthonormal basis in . From this inequality, we deduce that
[TABLE]
Using Lemma 4.1, we see that there exists a constant such that , uniformly in and . Again by Theorem 2.1, we obtain the upper bound:
[TABLE]
This, together with (6.1), proves Theorem 2.5. Using Theorem 2.3, the proof of Theorem 2.6 can be carried out in the same way. ∎
Proof of Theorem 2.7.
Without loss of generality, we assume that the function is non-negative. From Theorem 2.2, we deduce that there exists a sequence , determined by the matrix law such that as and, uniformly in , and , it holds that
[TABLE]
Taking the difference of (6) with and with , we get, as ,
[TABLE]
where
[TABLE]
An elementary analysis using Lemma 4.1 shows that
[TABLE]
uniformly in and , for any converging to [math] slowly enough (). This concludes the proof of Theorem 2.7. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bahadur R. R., Rao R. R.: On deviations of the sample mean. The Annals of Mathematical Statistics , 31(4), 1015-1027, 1960.
- 2[2] Benoist Y., Quint J. F.: Central limit theorem for linear groups. The Annals of Probability , 44(2), 1308-1340, 2016.
- 3[3] Benoist Y., Quint J. F.: Random walks on reductive groups. Springer International Publishing , 2016.
- 4[4] Borovkov A. A., Borovkov K. A.: Asymptotic analysis of random walks. Cambridge University Press , 2008.
- 5[5] Bougerol P., Lacroix J.: Products of random matrices with applications to Schrödinger operators. Birkhäuser Boston, 1985.
- 6[6] Breuillard E.: Distributions diophantiennes et théorème limite local sur ℝ d superscript ℝ 𝑑 \mathbb{R}^{d} . Probability Theory and Related Fields , 132(1): 13-38, 2005.
- 7[7] Buraczewski D., Damek E., Guivarc’h Y., Mentemeier S.: On multidimensional Mandelbrot cascades. Journal of Difference Equations and Applications , 20(11), 1523-1567, 2014.
- 8[8] Buraczewski D., Mentemeier S.: Precise large deviation results for products of random matrices. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques . Vol. 52, No. 3, 1474-1513, 2016.
