Characteristic polynomial: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(New entry, just a stub, with anchors)
 
imported>Richard Pinch
(define for endomorphism)
Line 6: Line 6:


where ''X'' is an indeterminate and ''I''<sub>''n''</sub> is an [[identity matrix]].
where ''X'' is an indeterminate and ''I''<sub>''n''</sub> is an [[identity matrix]].
The chcracteristic polynomial is unchanged under [[similarity]], and hence be defined for an [[endomorphism]] of a [[vector space]], independent of choice of [[basis (linear algebra)|basis]].


==Properties==
==Properties==

Revision as of 16:15, 11 December 2008

In linear algebra the characteristic polynomial of a square matrix is a polynomial which has the eigenvalues of the matrix as roots.

Let A be an n×n matrix. The characteristic polynomial of A is the determinant

where X is an indeterminate and In is an identity matrix.

The chcracteristic polynomial is unchanged under similarity, and hence be defined for an endomorphism of a vector space, independent of choice of basis.

Properties

  • The characteristic polynomial is monic of degree n;
  • The set of roots of the characteristic polynomial is equal to the set of eigenvalues of A.

Cayley-Hamilton theorem

The Cayley-Hamilton theorem states that a matrix satisfies its own characteristic polynomial.