Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities
arXiv:2001.09115 · doi:10.1007/s13324-021-00641-x
Abstract
The Lyapunov exponent characterizes the asymptotic behavior of long matrix products. Recognizing scenarios where the Lyapunov exponent is strictly positive is a fundamental challenge that is relevant in many applications. In this work we establish a novel tool for this task by deriving a quantitative lower bound on the Lyapunov exponent in terms of a matrix sum which is efficiently computable in ergodic situations. Our approach combines two deep results from matrix analysis --- the -matrix extension of the Golden-Thompson inequality and the Avalanche-Principle. We apply these bounds to the Lyapunov exponents of Schrödinger cocycles with certain ergodic potentials of polymer type and arbitrary correlation structure. We also derive related quantitative stability results for the Lyapunov exponent near aligned diagonal matrices and a bound for almost-commuting matrices.
arXiv comment46 pages; comments welcome
References in corpus (11)
- Schrödinger Operators with Dynamically Defined Potentials: A Survey
- Multivariate Trace Inequalities
- Delocalization in random polymer models
- Upper bounds on wavepacket spreading for random Jacobi matrices
- Localization for random block operators related to the XY spin chain
- Large deviations for products of random two dimensional matrices
- Uniform hyperbolicity and its relation with spectral analysis of 1D discrete Schrödinger Operators
- Bounds on Lyapunov exponents via entropy accumulation
- On multivariate trace inequalities of Sutter, Berta and Tomamichel
- Effective multi-scale approach to the Schrödinger cocycle over a skew shift base
- Parametric Furstenberg Theorem on Random Products of matrices