This paper establishes a quantum-ergodicity theorem for eigenfunctions on large graphs with Schr"odinger operators, linking spectral properties of the infinite model to spatial delocalization in finite approximations.
Contribution
It proves quantum ergodicity for graphs with a local weak limit, connecting spectral properties of the infinite model to eigenfunction delocalization on finite graphs.
Findings
01
Eigenfunctions become equidistributed in phase space.
Results apply to graphs converging to the Anderson model on a regular tree.
Abstract
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local weak limit. We assume that our graphs have few short loops, in other words that the limit model is a random rooted tree endowed with a random discrete Schr\"odinger operator. We show that absolutely continuous spectrum for the infinite model, reinforced by a good control of the moments of the Green function, imply "quantum ergodicity", a form of spatial delocalization for eigenfunctions of the finite graphs approximating the tree. This roughly says that the eigenfunctions become equidistributed in phase space. Our result applies in particular to graphs converging to the Anderson model on a regular tree, in the r\'egime of extended states studied by…
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.
Full text
Quantum Ergodicity on Graphs : from Spectral to Spatial Delocalization
Nalini Anantharaman and Mostafa Sabri
Université de Strasbourg, CNRS, IRMA UMR 7501, F-67000 Strasbourg, France.
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schrödinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schrödinger operators, assumed to have a local weak limit. We assume that our graphs have few short loops, in other words that the limit model is a random rooted tree endowed with a random discrete Schrödinger operator. We show that absolutely continuous spectrum for the infinite model, reinforced by a good control of the moments of the Green function, imply
“quantum ergodicity”, a form of spatial delocalization for eigenfunctions of the finite graphs approximating the tree. This roughly says that the eigenfunctions become equidistributed in phase space. Our result applies in particular to graphs converging to the Anderson model on a regular tree, in the régime of extended states studied by Klein and Aizenman–Warzel.
Key words and phrases:
Quantum ergodicity, large graphs, delocalization
2010 Mathematics Subject Classification:
Primary 58J51. Secondary 60B20, 81Q10.
1. Introduction
1.1. The problem
Consider a very large, but finite, graph G=(V,E). Are the eigenfunctions of its adjacency matrix localized, or delocalized ? These words are used in a variety of contexts, with several different meanings.
For discrete Schrödinger operators on infinite graphs (e.g. for the celebrated Anderson model describing the metal-insulator transition), localization can be understood in a spectral, spatial or dynamical sense. Given an interval I⊂R, one can consider
•
spectral localization : pure point spectrum in I,
•
exponential localization : the corresponding eigenfunctions decay exponentially,
•
dynamical localization : an initial state with energy in I which is localized in a bounded domain essentially stays in this domain as time goes on.
On the opposite, delocalization may be understood at different levels :
•
spectral delocalization : purely absolutely continuous spectrum in I,
•
ballistic transport : wave packets with energies in I spread on the lattice at a specific (ideally, linear) rate as time goes on.
In this paper we want to discuss a notion of spatial delocalization. Since the wavefunctions corresponding to absolutely continuous spectrum are not square summable, a natural interpretation of spatial delocalization is to consider a sequence of growing “boxes” or finite graphs (GN) approximating the infinite system in some sense, and ask if the eigenfunctions on (GN) become delocalized as N→∞. Can they concentrate on small regions, or, on the opposite, are they uniformly distributed over (GN) ? Large, finite graphs are also a subject of interest on their own. Actually, an infinite system is often an idealized version of a large finite one.
Localization/delocalization of eigenfunctions is believed to bear some relation with spectral statistics : localization is supposedly associated with Poissonian spectral statistics, whereas delocalization should be associated with Random Matrix statistics (GOE/GUE). In the field of quantum chaos, the former notion is often associated with integrable dynamics and the latter with chaotic dynamics [18, 19, 20]. However, specific examples show that the relation is not so straightforward [40, 41, 35] Understanding how far one can push these ideas is one amongst many reasons for studying models of large graphs [32, 42, 43].
Recently, the question of delocalization of eigenfunctions of large matrices or large graphs has been a subject of intense activity. Let us mention several ways of testing delocalization that have been used. Let MN be a large symmetric matrix of size N×N, and let (ψj)j=1N be an orthonormal basis of eigenfunctions. The eigenfunction ψj defines a probability measure
∑x=1N∣ψj(x)∣2δx. The goal is to compare this probability measure with the uniform measure, which puts mass 1/N on each point.
•
ℓ∞ norms : Can we have a pointwise upper bound on ∣ψj(x)∣, in other words, is ∥ψj∥∞ small, and how small compared with 1/N ?
•
ℓp norms: Can we compare ∥ψj∥p with N1/p−1/2 ? In [2], a state ψj is called non-ergodic (and multi-fractal) if ∥ψj∥p behaves like
Nf(p) with f(p)=1/p−1/2. Related criteria appear in [5].
•
*Scarring : * Can we have full concentration (∑x∈Λ∣ψj(x)∣2≥1−ϵ) or partial concentration (∑x∈Λ∣ψj(x)∣2≥ϵ) with Λ a set of “small” cardinality ? We borrow the term “scarring” from the term used in the theory of quantum chaos [40].
•
Quantum ergodicity : Given a function a:{1,…,N}⟶C, can we compare ∑xa(x)∣ψj(x)∣2 with N1∑xa(x) ? This criterion, borrowed again from quantum chaos, was applied to discrete regular graphs in [9, 7]. Quantum ergodicity means that the two averages are close for mostj. If they are close for allj, one speaks of quantum unique ergodicity.
As was demonstrated in a recent series of papers, adding some randomness may allow to settle the problem completely. For instance almost sure optimal ℓ∞-bounds and quantum unique ergodicity for various models of random matrices and random graphs, such as Wigner matrices, sparse Erdös-Rényi graphs, random regular graphs of slowly increasing or bounded degrees were obtained in [29, 30, 22, 28, 13, 14, 15]. The invariance of the probability distribution under certain elementary transformations plays an important role. The completely different point of view that we adopt is to consider deterministic graphs and to prove delocalization as resulting directly from the geometry of the graphs. Up to now, in this deterministic setting, only eigenfunctions of the adjacency matrix of regular graphs have been treated, taking advantage of the completely explicit Fourier analysis on regular trees. The papers [9, 24, 7] give various proofs of quantum ergodicity; the paper [23] proves the absence of scarring on sets of cardinality N1−ϵ and also contains (although not stated) a logarithmic upper bound on the ℓ∞ norms.
The aim of this paper is to prove a quantum ergodicity theorem for eigenfunctions of discrete Schrödinger operators on quite general large graphs. As we will see, a particularly interesting point of our result is that it gives a direct relation between spectral delocalization of infinite systems and spatial delocalization of large finite system. Our result may be summarized as follows (with proper additional assumptions to be described later) :
“If a large finite system is close (in the Benjamini-Schramm topology) to an infinite system having purely absolutely continuous spectrum in an interval I, then the eigenfunctions (with eigenvalues lying in I) of the finite system satisfy quantum ergodicity.”
1.2. The results
Consider a sequence of connected graphs without self-loops and multiple edges (GN)N∈N. We assume each vertex has at least 3 neighbours. It will be convenient to write GN as a quotient of a tree GN by a group of automorphisms ΓN, that is, GN=ΓN\GN, where ΓN acts freely on the vertices of GN, i.e. given v∈GN, γ1v=γ2v implies γ1=γ2. In other words,
GN is the “universal cover” of GN.
We will work under the assumption that the degree of GN is everywhere smaller than some fixed D.
We denote by VN and EN the set of vertices and edges of GN, respectively.
We denote by VN and EN the vertices and edges of GN, respectively. We assume ∣VN∣=N and work in the limit N⟶∞.
Define the adjacency operator AN:CGN→CGN by
[TABLE]
where v∼w means v and w are nearest neighbours.
The operator AN
is bounded on ℓ2(GN). It also preserves the space of ΓN-invariant functions on VN, in other words it defines an operator on ℓ2(VN), that we denote by AN
(we will drop the index N and write A,A when no confusion may arise).
Consider a bounded function WN:VN⟶R such that WN(γ⋅v)=WN(v) for all γ∈ΓN. The operator of multiplication by WN
is bounded on ℓ2(GN); it also preserves the space of ΓN-invariant functions on VN, thus it defines an operator on ℓ2(VN), that we denote by WN. We define the discrete Schrödinger operators
HN=AN+WN and HN=AN+WN. The central object of our study are the eigenfunctions of HN, and their behaviour (localized/delocalized) as N⟶+∞. The fact that ΓN acts freely implies that HN is symmetric (self-adjoint) on ℓ2(VN).
For comfort, we will always work under the assumption that WN takes values in some fixed interval [−A,A]. This implies that the spectrum of all operators we will encounter is contained in some fixed interval I0=[−A−D,A+D].
We define the Laplacian PN:CVN→CVN by
[TABLE]
where dN(x) stands for the number of neighbours of x. If we introduce the positive measure on VN assigning to x the weight dN(x), then PN is self-adjoint on ℓ2(VN,dN).
We shall assume the following conditions on our sequence of graphs:
(EXP) The sequence (GN) forms an expander family. By this we mean that the Laplacian PN has a uniform spectral gap in ℓ2(VN,dN). More precisely, the eigenvalue 1 of PN is simple, and the spectrum of PN is contained in [−1+β,1−β]∪{1}, where β>0 is independent of N.
Note that 1 is always an eigenvalue, corresponding to constant functions. Our assumption implies in particular that each GN is connected and non-bipartite.
It is well-known that a uniform spectral gap for PN is equivalent to a Cheeger constant bounded away from [math] (see for instance [26], §3).
Our second assumption is that (GN) has few short loops:
(BST)
For all r>0,
[TABLE]
where ρGN(x) is the injectivity radius at x, i.e. the largest ρ such that the ball BGN(x,ρ) is a tree.
The general theory of Benjamini-Schramm convergence (or local weak convergence), briefly recalled in Appendix A, allows us to assign a limit object to the sequence (GN,WN), which is a probability distribution carried on trees. More precisely, up to passing to a subsequence, assumption (BST) above is equivalent to the following assumption.
(BSCT) The sequence (GN,WN) has a local weak limit P which is concentrated on the set of (isomorphism classes of) coloured rooted trees, denoted T∗D,A.
Assumption (BSCT) says that (GN,WN) converges in a distributional sense to a random system of rooted trees {[T,o]}, endowed with a map W:T⟶R. More precisely, the empirical measure of (GN,WN), defined by choosing a root x∈VN uniformly at random, converges weakly to a probability measure P concentrated on trees.
If [T,o,W]∈T∗D,A and A is the adjacency matrix of T, we denote by H=A+W the limiting random Schrödinger operator, which is self-adjoint on ℓ2(T).
Call (λj(N))j=1N the eigenvalues of HN on ℓ2(VN).
Assumption (BSCT) implies the convergence of the empirical law of eigenvalues : for any continuous χ:R⟶R, we have
[TABLE]
see Remark A.3. Here E is the expectation with respect to P, that is,
[TABLE]
The measure ρ is called the integrated density of states in the theory of random Schrödinger operators.
We need some notation for our last assumption. Let [T,o,W]∈T∗D,A. Given x,y∈T, and γ∈C∖R, we introduce the Green function
[TABLE]
Given v,w∈T with v∼w, we denote by T(v∣w) the tree obtained by removing from the tree T the branch emanating from v that passes through w. We define the restriction H(v∣w)(u,u′)=H(u,u′) if u,u′∈T(v∣w) and zero otherwise. The corresponding Green function is denoted by G(v∣w)(⋅,⋅;γ). We then put ζ^wγ(v):=−G(v∣w)(v,v;γ).
(Green) There is a non-empty open set I1, such that for all s>0 we have
[TABLE]
To understand (Green), define the (rooted) spectral measure of [T,o,W]∈T∗D,A by
[TABLE]
Assumption (Green) implies that supλ∈I1,η0>0E(∣Gγ(o,o)∣2)<∞; see Remark A.4. As shown in [33], this implies that for P-a.e. [T,o,W]∈T∗D,A, the spectral measure μo is absolutely continuous in I1, with density π1ImGλ+i0(o,o). Hence, (Green) implies that P-a.e. operator H has purely absolutely continuous spectrum in I1. This is a natural assumption since our aim is to prove delocalization properties of eigenfunctions.
Now let (ψj(N))j=1N be an orthonormal basis of ℓ2(VN) consisting of eigenfunctions of HN. Pick j∈{1,…,N}. The problem of quantum ergodicity is to understand if the probability measure ∑x∈VN∣ψj(N)(x)∣2δx on VN
is “localized” (essentially carried by o(N) vertices) or “delocalized” (ideally, close to the uniform measure on VN, or maybe, to some other natural measure on VN, comparable to the uniform measure). More generally, we want to know if the correlations ψj(N)(x)ψj(N)(y), for x and y∈VN at some fixed distance, approach some limiting object.
From a mathematical point of view, the question was addressed in [9, 24] for eigenfunctions of the adjacency matrix of large deterministic regular graphs, and for the adjacency matrix of random regular graphs or Erdös-Rényi graphs in the recent works [28, 13, 14, 15]. The main motivation of our paper is to extend the results of [9] to disordered systems, that is, to non-regular graphs, possibly with a potential on the vertices or weights on the edges. This necessarily requires a different method from that of [9], that was specific to regular graphs. New methods to prove quantum ergodicity were already explored in [7]. We insist on the fact that, contrary to [28, 13, 14, 15, 31], our sequence of graphs and potentials are deterministic. The results may in particular be applied to random graphs and/or random potentials, provided one knows that Assumptions (EXP), (BSCT) and (Green) hold true for some realizations. We discuss the relation with existing work more extensively in Section 1.5.
Let us state the main abstract result; its concrete meaning will be explored afterwards. For x,y∈VN, and γ∈C∖R, we introduce the lifted Green function
[TABLE]
Recall that we write GN as a quotient ΓN\GN where GN is a tree. We denote by DN a fundamental domain of the action of ΓN on the vertices of GN. Thus DN contains N vertices of GN, each of them projecting to a distinct vertex of GN.
Let I1 be the open set of Assumption (Green), and let us fix an interval I (or finite union of intervals) such that Iˉ⊂I1.
Theorem 1.1**.**
Assume that the graphs GN and the potentials WN satisfy (BSCT), (EXP) and (Green).
Call (λj(N))j=1N the eigenvalues of the Schrödinger operator HN on ℓ2(VN), and let (ψj(N))j=1N be a corresponding orthonormal eigenbasis.
For each N, let a=aN be a function on VN with supNsupx∈VN∣aN(x)∣≤1. For γ∈C∖R, define ⟨a⟩γ=∑x∈VNa(x)ΦγN(x~,x~), where ΦγN(x~,x~)=∑x~∈DNImg~Nγ(x~,x~)Img~Nγ(x~,x~). Then
[TABLE]
Here, x~ is a lift of x∈VN in the universal cover VN.
Corollary 1.2**.**
Under the same assumptions, for any ϵ>0, we have
[TABLE]
More generally, we have the following result on eigenfunction correlators, which says that ψj(x)ψj(y) “approaches” the function Φλj+i0N(x~,y~) defined in (1.5). For technical reasons we have to assume the (ψj) are real-valued. More precisely, we need ψj(x)ψj(y) to be real for any j=1,…,N and x,y∈VN with x∼y.
Theorem 1.3**.**
Assume that (GN,WN) satisfies (BSCT), (EXP) and (Green).
Call (λj(N))j=1N the eigenvalues of HN on ℓ2(VN), and let (ψj(N))j=1N be a corresponding orthonormal eigenbasis. Assume the (ψj)j=1N are real-valued.
Fix R∈N. For each N, let K=KN be an operator on ℓ2(VN) whose kernel K=KN:VN×VN⟶C is such that K(x,y)=0 for d(x,y)>R (in other words K is supported at distance ≤R from the diagonal). Assume that supNsupx,y∈VN∣KN(x,y)∣≤1.
For γ∈C∖R, define
[TABLE]
Then
[TABLE]
The “kernel” above is the matrix of K in the basis (δx), i.e. K(x,y)=⟨δx,Kδy⟩ℓ2(VN). To define (1.5) properly, we lift K to VN×VN by letting
[TABLE]
if x,y∈VN=ΓN\VN are the projections of x~,y~∈VN.
If we know in addition that ρ(∂I1)=0, where ρ is the integrated density of states measure (1.2), then our main theorems hold with I replaced by I1; see the end of Section 10. Note that if (Green) holds on I1, then ρ(∂I1)=0.
Although we tend to skip it from the notation, the “observables” K and a necessarily depend on N. On the other hand, they do not depend on j, the index of the eigenfunction (they are actually allowed to depend on λj(N) in the proof, but this dependence cannot be wild, it has to be at least continuous).
We interpret Corollary 1.2 as follows : for a given observable a, the average ∑x∈VNa(x)∣ψj(N)(x)∣2 is close to ⟨a⟩λj(N)+iη0 for most indices j. It follows similarly from Theorem 1.3 that
∑x,y∈VNK(x,y)ψj(N)(x)ψj(N)(y) is close to ⟨K⟩λj(N)+iη0 for most j. One of the subtleties of the result is that the indices j
for which this holds may a priori depend on the observables a, K. If we wanted to have a common set of indices j that do the job for all observables (whose number is exponential in N), we would need to have an exponential rate of convergence in Theorems 1.1 and 1.3. As is seen in the case of regular graphs and W=0 [7], our proof gives a rate that is at best a negative power of the girth, which is itself typically of order logN. So, the result is far from showing that ∣ψj(N)(x)∣2 is close to the uniform measure in total variation.
Note the presence of the extra parameter η0, in comparison with the case of regular graphs [9, 7]. This is due to the fact that, generally speaking, the quantities ⟨a⟩λj(N)+iη0 and ⟨K⟩λj(N)+iη0 are not necessarily bounded as η0↓0 for fixed N. They will however stay bounded in the limits N→+∞ followed by η0↓0 (as a result of (A.14) and (Green)).
1.3. Understanding the weighted averages.
In order to clarify the relevance of Theorems 1.1 and 1.3, we now investigate the meaning of the quantities ⟨a⟩λ+iη0 and ⟨K⟩λj+iη0. Let us start with Theorem 1.1. A good illustration is to choose aN=1lΛN, the characteristic function of a set ΛN⊂VN of size ≈αN for some α∈(0,1), say α=21.
In the special case where (GN) is regular and HN=AN, and also for the anisotropic model treated in [7], the Green function g~Nγ(x~,y~) does not depend on N, as it coincides with the limiting Green function Gγ(x~,y~). Moreover, Gγ(x~,x~)=Gγ(o,o) for all x~∈DN. It follows that ⟨1lΛN⟩λj+iη0=∑x∈ΛNNGλj+iη0(o,o)Gλj+iη0(o,o)=α. So Corollary 1.2 implies that ∥1lΛNψj(N)∥2≈α for most ψj(N). This shows that most ψj(N) are uniformly distributed, in the sense that if we consider any ΛN⊂VN containing half the vertices, we find half the mass of ∥ψj(N)∥2. As we show in the next subsection, such interpretation is also valid for the Anderson model.
For general models, we cannot assert that ⟨1lΛN⟩λ+iη0=α. Still, we prove in Section A.3 that there exists cα>0 such that for any ΛN⊂VN with ∣ΛN∣≥αN, we have
For any α∈(0,1), there exists cα>0 such that for any ΛN⊂VN with ∣ΛN∣≥αN, we have
[TABLE]
Hence, while in the simple case we had ∥1lΛNψj(N)∥2≈α for most ψj(N), in the general case, we can still assert that ∥1lΛNψj(N)∥2≥cα>0 for most ψj(N). This indicates that our theorem can truly be interpreted as a delocalization theorem. The bad indices j (for which ∥1lΛNψj(N)∥2<cα) will a priori depend on ΛN.
We now turn to the general averages ⟨K⟩γj. Recall that ΦγN(x~,y~)=∑x~∈DNImg~Nγ(x~,x~)Img~Nγ(x~,y~). We will show in Section A.3 that under assumption (BSCT), we have
[TABLE]
uniformly in λ∈I0. This already shows that ΦγN(x~,y~) is of order 1/N, since the denominator in its expression is of order N. We strengthen this observation by proving that for any continuous F:R→R,
we have uniformly in λ∈I0,
[TABLE]
This says that the empirical distribution of (NΦγN(x~,y~)) (when x is chosen uniformly at random in VN and y is then chosen uniformly among the points at distance k from x) converges to the law of (E(ImGγ(o,o))ImGγ(o,v)) (v being chosen uniformly among the points at distance k from the root o). This is a second way of saying that ΦγN(x~,y~) is of order 1/N : when multiplied by N, it has a non-trivial limiting distribution.
1.4. Case of the Anderson model
It is important to check that the models covered by the assumptions of our main theorems are not reduced to the case of the laplacian on regular graphs, already treated in [9, 24, 7]. Here we consider the important case of the Anderson model on regular graphs, i.e. the laplacian with a random potential. We will show that, if the strength of the disorder is small enough, then the assumptions of Theorem 1.1 and 1.3 are satisfied for almost every realization of the potential.
Let Tq be the (q+1)-regular tree.
Let ν be a probability measure on R, supported on a compact interval [−A,A], and for every ϵ>0 let νϵ be the image of ν under the homothety x↦ϵx (νϵ is now supported on [−ϵA,ϵA]).
Let Ω=RTq, and define Pϵ on Ω by Pϵ=⊗v∈Tqνϵ. We shall denote by Eϵ the expectation with respect to Pϵ. Given ω=(ωv)∈Ω, define Wω(v)=ωv for v∈Tq. Then the {ωv}v∈Tq are i.i.d. random variables with common distribution νϵ. Here ϵ∈R is fixed and parametrizes the strength of the disorder.
Let GN=(VN,EN) be a (deterministic) sequence of (q+1)-regular graphs with ∣VN∣=N. This means that GN=Tq for all N. Let ΩN=RVN and PNϵ=⊗x∈VNνϵ on ΩN. We denote Ω=∏N∈NΩN and let Pϵ be any probability measure on Ω having PNϵ as a marginal on the factor ΩN. Given (ωN)N∈N∈Ω, so that ωN=(ωx)x∈VN∈ΩN, we define WωN(x)=ωx for x∈VN.
The results of this section are proved in a companion paper [11].
Proposition 1.5**.**
Suppose (GN) satisfies (BST). Then
(BSCT) holds for Pϵ-almost every realization of the potential. More precisely, for Pϵ-a.e. (ωN)∈Ω, the sequence (GN,WωN) has a local weak limit Pϵ which is concentrated on {[Tq,o,Wω]:ω∈Ω}, where o∈Tq is fixed and arbitrary. The measure Pϵ acts by taking the expectation w.r.t. Pϵ, that is, if D=q+1, then
[TABLE]
We make the following assumption on the random variables:
(POT) The measure ν is Hölder continuous, i.e. there exist Cν>0 and b∈(0,1] such that ν(I)≤Cν∣I∣b for all bounded I⊂R.
The following proposition is by no means trivial, it comes from the results of [33, 4].
Proposition 1.6**.**
Fix 0<λ0<2q. There exists ϵ(λ0) such that if ∣ϵ∣<ϵ(λ0), then assumption (Green) holds for the measure Pϵ of Proposition 1.5 on I1=(−λ0,λ0).
Corollary 1.7**.**
If the graphs GN form an expander family and satisfy (BST) and if the disorder ϵ is small enough, the conclusions of Theorems 1.1 and 1.3 hold true for Pϵ-a.e. realization (ωN)∈Ω, with I1=(−λ0,λ0).
This gives a rich enough family of examples where the assumptions of Theorems 1.1 and 1.3 hold true. Thus the conclusions of the theorems hold for any observables aN,KN. If in addition aN or KN are independent of the disorder, some extra averaging takes place, and we may replace ⟨K⟩λ+iη0 by a simpler average as follows.
Theorem 1.8**.**
Assume that (POT), (EXP) and (BST) hold. Given (ωN)∈Ω, let (ψiωN)i=1N be an orthonormal basis of eigenfunctions of HNω=AN+WωN in ℓ2(VN), with corresponding eigenvalues (λiωN)i=1N.
Let KN:VN×VN→C, supNsupx,y∈VN∣KN(x,y)∣≤1, KN(x,y)=0 if d(x,y)>R, and assume KN is independent of (ωN). Fix 0<λ0<2q. If ∣ϵ∣<ϵ(λ0), we have for Pϵ-a.e. (ωN),
[TABLE]
where for γ∈C∖R
[TABLE]
As in the previous theorems, if R=0, the ψj are arbitrary, while if R>0, we assume the ψj are real-valued.
For the Anderson model, Eϵ(ImGγ(v,w)) depends only on d(v,w) : Eϵ(ImGγ(v,w))=Eϵ(ImGγ(o,u)) where u is any vertex of Tq such that d(o,u)=d(v,w).
In the special case R=0, we have ⟨aN⟩λη0=N1∑x∈VNa(x). So choosing aN=1lΛN, Theorem 1.8 implies the strong form of delocalization given by the uniform distribution of ψj(N) on VN, as explained in Section 1.3.
1.5. Relation with previous work
Our main Theorem 1.3 holds for deterministic sequences of graphs and potentials. For any sequence (GN,WN) satisfying the assumptions of the theorem, the conclusion holds for any observable K; in particular, K may depend on the graphs. As already noted, the result only says something about the delocalization of “most” eigenfunctions, where the “good” eigenfunctions exhibiting delocalization may depend on the choice of the observable K.
In the past years, there has been tremendous interest in spectral statistics and delocalization of eigenfunctions of random sequences of graphs and potentials. Many papers consider random regular graphs, with degree going slowly to infinity [46, 27, 13, 14] or fixed [31, 15], sometimes adding a random i.i.d potential [31]. In particular, the recent papers [13, 14, 15] show “quantum unique ergodicity” for the adjacency matrix of random regular graphs : given an observable aN:{1,…,N}⟶R, for most (q+1)-regular graphs on the vertices {1,…,N} we have that
∑x=1NaN(x)∣ψj(N)(x)∣2 is close to ⟨aN⟩ for all indices j. This is a considerable strengthening of Corollary 1.2 (or of the similar result in [9]), that only says something for most indices j. This possibility to prove QUE is, of course, due to the fact that aN has to be independent of the choice of the graph and that results holds for almost all graphs.
When “ergodicity” of eigenfunctions is tested numerically as in the physics papers [2, 3], it is natural to first pick a realization of the graph and of the potential, and then test the eigenfunctions one by one to determine if they can be localized in small parts of the graph. It is then natural to allow the test-observables to depend on the graph and the potential (which our Theorem 1.3 does, but not the results of [13, 15]), but also on the index j of the eigenfunction, which neither of the rigourous mathematical results achieves. The numerical results of [3] seem to indicate that, as soon as a random disorder is turned on, the eigenfunctions will be localized in small parts of the graph. This is not in contradiction with our results : the region of localization of ψj(N) might depend on j, but our result does not allow to test this. Note also that the results of [2, 3] were recently questioned in [45], where the authors argue that N has not been taken large enough to see the delocalization take place.
The paper [12] proves a very important result, saying that if ψj is an “almost eigenvector” of the adjacency matrix on a random regular graph G, then for almost all G and all j, the value distribution of ψj(x) as x runs over {1,…,N} is close to a Gaussian N(0,σj2) with σj≤1. Proving that σj=1 is a challenge; it would amount to proving that eigenfunctions cannot be localized in small parts of the graph. Our result does not say this, again because we can only test one observable a at a time.
The indices j for which Corollary 1.2 proves delocalization depend on a. If we wanted to have a common set of indices j that do the job for all observables (whose number is exponential in N), we would need to have an exponential rate of convergence in Theorems 1.1, 1.3. Our proof gives a rate that is at best a negative power of the girth (itself typically of order logN).
Finally we would also like to mention the paper [21], where existence of absolutely continuous spectrum for percolation graphs on the (q+1)-regular tree is proven, if the percolation parameter is close enough to 1. Since the absolutely continuous spectrum is mixed with purely discrete spectrum, one cannot expect a quantum ergodicity result that claims delocalization of most eigenfunctions, but only a “partial delocalization” result for a positive proportion of eigenfunctions. These are the contents of [21, Theorem 9]. It would be nice to investigate what the methods of our paper would give for that model.
1.6. Outline of the proof
We borrowed the name “Quantum Ergodicity” from a result about laplacian eigenfunctions on Riemannian manifolds [44, 47, 25, 48].
The proof in the setting of laplacian eigenfunctions on manifolds is made of 4 steps, of unequal difficulty . These 4 steps are also present in our proof :
Step 0. Define the quantum variance. The goal is to show that this goes to [math] as N→∞. A novelty of our proof is that we replace the usual quantum variance (10.1) by a “non-backtracking” one (3.3), where we replace the eigenfunctions ψj by eigenfunctions fj,fj∗ of a non-backtracking random walk (Section 3). These new fj,fj∗ are thus eigenfunctions of a non-selfadjoint problem. This causes new difficulties, that however will be compensated by the fact that the non-backtracking random walk has simpler trajectories than the “simple” random walk generated by the adjacency matrix A.
Step 1. Show that the quantum variance is controlled by the Hilbert-Schmidt norm of K. Although this is obvious for the original quantum variance, this will be much harder for the “non-backtracking quantum variance” (Section 4). This uses (BSCT) and (Green).
Step 2. Due to the fact that fj,fj∗ satisfy an eigenfunction problem, the quantum variance is invariant under certain transformations (Section 5).
Step 3. One should see behind these transformations the emergence of a “classical dynamical system”. In the setting of laplacian eigenfunctions on manifolds, this is the geodesic flow. Here, what we get is a family of stationary Markov chains on the set of infinite non-backtracking paths (Section 6, Remark 6.1). This step has been called “classicalization” by U. Smilansky in a private conversation; this is supposed to mean the opposite of “quantization”.
Step 4. Iterate the classical dynamical system, use its ergodicity to show that the quantum variance is small (Section 9). Here, the ergodicity of our Markov chains (more precisely, the fact that the mixing rate is independent on N) comes from the (EXP) condition. Assumption (Green) is also used to control the probability transitions.
There is an additional step that does not exist in the traditional setting :
Step 5. Translate the result for the “non-backtracking quantum variance” (involving fj,fj∗) into a result for the original one, involving the ψj (Section 10).
Assumptions (EXP), (BSCT) and (Green) are used here again to show that the transformation sending ψj to fj,fj∗ is well-behaved in the limit N⟶+∞.
2. Basic identities
2.1. “Quantization procedure” on trees and their quotients
Let G=GN, G=(V,E). Most of the time we will drop the subscript N in the notation. As in Section 1.2, we regard G as a quotient: G=Γ\G, and let π:V→V denote the projection. Fix a fundamental domain D⊂V for the action of Γ on V. Then ∣D∣=∣V∣.
Each edge {x0,x1}∈E, gives rise to two oriented edges e=(x0,x1) and e^=(x1,x0) in the reverse direction. We let oe and te be the origin and terminus of e, respectively. We then let B1, or simply B, be the set of all such oriented edges of G. More generally, let Bk be the set of non-backtracking paths of length k in G. By convention, B0:=V. If ω=(x0,…,xk) and ω′=(x0′,…,xk′)∈Bk, we write ω⇝ω′ if x0′=x1,…,xk−1′=xk and (x0,…,xk,xk′)∈Bk+1. We also denote oω=x0, tω=xk.
These notions descend to the quotient. We denote by Bk:=Γ\Bk the set of non-backtracking paths of length k in G. By convention, B0:=V. For k=1 we let B=B1.
The set Bk is in bijection with the subset D(k)⊂Bk of elements having their origin in D.
Let Hk=CBk (the complex-valued functions on Bk), H=⊕k=0∞Hk and H≤k:=⊕ℓ=0kHℓ.
It will be convenient to identify CBk with the Γ-invariant elements of CBk or with CD(k). For K∈Hk and (x0,…,xk)∈Bk, we will sometimes use the short-hand notation K(x0;xk) for K(x0,…,xk). This is justified by the fact than on G, the endpoints (x0;xk) determine the path (x0,…,xk) uniquely. We will also use this short-hand notation on Bk, although in that case one should keep in mind that K(x0;xk) actually depends on the full path (x0,…,xk).
Any K∈Hk (regarded as a Γ-invariant element of CBk) may be used to define an operator K on the space of finitely supported functions on V, with kernel
⟨δv,Kδw⟩ℓ2(V)=K(v;w). It also defines an operator KG on CV, with kernel
[TABLE]
where x~,y~∈V are representatives of x,y∈V. The map K∈Hk↦KG is a priori not one-to-one. However, if ρG(x)≥k, then KG(x,⋅) determines K(x~,⋅) uniquely. To see that K∈Hk↦KG is surjective, consider k:V×V⟶R supported at distance k from the diagonal, and let K(x~,y~)=k(π(x~),π(y~))1ldist(x~,y~)≤k(♯{γ∈Γ,dist(x~,γ⋅y~)≤k})−1. Then KG=k and this coincides with the lift (1.6) except at the few points where ρG(x)≤k.
Define the non-backtracking adjacency operator B:CB→CB by
[TABLE]
where Nx means the set of neighbours of x.
Then an element K∈Hk may also be used to define an operator KB on ℓ2(B), with kernel
[TABLE]
Thus ⟨δb1,KBδb2⟩ℓ2(B)=0 only if there is a non-backtracking path of length k in G, starting with the oriented edge b1 and ending with b2.
Finally, K∈Hk also defines an operator KB on CB, with matrix KB:B×B→C given by
[TABLE]
where b~1,b~2∈B are lifts of b1,b2∈B.
By linearity, this extends to K∈H≤k.
Note that if K∈Hk, then ⟨ψ,KGϕ⟩ℓ2(V)=∑(x0,…,xk)∈Bkψ(x0)K(x0;xk)ϕ(xk) for any ψ,ϕ∈ℓ2(V). Similarly, if f,g∈ℓ2(B), we have
[TABLE]
[TABLE]
where ∑x0,1(x2;xk) sums over all (x2;xk)∈Bk−2 such that x2∈Nx1∖{x0}. Alternatively, we may simply sum over (x2;xk)∈Bk−2 but decide that K(x0;xk)=0 if the path (x0,…,xk) back-tracks.
Remark 2.1**.**
The maps K↦K, K↦KG, K↦KB and K↦KB associate an operator to a function on the set of paths. It is tempting to view this as a form of “quantization procedure” as those used for quantum ergodicity on manifolds.
2.2. Green functions on trees
Assumption (BST) says that our graphs have few short loops, in other words, that most balls of a given radius look like trees. One of the ingredients of our proof is that the Green function
on trees satisfies certain algebraic relations, that follow from the fact that removing a vertex (or cutting an edge) from a tree suffices to disconnect it.
Here we recall some standard facts that hold for an arbitrary treeT=(V(T),E(T)), endowed with a discrete Schrödinger of the form H=A+W acting on ℓ2(V(T)), where A is the adjacency matrix and W:V(T)⟶R is a bounded function. Given γ∈C∖R and v,w∈T, the Green function is denoted in this section by
[TABLE]
If v∼w, we denote by T(v∣w) the tree obtained by removing from T the branch emanating from v that passes through w. We define the restriction H(v∣w)(u,u′)=H(u,u′) if u,u′∈T(v∣w) and zero otherwise. The corresponding Green function is denoted by g~(v∣w)(⋅,⋅;γ). We finally denote
[TABLE]
Later on, we will apply these results for (T,W)=(GN,WN). In this case the (full) Green function will be denoted by g~Nγ(x,y), and the restricted one by ζxγ(y). In the case (T,W)=(T,W) (the random coloured rooted trees of assumption (BSCT)), the Green function will be denoted by Gγ(v,w), and the restricted one by ζ^wγ(v). As a general rule, the objects defined on the limit (T,W) will wear a hat ⋅^ to distinguish them from similar objects defined on (GN,WN) (see also Remark A.3).
The Green functions on trees satisfy some classical recursive relations; the following lemma is proved for instance in [10]. Given v∈V(T), we denote by Nv its set of nearest neighbours.
Lemma 2.2**.**
For any v∈T and γ∈C∖R, we have
[TABLE]
For any non-backtracking path (v0;vk) in T,
[TABLE]
[TABLE]
Also, for any w∼v, we have
[TABLE]
For any v,w∈T, we have
[TABLE]
Next, if γ=λ±iη with λ∈R, η>0, then
[TABLE]
Finally, if Ψγ,v(w)=ImG(v,w;γ), then for any path (v0,…,vk) in T, k≥1,
[TABLE]
Note that ∣ζvλ+iη(u)∣≤η−1. It follows from (2.4b) that for any λ∈[−(A+D),A+D] and η∈(0,1),
[TABLE]
where cD,A=2(A+D)+1.
Corollary 2.3**.**
Given γ∈C∖R, for any v0,v1∈T, v0∼v1, we have
[TABLE]
Also, for any non-backtracking path (v0;vk) in T, k≥1, we have
[TABLE]
Proof.
By (2.10), Ψγ,v0(v1)−ζv0γ(v1)Ψγ,v0(v0)=Imζv0γ(v1)G(v0,v0;γ). As Ψγ,v1(v0)=Ψγ,v0(v1), we thus get using (2.6),
[TABLE]
Next, since G(v1,v1;γ)=ζv1γ(v0)G(v0,v1;γ) and ζv1γ(v0)1=ζv0γ(v1)+2mv0γ, we have
[TABLE]
so
[TABLE]
and thus
[TABLE]
This completes the proof of the first claim, by (2.14). Next, we use again that Ψγ,v0(v1)−ζv0γ(v1)Ψγ,v0(v0)=Imζv0γ(v1)G(v0,v0;γ). In addition, by (2.2),
[TABLE]
where the last equality is proved as in (2.15). This proves the second claim for k=1.
Now let k≥2. If we apply (2.10) with v1 instead of v0 and use (2.6), we get
We conclude by recalling the fact that for Lebesgue a.e. λ∈R, the Green function has a finite limit on the real axis almost surely. Remember that T∗D,A us the set of coloured rooted trees, and that P is the probability measure on T∗D,A appearing in (BSCT).
Proposition 2.4**.**
There exists a Lebesgue-null set A⊂R such that, to each λ∈S:=R∖A, there is Ωλ⊆T∗D,A with P(Ωλ)=1, such that if [T,o,W]∈Ωλ, then the limit G(v,w;λ+i0):=limη↓0G(v,w;λ+iη) exists for any v,w∈T.
Proof.
Fix [T,o,W]. By [10, Lemma 3.3], there is a Lebesgue-null set A[T,o,W]⊂R such that for any λ∈S[T,o,W]:=R∖A[T,o,W], G(v,w;λ+i0) exists for all v,w∈T. Let D={([T,o,W],λ): the limit does not exist}. Then
[TABLE]
where D[T,o,W]={λ∈R:([T,o,W],λ)∈D}. Since D[T,o,W]⊆A[T,o,W], we have Leb(D[T,o,W])=0 for all [T,o,W]. Hence,
[TABLE]
where Dλ={[T,o,W]∈T∗D,A:([T,o,W],λ)∈D}. It follows that P(Dλ)=0 on a Lebesgue-full set A. Taking Ωλ=Dλc completes the proof.
∎
3. The non-backtracking quantum variance
Our strategy follows the one discovered in [7]. We find a transformation turning the eigenfunctions of A+W on G=Γ\G into eigenfunctions of a “non-backtracking” random walk. The new operator is not self-adjoint, but this difficulty is superseded by the fact that the trajectories of non-backtracking random walks (on a tree) are much simpler than those of usual random walks.
The notation is the same as in the introduction except that we drop the subscript N. Suppose (ψj) is an orthonormal basis of eigenfunctions for H=A+W, say Hψj=λjψj.
Fix η0∈(0,1), let γj=λj+iη0 and let
[TABLE]
where ζxγ(y)=−g~N(y∣x)(y,y;γ) (see notation in §2.2). If B is the non-backtracking operator (2.1), we have
In [7] it was possible to set η0=0, and (3.1) said exactly that fj was an eigenfunction of the weighted non-backtracking operator Bζγj
for the eigenvalue 1. At our level of generality, we do not know if ζλj+i0 is well-defined on GN. We have to work with η0>0 and let η0 tend to [math] only at the end of the proof, after N has gone to ∞. Hence, fj is not exactly an eigenfunction, and our formulas will contain error terms of size η0 that we will need to estimate precisely, to show that they disappear as N→+∞, followed by η0↓0.
Similarly, if we put
[TABLE]
we note that fj∗=ιfj where ι is the edge reversal involution, and we get
[TABLE]
Let I be an open interval such that I⊂I1. We define for K∈Hk,
[TABLE]
The dependence of this quantity on η0 is hidden in the definition of fj,fj∗. The scalar product ⟨⋅,⋅⟩ is on ℓ2(B) endowed with the uniform measure; cf. (2.2).
Remark 3.1**.**
We call (3.3) “quantum variance”, in analogy to the quantity bearing this name in quantum chaos. However, there are some significant differences :
•
we use the functions fj and fj∗ instead of the original ψj. They are (quasi)-eigenfunctions, respectively of the non-selfadjoint operators Bζγj and B∗ιζγj.
•
if K is the identity operator Id, we do not have the normalization Varnb,η0I(Id)=1.
•
we did not take the square of ⟨fj∗,KBfj⟩ in the definition. This is purely for technical convenience, the square will appear later when we apply the Cauchy-Schwarz inequality.
We will need to extend (3.3) to operators K that depend on the eigenvalue λj in a holomorphic fashion, as spelled out in the following definition. Note that K also depends on N, also this tends to be implicit in our notation. We let C+={γ∈C,Imγ>0}.
Definition 3.2**.**
Assumptions (Hol).
We assume that γ↦Kγ=KNγ is a map from γ∈C+ to Hk such that :
•
For η0>0, for each N and (x0;xk), the function λ↦Kλ+iη0(x0;xk) from R→C has an analytic extension Kη0 to the strip {z:∣Imz∣<η0/2}.
•
Given η0>0, we have supNsupRez∈I1,∣Imz∣<η0/2sup(x0;xk)∣KN,η0z(x0;xk)∣<+∞ and supNsupRez∈I1,∣Imz∣<η0/2sup(x0;xk)∣∂zKN,η0z(x0;xk)∣<+∞. We write ∣∣∣K∣∣∣η0 for the maximum of these two quantities.
•
For all s>0,
[TABLE]
If γ↦Kγ is holomorphic on C+, then it obviously satisfies the first point of the definition with Kη0(z)=Kz+iη0.
For instance, if Kγ(x0;xk) has the form ∑n≥0a(x0;xk)(n)γn, then we see that λ↦Kλ+iη0(x0;xk) extends to Kη0(z)=∑n≥0a(x0;xk)(n)(z+iη0)n. Note that, although γ↦Kγ is not holomorphic, its restriction to an horizontal line is still a real-analytic map R∋λ↦Kλ+iη0(x0;xk), as it possesses an analytic extension given by z↦∑n≥0a(x0;xk)(n)(z−iη0)n. So Kγ will satisfy (Hol) if Kγ does.
Conditions (Hol) are stable under the sum and composition of operators.
Under assumptions (EXP), (BSCT), (Green), if Kγ∈Hk has the form Kγ=FγK for the operators Fγ in Corollary 10.3, then
[TABLE]
These γ↦FγK satisfy (Hol). The fact that this implies Theorem 1.3 is proven in Section 10, that may be read independently of the proof of Theorem 3.3.
4. Step 1 : Bound on the non-backtracking quantum variance
Given γ∈C+, we introduce a norm on each Hk, k≥1, defined by
[TABLE]
We denote by ⟨⋅,⋅⟩γ the associated scalar product. The reason for introducing the weight ∣ζxγ(y)∣2∣Imζxγ(y)∣ will be apparent in Section 6. The aim of this section is to prove Theorem 4.1. Here, we assume that I=(a,b), with [a,b]⊂I1. This implies that there is ηa,b such that (a−2η,b+2η)⊂I1 for all η≤ηa,b. We then assume that η≤min(η0/2,ηa,b).
Theorem 4.1**.**
Under assumptions (BSCT), (Green), if Kγ∈Hk satisfies the set of assumptions (Hol), then for any interval I=(a,b) as above,
[TABLE]
In the scheme of §1.6, this corresponds to Step 1. This is more complicated than usual, due to the fact that we have replaced the orthonormal family (ψj) by non-orthogonal functions (fj),(fj∗), and also because K “depends on λj” in (3.5).
Recall that D above is the maximal degree and we assumed ∣WN(x)∣≤A. In particular, any eigenvalue λj∈I0:=[−(A+D),A+D]. For λ∈R and η0∈(0,1), let
[TABLE]
Denoting γj=λj+iη0, we have (by a double application of the Cauchy-Schwarz inequality)
[TABLE]
We check at the end of the section that
[TABLE]
We now introduce an approximation χ of 1lI by an entire function, by the standard convolution procedure :
Fix 0<η≤η0/2. Let ϕ(x)=π1/21e−x2 and denote ϕϵ(x)=ϵ−1ϕ(x/ϵ). Let χ be the convolution χ=ϕη3/2∗1lI on R. Then χ extends to an entire function on C given by
[TABLE]
Note that 0≤χ(x)≤1 for x∈R, and ∣χ(z)∣≤eη5 for ∣Imz∣≤η4. We assume η is small enough so that χ≥311lI and ∣χ(z)∣≤e−1/η on {z∈C:∣Imz∣≤η4,d(Rez,I)≥2η}. We finally note that ∣∂t2∂χ(t1+it2)∣≤Cη−3eη5 for any z=t1+it2 with t1∈I0 and ∣t2∣≤η4.
where (x0;xk)=(x0,x1,x2,…,xk), (x0;yk)=(x0,x1,y2,…,yk) and with the convention that Kγj(x0;xk)=0 if the path (x0,x1,x2,…,xk) backtracks. The function λ↦∣αλ+iη0(x0,x1)∣2=∣ζx1λ+iη0(x0)∣2−Imζx1λ+iη0(x0) extends analytically to the rectangle R={z∈C:Rez∈[−(A+D+η),(A+D+η)],Imz∈[−η4,η4]} through the formula 2iζx1z+iη0(x0)ζx1z−iη0(x0)ζx1z−iη0(x0)−ζx1z+iη0(x0). We denote this by αη0z(x0,x1) (which is not the same as ∣αz+iη0(x0,x1)∣2). The same is true for the other ζ terms. We denote the extension of λ↦Kλ+iη0(x0;xk)Kλ+iη0(x0;yk) by Kη0z(x0;xk,yk). Again, if (x0;yk)=(x0;xk), this is not the same as ∣Kz+iη0(x0;xk)∣2. However, see Lemma 4.4 to compare both.
Given x,y∈V and z∈C∖R, let
[TABLE]
be the Green function of H on the finite graph G. Then by Cauchy’s integral formula,
[TABLE]
We now observe that the integral over the vertical segments of the contour do not contribute as η,η0↓0. More precisely,
Lemma 4.2**.**
The integral 2iπN−1∫z∈∂RF(z)dz in (4) may be replaced by 2iπN1(∫a−2ηb+2ηF(λ+iη4)dλ−∫a−2ηb+2ηF(λ−iη4)dλ, up to an error term at most Ck,D,Aη0−3η−4∣∣∣K∣∣∣η02e−1/η.
Proof.
The error is the integral of F(z) on the two vertical paths {Rez=−A−D−η,Imz∈[−η4,η4]},
{Rez=A+D+η,Imz∈[−η4,η4]}, and the four connected components of the set {Imz=±η4,Rez∈[−A−D−η,A+D+η]∖(a−2η,b+2η)}. On these pieces, we know that ∣χ(z)∣≤e−1/η. Moreover, ∣Kη0z(x0;xk,yk)∣≤∣∣∣K∣∣∣η02. Next, |{\alpha}_{\eta_{0}}^{z}|=\frac{1}{2}\big{|}\frac{1}{\zeta_{x_{1}}^{z+i\eta_{0}}(x_{0})}-\frac{1}{\zeta_{x_{1}}^{z-i\eta_{0}}(x_{0})}\big{|}\leq c_{D,A}\big{(}\frac{1}{\eta_{0}+\eta^{4}}+\frac{1}{\eta_{0}-\eta^{4}}\big{)} by (2.11). Since η≤η0/2 by assumtpion, this yields ∣αη0z∣≤CD,Aη0−1. The Green functions and ζ terms may be bounded similarly by 4cD,Aη0−2η−4. A factor Ck,D comes from the number of paths, divided by N.
∎
Our next aim is to lift this expression to the universal cover G. In other words, we wish to replace gz by g~z everywhere, to be able to use the identities of §2.2.
Lemma 4.3**.**
Denote z=λ+iη4. Given R∈N∗, there is dR,k,η>0 such that the integral 2iπN1∫a−2ηb+2ηF(z)dλ in Lemma 4.2 may be replaced by
[TABLE]
where ζekγ=ζxk−1γ(xk) and ζek′γ=ζyk−1γ(yk),
up to an error term (N#{ρG(x0)<dR,k,η}η−4+R1)Ck,D,Aη0−3∣∣∣K∣∣∣η02eη5.
Similarly, 2iπN1∫a−2ηb+2ηF(zˉ)dλ in Lemma 4.2 may be replaced by
[TABLE]
up to an error term (N#{ρG(x0)<dR,k,η}η−4+R1)Ck,D,Aη0−3∣∣∣K∣∣∣η02eη5.
Proof.
We first approximate λ↦gλ+iη4(x,y) by a polynomial on the compact interval I0. Let hη(t)=−(t−iη4)−1 and choose a polynomial qη with ∥hη−qη∥∞<R1. Then ∥hη(H−λ)−qη(H−λ)∥<R1, so ∣gλ+iη(x,y)−qη(H−λ)(x,y)∣<R1 for any x,y and λ. So replacing each gλ+iη4(x,y) by qη(H−λ)(x,y) in the sums gives an error term RCk,D,Aη0−3∣∣∣K∣∣∣η02eη5 as in Lemma 4.2.
Denote Ck,D,A,η0=Ck,D,Aη0−3∥K∥η02.
Let dR,η be the degree of qη. Suppose ρG(x0)≥dR,η+k=:dR,k,η. Then it is easy to see that qη(H−λ)(xk,yk)=qη(H−λ)(x~k,y~k), c.f. Lemma A.1. The same holds for the other edges (xk,yk−1) and so on. The terms with ρG(x0)<dR,k,η bring an error term N#{ρG(x0)<dR,k,η}η−4Ck,D,A,η0. Finally, we replace the qη(H−λ)(x~,y~) by g~λ+iη4(x~,y~) which yields again an error of the form RCk,D,A,η0.
This proves the first statement, and the second one is proven similarly.
∎
We continue to simplify the expression and record the following.
Lemma 4.4**.**
If we replace αη0z(x0,x1)Kη0z(x0;xk,yk) and αη0zˉ(x0,x1)Kη0zˉ(x0;xk,yk) in Lemma 4.3 by ∣αz+iη0(x0,x1)∣2Kz+iη0(x0;xk)Kz+iη0(x0;yk), then as N→∞, the error we get is at most Ck,D,Aη0−6∣∣∣K∣∣∣η02eη5η4. We may also replace χ(λ±iη4) by χ(λ), modulo the asymptotic error Ck,D,Aη0−3∣∣∣K∣∣∣η02eη5η. Finally, we may replace each ζekzˉ+iη0 by ζekz+iη0 and ζek′z−iη0 by ζek′zˉ−iη0, modulo an asymptotic error Ck,D,Aη0−6∣∣∣K∣∣∣η02eη5η4.
Proof.
We start with αη0z(x0,x1)Kη0z(x0;xk,yk). Denote e=(x0,x1) and ζeγ=ζx1γ(x0). We note that
[TABLE]
where we used (2.11) in the first inequality and the resolvent identity in the second one. Similarly, Kz+iη0(x0;xk)Kz+iη0(x0;yk) is the same as Kη0z(x0;xk,yk), but with each z−iη0 replaced by zˉ−iη0. It follows that ∣Kη0z(x0;xk,yk)−Kz+iη0(x0;xk)Kz+iη0(x0;yk)∣≤2sup∣∂zK(v0;vk)∣sup∣K(v0;vk)∣⋅∣z−zˉ∣≤4∣∣∣K∣∣∣η02η4. Hence, αη0z(x0,x1)Kη0z(x0;xk,yk) is the same as ∣αz+iη0(x0,x1)∣2Kz+iη0(x0;xk)Kz+iη0(x0;yk), modulo CD,Aη0−4∣∣∣K∣∣∣η02η4. This error is further multiplied by the function χ. Bounding the ζ terms by some cD,Aη0−2 and ∣χ(z)∣ by eη5, we end up with an error term at most
[TABLE]
and a similar upper bound for each term involving g~λ±iη4. Since Iη=(a−2η,b+2η)⊂I1, we may use Remark A.5 to deduce that the integrand is uniformly bounded over λ∈Iη by Ck,D,Aη0−6∣∣∣K∣∣∣η02eη5η4 as N→∞. Note that ∣Iη∣≤∣I0∣=2(D+A).
This proves the first claim. The second claim is similar, for example ∣αη0zˉ(x0,x1)−∣αz+iη0(x0,x1)∣2∣≤CD,Aη0−2∣ζez+iη0−ζezˉ+iη0∣≤2CD,Aη0−4η4. Moreover, Kη0zˉ(x0;xk,yk) is the same as Kz+iη0(x0;xk)Kz+iη0(x0;yk) with each z+iη0 replaced by zˉ+iη0, so the proof carries on. For the third claim, note that ∣χ(λ±iη4)−χ(λ)∣≤supz∈R∣∂x2∂χ(z)∣⋅η4≤Ceη5η. For the last claim, ∣(ζez±iη0)−1−(ζezˉ±iη0)−1∣≤2CD,Aη0−4η4 as we previously saw when analyzing αη0z, so we get a similar error.
∎
By virtue of Lemma 4.3 and 4.4, denoting z=λ+iη4,
we know at this stage that modulo some error terms, the expression (4) may be replaced by
[TABLE]
We now make the expression more homogeneous as follows:
Lemma 4.5**.**
Assume we have made all the replacements in Lemma 4.4. If we finally replace each of the four Img~z(x~,y~) by Img~z+iη0(x~,y~) in (4.7), then the error term vanishes as N→∞, followed by η↓0, followed by η0↓0.
Proof.
We only analyze the first error term, the other three are similar.
Choose p,q,r such that p1+q1+r1=1, and use the Hölder’s inequality,
[TABLE]
Here ∫=∫a−2ηb+2η. The first sum is bounded by Dk−1∑(x0;xk)∈Bk∣Kz+iη0(x0;xk)∣2p. Assumption (Hol) on K implies that
and the RHS is uniformly bounded in η,η0∈(0,1) by Remark A.4. Remember the convention that objects wearing a hat ⋅^ are defined on the limit (T,W),
by similar formulas to those on GN. We also refer to §2.2 for notation related to Green functions.
We check that the RHS vanishes as η,η0↓0. Let Xηη0=ImGλ+i(η4+η0)(vk,wk)−ImGλ+iη4(vk,wk), Xη0=ImGλ+iη0(vk,wk)−ImGλ+i0(vk,wk) and Yηη0=Xηη0−Xη0. Denote ∑vk,wk=∑(v0;vk),(w0;wk),v0=w0=o. For any M>0, we have ∫E∑vk,wk∣Yηη0∣r=∫E∑vk,wk∣Yηη0∣r1∣Yηη0∣≤M+∫E∑vk,wk∣Yηη0∣r1∣Yηη0∣>M.
By Proposition 2.4, ∑vk,wk∣Yηη0∣r→0 for Lebesgue-a.e. λ∈R and P-a.e. [T,o,W]∈T∗D,A as η↓0. So the first term tends to [math] by dominated convergence. For the second, for any s>r, ∫E∑vk,wk∣Yηη0∣r1∣Yηη0∣>M≤Ms−r1∫E∑vk,wk∣Yηη0∣s≤Ms−rCs by (Green). This vanishes as M→∞. Thus, ∫E∑vk,wk∣Yηη0∣r→0 as η↓0. Similarly, ∫E∑vk,wk∣Xη0∣r→0 as η0↓0. Since ∣Xηη0∣r≤2r−1(∣Yηη0∣r+∣Xη0∣r), it follows that ∫E∑vk,wk∣Xηη0∣r→0 as η↓0 followed by η0↓0.
∎
By virtue of Lemma 4.5, denoting Ψγ,v(w)=Img~γ(v,w), the term in parentheses (4.7) may be replaced by
[TABLE]
Recall that ek=(xk−1,xk), ek′=(yk−1,yk) and that there are non-backtracking paths (x0,x1,…,xk−1,xk) and (x0,x1,…,yk−1,yk). Moreover, ρG(x0)≥dR,η,k≥k.
Suppose ek′=ek. Then there is a path (v0,…,vs) with v0=x~k, v1=x~k−1, vs−1=y~k−1 and vs=y~k. Taking the complex conjugate in identity (2.13), noting that Ψz+iη0,v(w) is real, we see that (4.8) is zero. If ek=ek′, (2.12) tells us (4.8) equals ∣ζxk−1z+iη0(xk)∣2∣Imζxk−1z+iη0(xk)∣.
Since ρG(x0)≥k in Lemma 4.3, the paths (x0,x1,x2,⋯,xk) and (x0,x1,y2,⋯,yk) are determined by ek and ek′, respectively. So the terms in the sum are only nonzero if (x0,x1,x2,⋯,xk)=(x0,x1,y2,⋯,yk). Hence, if we make all replacements in Lemmas 4.4 and 4.5, modulo the errors appearing in these lemmas, the expression (4) finally takes the form
[TABLE]
where we used that χ(λ)≤1 on R. Collecting all estimates on the error terms, taking N→∞, then η↓0, then η0↓0, then R→∞, we finally get N1∑j=1Nχ(λj)∥αγjKBγjfj∥2≲π1∫a−2ηb+η∥Kz+iη0∥z+iη02dλ. Recalling (4.5), if we prove (4.3), then this will complete the proof of Theorem 4.1.
We have ∥αγj−1fj∗∥2=∑(x0,x1)∈B∣Imζx1γj(x0)∣1∣ψj(x0)−ζx1γj(x0)ψj(x1)∣2. Repeating the same arguments, we see that modulo asymptotically vanishing error terms, we have
[TABLE]
The term in square brackets is just ∣Imζx1z+iη0(x0)∣ by (2.12). Hence, using χ(λ)≤1 we get N1∑λj∈I∥αγj−1fj∗∥2≲π3(∣I∣+4η)D for any small η>0, and (4.3) follows.
5. Step 2 : Invariance property of the quantum variance
In the scheme of §1.6, we are now in Step 2 : using the functional equations (3.1) and (3.2) satisfied by fj,fj∗, we show that there are certain transformations Rn,rγ:Hk=CBk→Hn+k=CBn+k that leave the quantum variance (3.3) unchanged.
Recall from Section 3 that B(ζγjfj)=fj−iη0τ+ψj and B∗(ιζγjfj∗)=fj∗−iη0τ−ψj if γj=λj+iη0. So
[TABLE]
Iterating r times,
[TABLE]
Similarly
[TABLE]
If we define for r≤n and γ∈C∖R the operator Rn,rγ:Hk→Hn+k by
[TABLE]
we thus get
[TABLE]
where the E stands for an “error term” that should vanish as η0↓0 :
[TABLE]
Since this holds for each 1≤r≤n and K=Kγ, we get by the triangle inequality
[TABLE]
We first show that the latter term may be neglected.
Lemma 5.1**.**
Suppose Kγ∈Hk satisfies assumptions (Hol) and let Iˉ⊆I1. Then for all n∈N,
[TABLE]
Proof.
We have \big{(}\frac{1}{N}\sum_{\lambda_{j}\in I}|\frac{1}{n}\sum_{r=1}^{n}\mathcal{E}_{n,r,j}|\big{)}^{2}\leq\frac{1}{n}\sum_{r=1}^{n}\big{(}\frac{1}{N}\sum_{\lambda_{j}\in I}|\mathcal{E}_{n,r,j}|\big{)}^{2}. Now, letting as above γj=λj+iη0,
[TABLE]
where cn,r=n+r(n−r). So it suffices to show that \limsup_{N}\big{(}\frac{1}{N}\sum_{\lambda_{j}\in I}|\langle\cdot,\cdot\rangle|\big{)}^{2} is uniformly bounded in η0 for each t,t′. For the first term, we have
[TABLE]
The first sum is uniformly bounded as η0↓0, by (4.3). Next, by (2.3), we have
[TABLE]
Arguing as in Section 4, applying Lemmas 4.2 to 4.4, we get for z=λ+iη4,
[TABLE]
Using Hölder’s inequality as in Lemma 4.5, we see that as N→∞, this quantity is uniformly bounded in η,η0 by (Hol) and (Green).
One bounds N1∑λj∥KBγjfj∥2 similarly. Finally,
[TABLE]
which is asymptotically bounded using Hölder’s inequality again as in Lemma 4.5.
∎
Using the invariance law (5.1), Theorem 4.1 with K~γ=n1∑r=1nRn,rγKγ, and Lemma 5.1, we deduce the following statement :
Denoting γ=λ+i(η4+η0) in Proposition 5.2, we are now concerned with estimating
[TABLE]
Suppose r≥r′, so that n−r≤n−r′. Then
[TABLE]
Letting η1=Imγ, (2.9) tells us that ∑x0∈Nx1∖{x2}∣Imζx1γ(x0)∣=∣ζx2γ(x1)∣2∣Imζx2γ(x1)∣−η1. Similarly, we have ∑xn+k∈Nxn+k−1∖{xn+k−2}∣Imζxn+k−1γ(xn+k)∣=∣ζxn+k−2γ(xn+k−1)∣2∣Imζxn+k−2γ(xn+k−1)∣−η1.
By iteration, this induces some simplifications :
[TABLE]
with the error term
[TABLE]
The expression is slightly nicer if we replace K by ZγK defined by
[TABLE]
If γ↦Kγ satisfies (Hol) then so does γ↦ZγKγ. Using (2.7), we get in that case
[TABLE]
where uxγ(y) is the complex number of modulus 1 given by
[TABLE]
Let us define a positive measure μkγ on the set Bk of non-backtracking paths of length k, by putting
[TABLE]
Let us also introduce the operator
[TABLE]
Then, using (2.7) again, we see that (6.4) takes the nicer form
[TABLE]
where we let
(mγK)(x;y)=mxγK(x;y). Let us also define
[TABLE]
Such operators would be called “transfer operators” in ergodic theory, or “transition matrices” in the theory of Markov chains. Note that Sγ has non-negative coefficients and that Suγ just differs from Sγ
by the “phases” ux0γ(x−1). The effect of adding a phase to a stochastic operator is a much studied subject in the theory of Markov chains, or more generally in ergodic theory (see Wielandt’s theorem [36, Chapter 8], or in the context of hyperbolic dynamical systems [37, Chapter 4]).
The matrix elements of Sγ are given by
[TABLE]
if ω=(x0;xk), ω′=(x−1;xk−1) and ω′⇝ω, and Sγ(ω,ω′)=0 otherwise. Recall from §2.1 that if ω=(x0;xk), we write ω′⇝ω if ω′=(x−1,x0,…,xk−1) for some x−1∈Nx0∖{x1}.
Note that Sγ is substochastic : ∑ω′∈BkSγ(ω,ω′)≤1 for any ω∈Bk, by (2.9). More precisely, if ω=(x0;xk) and η1=Imγ>0, then
[TABLE]
Taking the adjoint in ℓ2(μkγ), a direct calculation gives
In (6.1) we take γ=λ+i(η4+η0) (c.f. Proposition 5.2), and thus η1=Imγ=η4+η0. In the limiting case η1=0, (6.13) and (6.14) turn into equalities. Equation (6.13)
is then the Kolmogorov compatibility condition : it tells us that the family of measures (μkγ) may be extended to a positive measure (actually, a Markov measure) on the set B∞ of infinite non-backtracking paths. Equality in condition (6.14) means that this Markov chain is stationary. This stationarity is the property that makes the measures μkγ nice, and this is the reason for introducing (somewhat artificially) the weight ∣ζxγ(y)∣2Imζxγ(y) in (4.1).
This family of stationary Markov chains (indexed by γ) is in some sense the “classical dynamical system” that we were seeking in §1.6.
Since η1=η4+η0 is non-zero (but small), we do not actually have exact equality in (6.13) and (6.14). This causes some error terms that we need to control as η,η0⟶0.
7. Spectral gap and mixing
In this section, we convert the expanding assumption (EXP) into an estimate on the rate of mixing of the “Markov chains” (μkγ) defined in (6.6). Every transitive Markov chain is mixing, but here we need
estimates that are uniform both as N⟶+∞and as γ approaches the real axis.
A technical difficulty is that the measures (μkγ) are not a priori bounded from above, and the transition probabilities are not bounded from below as γ approaches the real axis. Peaks of (μkγ), as well as small transition probabilities, tend to “disconnect” the graph and are bad for mixing. So we will need to show that there are few peaks and few small transitions (Proposition 7.6).
Let
[TABLE]
be the normalized measure. We denote by ℓ2(νkγ) the set ℓ2(Bk) endowed with the scalar product ⟨f,g⟩νkγ=∑ω∈Bkνkγ(ω)f(ω)g(ω).
We anticipate the calculations of Section 10, where we will need to consider the non-backtracking quantum variance of operators Kγ of the form Kγ=FγK where K is independent of γ, and Fγ:Hm→Hk is a γ-dependent operator for some 1≤k≤m+1, having the form Fγ=Lγd−1ST,γ, Tγ, O1γ, Ujγ, Ojγ, Pjγ, j≥2, or a polynomial combination thereof. See (10.3, 10.4, 10.6, 10.8, 10.9, 10.10) for the definitions. In the case Fγ=Lγd−1ST,γ, the operator depends on an additional parameter T∈N∗, that has to be taken arbitrarily large in Corollary 10.3.
Comparing with (6.8), this means that we will need to deal with ⟨Suγr−r′Kγ,Kγ⟩μkγ where now Kγ=BγK, K is γ-independent, and Bγ:Hm→Hk is defined by
[TABLE]
For simplicity, the calculations below are written for k=1. This suffices for our purposes, as we shall see in Section 9. Like in the statement of Theorem 1.3, we will always assume that the γ-independent operator K satisfies ∥K∥∞:=supx,y∈V∣K(x,y)∣≤1.
The main results of this section are the two following propositions, that estimate the norm of the transfer operator Sγ (6.10) on proper subspaces. We call F the space of functions f on B such that f(e) “depends only on the terminus”, that is, f(e)=f(e′) if te=te′. The first proposition estimates the norm of Sγ on the orthogonal of F, and the second one estimates the norm of Sγ2 on the orthogonal of constant functions.
We denote by ℓ2(B1,U) the set ℓ2(B1) endowed with the scalar product ⟨f,g⟩U=N1∑e∈B1f(e)g(e). Let PF,U be the orthogonal projector on F in ℓ2(B1,U) :
[TABLE]
We use as a “reference operator” the transfer operator S defined by
[TABLE]
where q(x)=d(x)−1. Both S and S∗ are stochastic, if the adjoint of S is taken in ℓ2(B1,U). The influence of the spectral gap assumption (EXP) on the spectrum of S is studied in [8] and we will use these results below.
We denote Q=S∗S and Q2=S2∗S2.
Note that Q(e,e′)=0 unless there exists e′′ such that e⇝e′′ and e′⇝e′′. In this case, we say that [e,e′] is a pair; [e,e′] form a pair iff they share the same terminus. The set of pairs is denoted by P(B1).
Proposition 7.1**.**
Let BγK∈H1. Let w=PF⊥,νBγK be the orthogonal projection of BγK on F⊥ in ℓ2(ν1γ).
Then for any M>0 we have
[TABLE]
where
[TABLE]
The sets Bad(M) of bad edges and Badp(M) of bad pairs of edges will be defined in the course of the proof. They correspond to the aforementioned peaks of μ1γ and problems of small transition probabilities. If there were no bad edges and bad pairs, Proposition 7.1 would be a genuine spectral gap estimate.
Proposition 7.2**.**
Let BγK∈H1. Let f=P1⊥,νBγK be the orthogonal projection of BγK on 1⊥ in ℓ2(ν1γ).
Then for any M>0 we have
[TABLE]
where c(D,β)>0 is explicit and depends only on D (upper bound on the degree) and the spectral gap β of (EXP), and
[TABLE]
where P1,U is the orthogonal projector on 1 in ℓ2(B1,U).
Here, Badp(2,M) is another set of bad edge-couples defined in the proof.
The quantities CN,M(Bγ),CN,M,2(Bγ) are estimated in Proposition 7.7.
Indeed, denoting ⟨⋅,⋅⟩ν:=⟨⋅,⋅⟩ν1γ, we have ∥SγK∥ν2=⟨K,QγK⟩ν and ⟨K,MγK⟩ν≥0 by Dirichlet, so ∥K∥ν2≥⟨K,DγK⟩ν≥⟨K,QγK⟩ν as claimed.
Remark 7.3**.**
The Dirichlet identity shows that
[TABLE]
Remark 7.4**.**
If J⊥F in ℓ2(B1,U), then ⟨J,(I−Q)J⟩U≥43∥J∥U2.
Indeed, ⟨τ+δy,J⟩U=0 for all y∈V, so ∑x∼yJ(x,y)=0 for all y∈V and thus (QJ)(x0,x1)=(S∗SJ)(x0,x1)=q(x1)2J(x0,x1) (recall that q(x)=d(x)−1 where d(x) is the degree of x). As minq(x)≥2, we get ∥QJ∥U≤41∥J∥U and the claim follows.
Fix a large M>0. We call e∈B1bad if ν1γ(e)>NM. We call a pair [e,e′]∈P(B1)bad if ν1γ(e)Qγ(e,e′)<NM−1. We call Bad(M) and Badp(M) the sets of bad e and [e,e′], respectively.
To prove Proposition 7.1, we first note that by (7.5), and letting Kγ=BγK,
We now let Q2γ=Sγ2∗Sγ2 (where the adjoint is taken in ℓ2(ν1γ)). Then
Q2γ(e,e′)=0 iff there exists e′′,e1,e1′ such that e⇝e1⇝e′′ and e′⇝e1′⇝e′′. We denote the set of such couples [e,e′] by P2(B1) and let M2γ(e,e′)=D2δe=e′−Q2(e,e′), where D2(e)=∑e′Q2γ(e,e′)≤1.
Fix M>0. We say that [e,e′]∈P2(B1) is bad if ν1γ(e)Q2(e,e′)<NM−1. We call Badp(2,M) the set of bad couples in P2(B1).
The proof is then similar to Proposition 7.1, replacing the space F by the space of constant functions and using [8, Theorem 1.1] instead of Remark 7.4. In particular, the quantity c(β,D) is the one appearing in [8, Theorem 1.1].
∎
Later on, we will need to iterate the result of Proposition 7.2, considering Sγ2r instead of Sγ2. Since Sγ∗ is not exactly stochastic, Sγ does not preserve the orthogonal of constants. Still, we can iterate (6.12) to get Sγ∗l1=1−η1∑s=0l−1Sγ∗sξγ, where ξγ(x0,x1)=∣Imζx0γ(x1)∣∣ζx0γ(x1)∣2. Hence, for any K we have ⟨1,SγlK⟩ν=⟨1,K⟩ν−η1⟨∑s=0l−1Sγ∗sξγ,K⟩ν. Denoting
[TABLE]
we see that if K⊥1, then (Sγ2lK+η1ZlK)⊥1.
Proposition 7.5**.**
Let K∈Hm. Let f=P1⊥,νBγK be the orthogonal projection of BγK on 1⊥ in ℓ2(ν1γ).
Then for any M>0 we have
[TABLE]
where CN,M,l,2(Bγ)=CN,M,2((Sγ2l+η1Zl)P1⊥,νBγ).
Proof.
The proof is by induction on r. This holds for r=1 by Proposition 7.2. Assume the result holds for r. If f⊥1, we have just seen that (Sγ2r+η1Zr)f⊥1 in ℓ2(ν1γ). So using Proposition 7.2 and (7.6),
[TABLE]
Since ∥(Sγ2r+η1Zr)f∥≤∥Sγ2rf∥+η1∥Zrf∥, the claim follows.
∎
The rest of this section is devoted to estimating the “bad” quantities.
Proposition 7.6**.**
Under assumptions (BSCT) and (Green), for any s≥1, there exists Cs such that for all M>1 we have
[TABLE]
Proof.
We have ν1γ(Bad)=ν1γ{e:ν1γ(e)>NM}, so
[TABLE]
Recalling the definition of μ1γ (6.6), and using Remark A.3, we get
[TABLE]
uniformly in Reγ∈I1, for any fixed Imγ=η1. By Remark A.4, this is bounded by some constant Cs. The second assertion is proved similarly.
∎
Proposition 7.7**.**
For all t∈N,
[TABLE]
where (PF,Uν1γ)(e)=d(te)1∑te′=teν1γ(e′), and
[TABLE]
Similar estimates hold if Bγ is replaced by P1⊥,νBγ, where P1⊥,ν is the projection on the orthogonal of constants in ℓ2(ν1γ).
We first deduce the following corollary. Recall that the operators Fγ from Corollary 10.3 depend on a parameter T∈N∗, and Bγ=mγZγ−1Fγ. In this section, T is fixed, but will be taken to +∞ in Section 10.
Corollary 7.8**.**
For any s>0, there exists Cs,T such that, for all M,
[TABLE]
and
[TABLE]
Similar estimates hold if Bγ is replaced by P1⊥,νBγ.
uniformly in Reγ∈I1, for any fixed Imγ=η1. So the claim follows Remark A.4.
For (7.12), we have d(te)21(∑te′=teν1γ(e′))2≤∑te′=teν1γ(e′)2, so we deduce the upper bound D(∑eν1γ(e)21)1/2(∑eν1γ(e)4)1/2, which is uniformly bounded by
The first two terms are bounded by E(∑o′∼oμ^1γ(o,o′))1(E∑o′∼oζ^oγ(o′)2αμ^1γ(o,o′)2(m^oγ)2α)1/2 and the last term is shown to be uniformly bounded in Remark 10.4. This completes the proof.
∎
An important point here is to obtain a bound that does not depend on t. Recalling (7.3), we first estimate
[TABLE]
where n(e)=∑e′:[e,e′]∈Badp(M)Q(e,e′). Using Hölder, this is less than
[TABLE]
But again by Hölder and the fact that Q is stochastic, we have
[TABLE]
Next, recalling (6.7), (6.9), we have ∣SuγtBγK(e)∣≤(Sγt∣BγK∣)(e). As Sγt and Sγ∗t are substochastic, and ν1γ(e)Sγt(e,e′)=ν1γ(e′)Sγ∗t(e′,e), we have
[TABLE]
Collecting the estimates, we showed that (7.13) is bounded by
Using that PF,U is stochastic and Sγt is substochastic, we have
[TABLE]
This yields the first inequality. The second one is proven similarly.
∎
Remark 7.9**.**
Note that if ∥K∥∞≤1, then
[TABLE]
so supη1>0limsupN→∞supReγ∈I1,Imγ=η1∥BγK∥ν1γ2≤CT by the proof in Corollary 7.8, see also Remark 10.4.
For a quantity A(N,γ,κ) depending on N,γ (and possibly on an additional parameter κ), we will write A(N,γ,κ)=Oκ(1)N⟶+∞,γ
to mean that, for any given κ,
[TABLE]
For instance, if ∥K∥∞≤1, then ∥BγK∥ν1γ2=OT(1)N⟶+∞,γ. This is true more generally for ∥BγK∥νkγ2, with Bγ=ZγmγFγ:Hm→Hk, and Fγ as in Corollary 10.3.
Similarly, for the operator Zl appearing in Proposition 7.5, the arguments in Corollary 7.8 and Remark 10.4 show that ∥Zlf∥ν1γ=Ol,T(1)N⟶+∞,γ.
Finally, by Corollary 7.8, suptCN,M,2(SuγtBγ) is uniformly bounded by Cs,TM−s for any M and s, as N→+∞. We use the notation OT(M−∞)N⟶+∞,γ to express this.
8. Transition matrices with phases
We now consider the operator Suγ given in (6.7). If we denote by Muγ the multiplication operator (MuγK)(x0;xk)=ux1γ(x0)K(x0;xk), where ux1γ(x0) is the function of modulus 1 defined in (6.5), then Suγ=SγMuγ.
It is well known that putting phases into a matrix with positive entries will strictly diminish its spectral radius, unless the phases satisfy very special relations : this is the contents of Wielandt’s theorem [36, Chapter 8]. This is reflected in Proposition 8.1 below. Without the error term, part (i) says that the norm of Suγ4 is strictly smaller than one, in contrast to Sγ4 (the latter only contracts the norm on proper subspaces, see Section 7). The contraction property of Suγ4 holds true except in special cases, described in part (ii) of Proposition 8.1.
Note that we are not using Wielandt’s theorem directly, as we want some information on the norm of the operator Suγ4 instead of its spectral radius.
In addition, as in Section 7, we need estimates that are uniform both as N→∞ and as γ approaches the real axis.
Recall from Section 7 that Bγ is an operator Hm→Hk with 1≤k≤m. As in Section 7, the case k=1 suffices for our purposes, but we need more general operators Aγ:Hm→H1 defined in terms of Bγ. The quantities CN,M(Aγ),CN,M,2(Aγ) were introduced in Propositions 7.1 and 7.2. In particular, CN,M,2(I) corresponds to the case where Aγ is the identity operator. The measure ν1γ is defined in (6.6) and (7.1).
Proposition 8.1**.**
Fix γ∈C+, AγK∈H1, ε∈(0,1), M>0 and a graph G=GN. Denote η1=Imγ. Then
(i)
Either we have
[TABLE]
with
[TABLE]
2. (ii)
or there exist θ:V→R and constants sj with ∣sj∣≤1, j=1,2, such that
[TABLE]
and
[TABLE]
where ξγ(x0,x1)=∣Imζx0γ(x1)∣∣ζx0γ(x1)∣2, nxγ=(mxγ)(mxγ)−1 and CN,M′=c(D,β)8M2CN,M,2(I).
Moreover, there is an explicit f(β,D), depending only on the spectral gap β and on the degree, such that cM,β≤f(β,D)M3 as M→+∞.
In particular, in case (ii),
[TABLE]
Proof.
(a) We start with some preliminary inequalities. Denote ⟨⋅,⋅⟩ν=⟨⋅,⋅⟩ν1γ.
Recall that we denote by F the space of functions on B which depend only on the terminus.
Let δ1=43M−2, Kγ=AγK and let w=PF⊥Kγ be the orthogonal projection of Kγ on F⊥ in ℓ2(ν1γ). By the proof of Proposition 7.1,
So if f=PFKγ=Kγ−w∈F is the projection of Kγ on F, we have
[TABLE]
Similarly, if δ2=M−2c(D,β) and C1=P1∣Kγ∣ is the projection of ∣Kγ∣ on 1, then using Proposition 7.2, we get
[TABLE]
Now
[TABLE]
and
[TABLE]
(this is true even if f vanishes, if we give an arbitrary value of modulus 1 to ∣f∣f in this case).
Also,
[TABLE]
and
[TABLE]
Finally, ∥∣Kγ∣−∥Kγ∥ν1∥ν≤∥∣Kγ∣−C1∥ν+∣∥Kγ∥ν−C∣≤2∥∣Kγ∣−C1∥ν. Putting all these inequalities together, we obtain
[TABLE]
Comparing with (8.3) and (8.4), this says the following : if ∥Sγ2∣Kγ∣∥ν is close to ∥Kγ∥ν and if ∥SγKγ∥ν is close to ∥Kγ∥ν,
then Kγ must be close to ∥Kγ∥ν∣f∣f, where f is a function that depends only on the terminus.
Repeating the arguments of (8.3) with MuγSuγKγ instead of Kγ, then taking f~=PFMuγSuγKγ∈F, we get
(b) We can now start the proof itself. Suppose (i) is not true :
[TABLE]
Using ∥Suγ4Kγ∥ν≤∥SuγKγ∥ν=∥SγMuγKγ∥ν, ∥Suγ4Kγ∥ν≤∥Sγ2∣Kγ∣∥ν=∥Sγ2∣MuγKγ∣∥ν, ∥Suγ4Kγ∥ν≤∥Sγ2∣SuγKγ∣∥ν and ∥Kγ∥ν≥∥SuγKγ∥ν, we see that we must also have
[TABLE]
[TABLE]
[TABLE]
as well as
[TABLE]
Applying (8.3), (8.4) and (8.5) to MuγKγ instead of Kγ, and f=PFMuγKγ, it follows that
As f,f~∈F, we have ∣f∣f(x0,x1)=eiθ(x1) and ∣f~∣f~(x0,x1)=eiθ′(x1) for some θ,θ′:V→R. Note that in this case, (Sγ∣f∣f)(x0,x1)=eiθ(x0)−η1ξγ(x1,x0)eiθ(x0), where ξγ(x0,x1)=∣Imζx0γ(x1)∣∣ζx0γ(x1)∣2, using (6.11). Applying Sγ to (8.9), we thus get
[TABLE]
Applying Muγ and comparing with (8.10), it follows that
[TABLE]
Repeating the procedure with Kγ replaced by SuγKγ, and f replaced by f~, the same arguments show that there exists θ′′:V→R such that
[TABLE]
Hence we have proved that ux1γ(x0) is close to both ei(θ(x0)−θ′(x1)) and ei(θ′(x0)−θ′′(x1)).
(c) Because of relation (2.7), the function u satisfies ux1γ(x0)=ux0γ(x1)nx0γnx1γ, where nxγ=(mxγ)(mxγ)−1.
To conclude the proof, we show : if ei(θ(x0)−θ′(x1)) and ei(θ′(x0)−θ′′(x1)) are close to uγ, and if the function ux1γ(x0) satisfies
the relation above, then this gives constraints on θ,θ′,θ′′ that imply part (ii) of the proposition.
Let g(x0,x1)=ei(θ(x0)−θ′(x1)) and c=(112δ1−1+112δ2−1+6). We have shown in (b) that ∥ux1γ(x0)−g∥ν2≤cε+4η12∥ξγ∥ν2. Recall that we denote by ι the involution of edge reversal.
Hence, if we define g~(x0,x1)=g(x1,x0)nx0γnx1γ, we get
Note that the functions h1,h2 have modulus 1, and Sγh1=h2−η1ιξγh2, so
[TABLE]
Consider P1,νh1=s1, the projection of h1 to the space of constant functions. Arguing as in (8.4), we can write ∥h1−s1∥ν2≤δ2−1(∥h1∥ν2−∥Sγ2h1∥ν2+4CN,M,2(I)) . But ∥h1∥2−∥Sγ2h1∥2=(∥h1∥+∥Sγ2h1∥)(∥h1∥−∥Sγ2h1∥)≤2∥Sγ2h1−h1∥. Hence,
[TABLE]
We observe that ∥h1−s1∥=∥nx1γei(θ(x1)+θ′(x1))−s1∥=∥g~nx0γei(θ′(x0)+θ′(x1))−s1∥=∥g~−nx0γe−i(θ′(x0)+θ′(x1))s∥. Thus, comparing with (8.13),
[TABLE]
This is the first half of (ii) with
[TABLE]
Remembering that δ1=43M−2, δ2=M−2c(D,β) and c=(112δ1−1+112δ2−1+6), we see that there is an explicit f(β,D) such that cM,β≤f(β,D)M3 as M→+∞. Note that ∣s∣≤1 since ∥h1∥ν=1.
The second half of (ii) is proven similarly, using (8.12) instead of (8.11). Here we take g′(x0,x1)=ei(θ′(x0)−θ′′(x1)), h1′(x0,x1)=nx1γ1e−i[θ′(x1)+θ′′(x1)], s′1=P1h1′ and h2′(x0,x1)=nx0γ1e−i[θ′(x0)+θ′′(x0)].
To prove (8.2), we write \big{\|}u_{x_{1}}^{\gamma}(x_{0})^{2}-ss^{\prime}\frac{n_{x_{1}}^{\gamma}}{n_{x_{0}}^{\gamma}}\big{\|}^{2}\leq 2\,\big{\|}u_{x_{1}}^{\gamma}(x_{0})[u_{x_{1}}^{\gamma}(x_{0})-s\frac{e^{-i\widetilde{\theta}(x_{0},x_{1})}}{n_{x_{0}}^{\gamma}}]\big{\|}^{2}+2\,\big{\|}s\frac{e^{-i\widetilde{\theta}(x_{0},x_{1})}}{n_{x_{0}}^{\gamma}}[u_{x_{1}}^{\gamma}(x_{0})-s^{\prime}e^{i\widetilde{\theta}(x_{0},x_{1})}n_{x_{1}}^{\gamma}]\big{\|}^{2}, where we put θ(x0,x1)=θ′(x0)+θ′(x1). Since ux1γ(x0)2nx1γnx0γ=ux1γ(x0)ux0γ(x1), the proof is complete.
∎
Our aim is to show that limη0↓0limN→+∞Varnb,η0I(FγK)=0, for the operators Fγ that appear in Corollary 10.3. A main step was carried out in Proposition 5.2, and the upper bound was put in a convenient form in (6.8). We now use the estimates of Sections 7 and 8 to complete the proof. We denote Bγ=ZγmγFγ:Hm→Hk as in Section 7, where Zγ is defined in (6.3). It should be kept in mind that Fγ may depend on a parameter T that is fixed in this section, but will be taken arbitrarily large in the next one.
Recall that we take γ=λ+i(η4+η0), where λ,η,η0 come from Proposition 5.2. In other words, γ=λ+iη1∈C+ with λ∈I1 and η1=η4+η0. Let K∈Hm so that BγK∈Hk. Applying (6.8), recalling that νkγ=μkγ(Bk)1μkγ, we obtain
[TABLE]
Fix M very large and take n=M9. We apply Proposition 8.1 with ε=M−8 to the family of operators {Suγ4jBγK}j=1M9. Call C~~N,M(Bγ)=maxj=1M9C~N,M,2(Suγ4j+k−1Bγ)1/2⋅μkγ(Bk)μ1γ(B). We use the notation in Remark 7.9 throughout the section. In particular, C~~N,M(Bγ)=OT(M−∞)N⟶+∞,γ thanks to Corollary 7.8.
Remark 9.1**.**
It is useful to note that the norm ∥Suγj∥νkγ→νkγ for k>1 is controlled by the same norm for k=1. To see this, note that for K∈ℓ2(νkγ), we have (Suγk−1K)(x0;xk)=∑(x−k+1;x−1)x0,1Λ(x−k+1;x1)K(x−k+1;x1) for some function Λ(x−k+1;x1).
Here the sum is over those (x−k+1;x−1) for which the path (x−k+1,x−k+2,…,x−1,x0,x1) does not backtrack, cf. (2.3). So (Suγk−1K)(x0;xk) only depends on (x0,x1) : we may define ϕK∈ℓ2(ν1γ) by ϕK(x0,x1)=(Suγk−1K)(x0;xk). If I:ℓ2(ν1γ)→ℓ2(νkγ) is the map (Iϕ)(x0;xk)=ϕ(x0,x1), we have for any j≥k, [Suγj−k+1IϕK](x0;xk)=(SuγjK)(x0;xk). Moreover, [SuγIϕ](x0;xk)=[I(Suγϕ)](x0;xk). Thus,
[TABLE]
where we used that ∑x0,1(x2;xk)μk(x0;xk)≤μ1(x0,x1) by (6.13). Hence,
and μ1γ(x0,x1)∣Λ(x−k+1;x1)∣=μkγ(x−k+1;x1) by (6.6) and (2.7). Hence,
[TABLE]
So ∥ϕK∥ν12≤μ1γ(B)μkγ(Bk)∥K∥νkγ2. Summarizing, we have shown that for any j≥k, we have
[TABLE]
First alternative :
For γ, ε as above, assume that
case (i) of Proposition 8.1 is satisfied for all the operators {Suγ4jBγK}j=1M9. Applying (8.1) for Suγ4tBγK, t≤j, we obtain if k=1,
[TABLE]
For higher k, we apply (9.2) to ϕBγK(x0,x1)=(Suγk−1BγK)(x0;xk)=(AγK)(x0,x1), where Aγ=Suγk−1Bγ, instead of BγK. We get by Remark 9.1,
[TABLE]
Using the euclidean division r′−r−k+1=4mr,r′+nr,r′ with nr,r′<4, we see that for r′−r≥4+k−1,
[TABLE]
where ck=(1−ε)(k−1+nr,r′)/41≤24k+2 if ε≤21. Note that (1−ε)1/4≤(1−5ε). Hence, since 4+k−1≤4k, we have
[TABLE]
Recall that ε=M−8 and n=M9. Comparing with (9.1), we get
[TABLE]
Second alternative :
Now assume case (ii) of Proposition 8.1 is satisfied; with some complex numbers sj=sj(N) and some function θ. We denote ∥∥ν=∥∥ℓ2(νkγ), θ0(x0;xk)=θ(x0), θ1(x0;xk)=θ(x1), n0γ(x0;xk)=nx0γ and n1γ(x0;xk)=nx1γ. Then we have
Proposition 9.2**.**
Let ∥K∥∞≤1. For AγK=SuγℓBγK, we have for any t∈N∗,
[TABLE]
Proof.
Recall that Suγ=SγMuγ with Muγ the multiplication by ux1γ(x0). We have
[TABLE]
Using (7.6) and Cauchy-Schwarz, the first term is bounded by
[TABLE]
But uγ,s2,n0γ all have modulus bounded by 1, so ∣ux1γ(x0)−s2n0γei[θ0+θ1]∣4≤4∣ux1γ(x0)−s2n0γei[θ0+θ1]∣2. Hence, ∥ux1γ(x0)−s2n0γei[θ0+θ1]∥ℓ4(ν1γ)≤(4cM,β[ε1/2+η1O(1)N⟶+∞,γ]+4CN,M′)1/4 by the first part of (ii). For higher k, using ∑x0,1(x2;xk)μk(x0;xk)≤μ1(x0,x1) by (6.13), we get ∥ux1γ(x0)−s2n0γei[θ0+θ1]∥ℓ4(νkγ)≤(μkγ(Bk)μ1γ(B))1/4∥ux1γ(x0)−s2n0γei[θ0+θ1]∥ℓ4(ν1γ).
Next, ∥SγMuγAγK∥ℓ4(νkγ)=∥Suγℓ+1BγK∥ℓ4(νkγ). Arguing as in Proposition 7.7 and Corollary 7.8, we see this is OT(1)N⟶+∞,γ. Bounding the second term similarly, we get
[TABLE]
Since ∥BγK∥ν=OT(1)N⟶+∞,γ (see Remark 7.9), this proves the result for t=1.
For higher t, let X=s1s2eiθ0Sγ2e−iθ0 and Y=Suγ2. Then ∥(Xt−Yt)AγK∥=∥∑i=1tXt−i(X−Y)Yi−1AγK∥≤∑i=1t∥(X−Y)Yi−1AγK∥. Again, ∥Yi−1AγK∥ℓ4(νkγ)=OT(1)N⟶+∞,γ for each i and the claim follows.
∎
In sums like (9.1), we can make packets of size 2t, and we have for all m and for any t
[TABLE]
As we will see below, the size 2t of packets should be chosen so that t(cM,βε1/2)1/4 is small as M gets large. Remembering that cM,β≤f(D,β)M3 and ε=M−8,
we take t=Mα with 0<α<1/4. We then group the sum (9.1) into packets and write
[TABLE]
where we estimated ∣∑r′=1n∑r=2t(⌊2tn−r′⌋−1)n−r′⟨SuγrBγK,BγK⟩ν∣≤4nt∥BγK∥ν2. Note that ∑r=2ta2t(a+1)−1⟨Suγr⋅,⋅⟩=∑r=0t−1⟨Suγ2r+2ta⋅,⋅⟩+∑r=0t−1⟨Suγ2r+1+2ta⋅,⋅⟩. So using (9.4),
[TABLE]
Lemma 9.3**.**
Let ∥K∥∞≤1. For AγK=Suγ2taBγK or Suγ2ta+1BγK we have for any L
[TABLE]
Proof.
First assume k=1. We decompose e−iθ0AγK=C1+f where f⊥1 in ℓ2(ν1γ). So Sγ2re−iθ0AγK=CSγ2r1+Sγ2rf.
For the term Sγ2rf we use Proposition 7.5, which yields, for any L,
[TABLE]
By Corollary 7.8 (recalling that r≤t≤Mα), we have ∑l=0r−1CN,L,l,2(e−iθ0Aγ)1/2=tOT(L−∞)N⟶+∞,γ. Indeed, the term e−iθ0 has no impact, as it can be bounded by 1 in the proof of Proposition 7.7. We also have ∥f∥ν≤∥AγK∥ν≤∥BγK∥ν=OT(1)N⟶∞,γ, and ∥Zlf∥ν=Ol,T(1)N⟶∞,γ by Remark 7.9. Thus,
[TABLE]
For the term CSγ2r1, we have Sγl1=1−η1∑s=0l−1Sγsιξγ=1+η1Ol(1)N⟶∞,γ by (6.11). Thus,
[TABLE]
Since ∣C∣≤∥AγK∥ν≤∥BγK∥ν, this completes the proof for k=1.
For higher k, as in Remark 9.1, we have ∥Sγ2rf∥νk≤μkγ(Bk)μ1γ(B)∥Sγ2r−k+1ϕf∥ν1, where now ϕf(x0,x1)=(Sγk−1f)(x0;xk). We then note that f⊥1 in ℓ2(νkγ) iff ϕf⊥1 in ℓ2(ν1γ). Indeed, ⟨1,ϕf⟩ν1=μ1γ(B)μkγ(Bk)⟨1,f⟩νk, since ⟨1,ϕf⟩ν1=∑(x0,x1)ν1(x0,x1)(Sγk−1f)(x0;xk), so applying (6.9), (6.6) and (2.7), the claim follows. Hence, ∥Sγ2r−k+1ϕf∥ν1≲c(1−L−2C)r/2∥ϕf∥ν1, where c=(1−L−2)(k+3)/41≤2k+1 for large L. The error terms are the same, this time with ∥Zlϕf∥ν1=Ol,T(1)N⟶∞,γ. Finally, ∥ϕf∥ν1≤μ1γ(B)μkγ(Bk)∥f∥νk.
∎
Starting from (9.5) and applying the lemma, we obtain for ∥K∥∞≤1,
[TABLE]
Remember that n=M9 and t=Mα with 0<α<1/4. For the term t1c(D,β)2L2 to be small, we choose L=Mα′ with 0<2α′<α. For instance, take α=3/16 and α′=1/16. For the other terms, we have t(cM,βε1/2)1/4=O(Mα−1/4) and n−1t=M−9+α. The terms η1OM,T(1)N⟶+∞,γ tend to [math] as η1=η0+η⟶0, M and T being fixed. Finally, ∥BγK∥ν2=OT(1)N⟶+∞,γ assuming ∥K∥∞≤1.
We can gather the first and second alternative into one statement :
Proposition 9.4**.**
Let A>0.
For all M, for all γ that fall either into the first alternative or into the second one with ∣s1γ(N)s2γ(N)−1∣≥A, we have for ∥K∥∞≤1 and for n=M9,
[TABLE]
Proof.
The arguments in the proof of (7.11) readily show that n21∑r,r′=1nEn,r,r′(η1,FγK)=η1On,T(1)N⟶∞,γ. The assertion follows from (9.1), (9.3) and (9.6).
∎
Proposition 9.5**.**
Let I⊂I1 with Iˉ⊂I1. There exists a0 such that, if a≤a0, M is large enough, η1 is small enough (M≥M(a), η1≤η(a)), and N is large enough :
For any γ falling into the second alternative on GN, the sequence sγ(N)=s1γ(N)s2γ(N) must satisfy ∣sγ(N)−1∣>a13, if γ stays in a set of the form
[TABLE]
Before proving the proposition, let us finally give the
We apply Proposition 5.2 and use Proposition 9.5 to show that we are in the framework of Proposition 9.4.
Two cases may happen. Either W(o) is deterministic : there exists E0 such that P(W(o)=E0)=1. In that case, we fix a small a>0, let J1=I∖[E0−2a,E0+2a] and J2=I∩[E0−2a,E0+2a]. We then write Varnb,η0I(FγK)=Varnb,η0J1(FγK)+Varnb,η0J2(FγK). For Reγ∈J1, we have ∣γ−E0∣>2a, so P(∣W(o)−γ∣<a)=0 and Proposition 9.5 applies with a arbitrarily small. Proposition 9.4, applied with A=a13, thus allows to control Varnb,η0J1(FγK), while Varnb,η0J2(FγK)=OT(a).
If W(o) is not deterministic, there exists a such that for all E∈R, P(∣W(o)−E∣<a)≤1−a. Thus, for any complex γ, P(∣W(o)−γ∣<a)≤1−a. In this case Proposition 9.5 may be applied with the fixed value A=a13 and all γ.
Either way, we showed that there exists a0 such that, for all a≤a0, M≥M(a), we have for any s and T,
[TABLE]
Taking M→∞ followed by a↓0, this completes the proof of Theorem 3.3.
∎
We will use the following consequences of (Green) :
•
There exists 0<c0<∞ such that for all γ∈C+, Reγ∈I1,
[TABLE]
In fact, μ^1γ(o,y)=∣m^yγζ^oγ(y)∣2∣Imζ^yγ(o)Imζ^oγ(y)∣, so this follows from (Green) and its consequences (A.9) and (A.10).
•
There exists 0<c1<∞, such that for all γ∈C+, Reγ∈I1,
[TABLE]
In fact, E(∣2Imm^o∣−1)+E(∣2m^oγ∣)≤c1/2 by (A.9), so the first claim follows by Markov’s inequality. The second one follows similarly from (A.10).
We may now begin the proof. If γ falls into the second alternative, then
[TABLE]
Let a0=(2c0)−2(6+3c1)−12; this choice will become clear later on. Take a≤a0. There exist M(a), η(a) and N(a) such that if M≥M(a), η1≤η(a) and N≥N(a), then the RHS side in (9.10) is ≤a26. We fix ρ≥a26.
So take any a≤a0, M≥M(a), η1≤η(a), and assume towards a contradiction that we can find a subsequence Nk=Nk(η1)⟶+∞ and a sequence γk∈Aa,η1, each falling into the second alternative on GNk, such that ∣sγk(Nk)−1∣2≤ρ. After extracting further subsequences, let limNk→+∞sγk(Nk)=s and γ0=limNk→+∞γk∈C. Then ∣s−1∣2≤ρ, Reγ0∈I1,Imγ0=η1, and by (9.10) and Remark A.3
Since the value of γ0 is now fixed, let us omit it from the notation.
Let us write ζ^oγ0(y)=ζ^o(y)=r(o,y)e−iθ(o,y) with r∈R+ and θ∈R. This implies u^o(y)=e2iθ(o,y) and ∣u^o(y)u^y(o)−1∣=∣(eiθ(y,o)+e−iθ(o,y))(eiθ(y,o)−e−iθ(o,y))∣.
Denote to,y=ϵ(o,y)r(y,o)−1−r(o,y)∈R. It follows by Markov’s inequality that
[TABLE]
with probability ≥1−r.
The probability that ∣2Imm^o∣≥2r and ∣2m^o∣≤21r−1 is at least 1−c1r by (9.9a). Thus, (9.14) implies that with probability ≥1−r−c1r, we have for any y∼o
[TABLE]
Combining (9.14) and (9.15), we see that for any y,y′∼o,
Using (9.14) and (9.16), we get for any fixed y′∼o,
[TABLE]
with probability ≥1−r−2c1r. Here we used that ∑y∼or(o,y)≤21r−1 with probability ≥1−c1r, see (9.9b). Since ∣γ0−W(o)∣≥a with probability ≥a, it follows that
[TABLE]
with probability ≥1−r−2c1r−(1−a). Recall that r(o,y) and to,u are real. Taking the imaginary part in (9.17), we thus get ∣Ime−iθ(o,y′)∣≤a−2r32r3+η1. Assume η1≤r3. Then if r<a/5, we get ∣Ime−iθ(o,y′)∣<r2. Hence, P(∣Ime−iθ(o,y′)∣≥r2)≤(2c1+1)r+1−a. But we know that ∣2Imm^o∣≥2r, so taking the imaginary part in (9.14) and using (9.15), we also have that ∣Ime−iθ(o,y′)∣≥r2 with probability ≥1−r−c1r. If (2+3c1)r<a, this will give a contradiction.
To prove the proposition, we take r=6+3c1a and choose a0≤(2c0)−2(6+3c1)−12. Recalling that 2c0ρ1/4=r6, we get ρ1/2=(2c0)−2(6+3c1a)12≥a13 for a≤a0, as required. We also take M>M(a), and η1≤min(r3,η(a)).
∎
10. Step 5 : Back to the original eigenfunctions
In this section, we show that it suffices to consider the non-backtracking quantum variance in order to prove quantum ergodicity; in other words Theorem 3.3 can be retrieved from Theorem 1.3. This part may be read before or after the others.
More generally, fix η0>0 and suppose Kγ∈Hk satisfies conditions (Hol). We denote
[TABLE]
where the subscript η0 indicates that inside the variance, Imγ is fixed and equal to η0.
Denote γj=λj+iη0, and define
[TABLE]
so gj∗ and gj are defined like fj∗ and fj (Section 3), respectively, with ζ replaced by ζ. Put
[TABLE]
Next, given γ∈C+, define the function Nγ:V⟶R+ by
[TABLE]
where x~ is a point in G projecting down to G=Γ\G. Recall the Laplacian P defined in (1.1). We next introduce the operators Pγ,ST,γ,ST,γ:CV→CV defined by
[TABLE]
for T∈N∗, and the operators Lγ,Lγ:CV→CB defined by
[TABLE]
Finally, denote Varη0I(K−⟨K⟩γ):=Varη0I(K−⟨K⟩γ1) where 1∈H0 is the constant function equal to 1 (so that, with the notation of Section 2.1, 1 is the identity operator).
Proposition 10.1**.**
Fix η0>0 and T∈N∗. For any J∈H0, we have
[TABLE]
Proof.
We have
[TABLE]
We calculate ⟨gj∗,(LγjJ)Bgj⟩ similarly. We then note that
[TABLE]
using that ∣mx1γ∣2∣ζx1γ(x0)∣2=∣mx0γ∣2∣ζx0γ(x1)∣2, by (2.7). Hence,
[TABLE]
Let αx0x1=∣2mx0γ∣2Nγ(x1)∣ζx0γ(x1)∣2, and note that αx1x0=∣2mx0γ∣2Nγ(x0)∣ζx0γ(x1)∣2 by (2.7). Then
[TABLE]
and
[TABLE]
Hence,
[TABLE]
Now \operatorname{Im}\zeta_{x_{0}}^{\gamma}(x_{1})+\operatorname{Im}\zeta_{x_{1}}^{\gamma}(x_{0})\cdot|\zeta_{x_{0}}^{\gamma}(x_{1})|^{2}=|\zeta_{x_{0}}^{\gamma}(x_{1})|^{2}\big{[}\frac{\operatorname{Im}\zeta_{x_{0}}^{\gamma}(x_{1})}{|\zeta_{x_{0}}^{\gamma}(x_{1})|^{2}}+\operatorname{Im}\zeta_{x_{1}}^{\gamma}(x_{0})\big{]}=-2\operatorname{Im}m_{x_{1}}^{\gamma}\cdot|\zeta_{x_{0}}^{\gamma}(x_{1})|^{2} by (2.7). Since 2Immx1γ=Nγ(x1)∣2mx1γ∣2, we get ∣ζx0γ(x1)ζx1γ(x0)∣2Imζx0γ(x1)+Imζx1γ(x0)∣ζx0γ(x1)∣2=∣ζx1γj(x0)∣2−Nγ(x1)∣2mx1γ∣2. Since αx0x1=Nγ(x1)∣2mx1γ∣2∣ζx1γ(x0)∣2 and αx1x0=Nγ(x0)∣2mx1γ∣2∣ζx1γ(x0)∣2 by (2.7), we thus have
[TABLE]
Hence,
[TABLE]
Now note that Pγ(ST,γK)=T1∑s=1T(T−s+1)PγsK=ST,γK−K+ST,γK. Hence,
[TABLE]
for any K∈H0. Taking Kγ=J−⟨J⟩γ, we thus get
[TABLE]
We now consider K∈Hm for m>0. Define Tγ:H1→H1 and O1γ:H1→H0 by
[TABLE]
[TABLE]
For m≥2, define Umγ:Hm→Hm, Omγ:Hm→Hm−1 and Pmγ:Hm→Hm−2 by
[TABLE]
[TABLE]
[TABLE]
Proposition 10.2**.**
Fix η0>0. Suppose ψj(x0)ψj(x1)∈R for any j=1,…,N and (x0,x1)∈B. Then for any K∈H1, we have
[TABLE]
and for any K∈Hm, m≥2, we have
[TABLE]
Proof.
Let K∈H1. Since ψj(x0)ψj(x1)∈R for all (x0,x1), we have
[TABLE]
By definition of Tγ and O1γ, this implies
[TABLE]
and thus
[TABLE]
Recall the definition of ⟨K⟩γ in (1.5). We claim that
[TABLE]
Indeed, we have ⟨K⟩γ=∑(x0,x1)∈BK(x0,x1)Φγ(x0,x1). On the other hand,
[TABLE]
But ζx0γ(x1)Φγ(x1,x1)+ζx1γ(x0)Φγ(x0,x0)=ζx0γ(x1)ζx1γ(x0)1+ζx1γ(x0)ζx0γ(x1)Φγ(x0,x1) by (2.13) and the fact that Ψγ,x(y)=Ψγ,y(x) by (2.8), so that Φγ(x,y)=Φγ(y,x). Hence,
[TABLE]
This proves the proposition for m=1. Now let m≥2. It is easily checked that
[TABLE]
and thus
[TABLE]
We now note that
[TABLE]
Indeed, we have
[TABLE]
so (10.13) follows from (2.13). Using (10.12), this completes the proof.
∎
We introduce one last operator Xγ:H0→H0 given by
[TABLE]
The following corollary then holds assuming all eigenfunctions ψj are real. Note that this assumption is not needed in the special case m=0, corresponding to Theorem 1.1.
Corollary 10.3**.**
Suppose we have shown that limη0↓0limsupN→∞Varnb,η0I(FγK)=0, limη0↓0limsupN→∞Varnb,η0I(FγK)=0
for any Fγ:Hm→Hk that is a polynomial combination of Lγd−1ST,γ, Xγ, Ujγ, Tγ, Ojγ and Pjγ (T fixed), Fγ the same combination with Lγ replaced by Lγ,
and that
[TABLE]
where Cγ:Hm→H0 is any polynomial combination of Ujγ, Tγ, Ojγ and Pjγ.
Then it will follow that limη0↓0limsupN→∞Varη0I(K−⟨K⟩γ)=0 for any K∈Hm. In other words, Theorem 1.3 will follow.
Proof.
The case m=0 holds by Proposition 10.1 and the triangle inequality Varnb,η0I(K−⟨K⟩γ)≤Varnb,η0I(K)+Varnb,η0I(XγK). Here, Fγ has the form Lγd−1ST,γ, Lγd−1ST,γXγ and Cγ=I.
The result for higher m follows by induction using Proposition 10.2. For example, for m=2, the conclusion is obtained by taking Fγ of the form U2γ, TγO2γ, Lγd−1ST,γO1γO2γ, Lγd−1ST,γXγO1γO2γ, Lγd−1ST,γP2γ, Lγd−1ST,γXγP2γ, and Cγ of the form O1γO2γ and P2γ.
∎
Remark 10.4**.**
All the operators in Corollary 10.3 satisfy the assumptions (Hol) from Definition 3.2. Indeed, the first two points of (Hol) are clear (the derivative of any Green function such as ζz or Gz may be assessed for example using the resolvent equation, yielding ∣∂zζz∣≤(Imz)−2).
For the third point, we should estimate N1∑ω∈Bk∣FγK(ω)∣s. Assume first that Xγ is not contained in Fγ. Then assuming ∥K∥∞≤1, we write
[TABLE]
Now Fγ=A(1)⋯A(ℓ) is a composition of operators A(r), each of which is either a multiplication or of nearest-neighbour type (with ST,γ a composition of Laplacians). So the sum ∑ω′A(r)(ω,ω′) reduces to ∑ω′≈ωA(r)(ω,ω′), where depending on the operator, ω′≈ω means ω′=ω, ω′∼ω, ω′∈{oω,tω} (origin and terminus of ω), ω′∈{(x,ω),(ω,y):x∼oω,y∼tω} or ω′∈{(x,ω,y):x∼oω,y∼tω}. In any case, #{ω′≈ω}≤2D. So Fγ(ω,ω′)=∑ω1≈ω⋯∑ωℓ−1≈ωℓ−2A(1)(ω,ω1)…A(ℓ)(ωℓ−1,ω′) and thus ∑ω′∈Bm∣Fγ(ω,ω′)∣≤∑ω1≈ω⋯∑ωℓ≈ωℓ−1∣A(1)(ω,ω1)…A(ℓ)(ωℓ−1,ωℓ)∣. It follows that ∣FγK(ω)∣s≤(2ℓD)s−1∑ω1≈ω⋯∑ωℓ≈ωℓ−1∣A(1)(ω,ω1)…A(ℓ)(ωℓ−1,ωℓ)∣s. Using Hölder’s inequality, if ∑r=1ℓpr1=1, we get using Remark A.3 that
[TABLE]
uniformly in λ. Here, ℓ may depend on T. By definition, all A^(r)(ω,ω′) are well-behaved functions of ζ^ and Gz, so the previous expression is finite using Remark A.4. For example, if Fγ=Tγ, we are reduced to estimating \operatorname{\mathbb{E}}\big{(}\sum_{o^{\prime}\sim o}|\frac{\overline{\zeta^{\gamma}_{o^{\prime}}(o)}\hat{\zeta}^{\gamma}_{o}(o^{\prime})}{\overline{\hat{\zeta}_{o^{\prime}}^{\gamma}(o)}\hat{\zeta}_{o}^{\gamma}(o^{\prime})+1}|^{s}\big{)}. Using (2.7), we observe that ∣ζ^oγ(o′)+ζ^o′γ(o)−1∣∣ζ^oγ(o′)∣=∣2Reζ^oγ(o′)+2m^oγ∣∣ζ^oγ(o′)∣≤2Imm^oγ∣ζ^oγ(o′)∣, and we know from Remark A.4 that \sup_{\gamma}\operatorname{\mathbb{E}}\big{(}\sum_{o^{\prime}\sim o}\frac{|\hat{\zeta}_{o}^{\gamma}(o^{\prime})|^{s}}{(2\operatorname{Im}\hat{m}_{o}^{\gamma})^{s}}\big{)}<\infty. Similarly, if Fγ=Lγd−1ST,γ, then ∣(FγK)(e)∣≤∣moeγ∣2∣ζoeγ(te)∣2Nγ(oe)Nγ(te)1∑r=0T−1[∣(Prd−1NγK)(oe)∣+∣ζoeγ(te)ζteγ(oe)∣∣(Prd−1NγK)(te)∣], so (10.15) reduces to
[TABLE]
for some p1,p2.
The previous discussion was under the assumption A(r)=Xγ. If Fγ=F1γXγF2γ with F1γ and F2γ as in the previous paragraph, we write FγK(ω)=∑ω′F1γ(ω,ω′)⟨F2γK⟩γ, with ∣⟨F2γK⟩γ∣=∣∑xNγ(x)∑xNγ(x)(F2γK)(x)∣=∣∑xNγ(x)∑x∑wNγ(x)F2γ(x,w)K(w)∣≤∑xNγ(x)∑x∑wNγ(x)∣F2γ(x,w)∣. Hence, ∣FγK(ω)∣≤∑ω′∣F1γ(ω,ω′)∣⋅∑xNγ(x)N⋅N1∑x∑wNγ(x)∣F2γ(x,w)∣. Applying Hölder’s inequality to N1∑ω∈Bk(∑ω′∣F1γ(ω,ω′)∣)s and (N1∑xNγ(x)∑w∣F2γ(x,w)∣)s and taking the limit, we obtain a uniform control as before. Thus, all points of (Hol) are satisfied.
In view of Remark 10.4, we may use Theorem 3.3 to conclude that for the Fγ in Corollary 10.3, we have limη0↓0limsupN→∞Varnb,η0I(FγK)=0.
Since Varnb,η0I(FγK) is defined exactly like Varnb,η0I(FγK) except that ζ is replaced by ζ, it is clear that it can be shown to vanish asymptotically using the same arguments, simply replacing ζ by ζ when necessary. By Corollary 10.3, to finish the proof of Theorem 1.3, it suffices to show (10.14). This is what we do now.
Recall that we introduced ∥K∥γ for K∈Hk, k≥1, in (4.1). For K∈H0, we let
[TABLE]
We also define (YγK)(x)=Nγ(x)d(x)⋅∑y∈Vd(y)∑y∈VNγ(y)K(y). Denoting ⟨J⟩U:=N1∑x∈VJ(y) the uniform average of J, we have YγK=⟨d⟩U⟨NγK⟩U⋅Nγd. Fix I=(a,b)⊂I1 as in Section 4.
Proposition 10.5**.**
Under assumptions (BSCT), (Green), if Kγ∈H0 satisfies the set of assumptions (Hol), then for any interval I=(a,b) as above,
[TABLE]
Proof.
We follow the steps in the proof of Theorem 4.1. Let Jγ=(ST,γ−Yγ)Kγ and αγj(x)=Nγj1/2(x). Then Varη0I(Jγ)2≤(N1∑λj∈I∥αγj−1ψj∥2)(N1∑λj∈I∥αγjJGγjψj∥2). As in the proof of (4.3), N1∑λj∈I∥αγj−1ψj∥2≲πN3∫a−2ηb+2η∑ρG(x)≥dR,ηNλ+iη0(x)Ψz+iη0,x~(x~)dλ≤π3(∣I∣+4η) for any small η>0, since Nγ(x)=Ψγ,x~(x~).
Hence, limη0↓0limsupN→∞Varη0I(Jγ)2≤π3∣I∣limη0↓0limsupN→∞N1∑λj∈I∥αγjJGγjψj∥2. Now ∥αγjJGγjψj∥2=∑x∈VNγj(x)∣Jγj(x)∣2∣ψj(x)∣2. Arguing as in Section 4, we get
[TABLE]
where z:=λ+iη4. This is bounded by π3∫a−2ηb+2η∥Jz+iη0∥z+iη02dλ, since Ψγ,x~(x~)=Nγ(x) and χ(λ)≤1 on R.
Summarizing, we have limη0↓0limsupN→∞Varη0I(Jγ)2≤π29∣I∣∫a−2ηb+2η∥Jz+iη0∥z+iη02dλ.
Now recall that ST,γ=T1∑s=1TPγs, and Pγ=NγdPdNγ, so that Pγs=NγdPsdNγ. Moreover, YγK=Nγd⟨d⟩U⟨NγK⟩U. So denoting γ=z+iη0, ∥K∥d2=N1∑x∈Vd(x)∣K(x)∣2, we have
[TABLE]
Here we used (EXP) and the fact that dNγKγ−⟨d⟩U⟨NγKγ⟩U1 is orthogonal to the constants in ℓ2(V,d). Indeed, the orthogonal projector onto 1 in ℓ2(V,d) is P1,dJ=⟨1,1⟩d⟨1,J⟩d1=⟨d⟩U⟨dJ⟩U1. Since ⟨d⟩U⟨NγKγ⟩U1=dNγYγKγ and d1≤1, the proposition follows.
∎
Corollary 10.6**.**
For any Cγ:Hm→H0 as in Corollary 10.3 and Iˉ⊂I1, ∥K∥∞≤1,
[TABLE]
Proof.
Let Kγ′=CγK−⟨CγK⟩γ1. Then YγKγ′=0, since YγCγK=Nγd⟨d⟩U⟨NγCγK⟩U and ⟨CγK⟩γYγ1=⟨Nγ⟩U⟨NγCγK⟩UNγd⟨d⟩U⟨Nγ⟩U. Hence, denoting z=λ+i(η4+η0),
[TABLE]
Now ∥CzK∥z2=N1∑x∈VNz2(x)∣(CzK)(x)∣2≤N1∑x∈VNz2(x)[∑w∈Bm∣Cz(x,w)∣]2. Similarly, ∣⟨CzK⟩λ∣≤∑xNz(x)1∑xNz(x)∑w∣Cz(x,w)∣. For our operators Cz, we thus get ∥CzK∥z2=O(1)N⟶+∞,z and ∣⟨CzK⟩z∣=O(1)N⟶+∞,z, as in Corollary 7.8.
∎
This proves (10.14) and ends the proof of Theorem 1.3 on the interval I.
Suppose further that ρ(∂I1)=0. As I1 is open, we have I1=∪j∈NJj for open intervals Jj=(aj,bj). Let Jjς=(aj+ς,bj−ς) with ς>0 small. Then Jjς⊂I1, so using (9.7) and Corollary 10.6, we get limη0↓0limsupN→∞Varη0Jjς(K−⟨K⟩γ)=0. Now Varη0I1(K′)=∑j=1MVarη0Jjς(K′)+Varη0I1∖∪j=1MJjς(K′) for any given M. By (A.14) and (Green), we have Varη0I1∖∪j=1MJjς(K−⟨K⟩γ)≤N♯{λj∈I1∖∪k=1MJkς}O(1)N⟶+∞,γ. By the convergence of empirical spectral measures (Remark A.3), and using the fact that ρ(∂I1)=0, we have N♯{λj∈I1∖∪k=1MJkς}→ρ(I1∖∪k=1MJkς).
Finally, ρ(I1∖∪k=1MJkς)→0 as ς↓0 and M⟶+∞. The conclusion of Theorem 1.3 thus holds with I replaced by I1.
Finally, if (Green) holds on I1, then ρ({λ})=limη↓0ηImE(Gλ+iη(o,o))=0 for any λ∈I1, since supη>0ImE(Gλ+iη(o,o))<∞. In particular, ρ(∂I1)=0.
Appendix A Benjamini–Schramm topology
A.1. Generalities
In this appendix we collect known facts on the Benjamini-Schramm convergence, we refer the reader to [1, 6, 16, 17, 38] for details.
A coloured rooted graph(G,o,W) is a graph G=(V,E) with a marked vertex o∈V called the root, and a map W:V→R which we see as a “colouring”; it can also be regarded as a potential on ℓ2(V). This is a special case of what is called a network in [6]. All graphs are assumed to be locally finite, i.e. each vertex has a finite degree.
If G is connected, we denote by BG(x,r) the r-ball{y∈V:dG(x,y)≤r}, where dG is the length of the shortest path between x and y in G.
As in [6], we define a distance between coloured connected graphs by
[TABLE]
[TABLE]
Two coloured rooted graphs (G,o,W) and (G′,o′,W′) are equivalent if there is a graph isomorphism ϕ:G→G′ such that ϕ(o)=o′ and W′∘ϕ=W. We denote the equivalence class of (G,o,W) by [G,o,W].
Let G∗ be the set of equivalence classes of connected coloured rooted graphs. Then dloc turns G∗ into a separable complete metric space. We may thus consider the set of probability measures on G∗, denoted by P(G∗).
Any finite connected coloured graph (G,W), G=(V,E), defines a probability measure U(G,W)∈P(G∗) by choosing the root x uniformly at random in V:
[TABLE]
If (Gn,Wn) is a sequence of finite coloured graphs, we say that P∈P(G∗) is the local weak limit of (Gn,Wn) if U(Gn,Wn) converges weakly-∗ to P in P(G∗). This notion of convergence was introduced in [16] and generalized in [6]. In this case, we also say that (Gn,Wn) converges in the sense of Benjamini-Schramm.
The subset G∗D,A⊂G∗ of equivalence classes [G,o,W] such that G is of degree bounded by D, and W takes values in [−A,A], is compact. It follows that P(G∗D,A) is compact in the weak-∗ topology.
Hence, if CfinD,A denotes the set of finite coloured graphs (G,W), G=(V,E), of degree bounded by D and colouring W:V→[−A,A], then any sequence (Gn,Wn)⊂CfinD,A has a subsequence which converges in the sense of Benjamini-Schramm.
Let C(G∗D,A) be the set of continuous functions f:G∗D,A→R.
Then a sequence (Gn,Wn)⊂CfinD,A has a local weak limit P iff there is an algebra A⊂C(G∗D,A) which separates points, such that for all f∈A,
[TABLE]
This follows from the compactness of G∗D,A, see [34, Chapter 13].
It may not be very clear how a continuous function on G∗D,A looks like, so we give a basic example. If BF(o,r) is an r-ball, the sets CF={[G,x,W]:BG(x,r)≅BF(o,r)} turn out to be clopen in G∗D,A, so the characteristic function χCF is continuous. Here BG(x,r)≅BF(o,r) means there exists a graph isomorphism ϕ:BG(x,r)→BF(o,r) with ϕ(x)=o, Using (A.3), it can be shown that in the special case where there is no colouring, (Gn)⊂CfinD,A has a local weak limit P iff
[TABLE]
for any BF(o,r). This was in fact the original criterion in [16]. Using it, one readily checks that a sequence of (q+1)-regular graphs (Gn) satisfies (BST) iff it converges to the (q+1)-regular tree Tq in the sense of Benjamini-Schramm, i.e. iff (Gn) has the local weak limit δ[Tq,o], with o∈Tq arbitrary. More generally, by considering the clopen sets Cr={[G,x,W]:BG(x,r) is not a tree}, one sees that if (Gn,Wn)⊂CfinD,A has a local weak limit P that is concentrated on the subset T∗D,A⊂G∗D,A of coloured rooted trees, then (Gn) satisfies (BST). Conversely, if (Gn) satisfies (BST) and if a subsequence of (Gn,Wn) has a local weak limit P, then P must be concentrated on T∗D,A.
A.2. Convergence of empirical spectral measures.
We now show that Benjamini-Schramm convergence implies convergence of the empirical spectral measures. This is already known in some settings [1, 38, 39]. In this paper we need the variant stated as Corollary A.2.
Given [G,o,W]∈G∗D,A, γ∈C+={z,Imz>0} and x∼y∈G, we define ζxγ(y) as in §2.2. Like in §2.1, Bk is the set of non-backtracking paths of length k on G.
Fix s∈N. Let F:(C∖{0})2s→C be a continuous function and γ∈C+. Let
[TABLE]
For s=1, the sum reduces to ∑x1:x1∼o.
One can remark that Fγ([G,o,W])=Fγ([G,o,W]) where G is the universal cover of G and o,W are lifts of o,W.
Next, given Borel J⊆R, we define the measure
[TABLE]
Fix a compact I⊂R and fix η∈(0,1).
Lemma A.1**.**
Suppose (λn,[Gn,on,Wn])⊂I×G∗D,A converges to (λ,[G,o,W]) in I×G∗D,A. Then μon,F,λn+iη(Gn,Wn) converges weakly-∗ to μo,F,λ+iη(G,W).
Proof.
Since all operators Hn=H(Gn,Wn) and H=H(G,W) are uniformly bounded by D+A, the supports of the spectral measures is compact, so it suffices to show that for any k∈N, μon,F,λn+iη(Gn,Wn)(tk)→μo,F,λ+iη(G,W)(tk); see [34, Chapter 13].
Let k∈N. Denote γn=λn+iη, γ=λ+iη. We have
[TABLE]
We first approximate F by a polynomial.
We have ∣ζxλ+iη(y)∣≤η−1 and ∣Imζxλ+iη(y)∣=η∥(H(y~∣x~)−λ−iη)−1δy~∥ℓ2(G)2. Since ∥H(x∣y)−λ−iη∥ℓ2→ℓ2≤A+D+cI+1=:c for all λ∈I and η∈(0,1), we get ∣Imζxλ+iη(y)∣≥ηc−2.
So let O⊂C be the compact region {ηc−2≤∣z∣≤η−1}. If F is continuous on O2s⊂C2s, by Stone-Weierstrass, given R∈N∗, there is a polynomial PR of 4s variables such that sup(z1;z2s)∈O2s∣F(z1,…,z2s)−PR(z1,zˉ1,…,z2s,zˉ2s)∣≤2R1. Hence, for any λ∈I and (x0;xs), if γ=λ+iη, then
[TABLE]
Let hη(t)=−(t−iη)−1. Given ϵ>0, we may choose a polynomial Qϵ=Qϵη such that ∥hη−Qϵ∥∞<ϵ. It follows that ∥hη(HG~(x~∣y~)−λ)−Qϵ(HG~(x~∣y~)−λ)∥<ϵ. In particular, if Zϵγ(x,y):=Qϵ(HG~(y~∣x~)−λ)(y~,y~), we have for any λ∈I and (x,y)∈B,
[TABLE]
As PR is Lipschitz-continuous on O2s, we may thus find CR,η−1 such that
[TABLE]
by choosing ϵ=2R1CR,η−11. Using (A.5), we thus get uniformly in λ∈I, (x0;xs),
[TABLE]
where we now denote ZR because ϵ is a function of R. Define
[TABLE]
Then up to an error RCD,s,A,k, it suffices to consider
[TABLE]
Let dR be the degree of QR and choose an arbitrary integer r≥dR+s+k=:dR,s,k. Then we may find nr such that for n≥nr, there exists φr:BGn(on,r)∼BG(o,r) with ∥W∘φr−Wn∥BGn(o,r)<1/r. Now ⟨δon,Hnkδon⟩=∑u0,…,uk−1Hn(on,u0)Hn(u0,u1)…Hn(uk−1,on)
and Hn(v,w)=An(v,w)+Wn(v)δw(v). This only depends on BGn(on,k) and its colouring. Similarly, the quantity ZRγ(x,y) corresponding to (Gn,on,Wn) only depends on BGn(y,dR) and its colouring. Since r≥dR,s,k and
φr:BGn(on,r)∼BG(o,r), if we let Hn=AG+Wn∘φr−1 on G, we get ⟨δon,Hnkδon⟩=⟨δo,Hnkδo⟩. Similarly, Pγn([Gn,on,Wn])=Pγn([G,o,Wn∘φr−1]). Let Wn′=Wn∘φr−1. Then for n≥nr,
[TABLE]
Writing Hnk−Hk=∑i=1kHnk−i(Hn−H)Hi−1, we have
[TABLE]
A similar argument yields ∣Pγ([G,o,Wn′])−Pγ([G,o,W])∣≤rCR,D,s,A and ∣Pγn([G,o,Wn′])−Pγ([G,o,Wn′])∣≤CR,D,s,A,I∣λn−λ∣≤rCR,D,s,A,I for n≥nr′. We thus showed that for any r≥dR,s,k, there exists nr′′ such that if n≥nr′′, then ∣μon,F,γn(Gn,Wn)(tk)−μo,F,γ(G,W)(tk)∣≤RCD,s,A,k+rCk,D,A′+CR,D,s,A+CR,D,s,A,I. It follows that limsupn→∞∣μon,F,γn(Gn,Wn)(tk)−μo,F,γ(G,W)(tk)∣≤RCD,s,A,k. Since R is arbitrary, the proof is complete.
∎
If (G,W)∈CfinD,A, we now define, for γ∈C+,
[TABLE]
Corollary A.2**.**
Suppose (Gn,Wn)⊂CfinD,A has a local weak limit P. Fix a compact I⊂R and η∈(0,1). Then μF,λ+iη(Gn,Wn) converges weakly to ∫G∗D,Aμo,F,λ+iη(G,W)dP([G,o,W]), uniformly in λ∈I. In other words, for any continuous φ:R→R, we have uniformly in λ∈I,
[TABLE]
Proof.
Given continuous φ:R→R, define φ:I×G∗D,A→R by φ(λ,[G,o,W])=∫φ(t)dμo,F,λ+iη(G,W)(t). Lemma A.1 states φ is continuous on I×G∗D,A – hence, uniformly continuous.
Let φλ([G,o,W])=φ(λ,[G,o,W]).
Local convergence means that the measures U(Gn,Wn) (defined in (A.2)) converge weakly to P. Thus, for any λ∈I, ∫φλdU(Gn,Wn)→∫φλdρ, i.e. ∣Vn∣1∑x∈Vnφλ([Gn,x,Wn])→∫φλ([G,o,W])dP([G,o,W]), which is the statement of the lemma for fixed λ∈I.
Uniformity in λ comes from the uniform continuity of φ, which implies that the maps λ↦∫φλdU(Gn,Wn) form a uniformly equicontinuous family.
∎
Remark A.3**.**
Taking F≡1, we get in particular the convergence of empirical spectral measures. On the other hand, when φ≡1, we get in particular that under assumption (BSCT), if I⊂R is compact and η∈(0,1) is fixed, then uniformly in λ∈I,
[TABLE]
In the paper, we often encounter expressions of the form ϑγ(x0,x1)=F(ζx0γ(x1),ζx1γ(x0)) in the LHS of (A.8). In this case, we write ϑ^γ(v0,v1):=F(ζ^v0γ(v1),ζ^v1γ(v0)) for the object defined similarly at the limit. For instance, μ^1γ is defined like μ1γ but on the limiting tree (T,W). In the particular case of mγ, we have m^oγ=2Gγ(o,o)−1.
It is worth noting that E[∑o′∼oF(ζ^oγ(o′))]=E[∑o′∼oF(ζ^o′γ(o))]. This holds because N1∑(x0,x1)F(ζx0γ(x1))=N1∑(x0,x1)F(ζx1γ(x0)).
Remark A.4**.**
Using (2.4b), we have ∣ζ^o′γ(o)∣s≤∣Imζ^oγ(u)∣−s for any u∈No∖{o′}. In particular, ∣ζ^o′γ(o)∣s≤∑o′′∼o∣Imζ^oγ(o′′)∣−s. We thus see by (Green) that for any s>0,
[TABLE]
[TABLE]
[TABLE]
We also have
[TABLE]
To see this, consider for simplicity E[∑(v0;v2),v0=o∣ζ^v0γ(v1)ζ^v1γ(v2)∣s]. This is the limit of N1∑(x0;x2)∈B2∣ζx0γ(x1)ζx1γ(x2)∣s. This sum is bounded by (N1∑(x0;x2)∈B2∣ζx0γ(x1)∣2s)1/2⋅(N1∑(x0;x2)∈B2∣ζx1γ(x2)∣2s)1/2 for any N. Using ∣Nx1∣−1≤D and taking N→∞, we see the limit is bounded by DE(∑o′∼o∣ζ^oγ(o′)∣2s)1/2E(∑o′∼o∣ζ^oγ(o′)∣2s)1/2≤DCs by (A.10), for any λ∈I1 and η>0. Hence, supλ∈I1,η>0E[∑(v0;v2),v0=o∣ζ^v0γ(v1)ζ^v1γ(v2)∣s]≤DCs.
Remark A.5**.**
Let us now look at the quantity N1∑(x0,x1)∑(x2;xk),(y2;yk)∣g~γ(x~k,y~k)∣s, which we had to control in Section 4.
Let xk∧yk be the vertex of maximal length in (x0;xk)∩(x0;yk), so xk∧yk=xt for some 1≤t≤k. Then g~γ(x~k,y~k)=2mxkγ−∏l=0k−t−1ζxk−lγ(xk−l−1)⋅ζxtγ(yt+1)∏l=t+1k−1ζylγ(yl+1). We then write N1∑(x0,x1)∑(x2;xk),(y2;yk)=N1∑(x0,x1)∑t=1k∑(x2;xk),(y2;yk),xk∧yk=xt, use Hölder’s inequality, and take N→∞ to get a uniform bound involving E[∑o′∼o∣ζ^oγ(o′)∣s2] and E[∣2m^o∣−s1], both of which are finite. Hence, N1∑(x0,x1)∑(x2;xk),(y2;yk)∣g~γ(x~k,y~k)∣s is uniformly bounded as N→∞.
A.3. Proofs of auxiliary results
We now turn to the proofs of some claims in Section 1. In what follows, η0∈(0,1) is fixed.
Claim (1.8). Let χ:G∗D,A→R and F:C→R be continuous. Then under (BSCT),
[TABLE]
uniformly in λ∈I0. This is a variant of Corollary A.2 when one considers Fγ,χ:(λ,[G,x,W])↦χ([G,x])∑y,d(y,x)=kF(g~γ(x,y)) instead of Fγ. In particular, taking k=0 and χ=1, we obtain (1.8).
Claim (1.9). We may assume F is compactly supported (cf. Lemma A.1), hence uniformly continuous. Let hN(t)=N1∑x∈VNχ([GN,x])∑y,d(y,x)=kF(tImg~Nλ+iη0(x,y)), h(t)=\mathbb{E}\big{(}\chi((\mathcal{T},o))\sum_{v,d(v,o)=k}F(t\operatorname{Im}\mathcal{G}^{\lambda+i\eta_{0}}(o,v))\big{)}, let cN(λ)=∑x~∈DNImg~Nλ+iη0(x~,x~)N and c(λ)=E(ImGλ+iη0(o,o))1.
The family hN is uniformly equicontinuous, and as in (A.11) it converges uniformly to h.
By (1.8), cN(λ)→c(λ) uniformly in λ. So ∣hN(cN(λ)−h(c(λ))∣→0 uniformly in λ. This proves (1.9).
We now turn to the proof of Claim (1.7). Consider the set of (double)-coloured rooted graphs (G,o,W,a), where now W:V⟶R and a:V→{0,1}.
We say (G,o,W,a) and (G′,o′,W′,a′) are equivalent if there is ϕ:G→G′ with ϕ(o)=o′, W′∘ϕ=W and a′∘ϕ=a. We let G∗D,A be the corresponding set of equivalence classes and endow it with a metric dloc defined similarly to (A.1).
This amounts to the same definition as before, except that the colourings now take values in R×{0,1} instead of R. The notion of local weak limit may obviously be extended to this situation.
Assuming that (BSCT) holds, then up to passing to a subsequence, (GN,WN,1lΛN) will have a local weak limit P^ concentrated on {[T,o,W,a]}, whose marginals on T∗D,A coincides with P. The fact that ∣ΛN∣≥αN implies P^(a(o)=1)≥α, since {a(o)=1} is clopen in G∗D,A. We claim that
[TABLE]
uniformly in λ∈I0. Indeed, as in Lemma A.1, if F:I0×G∗D,A→C is given by F(λ,[G,x,W,a])=a(x)Img~λ+iη0(x,x), then F is continuous. So ∫FλdUGN,WN,1lΛN→∫FλdP^ uniformly in λ as in Corollary A.2. Combined with (1.8), this yields (A.12). We next note that for any α>0,
[TABLE]
In fact, suppose on the opposite that for all ϵ>0, we can find λ∈I1,η0∈(0,1) and a such that P^(a(o)=1)≥α and E^(a(o)ImGλ+iη0(o,o))≤ϵ.
The latter implies
[TABLE]
On the other hand, since a takes only the values 0 and 1,
[TABLE]
Thus,
[TABLE]
Equation (A.9) with s=2 implies that P^(ImGλ+iη0(o,o)<ϵ1/2)≤Cϵ, for some constant C<∞ independent of λ,η0. So P^(ImGλ+iη0(o,o)≥ϵ1/2)≥1−Cϵ. By assumption, P^(a(o)=0)≤1−α.
Taking ϵ→0 we would obtain α≤0, a contradiction. We thus proved (A.13). Since (A.12) holds uniformly in λ, we get (1.7).
Finally, as in the proof of (A.12), we may consider the set of double-coloured rooted graphs (G,o,W,K), where K is a colouring of pairs of vertices x,y∈G, dG(x,y)≤R, with values in {∣z∣≤1}⊂C. Assuming (BSCT) holds, up to passing to a subsequence, (GN,WN,KN) will have a local weak limit P^ concentrated on {[T,o,W,K]} whose marginals on T∗D,A coincides with P. We then deduce as before that uniformly in λ∈I0,
[TABLE]
Acknowledgements : This material is based upon work supported by the Agence Nationale de la Recherche under grant No.ANR-13-BS01-0007-01, by the Labex IRMIA and the Institute of Advance Study of Université de Strasbourg, and by Institut Universitaire de France.
Bibliography48
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Abért, A. Thom and B. Virág, Benjamini-Schramm convergence and pointwise convergence of the spectral measure , author homepage.
2[2] A. De Luca, B. L. Altshuler, V. E. Kravtsov, and A. Scardicchio, Anderson Localization on the Bethe Lattice: Nonergodicity of Extended States , Phys. Rev. Lett. 113 (2014) 046806.
3[3] A. De Luca, B. L. Altshuler, V. E. Kravtsov, and A. Scardicchio, Support set of random wave-functions on the Bethe lattice , ar Xiv 2013.
4[4] M. Aizenman, S. Warzel, Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs , J. Math. Phys. 53 (2012) 095205, 15.
5[5] M. Aizenman, M. Shamis and S. Warzel, Resonances and partial delocalization on the complete graph , Ann. Henri Poincaré 16 (2015), 1969–2003.
6[6] D. Aldous, R. Lyons, Processes on unimodular random networks , Electron. J. Probab. 12 (2007) 1454–1508.
7[7] N. Anantharaman, Quantum ergodicity on regular graphs . To appear in Comm. Math. Phys.
8[8] N. Anantharaman, Some relations between the spectra of simple and non-backtracking random walks , preprint ar Xiv:1703.03852 (2017).