logo

The Characteristic Polynomial of a Diagonalizable Linear Transformation Is Factorizable 📂Linear Algebra

The Characteristic Polynomial of a Diagonalizable Linear Transformation Is Factorizable

Definition1

The polynomial P(F)P(F) being split over FF means that there exists a constant c,a1,,anFc, a_{1}, \dots, a_{n} \in F that satisfies the following.

f(t)=c(ta1)(ta2)(tan) f(t) = c(t - a_{1})(t - a_{2})\cdots(t - a_{n})

If the polynomial f(t)f(t) that is decomposed is the characteristic polynomial of some linear transformation TT or matrix AA, we say that TT(or AA) is decomposed.

Explanation

By definition, if the characteristic polynomial of T:VVT: V \to V is decomposed, then TT has n=dim(V)n = \dim(V) eigenvalues.(It is not said that they are distinct)

An easy example is that f(t)=t2+1=(ti)(t+i)f(t) = t^{2} + 1 = (t-i)(t+i) cannot be decomposed over R\mathbb{R}.

Theorem

The characteristic polynomial of any diagonalizable linear transformation is decomposed.

Proof

Let VV be a nn-dimensional vector space, and T:VVT : V \to V be a diagonalizable linear transformation. Let β\beta be an ordered basis that makes [T]β=D\begin{bmatrix} T \end{bmatrix}_{\beta} = D a diagonal matrix.

D=[λ1000λ1000λn] D = \begin{bmatrix} \lambda_{1} & 0 & \cdots & 0 \\ 0 & \lambda_{1} & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda_{n} \end{bmatrix}

And let f(t)f(t) be the characteristic polynomial of TT. Then, since the characteristic polynomial does not depend on the choice of the ordered basis,

f(t)=det(DtI)=det[λ1t000λ1t000λnt]=(λ1t)(λ2t)(λnt)=(1)n(tλ1)(tλ2)(tλn) \begin{align*} f(t) &= \det(D - tI) = \det \begin{bmatrix} \lambda_{1} - t & 0 & \cdots & 0 \\ 0 & \lambda_{1} - t & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda_{n} - t \end{bmatrix} \\ &= (\lambda_{1} - t)(\lambda_{2} -t)\cdots(\lambda_{n}-t) \\ &= (-1)^{n}(t-\lambda_{1})(t-\lambda_{2})\cdots(t-\lambda_{n}) \end{align*}


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