Matpic
mathematics, in pictures
Concept

Symmetry

A transformation that leaves an object looking exactly as it did before. The symmetries of an object form a group, which is what makes symmetry a thing to compute with rather than merely to notice.

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

Completing the square, as a square. An x by x square with the strip split in half and laid along two sides, leaving a square hole of side 1.5. Filling the hole costs 2.25 and buys a perfect square.

Completing the square, by completing a square

The step everybody is taught as an algebraic trick is a literal instruction about a literal square. There is a corner missing, its size is forced, and paying for it is the whole method.

algebra · Completing the square One cake, one halving cut at 4/9, and two measures of it. A cake as a bar with two step valuations above and below it, the cutter's halving cut marked, and a table of both people's exact value of each piece.

One cuts and the other chooses

The oldest rule in fair division promises each of two people at least half the cake by their own measure, and it keeps that promise exactly. It does not promise what the word "fair" is usually asked to carry, and the gap opens the moment the two measures disagree across the cut.

applied · Fair division Every relabelling of a 4-gon's corners, and the 8 that are motions. All 24 permutations of the corners drawn one by one, with the 8 that preserve every distance marked; the rest deform the polygon and are not symmetries.

Eight ways to leave a square alone

A square can be picked up and put back so that nothing looks different. There are exactly eight ways to do it, and the number is not asserted here — it is what a search through all twenty-four relabellings of the corners comes back with.

algebra · Symmetry groups 16 colourings in 6 classes. Every way of colouring the corners, with the ones a motion carries to each other placed on the same row; the number of rows is the number of genuinely different colourings.

Colourings nobody can tell apart

Sixteen ways to colour four corners in two colours, and only six of them are genuinely different. The count can be got by pooling the sixteen — or by never forming a single class and instead averaging how many colourings each motion leaves untouched.

algebra · Symmetry groups One perimeter of 300, spent five ways. Regular polygons all of the same perimeter, drawn to scale beside the circle of that perimeter, with the area each encloses and the ratio 4πA/L².

The most area a fence can hold

One length of boundary, and the question of what shape to bend it into. The answer is a circle, everybody knows it, and the argument that convinced the nineteenth century turned out to prove something slightly different.

geometry · Isoperimetric Nine points of a triangle, on one circle. A triangle with the midpoints of its sides, the feet of its three altitudes and the midpoints from each corner to the orthocentre marked; all nine lie on a single circle of half the circumradius.

Nine points on one circle

Three midpoints, three feet of altitudes and three more midpoints. Nine points defined in three unrelated ways, on an arbitrary triangle, and all nine sit on one circle — checked here on two hundred and forty triangles as well as on the drawn one.

geometry · Triangle centres The dihedral group of a 4-sided shape, drawn as a map. A Cayley graph: one dot per motion of the shape, with one arrow per generator, so that multiplying by a generator is following an arrow of that colour.

The group drawn as a map

A multiplication table says everything about a group and shows nothing; lay the same information out as one dot per element and one arrow per generator, and multiplying becomes walking, distance becomes a word length, and the group acquires a shape.

algebra · Cayley graph The permutation (1 3 4 2) drawn as 4 strings, crossing 3 times. A permutation drawn as strings running from a row of numbered pegs to another, with every place two strings cross marked, and the crossing count checked against the number of pairs that are out of order.

The crossings that will not come out even

Draw a rearrangement as strings from one row of pegs to another and count where they cross. The count depends on how the strings are drawn; whether it is odd or even does not, and that single bit is what makes determinants exist and a sliding puzzle unsolvable.

algebra · Permutation parity 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.

algebra · Quaternions Every order of arrival for three partners, and what each player adds. A table with one row per order in which the players could arrive, giving what each adds to the group already present, and the average of each column as that player's share.

The order everybody arrives in

Three people jointly earn nine, and the question is what each is owed. Ask instead what each adds on walking into a room the others are already in, average that over every order they could have arrived in, and four modest conditions leave no other answer.

applied · Shapley value Drop one condition, and something else satisfies the rest. A column for each of the four conditions, holding a sharing rule that breaks that one and keeps the other three, with the split each rule gives on a stated four-player game.

None of the four conditions is spare

Four conditions pick out one sharing rule. The half that is usually shown is that they are enough; the other half is that each is needed — drop any one and a different rule satisfies the rest, so the list cannot be shortened.

applied · Shapley value A walk on a weighted graph, and a cycle whose traffic goes one way. A weighted graph with the long-run share of each state read off its total weight, beside a three-state cycle whose shares are equal and whose traffic circulates.

The chain that runs the same backwards

Put weights on the edges of a graph, step to a neighbour in proportion to them, and the long-run share of a state is its own weight over the total — read straight off the picture, with nothing to solve. The condition that makes that work is strictly stronger than being stationary.

probability · Markov chains

Named alongside it

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

Counting argumentInvariantPermutationCyclic groupDihedral groupGroup actionAreaCircleCooperative gameGroupLagrange theoremMarginal contribution

All concepts