Eigenvectors of distinct eigenvalues are independent
Statement
If are pairwise distinct eigenvalues of with eigenvectors , then is a linearly independent set.
Why is it true?
Each eigenvector marks out its own private invariant direction with its own private scaling factor; if one such direction could be built out of the others, applying would have to scale it by every one of those different factors at once, which is impossible unless the vector is zero.
Proof sketch
We argue by induction on . For the claim is trivial: a single nonzero vector is automatically linearly independent.
Assume the result holds for distinct eigenvalues, and suppose toward contradiction that are linearly dependent. Then there is a relation with not all zero.
Apply to both sides: since , this gives . Now multiply the original relation by and subtract it from this new equation; the terms with cancel exactly, leaving .
By the induction hypothesis, are linearly independent, so every coefficient in this last relation must vanish: for . Since the eigenvalues are pairwise distinct, , forcing for all .
Substituting back into the original relation leaves ; since by definition of eigenvector, as well. Every coefficient is zero, contradicting our assumption that not all vanish. Hence no such dependence relation exists, and the eigenvectors are linearly independent.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Gilbert Strang (2016). Introduction to Linear Algebra
- Sheldon Axler (2015). Linear Algebra Done Right