Concept

Characteristic polynomial

The polynomial whose roots are the eigenvalues of a square matrix, got as the determinant of that matrix with a variable taken off the diagonal. Its coefficients are the trace, the determinant and the quantities between them, so it records only what a change of basis leaves alone.

Named by 5 essays across 2 fields — each of them below, with the objects they name alongside it.

The directions the map leaves alone. Unit vectors and their images under the map. On the two marked lines the image points the same way as the original, stretched by 3.00 and 1.00.

The directions a map leaves alone

Almost every arrow comes out of a transformation pointing somewhere else. A few come out pointing exactly where they went in, only longer or shorter. Those few decide nearly everything the map does.

algebra · Eigenvectors
The polynomial whose roots are the stretches. The determinant of A − λI plotted against λ for the map [2, 1, 1, 2], with its roots at 3 and 1 marked.

The polynomial whose roots are the stretches

Finding the directions a map leaves alone means finding the numbers at which it crushes something to nothing. Those numbers are the roots of one quadratic, and everything the map does is written in its two coefficients.

algebra · Eigenvectors
A map drawn through the cycle 0 → 1/3 → 1, and the graph its pieces make. The graph of a map made of two straight pieces through a cycle of three points, with the cycle drawn as a staircase, beside a two-node graph showing which piece may follow which and the matrix of that graph.

A matrix that counts the returns

Draw a map straight through the cycle 0 → 1/3 → 1 and its two pieces carry each other in a fixed pattern: the left piece only across the right, the right across both. The orbits' words are then walks on a two-node graph, and the number of points that come back after n steps is the trace of that graph's matrix to the nth power — 1, 3, 4, 7, 11, 18 — each one checked by solving for the points exactly.

dynamics · Symbolic dynamics
The integers of ℚ(√5), with ℤ[√5] inside them. Points a + bφ plotted against their conjugates for small whole a and b, with the index-two sublattice ℤ[√5] filled and the basic cells of both lattices shaded, of areas √5 and 2√5.

The integers a field contains

Inside the field of numbers a + b√5, the obvious integers are those with whole a and b. They are not all of them: the golden ratio has a one-half in it and satisfies x² = x + 1, a monic equation with whole coefficients, exactly as an integer should. The right integers form a lattice twice as dense as the obvious one — and a whole-number matrix proves they are closed under addition.

algebra · Field extensions
Two different graphs with the same adjacency matrix eigenvalues. a star with four arms: adjacency matrix eigenvalues 2, 0³, −2; a square and a lone point: adjacency matrix eigenvalues 2, 0³, −2. The characteristic polynomials are identical.

Two graphs the eigenvalues cannot tell apart

A graph's matrix has eigenvalues, and they count a surprising amount of the drawing: its edges, its triangles, every closed walk of every length. They do not count everything. A star with four arms and a square beside a lone point have the same eigenvalues exactly, although one of them is in two pieces — and on six points ten of the 156 graphs have a twin of this kind.

algebra · Linear maps

Named alongside it

The objects these essays reach for when they reach for this one.

EigenvalueDeterminantMatrixTraceEigenvectorGolden ratioInvariant directionShearAlgebraic integerBasisCounterexampleDefective matrix

All concepts