224a
An operator is densely defined if is a dense subspace of . 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.
One thing that we will use often which works exactly the same way is equivalence under invertible transformations: if then .
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 and on various subspaces of 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 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. on .
Example 2. on , the space of compactly supported continuous functions.
Example 3. on .
We will focus on operators which have "maximal" domains in the following sense.
Definition. is closed if whenever a sequence satisfies and , one has and . This is equivalent to saying that the graph is closed as a subspace of 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 where is a smooth cutoff supported on . Then we have in and the images also converge in (via a dominated convergence argument), but .
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 is invertible for a closed 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 is not closed, define its closure to be the operator with graph , provided this closure contains no points of type (this is necessary and sufficient for a graph to correspond to a linear operator). Then refers to .
If , the domain of the adjoint is
which is the set of such that the functional is continuous on .
The adjoint is then defined via the Riesz theorem as the unique such that for all . 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 is symmetric if , and selfadjoint if and . 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 since we trivially have for every . Thus, every symmetric operator satisfies
which means is an extension of .
We now check that example 1 is selfadjoint: suppose . This means that there is a constant such that for all . Choose for a cutoff function on . Plugging this into the above, we have
Letting , monotone convergence implies that , implying , as desired.
Example 2 is not selfadjoint. To see this, consider . A simple calculation shows that is continuous in , so but clearly .
For the third example, Dimock 1.3.1:ex1.3 shows that for , so has an eigenvalue of . We will show in the next section that this contradicts selfadjointness.
The spectrum of the first example is easily seen to be . In general, if is any measurable function, the multiplication operator defined on has spectrum equal to the essential range of ; the proof is the same as in the bounded case.
One can show that the closure of is actually the operator from the previous lecture. Since is unitarily equivalent to via the Fourier transform, its spectrum is also .
In general, an operator is called essentially selfadjoint if its closure is selfadjoint.
We now characterize the spectra of selfadjoint operators.
Theorem. If is self-adjoint, .
Proof. Dimock 1.3.2:thm1.8. The proof is identical to the selfadjoint case, which crucially uses the identity . This is where selfadjointness is essential: if then this identity doesn't hold.
In particular, this shows that example is not selfadjoint.
We end by stating a very concrete criterion for checking selfadjointness which how one checks this property in practice.
Theorem. If is symmetric, the following are equivalent:
Proof. Dimock 1.3.2:thm1.9 for parts 1 and 2. For the full theorem, see Reed and Simon VIII.3