Eigenvalues and Eigenvectors
An eigenvector of a matrix is a nonzero vector that stretches or flips without changing direction: . The scalar is the eigenvalue corresponding to that eigenvector. Think of eigenvectors as the "special directions" in space — they are the axes along which the transformation acts purely as scaling.
To find eigenvalues, rearrange: means . For a nonzero solution to exist, the matrix must be singular, which requires . This equation in is called the characteristic equation and its solutions are the eigenvalues.
For a symmetric matrix , the characteristic equation is , giving eigenvalues . Both eigenvalues are always real.
Formal View
Eigenvalues are found from the characteristic equation . MATLAB: `[U, L] = eig(A)` returns eigenvectors as columns of and eigenvalues on the diagonal of .
Interactive Visualization
Eigenvector Explorer
Why This Matters
Eigenvalues and eigenvectors reveal the fundamental structure of a linear transformation — they are the "natural coordinates" for the transformation.
- Google's PageRank algorithm finds the dominant eigenvector of the web's link matrix.
- Vibration modes of a structure are eigenvectors of the stiffness matrix.
- Markov chain steady states are eigenvectors with eigenvalue 1.
Quiz
If for some nonzero , what is the eigenvalue?
The zero vector can be an eigenvector.
Common Mistakes
- Thinking eigenvalues must be nonzero — zero can be an eigenvalue (it just means the matrix is singular).
- Forgetting that only symmetric matrices are guaranteed to have real eigenvalues; general matrices can have complex eigenvalues.