This paper introduces the essential numerical range for unbounded operators on Hilbert spaces, exploring its properties, differences from the bounded case, and its role in spectral pollution during approximation methods.
Contribution
It defines and studies the essential numerical range for unbounded operators, revealing new phenomena and its application in spectral pollution analysis.
Findings
01
Essential numerical range captures spectral pollution.
02
Many properties from bounded case do not extend to unbounded operators.
03
Provides new characterizations and perturbation results for $W_e(T)$.
Abstract
We introduce the concept of essential numerical range We(T) for unbounded Hilbert space operators T and study its fundamental properties including possible equivalent characterizations and perturbation results. Many of the properties known for the bounded case do \emph{not} carry over to the unbounded case, and new interesting phenomena arise which we illustrate by some striking examples. A key feature of the essential numerical range We(T) is that it captures spectral pollution in a unified and minimal way when approximating T by projection methods or domain truncation methods for PDEs.
Equations395
σe(T):={λ∈C:∃(xn)n∈N⊂D(T) with ∥xn∥=1,xn→w0,∥(T−λ)xn∥→0},
σe(T):={λ∈C:∃(xn)n∈N⊂D(T) with ∥xn∥=1,xn→w0,∥(T−λ)xn∥→0},
We(T):={λ∈C:∃(xn)n∈N⊂D(T) with ∥xn∥=1,xn→w0,⟨Txn,xn⟩→λ}.
We(T):={λ∈C:∃(xn)n∈N⊂D(T) with ∥xn∥=1,xn→w0,⟨Txn,xn⟩→λ}.
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
The essential numerical range for unbounded linear operators
Sabine Bögli
Department of Mathematics, Imperial College London, South Kensington Campus, London SW7 2AZ, UK
We introduce the concept of essential numerical range We(T) for unbounded Hilbert space operators T
and study its fundamental properties including possible equivalent characterizations and perturbation results.
Many of the properties known for the bounded case do not carry over to the unbounded case,
and new interesting phenomena arise which we illustrate by some striking examples. A key feature
of the essential numerical range We(T) is that it captures spectral pollution in a unified and minimal way
when approximating T by projection methods or domain truncation methods for PDEs.
The main object of this paper is the essential numerical rangeWe(T) which we introduce for unbounded operators T in a Hilbert space.
This concept is of great importance in the spectral analysis of non-normal operators and, in particular, in the numerical analysis of differential operators and approximations thereof. Our principal results include the analysis of several alternative, but only partly equivalent characterizations of We(T), a series of perturbation theorems, and results showing that We(T) captures spectral pollution in a unified and minimal way when
T is approximated by projection and/or domain truncation methods. Diverse examples and applications, e.g. to non-symmetric strongly elliptic PDEs, illustrate the sharpness and wide range of applicability of our results.
There are good reasons for the long time elapsed between this article and the first papers on the essential numerical range for bounded operators,
dating back to Stampfli and Williams [40] in 1968 and subsequent joint work with Fillmore [17].
The unbounded case is significantly different from the bounded case in several respects. We show that definitions which are equivalent in the bounded case may yield very different sets in the unbounded case. It was not clear at the outset which would be most appropriate to regard as the canonical essential numerical range. Moreover, none of the usual tools such as graph norms or mapping theorems can be used to reduce the unbounded case to the bounded case, so that a gamut of new ideas and tools had to be developed. The pay-off has exceeded our most optimistic expectations, both on the abstract level and for applications.
The original idea of the essential numerical range was to give a convex enclosure of the essential spectrum, just as the (closure of the) numerical range gives a convex enclosure for the approximate point spectrum. However we became interested in the essential numerical range also because of an ambitious aim to establish an abstract tool for capturing spectral pollution, independent of the particular type of approximation method and not limited to special operator classes such as selfadjoint, close-to-selfadjoint, or second-order-differential. The key connection between the essential numerical range We(T) and spectral pollution is the new concept of limiting essential numerical range (Definition 5.5 below).
Some of the earliest descriptions of the phenomenon of spectral pollution were motivated by finite element approximations in plasma physics, see, e.g. [35, 1, 22], which analysed sequences of eigenvalues of the approximating problems converging to a limit that is not a true eigenvalue. Already there it was noted that such spurious eigenvalues can only occur in gaps of the essential spectrum of the selfadjoint operators considered. An interesting reverse perspective on spectral pollution is that approximating large, finite-domain PDE problems by infinite-domain problems may result in a loss of spectral information, with the lost spectrum being termed absolute spectrum in [34, 38].
Although a substantial literature on spectral pollution is now available, most of it concerns selfadjoint operators
and deals with particular methods to approximate spectra such as projection and/or domain truncation methods, see, e.g. [10, 8, 31, 30, 14, 29, 24]; some works discuss methods to avoid spectral pollution, while others try to characterize the sets in C in which spectral pollution may be present. Dauge and Suri [11, 12] follow Descloux [15] to circumvent the unboundedness in their selfadjoint problems by considering a concept of essential numerical range with respect to a coercive form (a change of topology); their essential numerical range is then the convex hull of the essential spectrum. The only step away from selfadjointness without recourse to perturbation arguments, is the generalization of the classical Titchmarsh-Weyl nesting analysis for M-functions of Sturm-Liouville operators to non-selfadjoint cases in [9].
While the main applications presented concern spectral pollution, we emphasize that this article is really about the essential numerical range itself. In the first part, we start in Section 2 by fixing our definition for the concept of essential numerical range
and examining fundamental issues, including geometric properties related to the numerical range and the question of when We(T) is empty,
which can only occur for unbounded operators. In Section 3, our first main result, Theorem 3.1, introduces
four further possible definitions of essential numerical range. Unlike the case of bounded operators studied by Fillmore, Stampfli and Williams [17], Salinas [37], Pokrzywa [32, 33] and Descloux [15], in general these are not the same and the conditions under which at least some of them coincide are non-trivial. For example, an important role is played by the domain intersection D(T)∩D(T∗) which, even for m-accretive operators, can be anything from {0} to a dense set, see [2]. We study the relationship between the essential numerical range and the convex hull of the
various different types of essential spectrum. In general, the latter may be a much smaller set and only in particular cases,
e.g. if the operator is selfadjoint and semibounded, do they coincide; for non-semibounded selfadjoint operators, We(T)
coincides with the convex hull of the extended essential spectrum of Levitin and Shargorodsky [29].
In Section 4 we derive several perturbation results and describe some startling examples
showing that some results which one may have expected to be true, are actually false, see, e.g. Remark 4.2 and Example 4.3.
We also establish some useful results which may be used to compute the essential numerical range when an operator can be decomposed into real and imaginary parts.
In the second part of our paper, Section 5 introduces the notion of limiting essential numerical range for a sequence of operators
(Tn)n∈N, which is
even new in the bounded case, and derives conditions on approximation methods under which it coincides with the essential numerical range of the approximated operator T. Section 6 studies spectral pollution arising from approximation of operators by projection methods in a Hilbert space, while
studies approximation by domain truncation of strongly elliptic, not necessarily selfadjoint partial differential operators on domains in
Rd. Here our main results, Theorems 6.3 and 7.1, describe how closely the essential numerical range captures spectral pollution, without any recourse whatsoever to hypotheses of selfadjointness or perturbation-from-selfadjointness.
This is illustrated by applications to non-selfadjoint neutral delay differential equations and differential equations with non-real essential spectrum
of advection-diffusion type.
Throughout this paper we denote by H a separable infinite-dimensional Hilbert space.
The notations ∥⋅∥ and ⟨⋅,⋅⟩ refer to the norm and scalar product of H.
Strong and weak convergence of elements in H is denoted by xn→x and xn→wx, respectively.
By L(H) we denote the space of all bounded linear operators acting in H, and by C(H) the space of all closed linear operators in H.
Norm and strong operator convergence in L(H) is denoted by Tn→T and Tn→sT, respectively.
Identity operators are denoted by I; scalar multiples λI are written as λ.
The domain, range, spectrum, point spectrum and resolvent set
of an operator T in H are denoted by D(T), R(T), σ(T), σp(T), ϱ(T), respectively,
and T∗ denotes the Hilbert space adjoint of T;
note that whenever we assume that an operator has non-empty resolvent set, the operator is automatically closed.
The numerical range is W(T):={⟨Tx,x⟩:x∈D(T),∥x∥=1}.
For non-selfadjoint operators there exist (at least) five different definitions for the essential spectrum which all coincide in the selfadjoint case; for a discussion see Edmunds and Evans [16, Chapter IX].
Here we use
[TABLE]
which is σe,2 in [16].
Following Kato [26, Section V.3.10], we call a linear operator T in H
sectorial if W(T)⊂{λ∈C:∣arg(λ−γ)∣≤θ} for some sectoriality semi-angle θ∈[0,π/2) and sectoriality vertex γ∈R. T is m-sectorial if, in addition, λ∈ϱ(T) for some (and hence all) λ∈C\W(T).
For a sesquilinear form t in H with domain D(t), sectoriality is defined analogously.
A subspace D⊂D(T) is called a core of a closable operator T if T∣D is closable with closure T; a core of a closable sequilinear form is defined analogously, see [26, Sections III.5.3, IV.1.4] (note that here we do not restrict ourselves to sectorial forms).
For a subset Ω⊂C we denote its interior by intΩ, its convex hull by convΩ, its complex conjugated set by Ω∗:={z:z∈Ω}, and the distance of z∈C to Ω by dist(z,Ω):=infw∈Ω∣z−w∣. Finally, Br(λ):={z∈C:∣z−λ∣<r} is the open disk of radius r around λ∈C.
2. The essential numerical range of unbounded operators
The essential numerical range We(T) was introduced by Stampfli and Williams in [40] for a bounded linear operator T
in a Hilbert space H as the closure of the numerical range of the image of T in the Calkin algebra, We(T):=⋂{W(T+K):Kcompact}. Various equivalent characterizations were established in the sequel in [17]. It is immediate from the definition that We(T) is a compact convex subset of C, and one can show that We(T)=∅ in the bounded case.
The generalization to the unbounded case is not as straightforward as one might expect and leads to interesting new phenomena. In particular,
for some characterizations seemingly obvious generalizations might fail; e.g. in the original definition one cannot replace compact perturbations by relatively compact ones. Moreover, the different characterizations are no longer equivalent in general and some questions only arise in the unbounded case, e.g. when is We(T)=∅.
In the unbounded case, the characterization established in [17, Theorem (5.1) (3)] turns out to be a good starting point.
Note that in general, if not stated otherwise, we consider unbounded linear operators T that do not need to be closable or closed.
Definition 2.1**.**
For a linear operator T with domain D(T)⊂H
we define the essential numerical range of T by
[TABLE]
Clearly, We(T)⊂W(T) by definition and We(zT)=zWe(T) and We(T+z)=We(T)+z for z∈C.
Our first aim is to investigate the equivalence of other possible definitions of We(T), including the original one in [40], see Theorem 3.1. To this end we need some geometric properties of We(T), which are of independent interest.
First we show that We(T) continues to be closed and convex in the unbounded case. Secondly,
we investigate some relations between the geometry of the numerical range W(T) and that of We(T);
they will also provide criteria for We(T) to be unbounded or non-empty.
Proposition 2.2**.**
The essential numerical range We(T) is closed and convex, and convσe(T)⊂We(T).
Proof.
The closedness of We(T) follows by a standard diagonal sequence argument.
To show that We(T) is convex, let λ,μ∈We(T). Then there
exist two sequences (xn)n∈N, (yn)n∈N⊂D(T)
with ∥xn∥=∥yn∥=1, xn→w0,
yn→w0 as n→∞ and
[TABLE]
Let t∈[0,1] and ν:=tλ+(1−t)μ∈conv{λ,μ}.
For n∈N, denote by Pn:H→span{xn,yn} the orthogonal projection in H onto
span{xn,yn} and define the compression Tn:=PnT∣R(Pn).
Since ⟨Txn,xn⟩,⟨Tyn,yn⟩∈W(Tn) and
the latter is convex, there exists
zn∈R(Pn) with ∥zn∥=1 and
[TABLE]
Now xn→w0, yn→w0 as n→∞
and ∣⟨xn,yn⟩∣<1/n, n∈N, imply
zn→w0 as n→∞ and so ν∈We(T).
The inclusion σe(T)⊂We(T) is immediate from the definitions
and so the last claim follows since We(T) is convex.
∎
Next we give criteria for We(T)=∅ in terms of the numerical range.
It turns out that the case where W(T) is a half-plane is different from all others, see Corollary 2.5 and Example 2.5.
Proposition 2.3**.**
If W(T) is a line or a strip or if W(T)=C, then We(T)=∅.
In particular, We(T)=∅ if T is densely defined and not closable.
Proof.
In the case when W(T) is a strip, or a line which we regard as a special case of a strip of zero width, we can always assume without loss of generality that W(T) is a strip containing R.
Let (xn)n∈N⊂D(T) with ∥xn∥=1 and xn→w0 as n→∞. If (⟨Txn,xn⟩)n∈N is bounded, then it has a convergent subsequence whose limit belongs to We(T) and hence We(T)=∅.
If (⟨Txn,xn⟩)n∈N is unbounded, we can assume without loss of generality that
0<Re⟨Txn,xn⟩→∞ in all cases. To prove the existence of some λ∈We(T),
we proceed in (at most) two steps, one to control the real part and, in the case when W(T)=C, one for the imaginary part.
Since W(T) is either a strip containing R or W(T)=C, we can choose (yn)n∈N⊂D(T) with ∥yn∥=1 and
[TABLE]
It is not difficult to verify that, for every n∈N there exists θn∈[0,2π) such that
[TABLE]
Define
[TABLE]
Then rn→0 and hence ∥un∥→1 and un→w0 as n→∞.
Moreover,
[TABLE]
Now, with xn′:=un/∥un∥, n∈N, it is easy to see that ∥xn′∥=1 and xn′→w0 as n→∞.
If ⟨Txn′,xn′⟩=⟨Tun,un⟩/∥un∥2∈iR, n∈N, are uniformly bounded, then again We(T)=∅. This is always the case if W(T) is a strip and hence the proof is complete in this case.
So it remains to consider the case that W(T)=C and ⟨Txn′,xn′⟩∈iR, n∈N, is not uniformly bounded,
without loss of generality ⟨Txn′,xn′⟩→i∞ as n→∞.
Since W(T)=C, there exists (yn′)n∈N⊂D(T) such that ∥yn∥=1 and
[TABLE]
One may check that, for every n∈N, there exist unique θn′∈[0,2π), rn′>0 with
[TABLE]
Using the last convergence in (2.1), we deduce that rn′→0 as n→∞.
Now define un′:=xn′+rn′eiθn′yn′ and vn:=un′/∥un′∥ for n∈N.
Then it is straightforward to check that ∥vn∥=1, vn→w0 and
⟨Tvn,vn⟩=0, n∈N; hence 0∈We(T).
The last claim is immediate from the first claim and the fact that if T is densely defined and W(T)=C, then T is closable, see
[26, Thm. V.3.4].
∎
Proposition 2.4**.**
If there exist z∈We(T) and w∈C\{0} with z+w(0,∞)⊂W(T), then z+w[0,∞)⊂We(T).
Proof.
Without loss of generality take z=0 and w=1, which can always be arranged by shift of origin and rotation.
Hence there exists (xn)n∈N⊂D(T) with ∥xn∥=1, xn→w0 and ⟨Txn,xn⟩→0 as n→∞.
Let λ∈[0,∞) be arbitrary.
By the assumption (0,∞)⊂W(T), there exists (yk)k∈N⊂D(T) with ∥yk∥=1 and 0<⟨Tyk,yk⟩→∞.
Since xn→w0 as n→∞, we can choose a strictly increasing sequence (nk)k∈N⊂N such that
[TABLE]
Now define
[TABLE]
with rk≥0 and θk∈[0,2π) such that
[TABLE]
Note that rk→0 since ⟨Tyk,yk⟩→∞, and hence ∥uk∥→1, uk→w0 as k→∞.
By direct calculation,
[TABLE]
and the latter converges to λ by ⟨Txnk,xnk⟩→0, rk→0 as k→∞ and by the second estimate in (2.2).
Now, with vk:=uk/∥uk∥, k∈N, it is easy to see that ∥vk∥=1, vk→w0 and ⟨Tvk,vk⟩→λ∈We(T).
∎
Corollary 2.5**.**
i)
If W(T) is a line, then so is We(T) and thus We(T)=W(T).
2. ii)
If W(T) is a strip, then We(T) is a strip or a line.
3. iii)
If W(T) is a half-plane and We(T)=∅, then We(T) is a half-plane.
4. iv)
If W(T)=C, then We(T)=C, and vice versa.
Proof.
Using the convexity of We(T) by Proposition 2.2 and Corollary 2.5, the claims follow from Proposition 2.4 if we know that We(T)=∅.
The latter was proved in Proposition 2.3 for cases i), ii) and iv), and it is assumed in case iii).
The converse in iv) follows from We(T)⊂W(T).
∎
The following example shows that We(T)=∅ is possible if W(T) is a half-plane.
Example 2.6**.**
For the diagonal operator T=diag(n+i(−1)nn2:n∈N0) in the Hilbert space H=l2(N0), we have
W(T)={z∈C:Rez≥0} but We(T)=∅; the latter follows from
the equivalent characterization We(T)=We2(T)=⋂{W(T+K):K∈L(H),rank<∞} which we will
prove in Theorem 3.1 below.
The following technical lemma for the case that W(T)=C is needed for the proof of
two of the main results of this paper, Theorem 3.1 and Theorem 6.7.
Lemma 2.7**.**
Suppose that W(T)=C.
i)
Let x,y∈D(T), ∥x∥=∥y∥=1, be linearly independent. Then,
for all but at most three t∈C,
[TABLE]
2. ii)
Let y∈D(T), ∥y∥=1, be such that {y}⊥∩D(T)={0}.
Then, for every ε>0, there exists a wε∈D(T), ∥wε∥=1, with
[TABLE]
Proof.
If (2.3) holds for every t∈C, there is nothing to show.
Hence assume that (2.3) is false for some t∈C; without loss of generality t=0.
Then there exists
[TABLE]
Since W(T)=C, we also have We(T)=C by Corollary 2.5 iv) and hence
there exists (xk)k∈N⊂D(T) with ∥xk∥=1, xk→w0 and ⟨Txk,xk⟩→λ
as k→∞.
Suppose first that supk∈N∣⟨Txk,y⟩∣<∞. If, for every k∈N, we write xk=xk(1)+xk(2)∈span{y}⊕{y}⊥, then xk(2)∈{y}⊥∩D(T) since xk, y∈D(T).
Since xk(1)=⟨xk,y⟩y→0 and ∥xk(2)∥→1 as k→∞, we arrive at
[TABLE]
for k∈N. Observe that all terms on the right hand side except the last tend to [math] as k→∞.
Since the left hand side has limit λ and xk(2)∈{y}⊥∩D(T), we obtain that
λ=limk→∞⟨Txk(2),xk(2)⟩∈W(T∣{y}⊥∩D(T)),
a contradiction to (2.5).
Hence supk∈N∣⟨Txk,y⟩∣=∞; without loss of generality ∣⟨Txk,y⟩∣→∞
as k→∞.
Since x,y are linearly independent, there exists u∈span{x,y} with u⊥y and ∥u∥=1.
Replacing (xk)k∈N by a subsequence if necessary, we may assume that the sequence
(⟨Txk,y⟩⟨Txk,u⟩)k∈N
converges to a limit α∈C∪{∞} as k→∞.
Then, for all s∈C with s∈C∖{0,α},
[TABLE]
with the convention that the right hand side is
s if α=∞.
We define
By (2.7), ∣⟨Txk,us⟩∣→∞ and hence βk→0 as k→∞, from which it follows at once that ∥vk∥2→∥us∥2
as k→∞. Also by (2.8), (βk⟨Txk,ys⟩)k∈N is bounded, and of course we already know
that xk→w0 as k→∞.
Using these two facts, together with the convergence ⟨Txk,xk⟩→λ as k→∞, a laborious direct calculation shows that
⟨Tvk,vk⟩→∥us∥2z as k→∞.
Hence z∈W(T∣{ys}⊥∩D(T)).
Since z was chosen arbitrarily, we arrive at
[TABLE]
Since y,x∈D(T) are linearly independent, we can write x=ay+bu for some a,b∈C, b=0.
Now we obtain (2.3) for all t∈C∖{0,−1/a,(b/α−a)−1} since
[TABLE]
ii)
If W(T∣{y}⊥∩D(T))=C, we choose wε=y. Otherwise, by i), we can choose wε=∥y+tx∥y+tx with t>0 so small that the second assertion in (2.4) is satisfied.
∎
3. Equivalent characterizations of We(T)
Next we show that two of the other characterizations of We(T) established in [17]
are equivalent to the definition of We(T) given in the previous section also in the unbounded case, and another one
is equivalent for densely defined operators.
However, there is one characterization which, in the unbounded case, is equivalent only under some additional conditions,
even if T is densely defined and closable; a counter-example will show that these conditions are also necessary,
see Remark 3.2 iv) and Example 3.5.
Theorem 3.1**.**
Let V be the set of all finite-dimensional subspaces V⊂H.
Define
[TABLE]
Then, in general,
[TABLE]
If D(T)∩D(T∗)=H or if W(T)=C, then
[TABLE]
Remark 3.2**.**
If D(T)=H, then
i)
D(T)∩D(T∗)=H necessitates that T is closable, see [41, Thm. 5.3];
2. ii)
W(T)=C necessitates that T is closable, see [26, Thm. V.3.4];
3. iii)
if D(T)⊂D(T∗), then D(T)∩D(T∗)=H is satisfied;
in particular, (3.3) holds if T is a symmetric operator. Unlike the bounded case,
iv)
the inclusion We1⊂We(T)(=Wei(T),i=2,3,4) in (3.1) can be strict
if D(T)∩D(T∗)=H and W(T)=C, see Example 3.5.
all ‘⊂’ are obvious and the reverse inclusion We3(T)⊃We2(T) follows since every compact operator is the norm limit of
finite rank operators.
Now we prove We1(T)⊂We4(T).
Let λ∈We1(T) and e0∈D(T) with ∥e0∥=1.
To show that λ∈We4(T), we inductively construct a sequence (en)n∈N⊂D(T) such that, for n∈N,
[TABLE]
For this, let n∈N and assume that e0,…,en−1 with the described properties have been constructed.
Set Vn:=span{e0,…,en−1}∈V.
Since λ∈We1(T), we have λ∈W(T∣Vn⊥∩D(T)) and hence there exists en∈Vn⊥∩D(T)
with ∥en∥=1 and ∣⟨Ten,en⟩−λ∣<1/n. Now the claim follows by induction over n∈N.
Next we show We3(T)⊂We(T).
First we consider the case that W(T) is contained in a half-plane, without loss of generality W(T)⊂{z∈C:0≤Rez}.
If We3(T)⊂We(T) were false, there would exist a λ0∈We3(T)∖We(T).
By Proposition 2.2, We(T) is closed and convex. Hence, by the strong separation property, see e.g. [28, Thm. 3.6.9], there exists a closed half-plane H with H⊃We(T) but λ0∈/H.
Then there exist θH∈(−π,π] and z0∈C with H=z0+{z∈C:θH−2π≤argz≤θH+2π}.
For every angle θ∈(2π,23π), we take an arbitrary positive compact operator K and find (xn)n∈N⊂D(T), ∥xn∥=1, without loss of generality xn→wx as n→∞, such that
[TABLE]
If θH=π, we can choose θ∈(2π,23π) so that θ∈[θH+2π,θH+23π]. Then
cosθ<0 and thus
[TABLE]
Hence there is a convergent subsequence (Re⟨Txnk,xnk⟩)k∈N, which implies that also nk⟨Kxnk,xnk⟩→μ≥0, k→∞; in particular, ⟨Kxnk,xnk⟩→0, k→∞, which necessitates x=w−limk→∞xnk=0. Altogether we obtain
the contradiction
[TABLE]
If θH=π, i.e. We(T) is contained in a vertical strip, then the same is true for W(T) by Proposition 2.4.
In this case we can rotate everything such that we are in the case already proved.
Now we assume that W(T)=C. Then We(T)=C by Proposition 2.4 and hence We3(T)=C=We(T) by (3.4).
This completes the proof of (3.1).
For (3.2) it remains to be proved that We(T)⊂We4(T) if T is densely defined, which is the most difficult part.
The inclusion will be a consequence of the following two properties.
Claim. If D(T)=H and
if the inclusion We1(T)⊂We(T) is strict, then W(T)=C;
if W(T)=C, then We4(T)=C.
In fact, if W(T)=C, then Claim 1) implies that We(T)=We1(T)⊂We4(T); if W(T)=C, then
Corollary 2.5 iv) yields We(T)=C and Claim 2) shows that also We4(T)=C.
Proof of Claim 1):
Suppose there exists λ∈We(T)∖We1(T). Then there is a sequence (xn)n∈N⊂D(T) with ∥xn∥=1, xn→w0 and ⟨Txn,xn⟩→λ as n→∞
and V∈V with λ∈/W(T∣V⊥∩D(T)).
We introduce a (not necessarily orthogonal) projection P with R(P)=V and R(P∗)⊂D(T).
To this end, choose any basis {ϕ1,…,ϕk} of V. Now, since D(T)=H,
we can choose a biorthogonal set {ψ1,…,ψk} in D(T) so that ⟨ϕn,ψm⟩=δn,m.
Define P∈L(H) by
[TABLE]
Note that
[TABLE]
Since P∗ and TP∗ are compact, we conclude P∗xn→0 and ⟨TP∗xn,xn⟩→0 as n→∞.
For an arbitrary z∈C define
[TABLE]
Note that ∥yn∥→1 and yn→w0, and hence ⟨TP∗yn,yn⟩→0 as n→∞.
First assume that (⟨T(I−P∗)xn,(I−P∗)xn⟩)n∈N is bounded; without loss of generality it is convergent,
with limit μ∈W(T∣V⊥∩D(T)).
Since, by assumption, the latter set does not contain λ, we have
[TABLE]
Moreover, for n∈N,
[TABLE]
and hence (⟨Tyn,yn⟩)n∈N converges to μ+zc∈We(T). Since z∈C was chosen arbitrarily,
we arrive at We(T)=W(T)=C.
Now assume that (⟨T(I−P∗)xn,(I−P∗)xn⟩)n∈N is unbounded.
Using (3.5), together with ⟨Txn,xn⟩→λ, ⟨TP∗xn,xn⟩→0 as n→∞,
we conclude that also (⟨T(I−P∗)xn,P∗xn⟩)n∈N is unbounded.
Taking the difference of (3.6) and (3.5) and using that
⟨TP∗yn,yn⟩→0 as n→∞, we infer that
(⟨Tyn,yn⟩)n∈N is unbounded for every z∈C\{1}. The arbitrary argument of z∈C\{1} is reflected in an arbitrary angle at which (⟨Tyn,yn⟩)n∈N diverges. This implies W(T)=C.
Proof of Claim 2):
Assume that W(T)=C and let λ∈C be arbitrary.
To show that λ∈We4(T), we shall prove, by induction, that there exist sequences
(en)n∈N and (yn)n∈N
such that, for all n∈N, we have ∥en∥=∥yn∥=1, the orthogonality conditions
yn+1∈{e1,…,en}⊥ and en+1∈{e1,…,en}⊥ hold,
the condition
[TABLE]
is satisfied and
[TABLE]
To this end, we will employ Lemma 2.7 ii); here we will use that for every finite codimensional subspace N⊂H the intersection N∩D(T) is dense in N, and hence in particular not {0}, since T is densely defined, see [19, Lemma 2.1].
At the first step of the induction we use the fact that W(T)=C to choose a unit vector y1∈D(T) such that
λ=⟨Ty1,y1⟩. We apply Lemma 2.7 ii) with ε=1 and y1 in the rôle of y to
deduce the existence of a unit vector e1∈D(T) such that
[TABLE]
Since W(T∣{e1}⊥∩D(T))=C we can choose a unit vector y2 orthogonal to e1 such that
⟨Ty2,y2⟩=λ, and the first step of the induction is complete.
Now suppose we have constructed e1,…,en−1 and y1,…,yn.
Define the space Xn−1:={e1,…,en−1}⊥ of codimension n−1 and let
T:=PXn−1T∣Xn−1∩D(T) where PXn−1:H→Xn−1 is the orthogonal projection in H onto Xn−1. We apply Lemma 2.7 ii) with T in Xn−1 playing the
rôle of T and yn playing the rôle of y, together with the choice ε=n1, to deduce the existence of a unit vector
en∈D(T) orthogonal to all of e1,…,en−1, such that
[TABLE]
and
[TABLE]
Now (3.7) allows us to choose a unit vector yn+1∈D(T), orthogonal to all of e1,…,en, such that
⟨Tyn+1,yn+1⟩=⟨Tyn+1,yn+1⟩=λ. The induction is thus complete.
Finally, to show that (3.3) holds if D(T)∩D(T∗)=H or if W(T)=C, it remains to be proved that the inclusion
We1(T)⊂Wei(T)=We(T), i=2,3,4, is an equality as well.
If W(T)=C, this is immediate from Claim 1) above.
If D(T)∩D(T∗)=H, we will show that We2(T)⊂We1(T).
Otherwise, there would exist λ∈We2(T) and V∈V so that λ∈/W(T∣V⊥∩D(T)).
After a possible shift and rotation we may assume that Reλ<0 and
[TABLE]
Since dimV<∞ and D(T) is dense in H,
V⊥∩D(T)
is dense in V⊥ and thus, in particular, V⊥∩D(T)={0}.
Let μ∈W(T∣V⊥∩D(T)).
As in the proof of Claim 1) above, now using that D(T)∩D(T∗)=H, there exists a (not necessarily orthogonal)
projection P∈L(H) with R(P)=V and R(P∗)⊂D(T)∩D(T∗). Define
[TABLE]
Since R(K0)⊂span(R(P)∪R(TP∗)) is finite-dimensional, the operator K0 has finite rank.
The assumption that D(T)∩D(T∗)=H implies that D(T∗)=H and hence T is closable, see Remark 3.2 i). This and R(P∗)⊂D(T)∩D(T∗) imply that the operators TP∗⊃TP∗ and (T∗P∗)∗⊃PT
are bounded and hence so is K0.
Since D(K0)=D(T) is dense, K0 is closable and its closure K:=K0∈L(H) has finite rank as well.
Note that D(T+K)=D(T)=D(K0)
and
[TABLE]
For arbitrary x∈D(T), ∥x∥=1, we set
[TABLE]
Then
[TABLE]
Since μ was chosen in W(T∣V⊥∩D(T))⊂H+, we conclude Re⟨(T+K)x,x⟩≥0.
This implies that
W(T+K)⊂H+ and so λ∈We2(T)⊂W(T+K)⊂H+,
a contradiction to Reλ<0.
This proves We2(T)⊂We1(T) and hence (3.3).
∎
Remark 3.3**.**
i)
For bounded T the identity We(T)=We1(T) is not explicitly stated in [17, Theorem (5.1)],
but it may be read off from the proof.
2. ii)
In the bounded case there is yet another characterization of We(T), see [17, Theorem (5.1) (5)],
[TABLE]
where Q is the set of all projections Q∈L(H) with rankQ=∞.
Note that if T is unbounded, one has to add the condition R(Q)⊂D(T) for Q∈Q in the definition of We5(T).
For the purpose of this paper this characterization does not play a rôle. We only mention that, if D(T)∩D(T∗)=H,
then We5(T)=Wei(T)=We(T), i=1,2,3,4, also in the unbounded case.
The next observation is useful for determining the essential numerical range in concrete examples such as the following Example 3.5.
Lemma 3.4**.**
Let V0∈V. Then
We1(T)=We1(T∣V0⊥∩D(T)).
Proof.
The inclusion ‘⊃’ is obvious from the definition in Theorem 3.1.
The inclusion ‘⊂’ follows from
[TABLE]
The next example shows that the strict inclusion We1(T)⊊We(T) in (3.2) may occur if D(T)=H, but D(T)∩D(T∗)=H and W(T)=C.
Example 3.5**.**
Let T0 be a selfadjoint operator in a Hilbert space H with domain D(T0) and σ(T0)=σe(T0)=R.
We perturb T0 by an unbounded linear operator S with D(S)=D(T0) of the form S=QΦ where
Φ:H→C is an unbounded linear functional which is T0-bounded and Q:C→H, Qz=zg where g∈H is a fixed element.
Note that D(S) is dense since so is D(T0).
Then S is T0-compact since S(T0+i)−1=QΦ(T0+i)−1 is the product of the bounded finite rank operator Q with the bounded operator Φ(T0+i)−1. Hence for
T:=T0+S with D(T)=D(T0)=D(S) we also have σe(T)=σe(T0)=R.
Since Φ is unbounded, f↦⟨Sf,y⟩=(Φf)⟨g,y⟩ is continuous if and only if y∈{g}⊥. Thus D(S∗)={g}⊥ is not dense and so S is not closable.
Together with the fact that S is densely defined it follows that W(S)=C, see [26, Thm. V.3.4].
Now we show that D(T)∩D(T∗)=H. This follows from D(S∗)=H if we prove that
D(T)∩D(T∗)=D(T0)∩D(S∗). For the latter we use the inclusions D(T0)∩D(S∗)=D(T)∩D(S∗)⊂D(T), T0+S∗⊂(T0+S)∗=T∗ and that, for
y∈D(T)∩D(T∗)=D(T0)∩D(T∗) and x∈D(S)=D(T0),
[TABLE]
is continuous on D(S) and hence y∈D(S∗).
We claim that W(T)=C, which implies that We(T)=C by Corollary 2.5 iv). Otherwise, W(T) would be contained in some closed half-plane H.
Since R=σe2(T)⊂W(T)⊂H, this half-plane must be of the form H={z∈C:Imz≤h} or H={z∈C:Imz≥−h} with h≥0.
E.g. in the former case, let h0>h. Since W(S)=C, there exists f∈D(S)=D(T), ∥f∥=1, so that ⟨Sf,f⟩=ih0. But then ⟨Tf,f⟩=⟨T0f,f⟩+⟨Sf,f⟩
and since T0 is selfadjoint Im⟨Tf,f⟩=Im⟨Sf,f⟩=h0>h, a contradiction to W(T)⊂H.
Applying Lemma 3.4 with V0=span{g}, we obtain We1(T)=We1(T∣V0⊥∩D(T))=We1(T0∣V0⊥∩D(T))=We1(T0). Since W(T0)=σ(T0)=R, Corollary 2.5 implies We(T0)=W(T0)=R. Theorem 3.1 for T0 shows We1(T)=We1(T0)=We(T0)=R.
Altogether, in this example, D(T)∩D(T∗)=H, W(T)=C and
[TABLE]
which shows that the conditions for (3.3) in Theorem 3.1 are necessary.
A concrete example of operators T0 and Φ as above is T0f=if′ in L2(R) with D(T0)=H1(R) and Φ=δ0,
i.e. Φf:=f(0) with D(Φ)=H1(R), so that Sf=f(0)g with some fixed g∈L2(R). In this case Tf=if′+f(0)g with D(T)=H1(R) is an example for the above abstract model
for which (3.8) holds.
It is well-known that for a non-selfadjoint operator T in a Hilbert space there are several different, and in general not equivalent,
definitions of essential spectrum, denoted by σek(T), k=1,…5, see e.g. [16, Chapter IX], which satisfy the inclusions
[TABLE]
By Proposition 2.2 we already know that for the essential spectrum
σe2(T)=σe(T) from [16, Chapter IX], which we use here,
convσe(T)⊂We(T), and hence
[TABLE]
The following remark collects the inclusions for all the essential spectra.
Remark 3.6**.**
i)
If D(T)∩D(T∗) is a core of T∗, then
[TABLE]
2. ii)
If T is closed, then σe3(T)=σe(T)∪σe(T∗)∗ and hence if, in addition,
D(T)∩D(T∗) is a core of T∗, then
[TABLE]
3. iii)
If T is closed, then σe4(T)⊂KcompactK∈L(H),⋂σ(T+K) and
if, in addition, σ(T)⊂W(T), then
[TABLE]
in this case σe5(T)=σe4(T) and hence also
[TABLE]
Proof.
i) By Proposition 2.2, see also (3.9), it suffices to show that σe(T∗)∗⊂We(T). If λ∈σe(T∗)∗, there exist xn∈D(T∗), n∈N, with ∥xn∥=1, xn→w0 and ∥(T∗−λ)xn∥→0 as n→∞.
Since D(T)∩D(T∗) is a core of T∗, we can construct xn∈D(T)∩D(T∗), n∈N, with ∥xn∥=1, xn→w0 and ∥(T∗−λ)xn∥→0 as n→∞.
This implies ⟨(T−λ)xn,xn⟩=⟨xn,(T∗−λ)xn⟩→0 as n→∞ and hence λ∈We(T).
ii) The claim follows from the stated formula for σe3(T) for closed T, which is a consequence of the Closed Range Theorem, see [16, Thm. I.3.7], and from claim i).
iii) The claim will follow from the stated inclusion for σe4(T) for closed T, see the first part of the proof of [16, Thm. IX.1.4]
and note that T need not have dense domain for the inclusion “⊂” therein, and from the equality We(T)=We3(T) by Theorem 3.1 if we show that the spectral inclusion σ(T)⊂W(T) implies the spectral inclusion σ(T+K)⊂W(T+K).
To show the latter, suppose first that W(T)=C.
Then also W(T+K)=C, and so the claim is immediate, since otherwise W(T+K) were contained in a half-plane and hence, since K is bounded, also
W(T)⊂W(T+K)+B∥K∥(0) would be contained in a half-plane, a contradiction.
If W(T)=C, the convexity of W(T) implies that the complement C\W(T) consists either of one component or of two components in which case W(T) is a strip.
Then the same is true for W(T+K) since K is bounded and so W(T+K)⊂W(T)+B∥K∥(0). A Neumann series argument and the resolvent estimate
∥(T−λ)−1∥≤1/dist(λ,W(T)), λ∈/W(T), yield σ(T+K)⊂W(T)+B∥K∥(0).
The latter yields that in each component of C∖W(T+K) there exists at least one point in ϱ(T+K) which implies σ(T+K)⊂W(T+K).
∎
For a bounded selfadjoint operator T, the essential numerical range is the convex hull of the essential spectrum,
We(T)=convσe(T), see [37, Corollary 5.1].
An analogous result for unbounded selfadjoint operators
does not hold; it may even happen that σe(T)=∅ but We(T)=R.
In order to formulate the result for arbitrary selfadjoint operators,
we need the notion of extended essential spectrum.
Note that there are different notions of the latter for closed operators using the one-point compactification of C or R, see [21],
and for selfadjoint operators using the two-point compactification of R, [29], which is needed here.
Definition 3.7**.**
If T is selfadjoint, we define the extended essential spectrumσe(T)⊂R∪{+∞,−∞} of T
as the set σe(T) with +∞ and/or −∞ added if T is unbounded from above and/or from below, and as σe(T) if T is bounded.
Theorem 3.8**.**
If T is unbounded and selfadjoint, then
[TABLE]
Proof.
If T is not semibounded, then W(T)=R and thus We(T)=W(T)=R by Corollary 2.5.
Since {\rm conv}\big{(}\widehat{\sigma}_{e}(T)\big{)}\!=\!\mathbb{R}\cup\{\pm\infty\} by Definition 3.7, the claim follows.
Now suppose that T is semibounded, say bounded from below; if T is bounded from above, we consider −T. Then se:=infσe(T)=infσe(T)∈R∪{+∞}.
If se<+∞, we have se∈We(T)⊂W(T), (se,+∞)⊂W(T) and hence (se,+∞)⊂We(T)
by Proposition 2.4. Therefore the claim is proved if we show that (−∞,se)∩We(T)=∅. Let λ<se=infσe(T).
Then (λ,λ+ε)⊂ϱ(T) for some ε>0.
If ET(Δ) denotes the spectral projection of T corresponding to some Borel set Δ⊂R,
we have dimR(ET((−∞,λ+ε)))<∞,
K:=(−T+se)ET((−∞,λ+ε)) is compact and T+K≥λ+ε. Hence
Theorem 3.1 ii) yields that We(T)=We2(T)⊂W(T+K)⊂[λ+ε,∞) which implies
λ∈/We(T).
∎
The definition of the essential numerical range of a linear operator T involves its quadratic form t[f]:=⟨Tf,f⟩, D(t):=D(T). This motivates the following definition.
Definition 3.9**.**
Let t be a sesquilinear form with D(t)⊂H.
Define the essential numerical range of t by
[TABLE]
Clearly, if t is the quadratic form of a linear operator T, then We(t)=We(T).
Analogously as in Proposition 2.2 one may show that We(t) is closed and convex. For
an extension t of t we have We(t)⊂We(t), and equality prevails if D(t) is a core of t.
Theorem 3.10**.**
Let T be a linear operator with associated quadratic form t, and let t∗ be the adjoint form of t.
i)
Then, with the quadratic forms Ret:=21(t+t∗), Imt:=2i1(t−t∗),
[TABLE]
2. ii)
If T is m-sectorial with semi-angle <π/2 and ReT is the selfadjoint operator induced by the (symmetric non-negative) form Ret, then
[TABLE]
in particular, We(T)=∅ if T has compact resolvent.
Proof.
i)
The claim follows from the fact that if (t[xn])n∈N is convergent, then so are ((Ret)[xn])n∈N and ((Imt)[xn])n∈N.
ii)
By the assumption on T, the associated sequilinear form t is closed and sectorial with semi-angle <π/2
and there exists a non-negative selfadjoint operator ReT associated with the symmetric non-negative
quadratic form h:=21(t+t∗) with D(h)=D(t)=D(t∗), see [25, Sect. 3].
The inclusion ReWe(T)⊂We(Ret)=We(ReT) follows from claim i).
Conversely, let λ∈We(ReT). Then there exists (xn)n∈N⊂D(ReT)⊂D(t) with ∥xn∥=1, xn→w0 and
[TABLE]
in particular, (Ret[xn])n∈N is bounded.
Since t is sectorial, this implies that (Imt[xn])n∈N is bounded and, thus, has a convergent subsequence.
Hence (t[xn])n∈N has a convergent subsequence whose limit has real part λ∈ReWe(T).
Since D(T) is a core of t by [26, Theorem VI.2.1], we obtain λ∈ReWe(T)=ReWe(T).
The second equality in (3.10) follows from Theorem 3.8 since ReT is selfadjoint.
If T has compact resolvent, then so has ReT, see [26, Theorem VI.3.3], and hence conv(σe(ReT))\{∞}=∅ because ReT is non-negative.
∎
Remark 3.11**.**
i) As a consequence of Theorem 3.10 i), we obtain the inclusion
[TABLE]
ii) Note that, while for a bounded linear operator T, the real and imaginary part can be defined by the formulas 21(T+T∗) and 2i1(T−T∗), respectively,
this is not always possible if T is unbounded since D(T)∩D(T∗) may not be large enough;
even if T is m-sectorial with semi-angle <π/2 the operator 21(T+T∗) may not be selfadjoint and hence it need not coincide with ReT as defined above
via forms, see [25, Sect. 3].
The last claim in Theorem 3.10 is sharp, i.e. there are m-accretive,
non-sectorial operators with compact resolvent and We(T)=∅, as the following example illustrates.
Example 3.12** (Schrödinger operators with complex potentials).**
a)
a) Consider a potential Q∈Lloc1(Rd) with
[TABLE]
If Q is sectorial, then, by [7, Proposition 2.2], the quadratic form
[TABLE]
is closed, densely defined and sectorial in L2(Rd), and the m-sectorial operator T uniquely determined by t has compact resolvent.
Thus We(T)=∅ by Theorem 3.10 ii).
b) If the potential is not sectorial but only accretive, then We(T)=∅ is possible, even under the assumption (3.11).
As an example in dimension d=1, consider the complex Airy operator
[TABLE]
in L2(R). Here we will show that
[TABLE]
The inclusions “⊂” are obvious. Since We(T) is closed, it remains to be proved that
{λ∈C:Reλ>0}⊂We(T). Let λ=u+iv∈C with u=Reλ>0 be arbitrary.
If φ∈C0∞(R) is an even or odd function with suppφ⊂[−1,1] and ∥φ∥2=1/2, ∥φ′∥2=u/2, we
define (fn)n∈N⊂D(T) by
[TABLE]
Then it is not difficult to check that ⟨Qfn,fn⟩=iv, ∥fn∥=1, fn→w0 as n→∞ and
[TABLE]
which implies that λ∈We(T), as required.
Note that the above arguments also prove directly that the closure of the numerical range of the complex Airy operator is the closed right half-plane,
while earlier proofs rely on estimates of the resolvent norm, comp. [23, Sect. 3.1].
4. Perturbation results
While the essential spectrum of an unbounded linear operator is invariant both under compact and relatively compact perturbations,
we will see that, in general, the latter is not true for the essential numerical range.
First we prove that the essential numerical range We(T) and all other, possibly not coincident sets Wei(T), i=1,2,3,4,
are invariant under compact perturbations.
Proposition 4.1**.**
For every compact K∈L(H) we have
[TABLE]
even if the latter two sets are not equal to We(T).
Proof.
For We(T) the claim follows readily from Definition 2.1 since compact operators map weakly convergent sequences to strongly convergent ones. Alternatively, as for We2(T) it follows from the equality We(T)=We2(T)=We3(T) by Theorem 3.1 since the claim for We3(T) is obvious from its definition. For We4(T) the claim follows from the property that ⟨Ken,en⟩→0
as n→∞ for a compact operator K and an arbitrary orthonormal system (en)n∈N⊂H.
In order to show that We1(T)=We1(T+K) for every compact K∈L(H), it suffices to prove that We1(T+K)⊂We1(T); then the reverse inclusion follows from We1(T)=We1((T+K)−K)⊂We1(T+K). Let λ∈We1(T+K), and suppose that V∈V and n∈N are arbitrary.
By Lacey’s theorem, see [27], [20, Thm. III.2.3],
there exists a finite codimensional, hence closed, subspace Wn⊂H such that ∥K∣Wn∥≤2n1.
By Lemma 3.4, since Vn:=Wn⊥ is finite dimensional, we have We1(T+K)=We1((T+K)∣Wn∩D(T))
and hence, by definition of the latter, λ∈W((T+K)∣V⊥∩Wn∩D(T)).
This implies that there exists xn∈V⊥∩Wn∩D(T), ∥xn∥=1, with ∣λ−⟨(T+K)xn,xn⟩∣≤2n1.
Since xn∈Wn and xn∈V⊥∩D(T), it follows that
[TABLE]
which proves that λ∈We1(T) as required.
∎
The following remark shows that, unlike the essential spectrum,
the essential numerical range is not invariant under relatively compact perturbations in general.
Remark 4.2**.**
For an unbounded operator T, Example 4.3 below shows that the definition of the essential numerical range is in general not equivalent to
[TABLE]
not even if T is selfadjoint and thus We(T)=Wei(T), i=1,2,3,4, see Theorem 3.1.
In general, We(T)⊂We3(T)=We(T) by Theorem 3.1 since every compact operator is T-compact.
Equality only holds under some additional condition:
[TABLE]
if T is closable, (4.1) holds with “⊂” replaced by “=” on the right hand side.
In particular, We(T)=We(T) if T has compact resolvent, W(T)=C and We(T)=∅.
Proof.
“⟹”
Suppose first that We(T)=We(T) and let K be an arbitrary T-compact operator. Then
[TABLE]
where Theorem 3.1 was used for T+K in the last step.
If T is closable, then every T-compact K is also (T+K)-compact, see [16, Prop. III.8.3].
Using what was already proved, we also obtain the reverse inclusion We(T+K)⊂We(T+K−K)=We(T).
“⟸”
Conversely, if We(T)⊂We(T+K) for all T-compact K, then
[TABLE]
where Theorem 3.1 was used for T in the last step. This shows that equality prevails everywhere and hence, in particular, We(T)=We(T).
To prove the last claim, we use that K=λI is T-compact and T is closed if T has compact resolvent, and hence the right hand side of
(4.1) only holds if
[TABLE]
which necessitates We(T)=∅ or We(T)=C; the latter is equivalent to W(T)=C by Corollary 2.5 iv).
∎
Example 4.3**.**
Let T be a selfadjoint non-semibounded operator with compact
resolvent.
Then W(T)=R and thus, by Corollary 2.5 i), also We(T)=W(T)=R.
So in this case W(T)=C and We(T)=∅, whence We(T)=We(T) by the last claim of Remark 4.2.
The next proposition shows that the essential numerical range of a selfadjoint operator T remains invariant under
symmetric relatively compact perturbations. Further stability results for We(T) for non-selfadjoint operators are given below.
Proposition 4.4**.**
Let T be selfadjoint. If S is symmetric and T-compact, then We(T)=We(T+S).
Proof.
The assumptions on S imply that
σe(T)=σe(T+S), that S is T-bounded with relative bound [math] and hence
T+S is selfadjoint, and that T+S is bounded from below/above whenever T is, see [16, Thm. IX.2.1, Cor. II.7.7],
[26, Thm. V.4.3, Thm. V.4.11].
Now the claim follows from Theorem 3.8.
∎
In the following result both the unperturbed operator T and the perturbation S may be non-selfadjoint, but we
assume that they admit decompositions into “real and imaginary parts”, which need not hold for unbounded operators in general.
Theorem 4.5**.**
Let T=A+iB and S=U+iV with symmetric operators A, B and U, V in H such that
one of the following holds:
(i)
A* is selfadjoint and semibounded, U, V are A-compact, or*
2. (ii)
B* is selfadjoint and semibounded, U, V are B-compact, or*
3. (iii)
A, B are selfadjoint and semibounded, U is A-compact and V is B-compact.
Then We(T)=We(T+S).
Remark 4.6**.**
Theorem 4.5 does not hold if S does not decompose and we only assume that
S is A-compact in (i) or S is B-compact in (ii), see Example 4.10 below.
It is sufficient to consider the cases (i) and (iii); in case (ii) the operators iT and iS satisfy the assumptions of (i).
“⊃”: Let λ∈We(T+S).
Then there exists a sequence (xn)n∈N⊂D(T) with ∥xn∥=1, xn→w0 and ⟨(T+S)xn,xn⟩→λ,
i.e.
[TABLE]
First we show that all four sequences occurring in (4.4) are bounded.
To this end, suppose that (⟨Axn,xn⟩)n∈N is unbounded,
i.e. there exists an infinite subset I⊂N such that ⟨Axn,xn⟩→∞ as n∈I, n→∞.
In both cases (i) and (iii), A is selfadjoint and semibounded and
U is A-bounded with relative bound [math], and thus [26, Theorem VI.1.38]
(or, more generally, [18, Thm. 3.2 (i)])
implies ⟨(A+U)xn,xn⟩→∞ as n∈I, n→∞, a contradiction to (4.4).
Thus (⟨Axn,xn⟩)n∈N is bounded, and hence so is (⟨Uxn,xn⟩)n∈N
by [26, Theorem VI.1.38].
In case (iii), the proof that (⟨Bxn,xn⟩)n∈N and (⟨Vxn,xn⟩)n∈N are bounded is analogous.
In case (i), V is A-bounded with relative bound [math] and hence the boundedness of (⟨Axn,xn⟩)n∈N implies the
boundedness of (⟨Vxn,xn⟩)n∈N by [26, Theorem VI.1.38]. Now (4.4) yields that (⟨Bxn,xn⟩)n∈N is bounded.
The boundedness of the four sequences in (4.4) implies that
there exist an infinite subset J⊂N and γ, δ∈R such that
[TABLE]
Now suppose that λ∈/We(T). Since α+iβ∈We(T), this would imply γ=0 or δ=0.
First we assume that γ=0. In both cases (i) and (iii), we have
We(A+tU)=We(A) by Proposition 4.4. Then, for any t∈R,
[TABLE]
which implies that We(A)=R, a contradiction to the semiboundedness of A assumed in (i) and (iii).
Now assume that δ=0.
In case (i), in the same way as above, we arrive at γ+tδ∈We(A+tV)=We(A)
for every t∈R implying the contradiction We(A)=R.
In case (iii), in the same way as above, we conclude that
β+tδ∈We(B+tV)=We(B) for any t∈R and hence We(B)=R, a contradiction
the semiboundedness of B assumed in (iii).
Altogether, we have shown that γ=δ=0 and hence λ∈We(T).
“⊂”: The reverse inclusion follows by applying the first part of the proof to the operators T′=T+S and S′=−S.
Here, in case (iii) we have to note that A+U and
B+V are selfadjoint by [26, Theorem V.4.3] and that U is (A+U)-compact,
V is (B+V)-compact by [16, Prop. III.3.8]. In case (i), we also have to show that V is (A+U)-compact. To this end, suppose that
(xn)n∈N, ((A+U)xn)n∈N are bounded. Because U is (A+U)-compact and thus (A+U)-bounded, this implies that (Uxn)n∈N
is bounded and hence so is (Axn)n∈N. Since V is A-compact by assumption in (i), it follows that (Vxn)n∈N contains a convergent subsequence.
∎
In the following theorem, instead of requiring
the perturbation to decompose into real and imaginary parts,
we strengthen the relative compactness assumptions on it. If e.g. A is uniformly positive, then instead of assuming that S is A-compact, i.e. SA−1 is compact,
we have to assume that A−1/2SA−1/2 is compact.
That S is A-compact implies that S is A-form-compact, i.e. ∣S∣1/2A−1/2 is compact, is not only true for symmetric S,
see [26, Theorem VI.1.38], but even for densely defined closed S, see [18, Thm. 3.5]. Therein it was also shown that,
if ∣S∣1/2A−1/2 is compact and D(A)⊂D(S)∩D(S∗), then even A−1/2SA−1/2 is compact.
Note that this need not be true for non-symmetric S since S∗ may not be A1/2-bounded; incidentally,
Example 4.10 below shows that the condition D(A)⊂D(S)∩D(S∗) is also necessary.
Theorem 4.7**.**
Let T=A+iB with uniformly positive A and symmetric B and let A−1/2S be A1/2-compact, i.e. A−1/2SA−1/2 is compact. Then We(T)=We(T+S).
In particular, if S is A-compact and D(A)⊂D(S)∩D(S∗), then We(T)=We(T+S).
Proof.
Since D(T)=D(A)∩D(B)⊂D(A1/2)⊂D(S), we have D(T+S)=D(T).
“⊃”: Let (xn)n∈N⊂D(T) satisfy ∥xn∥=1, xn→w0 and
[TABLE]
First we show that \big{(}\|A^{1/2}x_{n}\|\big{)}_{n\in\mathbb{N}} is a bounded sequence.
To this end, we estimate ∣⟨Txn,xn⟩∣≥⟨Axn,xn⟩=∥A1/2xn∥2 to obtain
[TABLE]
Since A−1/2S is A1/2-compact by the assumptions, it is relatively bounded with A1/2-bound [math]
and hence ∥A−1/2Sxn∥/∥A1/2xn∥→0 if ∥A1/2xn∥→∞ as n→∞.
Together with (4.6) we see that ∥A1/2xn∥→∞ implies ∣⟨(T+S)xn,xn⟩∣→∞ as n→∞,
a contradiction to (4.5). Thus \big{(}\|A^{1/2}x_{n}\|\big{)}_{n\in\mathbb{N}} is bounded.
Since xn→w0 and A−1/2S is A1/2-compact, it follows that A−1/2Sxn→0 as n→∞.
So we conclude ⟨Sxn,xn⟩=⟨A−1/2Sxn,A1/2xn⟩→0 and hence ⟨Txn,xn⟩→λ∈We(T) as n→∞.
“⊂”: Let (xn)n∈N satisfy ∥xn∥=1, xn→w0 and
[TABLE]
The assumptions on A and B imply that (\|A^{1/2}x_{n}\|\big{)}_{n\in\mathbb{N}}=(\langle Ax_{n},x_{n}\rangle)_{n\in\mathbb{N}}
is bounded. As in the last step above, the compactness assumption on S yields ⟨Sxn,xn⟩→0 as n→∞. Therefore λ∈We(T+S).
∎
Remark 4.8**.**
All possible choices of α,β≥0 for which A−αSA−β is compact implies We(T)=We(T+S) are given by α∈[0,1/2], β∈[0,1/2]. In fact,
Theorem 4.7 proves the admissibility of α=β=1/2, and thus also of all α∈[0,1/2], β∈[0,1/2] which correspond to stronger conditions.
Example 4.10 below shows that β>1/2 is not eligible, and if we replace S therein by its adjoint S∗, we see that α>1/2 is not eligible either.
The following example illustrates that T−1/2ST−1/2 may be compact, whereas ST−1 need not be compact,
even for a uniformly positive selfadjoint operator T and a bounded selfadjoint operator S; in this case
neither Proposition 4.4 nor Theorem 4.5
apply, but Theorem 4.7 yields We(T+S)=We(T).
Example 4.9**.**
Let {ek:k∈N} denote the standard orthonormal basis of l2(N).
In l2(N)=⨁n∈NMn with Mn:=span{e2n−1,e2n}
we introduce two selfadjoint operators, identified with their block matrix representations
[TABLE]
The operator T is uniformly positive and S is bounded and selfadjoint. It is easy to check that ST−1 is not compact whereas T−1/2ST−1/2 is compact.
Therefore, by Theorem 4.7 and Theorem 3.8, we have
[TABLE]
The following example shows that the essential numerical range need not be preserved if S is T-compact, i.e. ST−1
is compact rather than T−1/2ST−1/2 is compact.
To obtain the latter we need that D(T)⊂D(S)∩D(S∗) by [18, Thm. 3.5 (ii)],
and to achieve the former we need that S is T-compact, but does not satisfy the stronger
assumption S=U+iV with T-compact symmetric operators U, V (compare Theorem 4.5); note that the latter
necessitates D(S)=D(U)∩D(V).
Example 4.10**.**
Let T be the uniformly positive operator defined in Example 4.9, and define the operator
S in l2(N)=⨁n∈NMn with Mn:=span{e2n−1,e2n} by
[TABLE]
It is easy to check that ST−1 is compact, whereas T−1/2ST−1/2 is not;
further, T−αST−β is compact if β>1/2 and T−αS∗T−β is compact if β>1/2, comp. Remark 4.8.
Note that here D(T)⊂D(S∗) and hence the condition D(T)⊂D(S)∩D(S∗) is violated
which would have implied the compactness of T−1/2ST−1/2 by [18, Thm. 3.5 (ii)]. In fact, S is neither sectorial nor accretive and
[TABLE]
so there is no result to conclude that S=U+iV with symmetric U, V, let alone that U, V are T-compact as required in
Theorem 4.5.
Indeed, here the essential numerical ranges of T and T+S do not coincide since
We(T)=conv(σe(T))\{±∞}=[1,∞) by Theorem 3.8, see also Example 4.9,
and we will show that
[TABLE]
so that We(T)⊊We(T+S).
To prove (4.7), we first note that
the numerical ranges of the 2×2-matrices PMn(T+S)∣Mn, n∈N, are ellipses with foci 1, n2 and minor semi-axis n/2,
[TABLE]
Solving for y and letting n→∞, it is not difficult to check that the non-nested sequence of ellipses En, n∈N, has the following convergence properties with respect
to Kuratowski distance of closed (unbounded) subsets of C, see e.g. [36, Chapt. 4],
[TABLE]
This means e.g. that the set of limits points of sequences (λn)n∈N with λn∈En, n∈N, and the set of its accumulation points coincide and are equal to E.
Since every sequence (fn)n∈N with fn∈Mn satisfies fn→w0, this proves, in particular,
the inclusion “⊃” in (4.7).
For the converse inclusion “⊂” in (4.7)
we use that, by Theorem 3.1,
[TABLE]
for arbitrary m∈N and hence
[TABLE]
Since Um→E implies convUm→convE=E as m→∞, see [36, Prop. 4.30 (c)], and Um, m∈N, is a nested decreasing sequence, Um⊃Um′, m≤m′, it follows that ⋂m∈NconvUm=limm→∞convUm=E.
Remark 4.11**.**
Note that the operators T and S in Example 4.10 are related to certain neutral delay differential expressions, see e.g. [4, Chapt. 3].
More precisely, if we define
[TABLE]
and consider
the realizations of τT and τS in L2(−π,π) with periodic boundary conditions and domain orthogonal to the constant functions, it is easy to check that the corresponding
matrix representations in l2(N) with respect to {cos(k⋅),sin(k⋅):k∈N} are given by
the infinite matrices T and S, respectively,
studied in Example 4.10.
5. The limiting essential numerical range of operator approximations
In this section we introduce the notion of limiting essential numerical range We((Tn)n∈N) of a sequence of operators (Tn)n∈N, a concept that is also new in the bounded case. We will establish conditions
under which the limiting essential numerical range coincides with the essential numerical range We(T) of the limit operator T in generalized strong resolvent sense.
Our main result is that We(T) contains all pathologies that might occur for any such operator approximation; first spectral pollution where a sequence of eigenvalues of the approximating operator converges to a point
λ∈/σ(T), and secondly failure of spectral inclusion where a true spectral point λ∈σ(T) is not approximated.
To this end, we first provide some abstract notions for operator sequences, their spectra and convergence behaviour.
Let Hn⊂H, n∈N, be closed subspaces and denote by
Pn=PHn:H→Hn, n∈N, the orthogonal projections in H onto them.
Let T:H⊃D(T)→H and Tn:Hn⊃D(Tn)→Hn, n∈N, be linear operators in H and Hn, n∈N, respectively.
The following local notions of spectral inclusion and spectral exactness have their origin in [3] by Bailey et al. for selfadjoint operators, the notion of spectral pollution may be traced back to
[35] by Rappaz for bounded non-compact operators (comp. [6, Def. 2.2]).
Definition 5.1**.**
i)
The limiting spectrum of (Tn)n∈N is defined as
[TABLE]
a point λ∈σ(T) is called approximated by (Tn)n∈N if λ∈σ((Tn)n∈N).
2. ii)
the set of spectral pollution of (Tn)n∈N is defined as
[TABLE]
a point λ∈σpoll((Tn)n∈N) is called spurious eigenvalue of (Tn)n∈N.
3. iii)
(Tn)n∈N is called spectrally inclusive for T in Λ⊂C if
[TABLE]
4. iv)
(Tn)n∈N is called spectrally exact for T in Λ⊂C if it is spectrally inclusive for T in Λ and no spectral pollution occurs in Λ, i.e.
[TABLE]
If iii) and iv), respectively, hold for Λ=C, then (Tn)n∈N is called spectrally inclusive or spectrally exact, respectively.
The following definition of generalized strong resolvent convergence is due to Weidmann [42, Section 9.3] in the selfadjoint case.
The limiting essential spectrum was introduced in [5] and generalizes a notion from [8] for the Galerkin method of selfadjoint operators.
Definition 5.2**.**
i)
The operator sequence (Tn)n∈N is said to converge in generalized strong resolvent sense to T,
Tn→gsrT, if there exists n0∈N with
[TABLE]
ii)
The limiting essential spectrum of (Tn)n∈N is defined as
[TABLE]
Remark 5.3**.**
The limiting essential spectrum σe((Tn)n∈N) is closed and, if
Pn→sI,
[TABLE]
while equality requires generalized norm resolvent convergence, see [5, Prop. 2.4, 2.7].
For a particular operator approximation (Tn)n∈N, the following local spectral exactness result from [5] identifies sets to which spectral
pollution is confined and outside of which isolated spectral points are spectrally included.
and every isolated λ∈σ(T) outside σe((Tn)n∈N)∪σe((Tn∗)n∈N)∗
is approximated by (Tn)n∈N.
2. ii)
If Tn→gsrT and all Tn, n∈N, have compact resolvents,
then claim i)* holds with σe((Tn)n∈N)∪σe((Tn∗)n∈N)∗ replaced by σe((Tn∗)n∈N)∗.*
The following concept of limiting essential numerical range for operator sequences is new even in the case of bounded operators.
Definition 5.5**.**
We define the limiting essential numerical range of (Tn)n∈N by
[TABLE]
Clearly, We((zTn)n∈N)=zWe((Tn)n∈N) and
We((Tn+z)n∈N)=We((Tn)n∈N)+z for z∈C.
The next results relating limiting essential spectrum, limiting essential numerical range and essential numerical range will be used
in later sections.
Proposition 5.6**.**
i)
The limiting essential numerical range We((Tn)n∈N) is closed and convex with
convσe((Tn)n∈N)⊂We((Tn)n∈N), and, if Pn→sI,
[TABLE]
2. ii
If, for every n∈N, D(Tn)∩D(Tn∗) is a core of Tn∗, then
[TABLE]
Proof.
The first three claims in i) are proved in the same way as Proposition 2.2; claim ii) is shown in an analogous way as Remark 3.6 i).
In order to prove (5.2),
let λ∈We(T). Then there exist xk∈D(T), k∈N, with ∥xk∥=1, xk→w0 and ⟨(T−λ)xk,xk⟩→0 as k→∞.
Using Pn→sI, Tn→gsrT and choosing λ0 as in Def. 5.2 i), we let xk;n:=(Tn−λ0)−1Pn(T−λ0)xk∈D(Tn), k,n∈N. Then,
for every k∈N, we have ∥xk;n−xk∥→0 and ∥Tnxk;n−Txk∥→0 as n→∞;
in particular, ∥xk;n∥→1 as n→∞.
Hence we can find a strictly increasing sequence (nk)k∈N⊂N such that, for every k∈N, the element yk:=xk;nk∈D(Tnk) satisfies
[TABLE]
Then the sequence (yk)k∈N is bounded and bounded away from [math] with
[TABLE]
as k→∞. Hence xnk:=yk/∥yk∥∈D(Tnk), k∈N, satisfy ∥xnk∥=1, xnk→w0 and
⟨Tnkxnk,xnk⟩→λ as k→∞, which proves that λ∈We((Tn)n∈N).
∎
Proposition 5.7**.**
If t is a sesquilinear form with domain D(t)⊂H such that
[TABLE]
then We((Tn)n∈N)⊂We(t) and, if D(T) is a core of t,
then We((Tn)n∈N)⊂We(T).
Proof.
The claims follow from Definition 3.9 and the remarks thereafter.
∎
The following example shows that the sets W_{e}\big{(}(T_{n})_{n\in\mathbb{N}}\big{)} and {\rm conv}\,\sigma_{e}\big{(}(T_{n})_{n\in\mathbb{N}}\big{)}
may be larger than We(T), even if all operators are bounded with Tn→sT.
It also shows that it is important not to choose the subspaces Hn unnecessarily large since this may artificially blow up the limiting sets.
Example 5.8**.**
In H=Hn=l2(N) with standard orthonormal basis {ek:k∈N}
consider the operators T:=I:l2(N)→l2(N) and Tn:l2(N)→l2(N), n∈N, given by
[TABLE]
Clearly, T and Tn, n∈N, are selfadjoint and bounded in l2(N) with Tn→sT,
but we have the strict inclusions
[TABLE]
Here the equalities on the left are obvious. For the middle equality in (5.3), we note that
∥en∥=1, en→w0 and ∥(Tn−1)en∥=0, ∥Tnen+1∥=0 imply that 1,0∈σe((Tn)n∈N);
vice versa, σ(Tn)={0,1}, n∈N, implies that \sigma_{e}\big{(}(T_{n})_{n\in\mathbb{N}}\big{)}\subset\{0,1\}.
The last equality in (5.3) follows from We((Tn)n∈N)⊂W(Tn)=W(Tn)=[0,1], n∈N,
the middle equality and Proposition 5.6 i).
Note that if we consider the operators Tn in Hn:=span{ek:k=1,…,n}, we obtain
\sigma_{e}(T)=W_{\!e}(T)=\sigma_{e}\big{(}(T_{n})_{n\in\mathbb{N}}\big{)}=W_{e}\big{(}(T_{n})_{n\in\mathbb{N}}\big{)}=\{1\}.
6. Application I: Projection method
In this section we focus on projection methods. We prove that, for any projection method, the essential numerical range We(T) contains all possible spectral pollution
and that We(T) is the smallest set with this property because arbitrary points in We(T) can be arranged to be spurious eigenvalues.
As in the previous section, for a closed subspace V⊂H we denote by PV:H→V the orthogonal projection in H onto V.
If V⊂D(T), then TV:=PVT∣V denotes the compression of T to V.
Theorem 6.1**.**
Assume D(T)=H.
Let PHn:H→Hn, n∈N, be orthogonal projections onto finite-dimensional subspaces Hn⊂D(T) with PHn→sI.
If THn→gsrT, then
i)
We((THn)n∈N)=We(T),
2. ii)
spectral pollution is confined to We(T),
3. iii)
every isolated λ∈σ(T) outside We(T) is approximated.
Proof.
i)
The equality follows from (5.2) in Proposition 5.6 i) and from Proposition 5.7 applied with the form t associated with T, noting
that, for every n∈N, D(THn)=Hn⊂D(T) and ⟨THnxn,xn⟩=⟨Txn,xn⟩ for xn∈Hn.
ii), iii)
By claim i) and Proposition 5.6 i), we know that
[TABLE]
Now the two assertions follow from Theorem 5.4 ii).
∎
Remark 6.2**.**
If THn→gsrT and the subspaces Hn=R(Pn)⊂D(T), n∈N, are invariant for T, then
[TABLE]
Here the inclusion ‘⊃’ follows from the first assumption, see Remark 5.3, while the inclusion ‘⊂’ follows from Definition 5.2 iii) since in this case D(Tn)=Hn⊂D(T) and Tn=PHnT∣Hn=T∣Hn, n∈N.
The following result, together with its more detailed versions Theorem 6.4 and Theorem 6.7, constitutes one of the key advances of this paper.
It shows that We(T) is the smallest possible set that captures spectral pollution for projection methods.
The proof is split in two steps and shows even more. Given an arbitrary λ∈We(T) and
finite-dimensional subspaces Vn, we construct subspaces Hn=Vn⊕span{en} with
Vn close to Vn so that λ is a spurious eigenvalue for the projection method onto Hn;
if W(T)=C or D(T)∩D(T∗)=H, we can even choose Vn=Vn.
Theorem 6.3**.**
Assume that D(T)=H.
Then, for any λ∈We(T) there exists a sequence of finite-dimensional subspaces Hn⊂D(T), n∈N, such that
[TABLE]
and hence, for this projection method, λ∈We(T)\σ(T) is a spurious eigenvalue.
In the first step of the proof of Theorem 6.3 we show
that arbitrary compact subsets of We1(T) can be filled with spurious eigenvalues.
Since We1(T)=We(T) if W(T)=C or D(T)∩D(T∗)=H, see Theorem 3.1,
this completes the proof of Theorem 6.3 in this case.
Theorem 6.4**.**
Assume that D(T)=H. Let Vn⊂D(T), n∈N, be finite-dimensional subspaces such that PVn→sI.
Then, for any compact Ω⊂We1(T), there exist finite-dimensional subspaces Hn⊂D(T), n∈N,
with Vn⊂Hn and with the following properties:
[TABLE]
and if Ω⊂intWe1(T) is a finite set, then σ(THn)=σ(TVn)∪Ω.
If, in addition,
(a)
W(T)=C* or D(T)⊂D(T∗);*
2. (b)
TVn→gsrT* with corresponding
λ0∈/W(T) if W(T)=C and λ0∈/Ω otherwise,*
then the subspaces Hn⊂D(T),n∈N, can be constructed so that
THn→gsrT.
Remark 6.5**.**
Theorem 6.4 contains various earlier results as special cases:
i)
For bounded operators, assumption (a) holds automatically and assumption (b) is satisfied for any sequence of subspaces (Vn)n∈N with
PVn→sI, and hence [15, Theorem 3], [33] are contained in Theorem 6.4.
2. ii)
For selfadjoint operators, conv σe(T)=We(T)=We1(T) by Theorem 3.8,
and thus [29, Theorem 2.1], [30, Theorem 1.1] are contained in Theorem 6.4.
For the proof of Theorem 6.4 we need the following lemma.
Lemma 6.6**.**
Let V⊂D(T) be a finite-dimensional subspace.
Then, for given λ∈We1(T) and ε>0, there exist x∈V⊥∩D(T), ∥x∥=1, and μ∈Bε(λ) such that
[TABLE]
with a linear operator A:span{x}→V and therefore σ(TVx)=σ(TV)∪{μ}.
Moreover, we can choose A=0 if D(T)=H and D(T)⊂D(T∗),
and we can choose μ=λ if λ∈intWe1(T).
Proof.
Let λ∈We1(T) and ε>0 be fixed.
By definition, see Theorem 3.1, We1(T) is the intersection of W(T∣U⊥∩D(T)) over all finite-dimensional subspaces U⊂H.
Hence if we choose
[TABLE]
there exists μ∈Bε(λ) such that
[TABLE]
Since x∈U⊥, we have
[TABLE]
which implies the representation (6.1). Clearly, the matrix representation of TVx yields that σ(TVx)=σ(TV)∪{μ}.
If D(T)=H and D(T)⊂D(T∗), we can even choose U:={\rm span}\big{(}V\cup\mathcal{R}(T|_{V})\cup\mathcal{R}(T^{*}|_{V})\big{)}. Then (6.2) yields that
Let n∈N. There exists a finite open covering
{Dk;n:k=1,…,Nn} of Ω by open disks of radius 1/n.
By applying Lemma 6.6 inductively Nn times with ε:=1/n, we construct orthonormal elements
x1;n,…,xNn;n∈Vn⊥∩D(T)
and points μk;n∈D1;n,…,μNn;n∈DNn;n such that
[TABLE]
satisfies PHn→sI and
[TABLE]
If Ω⊂intWe1(T) is a finite set,
then we choose the covering so that the centre of each Dk;n is a point in Ω and so σ(THn)=σ(TVn)∪Ω.
For a general compact subset Ω⊂We1(T), by construction of the disks Dk;n,k=1,…,Nn, we have
[TABLE]
Now we show THn→gsrT if assumptions (a) and (b) hold.
First we consider the case W(T)=C in (a) where λ0∈⋂n∈Nϱ(TVn)∩ϱ(T) in (b) satisfies λ0∈/W(T).
Then, since σ(THn)⊂W(THn)⊂W(T),
we have λ0∈ϱ(THn) and
[TABLE]
Lemma 6.6 yields that the matrix representation of THn in Hn
given by (6.3)
is upper triangular. Now assumption (b) implies that
[TABLE]
In addition, the uniform bound for the resolvents in (6.5) and PHn→sI show that
It remains to consider the case D(T)⊂D(T∗) in (a) where λ0∈⋂n∈Nϱ(TVn)∩ϱ(T) in (b) satisfies λ0∈/Ω.
Then Lemma 6.6 implies that the representation of THn in Hn given by (6.3)
is block-diagonal. Hence
[TABLE]
Since λ0 satisfies (TVn−λ0)−1PVn→s(T−λ0)−1, it suffices to show that
[TABLE]
Since λ0∈/Ω by assumption, we have dist(λ0,Ω)>0.
By (6.4), the eigenvalues μk;n∈σ(THn), k=1,…,Nn, lie in the 2/n-neighbourhood of Ω.
If we choose n∈N so large that 2/n<dist(λ0,Ω)/2,
then ∣μk;n−λ0∣≥dist(λ0,Ω)/2. Hence, for every x∈H,
[TABLE]
The next theorem is the second step in the proof of Theorem 6.3. It
shows that, if We1(T)⊊We(T), it is even possible to produce spectral pollution in We(T)\We1(T)
if we allow for a modification of the given subspaces Vn.
Theorem 6.7**.**
Assume that D(T)=H. Let Vn⊂D(T), n∈N, be finite-dimensional subspaces such that PVn→sI and
let εn>0, n∈N, with εn→0 as n→∞.
Then, for any λ∈We(T)\σ(T) and every n∈N, there exist a finite-dimensional subspace Vn⊂D(T) and
en∈Vn⊥∩D(T), ∥en∥=1, with
[TABLE]
and such that
[TABLE]
for some linear operator Bn:Vn→span{en}. Hence
[TABLE]
so if λ∈We(T)∖σ(T), then λ is a spurious eigenvalue for (THn)n∈N.
Proof.
If We(T)=We1(T), all claims follow from Theorem 6.4 with Vn=Vn, n∈N.
If We1(T)⊊We(T), then W(T)=C by Theorem 3.1 and hence We(T)=W(T)=C by
Corollary 2.5 iv).
If ϱ(T)=∅, there is nothing to prove, so we may assume that ϱ(T)=∅, without loss of generality
0∈ϱ(T). This and D(T)=H imply that also D(T2)=H.
Let λ∈We(T)=C be arbitrary. Let n∈N be fixed and let δn>0 be arbitrary.
Then there exists Wn⊂D(T2) with
[TABLE]
Since W(T)=C, we know that T cannot be a multiple of the identity on any finite-codimensional subspace. Thus we can choose
Wn such that Wn∩TWn={0}, i.e.
[TABLE]
Let {y1,…,yNn} be an orthonormal basis of Wn.
By induction over k=1,…,Nn we can construct
[TABLE]
with ∥xk∥=1; by taking an appropriate linear combination of such xk, and using that T is injective, we can also achieve that
[TABLE]
For every t>0, we define the pairwise orthogonal elements
[TABLE]
and set Wn(t):=span{w1(t),…,wNn(t)}. Note that R(T∣Wn(t))⊂D(T). Further note that the set {Txj:j≤Nn}∪{Tyj:j≤Nn}
is linearly independent due to the injectivity of T and by (6.11).
Next we prove, by induction over k=1,…,Nn and using Lemma 2.7 i), that for all but finitely many t1,…,tk,s1,…,sk∈C,
the set {wj(tj):j≤k}∪{Txj:j≤k}∪{Tyj:j≤Nn} is linearly independent and
[TABLE]
As in the proof of Theorem 3.1, see the proof of Claim 2) therein, we will apply Lemma 2.7 i) successively in a sequence of subspaces X1⊃X2⊃… of H of finite codimension to which T is compressed.
Let k=1. Since y1,x1∈D(T) are linearly independent, Lemma 2.7 i) in H yields that
[TABLE]
for all but finitely many t1∈C.
Using (6.11), (6.12) and the property that Wn∩TWn={0},
it is not difficult to check that,
for all but at most one t1∈R, the set {w1(t1),Tx1}∪{Tyj:j≤Nn} is linearly independent.
We fix such a t1 that also satisfies (6.14),
set X1:=w1(t1)⊥ and let P1:H→X1 be the orthogonal projection in H onto X1. Then,
since T is injective, it follows that
P1Ty1, P1Tx1∈D(T)∩X1
are non-zero and linearly independent.
Hence Lemma 2.7 i) in X1 shows that W(T∣{w1(t1),Tw1(s1)}⊥∩D(T))=C for all but finitely many s1∈C.
This proves (6.13) for k=1.
Now assume that
the induction hypothesis holds for some k∈{1,…,Nn−1} and fix some admissible t1,…,tk,s1,…,sk∈C.
Then (6.11), (6.12) and the property that Wn∩TWn={0}
imply that {yk+1,xk+1}∪{wj(tj):j≤k}∪{Twj(sj):j≤k} is linearly independent.
Set X2k:=({wj(tj):j≤k}∪{Twj(sj):j≤k})⊥
and let Qk:H→X2k be the orthogonal projection in H onto X2k.
Then Qkyk+1, Qkxk+1∈D(T)∩X2k are non-zero and linearly independent.
Now Lemma 2.7 i) in X2k yields
[TABLE]
for all but finitely many tk+1∈C.
By the linear independence induction hypothesis, using (6.11), (6.12) and the injectivity of T, one can prove that
for all but at most one tk+1∈C, the set {wj(tj):j≤k+1}∪{Txj:j≤k+1}∪{Tyj:j≤Nn} is linearly independent.
We fix such a tk+1 that also satisfies (6.15),
and let Pk+1:H→X2k+1 be the orthogonal projection in H onto X2k+1:=({wj(tj):j≤k+1}∪{Twj(sj):j≤k})⊥.
Then Pk+1Tyk+1, Pk+1Txk+1∈D(T)∩X2k+1 are non-zero and linearly independent.
Finally, Lemma 2.7 i) in X2k+1 shows that (6.13) holds for k+1 and for all but finitely many sk+1∈C. This proves the induction step.
From (6.13) with k=Nn and letting t1=⋯=tNn=t and s1=⋯=sNn=t, we conclude that, for all but finitely many t∈C,
[TABLE]
Thus for all but finitely many t∈C, there exists e(t)∈(Wn(t)∪R(T∣Wn(t)))⊥∩D(T), ∥e(t)∥=1, with
⟨Te(t),e(t)⟩=λ. Note that ⟨Tw,e(t)⟩=0 for every w∈Wn(t). Now we choose δn and t so small that
(6.8) and (6.9) hold with Vn:=Wn(t) and en:=e(t).
From the representation (6.9), it follows that σ(THn)=σ(TVn)∪{λ}.
The property (6.8) and εn→0 imply ∥PVn−PVn∥→0.
Together with PVn→sI, this yields PVn→sI, and hence PHn→sI since Vn⊂Hn.
∎
Let Vn⊂D(T), n∈N, be arbitrary finite-dimensional subspaces with PVn→sI.
If We1(T)=We(T), we apply Theorem 6.4; if We1(T)⊊We(T) we
apply Theorem 6.7, to complete the proof of Theorem 6.3.
∎
The next example gives an explicit construction of the subspaces Hn, n∈N, in Theorem 6.4
so that the corresponding projection method has a given point λ∈We1(T)\σ(T) (even
λ∈We(T)\σ(T) if W(T)=C) as a spurious eigenvalue.
Example 6.8**.**
Let A:=T+S where T, S are the neutral delay differential operators introduced in Remark 4.11 with their matrix representations in Example 4.10 with respect to span{cos(k⋅),sin(k⋅):k∈N}⊂D(A).
It is not difficult to check that the spectrum of the lower triangular infinite matrix A is given by its diagonal entries,
σ(A)={k2:k∈N} and σe(A)={1}. For the latter note that, while for k≥2 all eigenvalues k2 are simple, 1 is an eigenvalue of
infinite geometric multiplicity (with one two-dimensional algebraic eigenspace), and σe(A)⊂⋂KcompactK∈L(H),σ(A+K)={1}.
According to Example 4.10 the essential numerical range of A is given by
[TABLE]
In particular, W(A)=C and hence assumption (a) of Theorem 6.4 is satisfied.
For the projection method onto the subspaces
[TABLE]
Theorem 6.1 i) shows that We((AHn)n∈N)=We(A), and
it is easy to see that σ(AVn)={k2:k=1,…,n}. Thus,
for every λ0∈ϱ(A) we have λ0∈ϱ(AVn), n∈N, and
[TABLE]
Hence also assumption (b) of Theorem 6.4 is satisfied.
According to Theorem 6.4, for every λ∈We(A), there exist finite-dimensional extensions Hn⊃Vn,
n∈N, and λ∈σ(AHn), n∈N, with λn→λ.
In fact, if λ∈We(A), then there exists γ∈C so that λ=∣γ∣2+1+γ. If we set
[TABLE]
and Hn:=Vn⊕span{fn+1}, then
[TABLE]
Since the subspaces Vn, n∈N, are invariant under A, Remark 6.2 and the decomposition Hn=Vn⊕span{fn+1} yield that
[TABLE]
So, starting from a given projection method onto subspaces Vn, n∈N, for an arbitrary point λ∈We(A)∖σ(A) we have explicitly constructed a projection method onto subspaces Hn⊃Vn with λ as a point of spectral pollution.
Note that here the inclusion convσe((AHn)n∈N)⊊We((AHn)n∈N) is strict since, by Remark 6.2 and Theorem 6.1 i),
[TABLE]
The following example shows that Theorem 6.7 is sharp in the following sense.
Without the modification of the subspaces Vn it may happen that, if the inclusion We1(T)⊂We(T) is strict,
only points λ∈We1(T) can be arranged to be spurious eigenvalues. Recall that We1(T)⊊We(T) necessitates We(T)=W(T)=C.
Example 6.9**.**
In Example 3.5 we considered a selfadjoint operator T0 in H with σ(T0)=σe(T0)=R and S with D(S)=D(T0)
is of the form S=QΦ where Φ:H→C is an unbounded linear functional which is T0-bounded and Q:C→H, Qz=zg with fixed
g∈H∖{0}. We showed that We1(T)=R⊊C=We(T). Moreover, since S is T0-compact, σ(T)=σe(T)=σe(T0)=R.
Here we wish to choose g∈kerT0∩kerΦ. This can be achieved, e.g. by choosing T0 such that kerT0={0},
Φ:=⟨T0⋅,y⟩ with y∈/D(T0) and g∈kerT0.
Let Vn⊂D(T), n∈N, with PVn→sI be such that g∈Vn, n∈N.
Suppose that Ω⊂We(T)\We1(T)=C\R is compact, and assume there exist subspaces Hn⊃Vn as in Theorem 6.4 filling Ω with spectral pollution,
i.e. supλ∈Ωdist(λ,σ(THn))→0 as n→∞. Because g∈Vn⊂Hn, we can write Hn=span{g}⊕Un.
Then Tg=0, Sg=Φ(g)g=0 by the choice of g, SUn=0 since Un⊥g and so, because T0 is selfadjoint,
[TABLE]
Since Ω⊂C\R is compact, this contradicts supλ∈Ωdist(λ,σ(THn))→0 as n→∞.
Hence no such subspaces Hn, n∈N, can exist.
7. Application II: Domain truncation method
In this section we study spectral exactness of domain truncation methods for strongly elliptic partial
differential operators A in L2(Rd)
with arbitrary dimension d∈N. We show that, for domain truncation to bounded nested Ωn exhausting Rd and Dirichlet conditions,
spectral pollution is confined to the essential numerical range We(A) and every isolated λ∈σ(A) is approximated.
More precisely, we consider a strongly elliptic
differential operator A of even order 2m∈N, induced by the quadratic form
[TABLE]
with coefficients Qα,β∈L∞(Rd) for all α,β∈N0d with ∣α∣+∣β∣≤2m
and constant leading coefficients, Qα,β:=cα,β∈C if ∣α∣+∣β∣=2m. This means the associated principal symbol
[TABLE]
is independent of x∈Rd and satisfies
[TABLE]
since p is homogeneous, this implies that
p2m is sectorial, i.e. there exist a2m, b2m≥0 with
[TABLE]
Note that (7.1) allows for both divergence form (i.e. Qα,β=0 if ∣α∣>m or ∣β∣>m) and non-divergence form
(i.e. Qα,β=0 if β>0) with L∞(Rd)-coefficients.
Theorem 7.1**.**
Let Ωn⊂Rd, n∈N, be bounded nested domains exhausting Rd and, if d≥2, with boundaries of class C.
Then the m-sectorial operators A, An, n∈N, associated with the densely defined, closed and sectorial forms a and
an:=a∣H0m(Ωn) in L2(Rd) and L2(Ωn), n∈N, respectively, satisfy the following:
i)
An, n∈N, have compact resolvents,
An⟶gsrA as well as An∗⟶gsrA∗, and
[TABLE]
2. ii)
Spectral pollution is confined to We(A),
[TABLE]
3. iii)
Every isolated λ∈σ(A) outside We(A) is approximated by (An)n∈N.
Proof.
i)
First we define the principal part of A,
[TABLE]
Since A is strongly elliptic, and hence (7.2), (7.3) hold, T is m-sectorial and C0∞(Rd) is a core of T, see [16, Prop. IX.6.4, Cor. IX.6.7].
The corresponding quadratic form
[TABLE]
is densely defined, closed and sectorial.
Since Qα,β∈L∞(Rd), Fourier analysis reveals that
the quadratic form s:=a−t is Ret-bounded with relative bound [math], i.e. for every ε>0 there exists aε>0, without loss of generality aε≥1, such that
[TABLE]
Hence [26, Theorem VI.3.4] implies that a is also densely defined, closed and sectorial, and the associated m-sectorial operator A satisfies, for ε∈(0,1/2),
[TABLE]
Next we introduce Tn, tn, sn, n∈N, in the same way as T, t, s but with domains
[TABLE]
Note that, H0m(Ωn)⊂Hm(Rd) if we extend every function by zero outside Ωn. Therefore (7.6) and (7.8) continue to hold if we replace s,t,A,T by sn,tn,An,Tn.
Let f∈D(A). We construct fn∈D(An), n∈N, so that
[TABLE]
To this end, let ε∈(0,1/2) and λε∈(−∞,−aε/ε). Then
[TABLE]
For every ϕ∈C0∞(Rd) there exists n0(ϕ)∈N such that
[TABLE]
The m-sectoriality of T, Tn, n∈N, implies that
supn∈N∥(Tn−λε)−1∥<∞ and, using that C0∞(Rd) is a core of T and [6, Theorem 3.1],
[TABLE]
Define
[TABLE]
Then (7.8) and the inequalities λε<−aε/ε≤−1/ε yield
[TABLE]
By taking first ε small enough and then n large enough, the right hand side can be made arbitrarily small, which proves the first convergence in (7.7).
The second convergence in (7.7) follows from
[TABLE]
Now fix ε∈(0,1/2) and λε<−aε/ε as in the construction of fn in (7.9) satisfying (7.7). Then the m-sectoriality of An, n∈N, implies supn∈N∥(An−λε)−1∥<∞.
Let g∈L2(Rd) and define f:=(A−λε)−1g∈D(A).
Then, by (7.7), (7.9),
[TABLE]
This proves An→gsrA.
Since the adjoint quadratic form a∗ satisfies
(7.2), (7.3) as well, we analogously have An∗→gsrA∗.
The strong ellipticity of A and [16, Proposition IX.6.4] imply that
Tn is H0m(Ωn)-coercive. Hence, by the compactness of the embedding of H1(Ωn) in L2(Ωn),
see e.g. [16, Theorem 4.17], the operator Tn has compact resolvent, and so has An by [26, Theorem VI.3.4] for every n∈N.
Next we use that D(An)⊂D(an)⊂D(a) and
[TABLE]
Since D(A) is a core of a by [26, Theorem VI.2.1],
it follows that W(An)⊂W(A) and hence, with Proposition 5.7,
[TABLE]
Now equality in (7.4) follows from Proposition 5.6 i).
ii), iii) Let λ∈C\We(A).
Then (7.4) and
Proposition 5.6 ii) imply that λ∈/σe((An)n∈N).
Now the claim follows from Theorem 5.4 ii) applied to the adjoint operators
if we note that σpoll((Tn∗)n∈N)=σpoll((Tn)n∈N)∗, which is immediate from Definition 5.1 ii).
∎
In some cases We(A) can be determined explicitly, e.g. if A is in non-divergence form or in divergence form, and the coefficients
are asymptotically constant. In this case, although A has complex coefficients and is not selfadjoint, the next proposition shows that We(A) is the convex hull of the range of the asymptotic symbol and hence the convex hull of the essential spectrum of A.
Proposition 7.2**.**
Suppose that A with domain D(A) in Theorem7.1*
is either given in non-divergence form, i.e. Qα,β=0 if β>0,*
[TABLE]
or in divergence form, i.e. Qα,β=0 if ∣α∣>m or ∣β∣>m,
[TABLE]
and that, in both cases, there exist cα,β∈C with
[TABLE]
Then, if we denote the limiting symbol of A by
[TABLE]
we have
[TABLE]
Proof.
Let T be the principal part of A, see (7.5) in the proof of Theorem 7.1,
and define
[TABLE]
Since A∞ has constant coefficients,
Fourier analysis and [16, Proposition IX.6.4] yield W(A∞)=convσ(A∞) and σ(A∞)=σe(A∞)={p∞(ξ):ξ∈Rd}. Now the sequence of inclusions We(A∞)⊂W(A∞)=convσe(A∞)⊂We(A∞) implies that all sets therein coincide.
Hence it remains to be shown that
We(A)=We(A∞) and σe(A)=σe(A∞).
First we consider the case that A is in non-divergence form. By definition (7.12) the differential operator A0 has order less than 2m and all the coefficients of its symbol p0(x,ξ)=∑α∈N0d,∣α∣<2m(Qα,0(x)−cα,0)ξα tend to [math] for ∣x∣→∞ by (7.11), and hence so do the coefficients of the real and imaginary part Rep0(x,ξ) and Imp0(x,ξ), respectively.
If we denote the differential operators induced by Rep0(x,ξ), Imp0(x,ξ) and Rep∞(ξ) by ReA0, ImA0 and ReA∞, respectively, it follows that ReA0 and ImA0 are ReA∞-compact, see [39, Thm. 5.5.4] or [16, Thm. IX.8.2].
Now Theorem 4.5 yields
[TABLE]
In addition, we also have that A0 is A∞-compact, which implies
[TABLE]
If A is in divergence form, assuming 0∈ϱ(ReA∞) after a possible shift of the spectral parameter, we can write
[TABLE]
with the bounded operators
[TABLE]
Due to assumption (7.11), Gα,β is compact, see [16, Thm IX.8.2], and hence so is (ReA∞)−1/2A0(ReA∞)−1/2. Now Theorem 4.7 yields (7.13).
Similarly, one can show that, for λ∈C, Reλ<0, (A∞−λ)−1/2A0(A∞−λ)−1/2 is compact, noting that (A∞−λ)1/2 exists because A∞−λ is m-sectorial, see [26, Sect. V.3.11]).
It is easy to check, using that A=A0+A∞, that
[TABLE]
which shows that the difference of the resolvents of A and A∞ is compact, and so (7.14) follows.
∎
Example 7.3**.**
Consider the advection-diffusion type differential operator
[TABLE]
with complex-valued coefficients Q1, Q0∈L∞(R) such that
and Theorem 7.1 ii), iii) together with
Proposition 7.2 yield that, for the truncated operators An, n∈N, on intervals (an,bn) with an→−∞, bn→∞ as n→∞, and Dirichlet conditions at an, bn,
[TABLE]
and every isolated λ∈σ(A) outside the parabolic region on the right hand side is approximated by (An)n∈N.
If Q1, Q0 are real-valued, then
interval truncation with Dirichlet boundary conditions can only produce real eigenvalues.
Indeed, in this case, if e.g. Q1∈W1,∞(R) each truncated operator An can be transformed to an operator An
still satisfying our assumptions which has the same eigenvalues
without first order term and with real-valued potential, given by An=−dx2d2+Q0 with
Q0=Q0−21Q1′+41(Q1)2∈L∞(R) subject to Dirichlet boundary conditions.
The transformed operator An has real numerical range satisfying
[TABLE]
independently of n. Together with our new result (7.16), this shows that, in this case,
spurious eigenvalues are confined to
[TABLE]
but also that the approximation (An)n∈N is not spectrally inclusive since no non-real spectral point λ∈σ(A)\R, and
so, in particular, none of the non-zero points on the parabola σe(A), is approximated.
That the inclusion (7.17) is sharp follows if we consider the
special case Q1≡−2, Q0≡0.
Here Q0≡1 so that (7.17) yields σpoll((An)n∈N)⊂[1,∞).
As remarked by Davies [13], the set of eigenvalues of An is given by σ(An)={1+4sn2π2k2:k∈N}
and hence the set of accumulation points λ=limn→∞λn with λn∈σ(An) is the whole interval
[1,∞); since here σ(A)=σe(A) is the parabola in (7.15), [1,∞) consists entirely of spurious eigenvalues.
Another interesting example is the special case Q1≡−2, Q0(x):=20sin(x)e−x2, x∈R, considered in
[5].
Here Q0(x)=Q0(x)+1, x∈R, and essinfQ0≈−6.933 and hence
(7.17) yields σpoll((An)n∈N)⊂[0,∞).
The eigenvalues of the truncated operator An on the interval [−sn,sn] with Dirichlet boundary conditions,
which were computed numerically using a shooting method implemented in Wolfram Mathematica, are shown in Figure 2
for increasing values of sn∈[0,9].
Our result (7.16) shows, first, that all accumulation points in [0,∞) may be spurious and,
secondly, that the accumulation point λ≈−3.25 which does not belong to We(A) is not a spurious but a true eigenvalue,
i.e. λ∈σ(A), see also Figure 1.
This result agrees with the spectral exactness results of [5, Section 4.2]
by which
the only discrete eigenvalue of A in the box [−5,10]+[−5,5]i is the point λ≈−3.25.
Acknowledgements.
The authors thank Y. Arlinskii, L. Boulton and W. Des Evans for fruitful discussions. They
also gratefully acknowledge the support of the Swiss National Science Foundation (SNF),
grant no. 200020_146477 (S.B., C.T.) and Early Postdoc Mobility project P2BEP2_159007 (S.B.).
Bibliography42
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Appert, K., Balet, B., Gruber, R., Troyon, F., and Vaclavik, J. Numerical problems associated with the presence of continuous spectra. Comput. Phys. Comm. 24 , 3-4 (1981), 329–335.
2[2] Arlinskii, Z., and Tretter, C. . Preprint, 2018.
3[3] Bailey, P. B., Everitt, W. N., Weidmann, J., and Zettl, A. Regular approximations of singular Sturm-Liouville problems. Results Math. 23 , 1-2 (1993), 3–22.
4[4] Baĭnov, D. D., and Mishev, D. P. Oscillation theory for neutral differential equations with delay . Adam Hilger, Ltd., Bristol, 1991.
5[5] Bögli, S. Local convergence of spectra and pseudospectra. Accepted for publication in J. Spectr. Theory . ar Xiv:1605.01041 [math.SP], 2016.
6[6] Bögli, S. Convergence of Sequences of Linear Operators and Their Spectra. Integral Equations and Operator Theory 88 , 4 (2017), 559–599.
7[7] Bögli, S., Siegl, P., and Tretter, C. Approximations of spectra of Schrödinger operators with complex potentials on ℝ d superscript ℝ 𝑑 \mathbb{R}^{d} . Comm. Part. Diff. Eq. 42 , 7 (2017), 1001–1041.
8[8] Boulton, L., Boussaïd, N., and Lewin, M. Generalised Weyl theorems and spectral pollution in the Galerkin method. J. Spectr. Theory 2 , 4 (2012), 329–354.