Matpic
mathematics, in pictures
Concept

Equivalence

A relation that pools things into classes: reflexive, symmetric and transitive, so no thing is in two classes. It is what licenses working with classes instead of members, which is how modular arithmetic and quotient groups are built.

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

the trefoil. the trefoil, drawn as a closed curve with 3 crossings. At each crossing the strand passing underneath is broken, which is the only information the flat picture carries that the curve alone does not.

Three moves, and what they cannot undo

A knot is a closed loop of string, and two knots are the same if one can be wiggled into the other. Reidemeister reduced all possible wiggling to three local pictures — which is what makes it possible to prove that a knot is knotted.

topology · Knots 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 A subgroup of 2, and the 4 blocks it cuts the group into. The 8 symmetries of a 4-gon, split into 4 blocks by composing every element onto the subgroup {e, r²}. The blocks all have 2 elements and no element is in two of them.

The blocks a subgroup cuts out

Take any part of a group that is closed under composition, and it slices the whole group into blocks of its own size that do not overlap. Everything Lagrange's theorem says is arithmetic about that picture — and whether the blocks can be multiplied is a separate question with a surprising answer.

algebra · Symmetry groups Every fifth partition count divides, and the rank that says why. A row of partition counts with the ones in a congruence class marked, and a histogram of partitions sorted by rank.

Every fifth one divides

p(4) is 5, p(9) is 30, p(14) is 135, and every partition count at a number leaving four on division by five is divisible by five. Ramanujan read it off a table; the explanation is a way of splitting those partitions into five equal heaps.

number · Partitions The sixteen lattice polygons with a single point inside. A grid of sixteen small lattice polygons, each drawn on its own patch of grid with the single interior point marked, labelled with its number of boundary points.

Sixteen polygons with one dot inside

Fix one of Pick's two counts at one and ask what is left. The answer is a finite list, the list has exactly sixteen entries, each one is its own kind of object with a dual that is another entry, and the whole classification is a search a page can carry out.

discrete · Pick theorem

Named alongside it

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

Counting argumentClassificationCyclic groupDihedral groupGroup actionLagrange theoremModular arithmeticCongruenceConjectureConvex hullCosetCounting two ways

All concepts