Hilbert Space Lyapunov Exponent stability
Gary Froyland, Cecilia Gonz\'alez-Tokman, Anthony Quas

TL;DR
This paper investigates how small Gaussian noise affects the stability of Lyapunov exponents and Oseledets spaces in cocycles of compact operators on infinite-dimensional Hilbert spaces, establishing convergence results.
Contribution
It provides the first known results on the stability of Lyapunov exponents and Oseledets spaces under noise for infinite-dimensional operator cocycles.
Findings
Lyapunov exponents converge as noise diminishes
Oseledets spaces converge in probability
Addresses challenges unique to infinite-dimensional spaces
Abstract
We study cocycles of compact operators acting on a separable Hilbert space, and investigate the stability of the Lyapunov exponents and Oseledets spaces when the operators are subjected to additive Gaussian noise. We show that as the noise is shrunk to 0, the Lyapunov exponents of the perturbed cocycle converge to those of the unperturbed cocycle; and the Oseledets spaces converge in probability to those of the unperturbed cocycle. This is, to our knowledge, the first result of this type with cocycles taking values in operators on infinite-dimensional spaces. The infinite dimensionality gives rise to a number of substantial difficulties that are not present in the finite-dimensional case.
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
TopicsQuantum chaos and dynamical systems · Mathematical Dynamics and Fractals · Stability and Controllability of Differential Equations
Hilbert Space Lyapunov Exponent stability
Gary Froyland
,
Cecilia González-Tokman
and
Anthony Quas
Abstract.
We study cocycles of compact operators acting on a separable Hilbert space, and investigate the stability of the Lyapunov exponents and Oseledets spaces when the operators are subjected to additive Gaussian noise. We show that as the noise is shrunk to 0, the Lyapunov exponents of the perturbed cocycle converge to those of the unperturbed cocycle; and the Oseledets spaces converge in probability to those of the unperturbed cocycle. This is, to our knowledge, the first result of this type with cocycles taking values in operators on infinite-dimensional spaces. The infinite dimensionality gives rise to a number of substantial difficulties that are not present in the finite-dimensional case.
1. Introduction
A question of paramount importance in applied mathematics is: How to tell if the conclusions derived from a model indeed capture relevant features of an underlying system? Stability results address this question by giving conditions under which small changes in a model entail small changes in the outcomes of the analysis.
In the last decade, multiplicative ergodic theory has been developed in the so-called semi-invertible setting (that is the setting in which the underlying base dynamics are assumed to be invertible, but no invertibility assumptions are made on the matrices) [12, 13, 16, 17] with the aim of providing a useful mathematical tool to analyse transport features of complex real world systems, such as geophysical flows. This approach has been implemented to find coherent structures in fluid flow [14], and a finite-time version of this theory has been used to detect atmospheric vortices and oceanic eddies in geophysical flows [15, 11].
However, from the mathematical perspective, the following questions remain completely unsolved:
- •
Model or data errors: Do these structures – obtained using either models of geophysical flows or observational data, both of which contain errors – correspond to real features of the underlying flows?
- •
Numerical errors: Are these structures robust to numerical errors in the numerical schemes applied to the models or observational data in order to extract the ergodic-theoretic objects?
The aim of this work is to provide an initial step in establishing conditions for the stability of Lyapunov exponents and so-called Oseledets spaces, the essential components underlying multiplicative ergodic theory, in an infinite-dimensional context. The infinite dimensionality aspect is crucial to be able to eventually encompass the setting of transfer operators – a powerful mathematical tool used to model transport in dynamical systems. In the infinite-dimensional context, and aside from works focusing exclusively on the i.i.d. perturbation (noise) setting, stability results have only been established either (i) under uniform hyperbolicity assumptions on the underlying cocycle, which for example cover the case of random perturbations of a fixed map [1, 6]; or (ii) for the top (first) component of the splitting, in the context of transfer operators [9], where the leading Lyapunov exponent is always 0, corresponding to a random fixed point.
Early results concerning stability of Lyapunov exponents for finite-dimensional (matrix) cocycles include [25, 20, 21, 18]. In the setting of invertible matrix cocycles, the closest results to this work are due to Ledrappier, Young and Ochs [26, 23, 24]. The difficulty of the stability problem at hand, even in the finite-dimensional setting, is highlighted by the existence of negative stability results for Lyapunov exponents of matrix cocycles [3, 4], which show that for non-uniformly hyperbolic cocycles, carefully chosen arbitrarily small perturbations may collapse the entire spectrum of Lyapunov exponents to a single exponent. In this finite-dimensional setting, the stability problem remains an active topic of research, and related recent results include [5, 2]. In the setting of semi-invertible matrix cocycles, the authors established stability results under stochastic perturbations in [10, 8].
In this paper, we study cocycles taking values in compact operators on a separable Hilbert space. The unperturbed cocycle is assumed to be strongly coercive, with exponentially-decaying transmission between higher order modes, so that the leading Oseledets spaces tend to be concentrated on low order modes. This issue of the cocycle sending an arbitrarily high-order mode to a low-order mode does not arise in the finite-dimensional setting. Additionally, unlike the finite-dimensional case, there is no natural Lebesgue-like measure on the infinite-dimensional space of perturbations. Hence as our model of noise we use additive Gaussian perturbations. The Gaussian nature of the perturbations allows for unbounded changes, and is also convenient for calculations. In order to maintain the noise as a small perturbation, the Gaussian perturbations are required to have stronger exponential decay than the unperturbed cocycle. We regard the model as a natural generalisation of the finite-dimensional Ledrappier-Young setting to infinite dimensions.
The main results of the paper, Theorems A and B, yield, respectively, convergence of Lyapunov exponents and Oseledets spaces of the randomly perturbed cocycles. The method of proof of stability of Lyapunov exponents builds on the work of Ledrappier and Young [23], which dealt with Lyapunov exponents in invertible matrix cocycles, as well as on our recent work [10], which had to handle the complications arising from non-invertibility of the matrices. The motivation for studying the case of non-invertible matrices is that transfer operators are generally not invertible. The strategies in all three papers, [23, 10] and this one, are similar in spirit: The idea is to split long sequences of matrices observed along the cocycle into good and bad blocks, depending on whether or not the long term behaviour of the cocycle corresponds to the observed behaviour within the block, and then handle carefully the concatenations. However, at the technical level, there are substantial complications arising from the need to handle wild perturbations occurring in possibly higher and higher modes.
As in the previous works [24, 10], the stability of Oseledets spaces is deduced from the stability of the Lyapunov exponents, but the strategy of the proof here is different. The approach of Ochs [24] applies only to invertible matrices, and the proof is essentially finite-dimensional. The core of the argument is: if the perturbed slowest Oseledets spaces were often far from its unperturbed counterpart, the contribution to the bottom exponent of the perturbed system on this part of the base space would be at least . Hence, convergence of the exponents implies the perturbed and unperturbed slow spaces are mostly nearby. This is basically an expectation argument. Subsequent Oseledets spaces are similarly controlled using exterior powers. The approach of [10] in the context of not necessarily invertible matrices relies on the use of Möbius transformations or graph transforms. The essence of the argument is one fixes all of the perturbations to the matrices other than the perturbation at time . Since there is exponential contraction in a cone around the unperturbed fast space (that is the span of the -dimensional Oseledets spaces with largest Lyapunov exponents), all but a very small set of perturbations at time cause the fast space to fall into the basin of attraction, and to end up near the unperturbed fast space. While this approach would still apply in the infinite-dimensional case, the new argument of this paper has the advantages that it is simpler and more general; in particular, it does not rely on any special structure for the perturbations, such as absolute continuity, which played a role in [10]. All that is required is that the perturbations are small with high probability. The approach in the current paper goes as follows: if the perturbed -dimensional fast space is not close to the unperturbed fast space at time (where is the block size), then the minimum angle between the perturbed fast space at time and the unperturbed slow space at time must be small. For this to happen, the minimum angle between the perturbed fast space at time 0 and the unperturbed slow space at time 0 has to be exponentially small. Whenever this happens, there is a growth drop of the -dimensional volume of order over this block. An expectation argument ensures that this must happen rarely because otherwise the perturbed would be much less than the unperturbed .
2. The model and principal results
Throughout the paper is an invertible measurable transformation, is an ergodic invariant measure, and is a separable Hilbert space with basis .
The Hilbert-Schmidt norm is . Define a stronger norm: . We frequently think of operators with bounded HS norm as infinite matrices where the entries are square-summable. We write for the collection of Hilbert-Schmidt operators on (those operators, , satisfying ), and for the collection of strong Hilbert-Schmidt operators (those operators satisfying ).
We write for the unperturbed cocycle: , and call the generator of the operator cocycle. Throughout the article, will denote the random Hilbert-Schmidt operator with independent normal entries with mean 0 and where the entry has standard deviation . Write for the measure on corresponding to this distribution. We apply a sequence of independent perturbations , where each has the distribution above. For lying in the base space, we denote by the pair specifying the point of the base space and the sequence of perturbations. The space of such pairs is denoted by , and is equipped with the transformation , where is the left shift on the sequence of perturbations and the ergodic invariant measure . The perturbed cocycle is parameterized by (a measure of the size of the perturbation) and defined by
[TABLE]
Theorem A**.**
Let be an invertible measurable transformation and let be an ergodic invariant measure for . Let be a separable Hilbert space and let be the generator of an operator cocycle satisfying .
Let , and be as defined above. For each parameter , define a new cocycle over with generator . Then the Lyapunov exponents of (listed with multiplicity) converge to those of as .
Theorem B**.**
Assume the hypotheses and notation of Theorem A. Let the (at most countably many) distinct Lyapunov exponents of the cocycle be , with corresponding multiplicities . Let the corresponding Oseledets decomposition be . Let , and let the Lyapunov exponents (with multiplicity) be , so that if .
Let be a neighbourhood of not containing any other exponent of the unperturbed cocycle. Let be such that for each and each , the Lyapunov exponent of the perturbed cocycle satisfies . For , let denote the sum of the Oseledets subspaces of having exponents in . Then converges in probability to as .
For , we let be the diagonal matrix whose entry is . Formally we can write the random operator from Theorem A as , where is a countably infinite square matrix of independent standard normal random variables.
Throughout the remainder of the paper there will be numerous constants. We will mostly just use the symbol to indicate a constant, where may refer to different constants at different places, even in the same proof. That is, whenever we write , we refer to a quantity that may depend on (the number of exponents that we aim to control), and on the underlying dynamical system, but not on , the size of the perturbations. The exception to this will be some of the principal propositions where estimates are collected for assembly in Section 9. In these propositions, constants will be numbered according to the proposition in which they are found, so that , for example, is defined in Lemma 34.
We briefly describe the structure of the proof of Theorem A since there is considerable preparation before we start the proof. The bulk of the proof is concerned with giving a lower bound for the sum of the leading perturbed exponents, that is the maximal logarithmic growth rate of -volumes. Given , one defines a block length, . For a large , we estimate the top exponents of the product , a perturbed block of length . First, we replace the (sub-additive) logarithmic -volume growth, by a related approximately super-additive quantity, (Sections 7 and 8). We use this super-additivity to split into good super-blocks (of length a multiple of ) and bad blocks (of length ), that is . In section 4, ingredients for the estimate are established, where represents a good super-block and its perturbed version. In sections 5 and 6, ingredients for are established (where is a bad block and is its perturbed version). The estimates and are based on ingredients in Section 8. Re-assembling the pieces using sub-additivity of and accounting for the errors gives the result.
3. Notation and the quantity
Recall that the Grassmannian of a Banach space is the space of closed complemented subspaces. In a Hilbert space, every closed subspace is complemented (by its orthogonal complement). We define to be the space of (necessarily closed) -dimensional subspaces of and to be the space of closed -codimensional subspaces of . The collection of all closed subspaces of will be written . We will reserve the symbol for the unit sphere of throughout the article.
We define a metric on by
[TABLE]
that is the Hausdorff distance between the intersections of the two subspaces with the unit sphere. We remark that this differs by at most a bounded factor from another metric, the ‘gap’ between closed subspaces defined in Kato [19]. This is a complete metric on .
We also make use of a measure of transversality between two subspaces of complementary dimensions: if and , then
[TABLE]
The normalization is chosen so that if and have a common vector, then , while if they are orthogonal complements, then . We have the reverse triangle inequality: if , , then .
We already introduced the classes of linear operators and on with their associated norms, so that we have , where stands for the compact linear operators on . We write for the operator norm, so that for elements of and for elements of .
For compact operators on , the notions of singular vectors and singular values pass directly from the finite-dimensional case. If , we write for the singular values (with multiplicity in decreasing order). The maximal logarithmic rate of -dimensional volume growth is given by .
Define
[TABLE]
where denotes orthogonal projection onto the subspace of spanned by and and are independent copies of the random Hilbert-Schmidt operator. The key reason for the introduction of is that it satisfies an approximate super-additivity property (see Proposition 24) that complements the sub-additivity of .
We denote by , the space and act on with the transformation , where is the left-shift map on . The space is equipped with the measure , where is the multi-variate normal distribution on described above in which distinct elements of are independent and the element is normal with mean 0 and variance . We write for a typical element of , that is a pair , where .
Informally, we expect an inequality like . By (which stands for ‘left energy’), we mean a measure of the modes on which the top left singular vectors are distributed, while measures the modes where the right singular vectors are supported. For example, if the top left singular vectors are , , and , we expect to be approximately 39 .
Lemma 1**.**
Let be a -dimensional subspace of . Let be a bounded operator on . There exists an orthonormal basis for with the property that are mutually orthogonal.
This follows from the singular value decomposition of finite-dimensional operators.
Lemma 2**.**
Let and be -dimensional subspaces of . Then the two quantities appearing in the definition of are equal:
[TABLE]
Proof.
Let be the orthogonal projection onto and be the orthogonal projection onto . Then the singular vectors of give an orthogonal basis of , with images , where form an orthogonal basis of (if , then can be chosen to be an arbitrary unit vector of satisfying the orthogonality condition). Write with . One can then check that if . Notice that and are either equal or non-collinear. It follows from the above that may be expressed as the orthogonal direct sum . One can now check that the linear map from to itself mapping to and vice versa is an isometry interchanging and . Applying this map yields the desired equality. ∎
Let be a -dimensional subspace of , and be the orthogonal projection onto . We define the energy of (also the ‘energy of ’) to be
[TABLE]
where the are as guaranteed by the Lemma 1 with the operator taken to be .
Lemma 3**.**
For any , there exists a such that if and are orthogonal projections onto -dimensional subspaces and satisfies , then
[TABLE]
Proof.
Let be the basis guaranteed by Lemma 1 (applied with ) for the range of and be the corresponding basis for .
Now , where is a random matrix whose entry is . The entries of therefore have a multi-variate normal distribution. Each has mean 0, so the unconditioned distribution of is determined by the covariance of the pairs of entries of the matrix.
Using the fact that the coordinates of the ’s and ’s are bounded and the entries of decay exponentially, we calculate
[TABLE]
where for the second line, we used the fact that distinct entries of are independent, and so have 0 covariance. We see then, by the choice of ’s and ’s, that distinct entries of have 0 covariance, and so are independent. The variance of the entry of the matrix is , hence the unconditioned distribution of the entry of the matrix is times a standard normal.
Notice that the entire row has a multiplicative factor of and the entire column has a multiplicative factor of , so that the determinant is , where is a random matrix with independent standard normal entries, so that taking logarithms, we see .
Replacing with a conditioned version has the effect of multiplying the density of by a factor in the range . Since is an integrable function, there are uniform upper and lower bounds for over all functions taking values in , so that
[TABLE]
as required. ∎
Corollary 4**.**
There exists such that if and are two orthogonal projections and satisfies , then
[TABLE]
Proof.
By Lemma 3, we have the following
[TABLE]
where is the constant from Lemma 3.
We calculate that , so that combining the inequalities, we obtain
[TABLE]
where . ∎
4. Good Blocks
This section deals with good blocks. The strategy we follow goes back to Ledrappier and Young in the context of invertible matrices [23, Lemmas 3.3, 3.6 & 4.3], and it was later used in [10]. Lemma 7 is the main tool to control the effect of perturbations on good blocks. Lemma 8 collects standard facts about Lyapunov exponents, Oseledets splittings and their approximations via singular vectors, which are used to define good blocks. Lemma 9 establishes the conditions defining tame perturbations. Proposition 10 provides a lower bound on over a sequence of tame perturbations, comparable with for the unperturbed cocycle.
For each , we define to be the space spanned by the images of the singular vectors with largest singular values under , and to be the space spanned by the orthogonal complement of the pre-image of under . Thus, is exactly the space spanned by those singular vectors of whose singular value is not amongst the largest. We note that the spaces are uniquely defined when the singular values and are distinct. We will always use our results in this setting, and therefore do not worry about the possibility of non-uniqueness.
We collect some properties of singular values and singular vectors for compact operators on Hilbert spaces and matrices.
Lemma 5**.**
Let be a compact operator on a Hilbert space, . Let the singular values be .
- (a)
; 2. (b)
; 3. (c)
;
Proof.
The characterizations (a) and (b) are well known.
To show (c), using (b), let be a -dimensional space such that for all . Then for all , so that using (b) again, we see . By symmetry, , giving the result. ∎
Lemma 6**.**
Let and . Then .
Proof.
Choose with . Let with and . Let be such that ( may be chosen arbitrarily if ) and let be the angle between and , so that . By assumption . We have . Notice that . Since , we see for all . ∎
Lemma 7**.**
For any , there exists a such that if (i) the th singular value of a compact linear operator exceeds ; (ii) the st singular value of is at most 1; and (iii) , then the following hold:
- (a)
* for each and for each ;* 2. (b)
* and are less than ;* 3. (c)
If is any subspace of dimension such that , then ; 4. (d)
If is a subspace of dimension and , then .
Proof.
For each closed subspace of , let be the orthogonal projection onto .
- (a)
For the first part, notice that by assumption, for , we have . Also by Lemma 5(c), we have , so that . The second part of the claim follows from Lemma 5(c) also. 2. (b)
Let . For symmetry, in this part, we assume only , and .
Let satisfy . We will show that . Let with and . By assumption, , so that . On the other hand, if , then . The identical argument shows that if , then
To show the closeness of the fast spaces, first let , and write as , where and . Let satisfy (such a exists by the paragraph above). Now . The first term is 0 and the second term is less than in absolute value. Hence and . Now . In particular, while . Hence if , we have , so . The identical argument holds if the roles of and are reversed, so . 3. (c)
Let . Let and write with and . By assumption, . Hence , while . Since , we have , so that . Hence for an arbitrary element, of , we have and . By Lemma 2, we deduce that as required. 4. (d)
We have that The last inequality follows from the facts that ; and so that for every by Lemma 6, hence . The claim follows.
∎
The following lemma underlies the definition of good blocks: Using the notation of the lemma, if and , and we say the block is good. See [10, Lemma 2.4] for a proof in the context of matrix cocycles, which applies without changes in our setting.
Lemma 8** (Good blocks).**
Let be an invertible ergodic measure-preserving transformation of and let be a measurable map, taking values in the strong Hilbert-Schmidt operators on , and such that . Let the Lyapunov exponents of the cocycle be , counted with multiplicities. Suppose is such that . Let and denote the -dimensional and -codimensional Oseledets spaces of at corresponding to Lyapunov exponents and , respectively.
Let and be given. Then there exist , and such that: for all , there exists a set with such that for , we have
- (a)
; 2. (b)
; 3. (c)
; 4. (d)
* and , where is as given in Lemma 7.* 5. (e)
.
Assume that is fixed. A perturbation is said to be tame if for all (otherwise is wild). A quick calculation shows that if is tame, then .
Lemma 9** (Good block length).**
Let be an ergodic measure-preserving transformation. Let be a measurable map, taking values in the bounded linear operators on , such that is integrable. There exists such that for all , there exists such that for all , there exists of measure at least such that for all , if satisfies is tame for each , then
[TABLE]
where , and .
The probability that one of is wild is .
Proof.
Let and let satisfy . Notice that provided (and assuming that the perturbations are tame, so that for ), for each , and
[TABLE]
There exists such that for , on a set of measure at least , hence on a set of measure at least . In particular, provided , taking , we have provided that the perturbations are all tame.
Recall that th entry of is distributed as times a standard normal random variable. Hence the probability that is . Using a standard estimate on the tail of a normal random variable [7, Theorem 1.2.3], this is at most .
In particular, using the union bound, the probability that one of is wild is . ∎
We comment that once and are fixed, Lemma 8 guarantees the existence of an such that for all sufficiently large , the good set defined in the lemma has measure at least . Now for sufficiently small, the length exceeds . For the remainder of the proof, we let be the good set from Lemma 8 with taken to be (so that the good set, , depends on , and , but this dependence will not be made explicit). We further introduce the notation , which we shall also use for the remainder of the proof.
Proposition 10** (Glueing good blocks).**
Under the assumptions of Lemma 8, suppose and . Then,
[TABLE]
Proof.
Let and . This is proved by induction using Lemma 7. Recall that since is a good block, by Lemma 9. We let and define and .
We claim that the following hold, for each :
- (i)
; 2. (ii)
and .
Item (i) and the first part of (ii) hold immediately for the case . The second part of (ii) holds because and by Lemma 7(b).
Given that (i) and (ii) hold for , is a good block and is a good perturbation, Lemma 7(c) implies that , so that , yielding (i) for .
Making use of the induction hypothesis and Lemma 8, we have that and . Thus, we obtain (ii) for .
Hence using Lemma 7(d), we see that , where we made use of Lemma 7(a) for the second inequality.
Since , summing yields
[TABLE]
as required. ∎
Lemma 11**.**
Let the Hilbert-Schmidt cocycle, and all parameters and perturbations be as above. If for each , then .
Proof.
By the first part of (2), . Also, by Lemma 7(a). Since we have , we deduce .
On the other hand, if is such that , an inductive argument exactly like the proof of Proposition 10 shows that . The choice of in Lemma 7 ensures , so that . ∎
Proposition 12**.**
Let be such that for . Then for any such that , one has .
Proof.
[TABLE]
where we used Lemma 6 for the last line. Lemma 11 and the triangle inequality allow us to conclude. ∎
5. Comparing perturbed and unperturbed bad blocks (Type I)
We distinguish two ways in which a block can be bad: types I and II. A type I bad block is one where the unperturbed cocycle has bad properties. On the other hand, a type II bad block is one where the unperturbed cocycle is well-behaved, but the perturbations are wild.
Conditional on being in a type I bad block, the perturbations are unconstrained, whereas conditional on being in a type II bad block at least one perturbation is constrained to be large. For later use with the type II bad blocks, we state some of the lemmas when one is conditioned to be in a high probability event (but the high probability event will be taken to be the whole space when dealing with type I blocks.)
Lemma 13**.**
Let . There exists a with the following property. Let be a multi-variate normal Hilbert-Schmidt-valued random operator whose entries have mean 0, let and let and be orthogonal projections onto -dimensional subspaces of . Then for any subset of such that , one has
[TABLE]
where denotes .
Proof.
We assume as otherwise the result is trivial.
Let be composed with an isometry from the range of to and similarly let be an isometry from to the range of . Then we have for any bounded operator on so that we need to show
[TABLE]
Let and , so that is a fixed matrix and is a matrix-valued random variable with multivariate normal entries. By our earlier assumption, is invertible, so let (this also has multi-variate normal entries for unconditioned ). We then need a lower bound for \operatorname{\mathbb{E}}\big{(}\log\det(I+X)\big{|}T\in Q\big{)}.
The unconstrained matrix-valued random variable can be written as , where the are fixed matrices, is the dimension of the support of (at most depending on the pattern of entries in the unperturbed ’s) and the are independent standard normal random variables (see for example [7, Example 3.9.2]).
Let denote the map from to defined by . Let be the image under of the unit sphere and be the measure on that is the push-forward of the normalized volume measure on the unit sphere. The unconditioned measure on is then the push forward of , where is chosen so that . The conditioned measure on (since the event being conditioned upon is of measure at least ) is of the same form, but the density is multiplied by a varying factor in the range [0,2].
It then suffices to lower bound
[TABLE]
In particular, it is enough to give a uniform lower bound for
[TABLE]
as ranges over the range 1 to and ranges over .
For each fixed , write , so that is a polynomial of degree satisfying . Hence can be written as a product . Define
[TABLE]
so that . Hence it suffices to show that is uniformly bounded below as runs over the complex plane and as runs over the range to .
Next, notice that , so and it suffices to give a lower bound for positive real values of . Also
[TABLE]
For , . For , one has
[TABLE]
where . This converges to as approaches 0 from the right. By continuity and compactness, for each of the finitely many values of , is bounded below as ranges over . ∎
Proposition 14**.**
Let . Then there exists a with the following property. For every finite sequence of Hilbert-Schmidt operators, let be independent copies of the perturbation as described above. Let denote .
Then one has
[TABLE]
Proof.
We have
[TABLE]
We focus on giving a lower bound for one of the terms in the summation. We write such a term as
[TABLE]
This expectation should be interpreted as being conditioned on the values of , so that .
The above expectation can be rewritten as:
[TABLE]
Once and are fixed, the inner expectation is
[TABLE]
Now let be the orthogonal projection onto the orthogonal complement of the kernel of and be the orthogonal projection onto the range of . Then we have
[TABLE]
Now the quantity in (4) is
[TABLE]
Applying Lemma 13 with , this is bounded below by , independently of and , so that the quantity in (3) is also bounded below by . Since there are such terms, the statement in the lemma follows. ∎
6. Type II bad block perturbations
Here we give an argument for good blocks in the base that have large perturbations. We will obtain a drop in over a bad block of size at worst, that is a drop of size per symbol since blocks are of length proportional to . However since the frequency of these blocks is , the contribution of this drop to the singular values of a large string of blocks is minuscule.
Lemma 15**.**
There exists a constant such that if is a standard normal random variable and , then for each ,
[TABLE]
Before giving the proof, let us give a heuristic explanation for why this should be true. Conditional on , the distribution of is approximately , that is it typically takes values that are . The worst case for the inequality is approximately when and then the quantity inside the logarithm is roughly .
Proof.
We first recall that , so that the average value of the logarithm function over is . We claim that for any interval , one has
[TABLE]
Indeed, this follows already for intervals with , and hence for sub-intervals of and . For intervals with , we have . If the interval is entirely outside , the inequality is trivial; and if intersects , we have already established the inequality for , from which the inequality for follows.
For , the integrand in the statement reduced if is replaced by so we may assume . If , the integral is 0.
If , let , the sub-interval of where ; and , the interval where .
The quantity to be bounded is
[TABLE]
The ratio of the two integrals over is bounded below by . Using (5), the ratio of the two integrals over is bounded below by . Since both ratios are bounded below by a constant multiple of , so is the ratio of the sums.
If , we argue similarly. In this case, we let . On , is bounded below by , so that
[TABLE]
On , we have . Also , using [7, Theorem 1.2.3]. Hence
[TABLE]
using (5). When , this is and the lower bound increases as is further reduced. Minimizing this expression over , we see that there is a , independent of , such that \operatorname{\mathbb{E}}\big{(}\log^{-}|1-aN|\big{|}N\geq\Lambda\big{)}\geq-C for all . ∎
Lemma 16**.**
Let and be as throughout the article. There exists such that for all sufficiently small , for each and each pair of -dimensional orthogonal projections and ,
[TABLE]
where is the event that satisfies for each that is lexicographically smaller than and (where is lexicographically smaller than if or and ).
Proof.
We deal with the case positive. The case where it is negative is exactly analogous. Let be the collection of those satisfying (and no other condition). The argument of Lemma 9 shows that . This allows us to deduce as in the proof of Lemma 13 that
[TABLE]
Hence it suffices to show that
[TABLE]
Using the same reduction as in Lemma 13, the calculation reduces to showing that there is a such that for sufficiently small , one has for an arbitrary multi-variate normal matrix-valued random variable, , whose entries have zero mean and for an arbitrary rank 1 matrix ,
[TABLE]
where is an independent standard normal random variable. First fixing and taking the expectation over using Lemma 13 (taking to be the full range of ), we obtain
[TABLE]
Hence it suffices to show
[TABLE]
Since has rank 1, the polynomial is of the form . To see this, notice the determinant is unchanged if is conjugated by an orthogonal matrix, . Then choose so that the first column spans the range of so that , where has only one non-zero row. is then . Hence we are seeking a lower bound for
[TABLE]
which is of the desired form by Lemma 15. ∎
Proposition 17**.**
There exists a with the following property. For any , let be the event that at least one of the perturbations is wild. Then
[TABLE]
Proof.
We write as , where is the event that the th perturbation matrix is wild, and all previous ones are tame. Since the are disjoint, it suffices to establish that there is a such that for each ,
[TABLE]
We argue as in Proposition 14:
[TABLE]
As in Proposition 14, finding lower bounds for this reduces to finding lower bounds for \operatorname{\mathbb{E}}\Big{(}\tilde{\Xi}_{k}(\Pi A^{\epsilon}_{\bar{\sigma}^{j}{\bar{\omega}}}\Pi^{\prime})-\tilde{\Xi}_{k}(\Pi A_{\sigma^{j}\omega}\Pi^{\prime})\Big{|}B_{i}\Big{)}.
In this case, for , the conditional distribution of is the same as the distribution used in Lemma 13 with , so that lemma gives a bound
[TABLE]
In the case , is conditioned to be tame. By Lemma 9, this is a set of probability (much) greater than , so that Lemma 13 gives a similar bound to (7).
Finally, we address the term with . Given that is wild, the probability that the first oversized entry occurs in the coordinate is (as seen from the estimate for large [7, Theorem 1.2.3]).
Hence by conditioning and using Lemma 16, we obtain
[TABLE]
Combining equations (7) and the equation (8), we obtain the statement of the proposition. ∎
7. Joining good and bad blocks
Lemma 18**.**
For all , there is a constant such that for any , any orthogonal projections and onto -dimensional subspaces, and any such that , one has
[TABLE]
Proof.
Let be an isometry from the range of to . Similarly let be the post-composition of with an isometry from to the span of the range of . Let and let be the multi-variate normal induced from the unconditioned distribution of .
As in Lemma 13, we radially disintegrate the random variables , writing as , where belongs to a ‘unit sphere’ equipped with a normalized probability measure and having an absolutely continuous distribution on with density . On conditioning on , the density is bounded above by We prove that there is a such that for all of rank ,
[TABLE]
Notice that since the matrices are , is just the logarithm of the absolute value of the determinant. Let , a polynomial in powers of of degree at most with constant coefficient 1. It can therefore be expressed as , with .
We are trying to bound
[TABLE]
As in the proof of Lemma 15, it suffices to give a bound in the case where . We have
[TABLE]
The logarithm is bounded below by on , so that the contribution from this range is at least . For the contribution from the range , we have a lower bound of (obtained by bounding above by ). Hence we obtain the required uniform lower bound. ∎
The following lemma plays a key role, as it provides an approximate super-additivity property for (making strong use of the nature of the perturbations), complementing the well-known sub-additivity property of .
Lemma 19**.**
There exists such that if is distributed as above and is any subset of such that , then
[TABLE]
Proof.
We may assume that and have rank at least as otherwise there is nothing to prove. Recalling the definition of , we have
[TABLE]
We first show that for fixed and ,
[TABLE]
We have and , where is the orthogonal projection onto the -dimensional orthogonal complement of the kernel of and is the orthogonal projection onto the range of . Hence
[TABLE]
Taking an expectation as runs over and using Lemma 18, we obtain (9). Hence, taking the expectation over and , we have
[TABLE]
For the last part of the argument, we have
[TABLE]
where and are as above. By Corollary 4, the middle term is . Substituting and recombining the expressions, we get
[TABLE]
as required. ∎
Since the statement includes the case where is conditioned to lie in a large set, this is sufficient to cover the case where is conditioned to be tame. We need a version of this inequality to deal with the case where is constrained to be wild.
Lemma 20**.**
There exists such that for all polynomials, , one has
[TABLE]
where is the Mahler measure of : If , then .
Proof.
Write as . The inequality then follows from
[TABLE]
While we will not give all the details, the idea is to notice that the integral can be expressed as where is a standard normal random variable. If is small, then this is the integral of a function with a logarithmic singularity. If is large, then since is concentrated near 0, the integrand is close to with very high probability. ∎
Lemma 21**.**
For each , there exists a constant such that for each polynomial , one has
[TABLE]
The proof can be found in Lang’s book [22, Theorem 2.8].
Lemma 22**.**
Let and let be a standard normal random variable. There exists a such that for all ,
[TABLE]
Proof.
The case where follows from Lemma 15 (writing ). If , then whenever . The result follows. ∎
Lemma 23**.**
There exists a constant such that for all ,
[TABLE]
where is the event that and for all pairs that are lexicographically smaller than .
Proof.
As in the proof of Lemma 19, the proof reduces to showing a version of Lemma 18:
[TABLE]
We first compare \operatorname{\mathbb{E}}\Xi_{k}\big{(}\Pi_{1}(A+\epsilon\Delta)\Pi_{2}\big{|}\mathsf{Wild}_{i,j}\big{)} to \operatorname{\mathbb{E}}\Xi_{k}\big{(}\Pi_{1}(A+\epsilon\Delta)\Pi_{2}\big{|}\mathsf{Tame}_{i,j}\big{)}, where is the event that for all pairs that are lexicographically smaller than . Fixing all entries of other than , this amounts to comparing \operatorname{\mathbb{E}}\big{(}\log|\det(B+NZ)|\big{|}N>2^{i+j}\epsilon^{-1/2}\big{)} to \operatorname{\mathbb{E}}\big{(}\log|\det(B+NZ)|\big{)}, where is an invertible matrix and is rank 1. As pointed out in Lemma 16, for constants and , so that it suffices to compare \operatorname{\mathbb{E}}\big{(}\log|a+bN|\big{|}N>2^{i+j}\epsilon^{-1/2}\big{)} to . By Lemma 22, the first of these is at least and by Lemmas 20 and 21, the second of these is within of . We deduce that
[TABLE]
Hence, using the same cancellation argument that occurs in Lemma 19, we have
[TABLE]
Finally using Lemma 19 to bound , the result follows. ∎
Proposition 24**.**
There exists with the following property: Let , , and be Hilbert-Schmidt operators and let be the multivariate normal perturbation described earlier. Then each of , \operatorname{\mathbb{E}}\big{(}\tilde{\Xi}_{k}(L(A+\epsilon\Delta)R)\big{|}\Delta\text{ is wild}\big{)} and \operatorname{\mathbb{E}}\big{(}\tilde{\Xi}_{k}(L(A+\epsilon\Delta)R)\big{|}\Delta\text{ is tame}\big{)} is bounded below by .
Proof.
The cases of , \operatorname{\mathbb{E}}\big{(}\tilde{\Xi}_{k}(L(A+\epsilon\Delta)R)\big{|}\Delta\text{ is tame}\big{)} are handled by Lemma 19. The case of \operatorname{\mathbb{E}}\big{(}\tilde{\Xi}_{k}(L(A+\epsilon\Delta)R)\big{|}\Delta\text{ is wild}\big{)} is handled using Lemma 23 by conditioning on the first entry of that is large analogously to the end of the proof of Proposition 17. ∎
8. Comparison of and
Lemma 25**.**
Let be the expected value of where is a matrix-valued random variable with independent standard normal entries. Let , let be an matrix and let be a matrix-valued random variable with independent standard normal entries. Then .
Proof.
Write where and are orthogonal and is diagonal with decreasing entries. Then by an argument like that in Lemma 3 (computing covariances between elements) has the same distribution as , so that we have . Notice that since is diagonal, has the form , where is the left submatrix of and is the top left submatrix of . Hence as required. ∎
Lemma 26**.**
Let , and be Hilbert-Schmidt matrices, and let . Then as .
Proof.
Let , so that . We have for each so that for each . The conclusion follows. ∎
Proposition 27**.**
Let . Then there exists a constant such that for an arbitrary Hilbert-Schmidt operator on ,
[TABLE]
Proof.
We have where and are independent copies of the perturbation operator. Since ; and , we see that the family of functions, is dominated by an integrable function. Hence, by the Reverse Fatou Lemma and Lemma 26, we have
[TABLE]
However, we have
[TABLE]
where denotes the random Hilbert Schmidt operator with all entries outside the top left corner replaced by 0’s (and similarly). Hence
[TABLE]
Applying Lemma 25 twice, we deduce , so that on taking the limit, we deduce as required. ∎
Corollary 28**.**
There is a with the following property. Let , , and be Hilbert-Schmidt operators and and be independent copies of the standard perturbation. Then we have
[TABLE]
The same inequality holds if either or both of and are constrained to be either tame or wild (or one of each).
Proof.
Let . By Proposition 24, , with this inequality still satisfied if is constrained to be tame or wild. By Proposition 27, is a finite constant. Finally, . Combining the inequalities, the result is proved. ∎
Lemma 29**.**
Let where for each . Then is log-convex.
Proof.
We have , so that . Now
[TABLE]
∎
Lemma 30**.**
Let be a -dimensional subspace of and let be the orthogonal projection onto . Then is a convex function.
Proof.
We first prove that for , . To see this, let be an orthogonal basis of such that are orthogonal. Then . By Lemma 29, is convex, so that . Hence as claimed.
Now if , let , let and . Let . Now we have , . Similarly and the result follows from the above. ∎
Lemma 31**.**
Let be a Hilbert-Schmidt operator on . Then is a convex function. Similarly is convex.
Proof.
Let . Let be the -dimensional space spanned by the top right singular vectors of and be the orthogonal projection onto . Let and be the orthogonal projection onto . Then we have , the sum of a convex function and a constant by Lemma 30. Now as required.
We have , which is convex by the above. ∎
Proposition 32**.**
Let be a Hilbert-Schmidt operator on . Then
[TABLE]
Proof.
Let . Since is contractive for , we have and . Now Lemma 31 applied to implies that . Applying the lemma to implies
[TABLE]
as required. ∎
Lemma 33**.**
Let be an ergodic measure-preserving transformation of . Let be a sub-additive sequence of functions (that is for each and ) such that . For any , there exist and such that if and is any set with then .
Proof.
Let . Let be given. Let be small enough that for any set with and so that . By the Kingman sub-additive ergodic theorem, there exists such that for , .
Now let be an arbitrary set with . We split into three sets: , and (and note that ). Now we have
[TABLE]
Hence we see
[TABLE]
as required. ∎
Lemma 34**.**
For all , there exists a such that for any bounded operator one has
[TABLE]
Proof.
We have , where we used sub-additivity of for the first inequality and the fact that for the second. Hence it suffices to show that . But . ∎
9. Convergence of the Lyapunov exponents
Proof of Theorem A.
Rather than control the exponents directly, it is more straightforward, and clearly equivalent, to control the partial sums of the exponents. Let denote the Lyapunov exponents of the cocycle listed with multiplicity in decreasing order. We then let . We are aiming to show that for each . By an argument of Ledrappier and Young [23], explained slightly differently in our earlier paper [10], it suffices to show that is upper semi-continuous for each ; and lower semi-continuous for those such that .
9.1. Upper semi-continuity
We shall show . To see this, let . By the sub-additive ergodic theorem, there exists an such that . As , we have and hence for all . Set and . Then for , . Since this is integrable, the Reverse Fatou Lemma implies that . Hence for sufficiently small .
9.2. Choice of Parameters
Now we move to showing the lower semi-continuity of in the case where . We assume without loss of generality (by scaling the entire cocycle by a constant if necessary) that .
Let . We are seeking an such that for , . First, choose an and such that the following inequalities are satisfied:
[TABLE]
That and can be chosen to satisfy the third inequality is a consequence of Lemma 33. Let be chosen so that , where is the event that the block is good as in Lemma 8. Let be chosen so that for all . Let be such that the probability that an -block of ’s contains a wild perturbation is less than for all (such an exists by Lemma 9). Let . We will only consider ’s that are smaller than and for the remainder of the argument. In particular .
We need to control , where is the length of a block (as given by Lemma 9), and we let . Here and below, the superscript indicates that we are studying the perturbed cocycle.
9.3. Replacing with
We have
[TABLE]
by Lemma 34. The advantage of over is that it admits a lower bound in terms of sub-blocks.
9.4. Splitting into good and bad blocks
Recall a block is said to be good if , that is the unperturbed cocycle is well-behaved, and the perturbations are tame. Given , we split up into blocks of length . Whenever three or more consecutive blocks are good, we form a super-block, , consisting of the concatenation of the good blocks other than the first and last good blocks. All of the remaining blocks are called filler blocks. The are the filler blocks stripped of their first and last matrices.
We have
[TABLE]
where the splitting in the last line is into super-blocks (of variable length, all a multiple of ), here designated by , and filler blocks, , all of length and denotes an expected error term that we now estimate.
To obtain (11), we split the concatenation of blocks of length into the super-blocks and filler blocks as described above by repeatedly applying Proposition 24, which sacrifices a single matrix as ‘glue’ at each splitting site (or Corollary 28 in the case of two consecutive filler blocks when two matrices are sacrificed). Since the expected number of non-good -blocks is less than and each such block gives rise to at most 4 transitions between adjacent blocks in the concatenation (the worst case happens when two super-blocks are joined by three fillers), we deduce . From Lemma 9, , so that
[TABLE]
9.5. Comparison of and
To bound one of the , the contribution from one of the super-blocks, we first compare to , the corresponding contribution to the genuine singular values; and then compare to , the singular values of the unperturbed block. Recall that each is preceded by an -block and followed by an -block such that the enlarged block consists entirely of good blocks.
For the first comparison, we have
[TABLE]
using Propositions 27 and 32 respectively. Now
[TABLE]
by sub-additivity, and
[TABLE]
where we made use of Proposition 12 for the second inequality (Lemmas 7(c) and 8(a), (b) and (c) were used to ensure the hypotheses of that Proposition are satisfied). Combining inequalities (13), (14) and (15), we obtain
[TABLE]
By Lemmas 5(c), 8(d) and 9, we have and are non-negative. By Lemma 8(e), using sub-additivity, we have . Hence for each good block, we have
[TABLE]
9.6. Comparison of and
Next, by Proposition 10, we have , where is the number of blocks forming the super-block, so that overall, for each good block, we have
[TABLE]
where is the corresponding unperturbed block.
In summary,
[TABLE]
where is the combined contribution of the errors coming from good blocks via (16).
9.7. Comparison of and
We next work on giving a lower bound for the terms of the form . It turns out to be convenient to bound this in the opposite order than the way we obtained bounds for . Namely, we show .
If the filler block is not type II bad, we have by Proposition 14, where , the unperturbed block. When is type II bad, we have by Proposition 17. Since by Lemma 9, we have , we get in this case. We therefore have in either case that
[TABLE]
9.8. Comparison of and
For the estimate , we use an argument similar to that in (13) and (14) above. Namely, let the matrices preceding and following in the unperturbed cocycle be and . We also write for the -block, . Then as before, we have
[TABLE]
We have the estimate for the subtracted terms in (19):
[TABLE]
where . This is a consequence of sub-additivity of , the fact that for every and . By the choice of , we have . The combined contribution from the subtracted terms in (19) to all of the terms in (11) is bounded above by
[TABLE]
where is , the set of points which are the first index of a filler block. Hence the expectation of the contribution of the subtracted terms in (19) is at most .
We use a similar argument to give a lower bound for the sum of the added terms in (19). These terms are
[TABLE]
By the choice of , for any set, , of measure at most . Hence, the expected value of the expression in (20) is bounded below by .
Combining these estimates along all filler blocks occuring in (11), we see
[TABLE]
9.9. Combining the inequalities
At this point, we have (combining inequalities (11), (16), (18) and (21)),
[TABLE]
where comes from the contributions of (18) and (21). Then using (10),
[TABLE]
where and are the number of filler and super-blocks respectively in . By sub-additivity, the first term in parentheses is at least . We have and ,
[TABLE]
As is reduced to 0, does not grow, but so that for sufficiently small , we have
[TABLE]
Hence we deduce , as required. ∎
10. Convergence of the Oseledets spaces
Proof of Theorem B.
Let be as in the statement of the theorem. Let us assume, by possibly rescaling the cocycle by a constant, that . Let and
[TABLE]
We will show that for every and every sufficiently small , .
Once this is established, convergence in probability of the Oseledets spaces to follows via the identity , and the fact that coincides with the orthogonal complement of the top -dimensional Oseledets space of the adjoint cocycle , which converges in probability by the same argument. See [10, §4] for details.
In what follows, we will repeatedly apply Lemma 8, assuming , and so the value of provided by Lemma 8 satisfies . The corresponding value of provided by Lemma 8 will also be used in the application of Lemma 7.
Let
[TABLE]
where depends on as in Lemma 9. For sufficiently small , we have , so that once we show , we will be able to conclude that .
Lemma 35**.**
Suppose . Then .
Proof.
We prove the contrapositive: Suppose . Applying Lemma 7(c) (using and setting ), we see . As by Lemma 8(b), we deduce the bound , which contradicts . ∎
Lemma 36**.**
If and , then .
Proof.
We will show the contrapositive. Assume . Let be of length 1. Let , with and . Then, , and so . Also, by Lemma 7(a). Normalizing and recalling that and , we obtain that a point of is within of . Hence, by Lemma 2, .
By Lemmas 7(b) and 8(b), . Hence, . By Lemma 8(c), . Lemma 8(a) ensures that , and combining with the above, we conclude that . ∎
Lemma 37**.**
If is sufficiently small that , and , we have
[TABLE]
Proof.
By hypothesis, there exists a unit length such that , with and .
Now, since is -dimensional, is the logarithm of the volume growth of any -dimensional parallelepiped in under . Let be an orthonormal basis for . Then,
[TABLE]
By the choice of , and using Lemma 7(a),
[TABLE]
Since , then . ∎
Lemma 38**.**
There exists and such that for every and , we have that
[TABLE]
In particular, for all sufficiently small , the above holds for chosen as in Lemma 9.
Proof.
By the convergence in the sub-additive ergodic theorem, there exists be such that for every . In particular, for every and every ,
[TABLE]
Notice that , where we have used the fact that . For a fixed , this shows that the family of functions for is dominated, and converges as to . Hence, by the reverse Fatou lemma, for sufficiently small , and every ,
[TABLE]
Using sub-additivity of , we conclude that for every , and every ,
[TABLE]
∎
Notice that if , then by Lemmas 35, 36 and 37 (each lemma establishing the hypothesis of the next one), then . Combining this with Lemma 38, we see
[TABLE]
Hence,
[TABLE]
In particular, in view of the convergence of the exponents, for all sufficiently small , we have . ∎
Acknowledgements
GF and AQ acknowledge partial support from the Australian Research Council (DP150100017). The research of CGT has been supported by an ARC DECRA (DE160100147). AQ acknowledges the support of NSERC. The authors are grateful to the the School of Mathematics and Statistics at the University of New South Wales, the School of Mathematics and Physics at the University of Queensland and the Department of Mathematics and Statistics at the University of Victoria for their hospitality, allowing for research collaborations which led to this project.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Baladi, A. Kondah, and B. Schmitt. Random correlations for small perturbations of expanding maps. Random Comput. Dynam. , 4(2-3):179–204, 1996.
- 2[2] A. Blumenthal, J. Xue, and L.-S. Young. Lyapunov exponents for random perturbations of some area-preserving maps including the standard map. Ann. of Math. (2) , 185(1):285–310, 2017.
- 3[3] J. Bochi. Genericity of zero Lyapunov exponents. Ergodic Theory and Dynamical Systems , 22(6):1667–1696, 12 2002.
- 4[4] J. Bochi and M. Viana. The Lyapunov exponents of generic volume-preserving and symplectic maps. Ann. Math. , 161:1423–1485, 2005.
- 5[5] C. Bocker-Neto and M. Viana. Continuity of Lyapunov Exponents for Random 2D Matrices. Ar Xiv e-prints , Dec. 2010.
- 6[6] T. Bogenschütz. Stochastic stability of invariant subspaces. Ergodic Theory Dynam. Systems , 20(3):663–680, 2000.
- 7[7] R. Durrett. Probability: Theory and Examples (4th Edition) . Cambridge Univ. Press, 2010.
- 8[8] G. Froyland and C. González-Tokman. Stability and approximation of invariant measures of Markov chains in random environments. Stoch. Dyn. , 16(1):1650003, 23, 2016.
