7B Spectral Theorem


Topics

  • Real Spectral Theorem
  • Complex Spectral Theorem


Real Spectral Theorem


Content

  • Lemma: Invertible Quadratic Expressions
  • Lemma: Minimal Polynomial of a Self-adjoint Operator
  • Corollary: Real Spectral Theorem

Lemma: Invertible Quadratic Expressions

Suppose TT is a self-adjoint operator on a finite-dimenaional real inner product space VV and b,cRb, c \in \mathbb{R} are scalars such that b2<4cb^2 < 4c. Then p(T)=T2+bT+cIp(T) = T^2 + bT + cI is an invertible operator.

Proof:

We will show that for every non-zero vVv \in V, the inner product p(T)(v),v\langle p(T)(v), v \rangle is a positive scalar multiple of the norm of vv. Let vVv \in V be non-zero. Then

(T2+bT+cI)(v),v=T2(v),vbT(v),v+cv,v \langle (T^2 + bT + cI)(v), v \rangle = \langle T^2(v), v \rangle - b \langle T(v), v \rangle + c \langle v, v \rangle

T(v)2+bT(v)v+cv2 \geq \Vert T(v) \Vert^2 + |b| \cdot \Vert T(v) \Vert \cdot \Vert v \Vert + c \cdot \Vert v \Vert^2

=(T(v)22b2T(v)v+b24v2)+(cb24)v2 = \left( \Vert T(v) \Vert^2 - 2\frac{|b|}{2} \Vert T(v) \Vert \cdot \Vert v \Vert + \frac{|b|^2}{4} \Vert v \Vert^2 \right) + \left( c - \frac{|b|^2}{4} \right) \Vert v \Vert^2

=(T(v)+b2v)2+(cb24)v2 = \left( \Vert T(v) \Vert + \frac{|b|}{2} \Vert v \Vert \right)^2 + \left( c - \frac{|b|^2}{4} \right) \Vert v \Vert^2

(cb24)v2 \geq \left( c - \frac{|b|^2}{4} \right) \Vert v \Vert^2

>0, > 0,

with the first inequality come from Cauchy-Schwatz and the last coming from both cb24c - \frac{|b|^2}{4} and v2\Vert v \Vert^2 being positive. Because (T2+bT+cI)(v)=0(T^2 + bT + cI)(v) = 0 would make (T2+bT+cI)(v),v=0\langle (T^2 + bT + cI)(v), v \rangle = 0, there can be no non-zero vectors in the kernel of TT. Therefore TT is invertible.

Lemma: Minimal Polynomial of a Self-adjoint Operator

Suppose TT is a self-adjoint operator on a real inner product space VV. Then the minimal polynomial of TT splits into linear factors.

Proof:

We know that monic polynomials over R\mathbb{R} factor completely into linear and quadratic factors. However, no such quadratic factors can exist in the minimal polynomial because of their positive discriminants, which would make the corresponding operator T2+bT+cIT^2 + bT + cI with b24c>0b^2 - 4c > 0 invertible, which would contradict the minimality of the degree of the minimal polynomial.

Corollary: Real Spectral Theorem

Suppose TT is an operator on a real inner product space VV. Then the following are equivalent. a) TT is self-adjoint. b) TT has a diagonal matrix with respect to an orthonormal basis of VV. c) VV has an orthonormal basis consisting of eigenvectors of TT.

Proof:

(b) and (c) are clearly equivalent, so we will prove the equivalence between (a) and (b). (a)\Rightarrow(b): Suppose TT is self-adjoint. Then from the last result, TT has an upper triangular matrix with respect to an orthonormal basis because it has a minimal polynomial that splits into linear factors. Now because TT is self-adjoint, this matrix must be symmetric and therefore diagonal. (a)\Leftarrow(b): If TT has a diagonal matrix with respect to an orthonormal basis then the matrix of TT^* is just the transpose of this diagonal matrix, which is of course symmetric. So T=TT = T^*.



Complex Spectral Theorem


Content

  • Theorem: Complex Spectral Theorem

Theorem: Complex Spectral Theorem

Suppose TT is an operator on a complex inner product space VV. Then the following are equivalent. a) TT is normal. b) TT has a diagonal matrix with respect to an orthonormal basis of VV. c) VV has an orthonormal basis consisting of eigenvectors of TT.

Proof:

(b) and (c) are clearly equivalent, so we will prove the equivalence between (a) and (b). (a)\Rightarrow(b): Suppose TT is normal. Because VV is a complex vector space, there is an orthonormal basis with respect to which the matrix of TT is upper-triangular. Then T(e1)2\Vert T(e_1) \Vert^2 is the square of the absolute value of the top right matrix entry, while T(e1)2\Vert T^*(e_1) \Vert^2 is the sum of the squares of the absolute values of the top row's entries. Now, T(e1)=T(e1)\Vert T(e_1) \Vert = \Vert T^*(e_1) \Vert means that all the other top row entries must be 0. This allows us to say that VertT(e2)2Vert T(e_2) \Vert^2 is the square of the absolute value of the second diagonal entry of the matrix, which means we can argue the other entries on the second row are also all zero. Continuing in this fashion, all entries in all rows other than each diagonal must be 0. (a)\Leftarrow(b): Because diagonal matrices commute, TT and TT^* must also commute.