Linear Algebra
Chapter 6/Eigenvalues

6.1Eigenvalues and Eigenvectors

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

  • with . Equivalently has a nontrivial solution.
  • Eigenvalues are the roots of the characteristic polynomial ; the eigenspace is .
  • and — the fastest sanity check there is.
  • Real matrices have complex eigenvalues in conjugate pairs. Similar matrices () have the same eigenvalues but different eigenvectors.
Definition · Eigenvalue and eigenvector
Let be . A scalar is an eigenvalue of if there exists a nonzero vector with ; such an is an eigenvector belonging to .

Rewriting as turns the problem into a familiar one: is an eigenvalue exactly when this homogeneous system has a nontrivial solution, i.e. when is singular.

Equivalent conditions
For an matrix and scalar , the following are equivalent: is an eigenvalue of ; has a nontrivial solution; ; is singular; .
Definition · Characteristic polynomial, eigenspace
is the characteristic polynomial (degree ), and is the characteristic equation. The subspace is the eigenspace of ; its dimension is the geometric multiplicity, and the multiplicity of as a root of is the algebraic multiplicity.
!Exam trap
Eigenvectors must be nonzero — otherwise every scalar would qualify. But is allowed, and it occurs exactly when is singular (then the eigenspace is ). Don't confuse 'zero eigenvalue' with 'zero eigenvector'.

Finding eigenvalues and eigenspaces

  1. 1
    Form — subtract from the diagonal only
  2. 2
    Compute and set it to zero

    Use §2.1 tactics: expand along the zero-richest row or column. For there's a shortcut using trace and determinant.

  3. 3
    Factor to get the eigenvalues with multiplicity

    Try small integer roots first — exam matrices are built to factor. Verify with and .

  4. 4
    For each , row reduce and solve

    There must be at least one free variable — if there isn't, is wrong or the arithmetic slipped.

  5. 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. 6
    Compare geometric and algebraic multiplicities
    equal for all λ 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.

Complex eigenvalues, trace, determinant, similarity

A real matrix has a real characteristic polynomial, so complex roots come in conjugate pairs: if is an eigenvalue with eigenvector , then is an eigenvalue with eigenvector , because .

Trace and determinant
If are the eigenvalues of counted with multiplicity, then

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
is similar to if for some nonsingular . 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: . But the eigenvectors transform: .

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
is an eigenvector of every square matrix, since for any .
Q2
is an eigenvalue of if and only if:
Q3
A matrix has eigenvalues , , and . What are and ?
T / F
If a real matrix has as an eigenvalue, then is also an eigenvalue.
T / F
Similar matrices have the same eigenvalues and the same eigenvectors.