Suppose is a self-adjoint operator on a finite-dimenaional real inner product space and are scalars such that . Then is an invertible operator.
Proof:
We will show that for every non-zero , the inner product is a positive scalar multiple of the norm of . Let be non-zero. Then
with the first inequality come from Cauchy-Schwatz and the last coming from both and being positive. Because would make , there can be no non-zero vectors in the kernel of . Therefore is invertible.
Suppose is a self-adjoint operator on a real inner product space . Then the minimal polynomial of splits into linear factors.
Proof:
We know that monic polynomials over 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 with invertible, which would contradict the minimality of the degree of the minimal polynomial.
Suppose is an operator on a real inner product space . Then the following are equivalent. a) is self-adjoint. b) has a diagonal matrix with respect to an orthonormal basis of . c) has an orthonormal basis consisting of eigenvectors of .
Proof:
(b) and (c) are clearly equivalent, so we will prove the equivalence between (a) and (b). (a)(b): Suppose is self-adjoint. Then from the last result, has an upper triangular matrix with respect to an orthonormal basis because it has a minimal polynomial that splits into linear factors. Now because is self-adjoint, this matrix must be symmetric and therefore diagonal. (a)(b): If has a diagonal matrix with respect to an orthonormal basis then the matrix of is just the transpose of this diagonal matrix, which is of course symmetric. So .
Suppose is an operator on a complex inner product space . Then the following are equivalent. a) is normal. b) has a diagonal matrix with respect to an orthonormal basis of . c) has an orthonormal basis consisting of eigenvectors of .
Proof:
(b) and (c) are clearly equivalent, so we will prove the equivalence between (a) and (b). (a)(b): Suppose is normal. Because is a complex vector space, there is an orthonormal basis with respect to which the matrix of is upper-triangular. Then is the square of the absolute value of the top right matrix entry, while is the sum of the squares of the absolute values of the top row's entries. Now, means that all the other top row entries must be 0. This allows us to say that 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)(b): Because diagonal matrices commute, and must also commute.