Eigenvalues and Eigenvectors
Matrix Decompositions
An eigenvector of a square matrix A is a non-zero vector mathbf{v} that A stretches without rotating: Amathbf{v} = lambda mathbf{v} for some scalar lambda, the corresponding eigenvalue. Eigenvectors are the *invariant directions* of the map: every other vector gets bent by A, but these lie along axe
Eigenvectors are invariant directions of a linear map; eigenvalues say how much they scale.
No eigenvalues means no PCA, no spectral clustering, no convergence theory for iterative solvers, no stability analysis of dynamical systems or GANs.
An eigenvector of a square Matrixⓘ is a non-zero Vectorⓘ that stretches without rotating: for some scalar , the corresponding eigenvalue. Eigenvectors are the *invariant directions* of the map: every other vector gets bent by , but these lie along axes that merely scales.
To find them algebraically, rewrite as . For a non-trivial to exist, must be singular, i.e., its Determinantⓘ is zero: . This equation in is the characteristic polynomial — a polynomial of degree whose roots are the eigenvalues. For each root , the corresponding eigenvectors span the eigenspace .
Eigenvalues can be real or complex, distinct or repeated. A rotation matrix has complex eigenvalues — it has no real invariant direction other than the origin. A diagonalizable matrix has linearly independent eigenvectors that form a basis; in that basis, acts by pure scaling. A defective matrix (like ) has fewer independent eigenvectors than its size — it cannot be fully diagonalized and needs Jordan form.
Symmetric real matrices enjoy a remarkable guarantee called the spectral theorem: all eigenvalues are real, eigenvectors from different eigenspaces are orthogonal, and the matrix can be diagonalized by an orthonormal basis: with orthogonal and diagonal. This is the cleanest possible factorization, and it is why covariance matrices, Hessians, and Laplacians are such tractable objects.
Eigenvalues unlock enormous parts of ML. PCA extracts the top eigenvectors of the covariance matrix as principal directions. Spectral clustering uses eigenvectors of the graph Laplacian. Google's PageRank is the dominant eigenvector of a stochastic matrix. Even the stability of a neural-network dynamical system hinges on whether the Jacobian's eigenvalues lie inside the unit disk.
Exercises
Put your understanding to the test. Score + streak + speed all count.
Confirm you've got it
3 quick questions. Get 2 right to mark this lesson complete.