Part V — Eigenvalues and Eigenvectors

This is the conceptual heart of the book. Everything before Part V was preparation; everything after it is consequence. The question we finally have the tools to answer is the deepest one in the subject: stripped of any particular coordinate system, what does a matrix REALLY do? The answer hides in a small set of special directions. Apply a transformation to most vectors and they swing off to point somewhere new — but a precious few don't turn at all. They only stretch or shrink, holding their line. Those are the eigenvectors, the invariant directions of a transformation, and the factor by which each one stretches is its eigenvalue. Find them, and you have found the skeleton on which the entire transformation hangs.

The motivating picture is exactly the one our 2D visualizer was built to show. Watch a matrix deform the plane and look for the arrows that stay on their own line: those eigen-directions are the axes along which the transformation acts most simply — pure stretching, no rotation. Change to a coordinate system aligned with them, and the matrix becomes diagonal. The messy grid of numbers dissolves into a handful of independent scalings. That is what it means to understand "what a matrix really does."

Chapter 23, Eigenvalues and Eigenvectors, introduces the central equation $A\mathbf{v}=\lambda\mathbf{v}$ — not as a root-finding exercise but as the search for invariant directions you can see in the visualizer. Chapter 24, The Characteristic Polynomial, then gives the computational handle: eigenvalues are the roots of $\det(A-\lambda I)=0$, and here you'll learn the crucial distinction between algebraic and geometric multiplicity that explains when a matrix behaves nicely and when it doesn't. Chapter 25, Diagonalization, delivers the payoff: when a matrix has enough independent eigenvectors, it factors as $A = PDP^{-1}$, and suddenly taking powers of a matrix — the engine behind Markov chains, population models, and dynamical systems — becomes almost trivial. Chapter 26, Complex Eigenvalues, confronts the matrices with no real eigen-directions and reveals the beautiful truth: they are rotations in disguise, and complex eigenvalues are precisely how the algebra encodes spinning.

Chapter 27, The Spectral Theorem, is one of the summits of the entire book. For a symmetric real matrix (or Hermitian complex one), the eigenvectors are not merely independent — they are orthogonal, so the matrix is diagonalized by a rotation. This is where Part IV's orthogonality and Part V's eigenvalues fuse into a single profound result, and it is the mathematical bedrock under quantum mechanics, where Hermitian operators represent observable quantities. Chapter 28, Positive Definite Matrices and Quadratic Forms, applies the spectral picture to energy, curvature, and optimization, and introduces the covariance matrices that make Part VI's PCA possible. Part V then culminates in Chapter 29, Application: PageRank — the anchor we seeded all the way back in Chapter 3. Google's original ranking of the web is the dominant eigenvector of a giant stochastic matrix, found by power iteration, and now you have every tool needed to understand and build it. The search engine that organized the internet is an eigenvalue problem.

Here the book's defining theme reaches its peak: eigenvalues and eigenvectors reveal what a matrix really does — its essential action, freed of coordinate-system artifacts. And the geometry-algebra unity is at its most striking: an eigenvalue is simultaneously a root of a polynomial, a stretch factor you can watch in the visualizer, the long-run growth rate of a dynamical system, and the importance score of a web page.

Be honest with yourself about the climb. This part is genuinely harder than what came before — the characteristic polynomial introduces complex numbers, multiplicity is subtle, and the spectral theorem rewards careful reading of its conditions (symmetric or Hermitian — not every matrix obeys it). Go slowly, lean on the visualizer's invariant-direction view, and remember that the algebra is always describing a picture you can see.

By the end of Part V you will be able to: find eigenvalues and eigenvectors and interpret them as a transformation's stretch factors and invariant directions; use the characteristic polynomial and distinguish algebraic from geometric multiplicity; diagonalize a matrix as $A=PDP^{-1}$ and use it to compute matrix powers efficiently; recognize complex eigenvalues as encoded rotations; state and apply the spectral theorem for symmetric and Hermitian matrices; analyze positive definite matrices and quadratic forms; and build PageRank from the dominant eigenvector via power iteration. Your toolkit gains eigen.py with power_iteration.

With eigenvalues in hand, the book's grandest tool comes within reach. Part VI generalizes diagonalization to every matrix — even non-square, even rank-deficient — through the Singular Value Decomposition, the factorization that compresses images, denoises data, finds principal components, and powers modern machine learning.

Chapters in This Part