16 Adjoints, the Spectral Theorem, and Orthogonal Operators
Recall. A (finite-dimensional!) inner product space is an
(and then we set
We’ve seen that there exists an orthonormal basis:
so
Operators on inner product spaces
Let
Definition 16.1. Say
(In other terms,
Remark (Remarks).
Orthogonal operators map orthonormal bases to orthonormal bases!
In particular, orthogonal operators are always invertible!If
is orthogonal then is orthogonal: If are orthogonal then so is (check!). Hence: orthogonal operators form a subgroup of .If
is the matrix representing in an orthonormal basis, then . Indeed, the entries of are the dot products of the columns of !
Adjoint operator
Definition 16.2. Let
Indeed: given
Equivalently:
Proposition 16.3.
; .
Proof. (1)
Definition 16.4.
In an orthonormal basis
Hence:
Note that self-adjoint operators (
Proposition 16.5. If
Proof. Let
Theorem 16.6 (The spectral theorem for real self-adjoint operators). If
The proof uses the following key observation:
Lemma 16.7. If
Proof. For all
Corollary 16.8. If
Proof. It is enough to show
Proof of the spectral theorem.
First we show the existence of an eigenvector. Pick
, . Since are linearly dependent ( ), there exists a (nonconstant) polynomial such that . This doesn’t factor into degree 1 factors over like it would over , but it factors into linear and quadratic factors: where the are the real roots, and the are irreducible (no real roots), coming from pairs of complex conjugate roots. At least one of these operators must have a nontrivial kernel (else their product is invertible, but !). By the previous corollary, each is invertible, so in fact some must have a nontrivial kernel, hence an eigenvector!Now, diagonalization: we know there’s an eigenvector
with eigenvalue ; scaling if needed we may assume . Then is an invariant subspace, hence (by the proposition above) so is . By induction, using the inner product on induced by restricting and observing is still self-adjoint, there is a basis of , (orthonormal if we wish), such that each is an eigenvector of . Then is a basis of in which diagonalizes, and we can assume it is orthonormal.
∎
So:
Remark. This also implies: eigenvectors of
Structure of orthogonal transformations
Next: is there an analogous structure result for orthogonal transformations??
- In dimension 1:
is multiplication by a scalar, so orthogonal . - In dimension 2:
orthogonal is a rotation or a reflection. (Given an orthonormal basis , is any unit vector in the unit circle ; is also a unit vector and , so there are 2 possibilities:) Rotations (other than by or ) have no eigenvectors. Reflections have eigenvalues , with two orthogonal eigenspaces.
Notation. For
Since
Recall:
Theorem 16.9. If
- if
then ; - if
then is either a rotation or a reflection.
(In the latter case, we can further decompose into
This gives a very nice way to think about an individual transformation as built from reflections and rotations on individual subspaces, but it’s pretty useless for understanding the composition of two orthogonal transformations (whose invariant subspaces are unrelated).
Notes not reached in this lecture, covered at the start of {{LINK:L17}}
Hermitian inner products
Now on to the analogue of all this for complex vector spaces: Hermitian inner products.
As previously noted, a bilinear form on a complex vector space
Definition 16.10. A Hermitian form on a complex vector space
, ; , however (conjugate: );
and
Note. Caution: this is as in Artin. Axler has
Conjugate symmetry
Definition 16.11. A Hermitian inner product is a positive definite (conjugate-symmetric) Hermitian form, i.e.
Remark.
Still, various things carry over from the real case:
positive definite nondegenerate (i.e. ).- Given a subspace
, its orthogonal is also a subspace, and . ( -antilinearity doesn’t affect being a -subspace; positive definite implies .)
Definition 16.12. An orthonormal basis of
Theorem 16.13.
Same proof as in the real case (by induction on
Corollary 16.14. Every finite-dimensional Hermitian inner product space is isomorphic to
In matrix form: