logo

Eigenvectors Corresponding to Distinct Eigenvalues are Linearly Independent 📂Linear Algebra

Eigenvectors Corresponding to Distinct Eigenvalues are Linearly Independent

Theorem1

Let VV be a vector space, T:VVT : V \to V be a linear transformation, and λ1,,λk\lambda_{1}, \dots, \lambda_{k} be distinct eigenvalues of TT. If v1,,vk\mathbf{v}_{1}, \dots, \mathbf{v}_{k} are eigenvectors of TT corresponding to the eigenvalue λ1,,λk\lambda_{1}, \dots, \lambda_{k}, then {v1,,vk}\left\{ \mathbf{v}_{1}, \dots, \mathbf{v}_{k} \right\} are linearly independent.

Corollary

Diagonalization

T is diagonalizable if there exist nn linearly independent eigenvectors of TT.

If T:VVT : V \to V is a linear transformation, and assuming dim(V)=n\dim(V) = n. If TT has nn distinct eigenvalues, then TT is diagonalizable.

Proof

We prove this by mathematical induction. Assume k=1k=1. Then, by the definition of eigenvectors, v10\mathbf{v}_{1} \ne \mathbf{0} holds, and {v1}\left\{ \mathbf{v}_{1} \right\} are linearly independent.

Now assume the theorem holds for k1k-1 distinct eigenvalues. And let a1,,aka_{1}, \dots, a_{k} be constants that satisfy the following equation.

a1v1++akvk=0 a_{1}\mathbf{v}_{1} + \cdots + a_{k}\mathbf{v}_{k} = \mathbf{0}

Taking TλkIT - \lambda_{k}I on both sides, since viv_{i} are eigenvectors,

a1(λ1λk)v1+ak1(λk1λk)vk1=0 a_{1}(\lambda_{1} - \lambda_{k})\mathbf{v}_{1} + \cdots a_{k-1}(\lambda_{k-1} - \lambda_{k})\mathbf{v}_{k-1} = \mathbf{0}

Then, by assumption, the following holds.

a1(λ1λk)==ak1(λk1λk)=0 a_{1}(\lambda_{1} - \lambda_{k}) = \cdots = a_{k-1}(\lambda_{k-1} - \lambda_{k}) = 0

Since we assume λi\lambda_{i} are distinct,

a1==ak1=0 a_{1} = \cdots = a_{k-1} = 0

Therefore, akvk=0a_{k}\mathbf{v}_{k} = \mathbf{0}, but since vk0\mathbf{v}_{k} \ne \mathbf{0}, it follows that ak=0a_{k} = 0. Hence,

a1==ak=0 a_{1} = \cdots = a_{k} = 0

and {v1,,vk}\left\{ \mathbf{v}_{1}, \dots, \mathbf{v}_{k} \right\} are linearly independent.


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