Global multiplicity bounds and Spectral Statistics Random Operators
Anish Mallick, M Krishna

TL;DR
This paper establishes lower bounds on spectral multiplicity for Anderson operators with full support randomness and links higher multiplicity to non-Poisson local spectral statistics, advancing understanding of spectral behavior in disordered systems.
Contribution
It demonstrates a uniform lower bound on spectral multiplicity for certain Anderson models and connects multiplicity with local spectral statistics, especially non-Poisson behavior.
Findings
Spectral multiplicity has a uniform lower bound on sets of positive measure.
Higher spectral multiplicity implies non-Poisson local spectral statistics.
In higher rank Anderson models, multiplicity greater than one correlates with non-Poisson statistics.
Abstract
In this paper, we consider Anderson type operators on a separable Hilbert space where the random perturbations are finite rank and the random variables have full support on . We show that spectral multiplicity has a uniform lower bound whenever the lower bound is given on a set of positive Lebesgue measure on the point spectrum away from the continuous one. We also show a deep connection between the multiplicity of pure point spectrum and local spectral statistics, in particular, we show that spectral multiplicity higher than one always gives non-Poisson local statistics in the framework of Minami theory. In particular, in higher rank Anderson models with pure-point spectrum, with the randomness having support equal to , there is a uniform lower bound on spectral multiplicity and in case this is larger than one the local statistics is not Poisson.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Random Matrices and Applications · Lanthanide and Transition Metal Complexes
Global multiplicity bounds and Spectral Statistics for Random Operators
ANISH MALLICK
Pontificia Universidad Católica de Chile
Rolando Chuaqui Building, San Joaquin Campus.
Avda. Vicuña Mackenna 4860, Macul, Chile.
e-mail: [email protected]
KRISHNA MADDALY
Ashoka University
Plot No 2, Rajiv Gandhi Education City,
Rai 131029, Haryana, India.
e-mail: [email protected]
Abstract
In this paper, we consider Anderson type operators on a separable Hilbert space where the random perturbations are finite rank and the random variables have full support on . We show that spectral multiplicity has a uniform lower bound whenever the lower bound is given on a set of positive Lebesgue measure on the point spectrum away from the continuous one. We also show a deep connection between the multiplicity of pure point spectrum and local spectral statistics, in particular we show that spectral multiplicity higher than one always gives non-Poisson local statistics in the framework of Minami theory.
In particular for higher rank Anderson models with pure-point spectrum, with the randomness having support equal to , there is a uniform lower bound on spectral multiplicity and in case this is larger than one the local statistics is not Poisson.
keywords: Spectral Theory, Random Operators, Perturbation Theory.
MSC-2010: 81Q10, 47A10, 47A55, 47H40.
1 Introduction
Random operators are an important field of study for various reasons. Over the years much focus is given to a certain class of random operator like Anderson tight binding model, continuum random Schrödinger operator, multi-particle Anderson model and many others. Some of these models were initially developed to study localization phenomenon and a lot of research is focused on showing the existence of pure point spectrum and exponentially decaying Green’s function.
The model considered in this paper is
[TABLE]
Typically one takes to be the on with possibly a vector potential or a periodic background potential added and the adjacency operator on with independent random variables with a countable collection of projections. In such a setting there are several questions relating to these operators that are of interest. In the mid-fifties Anderson [1] proposed that for large disorder the models on should exhibit localization. Several rigorous results on localization followed from the early eighties starting with the work of Fröhlich-Spencer [2] who formulated multi scale analysis. Some of the papers on localization for large disorder are [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13] and [14, 15, 16, 17]. For a comprehensive study of the subject we refer to any of [18, 19, 20, 21, 22] and the references there.
The next set of questions concern the simplicity of the spectrum and in this direction there are several papers starting from Simon [23], Jakšić-Last [24, 25], Naboko-Nichols-Stolz [26], Mallick [27, 28, 29, 30, 31]. From these set of papers, we now know that when the rank of is one or for some special cases of higher rank , the singular spectrum is simple. In the papers [28, 32], the authors show that there are non-trivial example of random operators where the singular spectrum has non-trivial multiplicity.
Another set of questions of interest are the local spectral statistics and or level spacing of the eigenvalues. The first rigorous work of Molchanov [33] led later to the Minami Theory [34], which establishes a set of sufficient conditions for the local spectral statistics to be Poisson. There are several papers on local spectral statistics on discrete models such as [4, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45]. Dietlein and Elgart showed Minami like estimate and thereby showing Poisson local statistics at the spectral edge in case of random Schrödinger operators in [46]. Their method involves a detailed analysis of the behavior of clusters of eigenvalues possible in the spectrum.
Minami theory [34] involves looking at the region of complete exponential localization and prove an inequality now known as the Minami estimate as part of the proof to show the local statistics is Poisson. It was not clear how crucial the Minami estimate is for determining the local statistics. Recently Hislop-Krishna [47], showed that in all the above models exponential localization and Wegner estimate together imply that the local spectral statistics, whenever it exists, is always Compound Poisson. The Minami estimate assures us that the Lévy measure associated with the limiting infinitely divisible distribution has support at ensuring that the distribution is Poisson. To state differently, Minami estimate rules out the possibility of the limit points, of an array of independent random variables that are usually constructed in the problem of obtaining local statistics, having double points.
The work of Klein-Molchanov [48] showed that in the presence of exponential localization, Minami estimate implies that the point spectrum is simple when has rank one. The results of the two papers [48] and [47] raise an interesting question of what the connection between spectral multiplicity and the Minami estimate could be. Our motivation for this exposition is to address this question. In this paper we consider general unperturbed operators and finite rank for the case when the distribution of the single site potential has support equal to . We have two very surprising results in this paper, the first is that the spectral multiplicity of pure point spectrum in any set of positive Lebesgue measure gives a lower bound for the spectral multiplicity everywhere in the pure point spectrum. The second is that *Minami estimate gives a sufficient condition for the simplicity of pure point spectrum even in the case when the rank of is not one. * To our knowledge, these results are new in this generality. This result is not vacuous because Dietlein and Elgart [46] proved Minami estimate in continuous case, though the expression they obtained is similar to expression from Theorem 1.5. Another example is given after the statement of Theorem 1.5.
The family of random operator we focus on here can be described as follows. On a separable Hilbert space the random operators we will focus on are of the form given in equation (1.1), satisfying the following assumptions.
Hypothesis 1.1**.**
We assume that is an essentially self-adjoint operator with its domain of definition denoted by , is a countable collection of mutually orthogonal finite rank projections with
[TABLE]
The real-valued random variables are mutually independent and are distributed with respect to the absolutely continuous distribution , where for each .
In the case of unbounded for example the on with its maximal domain , taking a countable basis in and considering the finite rank projections generated by them will satisfy the hypothesis. In case of , another method is to use smooth basis from and translate them using action to get the desired result. Anderson tight binding model and Anderson dimer/polymer models fall in this family of operators. We will focus on the pure point spectrum away from the continuous spectrum. Our theorems are valid for several non-ergodic operators, so to accommodate those cases, we define
[TABLE]
and
[TABLE]
A discerning reader may note that the condition in the definition of is precisely the Simon-Wolff criterion for pure point spectrum for a.e. , when has rank one. For the Anderson model on the lattice, even for higher rank cases, the Aizenman-Molchanov method can be used to prove localization on for large enough under our assumptions on . So for such models, the set has infinite Lebesgue measure under the Hypothesis (1.1). Note that in the definition of , we are considering perturbations by finitely many projections because if
[TABLE]
for some and , then above equation holds for almost all w.r.t. Lebesgue measure.
We define , where is the orthogonal projection given by , for any subset With these definition in place we state a principal result which is the following:
Theorem 1.2**.**
Consider the random operators on a separable Hilbert space , given by equation (1.1), satisfying the Hypothesis (1.1). Assume further that for every . Suppose there is a subset , of positive Lebesgue measure and a such that the multiplicity of eigenvalues of is bounded below by on for a.e. . Then,
Then for every finite , the multiplicity of any eigenvalue of the operator is bounded below by for a.e. . 2. 2.
The multiplicity of on is bounded below by for almost every .
Remark 1.3**.**
A few comments are in order before we proceed further.
When is unbounded and satisfy the Hypothesis 1.1, it may still happen that the are not essentially self-adjoint. However there are numerous examples where they are indeed self-adjoint. 2. 2.
The hypothesis is essential. This is demonstrated by following example: On the Hilbert space consider the random operator
[TABLE]
for , where are i.i.d random variables following uniform distribution on . The projections
[TABLE]
commute with and is the Anderson operator on , so it has pure point spectrum. We notice that for are unitarily equivalent, so all the eigenvalues coincide. Hence the multiplicity of is three on the interval . But on the interval , the multiplicity is bounded below by , hence the conclusion of theorem 1.2 fails to hold. On other hand if we choose to be i.i.d random variable following some distribution with , then using the fact that the spectrum of is dense in , we see that the minimum multiplicity of eigenvalues on a given interval is two.
We define the random variables,
[TABLE]
for any interval , where denotes the spectral projection for the operator .
Our main theorem has two remarkable consequences. The first is on the multiplicity of the pure point spectrum if Minami estimate [34], namely,
[TABLE]
holds for any finite and the constant independent of .
Theorem 1.4**.**
Consider the operators satisfying the Hypothesis (1.1) and let denote restricted to the closed -invariant subspace
[TABLE]
Suppose that for all and there is a non-trivial interval and a finite such that the Minami estimate (1.2) holds for every subinterval . Then the spectrum of in is simple.
Another extension of Theorem 1.4 which is obtained by combining Theorem 1.2 with a result of Anish-Dolai [28, Lemma 4.1] is:
Theorem 1.5**.**
Let satisfy the conditions of Theorem 1.2. Suppose for a non-trivial interval and , the generalized Minami estimate
[TABLE]
is valid for all and any subinterval with independent of . Then has uniform multiplicity and multiplicity of is bounded above by .
The generalized Minami estimate stated above usually shows up where is rank of projection. But there are special cases (such as [46]) where . As a trivial example, consider and on the Hilbert space . It is easy to see that the generalized Minami estimate holds (with ) for any bounded interval with large enough . The reason generalized Minami estimate is important is because it can show the absence of simple Poisson statistics for the model. It was shown in [47] that complete exponential localization and Wegner estimate are enough to conclude that limiting statistics in Minami theory [34] is always Compound Poisson.
Suppose for each , , are disjoint regions and are intervals such that and consider the array of independent random variables,
[TABLE]
Theorem 1.6**.**
Consider the operators as in theorem 1.2. Suppose there exists a set of positive Lebesgue measure in which the spectrum of is pure point and has spectral multiplicity bigger than one. Then for any and any sequence of bounded interval as above, if the array is asymptotically negligible, then the limit points of are not a Poisson random variables.
Ideas of Proofs
The proof of above theorems are given in next section, however we quickly go over the ideas involved in the proofs. An important part of the proof of Theorem 1.2 is to study for a finite rank projection , since the operator can be re-written as (2). Then, the proof of Theorem 1.2 is divided into four parts, with Lemma 2.2 and Lemma 2.5 addressing the spectrum of only and the Corollary 2.4 and 2.6 use the lemmas to conclude the claims of the Theorem 1.2.
In Lemma 2.2 we show that if the multiplicity of the spectrum of is bounded below by in some interval for almost all , then the algebraic multiplicity of eigenvalues of (as a linear operator on ) is bounded below by for . We then rewrite as in (2) and use the representation (2) of , to conclude that the multiplicity of the spectrum of is bounded below by . This is the idea behind statement (1) of Theorem 1.2, the details of the proof are in the Corollary 2.4.
We then concentrate on the converse, Lemma 2.5, namely if the algebraic multiplicity of roots of the operator (as a linear operator on ) is bounded below by for , then the multiplicity of the spectrum of in
[TABLE]
is bounded below by . We then use the representation (2) for and Lemma 2.2 and Lemma 2.5 along with the fact that is dense subset of , to get the lower bound on the multiplicity of spectrum for in .
The main reason for concentrating on the set is because in this set, the operator has pure point spectrum, and
[TABLE]
with respect to Lebesgue measure, which is shown in Lemma 2.1. Hence any bound on the multiplicity of eigenvalues of translate to a bound on multiplicity of eigenvalues of and vice-versa in the region
The proof of Theorem 1.4 follows all the above steps but is more concise owing to the Minami estimate, which guarantees that the spectrum of is simple over the interval almost surely. Using the representation (2) we get that the matrix (as a linear operator on ) has simple spectrum for . The discriminant for a polynomial with simple roots is non-zero, so the discriminant for the polynomial (in )
[TABLE]
which is the determinant of a Sylvester matrix whose entries are polynomial of matrix element of , is an analytic function on . So the eigenvalues of the matrix are simple for almost all . So following the steps of proof of Lemma 2.5 and Corollary 2.6 completes the proof of the theorem. Similar approach also works for Theorem 1.5.
The proof of Theorem 1.4 is a special case of the technique developed in Lemma 2.2 and Lemma 2.5. But it is easier to follow and provides an insight for the steps involved in the proof of the Lemma 2.2 and Lemma 2.5.
2 Proofs of the Theorems
In this section we will work with a fixed finite subset . Let be an enumeration of and let be a real orthogonal matrix of the form
[TABLE]
Setting , where and , we have
[TABLE]
For and , observe that
[TABLE]
Since we have for almost all for almost all . Hence the conditional distribution of given is absolutely continuous. Decomposing the operator as
[TABLE]
one can view as a random variable with absolutely continuous distribution depending on .
With above observation, the result boils down to studying the multiplicity problem for single perturbation. We only need to work with a fixed essentially self-adjoint operator on a separable Hilbert space , and set
[TABLE]
for some finite rank projection . Defining the closed -invariant subspace
[TABLE]
and observe that it is -invariant, so using Spectral theorem we have
[TABLE]
where is the spectral measure associated with the operator and is given by
[TABLE]
for with compact support. Using functional calculus we have
[TABLE]
and using [49, Theorem 6.1] we can retrieve the measure from , where we view
[TABLE]
as a linear operator over a finite dimensional vector space . Denote
[TABLE]
and
[TABLE]
whenever the limit exists for . By general theory for matrix valued Herglotz functions [49, Theorem 6.1], the set
[TABLE]
has full Lebesgue measure.
Lemma 2.1**.**
On a separable Hilbert space let be a self-adjoint operator and set for and a finite rank projection . Set
[TABLE]
to be the -invariant subspace containing the space and
[TABLE]
Then for any the linear map
[TABLE]
defined by is well defined and is a bijection.
Proof.
We first note that if is not finite, then there must be a vector in the since the rank of is finite, since the limit always exists by monotone convergence theorem. Using the observation that is -invariant for all , we will view and as self-adjoint operators on only. For , the map
[TABLE]
defined by is well defined and linear. To see this let , then,
[TABLE]
But
[TABLE]
where is the spectral projection of . Therefore if then we will have
[TABLE]
where is also a matrix-valued Herglotz function. (Reason: By assumption and by polarization consider a vector such that . Then denoting the measure , we have by Theroem [52, Theorem 1.3.2(1)],
[TABLE]
Since the real parts of and are the same, the relation follows. )
This relation shows that the does not exist. So using the fact that , we get
[TABLE]
Combining the above equation and (2) we have
[TABLE]
which implies . The map is one-one because, if for some , then
[TABLE]
which implies , giving a contradiction.
Now for the inverse of the map, define
[TABLE]
by . By the definition of the element for any and . Let for some . This choice leads us to :
[TABLE]
Therefore
[TABLE]
Let , then using the fact that we have
[TABLE]
Therefore . Substituting equation (2.3) and using the condition that ,
[TABLE]
hence . The injectivity of the map follows from
[TABLE]
This completes the proof of lemma because is the inverse of the map .
∎
In the following Lemma, we regard as an operator on .
Lemma 2.2**.**
Let and be defined as in Lemma 2.1, and let be a subset of of positive Lebesgue measure. . Suppose any eigenvalue of in has multiplicity at least for almost all . Then all the roots of the polynomial (in )
[TABLE]
have multiplicity bounded below by , for almost all .
Remark 2.3**.**
Note that since , the measure is not equivalent to Lebesgue measure, so using F. and M. Riesz theorem [25, Theorem 2.2], we get that for .
Note that even if , the proof of Lemma 2.1 shows that for in we have
[TABLE]
So the hypothesis is not vacuous.
Proof.
Since the subset is contained inside , we can apply Lemma 2.1 and claim
[TABLE]
Now using above observation for any and the hypothesis of the lemma, we get that the geometric multiplicity of spectrum for is at least for almost all in . In algebraic terms this implies that all the roots of the polynomial (in )
[TABLE]
has multiplicity bounded below by for almost all in .
Now for , consider the polynomial (let )
[TABLE]
and define
[TABLE]
where following Euclid’s algorithm we get that are rational polynomials of . Now consider
[TABLE]
where are rational polynomial of and . Since are rational polynomials of , we can view to be rational polynomial of only.
First notice that each root of is a root of , and each root of has multiplicity one. So if all the roots of the polynomial has multiplicity at least , then divides as a polynomial of . So define the reminder
[TABLE]
which following division algorithm tells us that are rational polynomial of and . Since are rational polynomial of , we can view as rational polynomial of only. We are only interested in numerator of (as a rational polynomial in ) which will be denoted by . Note that are defined for (because they are polynomial of which are defined for ). Now using the fact that all the roots of has multiplicity bounded below by , we have for almost all for all . Since has non-zero Lebesgue measure, using the Privalov Uniqueness Theorem [50, page 552], we conclude that for , which means
[TABLE]
Hence all the roots of have multiplicity bounded below by .
∎
With the lemma in place, part (1) of Theorem 1.2 boils down to writing the resolvent in a certain way and taking the limit . This is done in the following corollary to prove the result.
Corollary 2.4**.**
Let be defined by (1.1) and satisfies the hypothesis of theorem 1.2. For any finite subset , if then the multiplicity of any eigenvalue of the operator
[TABLE]
is bounded below by almost surely.
Proof.
Using the fact that can be written as (2), defining
[TABLE]
and by the definition of , we have
[TABLE]
for almost all . Hence we can use the lemma 2.2 and get that the roots of the polynomial (in )
[TABLE]
has multiplicity bounded below by , for almost all and .
Now using the resolvent equation for and , where
[TABLE]
we can write (viewed as an operator on )
[TABLE]
(To get this relation we write , and using resolvent equation twice we have
[TABLE]
Then take the last term to the left to get
[TABLE]
Since action of preserves and and , once we multiply from left and right in above expression, we are left with
[TABLE]
We get the expression (2) by using above expression and the fact that is same as .)
So we conclude that the algebraic multiplicity of eigenvalues of the matrix
[TABLE]
is at least for almost all and . Using the fact that and are finite rank operator hence bounded and
[TABLE]
there exists such that
[TABLE]
Denoting and , we have the multiplicity of each root of the polynomial (in )
[TABLE]
is bounded below by for almost all . Set
[TABLE]
then for , we have
[TABLE]
where and be the corresponding eigenvector, so we conclude that has an eigenvalue in the ball . On other hand for any eigenvalue of for , let be the corresponding eigenvector for , then
[TABLE]
so there is a unique eigenvalue of in the ball .
Let be an enumeration of the eigenvalues of for , then
[TABLE]
where is the algebraic multiplicity of the eigenvalue . Since all the roots of the polynomial has multiplicity bounded below by , we have . Using the convergence of to an eigenvalue of as and
[TABLE]
we get that that all the eigenvalues of have algebraic multiplicity bounded below by . Since is self-adjoint, we have the equality between algebraic and geometric multiplicity, hence proving the corollary.
∎
For the second part of theorem 1.2, we first need to obtain the claim for -invariant subspaces . This is done in the following lemma.
Lemma 2.5**.**
Let be defined as in Lemma 2.1. Suppose that the roots of the polynomial (in )
[TABLE]
have multiplicity at least for almost all . Then the multiplicity of all the eigenvalues in of restricted to is at least for almost all with respect to Lebesgue measure.
Proof.
Following the steps from the proof of Lemma 2.2, we can construct the function from the polynomial (in )
[TABLE]
and conclude that the algebraic multiplicity of the eigenvalues for is bounded below by for almost all with respect to Lebesgue measure. Hence the set
[TABLE]
satisfies
Next using Lemma 2.1 we have
[TABLE]
Using the equation
[TABLE]
and the fact that , we conclude that
[TABLE]
so is a self-adjoint matrix, hence the geometric and algebraic multiplicity of its eigenvalues coincide. So the lemma is concluded by the fact that on the the multiplicity of an eigenvalues of is at least and using Spectral Averaging, (whereby if are self-adjoint operators on and the operator of multiplication by in , then the spectral measures of on , associated with vectors in the range of are always absolutely continuous for positive bounded operators , see for example Krishna-Stollmann [53], from which it follows that), we have
[TABLE]
so the multiplicity eigenvalues of in is bounded below by for almost all .
∎
Now the proof of second part of Theorem 1.2 is a consequence of lemma 2.2 and 2.5 along with a density argument.
Corollary 2.6**.**
Let be defined as (1.1) and assume that it satisfies the hypothesis of the Theorem 1.2 on the set with the lower bound on the multiplicity given by . Then the multiplicity of any eigenvalue in for the operator is bounded below by for almost all .
Proof.
The proof is done for an increasing family of -invariant Hilbert subspaces, the theorem then follows by a density argument. Let be an enumeration of and define
[TABLE]
and set . Denote
[TABLE]
and let be the canonical projection onto . For any we have
[TABLE]
for , i.e is also -invariant. Following the decomposition of (2) we have a change of variables from to using an orthogonal matrix such that
[TABLE]
where . So writing
[TABLE]
we have . To distinguish the variable denote
[TABLE]
Since , the definition of implies
[TABLE]
for almost all . Hence using the lemma 2.2 for , we conclude that all the roots of the polynomial (in )
[TABLE]
have multiplicity at least , where is viewed as a linear operator on . With this observation, hypothesis of lemma 2.5 is satisfied. So we conclude that the multiplicity of spectrum of restricted to (which is -invariant) in
[TABLE]
is bounded below by , for almost all . Since the second condition on the set is precisely the Lemma 2.1 criterion for pure point spectrum, we have
[TABLE]
where is same as where is such that .
Hence we conclude that for almost all , the multiplicity of the operator restricted on the invariant subspace is bounded below by . This also implies that the multiplicity of the operator restricted onto the invariant subspace is bounded below by for almost all . This follows because are independent of . Now using the inclusion for all which is implied by our hypothesis 1.1 on ,, the subspace
[TABLE]
is -invariant subspace of . By above argument it is clear that the multiplicity of spectrum, in for restricted on closure of , is bounded below by . We get the conclusion of the corollary by observing that is dense in because of strongly.
∎
Proof of Theorem 1.2 :
By hypothesis of the theorem, the hypothesis of Corollary 2.4 is satisfied hence part (1) of the theorem is proved. For the second part, Corollary 2.6 gives the proof of the statement.
∎
Proof of Theorem 1.4:
By the definition of , our Lemma 2.1 and the comment at the beginning of the proof of Lemma 2.1 together with the invariance of imply that has no continuous component of spectrum in . We then start with a proof of simplicity of the spectrum of in . To this end take and set
[TABLE]
Then, using the Minami estimate we have for each ,
[TABLE]
which converges to zero as .
Following the steps involved in obtaining (2), we can write
[TABLE]
where and is real random variable with an absolutely continuous distribution, depending on , having non-zero density at all points.
Since is an operator on and acts as the identity operator on , we have Combining these two facts we see that any eigenvalues of is almost surely simple for almost all . Since , we conclude that has simple spectrum. Since is a multiple of identity, we conclude that also has simple spectrum a.e. , let us denote this set of full measure to be .
It remains to show that the simplicity of spectrum of implies the simplicity of eigenvalues of , as a linear operator on for a.e. .
The simplicity of the spectrum of follows if we show that the discriminant of the polynomial
[TABLE]
is non-vanishing. Now, can be written as the determinant of the Sylvester matrix of and it’s derivative, which is are analytic functions of in .
Since has simple spectrum, using the representation (2) for we conclude that for , which implies that for almost all . Hence, by Privalov uniqueness theorem [50, page 552],
[TABLE]
which gives the simplicity of spectrum of for almost all . So using Lemma 2.1 we conclude that the operator restricted on the invariant subspace on the set has simple spectrum.
So using the fact that is -invariant, we get the simplicity of spectrum of in on the subspace for almost all .
∎
Proof of Theorem 1.5:
By using argument from the proof of theorem 1.4, we conclude that the multiplicity of the spectrum for is bounded above by . Hence using the decomposition (2) of and following the argument of the corollary 2.4 we conclude that the multiplicity of any roots of the polynomial (in )
[TABLE]
is bounded above by for almost all almost surely, where is viewed as a linear operator on for any finite . So using [28, Theorem 1.1] we conclude that the maximum multiplicity of is bounded above by . This completes the proof of the theorem.
∎
Proof of Theorem 1.6:
The assumption that the spectral multiplicity in is bigger than one implies that the spectral multiplicity of is bigger than one for any finite , by Theorem 1.2. Therefore for any finite subset , and any interval , we have
[TABLE]
showing that
[TABLE]
Therefore, if is a uniformly asymptotically negligible array of random variables, (see [51, Section 11.2], then Theorem 11.2 of [51], applied to random variables, shows that the limit
[TABLE]
with the convergence in distribution, is not a Poisson random variable. The proof of [47, theorem 5.1], also gives an alternative proof of the Theorem.
∎
Acknowledgments
We thank Dhriti R. Dolai for discussions and Ashoka University for local hospitality to AM where part of this work was done.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Philip W Anderson. Absence of diffusion in certain random lattices. Physical review , 109(5):1492, 1958.
- 2[2] Jürg Fröhlich and Thomas Spencer. Absence of diffusion in the anderson tight binding model for large disorder or low energy. Communications in Mathematical Physics , 88(2):151–184, 1983.
- 3[3] Michael Aizenman, Alexander Elgart, Serguei Naboko, H. Jeffrey Schenker, and Gunter Stolz. Moment analysis for localization in random schrödinger operators. Inventiones mathematicae , 163(2):343–413, 2005.
- 4[4] Michael Aizenman and Stanislav Molchanov. Localization at large disorder and at extreme energies: An elementary derivations. Communications in Mathematical Physics , 157(2):245–278, 1993.
- 5[5] Victor Chulaevsky, Anne Boutet De Monvel, and Yuri Suhov. Dynamical localization for a multi-particle model with an alloy-type external random potential. Nonlinearity , 24(5):1451, 2011.
- 6[6] J.M. Combes and P.D. Hislop. Localization for some continuous, random hamiltonians in d-dimensions. Journal of Functional Analysis , 124(1):149 – 180, 1994.
- 7[7] JM Combes and PD Hislop. Schrödinger operators with magnetic fields. In Partial Differential Operators and Mathematical Physics: International Conference in Holzhau, Germany, July 3–9, 1994 , volume 78, page 61. Birkhäuser, 2012.
- 8[8] François Delyon, Yves Lévy, and Bernard Souillard. Anderson localization for multi-dimensional systems at large disorder or large energy. Communications in Mathematical Physics , 100(4):463–470, 1985.
