Matpic
mathematics, in pictures
The collection

Every essay — page 5

Page 5 of 18, continuing through the fields in the same order.

Geometry Analysis Algebra Discrete Topology Probability Number Dynamics Logic Computation Applied What's new Ladders Concepts Search

Algebra

Structure — what stays true when the numbers change.

The quaternion multiplication table, from i² = j² = k² = ijk = −1. A four-by-four multiplication table of the quaternion units, with the row giving the left factor, every entry computed from Hamilton's rule, and the pair that differs between the two orders marked.

A multiplication that remembers the order

Four characters — i² = j² = k² = ijk = −1 — define a multiplication in which ab and ba are different numbers. Everything follows from them, including the fact that a rotation of a solid body has two names, and that two full turns are needed to get one of them home.

7 figures The derived series of S3, S4, S5. A table with one row per group giving the sizes along its derived series, each step the subgroup generated by all commutators of the last, and whether the series reaches the identity.

The group that will not come apart

Solving an equation by radicals means building a tower of roots, and a tower of roots corresponds to a chain of subgroups with abelian steps. For the general equation of degree five that chain would have to descend through a group of sixty elements with no normal subgroup in it — so there is no formula, and the obstruction is a finite object that can be written out.

7 figures 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.

7 figures The same map, written in the basis of its own eigenvectors. Three panels: the map [2, 1, 1, 2] on the standard grid, the diagonal stretch by 3 and 1 it becomes on the eigenvector grid, and the two put back together.

The same map in a better basis

Measured along its own invariant directions, a linear map stops shearing and becomes two independent stretches. Nothing about the map has changed; the grid it is described against has.

7 figures The level curve, and the axes the matrix chooses. The curve xᵀAx = 1 for the matrix [2, 0.8, 0.8, 1.4], drawn by solving for the radius at each angle, with the two eigen-directions marked; they cross at a right angle and are the axes of the curve.

Symmetry forces a right angle

A matrix equal to its own reflection across the diagonal always has real stretches and always has perpendicular directions to stretch along. Neither is true of matrices in general, and both follow from one line of algebra.

6 figures What the map does to a circle. The unit circle with two perpendicular directions marked, and its image under [1.6, 1.2, −0.4, 1.1] — an ellipse whose axes are the images of those two directions, of lengths 2.04 and 1.10.

What a map does to a circle

Every linear map sends the unit circle to an ellipse. Two perpendicular directions go to two perpendicular directions, whatever the map is — even a map with no invariant direction at all, and even one that is not square.

6 figures A parallelepiped of volume 2.94. The image of the unit cube under a three-by-three matrix, beside the six signed products whose sum is its volume.

The only function that behaves like a volume

Ask for a function of the columns of a matrix that scales when a column scales, vanishes when two columns agree, and gives one on the identity. Three conditions, and there is exactly one such function in every dimension.

6 figures A lattice of determinant 3, and the ellipse that must hold a point. A lattice with the parallelogram its basis spans, an ellipse centred at the origin, and the nearest non-zero lattice point it contains.

One point in every big enough shape

A determinant measures a lattice, not the basis that happened to describe it — and that measurement is an exchange rate. Any symmetric convex region with more than four times that area has to swallow a lattice point.

6 figures A determinant counting the 16 spanning trees. A small graph, the minor of its Laplacian, and every one of its spanning trees drawn as thumbnails.

A determinant that counts trees

Write down a graph's Laplacian, strike out one row and its column, take the determinant. The answer is the number of spanning trees — and the minus signs in the determinant are what cancel every subset of edges that is not one.

6 figures A determinant of −5 and a permanent of 23 from the same six products. The six products of a three-by-three matrix listed once, added with signs to give the determinant and without signs to give the permanent, with a row operation applied to both.

The same sum without its minus signs

Delete the signs from the determinant's sum over permutations and what is left counts things directly rather than by cancellation. It is a better count and a far worse object — because the cancellation was what made the determinant computable.

7 figures A rotation of four-space, and the two angles it turns through. The four by four matrix of the map sending x to p x conjugate q, beside two dials showing the angle it turns through in each of its two invariant planes.

A rotation of four-space takes two of them

One unit quaternion, conjugating, turns three-space about an axis. Two of them, multiplying from the left and the right, turn four-space — and a rotation of four-space has no axis at all, but two independent angles and two planes it spins in.

6 figures The four-square identity, and how few squares a number needs. A product of two whole quaternions with both sides of the four-square identity evaluated, above a strip colouring every number by the fewest squares that add to it.

The identity that multiplies sums of squares

A sum of two squares times a sum of two squares is a sum of two squares, and the same is true of four and of eight. It is true of three of nothing: 3 and 5 are each a sum of three squares, 15 is not, and one small pair of numbers rules the case out forever.

7 figures The twenty-four unit quaternions, at the corners of a four-dimensional solid. The twenty-four units of the Hurwitz quaternions drawn as the vertices of a 24-cell projected into three-space, with the ninety-six edges joining units at distance one.

The integers among the quaternions

The obvious integer quaternions are the ones with whole coordinates, and they are the wrong ones. Sixteen more, with every coordinate a half, have to be let in — and with them comes a division algorithm, twenty-four units instead of eight, and a regular solid that exists only in four dimensions.

6 figures The octonion multiplication table, drawn as seven lines. The Fano plane with its seven points labelled by the imaginary octonion units and its seven lines carrying an arrow each, giving the products of every pair.

What is lost at eight

Double the quaternions and division still works, but ab times c and a times bc are no longer the same number. What survives is a weaker law that turns out to be enough for a great deal — and the whole multiplication table fits into a picture of seven lines.

6 figures Two hundred and forty roots, built and counted. An eight by eight grid whose upper cells stand for the pairs of coordinates a root can use, beside bars counting how many roots stand at each angle from a given root: 1, 56, 126, 56 and 1.

Two hundred and forty directions

The quaternions have twenty-four units and they are the vertices of the most symmetric object in four dimensions. Eight dimensions has two hundred and forty of them, and the quaternions turn out to be how they are built — twice over, with a hundred and ninety-two left to explain.

7 figures The half of 24 permutations that commutators reach. A block of 24 squares, one per permutation, with the 12 generated by commutators shaded, beside bars counting the homomorphisms to each cyclic group.

The only bit that survives

A shuffle can be called even or odd, and the label behaves under composition. Ask whether some cleverer label — a number out of three, or out of four — could behave the same way, and the answer is that nothing else can — one bit is exactly what a permutation gives up.

7 figures A 2×3 sliding puzzle: 360 arrangements of 720 can be reached. Two arrangements of a small sliding puzzle side by side, the solved one and the one with two tiles exchanged, with the count of positions reachable by sliding found by walking every move.

The puzzle that is exactly half solvable

A sliding puzzle sold with two tiles swapped is not a hard puzzle; it is an impossible one, and the proof is a quantity that no slide can change. The same argument, run three times at once, says that one arrangement of a scrambled cube in twelve is reachable.

6 figures 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.

6 figures The parabola that proves |a·b| ≤ |a||b|. The squared length of a − t b plotted against t. It is a parabola opening upward whose least value is 7.118; that this is never negative is exactly the Cauchy–Schwarz inequality.

The square that cannot be negative

Cauchy–Schwarz is the load-bearing inequality of the whole subject and is nearly always asserted. It is one line away from a fact nobody would argue with, and the line is a parabola with no room to cross the axis.

8 figures · new One subtraction clears a direction. Gram–Schmidt on two planar vectors, in 3 panels: the pair as given, the shadow of the second on the first, and the perpendicular pair that is left when the shadow is removed.

One subtraction clears a direction

A basis is a set of directions to measure along, and most bases are awkward because the directions get in each other's way. Removing one shadow at a time turns any basis into one where every coordinate is a shadow and nothing interferes.

9 figures · new The nearest point of the plane the columns span. A target vector in space, the plane spanned by two columns, the point of that plane nearest the target, and the residual joining them, which meets the plane at a right angle.

The nearest point of a flat thing

More equations than unknowns almost never have a solution. Asking instead for the point of a plane nearest to where the answer should have been turns an unanswerable question into a shadow, and the shadow is what a line of best fit is.

8 figures · new

Discrete

Counting, graphs, and things that come in whole pieces.

Königsberg as a graph. The four landmasses as circles and the seven bridges as edges; every circle has an odd number of edges.

Seven bridges, and the invention of throwing things away

Euler solved a puzzle about a Prussian city by deleting the city. What survived the deletion was a new branch of mathematics.

6 figures Pascal's triangle mod 2, 32 rows. Only the odd entries are drawn; the pattern that appears is the Sierpiński triangle.

Pascal's triangle, in two colours

Shade the odd numbers in Pascal's triangle and a fractal appears. Nothing was designed to produce it, and the same shape arrives independently from a completely different construction.

7 figures Ulam's spiral to 900. The integers up to 900 laid out in a square spiral, with the primes marked; they crowd onto diagonal lines.

The primes on a spiral, and a pattern nobody ordered

Wind the whole numbers outward in a square spiral, mark the primes, and they line up on diagonals. The observation is a hundred years old and there is still no proof it means anything.

7 figures