Try   HackMD

Lecture 17: Unbounded Operators


tags: 224a

Densely Defined Operators, Extensions

An operator

T:D(T)H is densely defined if
D(T)
is a dense subspace of
H
. Many of the subtleties of dealing with such operators are related to the fact that there may be many reasonable choices of domain, and this choice matters a lot because e.g.

  1. ker(T)
    and
    im(T)
    are now defined relative to
    D(T)
    , and this complicates crucial identities such as
    ker(T)=ran(T)
    since
    D(T)
    needn't be the same as
    D(T)
    .
  2. For two such operators, simple operations such as
    A+B
    only make sense on
    D(A)D(B)
    .
  3. The spectrum is highly sensitive to the choice of domain.

One thing that we will use often which works exactly the same way is equivalence under invertible transformations: if

A,A1L(H) then
D(ATA1)=AD(T)
.

Our goal is to develop notions of spectrum, spectral measure, and functional calculus for selfadjoint unbounded operators. These are motivated by concrete applications in physics: the position and momentum operators

Mx and
id/dx
on various subspaces of
R
are examples of such operators, and we need a way of associating spectral measures to them to make sense of experimental outcomes in quantum mechanics. Time evolution is given by the semigroup
eitA
for various unbounded operators, so we must find a way (other than power series, which doesn't work here due to unboundedness) to make sense of this.

We will have three running examples:

Example 1.

Mx on
D(Mx):={fL2(R):MxfL2(R)}
.
Example 2.
A1=id/dx
on
Cc1(R)
, the space of compactly supported continuous functions.
Example 3.
A2=id/dx
on
Cc1([0,1]){f:f(0)=f(1)=0}
.

Closed Operators

We will focus on operators which have "maximal" domains in the following sense.

Definition.

T:D(T)H is closed if whenever a sequence
fnD(T)
satisfies
fnfH
and
TfngH
, one has
fD(T)
and
Tf=g
. This is equivalent to saying that the graph
Γ(T):={<f,g>:fD(T),g=Tf}
is closed as a subspace of
H×H
in the norm topology.

Example 1 is closed (see Dimock 1.1.4:ex1.1 for a proof), and the second example is not. For the second example, consider the sequence

fn(x)=χn(x)ex2/2 where
χn(x)
is a smooth cutoff supported on
[n,n]
. Then we have
fnf=ex2/2
in
H
and the images
A1fn
also converge in
L2(R)
(via a dominated convergence argument), but
fD(T)
.

Spectrum

Spectra of closed operators are defined the same way as bounded operators (as complements of resolvent sets); see 1.2.2 of Dimock for details. The reason to insist on closed operators stems from the closed graph theorem, which implies that

zT is invertible for a closed
T
iff it is boundedly invertible, allowing the same classification into point, continuous, and residual spectra as before. The main difference from the bounded case is that the spectrum is no longer bounded.

If an operator

T is not closed, define its closure
T
to be the operator with graph
Γ(T)
, provided this closure contains no points of type
<0,g>,g0
(this is necessary and sufficient for a graph to correspond to a linear operator). Then
σ(T)
refers to
σ(T)
.

Adjoints, Symmetric and Self-adjoint Operators

If

T:D(T)H, the domain of the adjoint
T
is
D(T)={gH:C,|(g,Tf)|CffD(T)},

which is the set of
g
such that the functional
f(g,Tf)
is continuous on
D(T)
.
The adjoint
T
is then defined via the Riesz theorem as the unique
g
such that
(g,f)=(g,Tf)
for all
fD(T)
. It is shown in Dimock 1.2.3 that the adjoint of a densely defined operator is always closed (proof: its graph can be written as the kernel of another operator).

An operator

T is symmetric if
(g,Tf)=(Tg,f)
, and selfadjoint if
T=T
and
D(T)=D(T)
. Symmetry is a rather weak algebraic condition, and one can check by integration by parts that all three of our examples have it. It does, however immediately imply that
D(T)D(T)
since we trivially have
|(g,Tf)|=|(Tg,f)|Tgf
for every
gD(T)
. Thus, every symmetric operator satisfies
TT

which means
T
is an extension of
T
.

We now check that example 1 is selfadjoint: suppose

gD(Mx). This means that there is a constant
C
such that
|(g,Mxf)|2Cf2
for all
fD(Mx)
. Choose
f=xg(x)χR(x)
for a cutoff function on
[R,R]
. Plugging this into the above, we have
([R,R]x2|g(x)|2dx)2C[R,R]x2|g(x)|2dx.

Letting
R
, monotone convergence implies that
MxgL2C
, implying
gD(Mx)
, as desired.

Example 2 is not selfadjoint. To see this, consider

g(x)=ex2/2. A simple calculation shows that
(g,Tf)
is continuous in
f
, so
gD(A1)
but clearly
gD(A1)
.

For the third example, Dimock 1.3.1:ex1.3 shows that

A2g=ig for
g=ex
, so
A2
has an eigenvalue of
i
. We will show in the next section that this contradicts selfadjointness.

Spectrum of Selfadjoint operators

The spectrum of the first example is easily seen to be

R. In general, if
g:RC
is any measurable function, the multiplication operator
Mg
defined on
D(Mg):={fL2(R):gfL2(R)}
has spectrum equal to the essential range of
g
; the proof is the same as in the bounded case.

One can show that the closure of

A1 is actually the operator
A^
from the previous lecture. Since
A^
is unitarily equivalent to
Mx
via the
L2
Fourier transform, its spectrum is also
R
.

In general, an operator is called essentially selfadjoint if its closure is selfadjoint.

We now characterize the spectra of selfadjoint operators.
Theorem. If

T:D(T)H is self-adjoint,
σ(T)R
.
Proof. Dimock 1.3.2:thm1.8. The proof is identical to the selfadjoint case, which crucially uses the identity
ker(λT)=ran(λT)
. This is where selfadjointness is essential: if
D(T)D(T)
then this identity doesn't hold.

In particular, this shows that example

A2 is not selfadjoint.

We end by stating a very concrete criterion for checking selfadjointness which how one checks this property in practice.
Theorem. If

T:D(T)H is symmetric, the following are equivalent:

  1. T
    is self-adjoint.
  2. ran(T±i)=H
    .
  3. T
    is closed and
    ker(T±i)={0}.

Proof. Dimock 1.3.2:thm1.9 for parts 1 and 2. For the full theorem, see Reed and Simon VIII.3