Most directions get rotated and stretched by a matrix. Eigenvectors are the special directions that only get scaled. Find them and you've found the coordinate system in which the matrix is as simple as it can possibly be.
What you must be able to do
Ax=λx with x=0. Equivalently (A−λI)x=0 has a nontrivial solution.
Eigenvalues are the roots of the characteristic polynomialp(λ)=det(A−λI); the eigenspace is N(A−λI).
∑λi=tr(A) and ∏λi=det(A) — the fastest sanity check there is.
Real matrices have complex eigenvalues in conjugate pairs. Similar matrices (B=S−1AS) have the same eigenvalues but different eigenvectors.
Definition · Eigenvalue and eigenvector
Let A be n×n. A scalar λ is an eigenvalue of A if there exists a nonzero vector x with Ax=λx; such an x is an eigenvector belonging to λ.
Rewriting Ax=λx as (A−λI)x=0 turns the problem into a familiar one: λ is an eigenvalue exactly when this homogeneous system has a nontrivial solution, i.e. when A−λI is singular.
Equivalent conditions
For an n×n matrix A and scalar λ, the following are equivalent: λ is an eigenvalue of A; (A−λI)x=0 has a nontrivial solution; N(A−λI)={0}; A−λI is singular; det(A−λI)=0.
p(λ)=det(A−λI) is the characteristic polynomial (degree n), and p(λ)=0 is the characteristic equation. The subspace N(A−λI) is the eigenspace of λ; its dimension is the geometric multiplicity, and the multiplicity of λ as a root of p is the algebraic multiplicity.
!Exam trap
Eigenvectors must be nonzero — otherwise every scalar would qualify. But λ=0is allowed, and it occurs exactly when A is singular (then the eigenspace is N(A)). Don't confuse 'zero eigenvalue' with 'zero eigenvector'.
Finding eigenvalues and eigenspaces
1
Form A−λI — subtract λ from the diagonal only
2
Compute det(A−λI) and set it to zero
Use §2.1 tactics: expand along the zero-richest row or column. For 2×2 there's a shortcut using trace and determinant.
2×2:p(λ)=λ2−tr(A)λ+det(A)
3
Factor to get the eigenvalues with multiplicity
Try small integer roots first — exam matrices are built to factor. Verify with ∑λi=tr(A) and ∏λi=det(A).
4
For each λ, row reduce A−λI and solve (A−λI)x=0
There must be at least one free variable — if there isn't, λ is wrong or the arithmetic slipped.
5
Write a basis for each eigenspace
Set each free variable to 1 in turn. Scale to clear fractions — any nonzero multiple of an eigenvector is an eigenvector.
6
Compare geometric and algebraic multiplicities
equal for all λn independent eigenvectors exist ⟹ diagonalizable (§6.3).
some geometric < algebraicDefective — not diagonalizable.
Every eigenvalue problem, every time. Steps 4–5 are just §3.2's null-space routine.
Worked example
A repeated eigenvalue that still behaves
0/5 steps
Find the eigenvalues and a basis for each eigenspace.
A real matrix has a real characteristic polynomial, so complex roots come in conjugate pairs: if λ=a+bi is an eigenvalue with eigenvector z, then λˉ=a−bi is an eigenvalue with eigenvector zˉ, because Azˉ=Az=λz=λˉzˉ.
Trace and determinant
If λ1,…,λn are the eigenvalues of A counted with multiplicity, then
det(A)=i=1∏nλi,tr(A)=i=1∑naii=i=1∑nλi.
Use these constantly. If your eigenvalues don't sum to the trace, you've made an error — no need to check anything else.
Definition · Similar matrices
B is similar to A if B=S−1AS for some nonsingular S. From §4.2: similar matrices represent the same linear operator in different bases.
Theorem 6.1.1
Similar matrices have the same characteristic polynomial, hence the same eigenvalues (with the same algebraic multiplicities), the same trace, and the same determinant.
Proof: det(S−1AS−λI)=det(S−1(A−λI)S)=det(S−1)det(A−λI)det(S)=det(A−λI). But the eigenvectors transform: x↦S−1x.
Check your work
Eigenvalues, eigenspaces & diagonalizability
Builds the characteristic polynomial exactly, factors out rational roots, then solves the null space of A − λI.
characteristic polynomial
p(λ) = λ³ − 2λ² + λ = 0
trace = Σλ
2
det = Πλ
0
diagonalizable
yes
λ = 0algebraic mult. 1 · geometric mult. 1
eigenspace basis:
1
1
1
λ = 1algebraic mult. 2 · geometric mult. 2
eigenspace basis:
3
1
0
-1
0
1
Check yourself
T / F
0 is an eigenvector of every square matrix, since A0=λ0 for any λ.
Q2
λ=0 is an eigenvalue of A if and only if:
Q3
A 3×3 matrix has eigenvalues 2, −1, and 4. What are tr(A) and det(A)?
T / F
If a real 4×4 matrix has 2+3i as an eigenvalue, then 2−3i is also an eigenvalue.
T / F
Similar matrices have the same eigenvalues and the same eigenvectors.