Concept

Trace — where it appears

The sum of the entries down the leading diagonal of a square matrix. It is unchanged by any change of basis and equals the sum of the eigenvalues, so it is a property of the map rather than of the array that happens to describe it.

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

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
The flow of a linear equation, and the matrix that runs it for one unit of time. Paths of points moving so that their velocity is [0.25, −1.2, 1.2, 0.25] applied to their position, with the position after time 1 marked on each; the matrix taking start to finish is e^A.

The exponential of a square

The series for e makes perfect sense with a matrix in it. What comes out solves a system of equations the way the ordinary exponential solves one, and a skew matrix exponentiates into a rotation with no trigonometry anywhere.

analysis · The exponential
The character table of the permutations of 4 places, computed from traces. A table with one row per irreducible representation and one column per conjugacy class, giving the trace of the matrix each representation assigns, with the dimension column marked.

When the label may be a matrix

A permutation carries exactly one bit into any commutative target, and commutativity is the restriction doing all the work. Drop it — let the label be a matrix — and what survives is a short finite table, computed here from traces and checked for orthogonality over every pair of rows.

algebra · Permutation parity
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 powers of 4 roots, added: 1, −1, 4, −5. For k from 1 to 4, the k-th powers of the roots of a degree-4 polynomial drawn as arrows placed tip to tail. Each walk ends on the real axis at a whole number, the k-th power sum, which the coefficients determine.

Every power sum, from the coefficients alone

Raise the roots of a polynomial to the k-th power and add them. However the roots turn, the total is a whole number when the coefficients are, and Newton's identities produce it from the coefficients one step at a time — no root is ever found. Run the rule on x³ − x − 1 and out comes Perrin's sequence, whose terms know which numbers are prime, nearly.

algebra · Polynomial roots
The trace–determinant plane and the flows it sorts. The plane of trace against determinant, divided by the horizontal axis and the parabola tr² = 4 det into saddle, node, spiral and centre regions, with 6 matrices marked and their phase portraits drawn alongside.

Two numbers decide the flow

A linear system in the plane has four coefficients, and what its solutions do forever afterwards — spiral in, race out, swing round, or split along two lines — is decided by two of the numbers made from them. The plane of trace against determinant is a complete map of the possibilities, and the only places it cannot decide are the lines where it changes its mind.

analysis · The exponential
Which real 2 × 2 matrices have a real logarithm, read off their eigenvalues. Eigenvalues of 7 matrices plotted in the complex plane with the negative real axis emphasised, beside a table saying for each whether a real logarithm exists and why: A yes, B yes, C yes, D no, E no, F yes, G no.

The matrix that has no logarithm

Every square matrix has an exponential, and a matrix exponential is always invertible. The converse fails, and it fails in a way that can be read straight off the eigenvalues — a real matrix with eigenvalues −1 and −2 is no exponential at all, while minus the identity is the exponential of a whole continuum of matrices that do not even commute with each other.

analysis · The exponential
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.

EigenvalueDeterminantCharacteristic polynomialMatrixMatrix exponentialDifferential equationEigenvectorPolynomialPower seriesRotationCharacter tableCoefficient

All concepts