Golden mean renormalization for the almost Mathieu operator and related skew products
Hans Koch

TL;DR
This paper studies a renormalization transformation for certain mathematical operators, revealing a periodic orbit that helps understand spectral properties and scaling behaviors in related quantum systems.
Contribution
It introduces a new renormalization approach with a specific periodic orbit for the almost Mathieu operator and related skew products, linking to spectral scaling phenomena.
Findings
Existence of a nontrivial period 3 orbit in the renormalization transformation.
Numerical evidence connecting the period 3 orbit to Hofstadter butterfly scaling.
Insights into eigenfunction scaling near spectral edges.
Abstract
Considering SL(2,R) skew-product maps over circle rotations, we prove that a renormalization transformation associated with the golden mean alpha has a nontrivial periodic orbit of length 3. We also present some numerical results, including evidence this period 3 describes scaling properties of the Hofstadter butterfly near the top of the spectrum at alpha, and scaling properties of the generalized eigenfunction for this energy.
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.
Golden mean renormalization
for the almost Mathieu operator and related skew products
Hans Koch ††1
Department of Mathematics, The University of Texas at Austin, Austin, TX 78712.
Abstract. Considering skew-product maps over circle rotations, we prove that a renormalization transformation associated with the golden mean has a nontrivial periodic orbit of length . We also present some numerical results, including evidence that this period describes scaling properties of the Hofstadter butterfly near the top of the spectrum at , and scaling properties of the generalized eigenfunction for this energy.
1. Introduction
\pdfdest
num xyz \pdfoutlinegoto num count 0 1. Introduction
We consider a renormalization transformation that arises in the study of the spectrum of Schrödinger operators
[TABLE]
acting on sequences . Here, is a suitable potential, and for some given real number . Potentials for which is quasiperiodic lead to interesting spectra and have attracted considerable attention. The equation for an eigenvector or generalized eigenvector of can be written as
[TABLE]
The motivating example for the work presented here is the almost Mathieu (AM) operator, which corresponds to a potential . Two reviews can be found in [15,26]. By adding \scriptstyle 1$$\scriptstyle/$$\scriptstyle 2 to , if necessary, we may assume that . A quantity of interest here is the rotation number
[TABLE]
where denotes the number of sign changes of a nontrivial solution , as ranges from to . For any fixed value of , the rotation number is independent of and depends continuously on and . If is irrational, then is independent of the choice of as well, by ergodicity. For proof of these and other properties (mentioned below) of the rotation number, we refer to [6,7,9].
The AM Hamiltonian is a “reduced” form of the Hofstadter Hamiltonian [1,2], which describes Bloch electrons moving on , under the influence a magnetic flux through each unit cell. For the system is conducting (purely ac spectrum), and for it is insulating (purely pp spectrum), for almost every value of and . For details, including proofs and references, see [20]. The Hofstadter Hamiltonian has an obvious duality transformation, which corresponds to replacing by and by . In the self-dual case , the spectrum of is included in the interval , and when plotted as a function of , it is known as the Hofstadter butterfly [2]. It has zero Lebesgue measure [13] and interesting topological properties [22]. The spectrum itself is purely singular-continuous [18], for almost every value of and .
The Hofstadter butterfly is symmetric with respect to the reflections and . The positive-energy part is shown in Figure 1. The solid regions represent gaps in the spectrum, which are open intervals for fixed ; and their colors encode the so-called gap index . To be more precise, the function is constant on the gap with index , where it satisfies
[TABLE]
The left hand side of this congruence can also be identified with the integrated density of states [5,7,14,27], which makes (1.4) a purely spectral relation.
Figure 1. Positive-energy part of the Hofstadter butterfly.
The largest regions are for (left) and (right).
A solution of the equation (1.2) defines an orbit for the following map :
[TABLE]
Here, denotes the real line or the circle , depending on the situation being considered. A map of this type will be referred to as a skew-product map over a translation of , or a skew-product (map) for short. Given this connection with dynamics, the Hofstadter butterfly can be viewed as a two-dimensional analogue of the Arnold tongues, which characterize resonances in circle maps. In particular, it exhibits interesting self-similarity properties [19,31]. This strongly suggests the use of renormalization techniques.
Renormalization group (RG) transformations for maps that involve irrational rotations have been studied for a variety of systems, from circle maps and area-preserving maps of the plane, to skew-products of the type (1.5). Among the many references that could be listed here are [3,4,11,17,25,29]. In essence, these RG transformations lift the Gauss map (defined on , mapping to the fractional part of , and zero to zero) to a space of dynamical systems. In order to allow for scaling, they are usually formulated for pairs of commuting maps.
In this paper, we focus on the inverse golden mean , which is a fixed point of the Gauss map. This allows us to consider a single RG transformation R. Possible applications include a description of the generalized eigenfunction of the self-dual AM Hamiltonian for the largest energy value in its spectrum. Another possible application concerns the self-similarity and scaling property of the Hofstadter butterfly, as approaches and approaches . This self-similarity is depicted in Figure 2. It shows successive enlargements of the Hofstadter butterfly, zooming in on the point . The largest spectrum-free region in the -th magnification corresponds to a gap index , where denotes the -th Fibonacci number.
Figure 2. Enlargements of the Hofstadter butterfly for near .
In order to simplify notation, a skew-product map of the form (1.5) will be written as . Given a second map of the same type, we define the renormalized pair as
[TABLE]
Here, is a map on of the form \Lambda_{1}(x,y)=\bigl{(}\alpha_{\ast}x,L(x)y\bigr{)}, where depends on the pair as described below.
The scaling of the first component is canonical and standard. In order to motivate our choice of , let us consider the AM map , with given by (1.2) and . Since is periodic with period , commutes with , where denotes the identity map. This property is preserved under renormalization: if is a commuting pair, then so is . Another noteworthy property of the transformation R is that it commutes with the inversion (F,G)\mapsto\bigl{(}F^{-1},G^{-1}\bigr{)} for commuting pairs, modulo a trivial conjugacy. This property has the potential of producing non-uniqueness, in the sense that every RG orbit comes in pairs. There should be no real distinction between such orbits. This brings us to an interesting property of the AM map : it is reversible, in the sense that
[TABLE]
with . Notice that is an involution, meaning that .
One of the lesson learned from the RG analysis of area-preserving maps [17,29] is that reversibility should be preserved under renormalization, if possible. Thus, we choose to commute with . For simplicity, we consider and set
[TABLE]
The constant is chosen in such a way that the renormalized pair satisfies a suitable normalization condition (defined later). Unless specified otherwise, we assume now that and . This pair of translations reproduces under renormalization, in the sense that {\hbox{\teneufm R}}(P)=\bigl{(}\bigl{(}1,B_{1}\bigr{)}\hbox{\bf,}\bigl{(}\alpha_{\ast},A_{1}\bigr{)}\bigr{)} for two matrix functions and .
We remark that and need not be defined for all . Formally, if and commute, then we can identify with and consider to be a map on the resulting quotient space. In any case, as far as renormalization is concerned, it suffices that the domains of and include the domains of and , respectively.
Our main result is the following.
**Theorem 1.1. **There exists a function that is analytic on the complex disk \bigl{|}x-{\alpha_{\ast}\over 2}\bigr{|}<2, and a function that is analytic on \bigl{|}x-{1\over 2}\bigr{|}<3, both non-constant and taking values in for real arguments, such that the following holds. The skew-product maps and are reversible and commute with each other. Furthermore, the pair is a fixed point of the transformation , and the three-step scaling factor (defined later) is given by
[TABLE]
To our knowledge, the existence of such a -periodic RG orbit has not been described before in the literature. Some numerical and approximate RG computations can be found in [8,16,21,24], to mention just a few.
It is possible that the transformation R has other nontrivial periodic orbits, including one for zero energy. We have not looked at this question yet†††
Update: In recent numerical experiments [34] we find a periodic orbit of lenght that attracts the self-dual AM map with zero energy.. The most prominent accumulation phenomenon in the Hofstadter butterfly occurs at the point . But this may not be within the scope of renormalization, since the accumulation is linear, not geometric. A scaling conjecture and some related work can be found in [10,12,13].
Our proof of Theorem 1.1 relies on estimates that have been carried out with the aid of a computer; see Sections 3, 4, and 6. As a by-product, we obtain highly accurate estimates on various relevant quantities, including the function and . Some bounds are given in Lemma 3.1. To be more precise about the scaling factor (1.9), we note that is given by
[TABLE]
Here, is a composition of three scalings (1.8) and thus of the form
[TABLE]
The scaling parameter is determined by a suitable normalization condition for the pair . For the precise definition we refer to Section 3. The constant that appears in (1.9) is the value of . It is independent of the choice of normalization.
Following an idea that was used in [17,29], we solve the fixed point equation for by first solving the fixed point equation for the following “palindromic” modification:
[TABLE]
Clearly, agrees with , if is a commuting pair. The advantage of the transformation is that it preserves reversibility, even for pairs that do not commute. The condition is very inconvenient to work with, so we drop it while solving the fixed point equation for . Once a solution is found, it is not too hard to show that and have to commute.
At this time, our evidence that the behavior of R near describes properties of the spectrum and generalized eigenfunctions for the self-dual AM model is purely numerical. Our numerical results are described in Section 2. In particular, they indicate that the following applies to the self-dual AM model with and .
**Theorem 1.2. **Let be a continuous skew-product map on , such that is infinitely renormalizable. To be more precise, write as . Assume that the sequence is bounded for some , and that for large . Then has a nontrivial orbit that returns infinitely often to some fixed bounded set. In particular, if is of the form (1.2), then belongs to the spectrum of the corresponding Schrödinger operator (1.1).
A proof of Theorem 1.2 is given in Section 5.
We note that the asymptotic condition holds e.g. if and , uniformly on the interval .
2. Some numerical results and observations
\pdfdest
num xyz \pdfoutlinegoto num count 0 2. Some numerical results and observations
Figure 3 shows the matrix described in Theorem 1.1 as a function of . To be more specific, let us first change basis and write and , with as defined below. The matrices and are of the form
[TABLE]
From now on, reversibility is defined with respect to this new matrix . Notice that the matrix part of the scaling is diagonal in these new coordinates, with eigenvalue entries and .
In this representation, the Schrödinger matrix (1.2) corresponds to , , , and . If is the second component of a map , then we usually work with the translated matrix A_{0}(x)=A\bigl{(}x-{\alpha\over 2}\bigr{)}, so that is reversible if and only if the components , , of are even, and is odd. These components for the matrix are shown in Figure 3. Judging from a few thousand Taylor coefficients, these functions have much larger domains than those described in Theorem 1.1, and we suspect that and are in fact entire analytic.
Figure 3. Components of the matrix for the skew-product map .
Our proof of Theorem 1.1 involves the use of an approximate fixed point for . A first rough approximation was found by computing iterates for the self-dual AM model with , while adjusting the energy (via bisection) to get to converge numerically. Better approximations are then obtained easily by using the contraction M described in Section 3.
The approximate eigenfunction mentioned in Theorem 1.2 is shown in Figure 4, for the self-dual AM map with , energy , and starting point . The vector for is the expanding eigenvector \bigl{[}{1\atop 0}\bigr{]} of the scaling . The vector at the -th Fibonacci number is again asymptotically (for large ) parallel to \bigl{[}{1\atop 0}\bigr{]}, with length of order .
Figure 4 consists essentially of sharp peaks, even in the “solid” looking regions. The peaks that are higher than all preceding ones are at , , , , , , , , , , , These values , , fit the formula
[TABLE]
The RG period is clearly visible in these data. Notice that , and the corresponding peaks in Figure 4 grow like . The sequence (2.2) appears in other contexts as well and is listed as A049651 in the On-Line Encyclopedia of Integer Sequences. References and links can be found at [33].
Another property of the orbit depicted in Figure 4 is that for all . This indicates that the AM map for has a zero rotation number. For values of below , we find positive rotation numbers.
Figure 4. Generalized eigenfunction for the self-dual AM Hamiltonian with and .
Our proof of Theorem 1.1 also involves the use of of a modest-size matrix approximation for the derivative . By increasing the dimension to get a more accurate approximation, the eigenvalues of modulus larger than are found to be
[TABLE]
The largest eigenvalue, , is almost certainly related to the (three generation) scaling of the Hofstadter butterfly in the energy direction. The scaling seen in Figures 1 and 2, averaged over generations, agrees quite well with . The scaling in the -direction over generation is trivially . But our current RG analysis is for fixed , so there is no room for an eigenvector of in the direction of a change of .
Concerning the eigenvalue , we conjecture that its value is equal to . But despite its “trivial” value, it is not associated with a coordinate change or a non-commuting direction. We believe that is related to variations in the strength of the -dependence. In the AM model, such a change characterizes the transition between the conducting phase and the insulating phase . So far, we have not found a way to prove that this eigenvalue is indeed . But some formal arguments are given in Section 6.
The eigenvalue is most likely associated with a coordinate change and has the value . Our program finds an additional eigenvalue that we have omitted from the list (2.3). We believe that this eigenvalue is associated with a non-commuting direction, which makes it irrelevant for commuting pairs of maps.
A more curious observation is that many (if not all) contracting eigenvalues other than appear in pairs of opposite sign. This is not unusual for some “trivial” eigenvalues, as will be described in Section 6, but we have no explanation why the same might occur more generally.
3. The fixed point problem
\pdfdest
num xyz \pdfoutlinegoto num count 0 3. The fixed point problem
In this section we reformulate the equation as a fixed point problem for a contraction, acting on a suitable space of pairs.
3.1. Normalization
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 3.1. Normalization
Since the transformation involves the composition and inverses of skew-product maps, let us first describe these two operations. As mentioned in the last section, the matrix part of a map is being represented as A=A_{0}\bigl{(}{\alpha\over 2}+\hbox{\bf.}\bigr{)}. Then is reversible if and only if for all . The composition of two skew-products is given by
[TABLE]
In particular, is the inverse of if and only if and .
Consider now a conjugacy . In the expression (1.12) for , such a conjugacy is being applied to and . Consider first , which is of the form . The matrix part of is given by
[TABLE]
Our normalization condition that determines is that and have the same absolute value. Clearly, other normalization conditions would work equally well. The same value of is used to scale . In other words, only the first component of the pair is being “re-normalized”. But of course, this affects both components when is being iterated.
3.2. An extension
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 3.2. An extension
Given the constructive nature of our analysis, an important question is how to deal with a constraint like . Typical methods, including an Iwasawa-type decomposition for real matrices, involve quantities that have singularities in the complex plane. The resulting bounds were not sufficient for our purpose. For the problem considered here, it is better to consider , via Möbius transformations
[TABLE]
In particular, our involution is represented by
[TABLE]
Notice that the transformation a is well-defined as long as . Our maps involve matrices , so the corresponding Möbius transformations a map the upper half of the extended complex plane into itself. As long as , we have
[TABLE]
Consider temporarily instead of . We say that is reversible if , where . For the translated quantities described after (2.1) and at the beginning of this section, reversibility means that
[TABLE]
In other words, the functions , , are even, and is odd. Notice that this does not require that has determinant . And the same applies to the expression \bigl{[}{d~{}-b\atop-c~{}a}\bigr{]} for the matrix representing the inverse .
So for all practical purposes, the constraint has been eliminated, albeit at the cost of having more degrees of freedom than necessary.
Motivated by the above, we extend our RG transformation to pairs of maps that need that need not be area-preserving. (We call area-preserving if has determinant .) Still, it is preferable for the fixed point of to be are-preserving. This can be done e.g. by composing with the normalization map
[TABLE]
If the determinant of is close to , then is well-defined, and has determinant . Notice also that, if is reversible, then is an even function, so is still reversible. The derivative of at is given by
[TABLE]
Our extension of is now defined as
[TABLE]
We consider this map F in a neighborhood of an approximate fixed point . In what follows, the domain of is restricted to pairs whose components and are reversible, with and . The maps and need not be area-preserving. But by construction, is a pair of reversible area-preserving maps.
3.3. The contraction
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 3.3. The contraction
As is common in many computer-assisted proofs, we convert the fixed point problem for the given map F to a fixed point problem for a quasi-Newton map M associated with F. To be more specific, let be an approximate inverse of {\rm I}-D{\hbox{\teneufm F}}\bigl{(}\bar{P}\bigr{)}. Then we define
[TABLE]
Here, the sum of map-pairs is defined component-wise, and is defined as . If is close to being a fixed point of F, and if is chosen properly, we can expect M to be a contraction in some neighborhood of . Notice that, if is a fixed point of M, then is a fixed point of F.
Now we need to define some function spaces. Given , denote by the space of all real analytic functions on that have a finite norm
[TABLE]
Of course, every extends to an analytic function on the complex disk . Furthermore, is a Banach algebra under the pointwise product of functions.
The space of matrix functions whose components , , , and belong to will be denoted by . The norm of is defined as . To define a space for pairs of such functions, we first fix a pair of positive real number. Then we define to be the vector space of all pairs in , equipped with the norm . The subspace of reversible pairs is denoted by .
Due to the above-mentioned restrictions on the domain of F, any skew-product that appears at some stage in the computation of F or M has a pre-determined first component . Thus, in order to simplify notation related to domains and function spaces, let us now identify such a map with its translated matrix component C_{0}=C\bigl{(}\hbox{\bf.}-{\gamma\over 2}\bigr{)}.
In order for R to be defined as a map on , it is necessary and sufficient that
[TABLE]
These inequalities are easily satisfied e.g. with . But it should be noted that, if belongs to with satisfying (3.12), then the components of are defined on significantly larger domains. Those larger domains are not disks; however, they improve the domain of iterates of R. If we restrict to , then the analogue of the condition (3.12) for the transformation is
[TABLE]
This condition is significantly weaker than (3.12).
**Lemma 3.1. **Let . Then there exist a pair in , a bounded linear operator on , and positive constants satisfying , such that the transformation M defined by (3.10) is analytic in and satisfies
[TABLE]
where denotes the open ball of radius in , centered at the origin. Furthermore, for every pair , the matrix components of are non-constant, satisfies the bound defined by the right hand side of (1.9), and \bigl{\|}P-\bar{P}\bigr{\|}_{\rho}<10^{-280}.
Our proof of Lemma 3.1 is computer-assisted and will be described in Section 7. We note that much higher precisions than the one described in this lemma can be achieved quite easily.
4. Proof of Theorem 1.1
\pdfdest
num xyz \pdfoutlinegoto num count 0 4. Proof of Theorem 1.1
Assume that Lemma 3.1 holds. By the contraction mapping principle, the given bounds imply that M has a unique fixed point in . The corresponding function is a fixed point of F, and the last statement in Lemma 3.1 applies to .
What remains to be proved is that the maps and commute. To this end, consider the commutator for a general pair . The commutator for the renormalized pair is easily found to be
[TABLE]
If we write , then \tilde{\Theta}=\bigl{(}0,\tilde{C}\bigr{)}, with
[TABLE]
Consider a change of variables . Define and . Then the equation (4.2) becomes
[TABLE]
Let now , so that . We need the identity (4.3) in some (arbitrary small) complex open neighborhood of the origin. It is straightforward to check that all these matrix functions are being evaluated only at points in their domain. Taking the trace on both sides of (4.3) yields \mathop{\rm tr}\nolimits(C_{1}(z))=\mathop{\rm tr}\nolimits(C_{1}\bigl{(}\alpha^{3}z\bigr{)}). By analyticity, this implies that the trace of is independent of , and the same holds then for the eigenvalues.
Assume now that the following holds for our fixed point .
**Proposition 4.1. **The matrix A_{1}(0)=A_{0}\bigl{(}{1\over 2}\bigr{)}Se^{\sigma_{\ast}S} has no real or imaginary eigenvalues, and the matrix does not have an eigenvalue .
Applying (4.3) twice, we also have . In other words, commutes with . Consider now a basis in where is diagonal. By Proposition 4.1, such a basis exists. Then is diagonal as well, and its eigenvalues are non-real by Proposition 4.1. So the matrix has to be diagonal as well; and in particular, it commutes with . Now (4.3) implies that is its own inverse. And has no eigenvalue by Proposition 4.1. So must be the identity matrix. Given that is independent of , we conclude that , or equivalently, that and commute.
This concludes the proof of Theorem 1.1, conditioned on the validity of Lemma 3.1 and Proposition 4.1.
5. Recurrent orbits
\pdfdest
num xyz \pdfoutlinegoto num count 0 5. Recurrent orbits
The main goal here is to give a proof of Theorem 1.2. Let be a commuting pair of skew-products and , where and are functions with values in . Assume that the renormalized maps
[TABLE]
are all well-defined. This involves a condition on the (real) domains of and . It suffices e.g. that be defined on and on , with and satisfying (3.12). But in order to avoid domain issues when re-arranging factors, assume that and are skew-products on .
Let be the Fibonacci sequence, defined recursively via , , and for , where . Given that and commute, we have
[TABLE]
with being a scaling of the form
[TABLE]
Here, is a sum of scaling exponents. More specifically, if is a multiple of , say , then is the sum of all exponents with . If is even, then (5.2) yields
[TABLE]
A similar identity is obtained if is odd. But in order to prove Theorem 1.2, it suffices to consider even . Let y=\bigl{[}{1\atop 0}\bigr{]}, so that . Then the second component in (5.4) is given by
[TABLE]
Assume now that the sequence is bounded for some fixed value of in the domain of the functions . Assume furthermore that is positive for sufficiently large . This holds e.g. if and , uniformly on and , respectively, since is positive by (1.9). Given that , we see from (5.5) that the sequence is bounded.
Assume now that . In this case, G^{q_{n}}(x,y)=\bigl{(}\alpha_{\ast}^{n}(x+\alpha_{\ast}),y_{n}\bigr{)}. So the above implies that has an orbit that returns infinitely often to a fixed bounded set in , as was claimed in Theorem 1.2. The assertion concerning Schrödinger operators is an immediate consequence of this recurrence.
6. Some trivial eigenvalues
\pdfdest
num xyz \pdfoutlinegoto num count 0 6. Some trivial eigenvalues
A well-known source of trivial eigenvalues in the renormalization of dynamical systems are coordinate changes. For pairs of maps, another source can be the scaling behavior of the commutator; see e.g. [32]. For the skew-product maps considered here, there may be another quantity whose scaling produces a trivial value for the eigenvalue . A possibility will be mentioned at the end of this section. Since the spectrum of is not the main topic of this paper, we shall keep this section short and thus mostly formal.
6.1. Coordinate changes
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 6.1. Coordinate changes
For simplicity, let us replace the scaling in the definition (1.12) of by the scaling for the fixed point . This produces some extra eigenvalues for , but these can easily be identified. Under a change of coordinates we have
[TABLE]
Setting and differentiating with respect to yields
[TABLE]
with the map being linear. In particular, if , then is an eigenvector of with eigenvalue .
Since our analysis is for fixed circle rotations, let us consider just . Near the origin we have for some nonnegative integer . Then the eigen-equation yields
[TABLE]
So either and is diagonal (we may assume that the trace is zero), or else and has a single nonzero entry, off the diagonal. Many of these eigenvalues are indeed observed numerically, but only for .
6.2. Commutators
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 6.2. Commutators
Let with and . We assume that and depend smoothly on a parameter . Notice that, to first order in , the right hand side of (4.1) depends on only through the factor . Consider now the equation (4.3) that relates the commutator \bigl{(}0,\tilde{C}\bigr{)} for the renormalized pair to the commutator for . Substituting and into (4.3), and equating terms of order , we obtain
[TABLE]
Consider now an eigenvector of . Near we have for some nonnegative integer . Denoting the eigenvalue by , we must have
[TABLE]
Recall from Proposition 4.1 that has two distinct eigenvalues and whose squares are non-real. This implies e.g. that there exists a nonzero linear combination of and that has a zero trace. This yields a solution of (6.5) with eigenvalue . Many of these eigenvalues are indeed observed in our computations, including . The non-real solutions are not observed (within the accuracy used). This indicates that non-commuting perturbations contract under renormalization, with the possible exception of one direction with eigenvalue . We note that this applies to but not necessarily .
**Remark 1. ** The equations (6.3) and (6.5) are merely restrictions on eigenvalues that could arise from coordinate transformations and commutators, respectively. To find out more, one needs to determine the associated eigenvectors. If an eigenvector violates a constraint like reversibility, or if it is due to having replaced by , then it is not observed in our analysis.
6.3. The second largest eigenvalue
\pdfdest
num xyz \pdfoutlinegoto num count 0 …. 6.3. The second largest eigenvalue
We conclude this section with two formal arguments supporting the conjecture that the derivative of at has an eigenvalue associated with a change of the strength of the -dependence.
Consider the RG iterates for a commuting pair , as described by the equation (5.1). Taking , the matrix part of has the trace
[TABLE]
Here denotes the -th Fibonacci number. Let now be the AM map with , and with for simplicity. Based on our findings described in Section 2, we can expect the trace (6.6) to be arbitrarily close to , if is chosen sufficiently large and sufficiently close to . Then the eigenvalues of have to cover a nontrivial range of values near , as is varied, since the same is true for .
In order to determine these eigenvalues approximately, let us use the well-known Chambers formula: if , then
[TABLE]
where denotes the value of the left hand side for . Consider . Choose and with , say constant but large. Then is the -th continued fractions approximant for , and . Presumably, we can choose near in such a way that , and such that has a zero rotation number for at least one starting point .
Notice that has a nonzero rotation number for a given if and only the trace (6.7) takes values between . But, unless is sufficiently close to , this trace is larger than for all , in which case is purely hyperbolic. In order to avoid this, consider taking a limit , in such a way that the right hand side of (6.7) approaches for . (Recall that .) Then
[TABLE]
This accumulation rate suggests that has an unstable direction with eigenvalue , related to the variation of the parameter in the AM model.
Another formal argument involves the fluctuations and of the rotation number and , respectively, around their mean values. Here, consider a pair close to the fixed point of . Then the rotation numbers are close to zero, and we may assume that \mathop{\rm rot}\nolimits\bigl{(}F_{n}G_{n}^{-1}\bigr{)}=\mathop{\rm rot}\nolimits(F_{n})-\mathop{\rm rot}\nolimits(G_{n}). Assuming furthermore that has mean zero, we find that the variances of and satisfy
[TABLE]
Given that the matrix in this equation has an eigenvalue , this is another indication that has an eigenvalue , associated with the strength of the dependence.
7. Computer estimates
\pdfdest
num xyz \pdfoutlinegoto num count 0 7. Computer estimates
What remains to be done is to verify Lemma 3.1 and Proposition 4.1. This is carried out with the aid of a computer. This part of the proof is written in the programming language Ada [36] and can be found in [35]. The following is meant to be a rough guide for the reader who wishes to check the correctness of our programs.
Included in [35] are two files approx-Fix and ContrMat.134, which contain the approximate fixed point and the (finite rank) operator , respectively, that enter the definition (3.10) of the transformation M.
The main parts of the proof are described in the Ada package Taylors1.Skews.Pairs, using procedures defined in several lower-level packages. The main program Check_Fixpt first instantiates the required packages with the appropriate parameters, then reads and from the above-mentioned files, and finally handles control to the procedure ContrFix in Taylors1.Skews.Pairs. To give a rough idea of what happens next: ContrFix first computes an upper bound on the norm of , and an upper bound on the norm of that holds for all of norm or less. After checking that , a number is chosen in such a way that .
These steps yield accurate and rigorous bounds on all quantities involved. So the last statement in Lemma 3.1, as well as Proposition 4.1, are trivial to verify in this process. In this context, a “bound” on a map is a function that assigns to a set of a given type (Xtype) a set of a given type (Ytype), in such a way that belongs to for all . In Ada, such a bound can be implemented by defining an appropriate procedure F(X: in Xtype; Y: out Ytype).
Enclosures for real numbers are defined by data of type Ball. For common finite-dimensional spaces we use types Vector, Matrix, and Polynom1. Our type Taylor1 provides enclosures for functions in the spaces . Basic bounds for this type are defined in the package Taylors1. For a detailed description we refer to [30], where the same type has been used. Enclosures for matrix function in are implemented by the type Skew defined in the package Taylors1.Skews. And for pairs in we use a type Skew2 defined in Taylors1.Skews.Pairs.
Among the procedures defined in Taylors1.Skews is a bound Prod_GFG on the product for reversible matrix functions. Notice that the result is again reversible. Combined with a bound Inv on , Prod_GFG is used to compute the composed map that appears in the first component of . The second component involves , which can be computed by applying Prod_GFG twice. A bound on the scaling (F,G)\mapsto\bigl{(}\Lambda_{3}^{-1}F\Lambda_{3}\,\hbox{\bf,}\,\Lambda_{3}^{-1}G\Lambda_{3}\bigr{)} is defined by the procedure Equalize. The normalization map and its derivative (3.8) are bounded via Normalize and DNormalize, respectively. A bit more complex are the derivative bounds DProd_GFG and DEqualize. But it should not be difficult to understand the code and verify its correctness.
Bounds on the transformations , F, M, and their derivatives are obtained simply by composing the bounds described above.
We will not explain here the more basic ideas and techniques underlying computer-assisted proofs in analysis. This has been done to various degrees in several other papers, including [29,30]. As far as our proof of Lemma 3.1 and Proposition 4.1 is concerned, the ultimate reference is the source code of our programs [35]. For the center of the type Ball we use high precision [39] floating-point numbers (type MPFloat), and for the radii we use standard [38] extended floating-point numbers (type LLFloat). Both types support controlled rounding. Our programs were run successfully on a standard desktop machine, using a public version of the gcc/gnat compiler [37]. Instructions on how to compile and run these programs can be found in the file README that is included with the source code in [35].
Acknowledgments. The author would like to thank Gianni Arioli and Saša Kocić for helpful discussions, and Saša Kocić for drawing my attention to the Hofstadter butterfly.
References \pdfdestnum xyz \pdfoutlinegoto num count 0 References
[1] P.G. Harper, Single band motion of conduction electrons in a uniform magnetic field, Proc. Phys. Soc. Lond. A 68, 874–892 (1955).
[2] D.R. Hofstadter, Energy levels and wave functions of Bloch electrons in rational and irrational magnetic fields, Phys. Rev. B 14, 2239–2249 (1976).
[3] L.P. Kadanoff, Scaling for a critical Kolmogorov--Arnold--Moser trajectory. Phys. Rev. Lett. 47, 1641–1643 (1981).
[4] R.S. MacKay, Renormalisation in Area Preserving Maps. Thesis, Princeton (1982). World Scientific, London (1993).
[5] J. Bellissard, B. Simon, Cantor spectrum for the almost Mathieu equation, J. Funct. Anal. 48, 408–419 (1982).
[6] R. Johnson, J. Moser, The rotation number for almost periodic potentials, Commun. Math. Phys. 84, 403–438 (1982).
[7] J. Avron, B. Simon, Almost periodic Schrödinger operators. II. The integrated density of states, Duke Math. J. 50, 369–391 (1983).
[8] S. Ostlund, S. Kim, Renormalization of quasiperiodic mappings, Physica Scripta T 9, 193–198 (1985).
[9] C. DeConcini, R.A. Johnson, The algebraic-geometric AKNS potentials, Ergodic Theory Dynam. Syst. 7, 1–24 (1987).
[10] D.J. Thouless, Scaling for the discrete Mathieu equation, Commun. Math. Phys. bf 127, 187–193 (1990).
[11] M. Rychlik, Renormalization of cocycles and linear ODE with almost-periodic coefficients, Invent. Math. 110, 173–206 (1992).
[12] Y. Last, M. Wilkinson, A sum rule for the dispersion relations of the rational Harper’s equation, J. Phys. A 25, 6123–6133 (1992).
[13] Y. Last, Zero measure spectrum for the almost Mathieu operator, Comm. Math. Phys. 164, 421–432 (1994).
[14] J. Bellissard, A. van Elst, H. Schulz-Baldes, The Non-Commutative Geometry of the Quantum Hall Effect, J. Math. Phys. 35, 5373–5451 (1994).
[15] Y. Last, Almost everything about the almost Mathieu operator. I, In: XIth International Congress of Mathematical Physics (Paris, 1994), pp. 366–372, Cambridge MA: Internat. Press, 1995.
[16] J.A. Ketoja, I.I. Satija, Self-similarity and localization, Phys. Rev. Lett. 75, 2762–2765 (1995).
[17] A. Stirnemann, Towards an Existence Proof of MacKay’s Fixed Point. Comm. Math. Phys. 188, 723–735 (1997).
[18] A.Y. Gordon, S. Jitomirskaya, Y. Last, B. Simon, Duality and singular continuous spectrum in the almost Mathieu equation, Acta Math. 178, 169–183 (1997).
[19] A. Rüdinger, F. Piéchon, Hofstadter rules and generalized dimensions of the spectrum of Harper’s equation, J. Phys. A 30, 117–128 (1997).
[20] S. Jitomirskaya, Metal-insulator transition for the almost Mathieu operator, Ann. of Math. 150, 1159–1175 (1999).
[21] B.D. Mestel, A.H. Osbaldestin, B. Winn, Golden mean renormalisation for the Harper equation: the strong coupling fixed point, J. Math. Phys. 41, 8304–8330 (2000).
[22] D. Osadchy, J.E. Avron, Hofstadter butterfly as quantum phase diagram, J. Math. Phys. 42, 5665–5671 (2001).
[23] R. Krikorian, Global density of reducible quasi-periodic cocycles on , Ann. of Math. (2) 154, 269–326 (2001).
[24] B.D. Mestel, A.H. Osbaldestin, A garden of orchids: a generalized Harper equation at quadratic irrational frequencies. J. Phys. A 37, 9071–9086 (2004).
[25] A. Avila, R. Krikorian, Reducibility or nonuniform hyperbolicity for quasiperiodic Schrödinger cocycles, Ann. Math. 164, 911–940 (2006).
[26] D. Damanik, The spectrum of the almost Mathieu operator, Lecture series in the CRC 701 (2008).
[27] M. Goldstein and W. Schlag, Fine properties of the integrated density of states and a quantitative separation property of the Dirichlet eigenvalues, Geom. Funct. Anal. 18, 755–869 (2008).
[28] A. Avila, D. Damanik, Absolute continuity of the integrated density of states for the almost Mathieu operator with non-critical coupling, Invent. Math. 172, 439–453 (2008).
[29] G. Arioli and H. Koch, The critical renormalization fixed point for commuting pairs of area-preserving maps, Comm. Math. Phys., 295 (2010), 415–429.
[30] G. Arioli, H. Koch, Existence and stability of traveling pulse solutions for the FitzHugh-Nagumo equation, Nonlinear Analysis A. 113, 51–70 (2015).
[31] I.I. Satija, A tale of two fractals: the Hofstadter butterfly and the integral Apollonian gaskets, Eur. Phys. J. Spec. Top. 225, 2533–2547 (2016).
[32] H. Koch, On hyperbolicity in the renormalization of near-critical area-preserving maps, Discrete Contin. Dyn. Syst. 36, 7029–7056 (2016).
[33] Sequence \pdfclink0 0 1A049651https://oeis.org/A049651 at The On-Line Encyclopedia of Integer Sequences.
[34] H. Koch, S. Kocić, work in progress.
[35] H. Koch. The source code for our programs, and data files, are available at \pdfclink0 0 1web.ma.utexas.edu/users/koch/papers/skewrg/ http://web.ma.utexas.edu/users/koch/papers/skewrg/
[36] Ada Reference Manual, ISO/IEC 8652:2012(E), available e.g. at \pdfclink0 0 1www.ada-auth.org/arm.html http://www.ada-auth.org/arm.html
[37] A free-software compiler for the Ada programming language, which is part of the GNU Compiler Collection; see \pdfclink0 0 1gnu.org/software/gnat/http://gnu.org/software/gnat/
[38] The Institute of Electrical and Electronics Engineers, Inc., IEEE Standard for Binary Floating–Point Arithmetic, ANSI/IEEE Std 754–2008.
[39] The MPFR library for multiple-precision floating-point computations with correct rounding; see \pdfclink0 0 1www.mpfr.org/http://www.mpfr.org/
