Approximation of eigenvalues of Schrödinger operators
J. F. Brasche1, R. Fulsche2
1Institut für Mathematik, Technische Universität Clausthal, Erzstraße 1, 30867 Clausthal-Zellerfeld, Germany 2Institut fur Analysis, Leibniz Universitat Hannover, Welfengarten 1, 30167 Hannover, Germany [email protected], [email protected]
DOI 10.17586/2220-8054-2018-9-2-145-161
It is known that convergence of l. s. b. closed symmetric sesquilinear forms implies norm resolvent convergence of the associated self-adjoint operators and thus, in turn, convergence of discrete spectra. In this paper, in both cases, sharp estimates for the rate of convergence are derived. An algorithm for the numerical computation of eigenvalues of generalized Schrödinger operators in L2(R) is presented and illustrated by explicit examples; the mentioned general results on the rate of convergence are applied in order to obtain error estimates for these computations. An extension of the results to Schrodinger operators on metric graphs is sketched. Keywords: Generalized Schrödinger operators, ¿-interactions, eigenvalues. Received: 15 December 2017 Revised: 18 December 2017
1. Introduction
Often, things become easier by passing to the limit. A striking example is provided by the one-dimensional Kronig-Penney model. Here, the Hamiltonian is the self-adjoint operator Hb = —A + b^^an6n in L2(R).
nez
If all coefficients an are positive, then, by Kato's monotone convergence theorem, the operators Hb converge in the strong resolvent sense to the Laplacian with Dirichlet boundary conditions at every point of Z, as the coupling parameter b tends to infinity. If the family (an)neZ is lower bounded by a positive constant, then the operators Hb converge in the norm resolvent sense with convergence rate O(1/b) [1, Example 3.8]. Moreover, if the family (1/an)neZ is summable, then the resolvents even converge w.r.t. the trace norm with convergence rate O(1/b) [2, Theorem 3.1]. While it is difficult to investigate the operator Hb, it is trivial to determine the spectral properties of the limit operator and results on the rate of convergence may be used for a discussion of the Hamiltonian Hb. We refer to [1-8] for a detailed analysis of large coupling convergence of regular and generalized Schrodinger operators as well as other kinds of operators.
Another important class of examples is provided by Schrodinger operators with singular potentials. If the potential V vanishes outside a very small vicinity of the closed null set N, then one expects that a replacement of the Hamiltonian —A + V by a suitably chosen self-adjoint operator H that coincides with —A on the space
(Rd \ N) only leads to a negligible error. Due to the fact that H is equal to the free Hamiltonian outside the null set N, it is often easier to investigate the operator H than the regular Schrodinger operator —A + V. The idea that the mentioned replacement only leads to small errors is supported by a large variety of convergence results. The most famous ones are results on point interactions; if the set N is finite and d = 2,3, then for every self-adjoint operator H in L2 (Rd) that coincides with — A on the space C~(Rd \ N), one can give potentials Vn such that the operators — A + Vn converge in the norm resolvent sense to H and the supports of the potentials Vn shrink to the set N [9].
Originally, point interaction Hamiltonians were introduced as an idealization of certain Schrodinger operators with short range potentials. In [10], one had the idea to use such operators for other purposes, too. One has shown that a large class of operators H can be approximated by point interaction Hamiltonians Hn. Since it is easy to compute the eigenvalues of the operators Hn, this fact may be used in order to compute the eigenvalues of H approximately. Later, a modification of the methods of [10] has led to an efficient algorithm for the numerical computation of eigenvalues of regular and generalized Schrodinger operators in L2(Rd), d = 2,3 [11]. In the subsequent article [12], these results have been extended to Schrodinger operators with magnetic potentials.
In the present paper, we shall concentrate on the one-dimensional case, where it is possible to obtain faster convergence with simpler algorithms. It was shown in [10] that weak convergence of measures implies norm resolvent convergence of the Schrodinger operators having these measures as potentials (cf. Theorem 1 below).
Based on this convergence result, we give a general construction for approximating finite signed measures p by pure point measures such that the operators -A + pn converge to -A + p. Since norm resolvent convergence implies convergence of the isolated eigenvalues and the eigenvalues of -A + pn can be computed efficiently, we end up with a general method for approximating the negative eigenvalues of Schrodinger operators with integrable potential on R. We provide error estimates for each step of the construction and proof.
This paper is organized as follows: In section 2 we recall some notation and preliminary results. Section 3 and 4 provide very general results: As it is well known convergence of l.s.b. closed symmetric sesquilinear forms implies convergence of the associated self-adjoint operators in the norm resolvent sense. In section 3, we derive an asymptotically sharp estimate on the rate of convergence. Norm resolvent convergence of self-adjoint operators implies convergence of the points in the discrete spectra. In section 4, we quantify this result. Section 5 gives results on the convergence of the sesquilinear forms for our concrete problem. In section 6, we discuss the actual construction of the approximating measures, including error estimates in terms of the Fourier transform. Section 7 shows an efficient way to compute negative eigenvalues of Schrodinger operators with pure point potentials. In section 8, we added a short discussion about existence results of negative eigenvalues for Schrodinger operators. Section 9 demonstrates our algorithm by two examples. In one of the two examples, we deal with a singularly continuous measure potential, which cannot be treated by the classical approximation methods. Finally, in section 10, we discuss how our method may be extended to Schrodinger operators on other 1-dimensional domains and explicitly show this for operators on [0, to).
2. Preliminaries
We will always denote by H a Hilbert space with inner product (•, •}, which is linear in the first and antilinear in the second component. For a sesquilinear form a on H with domain D(a) and for c G R, we denote by ac the form
D(ac) = D(a),
acXf,g) = a(f,g) + c(f,g).
If c is a lower bound of a, then a1-c is an inner product on D(a). Further, for f G D(a), we sometimes denote
a[f] := a(f, f).
The well-known Sobolev inequality for the Sobolev space HX(R) states that for each e > 0 and each f g Hx(R)
IIf Ill < e||f'111* + 4IIf 111*. (1)
Let p be a finite Radon measure on R, i.e. a finite signed measure on the Borel-a-algebra of R, B(R). Then, we define the sesquilinear form aM by
D(aM) = H X(R),
aM(/,g) = y f '(x)g'(x)dx + J fgd/j,
which is well known to be symmetric, lower-semibounded and closed. By -A + p, we denote the self-adjoint operator associated with the form in the sense of Kato's first representation theorem (cf. [13, Theorem 2.6], [14, Theorem VIII.15]), i.e. —A + p is the self-adjoint operator in L2(R) with
D(-A + p) C D(aM), ((—A + p)f, g) = af g) V/ G D(—A + p),g G D(aM). We say that a sequence (pn) of finite Radon measures on R converges weakly to the finite Radon measure p if
j /(x)dp„(x) ^ J /(x)dp(x), n ^ to,
for each f g Cb(R), where Cb(R) is the space of bounded continuous functions on R. In particular, the corresponding Fourier transforms, which are defined as
for a finite Radon measure v on R, converge pointwise. For a finite Radon measure we let ^ = — be the Hahn-Jordan decomposition and set = + If f is a measurable function, we define the measure /u, by
MB) = J fdM, B e B(R).
B
Xb denotes the indicator function of B e B(R). The following theorem plays a key role in this paper:
Theorem 1 ( [10, Theorem 3]). Let n e N, and ^ be finite Radon measures on R such that ^n ^ ^ weakly. Then, the operators —A + converge to —A + ^ in norm resolvent sense.
One goal of the next sections will be to quantify this theorem.
3. Form convergence and norm resolvent convergence
The fact that the convergence of sesquilinear forms with common domain implies norm resolvent convergence of the associated operators is well known, cf. [14, Theorem VIII.25]. The following theorem gives a quantitative result for this statement.
Theorem 2. Let A and B be self-adjoint and lower semi-bounded linear operators in H such that A > 1 and B > 1. Let a and b be the closed sesquilinear form associated with A and B, respectively. Assume that D(a) = D(b) =: D. If
then
s := sup |a(g,g) — b(g,g)| < 1,
gED, a(g,g)=1
IB-1 - A 111 <
Proof. For the whole proof, let f always be arbitrary in H, such that
1. Since B > 1,
B-1/|| < 1.
(2)
We set
Then, a(g, g) = 1 and therefore
g =
B-1f
■\Ja(B-1f, B-1f)"
|a(g,g) — b(g,g)| < s.
Further,
b(g,g)= .^fL <
B
1
<
1
a(B-1f, B-1f ) " a(B-1 f, B-1f) - a(B-1f,B-1f) by inequality (2). Since s > 1 — b(g, g), we can conclude
s > 1 -
1
a(B-1f, B-1f)
and therefore
a(B-1f, B-1f) <
1s
Using A > 1 (and therefore a > 1 as well), we get
B-1f — A-1f || < v^a(B-1 f — A-1f, B-1f — A-1f).
s
s
1
Denoting d = B-1/ — A-1/, we have
||B-1/ — A-1/|| < V«(d, d) = sup |a(d,h)|
a(h,h) = 1
= sup |a(B-1/,h) — (/,h>|
a(h,h) = 1
11
sup |a(B /, h) — 6(B-1/,h)|
a(h,h)=1
B-1/ hU b' B-1 /
sup
a(h,h)=1
a[B-1/]1/2' 7 Va[B-1/]1/2' 1
a[B-1 / ]
1 /11/2
< sup |a(c, h) — 6(c, h) | ._
a(c,c) = 1=a(h,h) V 1 — S
The well-known identity
sup |a(c, h) — 6(c, h)| = sup |a(h, h) — 6(h, h)|,
a(c,c)=1=a(h,h) a(h,h)=1
completes the proof. □
Remark 3. Observe that the above estimate is good in the sense that it is asymptotically sharp: In the trivial case a = (•, •> and 6 = (1 + s)a we have
iib—A-1 » = r+v
and the quotient of ||B-1 — A-1» and the upper bound for ||B-1 — A-1» in the above estimate tends to 1, as s tends to zero.
4. Convergence of isolated eigenvalues
A well-known consequence of norm convergence and norm resolvent convergence for self-adjoint operators is that it implies convergence of the discrete spectrum. The aim of the next two results is to quantify this result.
Lemma 4. Let S and T be bounded and self-adjoint operators in H satisfying ||S — T» < S for some S > 0. If
(E — 2S, E + 2S) n <r(S) = {E},
and E is an eigenvalue of S of multiplicity n G N, then
(E — S, E + S) n <r(T) C ad(T),
and the number, counting multiplicities, of eigenvalues of T in (E — S, E + S) is equal to n.
Proof. For each / g H and B g B(R) we use the notation p/,A(B) = ||xb(A)/1|2 for each self-adjoint operator A
on H. It is well-known that is a measure satisfying p/,A(R) = ||/1|2 and »(A — c)/1|2 = J |A — c|2dp/,A(A)
for c G R. Further, H decomposes into H = ran 1B(A) © ran 1R\B (A) for each B G B(R).
Now, let J = (E — S, E + S) and J = (E — 2S, E + 2S). The statement we want to prove is equivalent to
dim ran 1j (T) = n. We will prove this by contradiction.
Case 1: Assume dimran 1j(T) < n. Since dimker(S — E) = n > dimran 1j(T), there is some / G ker(S — E) with ||/» = 1 and / ± ran 1j(T). Hence
f (J ) = ||1j (T )/1|2 = (1j (T )2/,/ > =0
and thus,
||(T — E)/1|2 = J |A — E|2dM/,T(A) > J S2M/,T(A) = S2
This is a contradiction, since it would imply
»(T — S)/» = »(T — E)/ — (S — E)/» = »(T — E)/» > S.
Case 2: dimran 1j(T) > n. In this case, we can choose / G ran 1j(T) with ||/» = 1 and / ± ker(S — E). For this /, it holds / ± ranR\j (T) and hence
f (R \ J ) = ((1r\j (T ))2/,/ > =0.
22
Thus,
||(T — E)f ||2 = J |A — E|2dM/,T(A) < J S2dM/,T(A) = S2||f ||2. It is ran 1 j(S) = ker(S — E), since E is the only point in <r(S) n J. This implies
(J) = ((1j(S ))2f,f > =0,
and hence
||(S — E)f ||2 = J |A — E|2df(A) >J(2S)2dM/,s(A) = (2S)2||f ||2.
However, this is impossible, since it would imply
||(S — T)f|| = ||(S — E)f — (T — E)f|| > ||(S — E)f|| — ||(T — E)f|| > S. □
Recall the following result: Theorem 5 ( [15, Remark 2.1 and Theorem 3.1]). For every finite Radon measure ^ on R, it holds:
aess(—A + = [0, to). From the previous lemma, one can derive the following result, which is applicable to our setting:
Theorem 6. Let A, A be self-adjoint operators in H such that aess(A) = aess(A) = [0, to) and assume A, A > c
for some c < 0. Denote a = 1 — c and let S be such that 0 < S < —. Further, assume that
2a
||(A + a)-1 — (A + a)-11| < S,
and
(E — 2Sa(E + a) E + 2Sa(E + a)\ ,
( 1 + 2S(j^ + a)), 1— 2S(E + a/) n ^(A) = {E},
where E is an eigenvalue of A with multiplicity n e N. Then,
/ E — aS(E + a) E + aS(E + a)
V 1 + S(E + a^ 1 — S(E + a)
n a(Al) C ad(a4),
consists of finitely many eigenvalues of A and the number, counting multiplicities, of these eigenvalues is equal to n.
Proof. Apply the previous lemma to the resolvents (A + a)-1 and (A — a)-1 and use the spectral mapping theorem. □
In many applications, the minimum of the spectrum of A is an isolated eigenvalue with multiplicity one. Hence, it follows that the minimum of the spectrum of An is an isolated eigenvalue with multiplicity one for eventually every n, if the sequence (An) converges to A in the norm resolvent sense. Via the min-max principle, the rate of convergence of the lowest eigenvalue can be estimated directly with the aid of the associated sesquilinear forms:
Theorem 7. Let A and B be self-adjoint and lower semibounded linear operators in H such that A > 1 — c and B > 1 — c with c > 0. Let a and b be the closed sesquilinear forms associated with A and B, respectively. Assume that D(a) = D(b) =: D and
s := sup |a(g, g) — b(g,g)| < 1.
g£D, ac(g,g)=1
Further assume that E1(A) := min a(A) is a negative eigenvalue of A and E1(B) := min a(B) is a negative eigenvalue of B. Then
E1(B) < E1(A) + (E1(A) + c)s. (4)
Proof. Let f be a normalized eigenvector of A corresponding to the eigenvalue Ei(A). Then ac(f, f) = (E^A) + c). Put
.= f
g . VEi(A) + c'
Then, ac(g, g) = 1. By the min-max-principle,
min<r(B + cl) = min bc(h, h)
heD,||h|| = i
< bc(f,f ) = (Ei(A)+ c)bc(g,g)
< (Ei(A) + c)(ac(g, g) + s) = (Ei (A) + c)(1 + s),
and hence, Ei(B) = min ct(B) < Ei(A) + (Ei(A) + c)s < Ei(A) + cs. □
Remark 8. a) Of course, changing the roles of A and B, we also get a lower bound for Ei(B). b) The smaller c is, the better estimate (4) is. In general, the smallest c is not known. However, if one knows (approximately) Ei (A) and any constant c satisfying the hypothesis of the previous theorem and cs is sufficiently small, then one may use (4) repeatedly in order to obtain smaller and smaller constants c in the estimate (4) and hence better estimates for Ei (B).
5. Convergence of the sesquilinear forms
The aim of this section is to present a quantitative version of the result presented in Theorem 1 above.
Lemma 9 ( [10, Proof of Theorem 3]). Let м and мn, n G N, be finite Radon measures on R such that the sequence (^n) converges weakly to м. Then there exists a common lower bound c for aM and all aMn and
sup |(aM - )(g,g)| < 2 sup |(aM - )(g,g)|.
деИi(R),(aM)i_c(g,g) = 1 деН1(Ж),\\д\\н1(л) <1
Proposition 10 ( [10, Lemma 2]). Let v and м be finite Radon measures on R. Then, for each g G H 1(R)
/2 p> i 1/2 |g|2d(M - v)|<||g||Hi^(y |£(t) - ¿>(t)|2d^ .
R R
In particular, if the finite Radon measures on R converge weakly to м and the forms aMn have a common lower bound c, then the forms aMn converge to the form aM, and
4 if 1 2 \ 1/2
sup |«M(g,g) - aMn (g,g)|<^N |M(t) - />n(t)| dt — о
деи 1(R),(aM)i _c(g,g) = 1 t У
R
for n —у то.
The proposition provides an upper bound for the error one makes by truncating the potential. Corollary 11. Let м be a finite Radon measure on R and B с R be a Borel set. Then
K(g,g) - aXBM(g,g)| < 2||g||Hi H(R \ B) (5)
for every g G H 1(R). Proof. For every t G R
|/>(t) - Xbm (t)| = | J eitxlR\B (x)dM(x)| <|M|(R \ B),
R
and hence, the corollary follows from the previous theorem with v = 1B м. П
6. Weak approximation of measures by pure point measures
Given a finite Radon measure m on B(R), we want to give a constructive way to approximate it by pure point measures. For this, it is justified by Corollary 11 to assume that m has compact support. One can of course decompose m into a continuous and a discrete part,
M = Mc + Md,
w
where Md = ^ ajSXj for pairwise different xj e R, (aj) e ^1(N, R) and Mc has a continuous cumulative
j=1
distribution function FMc(x) = ^c((—ro, x]). Both parts will be approximated separately. First, observe that using
n
Mn = ^ aj SXj, one easily sees that ^n converges weakly to Md and the following error estimate for the Fourier
j=1
transforms of the measures follows directly:
w
|Md(t) — An(t)| < E |aj|.
j=n+1
Now, let us assume that the measure m is purely continuous. Further, assume that m is supported inside the interval [—K, K] for some sufficiently large K > 0. For convenience, we may assume that K e N. For N e N, we set
xf := —K + j, j =0,..., 2NK, jN
and
aN(m) := FM(xj) — FM(xj-1) = M(xj-1,xj), j = 1,..., 2NK
2NK
MN := af (M)SXN .
j=1 j
It is easy to verify that FMn converges pointwise to FM and hence mN converges weakly to m. The following proposition gives an error estimate in terms of the Fourier transforms:
Proposition 12. Let m be a finite Radon measure on R with supp(^) C [—K, K] and continuous cumulative distribution function and let mN be constructed as above. Let t e R \ {0} and e > 0. Choose N e N such that
1 n re2,,
N< 2M min{1, 2 }. Then
IM(t) — MN(t)| < e|M|(R).
n e2
Proof. First, observe that for given t = 0, Se(t) = min{1, —} is a possible choice of S for the uniform continuity of the function x ^ eitx and given e > 0. The result follows from the following computations:
IM(t) — MN(t)| = J eitXdM(x) — J eitXdMN(x)
R R
2NK
= / eitXdM(x) — ^^ M((xj-1,xj))
R j=1
2NK „
= |E / eitX — eiiXj dM(x)
j=1 (X ,X )
(Xj-1,Xj)
2NK
< E lgiiX — eitXj|d|M|(x) j=1i ^ / '
< e|M|(R).
□
Given any K > 0 and any S > 0, one can choose N such that |>(t) — >N(t)| < S for every t e [—K, K]. In fact, in the preceding proposition, one simply has to choose e > 0 sufficiently small and then N sufficiently large. For the final error estimate, we need not to give bounds for |>(t) — >N(t)|, but for the integral occuring in Proposition 10. This bound is discussed now. Observe that the assumption |mn|(R) < |m|(R) is always fulfilled for our construction.
Proposition 13. Let m and v be finite Radon measures on R with |v |(R) < |m|(R). Let K and e be any positive real numbers and suppose, in addition, that |>(t) — z>(t) | < e for every t in the interval [—K, K]. Then
1 1 |>(t) — >(t) |2dt < e2n + 8|m|(R)2 atan(-L) .
j 1 +t2l^v 7 v " - v 7
R
Proof. We use
-K K w
/Y+2|A(t) — i>(t)|2dt = / rhfl |A(t) — i>(t)|2dt ^ / 1+772 |A(t) — ¿>(t)|2dt + J |A(t) — ¿>(t)|2dt,
R -w -K K
and estimate the three integrals separately, where the estimates for the first and the third integral are identical. For the first integral
-K -K
/ T+2|>(t) — >(t)|2dt < (2|m|(R))2 | y^dt = 4|m|(R)2 (atan(—K) + |)=4|m|(R)2 atan (¿),
-w -w
and for the second integral
K K
/ T+2 |>(t) — v>(t) |2dt < e2 | dt < e2n.
-if -if
□
7. Eigenvalues of — A + E aj
j
Let x1 < x2 < ... < xk and aj e R for j = 1,2,..., k. As it is well known, the domain of the operator
k
—A + E ajSXj (using the notation x0 = —to and xk+1 = to) is given by
j=1
k k d( — A + E ajSx3) = {f e H 1(R) n 0 H2((xj,xj+1)); f'(xj+) — f'(xj —) = ajf (xj) for j = 1,..., k},
j=1 j=0
and the operator is just acting as f ^ —f''. As it can easily be seen, such operators can only have negative eigenvalues. For the readers convenience, we will now repeat an algorithm to find the eigenvalues of such an operator (cf. [9, proof of Theorem II 2.1.3]). Each eigenfunction fA for an eigenvalue A < 0 of the operators needs to be of the form
fA(x) = ajev + bje v , xj < x < xj+1
for some constants aj, bj e R. Since the function needs to be in L2(R), it is necessary that b0 = 0. By linearity, we may also assume a0 = 1 (since a0 = 0 would imply fA = 0). Such a function is in the domain of the operator (and hence an eigenfunction) if and only if it satisfies all the continuity and S-boundary conditions, i.e.
fA(xj + ) = fA (xj —), fA (xj + ) — fA (xj —) = aj fA (xj ), for j = 1,..., k (and ak = 0, which we will ignore for a short moment). Starting with a0 = 1, b0 = 0, these two conditions give a 2 x 2 system of linear equations at x1 for a1, b1, which one can easily solve. Continuing with the conditions at x2, one gets equations for a2, b2, and so on. In the end, one computes all the aj and bj such that the continuity and boundary-conditions are automatically fulfilled. However, in general, one will obtain ak = 0. One can easily see that A is an eigenvalue if and only if the ak obtained by this method is equal to 0 (only then we have fA e L2(R)). Hence, we consider the ak computed in the above manner as a function of A. This ak(A)
depends continuously on A < 0. The problem of finding a negative eigenvalue of — A + ^ aj 5Xj reduces to finding the zero of the continuous real-valued function ak(A), which may be solved numerically. Observe that the runtime of the evaluation of ak (A) depends only linearly on k (at each xj we need to solve a 2 x 2 system of linear equations).
8. Existence of negative eigenvalues
It is crucial for our approximation method that there exist negative eigenvalues of the approximating operator. Hence, we will add a short discussion about the existence of negative eigenvalues for operators — A + Recall (Theorem 5 above) that aess(—A + = [0, for each finite Radon measure In light of this result, for the existence of a negative eigenvalue of —A + it suffices to show that there is a function / e HX(M) with a^(/, f) < 0. This directly gives the following well known result, which we quickly prove for completeness.
Proposition 14. If the finite Radon measure ^ satisfies ^(R) < 0, then —A + ^ has at least one negative eigenvalue.
Proof. For N e N, consider the function /n as pictured in Fig. 1. For N large enough,
af ,/n )=/ |/N (x)|2dx + y |/n |2dM< 0.
R R
Fig. 1. The function /n
□
Remark 15. If ^ is a finite Radon measure with ^(R) < 0 and (^n) is a sequence of such measures converging weakly to then it is easy to see that ^n(R) < 0 for large n. In particular, if the approximation is good enough, then there exists a negative approximating eigenvalue of the Schrodinger operator — A + approximating — A + Therefore, under the assumption ^(R) < 0 our approximation scheme described above always works.
We will discuss some other results concerning the existence of negative eigenvalues here. First, we will recall some well known results extending the above Proposition 14 in some sense.
Theorem 16 ( [16, Lemma 8]). If V e C(R) with V(x) ^ 0 as |x| ^ ^ V ^ 0 and I V(x)dx < 0, then
R
—A + V has at least one negative eigenvalue.
Theorem 17 ( [17, Theorem 2.5]). Let V(x) be a measurable function such that / (1 + |x|2)|V(x)|dx <
J R
V ^ 0 and V (x)dx < 0. Then — A + V has at least one negative eigenvalue.
R
It is unknown to the authors whether the above two results extend to one-dimensional Schrodinger operators with measure potentials. If similar results for Schrodinger operators with point interaction potentials hold, this would increase the applicability of our method.
It is easy to construct a continuous function V e LX(R) such that / V(x)dx = 0 but / V(x)dx > 0
J R J[-c,c]
for all c > 0 and the assumptions for one of the above two theorems are fulfilled. Then, — A + V has a negative eigenvalue, but Proposition 14 is no longer sufficient to guarantee the existence of negative eigenvalues of the approximating Schrodinger operators. Hence, we will now discuss some other existence criteria for negative
eigenvalues of operators — A + ^ aj ^ which are not covered by the above results. Although we are particularly
j
interested in the case of finitely many point interactions, the same results hold in case for infinitely many point
w
interactions by the same proofs, i.e if we assume aj, xj e R for all j e Z, E |aj | < to and the sequence (xj )j
j = -w
is increasingly ordered. Nevertheless, we only formulate the results for finitely many point interactions.
Proposition 18. Let aj, xj e R for j = 1,..., n and assume x1 < x2 < ... < xn. Further, assume ak < 0 for some k e {1,..., n} and denote d- = xk — xk- and d+ = xk+1 — xk fwith d- = to for k =1 and d+ = to for k = n/ If
1 1
d- d+ k,
then — A + E] aj Sxj has at least one negative eigenvalue.
j=1
Fig. 2. The function fx
Proof. For d- , d+ < to consider fxfc as pictured in Fig. 2. Then
/ n 1 1
|fX k(x)|2dx+E a |fxk (xj)|2 = d- + + ak <
R j = k k
The cases d- = to or d+ = to work similarly. □
Proposition 19. Let aj, xj e R for j = 1,..., n and assume x1 < ... < xn. Further, assume ak < 0 for some k e {1,..., n}. If
^e-akXk + E aje-akXj + e-2akXk E ajeakX' < 0,
then — A + E] aj Sxj has at least one negative eigenvalue.
Proof. The function
f (x) = J e 2 , x < xk,
f I x I — \ ak
V 7 }e-akXke^X, x>xk,
is an eigenfunction of — A + akSxk to the eigenvalue — a. Hence,
2
aEj aj^xj (f,f)=y |f'(x)|2dx + ak|f(xk)|2 + E aj |f(x^)|2 + E aj |f(x,
R X j <X k X j >Xk
= ((—A + akSxk)f,f> + E aj|f(xj)|2 + E aj|f(x
X j <X k
X j >X k
= — T|f|2 + £ aj|f(xj)|2 + E aj|f(xj
X j <X k
X j >X k
= e-akXk + ^
aj e
akXj
+ e-2akXk E ajeakXj < 0.
X j <X k
X j >X k
□
2
2
2
9. Numerical examples
We want to continue with the presentation of two numerical examples. The following result will be useful to understand the examples, where N0(-A + m) denotes the number of negative eigenvalues of the operator -A + m (counting multiplicities).
Theorem 20 ( [15, Theorem 3.5]). Let m = m+ — m- be a finite Radon measure on R with corresponding Hahn-Jordan decomposition. Then
N(-A + M) < i + 1 |x —
2 m- (R)
9.1. Square well potential
The first example is well known, since it is essentially solvable. Hence, it will play the role of a test scenario. Consider the operator -A - X[-i,i], i.e. the Schrodinger operator with a square well potential. By Proposition 14 and Theorem 20,
2
1 < No(-A - x[-i,i]) < 1 + 3. Further, the only negative eigenvalue A satisfies -1 < A < 0 and the equation
t A A2
tan A = ---,
A
(see e.g. [18, Chapter 7.4]). By solving this equation numerically, one obtains
A « -0.453753165860328.
2N
For N € N we get the Nth approximating operator -A + ^ aN5xn given by
j=i j
xN = -1 + N j 2N; 1
N'
The negative eigenvalue for the Nth approximating operator, found by the procedure described in section 7 implemented in Matlab, can be seen in Table 1.
aN = , j = 1,..., 2N.
9.2. Cantor measure potential
The second example is supposed to show that our methods also work with respect to rather exotic potentials. Let mc be the Cantor measure, i.e. the measure which has the Cantor function as its cumulative distribution function. We want to find eigenvalues of the operator - A - mc . Using again Proposition 14 and Theorem 20 one gets
1 < No(-A - mc) < 1 + 1,
i.e. the operator has exactly one negative eigenvalue. While it is possible to approximate this eigenvalue of -A - mc by the method described in section 6, we modify the approach here to obtain better results for this particular case. As it is well known, the Cantor set can be obtained as the limit set of a procedure of removing middle third intervals. Inspired by this, one can construct the Cantor measure easily as the limit of a sequence of pure point measures as follows: Let mn be the measures defined by (cf. Fig. 3)
A0 = {1,
An = {x € An-i} u{ 1 - x € An-i}, N € N
MN = 2N E <*x, N € N.
x£An
It is easy to show that the mn converge to mc weakly for N ^ to, e.g. by proving that the cumulative distribution functions converge pointwise. Hence, the negative eigenvalues of the operators -A - mn converge to the eigenvalue of -A - mc. The numerically computed eigenvalues of -A - mn can be seen, for some N, in Table 2. We will not give a full discussion of the error estimate of this modified method here, but we will compute
Table 1. Approximation of eigenvalue of — A — X[-i,i]
N Eigenvalue
1 —0.545877203227244
2 —0.474617739449437
3 —0.462861650386081
4 —0.458844821756164
5 —0.457002447176188
10 —0.454562375073084
25 —0.453882500447814
50 —0.453785494551346
75 —0.453767533759611
100 —0.453761247723386
1000 —0.453753246677936
10000 —0.453753166668506
100000 —0.453753165868416
1000000 —0.453753165860430
A —0.453753165860328
Si
2
1 2 Si 6 ±(55 z 6
4 18 4 18 {Sis 4 18 4 18
7(5 1 77<5 5 > 54 5 54 ^ bs 13 17 o 54 O 54 ^ d»- 1 8 ¿37 4(541 54 ° 54 J» "5" (5 49 ¿¿53 o 54 O 54
Fig. 3. Construction of the measures an for N = 0,1,2,3. The thick black bars are the intervals in the Nth step of the construction of the Cantor set.
Ac (t) — An (t) in the appendix, which is the crucial step needed for deriving an error estimate (beside the general theory developed above).
10. Extension to other 1-dimensional domains
In this section, we will discuss how to extend Theorem 1 and our approximation method to Schrodinger operators on L2([0, Essentially the same ideas work for operators on L2(0,1) or to some extend even on finite metric graphs (cf. [19] for an introduction to this topic), but we will only discuss the case [0, in detail. As it is well known, the self-adjoint realizations of the Laplacian on L2([0, can be parametrized by a e [0, n)
Table 2. Approximation of eigenvalue of —A —
N Eigenvalue of —A —
1 —0.25
2 —0.190826516988754
3 —0.182601523317952
4 —0.181236785438422
5 —0.181005430450725
10 —0.180958390783868
15 —0.180958384580303
20 —0.180958384579497
through the boundary conditions
D(-Aa) = {/ G H2([0, to)); cos(a)/(0) + sin(a)/'(0) = 0}, -Aa / = -/''.
The sesquilinear form aa associated to —Aa is given by
D(a£) = H 1([0, to)),
for a = 0 and
«a(/, 9) = J /'(x)g'(x)dx - cot(a)/(0)g(0)
[0,œ)
D(a0) = H1([0, to)),
a 0 (/,9)
/ '(x)g'(x)dx.
[0,œ)
Throughout this section, we assume that all occuring measures are finite Radon measures on [0, to), i.e. finite signed measures on B([0, to)). Without loss of generality, we may assume that the measures have no point mass at 0 (this would only change the boundary condition and not the action of the resulting Schrodinger operator). For such a measure ^ we define the Schrodinger operator with boundary conditions corresponding to a e [0, n) and potential —Aa + as the operator associated to the form a^
D(a*) = D(a£),
9) = «a 9) + J /"g^
[0,œ)
in the sense of Kato's first representation theorem, where it can easily be seen that a^ is a small form perturbation of a^/2 (or of a0 if a = 0) using the Sobolev inequality
V/ G Hx([0, to)) Ve > 0 :
Cell
nh + 41
\h.
(6)
Of course the term boundary conditions should not be taken too seriously in this setting - e.g. if ^ has a singular continuous part in the vicinity of 0, it is completely unclear if the functions in the domain actually fulfill the boundary condition. In what follows we say, in natural analogy to the case of measures on R, that measures on [0, to) converge weakly to the measure ^ on [0, to) if
J /d^n ^ J /d^,
for all bounded and continuous functions / on [0, to).
a
2
OJ
Theorem 21. Let n e N and m be finite Radon measures on [0, to) without point mass at 0. If the Mn converge weakly to m, then —Aa + Mn converge to —Aa + m in the norm resolvent sense.
Proof. Using the general theory, it suffices again to prove that the corresponding sesquilinear forms converge. Further, it can be shown in the same manner as on R (cf. Lemma 9 above and the proof in [10]) that we only need to show that
sup
f £D(aa),||fiihIQO,^))^1
2d(^ — Mn)
0
[0,to)
for n ^ to. Now observe that each function / e H 1([0, to)) with ||/||Hi([0,TO)) < 1 can be continued to a
function / e H 1( is by setting
such that ||/||Hi(R) < c, where c is a constant independend of /. One way of achieving this
'/(x), x > 0,
/(x)=<( /(0)x + /(0), —1 < x < 0, 0, x < — 1
and
IIH i(
0 0 = ||/||Hi([0,^)) + / 1/(0)x + /(0)|2dx + J |/(0)|2dx
-1 -1
< 1+31/(0)i2 < 1+4 h/m
<1 + 3 h/hhi([O,to))
11 Y'
For a measure v on [0, to), we denote by v* the measure extended to R by setting it to 0 on (—to, 0). Then
sup
f £D(a„),||f||h1
([0,~))
<1
|/|2d(^ — ^n)
sup
[0,to)
f £D(a„),||f ||h1
h1([O,~))
<1
1
< — sup
c geff1(R),||g||ffi(K)<1
|/|2d(M* — ^n) J |g|2d(M* — M
[0,to)
As ^n ^ M* weakly, this finishes the proof since the last quantity is known to converge to 0 by the results on R. □
Remark 22. a) Using the same idea, i.e. extending functions from H 1([0,1]) uniformly to functions in H 1(R), one can prove the corresponding theorem for Schrodinger operators on L2([0,1]). Even further, by the same method one gets the same result for Schrodinger operators on arbitrary finite metric graphs. b) Using a construction analogous to the one on R, one can easily construct pure point measures on [0, to) approximating a given finite Radon measure m on [0, to) weakly.
n
It remains to discuss the method of computating the eigenvalues of — Aa + ^ & Sxj analogous to the method
j=1
discussed in section 7. We may assume that the xj are ordered increasingly, 0 < x1 < ... < xn, and & e R. One
can check that the operator acts as / ^ —/'' a.e. and that the functions in its domain fulfill the
j
boundary conditions cos(a)/(0) + sin(a)/'(0) = 0 and the usual continuity and S boundary conditions at all xj. Then, each eigenfunction / for an eigenvalue A < 0 has the form
/a(x) = aje"/-^ + bje-^-^, xj--1 < x < xj,
(with x0 = 0 and xn+1 = to) for coefficients aj, bj e R, j = 0,... ,n. As in the case on the whole line, such a function is an eigenfunction (and hence A an eigenvalue) if and only if an = 0 and it fulfills all boundary conditions. Therefore, let us consider the case a0 = 0, from which we may assume a0 = 1. Then, the boundary conditions at 0 uniquely determine b0. We may now continue as we know it from section 7, computing iteratively the values of aj and bj from the values of aj-1,bj-1 and the boundary and continuity conditions at xj. At the
c=
end, we get an = an(A) as a continuous function of A and only need to find zeroes of this continuous real-valued function.
n
We still need to deal with the case a0 = 0. It is easy to verify that for a = 0, — this never leads to a valid eigenfunction (and hence not to an eigenvalue). Further, if n =1, one can also check that this never results in an
eigenvalue. It is unknown to the authors if this case may lead to a negative eigenvalue of — Aa + ^ Pj5Xj for any
j
n
choice of Pj and xj. Anyway, this is not a problem: If a = 0, —, then we just consider the case a0 = 0, b0 = 1
separately. From the boundary conditions, one imediately gets A = —(cot(a))2, hence we only need to check one more value of A. Iterating now over all xj, one can quickly check if this A is an eigenvalue (again, by checking if
a„(A) = 0).
Remark 23. a) With the same concept, it is possible to find eigenvalues of —A + ^^a.jSXj on L2([0,1]) (with
j
suitable boundary conditions). Of course one can (and will) in this case also get eigenvalues > 0. Here, one also has to use a suitable Ansatz for the eigenfunctions of non-negative eigenvalues.
b) This approach to find eigenvalues of —A + ^^ a.jSXj will not directly work on most metric graphs. But on
j
certain classes of metric graphs, there are substitutional methods available for computing eigenvalues of Laplacians
(and eigenvalues of — a^Xj are just eigenvalues of a Laplacian on a metric graph with a few more vertices).
j
If such a method exists, our method for approximating eigenvalues of — A + a and the error estimates also work.
Appendix: Cantor measure and Fourier transform
Let ac be the Cantor measure and
1
x£An
be the Nth approximating measure, as described above. We want to compute Ac (t) — An (t). Denoting
An = 2n E sx
1 N 1
Sn = {! + E - j; - e{—1,1}N}
j=i
we are first going to show that AN = SN for N = 1,2,3,.... This will follow by induction. For N =1 the relation is obvious. Hence, assume that SN = AN. It suffices to prove AN+1 c SN +1, since clearly |An+i| = 2N+1 = |Sn+i|. Let x e An+i. Then either
y y
x = — or x = 1--
3 3
for some y e AN. Assume the first case is true (the other case can be dealt with in the same way). Then, since An = SN, for some - e {—1,1}N
1 + VN — -i 1 N 1 1 1 N 1 1 N+i 1
2 + ^j=i 33 1 , V^ 1 1 1 , V^ 1 1 , ~ 1 o
x =-3-= 6 + E 3+" = 2 — 3 + E3j+i = 2 + E 3j e Sn+i
j=i j=i j=i
with
- = (—1,-i,-2,...,-N) e {—1,1}N+i
and therefore x e SN +i.
In what follows, we will need the following trigonometric identity:
N 1
J|cos(^j) = E cos(-i^i +-----+ -N), for ¥>j e R, j = 1,..., N. (7)
j=i CTe{-i,i}N
The case N = 2 of this identity is a direct consequence of the angle sum identity for cosine, the general case follows easily by induction.
Now, we will compute the Fourier transform of an :
An(t) = E ^(t) = ^N E eiiX
xgsn xgsn
= _L e 1 it E giiC^li)
1 i it -1> 2 "
2N
e 2 it ^ eit(CT1i + ^232 +-----3N) + e-it(^1i + ^232 +-----+&N 3N )
CT£{-i,i}N ,0-N = i
2N-T e 2 " E COS (t(ai a2 j[2 + ••• + -i 3N-T + 3N ))
CT£{-i,i}N =i
1 1 it v^ 1 f 1 1 1 1
e2 it > - cos
E 2 (COs (t(a! 3 + a2 32 + • • • + -i3N-t + 33N))
= i
/ /11 1 1 ^
+ COs ( - t(CT! 3 + a2 + •• • + ^N-i 3^ + ^N 3^ )) J
1 1 v"^ ( t t t
= 2Ne2 E cos 3+ a232 + ••• + 3N
N
= '1" II «»(j) •
j=i
Here, we used formula (7) in the last step. Summarizing, we get
N t An (t) = e1" I cosj •
j=i
Since the an converge weakly to ac, the Fourier transforms converge pointwise. We get the well-known result
to t
Ac (t)= e1 " n co^(^) •
j=i
Observe that it seems, in light of the form of the Fourier transforms, that the most natural way to construct the Cantor measure actually may be as the limit of the measures an. For the difference Ac (t) - AN (t) we get
N t w -TO / t- ■
Ac (t) - An (t) = e1 "J] cos j ( JJ cos j - 1
j=1 j=N +1
which converges fast to 0 uniformly on compact intervals. Acknowledgements
Work supported by DFG grant Br1686/3-1. J. Brasche thanks the ITMO University of St. Petersburg for their hospitality.
References
[1] BelHadjAli H., BenAmor A., Brasche J. Large Coupling Convergence: Overview and New Results. In Partial Differential Equations and Spectral Theory (Demuth M., Schulze B.-W., Witt I., editors), volume 211 of Operator Theory: Advances and Applications, pp. 73-117. Springer Basel, Basel, 2011.
[2] Brasche J. On large coupling convergence within trace ideals. Methods Funct. Anal. Topology, 2014, 20, P. 3-9.
[3] Belgacem F., BelHadjAli H., BenAmor A., Thabet A. The Robin Laplacian in the large coupling limit: Convergence and spectral asymptotic. available on arXiv: 1511.06086.
[4] BelHadjAli H., BenAmor A., Brasche J. On trace and Hilbert-Schmidt norm estimates. Bull. London Math. Soc., 2012, 44, P. 661-674.
[5] BelHadjAli H., BenAmor A., Brasche J. Large coupling convergence with negative perturbations. J. Math. Anal. Appl., 2014, 409, P. 582-597.
[6] Ben Amor A., Brasche J. Sharp estimates for large coupling convergence with applications to Dirichlet operators. J. Funct. Anal., 2008, 254, P. 454-475.
[7] Brasche J., Demuth M. Dynkin's formula and large coupling convergence. J. Funct. Anal., 2005, 219, P. 34-69.
[8] Grubisic L. Relative Convergence Estimates for the Spectral Asymptotic in the Large Coupling Limit. Integral Equations Operator Theory, 2009, 65, P. 51-81.
[9] Albeverio S., Gesztesy F., H0egh-Krohn R., Holden H. Solvable Models in Quantum Mechanics. AMS Chelsea Publishing, 2nd edition, 2005.
[10] Brasche J., Figari R., Teta A. Singular Schrodinger Operators as Limits Point Interaction Hamiltonians. Potential Anal., 1998, 8, P. 163178.
[11] Brasche J., Ozanova K. Convergence of Schrodinger Operators. SIAM J. Math. Anal., 2007, 39, P. 281-297.
[12] Ozanova K. Approximation by point potentials in a magnetic field. J. Phys. A: Math. Gen., 2006, 39, P. 3071-3083.
[13] Kato T. Perturbation Theory for Linear Operators. Springer, 2nd edition, 1976.
[14] Reed M., Simon B. Methods of Modern Mathematical Physics 1: Functional Analysis. Academic Press, 1972.
[15] Brasche J., Exner P., Kuperin Y., Seba P. Schrodinger Operators with Singular Interactions. J. Math. Anal. Appl., 1994, 184, P. 112-139.
[16] Schmincke U.-W. On Schrodinger's factorization method for Sturm-Liouville operators. Proc. Roy. Soc. Edinburgh Sect. A, 1978, 80, P. 67-84.
[17] Simon B. The Bound State of Weakly Coupled Schrodinger Operators in One and Two Dimensions. Ann. Phys., 1976, 97, P. 279-288.
[18] Gustafson S., Sigal I. Mathematical Concepts of Quantum Mechanics. Springer, 2nd edition, 2011.
[19] Berkolaiko G., Kuchment P. Introduction to Quantum Graphs, volume 186 of Mathematical Surveys and Monographs. American Mathematical Society, 2013.