The spectral mapping theorem for polynomials
Statement
Let with complex spectrum , and let be a polynomial. Show that (and in fact the eigenvalues of with multiplicities are the ).
Hint
Work over and triangularise .
Show solutionHide solution
Solution
Triangularisation (Schur). Over there is an invertible with , upper triangular with diagonal entries , the eigenvalues of repeated according to multiplicity.
Powers. for all . A product of upper triangular matrices is upper triangular, with diagonal entries equal to the products of the diagonal entries; so is upper triangular with diagonal .
Polynomials. If , then , and is upper triangular with diagonal entries .
Conclusion. The characteristic polynomial of is that of , namely . Therefore the spectrum of is .
Example. If is nilpotent, , so has spectrum and is invertible. If (projection), because gives .
Remark. The real spectrum is not enough: has no real eigenvalue but gives . The theorem must be applied over .