Eigenvalues and eigenvectors
The characteristic equation, finding eigenvalues for 2×2 and 3×3 matrices, extracting eigenvectors, and the properties that let you check an answer in seconds.
Module contents
The idea
Multiplying a vector by a matrix normally changes both its direction and its length. For a few special directions, only the length changes. Those directions are the eigenvectors of the matrix, and the stretch factors are its eigenvalues.
Here is a scalar (the eigenvalue) and a non-zero column vector (the eigenvector belonging to ). The zero vector is excluded — it satisfies the equation for every and would tell us nothing.
The characteristic equation
Rearrange:
Note , not — you cannot subtract a scalar from a matrix.
This is a homogeneous system. It has a non-zero solution if and only if the coefficient matrix is singular:
This is the characteristic equation of . For a matrix of order it is a polynomial equation of degree in , called the characteristic polynomial, and its roots are the eigenvalues. The set of all eigenvalues is the spectrum of .
Order 2
Sum of the diagonal, then the determinant. Fast enough to do in your head.
Order 3
where
- sum of the three principal minors of order — the determinants left after deleting row and column , for
Using this form is much quicker and safer than expanding symbolically.
Finding the eigenvectors
For each eigenvalue in turn:
- Form the matrix .
- Solve by row reduction.
- Because the matrix is singular by construction, there is at least one free variable. Set it to a convenient value and read off the vector.
Eigenvectors are only determined up to a scalar multiple: if is an eigenvector then so is for any . Choose whatever multiple keeps the entries as small integers.
The best check available. Once you have a candidate , compute and confirm it equals . This catches every arithmetic error in the whole question, and takes seconds.
Properties worth memorising
For a matrix of order with eigenvalues :
| Property | Statement |
|---|---|
| Sum | |
| Product | |
| Transpose | and have the same eigenvalues |
| Scalar | eigenvalues of are |
| Powers | eigenvalues of are |
| Inverse | eigenvalues of are (needs all ) |
| Shift | eigenvalues of are |
| Triangular | eigenvalues of a triangular or diagonal matrix are its diagonal entries |
| Singularity | is singular is an eigenvalue |
| Symmetric | a real symmetric matrix has all real eigenvalues |
| Orthogonal | eigenvalues have modulus |
| Idempotent | eigenvalues are or |
| Nilpotent | all eigenvalues are |
The sum and product checks are the fastest possible verification. Apply them before writing anything else down.
Where this is used
- PageRank — the ranking vector is the dominant eigenvector of the web's link matrix.
- Principal component analysis — the components are eigenvectors of the covariance matrix.
- Vibration and stability analysis — eigenvalues are the natural frequencies; a positive real part means the system blows up.
- Image compression and face recognition — via singular values, the close cousin of eigenvalues.
Worked examples
3 solvedEvery step is shown, in the order you would write it in an answer book.
Eigenvalues and eigenvectors of a 2 × 2
Question
Find the eigenvalues and corresponding eigenvectors of .
Write the characteristic equation
Solve for
Sanity check: ✓ and ✓
Eigenvector for
Row 2 is row 1, as it must be (the matrix is singular). The single independent equation is
Taking :
Eigenvector for
The equation is .
Taking :
Verify both
Answer
with ; with .
A 3 × 3 with distinct eigenvalues
Question
Find the eigenvalues and eigenvectors of .
Compute , ,
Principal minors of order (delete row and column ):
Write and solve the characteristic equation
Try : ✓, so is a factor.
Check: ✓ and ✓
Eigenvector for
Row 3: .
Row 1: .
Taking :
Check: ✓
Eigenvectors for the repeated
All rows reduce to the single equation
Rank is , so free variables — this repeated eigenvalue supplies two independent eigenvectors.
Choose :
Choose :
Check : ✓
Answer
: . (twice): , .
NoteA repeated eigenvalue does not always give two independent eigenvectors. Count them by computing the rank of A − λI: the number is n − ρ(A − λI).
Reading eigenvalues off a triangular matrix
Question
Find the eigenvalues of and hence the eigenvalues of , and .
Use the triangular shortcut
is upper triangular, so is also triangular and equals
No expansion needed.
Confirm with the trace and determinant
and ✓
and ✓
Apply the property rules
: square each eigenvalue —
: reciprocate each — (valid since no eigenvalue is )
: add to each —
Answer
: . : . : . : .
NoteQuestions about A², A⁻¹ or A + kI never require recomputing a characteristic equation. Transform the eigenvalues you already have.
Practice problems
6 with solutionsWork each one on paper first. The full solution — not just the answer — is one click away.
Find the eigenvalues of .
Show solutionHide solution
Check: ✓, ✓
Find the eigenvalues and eigenvectors of .
Show solutionHide solution
For :
Take :
For :
Take :
Verify: ✓ ✓
Find the characteristic equation and eigenvalues of .
Show solutionHide solution
Principal minors:
Characteristic equation:
Try : ✓
Divide:
Check: ✓ ✓
(All eigenvalues are real, as they must be — is symmetric.)
Find the eigenvalues and eigenvectors of .
Show solutionHide solution
Characteristic equation.
Try : ✓
Eigenvector for .
, then and :
Row 2: .
Row 1: .
Take :
Check: ✓
Eigenvectors for .
Rank , so independent eigenvectors. The single equation is
Take :
Take :
Check : ✓
If the eigenvalues of a matrix are , find , , the eigenvalues of , of , and of .
Show solutionHide solution
Trace = sum of eigenvalues:
Determinant = product of eigenvalues:
Non-zero, so exists.
— cube each eigenvalue:
— reciprocate each:
— apply :
(In general, if is any polynomial then the eigenvalues of are .)
Prove that if is an eigenvalue of a non-singular matrix , then is an eigenvalue of with the same eigenvector.
Show solutionHide solution
Start from the definition, with :
First, . If were then with , which would make singular — contradicting the hypothesis. So dividing by is legal.
Multiply both sides on the left by :
Divide by :
This is exactly the eigenvalue equation for , with eigenvalue and the same eigenvector . ∎
The same argument applied repeatedly gives the general rule: for every integer , positive or negative.