On the finite-size Lyapunov exponent for the Schroedinger operator with skew-shift potential
Paul Michael Kielstra, Marius Lemm

TL;DR
This paper investigates the finite-size Lyapunov exponent for a quantum system with a skew-shift potential, providing numerical verification of conditions related to localization phenomena in such systems.
Contribution
It offers the first numerical verification of finite-size Lyapunov exponent conditions for skew-shift potentials, advancing understanding of localization in these models.
Findings
Numerical verification of finite-size Lyapunov exponent conditions.
Support for localization conjectures in skew-shift potential models.
Extension of finite-size criteria to non-golden mean frequencies.
Abstract
It is known that a one-dimensional quantum particle is localized when subjected to an arbitrarily weak random potential. It is conjectured that localization also occurs for an arbitrarily weak potential generated from the nonlinear skew-shift dynamics: with an irrational number. Recently, Han, Schlag, and the second author derived a finite-size criterion in the case when is the golden mean, which allows to derive the positivity of the infinite-volume Lyapunov exponent from three conditions imposed at a fixed, finite scale. Here we numerically verify the two conditions among these that are amenable to computer calculations.
| 0.08071 | 0.46561 | |
| 0.08070 | 0.46559 | |
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 · Quantum Mechanics and Applications · Spectral Theory in Mathematical Physics
On the finite-size Lyapunov exponent for the Schrödinger operator with skew-shift potential
Paul Michael Kielstra
and
Marius Lemm
Department of Mathematics, Harvard University, 1 Oxford Street, Cambridge, MA 02138, USA
(Date: April 18, 2019)
Abstract.
It is known that a one-dimensional quantum particle is localized when subjected to an arbitrarily weak random potential. It is conjectured that localization also occurs for an arbitrarily weak potential generated from the nonlinear skew-shift dynamics: with an irrational number. Recently, Han, Schlag, and the second author derived a finite-size criterion in the case when is the golden mean, which allows to derive the positivity of the infinite-volume Lyapunov exponent from three conditions imposed at a fixed, finite scale. Here we numerically verify the two conditions among these that are amenable to computer calculations.
1. Introduction
A one-dimensional quantum particle living on with energy is described by the discrete Schrödinger equation
[TABLE]
where is a sequence in . The real-valued potential sequence represents the environment that the particle is subjected to. (The “coupling constant” is factored out for convenience.) As first famously realized by Anderson in 1958 [2], the decoherence introduced by a random (meaning independent and identically distributed) sequence of potentials can drastically affect the spectral and dynamical properties of the quantum particle. Physically, one observes a sudden onset of insulating behavior in the presence of a random environment (“Anderson localization”). Mathematically, it is known that for arbitrarily small , the one-dimensional Schrödinger operator
[TABLE]
has pure point spectrum with exponentially decaying eigenfunctions [6, 9, 16].
A natural follow-up question is then: How random does the environment have to localize the quantum particle? Alternative “quasi-random” environments are generated by sampling a nice function along the orbit of an ergodic dynamical system. This question is interesting from a purely mathematical ergodic theory perspective, but it also has practical implications, since computer simulations are mostly based on appropriate pseudo-random number sequences. For example, one can consider generated from sampling cosine along an irrational circle rotation; this is the well-known Harper (or Almost-Mathieu) model . It turns out that these linear underlying dynamics only produce localization for sufficiently strong potentials, namely only for [15]. One would thus like to consider dynamics which are slightly more quasi-random than the shift.
A standing conjecture in this direction concerns the case when the potential is generated from the nonlinear skew-shift dynamics , , namely it is of the form
[TABLE]
with irrational (say Diophantine). The key difference between (3) compared to is the appearance of the nonlinear quadratic term . The conjecture states that the associated Schrödinger operator defined by (2) is Anderson localized for arbitrarily small everywhere in the spectrum. Partial results in this vein are due to Bourgain [3] and Bourgain-Goldstein-Schlag [5]. Note that the conjecture says in particular that the skew-shift dynamics is appreciably more random-like than the circle rotation where . (Recall that the latter is only localized for .) The observation that the skew-shift is more quasi-random than the shift has been made in another context by Rudnick-Sarnak-Zaharescu [21] and others [13, 19, 20] (concerning the spacing distribution) and also recently in [1] (concerning eigenvalues of large Hermitian matrices).
A crucial ingredient for localization on which we will focus is the positivity of the Lyapunov exponent of the associated cocycle, which is defined as follows. From now on, is given by (3) with irrational. The second-order difference equation (1) can be solved by using transfer matrices:
[TABLE]
The Lyapunov exponent is defined as
[TABLE]
where the limit exists by subadditivity (Fekete’s lemma). We remark that the Furstenberg-Kesten theorem [23] implies that
[TABLE]
for Lebesgue-almost every initial condition of the skew-shift , as long as is irrational. This leads us to the following relaxed version of the conjecture from above.
Conjecture 1**.**
Let be irrational. For every and every , it holds that
[TABLE]
Some limited progress on Conjecture 1 was made in [3, 5, 11, 12, 17, 18]. We collect some remarks concerning this conjecture.
Remark 2*.*
- (i)
The lower bound on the Lyapunov exponent is nontrivial only when lies in the spectrum of the Schrödinger operator defined by (2). A concurrent conjecture, to which we will return later, says that the skew-shift model has no gaps in the spectrum. 2. (ii)
In the case of i.i.d. random it is known that the Lyapunov exponent is positive by Furstenberg’s theorem [8]. 3. (iii)
Herman’s subharmonicity trick [14] implies and thus establishes a lower bound on the Lyapunov exponent if and only if . The interesting regime for Conjecture 1 is therefore .
2. A finite-size criterion
Our paper is a follow-up to an approach on Conjecture 1 which was recently initiated in [11]. That paper was based on the methods developed in [5], specifically large deviation estimates for Lyapunov exponents and an inductive multi-scale machine based on the Avalanche Principle, and [11] rendered these methods effective, i.e., explicit constants were obtained for every step of the argument. As a result, one obtains finite-size criteria for the validity of Conjecture 1. Namely, deriving the conjecture for a fixed choice of parameters and (the golden mean) is reduced to verifying numerical conditions on the Lyapunov exponent at a fixed initial scale, called below. If true, these conditions can be fed into the effective inductive machine from [11] to obtain .
For definiteness, we focus on the following finite-size criterion obtained in [11] (see Theorem 1.4 there). We define the Lyapunov exponent at scale by
[TABLE]
and its non-averaged analog by
[TABLE]
We also define the bad set , where deviates by more than from its average:
[TABLE]
Theorem 3** ([11]).**
Let and let . Let . Assume that for some energy the following hold:
- (i)
, 2. (ii)
, 3. (iii)
.
Then:
[TABLE]
We see that Theorem 3 reduces the proof of Conjecture 1 for specific parameters to a numerical calculation at the initial scales and . We remark that the methods in [11] are flexible and can be used to obtain variant finite-size criteria; some further examples are stated in [11]. We work with Theorem 3 because the initial scale , while large, is amenable to numerical verification which is our goal here.
Our main contribution is to conduct a detailed numerical study of conditions (i)-(iii). The results are obtained by running MATLAB code on Harvard’s research computing cluster Odyssey. We mention that numerics for the skew-shift are a delicate matter because of the highly oscillatory matrix elements of defined in (4), particularly the quadratic term in (3) combined with the irrational nature of . These difficulties were partially overcome in an earlier numerical study [7] which went up to the scale .
The remainder of the paper is organized as follows. In Section 3.1, we conduct some preliminary investigations into the spectrum of the Schrödinger operator by studying its finite-size approximations and employing some standard mathematical bounds controlling the error of these approximations. In Section 3.2, we verify conditions (i) and (ii) of Theorem 3 numerically for specific parameter choices—see Table 1 below. In Section 3.3, we investigate condition (iii) of Theorem 3. Given the large power , condition (iii) cannot reasonably be verified numerically. Nonetheless, we include some graphs that hopefully shed some light on this condition.
We recall Remark 1.2 in [11] about condition (iii): Condition (iii) is a large-deviation estimate at the initial scales and and hence plays a different role from conditions (i) and (ii). For instance, analogous large deviations estimates are analytically known to hold a priori, independently of the positivity of the Lyapunov exponent, for the Harper model and others [4, 5, 10]. At any rate, an analytical proof of condition (iii) is warranted, and the importance of this problem is elevated further in light of our numerical verification of conditions (i) and (ii) in the present work.
From now on, we fix the parameters and .
3. Numerical results
3.1. Preliminaries on the spectrum of
As mentioned after Conjecture 1, the only energies for which the positivity of the Lyapunov exponent is nontrivial are those lying in the spectrum of the infinite-volume Schrödinger operator defined in (2) with given by (3). General facts from ergodic theory and spectral theory imply that and it does is independent of if a zero-measure subset of is ignored.
Apart from these general facts, however, not much is known about . Hence, it is a priori unclear on which energies we should focus our numerical investigation. Before we explain how we choose which energies to study (given our choice of other parameters and ), we note that this issue is not as concerning as it may seem at first sight, in light of another standing conjecture that the skew-shift Schrödinger operator given by (2) has no gaps in the spectrum. This concurrent conjecture is also supported by numerics [7]; see (8) below for a numerical upper bound on the spectral gap.
We choose to focus our investigations on the energies
[TABLE]
The energy is a natural choice by symmetry considerations. Indeed, the spectrum of is symmetric under reflection at [math]; note also the reflection symmetry in Figure 1 for the finite-size analog of this fact.
The energy is chosen as follows. While is not directly accessible by numerics, we can consider the finite-size approximation to , the Hamiltonian matrix defined by
[TABLE]
Standard spectral estimates can be used to approximate by , see for instance Corollary 2 in [7]. In [7], these estimates are combined with the eigenvalue and eigenvector results for to derive the following upper bound on the largest spectral gap in :
[TABLE]
We set and diagonalize over a regular grid of pairs . The resulting empirical spectral measure is shown as a histogram in Figure 1. We choose as the location of the bin with the tallest peak (using higher precision than the one used to produce the histogram). In other words, is close to an eigenvalue of for the maximal number of pairs and in this sense is the number of maximal likelihood on scale to lie in . (We remark that we determine to 16-digit accuracy as and conduct all computations at this accuracy. The approximation (7) is chosen in the main text for readabiity.)
Moreover, the spectral estimate from Corollary 2 in [7] can be used to show that lies inside the spectrum to that level of accuracy, namely,
[TABLE]
This estimate is relevant insofar as we want to check for and by the above considerations is our best guess for an element of from spectral information at scale .
3.2. Numerical verification of conditions (i) and (ii)
We recall that , , and . Our main results are the numerical approximations of the finite-size Lyapunov exponents and for given in (7). The results are summarized in Table 1. From these results, we see that
[TABLE]
Hence, conditions (i) and (ii) of Theorem 3 hold numerically for and (in fact, comfortably so).
Recall that the Lyapunov exponents and are defined as integrals over in (5). We make some remarks concerning numerical integration errors. We would like to emphasize that there is no viable deterministic bound on the numerical integration error because the integrand can have a large derivative in and especially . Instead, we independently verified the numbers in Table 1 with a Monte-Carlo integration using pseudorandom integration points, e.g., we still obtain in that case. For Monte-Carlo integration the integration error for with can be estimated as follows.
The random numerical integration can be studied through the random variable
[TABLE]
where we assume that the random variables are independently drawn from Lebesgue measure on .
Lemma 4**.**
Let , and . With respect to uniform probability measure, it holds that
[TABLE]
For example, if we take and use the numerical result , then we find that . The bound is also informative for in which case it implies with probability . These bounds and their analogs for indicate the correctness of the numerical data in Table 1.
Proof of Lemma 4.
By submultiplicativity of the norm, , we have
[TABLE]
Since
[TABLE]
and , it follows that
[TABLE]
Using , the right-hand side is bounded by and so, by independence,
[TABLE]
The lemma now follows from applying Chebyshev’s inequality with deviation . ∎
3.3. Numerical investigation of condition (iii)
As mentioned in the discussion after Theorem 3, condition (iii) is a large-deviation estimate at the initial scale and plays a different role from conditions (i) and (ii).
In this section, we present two different kinds of graphs of the Lyapunov exponent along slices of of constant - and -values for comparison purposes.
- •
Figure 2 shows along normal - and -slices. In this case, there is no visible bad set .
- •
Figure 3 shows along slices of constant - and -values which are designed to contain a point in the bad set where the Lyapunov exponent dips close to zero. We find such “bad slices” by taking the energy to be an eigenvalue of the corresponding finite-size operator and looking for a pair of slices that intersect at a nearby point along which the Lyapunov exponent is minimal.
From both figures, we see that the - and -dependence of are starkly different. The fact that the -dependence is more oscillatory is expected in view of the expression in (4). The main difference between Figures 2 and 3, is that in Figure 3 the Lyapunov exponent gets close to [math] at a few special points along both slices. These special points contribute to the bad set defined in (6).
It turns out that the method we use to construct these “bad slices” by hand (described in the second bullet point above) only works for relatively small and this is the reason why we take in Figure 3. This fact can be considered good news in view of condition (iii). Going a step further, we might assume that the only possible reason for the occurrence of a bad point is that is an eigenvalue of the finite-size operator . With this assumption, we can estimate the size of the bad set using the data gathered in Section 3.1. Indeed, it suffices to count what is the maximum number of times that an energy occurs as an eigenvalue of for ranging over the toroidal grid. The resulting count, when rounding energies to 8 decimal digits, is . This suggests a rough estimate on of , which is still quite far from what is required for condition (iii).
In light of these results, we believe that finding an analytical proof of condition (iii) makes for an important open problem.
Supplemental material
The MATLAB code used to perform the computations presented in this paper and the complete numerical output (to 16-digit accuracy) are available through an online repository [22].
Acknowledgments
The authors thank Wilhelm Schlag for encouragement and advice. The computations in this paper were run on the Odyssey cluster supported by the FAS Division of Science, Research Computing Group at Harvard University.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Adhikari, A., Lemm, M., and Yau, H.-T. Global eigenvalue distribution of matrices defined by the skew-shift , ar Xiv:1903.11514
- 2[2] Anderson, P.W. Absence of diffusion in certain random lattices , Phys. Rev. 109 (1958) (5): 1492–1505.
- 3[3] Bourgain, J. On the spectrum of lattice Schrödinger operators with deterministic potential , Dedicated to the memory of Thomas H. Wolff. J. Anal. Math. 87 (2002), 37–75.
- 4[4] Bourgain, J., Goldstein, M. On nonperturbative localization with quasi-periodic potential , Ann. of Math. (2) 152 (2000), no. 3, 835–879.
- 5[5] Bourgain, J., Goldstein, M., Schlag, W. Anderson localization for Schrödinger operators on ℤ ℤ \mathbb{Z} with potentials given by the skew-shift , Comm. Math. Phys. 220 (2001), no. 3, 583–621.
- 6[6] Carmona, R., Klein, A., and Martinelli, F. Anderson localization for Bernoulli and other singular potentials Comm. Math. Phys. 108 (1987), no. 1, 41-–66
- 7[7] Bourgain-Chang, E., Spectral Aspects of the Skew-Shift Operator: A Numerical Perspective , Comm. Comp. Phys., 15 (2014), no. 3, 712–732
- 8[8] Fürstenberg, H. Noncommuting random products , Trans. Amer. Math. Soc. 108 (1963), 377–428.
