An eigenvector of a matrix is a nonzero vector that satisfies:
The scalar is the corresponding eigenvalue. The transformation only stretches , without changing its direction.
Finding eigenvalues — Solve the characteristic equation:
This yields a polynomial of degree whose roots are the eigenvalues.
Finding eigenvectors — For each , solve the homogeneous system:
Example
So , .
Diagonalisation — If has linearly independent eigenvectors, then:
A = PDP^{-1}
where and has eigenvectors as columns. This makes computing trivial.
Physics link: Normal modes of coupled oscillators are eigenvectors of the system matrix. Each eigenvalue gives , the squared angular frequency of that mode.
Common pitfall: Eigen-vectors keep their line, not their length or even sense: eigenvalues may be negative (flips), zero (collapse), or fractional (shrink). "Unchanged by the matrix" is only true when .
An eigenvector of a matrix satisfies:
The scalar is the corresponding eigenvalue. Under the transformation , eigenvectors only scale — they do not rotate.
Eigenvalues are found from the characteristic equation .
Eigenvectors reveal the intrinsic axes of a transformation — diagonalisation, stability analysis, and PCA all depend on them.