logo

Characteristics Polynomial of Linear Transformation 📂Linear Algebra

Characteristics Polynomial of Linear Transformation

Overview

The characteristic polynomial of linear transformation is defined. From the theorem below, it can be seen that solving equation det(AλI)=0\det(A - \lambda I) = 0 is equivalent to finding the eigenvalues. Therefore, it is quite natural to name det(AλI)\det(A - \lambda I) the characteristic polynomial.

Theorem1

Let’s say FF is any field, and AMn×n(F)A \in M_{n\times n}(F). That λF\lambda \in F is an eigenvalue of AA is equivalent to det(AλI)=0\det (A-\lambda I) = 0.

Proof

Assume λ\lambda is an eigenvalue of AA. Then,

λ is eigenvalue of A    non-zero v such that Av=λv    non-zero v such that (AλI)v=0 \begin{align*} \lambda \text{ is eigenvalue of } A &\iff \exist \text{non-zero } v \text{ such that } Av = \lambda v \\ &\iff \exist \text{non-zero } v \text{ such that } (A - \lambda I)v = 0 \end{align*}

Conditions Equivalent to Invertibility

Let’s say AA is a square matrix of size n×nn\times n. Then, the following propositions are all equivalent:

By the conditions equivalent to invertibility, AλIA - \lambda I is not invertible, and det(AλI)=0\det (A - \lambda I) = 0.

Definition

Let’s say AMn×n(F)A \in M_{n \times n}(F). The polynomial f(t)=det(AtI)f(t) = \det(A - tI) is called the characteristic polynomial of AA. f(t)=0f(t) = 0 is called the characteristic equation.

Let VV be a vector space of dimension nn. Let T:VVT : V \to V be a linear transformation. Let β\beta be an ordered basis of VV. The characteristic polynomial f(t)f(t) of TT is defined as the characteristic polynomial of the matrix representation of TT. In other words, f(t)f(t) is as follows.

f(t)=det([T]βtI) f(t) = \det\left( \begin{bmatrix} T \end{bmatrix}_{\beta} - t I \right)

Explanation

According to the definition, the roots of the characteristic polynomial of T:VVT : V \to V are precisely the eigenvalues, and if the characteristic polynomial is factorable, TT has n=dim(V)n = \dim(V) eigenvalues (not said to be distinct).

By definition, it might seem that the characteristic polynomial of TT depends on how the ordered basis β\beta is chosen, but in reality, it does not. For this reason, the characteristic polynomial of the linear transformation TT is sometimes denoted as follows.

det(TλI) \det (T - \lambda I)

Let’s check. If β\beta, β\beta^{\prime} are the ordered bases of VV, and QQ is the change of basis matrix that converts β\beta coordinates into β\beta^{\prime} coordinates, then,

det([T]βtI)=det([T]βtI)detQ1detQ=detQ1det([T]βtI)detQ=det(Q1([T]βtI)Q)=det(Q1[T]βQtI)=det([T]βtI) \begin{align*} \det( \begin{bmatrix} T \end{bmatrix}_{\beta} - tI) &= \det( \begin{bmatrix} T \end{bmatrix}_{\beta} - tI ) \det Q^{-1} \det Q \\ &= \det Q^{-1} \det( \begin{bmatrix} T \end{bmatrix}_{\beta} - tI ) \det Q \\ &= \det \left( Q^{-1} (\begin{bmatrix} T \end{bmatrix}_{\beta} - tI) Q \right) \\ &= \det \left( Q^{-1}\begin{bmatrix} T \end{bmatrix}_{\beta}Q - tI \right) \\ &= \det \left( \begin{bmatrix} T \end{bmatrix}_{\beta^{\prime}} - tI \right) \end{align*}


  1. Stephen H. Friedberg, Linear Algebra (4th Edition, 2002), p248 ↩︎