Eigenvalue and eigenspace
λ is an eigenvalue when ker(A−λI) is nonzero. That kernel is the eigenspace, including its zero vector.
REFERENCE SHEET
Find directions on which a linear transformation acts only by scaling.
Before this Vector spaces & linear maps, Polynomials & roots
λ is an eigenvalue when ker(A−λI) is nonzero. That kernel is the eigenspace, including its zero vector.
A square matrix over F is diagonalizable over F if it has a basis of eigenvectors in Fⁿ.
Algebraic multiplicity is multiplicity in the characteristic polynomial; geometric multiplicity is the eigenspace dimension.
Eigenvectors for distinct eigenvalues are linearly independent. In particular, n distinct eigenvalues imply diagonalizability of an n×n matrix.
Every real symmetric matrix has an orthonormal eigenbasis and real eigenvalues. Every complex Hermitian matrix has a unitary diagonalization with real eigenvalues.
Diagonalization simplifies powers Aᵏ and solutions of x′=Ax.
Eigenvectors of a covariance matrix identify orthogonal directions of variance.
01 / Compute
Try vectors (1,1) and (1,−1).
The unit eigenvectors are (1,1)/√2 with λ=3 and (1,−1)/√2 with λ=1. Put these as columns of Q: A=Q diag(3,1) Qᵀ.
02 / Explain
Compute ker(A−I).
No. Its only eigenvalue is 1 and its eigenspace consists of (x,0), so it has dimension 1 rather than 2.
03 / Check an assumption
Write A=I+N and check N².
N=[[0,1],[0,0]] has N²=0. The binomial expansion gives Aⁿ=I+nN=[[1,n],[0,1]]. Although the sole eigenvalue is 1, the off-diagonal term grows linearly because A has a nontrivial Jordan block.
These sheets use this topic as a prerequisite.
Further reading and full-length treatments: