The characteristic polynomial is
Its roots are precisely the eigenvalues of .
For square matrices of the same size over any field,
If is invertible, , so the products are similar matrices. To cover singular , introduce an indeterminate and work over the rational function field . The matrix is invertible there, hence and have the same characteristic polynomial. Both sides are polynomials in , so specialize . This proof also works over a finite field; choosing infinitely many scalars in the original field would not.
Equal characteristic polynomials do not force the products to be similar. With and , but . Both have characteristic polynomial , while their minimal polynomials are and .
For matrices over a field of characteristic zero, or of prime characteristic greater than , if
the Faddeev–LeVerrier algorithm computes the coefficients recursively from traces of powers:
For real matrices , is a real polynomial. If , it is not the zero polynomial, so some real satisfies .
Every square matrix over an algebraically closed field is similar to an upper-triangular matrix. Choose an eigenvector, extend it to a basis, and apply induction to the induced lower-right block.
Choose an eigenvector and let . The dual map preserves the annihilator of a vector subspace , of dimension one less. By induction, choose a basis of making the restriction upper triangular. Extend this to a basis of the whole dual space; its matrix remains upper triangular because is an invariant subspace. In the corresponding primal basis, the matrix is , which is lower triangular. Reversing the primal basis makes it upper triangular. Dimension zero and one start the induction. This also allows the original eigenvector to be the first vector of the resulting upper triangular basis.

Ancestors (6)

  1. Operator theory
  2. Linear algebra
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)