This paper studies the asymptotic behavior of eigenvalues of the two-dimensional Anderson Hamiltonian with white noise potential, showing they grow logarithmically with the domain size and converge to a deterministic constant.
Contribution
It establishes the almost sure convergence of eigenvalues scaled by log L to a deterministic limit, characterized by a variational formula.
Findings
01
Eigenvalues divided by log L converge almost surely.
02
The limit is a deterministic constant given by a variational formula.
03
Provides asymptotic characterization of the spectrum in large domains.
Abstract
In this paper we consider the Anderson Hamiltonian with white noise potential on the box [0,L]2 with Dirichlet boundary conditions. We show that all the eigenvalues divided by logL converge as L→∞ almost surely to the same deterministic constant, which is given by a variational formula.
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
\RenewEnviron
calc \RenewEnvironhide
Asymptotics of the eigenvalues of the Anderson Hamiltonian with white noise potential in two dimensions
Khalil Chouk
111School of Mathematics,
University of Edinburgh, United Kingdom.
Willem van Zuijlen
222
Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany.
(December 6, 2020)
Abstract
In this paper we consider the Anderson Hamiltonian with white noise potential on the box [0,L]2 with Dirichlet boundary conditions.
We show that all the eigenvalues divided by logL converge as L→∞ almost surely to the same deterministic constant, which is given by a variational formula.
We consider the Anderson Hamiltonian (also called random Schrödinger operator), formally defined by
H=Δ+ξ, under Dirichlet boundary conditions on the two-dimensional box [0,L]2, where ξ is considered to be white noise. color=green!50]PUT DATE BY HAND!!
We are interested in the behaviour of this operator as the size of the box, L, tends to infinity.
In this paper we prove the following asymptotics of the eigenvalues.
Let λ(L)=λ1(L)>λ2(L)≥λ3(L)⋯ be the eigenvalues of the Anderson Hamiltonian on [0,L]2. For all n∈N, almost surely
[TABLE]
where χ is the smallest C>0 such that ∥f∥L44≤C∥∇f∥L22∥f∥L22 for all f∈H1(R2) (this is Ladyzhenskaya’s inequality).
1.1 Main challenge and literature
In the one dimensional setting, i.e., on the box [0,L], the Anderson Hamiltonian can be defined using the associated Dirichlet form as the white noise is sufficiently regular, see Fukushima and Nakao [14] (see [35] for the regularity of white noise).
In dimension two the regularity of white noise is too small to allow for the same approach.
A naive way to tackle the problem of the construction is to take a smooth approximation of the white noise ξε so that the operator Hε=Δ+ξε is well-defined as an unbounded self-adjoint operator, and then take the limit ε↓0.
However, Hε does not converge, but Hε−cε does converge to an operator H for certain renormalisation constants cε↗ε↓0∞.
This has been shown by Allez and Chouk [1] for periodic boundary conditions, using the techniques of paracontrolled distributions introduced by Gubinelli, Imkeller and Perkowski [16] in order to study singular stochastic partial differential equations. In this paper we extend this to Dirichlet boundary conditions.
Recently, also Labbé [21] constructed the Anderson Hamiltonian with both periodic and Dirichlet boundary conditions, using the tools of regularity structures.
Gubinelli, Ugurcan and Zachhuber [17] extend the work of Allez and Chouk to define the Anderson Hamiltonian with periodic boundary conditions also for dimension 3.
One of the main interests in the study of this operator is due to its universal property, more precisely, it was proved by Chouk, Gairing and Perkowski [8, Theorem 6.1]
that under periodic boundary conditions the operator H is the limit (in the resolvent sense) under a suitable renormalisation of the discrete Anderson Hamiltonian
HN=ΔN+N1ηN defined on the periodic lattice (N1Z/NZ)2 where ΔN is discrete Laplacian and (ηN(i),i∈Z2) are centred I.I.D. random variables with normalised variance and finite p-th moment, for some p>6.
Recently, Dumaz and Labbé [13] proved the Anderson localization for the one dimensional case for the largest eigenvalues and they obtain the exact fluctuation of the eigenvalue and the exact behaviour of the eigenfunctions near their maxima.
Unfortunately, their approach used to tackle the Anderson localization in the one dimensional setting is strongly attached to the SDE obtained by the so-called Riccati transform and cannot be adapted to the two dimensional setting.
Also Chen [7] considers the one dimensional setting for the white noise (and shows λ(L)≈(logL)32), but also a higher dimensional setting for the more regular fractional white noise (where λ(L)≈(logL)β for some β∈(21,1) (and β∈(21,32) for d=1), where β is a function of the degree of singularity of the covariance at zero). The techniques in his work do not allow for an extension to a higher dimensional setting with a white noise potential.
In [7, Lemmas 2.3 and 4.1] the almost sure convergence of the principal eigenvalue is stated.
The asymptotics of the principal eigenvalue is of particular interest for the asymptotics of the total mass of the solution to the parabolic Anderson model: ∂tu=Δu+ξu=Hu.
Chen [7] shows that with U(t) the total mass of u(t,⋅), one has logU(t)≈tλ(Lt) for some almost linear Lt, so that the asymptotics of λ(L) leads to asymptotics of logU(t): In d=1 with ξ white noise, logU(t)≈t(logt)32; for d≥1 with ξ a fractional white noise logU(t)≈t(logt)β, with β as above.
For smooth Gaussian fields ξ, Carmona and Molchanov [5] show logU(t)∼t(logt)21.
In a future work by König, Perkowski and van Zuijlen, the following asymptotics of the total mass of the solution to the parabolic Anderson model with white noise potential in two dimensions will be shown: logU(t)≈tlogt.
For a general overview about the parabolic Anderson model and the Anderson Hamiltonian we refer to the book by König [20].
Let us mention that our main result is already applied in [27] to prove that the super Brownian motion in static random environment is almost surely super-exponentially persistent.
Remark 1.1**.**
About defining the operator using Dirichlet forms.
[29, Theorem VIII.15] states that every closed semi-bounded quadratic form is the form of a unique self-adjoint operator
Considering one dimension, white noise is of regularity a little less than −21 in the sense that ξ∈B∞,∞−21−ε for all ε>0.
For u,v∈H01 one has uv∈B1,11 (by Cauchy-Schwarz). Therefore the pairing with ξ is (almost surely) well-defined and continuous by [2, Theorem 2.76] and so q(u,v):=⟨∇u,∇v⟩+⟨ξ,uv⟩ defines a semi-bounded quadratic form on H01.
Note that q(u,u) is equivalent to ∥u∥H012 by Poincaré’s inequality, so that q is also closed and hence is the form of a unique self-adjoint operator.
In two dimensions, this does not work as the product uv is still in B1,11 but ξ does not have values in B∞,∞−1 (the dual of B1,11) but in B∞,∞−1−ε for all ε>0.
Theorem 1.2**.**
[5, Theorem 5.1]**
Let V be a mean zero stationary Gaussian field on Rd with covariance function γ, i.e., V(x) is a mean zero Gaussian random variable and E[V(x)V(0)]=γ(x).
With u the solution to the parabolic Anderson model,
∂tu=Δu+Vu, for all x∈Rd
[TABLE]
Remark 1.3**.**
This then leads to the asymptotics of the total mass, as mentioned in the introduction.
In their paper they need not mention the asymptotics of the principal eigenvalue, as their approach does not use the eigenvalue expansion.
However, by using the heuristics mentioned above that logU(t)≈tλ(Lt), one expects λ(L)≈(logL)21.
This implies that one cannot interchange limits in L and ε for λ(QL,ξε), where ξε denotes a mollification of ξ.
Theorem 1.4** ( McKean [Mc94]).**
[TABLE]
Theorem 1.5**.**
[7, Lemmas 2.3 and 4.1]**
Let V be a mean zero stationary generalised Gaussian field on Rd with covariance function γ:Rd∖{0} with γ(x)∼c∣x∣−α as x→0 for some α∈(0,2∧d).
This means that for all φ,ψ∈S(Rd),
⟨V,φ⟩ is a mean zero Gaussian random variable and
[TABLE]
Then (logL)−4−α2λ((−L,L)d,V) converges almost surely to a deterministic scalar, which can be described in terms of d, α and γ.
In case V is white noise in dimension 1 (formally, γ=δ0), then
(logL)−32λ((−L,L),V) converges almost surely to a deterministic scalar.
1.2 Outline
In Section 2 we state the main results of this paper.
In Section 3 we give a proof of the tail bounds of the eigenvalues using the other ingredients presented in Section 2, and use this to prove the main theorem.
The definitions of our Dirichlet and Neumann (Besov) spaces and para- and resonance products between those spaces are given in Section 4.
With the definitions given we can properly define the Anderson Hamiltonian on its Dirichlet domain and state the spectral properties in Section 5.
In Section 6 we prove the convergence to enhanced white noise, that will be used to extend properties for smooth potentials to analogue properties where enhanced white noise is taken.
In Section 7 we prove scaling and translation properties.
In Section 8 we compare eigenvalues on boxes of different size.
In Section 9 we prove the large deviation principle of the enhanced white noise.
This leads to the large deviation principle for the eigenvalues.
In Section 10 we study infima over the large deviation rate function, which are used to express the limit of the eigenvalues.
The more cumbersome calculations needed to prove convergence to enhanced white noise are postponed to Section 11 and Section 12.
Acknowledgements.
The authors are grateful to G. Cannizzaro, P. Gaudreau Lamarre, C. Labbé, W. König, A. Martini, T. Orenshtein, N. Perkowski, A.C.M. van Rooij, T. Rosati and R.S. dos Santos for discussions and valuable feedback.
KC contributed to this paper when he was employed at the Technische Universität Berlin and was supported by the European Research Council through Consolidator
Grant 683164.
WvZ is supported by the German Science Foundation (DFG) via the Forschergruppe FOR2402 “Rough paths, stochastic partial differential equations and related topics”.
1.3 Notation
N={1,2,…}, N0={0}∪N, N−1={−1}∪N0.
δk,l is the Kronecker delta, i.e., δk,k=1 and δk,l=0 for k=l. i=−1.
For f,g∈L2(D), for some domain D⊂Rd we write ⟨f,g⟩L2(D)=∫Dfg.
We write TLd for the d-dimensional torus of length L>0, i.e., Rd/LZd. (Ω,P) will be our underlying complete probability space. In order to avoid cumbersome administration of constants, for families (ai)i∈I and (bi)i∈I in R, we also write ai≲bi to denote that there exists a C>0 such that ai≤Cbi for all i∈I and ai≂bi to denote that both ai≲bi and ai≳bi (i.e., bi≲ai).
We write Cc∞(A) for those functions in C∞(A) that have compact support in A∘.
2 Main results
In this section we give the main results of this paper without the technical details and definitions; the main theorem is Theorem 2.8.
We build on the methods on the construction of the Anderson Hamiltonian in [1].
In that paper the operator is considered on the torus or differently said, on a box with periodic boundary conditions.
In order to consider Dirichlet boundary conditions we will consider the domain to be a subset of H01.
The construction in [1] relies on Bony estimates for para- and resonance products.
We therefore have to find the right space in which we take ξ in order to be able to take para- and resonance products of ξ with elements in the domain.
For this reason we construct the framework of Dirichlet, Bp,qd,α, and Neumann Besov spaces, Bp,qn,α in Section 4.
We will show that H0γ agrees with B2,2d,γ and show that the Bony estimates extend to products between elements of Dirichlet and Neumann spaces.
Basically the idea is as follows, for d=1 and L=1.
Instead of the basis for the periodic Besov space L2, given by x↦e2πikx we build the Dirichlet Besov space by the basis of L2 given by x↦sin(πkx) and the Neumann Besov space by x↦cos(πkx).
The elements of the Dirichlet/Neumann Besov space on [0,L] then extend oddly/evenly to elements of the periodic Besov space on T2L.
We show that the extension of a product is the same as the product of the respective extensions, which allows us to obtain the Bony estimates from the periodic spaces. Moreover, this also allows us to extend the main theorem in [1] to Dirichlet boundary conditions on QL=[0,L]2, as we present in the following theorem.
We will consider ξ in Cnα and its enhancement in Xnα, which are the Neumann analogues of Cα and Xα.
Let α∈(−34,−1).
Let y∈R2,L>0 and Γ=y+QL.
For an enhanced Neumann distribution ξ=(ξ,Ξ)∈Xnα(Γ) we construct a stongly paracontrolled Dirichlet domain Dξd(Γ), such that the Anderson Hamiltonian on Dξd(Γ) maps in L2(Γ) and is self-adjoint as an operator on L2(Γ) with a countable spectrum given by eigenvalues λ(Γ,ξ)=λ1(Γ,ξ)>λ2(Γ,ξ)≥⋯ (counting multiplicities).
For all n∈N the map ξ↦λn(Γ,ξ) is locally Lipschitz.
Moreover, a Courant-Fischer formula is given for λn (see (45)).
In Section 6 we show that there exists a canonical enhanced white noise in Xnα:
Let α∈(−34,−1).
For all y∈R2 and L>0 there exists a canonical ξLy=(ξLy,ΞLy)∈Xnα(y+QL) such that ξLy is a white noise (in the sense that is described in that theorem).
We will write ξL=ξL0,ξL=ξL0,ΞL=ΞL0 and for β>0
[TABLE]
Now we have the framework set and can get to the key ingredients, of which two are given in Section 7, the scaling and translation properties:
2.3**.**
(a)
(Lemma 7.3) For
L,β,ε>0,
λn(QL,β)=dε21λn(QεL,εβ)+2π1logε.
2. (b)
(Lemma 7.4)
For y∈R2 and L,β>0,
λn(QL,β)=dλn(y+QL,β). Moreover, if y+QL∘∩QL∘=∅, then λn(QL,β) and λn(y+QL,β) are independent.
In [15, Proposition 1]
and
[3, Lemma 4.6]
the principal eigenvalue on a large box is bounded by maxima of principal eigenvalues on smaller boxes.
We extend these results from smooth potentials to enhanced potentials:
Theorem 2.4** (Consequence of Theorem 8.7111In this statement we have choosen a=21r.).**
There exists a K>0 such that for all ε>0 and L>r≥1, the following inequalities hold almost surely
[TABLE]
Moreover, for n∈N and L>r≥1;
if x,y∈R2 and x+Qr⊂y+QL, then λn(x+Qr,ε)≤λn(y+QL,ε);
if y,y1,…,yn∈R2 are such that (yi+Qr)i=1n are pairwise disjoint subsets of y+QL, then almost surely
λn(y+QL,ε)≥mini∈{1,…,n}λ(yi+Qr,ε).
Note that rk+[0,r]d is indeed a subset of [0,L]d for k∈N0d if (and only if) ∣k∣∞<rL−1.
Another important tool that we prove is the large deviations of the eigenvalues, which –by the contraction principle and continuity of the eigenvalues in terms of its enhanced distribution– is a consequence of the large deviations of (εξL,εΞL), proven in Section 9.
λn(QL,ε)=λn(QL,(εξL,εΞL))* satisfies the large deviation principle with rate ε and rate function IL,n:R→[0,∞] given by*
[TABLE]
In Section 10 we study infima over the large deviation rate function over half-lines, in terms of which the almost sure limit of the eigenvalues will be described:
Theorem 2.6**.**
There exists a C>0 such that for all n∈N,
ϱn=infL>0infIL,n[1,∞)=limL→∞infIL,n[1,∞)>C and
[TABLE]
Moreover,
[TABLE]
where
χ is the smallest C>0 such that ∥f∥L44≤C∥∇f∥L22∥f∥L22 for all f∈H1(R2) (this is Ladyzhenskaya’s inequality).
Using the scaling and translation properties of 2.3, the comparison of the eigenvalue with maxima of eigenvalues of smaller boxes in Theorem 2.4 and the large deviations in Theorem 2.5 we obtain the following tail bounds in Section 3.
Theorem 2.7**.**
Let K>0 be as in Theorem 8.7.
Let r,β>0.
We will abbreviate Ir,1 by Ir.
For all μ>infIr(1,∞)
and κ<infI23r[1−r216K)
there exists an M>0 such that for all L,x>0 with Lx>M
[TABLE]
Using the tail bounds and the limit in Theorem 2.6 we obtain our main result by a Borel-Cantelli argument and the ‘moreover’ part of Theorem 2.4. For the details see Section 3.
Theorem 2.8**.**
Let I⊂(1,∞) be an unbounded countable set, and let β>0.
For L∈I let yL∈R2 be such that yr+Qr⊂yL+QL for r,L∈I with L>r. Then for n∈N
In this section we prove Theorem 2.7 and Theorem 2.8 by using 2.1–2.6.
3.1**.**
Let K>0 be as in Theorem 2.4.
To simplify notation we take β=1.
By consecutively applying
the scaling in 2.3(a),
the bounds in Theorem 2.4 and
then the independence and translation properties in 2.3(b),
we get for
L,r,ε>0 with εL>r≥1
[TABLE]
and similarly
[TABLE]
As #{k∈N02:∣k∣∞≤n}=(n+1)2 for n∈N, we have
[TABLE]
Observe that there exists an M>0 such that for all L,r,ε>0 with εrL>M
[TABLE]
By combining the above observations we have obtained the following.
Lemma 3.2**.**
Let K>0 be as in Theorem 8.7. Let β>0.
There exists an M>1 such that for all L,r,ε>0
with εL>Mr>r≥1
[TABLE]
3.3**.**
Let r>0.
Let us now use the large deviation principle in Corollary 9.3.
First, observe that as limε↓02πε2logε=0, also λ(Qr,εβ)+2πε2logε satisfies the large deviation principle with the rate function β−2Ir,n (by exponential equivalence, see [10, Theorem 4.2.13]).
Hence for all μ>infIr,n(1,∞) and κ<infI23r,n[1−r24K,∞) there exists a ε0 such that for ε∈(0,ε0) we have the following bound on the probability appearing in (5) (using that 1−x≤e−x for x≥0):
This now follows by Lemma 3.2 and the bounds (7) and (8).
We obtain
[TABLE]
∎
First we prove the convergence of the eigenvalues along the set {2m:m∈N}, before proving Theorem 2.8.
Observe that in Theorem 3.4, contrary to Theorem 2.8, we do not impose a condition on the sequence (ym)m∈N.
Theorem 3.4**.**
Let n∈N and β>0.
For any sequence (ym)m∈N in R2.
[TABLE]
*color=green!50]not necessary to repeat the var formula here, possibly suggest by proofs AOP to take out
*
Proof.
Without loss of generality we may assume ym=0 for all m∈N and take β=1.
∙ First we prove the convergence of the principal eigenvalue, i.e., we consider n=1.
Let p,q∈R be such that p<ϱ12<q. We show that
[TABLE]
By the lemma of Borel-Cantelli it is sufficient to show that
Let μ>infIr(1,∞) be such that pμ<2 and
κ<infI23r[1−r216K,∞) be such that qκ>2.
By Theorem 2.7 for M∈N large enough color=green!50]the two 8’s should be 2’s
[TABLE]
which is finite because 8r2p2(2−pμ)m>1 for large m, as 2−pμ>0. Also
[TABLE]
which is finite as 2−κq<0 (and because 2−αmm→0 for α>0).
∙ Let n∈N.
Let us first observe that as λn(Q2m)≤λ(Q2m), we have limsupm→∞log2mλn(Q2m)≤ϱ12.
Let x1,…,xn∈Q2n be such that (xi+Q1)i=1n are disjoint. By
Theorem 2.4 we obtain almost surely
The condition on yL is assumed in order to have the monotonicity of L↦λn(yL) on I.
Therefore and for convenience, we assume yL=0 for all L∈I.
Also we take β=1.
Write s=ϱ12.
Let ε∈(0,s).
By Theorem 3.4 there exists an M such that for all m≥M
[TABLE]
Let a∈[1,2], then almost surely, as L↦λn(QL) is an increasing function
[TABLE]
and
[TABLE]
From this it follows that almost surely
limL∈I,L→∞log(L)λn(QL)=s. ∎
4 Dirichlet and Neumann Besov spaces, para- and resonance products
Let d∈N.
Let L>0.
We will first introduce Dirichlet and Neumann spaces on QL=[0,L]d.
In order to do this we use 3 different bases of L2([0,L]d), one standard (the ek’s), one as an underlying basis for Dirichlet spaces (the dk’s) and one as an underlying basis for Neumann spaces (the nk’s).
After defining these spaces (in Definition 4.9) we prove a few results that compare Besov and Sobolev spaces.
Later, in Definition 4.20 we show how to generalize this to spaces on general boxes of the form ∏i=1d[ai,bi].
Then we present bounds on Fourier multipliers (Theorem 4.21) and define para- and resonance products (Definition 4.25) and state their Bony estimates (Theorem 4.27).
In the following we will introduce some notation.
For q∈{−1,1}d and x∈Rd we use the following short hand notation (q∘x is known as the Hadamard product)
[TABLE]
We call a function f:[−L,L]d→Codd if f(x)=(∏q)f(q∘x) for all q∈{−1,1}d, and similarly we call feven if f(x)=f(q∘x) for all q∈{−1,1}d.
For any f:[0,L]d→C
we write f~:[−L,L]d→C for its odd extension
(the ∼ notation is taken as it looks like the graph of an odd function)
and f:[−L,L]d→C for its even extension (similarly, the notation – is taken as it looks like the graph of an even function), i.e., for the functions that satisfy
[TABLE]
If a function f:[−L,L]d→C is periodic,
which means that f(y,L)=f(y,−L) and f(L,y)=f(−L,y) for all y∈[−L,L],
then it can be extended periodically on Rd (with period 2L) we will also consider it to be a function on the domain T2Ld.
Note that if f is periodic and odd, then f=0 on ∂[0,L]d.
Indeed, as f is odd we have f(x1,x2)=−f(−x1,x2) from which it follows that f(x1,x2)=0 in case x1=0.
As f is periodic, we have f(L,x2)=f(−L,x2) so that combined with the above rule we see that f(x1,x2)=0 also in case x1=−L or x1=L.
For k=(k1,…,kd)∈N0d let νk=2−21#{i:ki=0} and write dk,L and nk,L or simply dk and nk for the functions [0,L]d→C and
ek,2L or simply ek for the function [−L,L]d→C given by
[TABLE]
Note that d~k(x) equals the right-hand side of (11) and nk(x) equals the right-hand side of (12) for x∈[−L,L]d,
so that d~k and nk are elements of C∞(T2Ld).
We can also write d~k and nk as follows
[TABLE]
[TABLE]
For an integrable function f:T2Ld→C its k-th Fourier coefficient is defined by
[TABLE]
4.1**.**
It is not difficult to see that for φ,ψ∈L2([0,L]d), the following equalities hold:
[TABLE]
4.2**.**
By partial integration one obtains that
F(∂αf)(k)=(Lπik)αF(f)(k). So that
F(Δf)(k)=−∣Lπk∣2F(f)(k). Consequently
⟨Δf,dk⟩=−∣Lπk∣2⟨f,dk⟩ and
⟨Δf,nk⟩=−∣Lπk∣2⟨f,nk⟩.
This will be used later to define (a−Δ)−1 for a∈R∖{0}.
Indeed, by partial integration one has
[TABLE]
Moreover, from this one obtains that the spectrum of −Δ is given by {L2π2∣k∣2:k∈Zd} and that every ek is an eigenvector.
Lemma 4.3**.**
{dk:k∈Nd}* and {nk:k∈N0d} form orthonormal bases for L2([0,L]d).*
Proof.
We leave it to the reader to check that those sets are orthonormal.
Let φ∈L2([0,L]d).
By expressing φ~ and φ in terms of the basis {ek:k∈Zd} and using 4.1 one obtains φ~=∑k∈Nd⟨φ,dk⟩L2[0,L]2d~k and φ=∑k∈N0d⟨φ,nk⟩L2[0,L]2nk.
∎
Indeed
[TABLE]
For the orthonormality, for k,l∈Nd
[TABLE]
For k,l∈N0d
[TABLE]
Definition 4.4**.**
We define the set of test functions on [0,L]d that oddly and evenly extend to smooth functions on T2Ld (here S(T2Ld)=C∞(T2Ld)):
[TABLE]
We equip S0([0,L]d), Sn([0,L]d) and S(T2Ld) with the Schwarz–seminorms.
The Schwarz-seminorms ∥⋅∥k,S for k∈N0 are defined by
[TABLE]
Note that222For the notation see Section 1.3. Cc∞([0,L]d) is a subset of both S0([0,L]d) and Sn([0,L]d).
In the following theorem we state how one can represent elements of S, S0 and Sn and of S′, S0′ and Sn′ in terms of series in terms of ek, dk and nk.
Theorem 4.5**.**
(a)
Every ω∈S(T2Ld), φ∈S0([0,L]d) and ψ∈Sn([0,L]d) can be represented by
[TABLE]
where (ak)k∈Zd, (bk)k∈Nd and (ck)k∈N0d in C are such that
[TABLE]
and ak=⟨ω,ek⟩, bk=⟨φ,dk⟩ and ck=⟨ψ,nk⟩.
Conversely, if (ak)k∈Zd, (bk)k∈Nd and (ck)k∈N0d satisfy (24) then ∑k∈Zdakek,
∑k∈Ndbkdk and ∑k∈N0dcknk converge in S(T2Ld), S0([0,L]d) and Sn([0,L]d), respectively.
2. (b)
Every w∈S′(T2Ld), u∈S0′([0,L]d) and v∈Sn′([0,L]d) can be represented by
[TABLE]
where (ak)k∈Zd, (bk)k∈Nd and (ck)k∈N0d in C are such that
[TABLE]
and ak=⟨w,ek⟩, bk=⟨u,dk⟩ and ck=⟨v,nk⟩.
Conversely, if (ak)k∈Zd, (bk)k∈Nd and (ck)k∈N0d satisfy (26) then ∑k∈Zdakek, ∑k∈Ndbkdk and ∑k∈N0dcknk converge in S′(T2Ld), S0′([0,L]d) and Sn′([0,L]d), respectively.
Proof.
Let ω∈S(T2Ld).
As one has the relation F(Δnω)(k)=(−L2π2∣k∣2)nF(ω)(k) for all n∈N0,
we have (24) and
∑k∈Zd:∣k∣≤NF(ω)(k)ekN→∞ω in S(T2Ld), see also
[33, Corollary 2.2.4].
Let φ∈S0([0,L]d).
Using the shown convergence above for ω=φ~, by
(14), (16), (17) and (20)
[TABLE]
Hence
∑k∈Nd:∣k∣≤N⟨φ,dk⟩dk converges to φ in S0([0,L]d).
Let ψ∈Sn([0,L]d).
Using the shown convergence above for ψ, by (15), (18) and (21)
[TABLE]
Hence
∑k∈Nd:∣k∣≤N⟨ψ,nk⟩nk converges to ψ in Sn([0,L]d).
Let w∈S′(T2Ld).
Then there exists an n∈N and a C>0 such that ∣w(φ)∣≤C∥φ∥m=C∑α:∣α∣≤n∥Dαφ∥∞.
As Dαek=(−Lπi)αkαek, (26) follows.
∎
For φ∈S0([0,L]d), note that φ~=∑k∈Nd⟨φ,dk⟩d~k.
Moreover, note that ω∈S(T2Ld) is odd if and only if ⟨ω,eq∘k⟩=(∏q)⟨ω,ek⟩ for all k∈Zd and q∈{−1,1}d. This motivates the following definition.
Definition 4.6**.**
For u∈S0′([0,L]d) we write u~ for the distribution in S′(T2Ld) given by u~=∑k∈Nd⟨u,dk⟩d~k.
For v∈Sn′([0,L]d) we write v for the distribution in S′(T2Ld) given by v=∑k∈N0d⟨u,nk⟩nk.
A w∈S′(T2Ld) is called odd if ⟨w,eq∘k⟩=(∏q)⟨w,ek⟩ for all k∈Zd and q∈{−1,1}d. If instead ⟨w,eq∘k⟩=⟨w,ek⟩ for all k∈Zd and q∈{−1,1}d, then w is called even.
Note that u~ is odd and v is even.
By (19) and Theorem 4.5, for u∈S0′([0,L]d), φ∈S0([0,L]d) and v∈Sn′([0,L]d), ψ∈Sn([0,L]d)
[TABLE]
Theorem 4.7**.**
(a)
We have
[TABLE]
and S~0(T2Ld) and Sn(T2Ld) are closed in S(T2L).
2. (b)
S(T2Ld), S0([0,L]d) and Sn([0,L]d) are complete.
3. (c)
We have
[TABLE]
and S~0′(T2Ld) and Sn′(T2Ld) are closed in S′(T2Ld).
4. (d)
S′(T2Ld),
S0′([0,L]d) and Sn′([0,L]d)
are (weak∗) sequentially complete.
Proof.
(a)
follows as convergence in S implies pointwise convergence and therefore the limit of odd and even functions is again odd and even, respectively.
(b) follows from (a) as S(T2Ld) is complete (see [12, Page 134]).
(c)
If a net (wι)ι∈I in S~0′ converges in S′ to some w, then ⟨wι,ek⟩→⟨w,ek⟩ for all k, so that w is odd.
(d) follows from (c) as S′(T2Ld) is weak∗ sequentially complete (see [12, Page 137]).
∎
As we index the basis ek, dk and nk by elements k in Zd and not in L1Zd, in the next definition of a Fourier multiplier we have an additional L1 factor in the argument of the functions τ and σ.
Definition 4.8**.**
Let τ:Rd→R, σ:[0,∞)d→R,
w∈S′(T2Ld), u∈S0′([0,L]d) and v∈Sn′([0,L]d). We define (at least formally) the so-called Fourier multipliers by
[TABLE]
Let (ρj)j∈N−1 form a dyadic partition of unity, i.e., ρ−1 and ρ0 are C∞ radial functions on Rd, where ρ−1 is supported in a ball and ρ0 is supported in an annulus, ρj=ρ(2−j⋅) for j∈N0, and
[TABLE]
Let w∈S′(T2Ld), u∈S0′([0,L]d) and v∈Sn′([0,L]d).
We define the Littlewood-Paley blocks Δjw, Δju and Δjv for j∈N−1 by
Δjw=ρj(D)w, Δju=ρj(D)u, Δjv=ρj(D)v, i.e.,
[TABLE]
Let σ:Rd→R be the even extension of σ, i.e., σ(q∘x)=σ(x) for all x∈[0,∞)d and q∈{−1,1}d.
As σ(D)dk=σ(Lk)dk and σ(D)d~k=σ(Lk)d~k, by Theorem 4.5 we obtain that for all u∈S0′([0,L]d) and v∈Sn′([0,L]d),
[TABLE]
Moreover, with ad,p=2−pd for p<∞ and ad,∞=1 we have for all p∈[1,∞]
[TABLE]
Therefore, by applying the above to σ=ρj, with ∥⋅∥Bp,qα the standard Besov norm,
[TABLE]
This motivates the following definition.
Definition 4.9**.**
Let α∈R, p,q∈[1,∞].
We define the
Dirichlet Besov spaceBp,qd,α([0,L]d) to be the space of
u∈S0′([0,L]d) for which ∥u∥Bp,qd,α:=ad,p∥u~∥Bp,qα<∞.
Similarly, we define the
Neumann Besov spaceBp,qn,α([0,L]d) as the space of
v∈Sn′([0,L]d) for which ∥v∥Bp,qn,α:=ad,p∥v∥Bp,qα<∞.
We will abbreviate Cnα=B∞,∞n,α, Hnα=B2,2n,α.
In Theorem 4.15 we show H0α=B2,2d,α.
4.10**.**
Let us see if the definition is such that we get “what we want”.
First of all let us note that the Littlewood-Paley block Δiu needs to be defined as ρi(D)u which has the factor L1 in front of the Fourier coefficient k, so that we have equivalence with the Hα spaces for p=q=2.
This so that the regularity of distributions does not change when considering a bigger space.
Let us demonstrate this for δ0 in Sn′([0,L]d).
We have
[TABLE]
As ∥n0∥L∞ is bounded by L−2d and equal to it at [math] we have
[TABLE]
The latter sum is about equal to 2idLd so that δ0∈B∞,∞−d([0,L]d) and has the about the same norm for all L (at least for L=λ2m with λ>0 and m∈N0 the norms are the same).
Now let us see what happens for α=0 and constant functions.
We have
[TABLE]
and thus
[TABLE]
Hence ∥Δ−1\mathbbm1∥L∞=1 and thus ∥\mathbbm1∥B∞,∞n,0([0,L]d)=1=∥\mathbbm1∥L∞.
On the other hand ∥Δ−1\mathbbm1∥Lp=Lp1 and thus ∥\mathbbm1∥B2,2n,0([0,L]d)=Lp1=∥\mathbbm1∥L2.
As Bp,qα(T2Ld) is a Banach space,
∥⋅∥Bp,qd,α is a norm on
Bp,qd,α([0,L]d) under which it is a Banach space.
Similarly, ∥⋅∥Bp,qn,α is a norm on
Bp,qn,α([0,L]d) under which it is a Banach space.
Theorem 4.11**.**
Cc∞([0,L]d)*
is dense in Bp,qd,α([0,L]d) for all α∈R, p,q∈[1,∞).*
Proof.
The proof follows the same strategy as the proof of [2, Proposition 2.74].
∎
Theorem 4.12**.**
For α>0,
Hα(Rd)=B2,2α(Rd)=Λ2,2α(Rd) and their norms are equivalent (for the definitions see [34, p. 36]).
Proof.
For Hα(Rd)=F2,2α(Rd) see [34, p.88], for F2,2α(Rd)=B2,2α(Rd) see [34, p.47] and for B2,2α(Rd)=Λ2,2α(Rd)
see [34, p.90].
∎
Lemma 4.13**.**
For α∈R the spaces B2,2α(T2Ld) and Hα(T2Ld) (see [31, p. 168]) are equal with equivalent norms.
Here Hα(T2Ld) is the space of distributions in S′(T2Ld) for which ∥u∥Hα<∞, where
[TABLE]
Proof.
Observe that by the properties of the dyadic partition:
for all α∈R there exist cα,Cα>0 such that
[TABLE]
Therefore the equivalence of the norms follows by Plancherel’s formula.
∎
The following is a consequence of the fact that the norms of Hα(T2Ld) (see [31, p. 168]) and B2,2α(T2Ld) are equivalent.
Theorem 4.14**.**
For all α∈R we have
for u∈Sn′([0,L]d) and v∈S0′([0,L]d)
[TABLE]
Theorem 4.15**.**
For α>0
the spaces B2,2d,α([0,L]d) and H0α([0,L]d) are equal with equivalent norms, where H0α([0,L]d) is the closure of Cc∞([0,L]d) in Hα(Rd).
Proof.
As Cc∞([0,L]d) is dense in B2,2d,α([0,L]d) (Theorem 4.11) it is sufficient to prove the equivalence of the norms on Cc∞([0,L]d).
Let f∈Cc∞([0,L]d).
By definition of the Λ2,2α norm, ∥f∥Λ2,2α(TLd)=∥f∥Λ2,2α(Rd).
As Dβf~=Dβf we have
∥f~∥Λ2,2α(T2Ld)=22d∥f∥Λ2,2α(TLd).
Because ∥f~∥B2,2α(T2Ld)=22d∥f∥B2,2d,α([0,L]d) (by definition), the proof follows by Theorem 4.12.
Explaining the “sufficient” now.
Let f∈B2,2d,α([0,L]d) and gn∈Cc∞([0,L]d) be such that gn→f in B2,2d,α. Then by the proved equivalences (gn)n is Cauchy in H0α, hence is converging to f. This extends the equivalence of norms on Cc∞([0,L]d) to the whole space.
∎
Theorem 4.16**.**
Let p,q∈[1,∞] and β,γ∈R, γ<β.
Then Bp,qβ(T2Ld) is compactly embedded in Bp,qγ(T2Ld), i.e., every bounded set in Bp,qβ(T2Ld) is compact in Bp,qγ(T2Ld).
The analogous statement holds for Bp,qd,β([0,L]d) and Bp,qn,β([0,L]d) spaces.
In particular, the injection j:H0β([0,L]d)→H0γ([0,L]d) is a compact operator.
Proof.
We consider the underlying space to be T2Ld, i.e., periodic boundary conditions; the other cases follow by Theorem 4.7.
Suppose that un∈Bp,qβ and ∥un∥Bp,qβ≤1 for all n∈N. We prove that there is a subsequence of (un)n∈N that converges in Bp,qγ.
By [2, Theorem 2.72] there exists a subsequence of (un)n∈N, which we assume to be the sequence itself, such that un→u in S′ and ∥u∥Bp,qβ≤1. As ⟨un,ek⟩→⟨u,ek⟩ for all k∈Zd, we have ∥Δj(un−u)∥Lp→0 for all j∈N−1.
Let ε>0.
Choose J∈N large enough such that 2(γ−β)J<ε, so that for all n∈N
[TABLE]
Then, by choosing N∈N large enough such that ∥(2γj∥Δj(un−u)∥Lp)j=−1J∥ℓq<ε for all n≥N, one has with the above bound that ∥un−u∥Bp,qγ<3ε for all n≥N.
∎
4.17**.**
Observe that by Lemma 4.3H00([0,L]d)=Hn0([0,L]d)=L2([0,L]d) and ∥⋅∥H00≂∥⋅∥Hn0≂∥⋅∥L2.
4.18**.**
By 4.2 we have (a−Δ)−1f=σ(D)f for σ(x)=(a+π2∣x∣2)−1.
4.19**.**
For any function φ and λ∈R we write lλφ for the function x↦φ(λx).
For a distribution u we write lλu for the distribution given by ⟨lλu,φ⟩=λ−d⟨u,lλ1φ⟩.
As lλek,2L=λ−2dek,λ2L,
and
⟨lλu,ek,λ2L⟩=λ−2d⟨u,ek,2L⟩,
we have for u∈S′(T2Ld)
[TABLE]
Similarly, (33) holds for
u∈S0′([0,L]d) and u∈Sn′([0,L]d) (use e.g. 4.1).
If φ∈S([0,L]d), then lλφ∈S([0,λL]d).
If u∈S′([0,L]d), then lλu∈S′([0,λL]d).
[TABLE]
Definition 4.20**.**
Let y∈Rd, s∈(0,∞)d and
Γ=y+∏i=1d[0,si]. Let l:∏i=1d[0,si]→[0,1]d be given by l(x)=(s1x1,…,sdxd).
For a function φ we define new functions lφ and Tyφ by lφ(x)=φ∘l(x) and Tyφ(x)=φ(x−y) and for a distribution u we define the distributions lu and Tyu by ⟨lu,φ⟩=∣detl∣−1⟨u,l−1φ⟩ and ⟨Tyu,φ⟩=⟨u,Ty−1φ⟩.
We define
[TABLE]
Note that the definition of σ(D)u is consistent with (28) by 4.19.
Indeed, for u∈S0′([0,L]d) we have lLu∈S0′([0,1]d), ∣detlL∣=Ld and
[TABLE]
This is not equal to L−pd∥Δif∥Lp([0,L]d) because of the factor L in ρi. But this does not matter for the equivalence with the Hα spaces as we see later.
Similarly, we define Sn(Γ),Sn′(Γ),Bp,qn,α(Γ) and ∥⋅∥Bp,qn,α(Γ).
OLD (when Δi=ρi(LD)):
[TABLE]
where for p=∞ we make the convention that ∣detl∣−p1=1.
Observe that this agrees with our definition of the Bp,qd,α on [0,L]d for all L>0 (see also 4.19).
Indeed, for f∈Bp,qd,α([0,L]d) we have lLf∈Bp,qd,α([0,1]d), ∣detlL∣=Ld and
[TABLE]
Note that for s=(L,L,…,L) the corresponding l equals lL−1. So ∣detlL−1∣−p1=Lpd and indeed
[TABLE]
The following theorem gives a bound on Fourier multipliers, similar as in [2, Theorem 2.78]. However, considering the particular choice Hγ(T2Ld)=B2,2γ(T2Ld) allows us to reduce condition to control all derivatives of σ to a condition that only controls the growth of σ itself.
Theorem 4.21**.**
Let γ,m∈R and M>0. There exists a C>0 such that the following statements hold.
(a)
For all bounded σ:Rd→R such that
∣σ(x)∣≤M(1+∣x∣)−m for all x∈Rd,
[TABLE]
By (31), one may replace “H” and “S′(T2Ld)” by “H0” and “S0′([0,L]d)” or “Hn” and “Sn′([0,L]d)” in (35).
2. (b)
For all σ:Rd→R which are C∞ on Rd∖{0}, such that ∣∂ασ(x)∣≤M∣x∣−m−∣α∣ for all x∈Rd∖{0} and α∈N0d with ∣α∣≤2⌊1+2d⌋,
[TABLE]
By (31), one may replace “C” and “S′(T2Ld)” by “Cn” and “Cn′([0,L]d)” in (36).
Proof.
Let a>0 be such that ρ(k)=0 if ∣k∣<a.
Then for j≥0 one has ∣ρj(k)σ(k)∣≤M(1+La2j)−mρj(k)≤MLma−m2−jmρj(k) for all k∈Zd. As σ is bounded on the support of ρ−1, there exists a C>0 such that for all j∈N−1
Using the multivariate chain rule (Faà di Bruno’s formula) one can prove that σ(x)=(1+π2∣x∣2)−1 satisfies the conditions in Theorem 4.21 (those needed for (36)).
One other bound that we will refer to is a special case of [2, Proposition 2.71]:
Theorem 4.23**.**
For all α∈R there exists a C>0 such that
∥w∥Cnα≤C∥w∥Hnα+2d for all w∈Sn′([0,L]d).
Now
we consider (para- and resonance-) products between elements of S0′([0,L]d) and Sn′([0,L]d), and between elements of Sn′([0,L]d).
4.24**.**
Let w1,w2∈S′(T2Ld) be represented by w1=∑k∈Zdakek and w2=∑l∈Zdblel.
Then formally w1w2=∑m∈Zdcmem, with cm=∑k,l∈Zd,k+l=makbl.
Let us first observe the following.
•
If (ak)k∈Zd and (bk)k∈Zd satisfy (24), then so does (cm)m∈Zd.
Indeed, by assuming that a0=b0=0 and using that ∣kl∣≥2∣k+l∣ for k,l=0 we have for all large enough n∈N
[TABLE]
•
If (ak)k∈Zd and (bk)k∈Zd satisfy (26), then (cm)m∈Zd as above might not (take ak=bk=∣k∣n for some n∈N).
Of course this series is not always convergent (e.g. take ak=bk=∣k∣n for some n∈N and see (26)).
But if it does, then due to the identities
[TABLE]
the product obeys the following rules
[TABLE]
For example, if u∈S0′ and v∈Sn′ and uv exists in a proper sense, then uv∈S0′.
Definition 4.25**.**
For u∈S0′([0,L]d)∪Sn′([0,L]d) and v∈Sn′([0,L]d) we write (at least formally)
[TABLE]
4.26**.**
As dknm=d~knm and nknm=nknm, we have (at least formally)
[TABLE]
With this one can extend the Bony estimates on the (para-/resonance) products on the torus to Bony estimates between elements of Bp,qd,α([0,L]d) and Bp,qn,β([0,L]d) and between elements of Bp,qn,β([0,L]d). We list some Bony estimates in Theorem 4.27.
Theorem 4.27**.**
(Bony estimates)
(a)
For all α<0, γ∈R, there exists a C>0 such that for all L>0
[TABLE]
2. (b)
For all δ>0, γ≥−δ and β∈R there exists a C>0 such that for all L>0
[TABLE]
3. (c)
For all α,γ∈R with α+γ>0, there exists a C>0 such that for all L>0
[TABLE]
4. (d)
For all α,γ∈R with α+γ>0 and δ>0 there exists a C>0 such that for all L>0
[TABLE]
The above statements also hold by simultaneously replacing “H0” and “S0′” by “Hn” and “Sn′”.
Proof.
By 4.26 it is sufficient to consider the analogue statements with periodic boundary conditions, that is, considering the underlying space T2Ld.
For (a) and (b) see [28, Lemma 2.1] and [2, Proposition 2.82] where the underlying space is Rd rather than the torus.
For (c) see [2, Proposition 2.85].
(d) follows from the rest.
∎
The last observation we make is that one can also define Besov spaces with mixed boundary conditions, to which we refer in Definition 5.2.
4.28** (Besov spaces with mixed boundary conditions).**
Beside the Dirichlet and Neumann Besov spaces one can define Besov spaces with mixed boundary conditions as follows.
First observe that for k∈N0d, the function dk,L is the product of the one dimensional functions dki,L, in the sense that dk,L(x)=∏i=1ddki,L(xi). Similarly, nk,L(x)=∏i=1dnki,L(xi).
One could interpret this as taking Dirichlet (or Neumann) boundary conditions in every direction.
Instead one could for example for d=2 take the function fk,L(x)=dk1,L(x1)nk2,L(x2) and analogously to Definition 4.9 define a Besov space with mixed boundary conditions.
Moreover, analogous to Definition 4.25 one can define the para- and resonance products as in (40) and obtain the Bony estimates as in Theorem 4.27 for elements with “opposite boundary conditions”.
5 The operator Δ+ξ with Dirichlet boundary conditions
We define the Anderson Hamiltonian with Dirichlet boundary conditions and study its spectral properties that will be used in the rest of the paper.
In this section we assume d=2, y∈R2 and s∈(0,∞)2 and write
Γ=y+∏i=12[0,si].
Moreover, we let α∈(−34,−1) and ξ∈Cnα(Γ). We abbreviate Cnα(Γ) by Cnα, H0γ(Γ) by H0γ, etc.
We write σ:R2→(0,∞) for the function given by
[TABLE]
**Additional assumptions are given in 5.10.
**
Remember, see 4.18, that σ(D)=(1−Δ)−1.
Definition 5.1**.**
For β∈R, we define the
space of enhanced Neumann distributions, written Xnβ, to be the closure in Cnβ×Cn2β+2 of the set
[TABLE]
We equip Xnβ with the relative topology with respect to Cnβ×Cn2β+2.
We will now define the Dirichlet domain of the Anderson Hamiltonian analogously to [1] did on the torus.
Definition 5.2**.**
Let ξ=(ξ,Ξ)∈Xnα.
For γ∈(0,α+2) we define
Dξd,γ={f∈H0γ:f♯ξ∈H02γ}, where
f♯ξ:=f−f\varolessthanσ(D)ξ. Moreover, we define an inner product on Dξd,γ, written ⟨⋅,⋅⟩Dξd,γ, by
⟨f,g⟩Dξd,γ=⟨f,g⟩H0γ+⟨f♯ξ,g♯ξ⟩H02γ.
For γ∈(−2α,α+2)
we define the space of
strongly paracontrolled distributions by
Dξd,γ={f∈H0γ:f♭ξ∈H02}, where
f♭ξ:=f♯ξ−B(f,ξ) and
B(f,ξ)=σ(D)(fΞ+f\varogreaterthanξ−((Δ−1)f)\varolessthanσ(D)ξ−2∑i=1d∂xif\varolessthan∂xiσ(D)ξ)
(for the paraproducts under the sum, see 4.28).
We define an inner product on Dξd,γ, written ⟨⋅,⋅⟩Dξd,γ, by
⟨f,g⟩Dξd,γ=⟨f,g⟩H0γ+⟨f♭ξ,g♭ξ⟩H02. As in the periodic setting, one has Dξd,γ⊂H0α+2− for all γ∈(−2α,α+2). We write Dξd={f∈H0α+2−:f♭ξ∈H02}.
We will define the Anderson Hamiltonian on the Dirichlet domain in a similar sense as is done on the periodic domain, however we choose to change the sign in front of the Laplacian as this is more common in literature on the parabolic Anderson model.
Definition 5.3**.**
Let γ∈(−2α,α+2), ξ∈Xnα.
We define333The definition needs of course justification to show H0γ−2 is really the codomain, this is shown in Theorem 5.4. the operator Hξ:Dξd,γ→H0γ−2 by
[TABLE]
where f⋄ξ=f\varolessthanξ+f♯ξ\varodotξ+R(f,σ(D)ξ,ξ)+fΞ+f\varogreaterthanξ and
R(f,g,h):=(f\varolessthang)\varodoth−f(g\varodoth).
We state the main results about the spectrum of the Anderson Hamiltonian, on its Dirichlet domain. These results are analogous to the Anderson Hamiltonian on the torus [1] (one can just read the theorem below without the Dirichlet and Neumann notations, i.e., the sub- or superscripts “[math],d,n”, and with the spaces interpreted to be defined on a torus).
Moreover, they are similar to the results of [21], which proof is based on the theory of regularity structures.
Theorem 5.4**.**
For γ∈(−2α,α+2) there exists a C>0 such that
[TABLE]
Hξ(Dξd)⊂L2* and Hξ:Dξd→L2 is closed and self-adjoint as an operator on L2, and Dξd is dense in L2.
There exist
λ1(Γ,ξ)>λ2(Γ,ξ)≥λ3(Γ,ξ)≥⋯
such that limn→∞λn(Γ,ξ)=−∞, σ(Hξ)=σp(Hξ)={λn(Γ,ξ):n∈N} and
#{n∈N:λn(Γ,ξ)=λ}=dimker(λ−Hξ)<∞ for all λ∈σ(Hξ).
One has*
[TABLE]
There exists an M>0 such that for all n∈N and ξ,θ∈Xnα
[TABLE]
*With the notation ⊏ for “is a linear subspace of”,
*
Let us mention that in an analogous way one can state (and prove) the same statement for the operator with Neumann boundary conditions by replacing “d” by “n” and “H0” by “Hn”.
Remark 5.6**.**
In [1] it is pointed out that in (45) one may replace Dξd by Dξγ for γ∈(32,α+2), and
⟨Hξψ,ψ⟩L2 by H0−γ⟨Hξψ,ψ⟩H0γ, where H0−γ⟨⋅,⋅⟩H0γ:H0−γ×H0γ→R is the continuous bilinear map (see [2, Theorem 2.76]) given by
[TABLE]
This is done for the periodic setting, but the arguments can easily be adapted to our setting.
Indeed, first one shows that Dξd is dense in Dξd,γ:
S0 and thus L2 is dense in H0γ−2 (see [2, Theorem 2.74] and Theorem 4.15), therefore for a∈/σ(Hξ) and Ga=(a−Hξ)−1, Dξd=GaL2 is dense in Dξd,γ=GaH0γ−2.
This proves (e).
With this it is sufficient to use the continuity of the map
[TABLE]
which follows from the following bound
(observe that γ−2<−γ and use (43))
[TABLE]
5.7**.**
Let η∈L2 (which equals Hn0, see 4.17).
By Theorem 4.21σ(D)η∈Hn2, which is included in Cn1 by Theorem 4.23.
Then by Theorem 4.27, η\varodotσ(D)η∈Hn1.
Moreover, if ηε→η in L2, then ηε\varodotσ(D)ηε→η\varodotσ(D)η in Hn1 (by the same theorems). Hence, by Theorem 4.23 we obtain the following convergence in Xnα for all α≤−1
[TABLE]
Indeed
[TABLE]
We write λn(Γ,η)=λn(Γ,(η,η\varodotσ(D)η)).
By 5.7 and the continuity of ξ↦λn(Γ,ξ), see (44) in Theorem 5.4, we obtain the following lemma.
Lemma 5.8**.**
The map
L2(Γ)→R,η↦λn(Γ,η) is continuous.
5.9**.**
Let ζ∈Sn∞.
Then ζ:=(ζ,ζ\varodotσ(D)ζ)∈Xnβ,
f\varolessthanσ(D)ζ∈H0β for all β∈R and B(f,ζ)∈H02 and f∈H0γ with γ∈(0,1) (use Theorems 4.21, 4.22 and 4.27).
Clearly ζ\varodotσ(D)ζ∈Cn2β−2 for all β∈R as ζ∈Cnα for all α∈R.
We have
[TABLE]
Let us check each of the individual terms in B:
[TABLE]
f(ζ\varodotσ(D)ζ)∈H0γ−δ for all δ>0,
f\varogreaterthanζ∈H0β for all β∈R,
(Δ−1)f∈H0γ−2, σ(D)ζ∈Cnβ for all β∈R, therefore
((Δ−1)f)\varolessthanσ(D)ζ∈H0β for all β∈R and similarly ∂xif\varolessthan∂xiσ(D)ζ∈H0β for all β∈R (observe that ∂xif and ∂xiσ(D)ζ are in Besov spaces with mixed boundary conditions).
Therefore B(f,ζ)∈H02+γ−δ, and so if we choose δ small enough we obtain that B(f,ζ) is an element of H02.
Therefore, for all γ∈(0,1), Dζd,γ=H02γ and Dζd,γ=H02 and for f∈H0γ,
f\varodotζ=f♯ζ\varodotζ+R(f,σ(D)ζ,ζ)+f(ζ\varodotσ(D)ζ), so that
[TABLE]
Now suppose ζ∈L∞⊂Cn∞. Then ζ:=(ζ,ζ\varodotσ(D)ζ)∈Xn0, but the Bony estimates give f\varolessthanσ(D)ζ∈H02− (and not ∈H02).
Nevertheless, by the Kato-Rellich theorem [29, Theorem X.12]
on the domain H02 the operator Hζ defined as in (46) is self-adjoint.
As the injection map H02→L2 is compact (see Theorem 4.16), every resolvent is compact.
Hence by
the Riesz-Schauder theorem [29, Theorem VI.15]
and the Hilbert-Schmidt theorem [29, Theorem VI.16]
there exist λ1(Γ,ζ)≥λ2(Γ,ζ)≥⋯
such that σ(Hζ)=σp(Hζ)={λn(Γ,ζ):n∈N} and
#{n∈N:λn(Γ,ζ)=λ}=dimker(λ−Hζ)<∞ for all λ∈σ(Hζ).
Moreover, by Fischer’s principle
[23, Section 28, Theorem 4, p. 318]444In this reference the operator is actually assumed to be compact and symmetric, whereas we apply it to Hξ. But the compactness is only assumed to guarantee that the spectrum is countable and ordered, so that the arguments still hold.
and Lemma A.2
[TABLE]
The proof of Theorem 5.4 follows from the results of the Anderson Hamiltonian on the torus with the help of Lemma 5.12. The proof is written below Lemma 5.12. We may restrict ourselves to the case Γ=QL.
5.10**.**
For the rest of this section y=0 and bi=L for all i, i.e., Γ=QL=[0,L]2.
5.11**.**
For q∈{−1,1}d and w∈S′ we write lqw for the element in S′ given by ⟨lqw,φ⟩=⟨w,φ(q∘⋅)⟩ for φ∈S.
Then w is odd if and only if w=(∏q)lqw for all q∈{−1,1}d and w is even if and only if w=lqw for all q∈{−1,1}d.
Lemma 5.12**.**
Let ξ∈Xnα.
Let 32<γ<α+2.
Write ξ=(ξ,Ξ),
Dξγ=Dξγ(T2Ld),
Dξγ=Dξγ(T2Ld).
(a)
Dξd,γ={w∈Dξγ:w\mboxisodd}*,
Dξd,γ={w∈Dξγ:w\mboxisodd},
Hξf=Hξf~\mboxand∥f∥Dξd,γ≂∥f~∥Dξγ\mboxuniformlyforallf∈Dξd,γ and
∥f∥Dξd,γ≂∥f~∥Dξγ\mboxuniformlyforallf∈Dξd,γ.
*
2. (b)
Hξ(Dξd,γ)⊂H0γ−2, Hξ(Dξd,γ)⊂L2.
3. (c)
Hξ(lqf)=lqHξf* for all f∈Dξγ and q∈{−1,1}2.*
4. (d)
σ(Hξ)⊂σ(Hξ)* (for the operators either on the D or D domains) and for all a∈C∖σ(Hξ) the inverse of a−Hξ:Dξd→L2 is self-adjoint and compact.
*
5. (e)
Dξd* is dense in Dξd,γ and Dξd,γ is dense in L2.
(f)
[TABLE]
Proof.
(a) follows from the identities (41), f♯ξ=f~♯ξ,
B(f,ξ)=B(f~,ξ), f♭ξ=f~♭ξ and because ∥g~∥Hγ≂∥g∥H0γ for all γ∈R and g∈H0γ([0,L]d) (indeed, ∥g∥B2,2d,γ=∥g~∥B2,2γ by definition and ∥⋅∥H0γ≂∥⋅∥B2,2d,γ and ∥⋅∥B2,2γ≂∥⋅∥Hγ by Theorems 4.12 and 4.15).
(b) follows from (a) as Hξ(Dξγ)⊂Hγ−2 and Hξ(Dξ)⊂H0 (see [1]).
(c) follows by a straightforward calculation;
use that F(lqf)=lqF(f), lqρi=ρi, lqξ=ξ and lqΞ=Ξ for q∈{−1,1}2.
(d)
Let a∈C be such that a−Hξ has a bounded inverse Ra.
By (c)(a−Hξ)f is odd if and only if f is odd, indeed, if (a−Hξ)f is odd, then (a−Hξ)[f−(∏q)lqf]=0 (see 5.11) and thus f=(∏q)lqf .
Hence a−Hξ has a bounded inverse Rad such that Radh=Rah~.
From the fact that Ra is self-adjoint and compact it follows that Rad is too.
Because when A is closed/open, then A~ is closed/open.
S0 and thus L2 is dense in H0γ−2 (see [2, Theorem 2.74] and Theorem 4.15), therefore for a∈/σ(Hξ) and Ga=(a−Hξ)−1, Dξd=GaL2 is dense in Dξd,γ=GaH0γ−2.
That Dξd,γ is dense in L2 follows from the periodic counterpart, which is proven in [1, Lemma 4.12].
This proves (e).
As Dξd⊂Dξd,γ, we have that λnξ is ≥ to the right-hand side of (48).
As Dξd is dense in Dξd,γ, we obtain the equality (48) by the continuity of
[TABLE]
which follows from the following bound
(observe that γ−2<−γ and use (43))
By Lemma 5.12 it follows that Hξ is a closed densely defined symmetric operator and that σ(Hξ)⊂σ(Hξ) so that Hξ is indeed self-adjoint (see [9, Theorem X.2.9]).
As the resolvents are compact, the statements in Theorem 5.4 up to (44) follow by the
Riesz-Schauder theorem [29, Theorem VI.15]
and the Hilbert-Schmidt theorem [29, Theorem VI.16]
because of the following identity, where Rμ=(μ−Hξ)−1,
[TABLE]
this means that λ−Rμ is boundedly invertible (or injective) if and only if μ−λ1−Hξ is, and in turn follows from the identity
[TABLE]
As every eigenvalue of Hξ is an eigenvalue of Hξ which is locally lipschitz in the analogues sense of (44), also (44) holds by the equivalences of norms in Lemma 5.12(a).
(45) follows from
Lemma 5.12(f) and
Fischer’s principle [23, Section 28, Theorem 4, p. 318].
See also Theorem C.1.
That λ1>λ2, or in other words, that the first eigenvalue is simple, follows from [30, Theorem XIII.44].
The only condition to prove for that theorem is that the semigroup etHξ is positivity improving, or differently called the strong maximum principle for etHξ. The strategy to obtain this we borrow from [4, Theorem 5.1]. With ut:=etHξu0, the map (t,x)↦ut(x) is the solution to the parabolic Anderson model ∂tu=Δu+u⋄ξ, hence satisfies sups∈[0,t]∥us∥B∞,∞d,1−ε<∞ for all ε>0 (see [16], the extension to Dirichlet boundary conditions follows similar as the extension of the operator) and ut=Ptu0+∫0tPt−s(us⋄ξ)ds, where Ptu0(x)=pt∗u0(x) and pt the standard heat kernel pt(x)=(2πt)−2de−2t∣x∣2. The next step is to prove that Ptu0 is larger than the supremum norm of ∫0tPt−s(us⋄ξ)ds.
In [4] it is shown that for all ρ>0 there exists a tρ such that Pt\mathbbm1B(x,δ)≥41\mathbbm1B(x,δ+ρt) for t∈(0,tρ].
First observe that Pt\mathbbm1B(x,δ)(z)=∫B(x,δ)pt(z−y)dy=∫B(z−x,δ)pt(y)dy, and thus (with e1 the unit vector with 1 at the first coordinate)
[TABLE]
because B\big{(}\frac{\delta+t}{\sqrt{t}}e,\frac{\delta}{\sqrt{t}}\big{)}\uparrow(0,\infty)\times\mathbb{R} as t↓0.
On the other hand, one can prove that for ε∈(0,1) there exists a C>0 such that ∥∫0tPt−s(us⋄ξ)ds∥B∞,∞d,ε≤Ct1−ε.
Now observe that for ε∈(0,1) the integral ∫01(1−s)−εds equals (1−ε)−1.
Hence we can choose t0∈(0,tρ) such that \color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}\|\int_{0}^{t_{\rho}}P_{t_{1}-s}(u_{s}\diamond{\boldsymbol{\xi}})\,\mathrm{d}s\|_{\infty}\leq Ct_{0}^{1-\varepsilon}\leq\frac{1}{8}.
This implies that ut≥81 on B(x,δ+ρt0).
Let T,ρ>0, by choosing n such that nT≤t0, by repeating the argument we have uT≥(81)n on B(x,δ+ρT). As this holds for arbitrary ρ>0, this implies that UT is strictly positive everywhere.
∎
6 Enhanced white noise
In this section we prove Theorem 6.4; we first recall a definition and introduce notation.
Definition 6.1**.**
A white noise on Rd is a random variable W:Ω→S′(Rd,R) such that for all f∈S(Rd,R) the random variable ⟨W,f⟩ is a centered Gaussian random variable.
6.2**.**
Because ∥⟨W,f⟩∥L2(Ω,P)=∥f∥L2(Rd), the function f↦⟨W,f⟩ extends to a bounded linear operator W:L2(Rd)→L2(Ω,P) such that for all f∈L2(Rd), Wf is a complex Gaussian random variable, Wf=Wf and E[WfWg]=⟨f,g⟩L2 for all f,g∈L2(Rd).
6.3**.**
Let W be a white noise on R2 and W be as in 6.2.
For the rest of this section we fix L>0.
Unless mentioned otherwise τ∈Cc∞(Rd,[0,1]) is an even function that is equal to 1 on a neighbourhood of [math].
Define ξL,ε∈Sn([0,L]d) by
(for ⟨W,nk,L⟩, we interpret nk,L to be the function in L2(Rd) being equal to nk,L on [0,L]d and equal to [math] elsewhere)
[TABLE]
For k∈N0d define Zk:=⟨W,nk,L⟩. Then Zk is a (real) normal random variable with
[TABLE]
Before we state the convergence to the enhanced white noise, let us discuss our choice of regularization (49).
We use the regularisation by means of a Fourier multiplier, as in [1].
This basically means we ‘project’ the white noise on the Neumann space on the box and then take the regularisation corresponding to a Fourier multiplier.
Another option is to consider mollified white noise on the full space by convolution and then project the white noise on the Neumann space.
In a future work by König, Perkowski and van Zuijlen, it will be shown that both choices lead to the same limiting object (up to a constant, by using techniques from Section 11).
This also confirms that our construction of the Anderson Hamiltonian with enhanced white noise agrees with the construction of the Anderson Hamiltonian in [21], where the Anderson Hamiltonian is considered a limit of the operators with mollified white noise as potentials.
Theorem 6.4**.**
Let d=2. For all α<−1
there exists a ξL∈Xnα such that the following convergence holds almost surely in Xnα, i.e., on a measurable set ΩL with P(ΩL)=1
[TABLE]
where cε=2π1log(ε1)+cτ∈R and cτ only depends on τ. ξL does not depend on the choice of τ.
ξL is a white noise in the sense that for φ,ψ∈Sn(QL), ξL(φ) and ξL(ψ) are Gaussian random variables with
[TABLE]
Moreover, for φ∈Cc∞(QL) one has almost surely (i.e., on ΩL)
[TABLE]
Hence, for every L>0 the W viewed as an element of D′(QL) extends almost surely uniquely to a ξL in Cnα.
Instead of taking QL as an underlying space, we can also take a shift of the box, i.e., y+QL:
6.5**.**
For y∈Rd we define
[TABLE]
If d=2, by Theorem 6.4 there exists a ξLy=(ξLy,ΞLy)∈Xnα(y+QL) such that almost surely
[TABLE]
and such that ξLy is a white noise in the sense described in Theorem 6.4 (i.e. T−yξLy satisfies (52)).
For the rest of this section we fix L>0 and drop the subindex L; we write ξε=ξL,ε and nk=nk,L.
Definition 6.6**.**
Define Ξε∈Sn(QL) by
[TABLE]
The strategy of the proof of the following theorem is rather similar to the proof on the torus in [1], but due to the differences of the Dirichlet setting and for the sake of self-containedness we provide the proof.
Theorem 6.7**.**
For all α<−2d, ξε converges almost surely as ε↓0 in Cnα, to the white noise ξL (as in Theorem 6.4).
Moreover, for d=2 and all α<−1, Ξε converges almost surely as ε↓0 in Cn2α+2; the limit is independent of the choice of τ.
Proof.
The proof relies on the Kolmogorov-Chentsov theorem (Theorem 6.8).
Lemma 6.10(a)
shows that the required bound for this theorem can be reduced to bounds on the second moments of Δi(ξε−ξδ)(x) and Δi(Ξε−Ξδ)(x), given in 6.11 (the proofs of these bounds are lengthy and therefore postponed to Section 11).
(52) follows from
[TABLE]
That the limit of Ξε is independent of the choice of τ, follows from Theorem 11.2(a).
∎
Theorem 6.8** (Kolmogorov-Chentsov theorem).**
Let ζε be a random variable with values in a Banach space X for all ε>0.
Suppose there exist a,b,C>0 such that for all ε,δ>0,
[TABLE]
Then there exists a random variable ζ with values in X such that in La(Ω,X) and almost surely
limε↓0,ε∈Q∩(0,∞)ζε=ζ.
Proof.
This follows from the proof of [19, Theorem 2.23].
First note that ζε is Cauchy in La(Ω,X), so that limε↓0ζε=ζ0 exists as a limit in this space. Then ζt for t∈[0,1] is as in the Kolmogorov-Chentsov theorem. Therefore it has a continuous modification ζ~t.
So for countably many ε∈(0,1] we have ζε=ζ~ε on a full probability set and thus ζε→ζ~0 almost surely.
∎
In Lemma 6.10(a) we show how we obtain Lp bounds on the Cn norm from bounds on squares of the Littlewood-Paley blocks.
Lemma 6.10(b) follows from (a) and will be used in Section 8 to prove Theorem 8.8.
To prove Lemma 6.10 we use the following auxiliary lemma.
It is generally known that the p-th moment of a centered Gaussian random variable Z can be bounded by its second moment, as E[∣Z∣p]=(p−1)!!E[∣Z∣2]2p (see [26, p.110]).
We will use the generalisation of this bound, which is a consequence of the so-called hypercontractivity.
Lemma 6.9**.**
[25, Theorem 1.4.1 and equation (1.71)]**
Suppose that Zn for n∈N are independent standard Gaussian random variables.
If Z is a random variable in the first or second Wiener chaos, which means it is of the form
∑n∈NanZn or ∑n,m∈Nan,m(ZnZm−E[ZnZm])
with an,an,m∈C, then for p>1
[TABLE]
Lemma 6.10**.**
Let A>0 and a∈R.
(a)
Suppose ζ is a random variable with values in Sn′([0,L]d) such that Δiζ(x) is a random variable of the form as Z is, as in Lemma 6.9 for all i∈N−1 and x∈[0,L]d. Suppose that for all i∈N−1, x∈[0,L]d
[TABLE]
Then for all κ>0
there exists a C>0 independent of ζ such that for all p≥1
[TABLE]
2. (b)
Suppose that (ζε)ε>0 is a family of such random variables for which (55) holds for all i∈N−1 and x∈[0,L]d, and that for all k∈N0d
[TABLE]
Then for all κ>0 and p>1
[TABLE]
Consequently, we have ζεP0 (convergence in probability) in Cn−2a−κ−p2([0,L]d).
Using the embedding property of Besov spaces [2, Proposition 2.71],
which implies the existence of a C>0 such that
∥⋅∥Cn−2a−κ−p2≤C∥⋅∥Bp,pn,−2a−κ, one obtains (56).
The latter becomes arbitrarily small by choosing I large and subsequently ε small.
∎
6.11**.**
The following two statements are proved in Section 11.
(a)
(Lemma 11.4)
For all γ∈(0,1) there exists a C>0 such that for all i∈N−1, ε,δ>0, x∈[0,L]d
[TABLE]
2. (b)
(Lemma 11.11)
Let d=2.
For all γ∈(0,1) there exists a C>0 such that for all i∈N−1, ε,δ>0, x∈QL
[TABLE]
Definition 6.12**.**
Define cε,L∈R by
[TABLE]
In the periodic setting one has that with ξε defined as in [1],
E[ξε\varodotσ(D)ξε(x)]=cε,L. Observe that it is independent of x.
In our setting, the Dirichlet setting, we have (remember (50) and use that
∑i,j∈N−1,∣i−j∣≤1ρi(Lk)ρj(Lk\normalcolor)=1)
Lemma 6.15 deals with this x dependence of E[ξε\varodotσ(D)ξε(x)].
The following observations will be used multiple times.
6.13**.**
As 0≤ρi≤1 and there is a b≥1 such that ρi is supported in a ball of radius 2ib for all i∈N−1, one has for all i∈N−1, x∈Rd and γ>0
[TABLE]
Theorem 6.14**.**
Let τ:R2→[0,1] be a compactly supported even function that equals 1 on a neighbourhood of [math].
There exists a C>0 such that for all γ∈R, L>0 and h∈Hnγ(QL) we have ∥h−τ(εD)h∥Hnγ→0 and for β<γ
[TABLE]
Proof.
By assumption on τ there exists an a>0 such that τ=1 on B(0,a). Then
[TABLE]
If ∣k∣≥εLa, then ∣Lk∣≥εa and thus
[TABLE]
By the following bounds the theorem is proved; by Theorem 4.14
[TABLE]
∎
Lemma 6.15**.**
Let τ:R2→[0,1] be a compactly supported even function that equals 1 on a neighbourhood of [math]. Then
x↦E[ξε\varodotσ(D)ξε(x)]−cε,L converges in Cn−γ to a limit that is independent of τ as ε↓0 for all γ>0.
Proof.
Let γ>0.
As there are only finitely many k∈N02 for which τ(Lεk)=0, x↦E[ξε\varodotσ(D)ξε(x)]−cε,L is smooth.
We can rewrite (6) and find uniformly bounded ak,bk such that nk(x)2−L2νk2=2L1[nk+akn(k1,0)+bkn(0,k2)](2x). By (60) this means that E[ξε\varodotσ(D)ξε(x)]
(see (59))
can be decomposed into three sums.
For the first sum (by taking the part with “nk”), as δ0∈Hn−1 and ⟨δ0,nk⟩=L2 for all k∈N02
[TABLE]
By Theorem 4.21σ(D)δ0∈Hn1, so that by Theorem 6.14τ(εD)2σ(D)δ0→σ(D)δ0 in Hn1−γ and thus in Cn−γ (by [2, Theorem 2.71]).
This convergence is ‘stable’ under ‘multiplying the argument by 2’ (see also 4.19).
Now let us show the convergence of the other sums.
We only consider the sum with “akn(k1,0)” in it, as the sum with “bkn(0,k2)” follows similarly.
Let us write hε for
[TABLE]
Then
[TABLE]
With (61)
∥Δin(l,0)∥L∞≲∣ρi(Ll,0)∣≲2γi(1+L2l2)−γ.
Hence
[TABLE]
By Lebesgue’s dominated convergence theorem and the next bound it follows that h0∈Cn−γ and hε→h0 in Cn−γ. By using that 1+l2+m2≥(1+l)1−2γ(1+m)1+2γ,
[TABLE]
By these convergences and by plugging in the factor 2 also here the convergence is proved.
∎
Before we give the proof of Theorem 6.4, we study the behaviour of cε,L.
Lemma 6.16**.**
Let τ:R2→[0,1] be almost everywhere continuous, be equal to 1 on B(0,a) and zero outside B(0,b) for some a,b with 0<a<b.
There exist a cτ∈R that only depends on τ, and (CL)L≥1 in R that do not depend on τ with CLL→∞0 such that
cε,L−2π1logε1−cτε↓0CL for all L≥1.
Proof.
We define ⌊y⌋=(⌊y1⌋,⌊y2⌋)
and hL(y)=(L2+π2∣y∣2)−1
for y∈R2. Then
4c_{\varepsilon,L}\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}=\sum_{k\in\mathbb{Z}^{2}}\frac{\tau(\frac{\varepsilon}{L}k)^{2}}{L^{2}+\pi^{2}|k|^{2}}=\int_{\mathbb{R}^{2}}\tau(\tfrac{\varepsilon}{L}\lfloor y\rfloor)^{2}h_{L}(\lfloor y\rfloor)\,\mathrm{d}y. We first show that
4cε,L−∫R2τ(Lεy)2hL(y)dy→0. Write A(s,t) for the annulus {y∈R2:s≤∣y∣≤t}.
To shorten notation, we write δ=Lε.
As ∣⌊y⌋−y∣≤2
[TABLE]
As hL(⌊y⌋)−hL(y)=hL(⌊y⌋)hL(y)(∣y∣2−∣⌊y⌋∣2), hL(⌊y⌋)≲hL(y) and (∣y∣2−∣⌊y⌋∣2)≲1+∣y∣, we have
hL(⌊y⌋)−hL(y)≲(1+∣y∣)hL(y)2. As the latter function is integrable over R2, it follows by Lebesgue’s dominated convergence theorem that ∫B(0,δa−2)hL(⌊y⌋)−hL(y)dy converges in R to a CL for which CLL→∞0.
On the other hand, the integral over the annulus can be written as
[TABLE]
Again by a domination argument (note that ∣x∣21 is integrable over annuli), using that
|\frac{x}{\delta}|^{2}\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}\leq(|\lfloor\frac{x}{\delta}\rfloor|+\sqrt{2})^{2}\leq 4+2|\lfloor\frac{x}{\delta}\rfloor|^{2}\leq 4(L^{2}+|\lfloor\frac{x}{\delta}\rfloor|^{2}),
so that
[TABLE]
we conclude that (62) converges to [math].
Observe that
[TABLE]
By some substitutions (remember δ=Lε), for ε<a
[TABLE]
The last integral converges as ε↓0 to zero.
For the second integral we consider
[TABLE]
Observe that if a≤1 then ∫A(a,1)π2∣x∣21dx=−π2loga and if a≥1 then ∫A(1,a)π2∣x∣21dx=π2loga. Therefore, with
[TABLE]
we obtain that cε,L−2π1logε1−CL−cτε↓00.
Observe that cτ does not depend on the choice of a,b (such that τ=1 on B(0,a) and τ=0 outside B(0,b)).
∎
This is a consequence of
Theorem 6.7 and
Lemmas 6.15 and 6.16.
Indeed, we can decompose ξε\varodotσ(D)ξε−cε into the sum of Ξε (which converges by Theorem 6.7), E[ξε\varodotσ(D)ξε]−cε,L (which converges by Lemma 6.15) and cε,L−cε (which converges by Lemma 6.16). So
[TABLE]
∎
7 Scaling and translation
In this section we prove the scaling properties of the eigenvalues, by scaling the size of the box and the noise.
In this section we fix L>0 and n∈N.
Lemma 7.1**.**
Suppose that V∈L∞([0,L]d).
For all β>0
[TABLE]
Proof.
Fix n∈N and write λ=λn([0,L]d,V).
Suppose that g∈H02 (see 5.9) is an eigenfunction for λ of Δ+V.
With gβ(x):=g(βx) we have for almost all x
[TABLE]
So that β2λ is an eigenvalue of Δ+β2V(β⋅) on [0,βL]d.
As the multiplicities of the eigenvalues on [0,L]d and [0,βL]d are the same, β2λ=λn([0,βL]d,β2V(β⋅)).
∎
For simplicity we take β=1.
αlαξL is a white noise on QαL,
so that ⟨αlαξL,nk⟩=d⟨ξαL,nk⟩ for all k∈N02 and thus α1ξαL=dlαξL.
By 4.19lαξL,ε=τ(αεD)[lαξL]=dα1ξαL,αε. So that by Lemma 7.1
[TABLE]
Now we can subtract cτ from both sides and take the limit ε↓0.
∎
Lemma 7.4**.**
For y∈R2 and β>0
[TABLE]
Moreover, if y+QL∘∩QL∘=∅, then
λn(QL,β) and λn(y+QL,β)
are independent.
Proof.
As (see also Definition 4.20, in particular (34))
HξLyf=Ty(HT−yξLy(T−yf)), it is sufficient to show ξL=dT−yξLy.
As T−yW=dW, we have T−yξL,εy=dξL,ε and hence obtain ξL=dT−yξLy by (51) and (53).
For the “moreover”; note that (⟨Ty−1W,nk,L⟩)k∈N02 and (⟨W,nk,L⟩)k∈N02 are independent when y+QL∘∩QL∘=∅ (as E[⟨Ty−1W,nk,L⟩⟨W,nm,L⟩]=⟨Tynk,L,nk,L⟩=0).
∎
8 Comparing eigenvalues on boxes of different size
8.1 Bounded potentials
In this section we prove the bounds comparing eigenvalues on large boxes with eigenvalues on smaller boxes for bounded potentials, see Lemma 8.1, Theorem 8.4 and Theorem 8.6.
In Section 8.2, Theorem 8.7, we extend this for white noise potentials.
We fix d∈N and use the notation ∣k∣∞=maxi∈{1,…,d}∣ki∣.
Lemma 8.1**.**
Let L>r>0 and ζ∈L∞([0,L]d).
For all y∈R2 such that y+[0,r]d⊂[0,L]d, we have
[TABLE]
Proof.
This follows from (47)
as one can identify a finite dimensional
F⊏H02(y+[0,r]d) with a linear subspace of H02([0,L]d) with the same dimension.
∎
We will now prove an upper bound for λn(QL,ζ) in terms of a maximum over smaller boxes.
For this we cover QL by smaller boxes that overlap and correct the potential with a function that takes into account the overlaps. We use the following lemma.
Lemma 8.2**.**
*Let r>a>0.
There exists a smooth function η:Rd→[0,1] with η=1 on [0,r−a]d and suppη⊂[−a,r]d such that ∥∇η∥∞≤aK for some K>0 that does not depend on r and a, and
*
[TABLE]
Proof.
We adapt the proof of [15, Proposition 1]
and
[3, Lemma 4.6].
Let φ:R→[0,1] be smooth,
φ=0 on (−∞,−1] and φ=1 on [1,∞) for all x∈R.
One has
[TABLE]
Let
[TABLE]
Then ζ=0 outside [−a,r], ζ=1 on [0,r−a] and
∑k∈Zζ(x−rk)2=1.
Indeed, we have for x∈[r−a,r] that
[TABLE]
as φ(a2x+1)=1 and (1−φ(a2(x−2r)+1))=1 (because x−2r<−a).
Furthermore, note that
[TABLE]
Moreover,
∥ζ′∥∞≤a2[∥φ′∥∞+∥1−φ′∥∞]. Hence with η:Rd→[0,1] defined by η(x)=∏i=1dζ(xi) we have (63) and ∥∇η∥∞≤aC for some C>0.
∎
8.3** (IMS formula).**
Write ηk(x)=η(x−rk). Then
[TABLE]
Consequently,
[TABLE]
and thus
with Hkψ=ηkH(ηkψ) (where H=Hζ) and Φ=∑k∈Zd∣∇ηk∣2 color=green!50]21 missing in definition Φ
[TABLE]
(64) is also called the IMS-formula, see also [32, Lemma 3.1] with references to first works in which it appears.
The technique to prove [15, Proposition 1], which we slightly generalize, is basically the IMS-formula.
Theorem 8.4**.**
For all r>a>0 there is a smooth function Φa,r:Rd→[0,∞) whose support is contained in the a-neighbourhood of the grid rZd+∂[0,r]d, is periodic in each coordinate with period r, with
∥Φa,r∥∞≤aK
for some K>0 that does not depend on a and r,
such that ζ∈L∞(Rd) and L>r
[TABLE]
Proof.
Let η be as in Lemma 8.2, ηk(x)=η(x−rk) and Φa,r=Φ=∑k∈Zd∣∇ηk∣2. color=green!50]factor 21
By Lemma 8.2 it follows that ∥Φ∥∞≤aK for some K>0 that does not depend on a and r.
Observe that ∑k∈N0d:∣k∣∞<rL+1ηk2 equals 1 on [0,L]d.
With Hk as in 8.3, Hk is self-adjoint and Hk≤λ(rk+[−a,r]d)ηk2 for all k∈Zd.
Hence we have by the IMS-formula (64) on H02([0,L]d)
[TABLE]
∑k∈N0d:∣k∣∞<rL+1ηk2 indeed equals 1 on [0,L]d: Let us check this for d=1.
This is the case when for m=max{k∈N0:k<rL+1} one has L≤r(m+1)−a.
As a<r, this is the case when rL≤m, which is the case by definition of m.
∎
8.5**.**
An alternative way of proving (65) without (47) is as follows:
By the IMS-formula (64) we have for all ψ∈Cc∞(QL) with ∥ψ∥L2=1, using ∑k∈N0d:∣k∣∞≤rL+1∥ψk∥L22=1 for the second inequality and writing ψˇk=∥ψk∥L2ψk when ψk=0 and ψˇk=0 otherwise,
In this section we prove analogous bounds to those in Lemma 8.1, Theorem 8.4 and Theorem 8.6 by replacing the bounded potential ζ by white noise, i.e., we prove Theorem 8.7.
Theorem 8.7**.**
Let L≥r≥1.
(a)
For all κ>0 and x,y∈R2 such that y+Qr⊂x+QL
[TABLE]
2. (b)
There exists a K>0 such that for all κ>0, x∈R2 and a∈(0,r),
[TABLE]
3. (c)
For κ>0 and x,y1,…,yn∈R2 such that (yi+Qr)i=1n are pairwise disjoint subsets of x+QL
[TABLE]
Let us describe how the proof of Theorem 8.7 follows from the following theorem.
Let L≥r≥1,κ>0.
By performing a translation over x we may assume x=0.
It is sufficient to show that for all y∈R2 and r>0 such that y+Qr⊂QL one has the following convergences in probability (and thus almost surely along a sequence (εn)n∈N in (0,1) that converges to [math])
[TABLE]
for the right choices ξL,ε′ and cε′.
Indeed, for (67) and (69) this is clearly sufficient. For (68) this is sufficient by “replacing L” in (70) by “3L” and “replacing r” by either “L” or “r+a”.
In this case, we choose ξL,ε′ like ξL,ε in (49) but with τ′=\mathbbm1(−1,1)2 instead of τ and cε′=2π1logε1+cτ′ (the choice of τ′=\mathbbm1(−1,1)2 is convenient for calculations in Section 12).
Observe that
[TABLE]
for θεy (which equals ξL,ε∣y+Qr in L2(y+Qr)) given by
[TABLE]
Therefore the following theorem resembles the missing part of the proof.
Observe that θεy\varodotσ(D)θεy∈Hn1⊂Cn0 as θεy∈L2=Hn0 (see also 5.7).
Theorem 8.8**.**
Let L>r≥1 and x,y∈R2 be such that y+Qr⊂x+QL.
Let θεy be as in (71).
Then (ξL,ε′,ξL,ε′\varodotσ(D)ξL,ε′−cε′)PξL in Xnα(QL) and (θεy,θεy\varodotσ(D)θεy−cε′)Pξry
in Xnα(y+Qr).
We prove Theorem 8.8 in Section 11: it follows from Theorem 11.3.
9 Large deviation principle of the enhancement of white noise
In this section we assume L>0 and write ξ=(ξ,Ξ) for the limit ξL as in Theorem 6.4.
We prove the following theorem.
Theorem 9.1**.**
(εξ,εΞ)* satisfies the large deviation principle with rate ε and rate function Xnα→[0,∞],
(ψ1,ψ2)↦21∥ψ1∥L22.*
Remark 9.2**.**
Analogously, by some lines of the proof in a straightforward way, the statement in Theorem 9.1 holds with underlying space the torus and (ξ,Ξ) being the analogue limit as in Theorem 6.4 as is considered in [1].
As a direct consequence of this large deviation principle and the continuity of the eigenvalues in the (enhanced) noise (see (44)), we obtain the following by an application of the contraction principle (see [10, Theorem 4.2.1]).
Corollary 9.3**.**
λn(QL,ε)=λn(QL,(εξL,ε2ΞL))* satisfies the large deviation principle with rate ε2 and rate function IL,n:R→[0,∞] given by*
[TABLE]
Theorem 9.1 is an extension of the following theorem.
A proof can be given by using [11, Theorem 3.4.5], but as our proof is rather simple and – to our knowledge – different from proofs in literature, we include it.
Theorem 9.4**.**
εξ* satisfies the large deviation principle with rate function Cnα([0,L]d)→[0,∞] given by
ψ↦21∥ψ∥L22.*
Proof.
We use the Dawson-Gärtner projective limit theorem [10, Theorem 4.6.1] and the inverse contraction principle [10, Theorem 4.2.4].
Let J=N with its natural ordering.
Let Yi=Ri for all i∈J.
Let pij be the projection Yj→Yi on the first i-coordinates.
Let Y be the projective limit lim←Yj (see [10, above Theorem 4.6.1], it is a subset of ∏j∈JYj).
Let pj:Y→Yi be the canonical projection.
Let s:N→N0d be a bijection.
Write dn′=ds(n).
Let Φ:Cnα([0,L]d)→Y be given by Φ(u)=(⟨u,d1′⟩,…,⟨u,dn′⟩)n∈N. This Φ is continuous and injective.
We first prove that Φ∘ξ satisfies the large deviation principle.
For every n∈N the vector (⟨ξ,d1′⟩,…,⟨ξ,dn′⟩) is an n-dimensional standard normal variable, whence ε(⟨ξ,d1′⟩,…,⟨ξ,dn′⟩)=(⟨εξ,d1′⟩,…,⟨εξ,dn′⟩) satisfies a large deviation principle on Rn with rate function given by
In(y):=21∣y∣2=21∑i=1nyi2. By the Dawson-Gärtner projective limit theorem the sequence ε(⟨ξ,d1′⟩,…,⟨ξ,dn′⟩)n∈N satisfies the large deviation principle on Y with rate function
[TABLE]
The image of Cnα under Φ is measurable, which follows from the following identity
[TABLE]
Indeed,
[TABLE]
is continuous as ρi(Ls(n))=0 for only finitely many n.
As P(Φ(εξ)∈Φ(Cnα))=1, and the domain on which I is finite is contained in Φ(Cnα), i.e., {y∈Y:I(y)<∞}⊂Φ(Cnα), by [10, Theorem 4.1.5] Φ(εξ) satisfies the large deviation principle on Φ(Cnα) with rate function I (restricted to Φ(Cnα)).
Now we apply the inverse contraction principle. Φ:Cnα→Φ(Cnα) is a continuous bijection. Also I∘Φ(ψ)=21∥ψ∥L22 (by Parseval’s identity). Hence the proof is finished by showing that εξ is exponentially tight in Cnα.
Let m>0 and Km:={ψ∈Cnα:I∘Φ(ψ)≤m}.
As L2 is compactly embedded in Hnα+1 by Theorem 4.16, which is continuously embedded in Cnα (by [2, Theorem 2.71], Km is relatively compact in Cnα. By the large deviation principle of Φ(εξ) on Φ(Cnα), and because Kmc⊂Kmc, it follows that
[TABLE]
This proves the exponential tightness of εξ in Cnα, which finishes the proof.
∎
To prove Theorem 9.1 we use Theorem 9.4 and the extension of the contraction principle:
Let X be a Hausdorff space and (Y,d) be a metric space.
Suppose that (ηε)ε>0 are random variables with values in X that satisfy the large deviation principle with (rate ε and) rate function I:X→[0,∞].
Suppose furthermore that
Fδ:X→Y is a continuous map for all δ>0, F:X→Y is measurable and that for all q∈[0,∞)*
[TABLE]
and that Fδ(ηε) are exponential good approximations for F(ηε), i.e., if for all κ>0
[TABLE]
Then F(ηε) satisfies the large deviation principle with rate function Y→[0,∞] given by
[TABLE]
Lemma 9.6**.**
Let α∈(−34,−1).
Let τ:R2→[0,1] be a compactly supported function that equals 1 on a neighbourhood of [math].
Write hδ=τ(δD)h.
There exists a C>0 such that for all δ>0 and h∈L2
[TABLE]
Proof.
This follows by Theorem 4.27 (note 2α+4>0), Theorem 4.23 (also using ∥hδ∥Hnα+1≲∥h∥Hnα+1≲∥h∥L2; see also 4.17) and Theorem 6.14:
For δ>0 we write hδ=τ(δD)h for τ as in 6.3
and define Fδ:Cnα(QL)→Xnα(QL) by
[TABLE]
We define F:Cnα(QL)→Xnα(QL) as follows.
If for h∈Cnα(QL) the function hδ\varodotσ(D)hδ converges in Cn2α+2, then F(h)=limδ↓0(h,hδ\varodotσ(D)hδ);
if hδ\varodotσ(D)hδ does not converge, but hδ\varodotσ(D)hδ−cδ does (where cδ=2π1log(δ1)+cτ), then define F(h)=limδ↓0(h,hδ\varodotσ(D)hδ−cδ); whereas if hδ\varodotσ(D)hδ−cδ also does not converge, then F(h)=0.
With X=Cnα(QL) and Y=Xnα(QL) and ηε=εξ, by Theorem 9.4 and Theorem 9.5 it is sufficient to prove that (73) and (74) hold because when F(ϕ)=(ψ1,ψ2)=0 then ϕ=ψ1.
∙ First we check (73).
By Lemma 9.6 we have (F(h)=(h,h\varodotσ(D)h) and)
In this section we consider infima over sets of the rate function IL,n as in (72).
We prove the results summarized in Theorem 2.6.
Lemma 10.1**.**
For a,b∈R and all δ>0
[TABLE]
Consequently,
for
(aL)L>0 in R with limL→∞LaL=0,
[TABLE]
Proof.
As λn(QL,V)+a=λn(QL,V+a\mathbbm1QL),
∥a\mathbbm1QL∥L2=aL, and 2⟨V,a\mathbbm1QL⟩≤δ∥V∥L22+δ1a2L2 for all δ>0;
[TABLE]
The lower bound can be proven similarly.
∎
We define
[TABLE]
We prove that ϱn is bounded away from [math] uniformly in n (Lemma 10.4) and give an alternative variational formula for ϱn (Lemma 10.5) from which we conclude Theorem 2.6.
The first equality follows by Lemma 10.1.
The second follows by
Lemma 5.8.
∎
We will use Ladyzhenskaya’s inequality [22], which is a special case of the Gagliardo– Nirenberg interpolation inequality [24].
Lemma 10.3** (Ladyzhenskaya’s inequality).**
There exists a C>0 such that for f∈H1(R2),
[TABLE]
Lemma 10.4**.**
*Let C>0 be as in Lemma 10.3. Then ϱn≥C2 for all n∈N.
*
Proof.
Let n∈N.
Let L>0 and ε>0.
Let V∈Cc∞(QL)
be such that λn(QL,V)≥1 and 21∥V∥L22≤μL,n+ε.
By (47) there is a ψ∈Cc∞(QL) with ∥ψ∥L2=1 such that (by integration by parts)
[TABLE]
Hence by using Ladyzhenskaya’s inequality (77), which implies ∥∇ψ∥L22≥C1∥ψ∥L44,
[TABLE]
As a2+b2≥2ab we have
[TABLE]
and thus
μL,n+ε≥21∥V∥L22≥2C1−ε. As this holds for all ε>0 we conclude that μL,n≥C2 for all L>0. Hence ϱn≥C2.
∎
Lemma 10.5**.**
For all n∈N, a>0,
[TABLE]
Moreover, μL,n is decreasing in L, and one could replace “infL>0” in (78) by “limL→∞”. In particular, ϱn=limL→∞μL,n.
Proof.
With W=L2V(L⋅) we have W∈Cc∞(Q1), ∥W∥L2(Q1)2=L2∥V∥L2(QL)2 and by Theorem 7.1λn(QL,V)=λn(QL,L21W(L1⋅))=L21λn(Q1,W).
Therefore
[TABLE]
With this, (78) follows directly from Lemma 10.6. That μL,n and the left-hand side of (80)
are decreasing in L follows from Lemma 8.1.
∎
Lemma 10.6**.**
Let Y be a topological space and f,g:Y→R be continuous functions. Let a>0 and suppose that
ϱ:=infL>0infw∈Y:f(w)≥aLLg(w)>0.
Then
[TABLE]
Proof.
By definition we have
∀L>0∀w∈Y:L1g(w)<ϱ⟹f(w)<aL,
by continuity of f and g we obtain (by taking K=Lϱa)
[TABLE]
Let ε>0.
Then there exists an L>0 and wL∈Y such that f(wL)≥aL and L1g(wL)≤ϱ+ε.
Then with K=La(ϱ+ε) we have for w=wL that
Kg(w)≤a1 and Kf(w)≥ϱ+ε1.
So that
supK>0supg(w)≤aKw∈YKf(w)=ϱ1. ∎
from which (1) follows.
By Cauchy-Schwarz, for ψ∈Cc∞(R2), the supremum of ∫Vψ2 with respect to V∈Cc∞(R2) with L2 norm equal to 1 is attained at V=∥ψ2∥L2ψ2; therefore this supremum equals ∥ψ∥L42 and hence we derive the first equality in (2).
In Lemma 10.4 we have already seen that ρ12≤χ. For the other inequality, we refer to [6, Theorem C.1] (basically the trick is to replace “ψ” by “λf(λ⋅)” and optimise over λ>0 first, then over f∈L2 with ∥f∥L2=1).
First, let us check that the L2 norm of the rescaled function equals the L2 norm of the original function.
[TABLE]
Therefore
[TABLE]
The concave function aλ−bλ2 attains its maximum where the derivative equals [math]: At λ=2ba.
Hence the maximum equals 2ba2−4ba2=4ba2.
Hence
[TABLE]
∎
11 Convergence of Gaussians
In this section we prove the convergence of Gaussians mentioned in Section 6 and Section 8.
We bundle the proofs together in a general setting as they rely on similar techniques.
For r≥1 we let
Xk,rε and Yk,rε be centered Gaussian variables for k∈N0d, ε>0 such that every finite subset of {Yk,rε:k∈N0d,ε>0}∪{Xk,rε:k∈N0d,ε>0} is jointly Gaussian for all r≥1.
We write
[TABLE]
Also, we introduce the notation
[TABLE]
Lemma 11.1**.**
Let d=2.
Write Fr,ε(k,l)=E[Xk,rεXl,rε].
Let I⊂[1,∞).
Suppose that
[TABLE]
For all γ∈(0,1) there exists a C>0 such that for all r∈I,
i∈N−1, ε>0, x∈Qr
Let d=2, I⊂[1,∞).
We write R={(k,l)∈N02×N02:k1=l1,k2=l2}.
Let Gr,ε(k,l)=E[Xk,rεXl,rε−Yk,rεYl,rε].
Consider the following conditions.
[TABLE]
(a)
Suppose that (85) holds and that (82) holds for Fr,ε(k,l) being either E[Xk,rεXl,rε],E[Xk,rεYl,rε] or E[Yk,rεYl,rε]. Then for r∈I, α<−1, in Xnα we have
[TABLE]
2. (b)
Suppose (86) holds. Then E[θr,ε\varodotσ(D)θr,ε−ξr,ε\varodotσ(D)ξr,ε]→0 in Cn−γ for all γ>0 and r∈I.
Consequently, if the above assumptions in (a) and (b) hold, then with c=0, for r∈I, α<−1, in Xnα
[TABLE]
Proof.
(a)
We use Lemma 6.10(b).
By Lemma 11.1 we obtain (55) for ζ=θr,ε−ξr,ε with a=2+γ and for ζ=Θr,ε−Ξr,ε with a=2γ for γ∈(0,1).
(85) implies that E[∣⟨θr,ε−ξr,ε,nk,r⟩∣2]→0, i.e., (57) holds for ζε=θr,ε−ξr,ε.
In Lemma 11.13
we show that (57) holds for ζε=Θr,ε−Ξr,ε.
Let τ∈Cc∞(R2,[0,1]) and τ′:R2→[0,1] be compactly supported functions.
Suppose τ and τ′ are equal to 1 on a neighbourhood of [math].
(a)
For all r≥1 (87) holds
with c=cτ′−cτ
in case Xk,rε=τ′(rεk)Zk and Yk,r=τ(rεk)Zk.
2. (b)
Let L>r≥1 and y∈R2 be such that y+Qr⊂QL.
With W as in 6.2,
for
[TABLE]
(87) holds with c=0.
Proof.
(a)
That (85) holds is clear.
As ∣E[Xk,rεXl,rε]∣∨∣E[Xk,rεYl,rε]∣∨∣E[Yk,rεYl,rε]∣≤2δk,l, also (82) holds for each of those expectations and thus the conditions of Theorem 11.2(a) hold.
Therefore it is sufficient to show that E[θr,ε\varodotσ(D)θr,ε−ξr,ε\varodotσ(D)ξr,ε]Pcτ′−cτ in Cn−γ for all γ>0.
This follows by Lemma 6.15 and Lemma 6.16 as they show that E[θr,ε\varodotσ(D)θr,ε]−cε−cτ′ and E[ξr,ε\varodotσ(D)ξr,ε]−cε−cτ converge to the same limit in Cn−γ.
Consider the setting of 6.3, i.e., Yk,rε=τ(rεk)Zk for i.i.d. standard normal random variables (Zk)k∈N0d and τ∈Cc∞(R2,[0,1]).
For all γ∈(0,1) there exists a C>0 such that for all r≥1, i∈N−1, ε,δ>0, x∈Qr
[TABLE]
Proof.
Let γ∈(0,1).
As
Δi(ξr,ε−ξr,δ)(x)=∑k∈N02ρi(rk)(τ(εrk)−τ(δrk))Zknk,r(x), and ∥nk,r∥∞2≤(r2)d,
Therefore, as ∑k∈r1Zdr−d(1+∣k∣)d+2γ∣k∣γ<∞ , we obtain (88).
Indeed the sum is bounded by a constant not depending on r:
For k∈Zd and x∈Rd with ∣x−k∣∞≤21 we have ∣x−k∣≤2d,
[TABLE]
∎
Lemma 11.5**.**
Suppose that (82) holds for Fr,ε(k,l)=E[Xk,rεXl,rε].
For all γ∈(0,1) there exists a C>0 (independent of r) such that for all
i∈N−1, ε>0, x∈Qr
[TABLE]
Proof.
By (61) 2−βi∥Δink,r∥L∞≲r−2d(1+∣rk∣)−β≤r−2d∏i=1d(r1+rki)−dβ.
Let δ>0 be such that δ<γ (so that in particular δ<21+γ). As
∣E[Xk,rεXl,rε]∣≲∏i=1d(1+∣ki−li∣)δ−1=∏i=1drδ−1(r1+∣rki−rli∣)δ−1, we have by using Lemma 11.7
[TABLE]
∎
In the following two lemmas we present tools to bound sums by integrals, which will be frequently used.
Lemma 11.6**.**
Let M∈N and
f:[0,M]→R be a decreasing measurable function.
Then
∑m=1Mf(m)≤∫0Mf(x)dx≤∑m=0M−1f(m). If f instead is increasing, then
∑m=0M−1f(m)≤∫0Mf(x)dx≤∑m=1Mf(m).
Lemma 11.7**.**
Let γ,δ>0 be such that δ<γ<1.
There exists a C>0 such that for all r≥1, b>0 and u,v∈R,
[TABLE]
and for all l∈R2
[TABLE]
Proof.
We can bound both sums by “their corresponding integral” by observing the following.
For k∈Zd and x∈Rd with ∣x−rk∣∞<2r1 and thus ∣x−rk∣≤2rd, for u∈Rd
[TABLE]
So that
[TABLE]
Then
(91) follows by Lemma B.1
and by Lemma 11.9 we have ∑k∈r1N02r21(1+∣k−l∣)γρ\varodot(k,l)≲1+2π∫c1∣l∣c∣l∣(1+∣x−∣l∣∣)γxdx≲(1+∣l∣)2−γ.
∎
11.2 Terms in the second Wiener chaos
In order to bound terms in the second Wiener chaos, i.e., Ξr,ε, Θr,ε and E[θr,ε\varodotσ(D)θr,ε−ξr,ε\varodotσ(D)ξr,ε], we start by presenting auxiliary lemma’s and observations.
Let A,B,C,D be jointly Gaussian random variables. Then*
[TABLE]
Lemma 11.9**.**
There exist b>0 and c>1 such that
[TABLE]
Consequently, uniformly in x,y∈Rd
[TABLE]
Proof.
Let 0<a<b be such that suppρ0⊂{x∈Rd:a≤∣x∣≤b} and suppρ−1⊂B(0,b).
Let i,j∈N−1 and x,y∈R2 be such that ρi(x)ρj(y)=0.
If i,j∈{−1,0}, then x,y∈B(0,b).
Suppose i,j≥0 and ∣i−j∣≤1.
Then ∣x∣∈[2ia,2ib] and ∣y∣∈[2ja,2jb]⊂[2i−1a,2i+1b].
This in turn implies
[TABLE]
For x∈B(0,b) one has 1+∣x∣2≤1+b2≤(1+b2)(1+∣y∣2) and for (x,y)∈Rd×Rd with c1∣x∣≤∣y∣≤c∣x∣ one has 1+∣x∣2≲1+c2∣y∣2≤c2(1+∣x∣2).
∎
11.10**.**
Let k,l,z∈N0d. We write nk=nk,r here.
By (39) (and using (27)) and as nq∘k=nk for all q∈{−1,1}d,
[TABLE]
By combining this with (61), using that ∣nk(x)∣≤(r2)−2d, we have
for x∈(0,r)d and γ>0
[TABLE]
Lemma 11.11**.**
Let d=2.
Consider the setting of 6.3 as we did in Lemma 11.4.
For all γ∈(0,1) there exists a C>0 (independent of r) such that for all i∈N−1, ε,δ>0, x∈Qr
[TABLE]
Proof.
First observe
Ξr,ε=∑k,l∈N02ρ\varodot(rk,rl)1+r2π2∣l∣2τ(εrk)τ(εrl)[ZkZl−δk,l]nknl.
By Theorem 11.8 and (96) (as both contributions δk,mδl,n and δk,nδm,l can be bounded by the same expression by Lemma 11.9)
[TABLE]
As 2(ab−cd)=(a−c)(b+d)+(a+c)(b−d)
[TABLE]
we use this as follows:
[TABLE]
similar to (89) as in the proof of Lemma 11.4 we obtain
Suppose that (82) holds for Fr,ε(k,l)=E[Xk,rεXl,rε].
For all γ∈(0,∞) there exists a C>0 (independent of r) such that for all i∈N−1, ε>0
[TABLE]
Proof.
First note that Θr,ε=∑k,l∈N021+π2∣rl∣2ρ\varodot(rk,rl)nk,rnl,r[Xk,rεXl,rε−E[Xk,rεXl,rε]].
By Theorem 11.8
[TABLE]
By exploiting symmetries using Lemma 11.9 and by (96) we have
[TABLE]
We will bound the ρ\varodot function by 1,
use the bound (82) for some δ>0 (will be chosen small enough later) and we ‘separate the dimensions’ by using that 1+∣k∣2≳(1+k1)(1+k2) and (1+∣k−l∣)γ≳(r1+∣k1−l1∣)2γ(r1+∣k2−l2∣)2γ and obtain
Suppose that (85) holds and that (82) holds for Fr,ε(k,l) being either
E[Xk,rεXl,rε], E[Xk,rεYl,rε] or E[Yk,rεYl,rε].
Then
E[∣⟨Θr,ε−Ξr,ε,nz⟩∣2]→0
for all z∈N02.
Proof.
Fix z∈N02.
Given a function H:(N02)4→R let us use the following (formal) notation
We decompose Eε using Wick’s theorem (Theorem 11.8). Let us for a few lines write Ak=Xk,rε and Bk=Yk,rε, then we obtain
[TABLE]
Observe that
[TABLE]
Hence, as E[∣Ak−Bk∣2]=E[∣Xk,rε−Yk,rε∣2]→0 by (85),
we have Eε(k,l,m,n)→0 for all k,l,m,n∈N02.
We show that S(Eε) converges to zero by a dominated convergence argument.
Let us write
[TABLE]
and J~(k,l,m,n)=J(k,l,n,m).
Then by (82) we have Eε≤J+J~ and by the symmetries obtained by Lemma 11.9S(J~)≲S(J).
Moreover, by “merging the p,q,r,s and k,l,m,n variables” (in the sense of summing over k∈Z2 instead of q∘k with q∈{−1,1}2 and k∈N02) we have
If (86) holds, then
E[θr,ε\varodotσ(D)θr,ε−ξr,ε\varodotσ(D)ξr,ε]→0 in Cn−γ for all γ>0.
Proof.
Let us abbreviate Gr,ε(k,l)=E[Xk,rεXl,rε−Yk,rεYl,rε].
By (84) and (96)
[TABLE]
We use (86) and consider the sums over R and N02×N02∖R as in Theorem 11.2 separately.
∙[Sum over R]
By exploiting symmetries using Lemma 11.9
[TABLE]
By (92), by using that (1+∣l∣2)≥(1+l1)(1+l2) and by using (91) with δ<γ
[TABLE]
For Sε,2 by Lemma 11.9 there exist b>0,c>1 such that (using that ∣k−l∣≥∣k1−l1∣)
[TABLE]
We will bound the second sum on the right-hand side by its corresponding integrals (see Lemma 11.6)
and will bound these to get a bound on the sum over k.
Straightforward calculations show
[TABLE]
Indeed
[TABLE]
On the other hand, for δ>0 and z>0
[TABLE]
Indeed,
[TABLE]
Hence for all z≥0
[TABLE]
Hence for all δ>0 (we use (91) for the last inequality)
[TABLE]
Therefore, by choosing δ<5γ we obtain also Sε,2→0.
∙[Sum over N02×N02∖R]
Observe that N02×N02∖R={(k,l)∈N02×N02:∃i∈{1,2}:ki=li}.
Therefore, again by exploiting symmetries using Lemma 11.9 (we bound the sum over N02×N02∖R by the sum over all l∈N02, k2∈N0 and take k1=l1), using (91) for δ<2γ
In this section we consider d=2, L>r≥1 and y∈R2 such that y+Qr⊂QL.
We write τ=\mathbbm1(−1,1)2. We consider Xk,rε and Yk,rε as in Theorem 11.3(b).
For m,l∈N0 and z∈[0,L−r] we write
[TABLE]
Then we have
[TABLE]
And so with Gr,ε(k,l)=E[Xk,rεXl,rε−Yk,rεYl,rε] as in Theorem 11.2
By Lebesgue’s dominated convergence theorem this converges to zero.
(82) follows by Theorem 12.4
by observing that E[Xk,rεYl,rε]=τ(rεk)E[Xk,rεXl,rε], E[Yk,rεYl,rε]≤2δk,l and that ∣E[Xk,rεXl,rε]∣≤∏i=12(∑m∈N0∣bm,kiyibm,liyi∣).
(86) follows by Lemma 12.7.
∎
12.2**.**
The estimates (82) and (86) will rely on bounds on bm,lz for m,l∈N0 and z∈[0,L−r]. Let us calculate bm,lz here.
For notational convenience we put xsin(πx) and x1−cos(πx) for x=0 equal to 1 here.
By using some trigonometric rules, one can compute that
[TABLE]
where
[TABLE]
Let us demonstrate (102) in the easier case z=0.
Due to the identities 2cos(a)cos(b)=∑p∈{−1,1}cos(a+pb) and
sin(π(a±l))=(−1)lsin(πa) for a,b∈R and l∈Z,
we obtain
[TABLE]
[TABLE]
For general z∈[0,L−r]. First observe that
[TABLE]
Using the trigonometric identities for cos(a±b) and sin(a±b)
we have
There exists a C>0 (independent of r and L) such that for all z∈[0,L−r] and m,l∈N0,
[TABLE]
Proof.
This follows from the expression (102) by using that ∣xsin(πx)∣≲1+∣x∣1 and x1−cos(πx)≲1+∣x∣1.
The bounds xsin(πx)≤1+xπ and x1−cos(πx)≤1+x2 hold for x≥1, whereas for x∈(0,1) we can use that sin(πx)≤πx and that 1−cos(πx)≤1−cos(πx)2=sin(πx)2≤sin(πx).
∎
Theorem 12.4**.**
For all δ>0 there exists a C>0 (independent of L and r) such that for all k,l∈N0 and z∈[0,L−r]
[TABLE]
Proof.
This follows by Lemma 12.3 and by (91) as 1+∣Lrm−u∣≥(1+∣Lrm−u∣)1−2δ for δ>0.
For all z∈[0,L−r] and M,k,l∈N0 such that LrM≤l≤k, by Lemma 11.6
[TABLE]
and thus
[TABLE]
2. (b)
Similarly, for all z∈[0,L−r] and M,k,l∈N0 such that l≤k≤LrM,
[TABLE]
and thus
[TABLE]
As a consequence of the above and ∑m∈N0bm,kzbm,lz=δk,l we obtain the following lemma.
Lemma 12.6**.**
There exists a C>0 such that for all z∈[0,L−r], M∈[0,∞) and k,l∈N0: If either k=l or k=l≤LrM, then
[TABLE]
and if either k=l or k=l≥LrM
[TABLE]
Proof.
By (104) we may assume M∈N0.
The statements for k=l follow immediately by the bounds in 12.5.
For k=l we have ∑m∈N0,m<Mbm,kzbm,lz=∑m∈N0,m≥Mbm,kzbm,lz so that the rest follows by 12.5 and by observing that if l≤LrM≤k that ∣∑m∈N0,m<Mbm,kzbm,lz∣≲(1+∣k−l∣)1−δ1 by Theorem 12.4, which is less than the right-hand side of both (106) and (107).
∎
Lemma 12.7**.**
Write
Gr,ε(k,l)=E[Xk,rεXl,rε−Yk,rεYl,rε].
There exists a C>0 such that for all ε>0 and k,l∈N02
[TABLE]
Proof.
Let (k,l)∈N02×N02 be such that k=l with ∣k∣∞<εr. Then (see (101))
[TABLE]
If k and l are not like that, then
[TABLE]
So that the bound (108) follows from Lemma 12.6.
∎
Appendix A The min-max formula for smooth potentials
Lemma A.1**.**
Let f1,…,fn be pairwise orthogonal in H02.
There exist pairwise orthogonal f1,k,…,fn,k in Cc∞ for k∈N such that for all i
[TABLE]
Proof.
Let gi,k∈Cc∞ be such that gi,k→fi in H02 for all i.
By doing a Gram-Schmidt procedure on g1,k,…,gn,k we can give the proof by induction.
We prove the induction step, assuming that f1,k=g1,k,…,fn−1,k=gn−1,k are pairwise independent. We define
[TABLE]
Then fn,k is pairwise independent from f1,k,…,fn−1,k. As for i∈{1,…,n−1} we have
[TABLE]
it follows that fn,k→fn.
∎
Lemma A.2**.**
Let ζ∈L∞, n∈N and L>0.
Then (for notation see 5.4)
[TABLE]
Proof.
First observe that
[TABLE]
Let f1,…,fn∈H02 with ⟨fi,fj⟩H02=δij.
By Lemma A.1
there exist f1,k,…,fn,k in Cc∞ with ⟨fi,k,fj,k⟩H02=δij (by renormalising) such that (109) holds.
Then
[TABLE]
We used
[TABLE]
and ∣⟨Hζf,g⟩L2∣≤∥Hζf∥L2∥g∥L2≲∥f∥H02∥g∥H02.
Appendix C Spectrum of an operator with compact resolvents
Let H be a Hilbert space.
Let A:D→H be a linear operator, where D is a linear subspace of H. ρ(A) denotes the resolvent set of A, σ(A) the spectrum and σp(A) the point spectrum, i.e., the set of eigenvalues.
Theorem C.1**.**
Suppose H is infinite dimensional.
Let α>0.
Suppose μ∈(−∞,α]⊂ρ(A) and write Rμ=(μ−A)−1.
Suppose that Rμ is a self-adjoint compact operator as a map H→H.
Then
[TABLE]
Suppose moreover that A is a closed symmetric (densely defined) operator.
Then A is self-adjoint and has an (at most) countable spectrum without accumulation points.
For all λ∈σ(A), ker(λ−A) is finite dimensional and
[TABLE]
Let λ1≤λ2≤⋯ be such that σ(A)={λn:n∈N} and such that #{n∈N:λn=λ}=dimker(λ−A) for all λ∈σ(A).
Then with the notation ⊏ for “is a linear subspace of”
[TABLE]
Theorem C.2**.**
[Ka95, Theorem 6.29]*
Let A be a closed operator and μ∈ρ(A).
If Rμ is compact, then σ(A) consists of countably many eigenvalues with finite multiplicities and has no accumulation points. Moreover Rλ is compact for all λ∈ρ(A).*
Theorem C.3** (F. Riesz).**
[Ru91, Theorem 4.25]*
[9, Theorem VI.7.1]
Let R:H→H be a compact operator.
Then σ(R)∖{0}=σp(R), σ(R) is countable and has at most one limit point, namely [math]. If dim(H)=∞, then 0∈σ(R).*
Theorem C.4** (Riesz-Schauder theorem).**
[29, Theorem VI.15]**
Let A be a compact operator on H.
Then σ(A) is countable with no accumulation point except possibly [math].
Further, every λ∈σ(A)∖{0} is an eigenvalue of finite multiplicity.
Theorem C.5**.**
[Ru91, Theorem 12.29]*
If T:H→H is a normal operator and σ(T) is countable, then H=⨁λ∈σ(T)ker(λ−T).*
Lemma C.6** (Fischer’s principle).**
[23*, Section 28, Theorem 4, p. 318]555In this reference the operator is actually assumed to be compact and symmetric, but this is only done to guarantee that the spectrum is countable and ordered.
Suppose that σp(A)={λn:n∈N} and #{n∈N:λn=λ}=dimker(λ−A) for all λ∈σ(A).
If λn≤λn+1 for all n∈N, then*
[TABLE]
If λn≥λn+1 for all n∈N, then
[TABLE]
These theorems can be used to give a short proof of Theorem C.1.
For the most statements one can combine
Theorems C.2 and C.3.
(115) follows from
[TABLE]
as this implies that
λ−Rμ is boundedly invertible (or injective) if and only if μ−λ1−A is.
If Q is an inverse for μ−λ1−A then
[TABLE]
Therefore λ1(μ−A)Q is an inverse of λ−Rμ, as
[TABLE]
Vice versa if Q is an inverse λ−Rμ, then λQRμ is an inverse for μ−λ1−A.
Moreover, ker(μ−λ1−A)=ker(λ−Rμ).
Then (116) follows by applying Theorem C.5 to Rμ and observing that 0∈σ(Rμ) because dim(H)=∞ and (kerRμ)⊥=ran(Rμ)=D.
(117) and (118) follow from Lemma C.6.
∎
Definition C.7**.**
Let A:D(A)→H and B:D(B)→H be densely defined operators. We say that B is A-bounded when
(a)
D(A)⊂D(B),
2. (b)
There exist a,b≥0 such that for all φ∈D(A)
[TABLE]
The infimum of such a is called the relative bound of B with respect to A. If the relative bound equals [math], we say that B is infinitesimally small with respect to A.
Theorem C.8** (Hilbert-Schmidt theorem).**
[29, Theorem VI.16]**
Let A be a self-adjoint compact operator on H.
Then there is a complete orthonormal basis (ϕn)n∈N for H such that Aϕn=λnϕn and λn→0.
Theorem C.9** (The Kato-Rellich theorem).**
[29, Theorem X.12]**
Suppose A is self-adjoint, B is symmetric and B is A-bounded with relative bound a<1.
Then A+B is self-adjoint on D(A).
Furthermore, if σ(A)⊂[M,∞), then σ(A+B)⊂[M−max{1−ab,a∣M∣+b},∞) (where a,b are as in (119)).
Bibliography35
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] R. Allez and K. Chouk. The continuous anderson hamiltonian in dimension two. Preprint available at https://arxiv.org/abs/1511.02718 .
2[2] H. Bahouri, J.-Y. Chemin, and R. Danchin. Fourier analysis and nonlinear partial differential equations , volume 343 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer, Heidelberg, 2011.
3[3] M. Biskup and W. König. Long-time tails in the parabolic Anderson model with bounded potential. Ann. Probab. , 29(2):636–682, 2001.
4[4] G. Cannizzaro, P. K. Friz, and P. Gassiat. Malliavin calculus for regularity structures: the case of g PAM. J. Funct. Anal. , 272(1):363–419, 2017.
5[5] R. A. Carmona and S. A. Molchanov. Stationary parabolic Anderson model and intermittency. Probab. Theory Related Fields , 102(4):433–453, 1995.
6[6] X. Chen. Random walk intersections , volume 157 of Mathematical Surveys and Monographs . American Mathematical Society, Providence, RI, 2010. Large deviations and related topics.
7[7] X. Chen. Quenched asymptotics for Brownian motion in generalized Gaussian potential. Ann. Probab. , 42(2):576–622, 2014.
8[8] K. Chouk, J. Gairing, and N. Perkowski. An invariance principle for the two-dimensional parabolic Anderson model with small potential. Stoch. Partial Differ. Equ. Anal. Comput. , 5(4):520–558, 2017.