Difference between revisions of "Characteristic polynomial"

From Conservapedia
Jump to navigation Jump to search
(number of roots may be smaller than degree of the polynomial ....)
(example, real and complex case)
Line 6: Line 6:
  
 
The degree of this polynomial equals the length of the matrix's side. The number of roots therefore is  not greater than this number.
 
The degree of this polynomial equals the length of the matrix's side. The number of roots therefore is  not greater than this number.
 +
 +
== Example ==
 +
Take <math>A = \begin{pmatrix}1 & 9 \\ 4 & 1\end{pmatrix}</math>
 +
 +
Then <math>f_A(\lambda) = \begin{vmatrix}1-\lambda & 9 \\ 4 & 1-\lambda\end{vmatrix}</math><math>=(1-\lambda)^2-36\,</math><math>=(-5-\lambda)(7-\lambda)\,</math>.
 +
 +
So, the roots of the characteristic polynomial are {-5, 7} - and these are the eigenvalues of the matrix. If you look at the slightly different matrix
 +
 +
<math>A' = \begin{pmatrix}1 & 9 \\ -4 & 1\end{pmatrix}</math>,
 +
 +
you find the characteristic polynomial
 +
 +
<math>f_{A'}(\lambda) = x^2 - 2x +37\,</math>.
 +
 +
This polynomial has no roots in <math>\mathbb{R}</math>, so if <math>A'\,</math> describes a linear map between to two dimensional real vector spaces, then this map has no eigenvalue. However, if <math>A'\,</math> is seen as a mapping of complex vector spaces, <math>f_{A'}(\lambda) = x^2 - 2x +37</math> can be factorized:
 +
 +
<math>f_{A'}(\lambda) = (1+ 6i -\lambda)(1-6i - \lambda)\,</math>.
 +
 +
For complex spaces, the sum of algebraic multiplicities of the eigenvalues equals the degree of the characteristic polynomial.
  
 
[[Category:Linear algebra]]
 
[[Category:Linear algebra]]

Revision as of 15:42, June 2, 2010

The characteristic polynomial of a square matrix <math>A</math> is given by,

<math>f(\lambda) = \det(A-\lambda I)</math>

where <math>I</math> is the identity matrix. The roots of this polynomial are the eigenvalues of the matrix.

The degree of this polynomial equals the length of the matrix's side. The number of roots therefore is not greater than this number.

Example

Take <math>A = \begin{pmatrix}1 & 9 \\ 4 & 1\end{pmatrix}</math>

Then <math>f_A(\lambda) = \begin{vmatrix}1-\lambda & 9 \\ 4 & 1-\lambda\end{vmatrix}</math><math>=(1-\lambda)^2-36\,</math><math>=(-5-\lambda)(7-\lambda)\,</math>.

So, the roots of the characteristic polynomial are {-5, 7} - and these are the eigenvalues of the matrix. If you look at the slightly different matrix

<math>A' = \begin{pmatrix}1 & 9 \\ -4 & 1\end{pmatrix}</math>,

you find the characteristic polynomial

<math>f_{A'}(\lambda) = x^2 - 2x +37\,</math>.

This polynomial has no roots in <math>\mathbb{R}</math>, so if <math>A'\,</math> describes a linear map between to two dimensional real vector spaces, then this map has no eigenvalue. However, if <math>A'\,</math> is seen as a mapping of complex vector spaces, <math>f_{A'}(\lambda) = x^2 - 2x +37</math> can be factorized:

<math>f_{A'}(\lambda) = (1+ 6i -\lambda)(1-6i - \lambda)\,</math>.

For complex spaces, the sum of algebraic multiplicities of the eigenvalues equals the degree of the characteristic polynomial.