Linear Algebra Learning Studio · Module 08

Eigenvalues and Eigenvectors

Learn characteristic polynomials, eigenspaces, multiplicity, diagonalization, spectral structure, and matrix dynamics.

Offline browser lab Interactive mathematics Student practice environment
Module 08 · Invariant directions

Find directions a transformation preserves and scales

An eigenvector is a nonzero vector whose direction remains on the same line after transformation. Its eigenvalue records the scale factor, including sign. Eigenanalysis reveals natural modes, long-term dynamics, stability, vibration shapes, Markov behavior, and principal directions of symmetric operators.

Solve Av=λvBuild characteristic polynomialsFind eigenspacesAssess diagonalizabilityInterpret repeated powers
01

The eigenvalue equation

Turn a nonlinear-looking search into a singularity condition

Av=λv, v≠0   ⇔   (A−λI)v=0

A nonzero solution exists only when A−λI has a nontrivial null space, which occurs precisely when det(A−λI)=0. This determinant is the characteristic polynomial.

For 2×2 A: p(λ)=λ²−tr(A)λ+det(A)

The zero vector is never an eigenvector

Although A0=λ0 for every λ, the zero vector carries no direction and is explicitly excluded.

02

Eigenspaces and multiplicity

Distinguish repeated roots from independent eigenvector directions

Algebraic multiplicity

The number of times λ appears as a root of the characteristic polynomial.

Geometric multiplicity

dim N(A−λI), the number of independent eigenvector directions for λ.

Geometric multiplicity is at least one and no larger than algebraic multiplicity. A matrix is diagonalizable when it has enough independent eigenvectors to form a basis.

03

Diagonalization and repeated application

Replace a difficult matrix power with scalar powers

A=PDP⁻¹   ⇒   Aᵏ=PDᵏP⁻¹

The columns of P are an eigenvector basis and D contains corresponding eigenvalues on its diagonal. In that basis, the transformation acts by independent coordinate scaling. A defective matrix lacks enough eigenvectors and requires more general structures such as Jordan form.

Spectral theorem for real symmetric matrices

Every real symmetric matrix has real eigenvalues and an orthonormal eigenbasis. It can be diagonalized as A=QΛQᵀ with Q orthogonal.

04

Interactive eigenanalysis laboratory

Solve 2×2 real or complex eigenproblems and inspect power iteration

2×2 eigenvalue and eigenvector analyzer

The solver uses trace, determinant, and the characteristic discriminant.

Real and complex pairs
Real eigenlines are invariant directions. Gray rays show images of sampled unit directions.
Power-iteration trace
05

Applications and stability

Interpret eigenvalues in context rather than as isolated roots

ContextEigenvalue meaningTypical interpretation
Discrete dynamics xₖ₊₁=AxₖGrowth factor per step|λ|<1 decays, |λ|>1 grows, negative λ alternates direction.
Differential equations x′=AxExponential rate e^{λt}Negative real part decays; positive real part grows.
VibrationsNatural mode parameterEigenvectors are mode shapes.
Markov chainsLong-term modesλ=1 often corresponds to a stationary distribution.
PCA / covarianceVariance along a principal directionLargest eigenvalues identify dominant data directions.
06

Review questions

Test eigenvalue equations, multiplicity, and diagonalization

Knowledge check

Which equation defines an eigenpair?

Knowledge check

Why must det(A−λI)=0 for an eigenvalue λ?

Knowledge check

When is an n×n matrix diagonalizable?

Knowledge check

What is guaranteed for a real symmetric matrix?

Knowledge check

If A=PDP⁻¹, what is A¹⁰?