Beautiful Math
Path

Linear algebra · Lesson 6

Eigenvalues and eigenvectors

Ax = λx picks directions that a linear map only stretches or flips. Those eigen-directions are the map's simplest skeleton.

Core ~14 minDeep study ~34 minWhat does Ax = λx mean geometrically?Why might a rotation have no real eigenvectors?

Before this: Matrices as linear maps, Bases, dimension, and structure

How this idea was born

A matrix can rotate, shear, and stretch all at once. Most input arrows leave pointing a new way. Somewhere, if you are lucky, there are special arrows that the map only scales: longer, shorter, or flipped, but still on the same line. Those arrows are the map's simplest confession of what it does.
The finite-dimensional story has deep nineteenth-century roots. MacTutor's matrices topic credits Cauchy with major spectral results for real symmetric matrices (including reality of eigenvalues in that setting). David Hilbert (1862-1943) later helped make spectral language central for operators and infinite-dimensional spaces; MacTutor sketches the career. Steal the ethic carefully across both eras: find directions where a complicated action becomes simple scaling. Do not flatten Cauchy into Hilbert or invent a single "Eureka, eigenvalues!" night.
For a modern rereader, Av=λvA\mathbf{v}=\lambda\mathbf{v} is the sentence. Geometry first; characteristic polynomials second.

First principles

vAv = λvsame direction, new length
An eigenvector keeps its direction under A; only its length scales by λ.
A nonzero vector v\mathbf{v} is an eigenvector of square AA with eigenvalue λ\lambda when
Av=λv.A\mathbf{v} = \lambda\mathbf{v}.
Geometrically: AA stretches v\mathbf{v} by λ|\lambda| and flips it if λ<0\lambda<0, without rotating it off its line. The zero vector is excluded by convention; it would satisfy the equation for every λ\lambda and teach nothing.
Rearrange: (AλI)v=0(A-\lambda I)\mathbf{v}=\mathbf{0}. Nontrivial solutions exist when AλIA-\lambda I is singular, i.e.
det(AλI)=0.\det(A-\lambda I)=0.
Roots of that characteristic polynomial are the eigenvalues (in C\mathbb{C}, counting multiplicity).
If enough independent eigenvectors exist, they form a basis in which AA acts by pure scaling on each axis: diagonalization. Not every matrix earns that luxury (Jordan blocks appear when geometric multiplicity falls short). Symmetric real matrices are the friendly case: real eigenvalues and an orthonormal eigenbasis (spectral theorem in the finite-dimensional Euclidean setting).

Worked intuition

Watch a linear transformation of the plane. Most arrows twist. Eigenarrows are the stubborn ones that stay on their rails. λ=2\lambda=2 means "double along this rail." λ=1/2\lambda=1/2 means "halve." λ=1\lambda=-1 means "flip."
A pure rotation by 9090^{\circ} has no real eigenvectors: nothing stays on its line. Over complex numbers it still has eigenvalues on the unit circle. The field matters.
Powers AkA^k become easy on eigen-directions: multiply by λk\lambda^k. Long-run behavior of xt+1=Axt\mathbf{x}_{t+1}=A\mathbf{x}_t is dominated by the largest λ|\lambda|.
Algebrica's eigenvalues page draws the stretch picture; the diagonalization page explains when a full eigenbasis exists.

Common confusions

Eigenvalues are the diagonal entries always. Only in special bases (triangular form reveals eigenvalues on the diagonal). In a random basis they hide.
Every matrix has a full set of real eigenvectors. False. Real rotations are the classroom counterexample. Complex eigenvalues come in conjugate pairs for real matrices.
"The" eigenvector for λ\lambda. Eigenspaces can be higher-dimensional. Any nonzero vector in the eigenspace works; scaling an eigenvector stays an eigenvector for the same λ\lambda.
Large eigenvalue means "important feature" in every application. In dynamics, large λ|\lambda| dominates growth. In PCA (next chapter), large eigenvalues of covariance mean high variance directions. Context sets the moral.
Diagonalization always succeeds. Need a full basis of eigenvectors. Defective matrices need a broader Jordan story.
Eigenvectors must be orthogonal. Not in general. Symmetric (or Hermitian) cases give orthogonal eigenbases; general matrices need not.

History & stories

Cauchy developed key spectral facts while studying quadratic forms; MacTutor's matrices topic is the careful pointer. Hilbert's later operator-theoretic work made "spectrum" a keyword of twentieth-century analysis and mathematical physics. The finite-dimensional Av=λvA\mathbf{v}=\lambda\mathbf{v} picture is the doorway; Hilbert spaces are the mansion.
Steal the shared instinct: complicated linear action becomes intelligible once invariant directions are named.

Real world

A vibrating string or bridge has modal shapes; frequencies relate to eigenvalues of an operator or matrix model. Principal stress axes align with eigenvectors of a stress tensor. Population models nt+1=Ant\mathbf{n}_{t+1}=A\mathbf{n}_t grow like the dominant eigenvalue when that mode is excited.
Anytime you ask "what does this linear rule do if I wait a long time?", eigenvalues answer.

Open when you want the machine-learning connection. Skip freely.

Field notes, extra examples, and glossary live here when you want more than the core path.

Carry this forward

  • Av=λvA\mathbf{v}=\lambda\mathbf{v} is stretch-without-twist on a line.
  • Symmetric matrices are the friendly spectral case.
  • Next: SVD factors any matrix as rotation-scale-rotation; PCA harvests variance-maximizing axes.

Read more

Go deeper when curiosity hits - videos, essays, and primary trails.

Check your understanding

A short learning loop - try a few, learn from misses, mark complete when you have engaged. No timer, no scoreboard.

1.Av = λv means…
2.Eigenvectors exclude 0 because…
3.Characteristic equation…
4.A 90° rotation in the plane…
5.Hilbert's spectral spirit (careful history)…

Try at least 3 core prompts, or choose I'll return later.