Invariant
Named by 25 essays across 8 fields — each of them below, with the objects they name alongside it.
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.
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.
The rule that forgets where it came from
A walk between a few states, with the next step decided by the current one and nothing else. Run it long enough and the starting point stops mattering — but only when two conditions hold, and both of them have a picture in which they fail.
Area by counting dots
Draw a polygon with every corner on a grid of dots. Count the dots strictly inside, add half the dots on the edge, subtract one — and the answer is the area, exactly, with no measuring anywhere.
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.
A loop that cannot be pulled tight
A hole is a strange thing to point at, because it is precisely where the surface is not. What can be pointed at is a loop of string lying on the surface — and the hole announces itself by refusing to let that loop be pulled in to a point.
Colours that count more than three
Three colours prove the trefoil is knotted and say nothing at all about the figure-eight, which refuses them exactly as an unknotted loop does. The repair is to stop colouring and start counting — with five colours, or seven, and with the arithmetic done modulo the number of them.
Three colours force a triangle
Cut a triangle into small ones and colour the corners under one restriction. However the cutting and the colouring are done, some small triangle ends up with all three colours — and the number of them is always odd.
The shape that averaging leaves alone
Adding independent quantities blurs their distributions together, and rescaling restores the width. Almost every shape is changed by that operation. Exactly one is returned unaltered, and that is why sums of unrelated things keep arriving at it.
Zero can mean two different things
The linking number counts how often one loop pierces a surface the other one bounds. Two punctures of opposite sign add to nothing, and a loop that never goes through adds to nothing as well — so the answer zero is two pictures wearing one number.
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.
Equal area is enough, and equal volume is not
Any two polygons of the same area can be cut into each other with finitely many straight cuts. The same sentence with area replaced by volume and polygon by polyhedron is false, and what blocks it is an angle.
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.
A room that cannot be lit
Mirror the walls of a room and put a lamp inside it. Every point should be lit, since light bounces forever — and there are rooms with a dark spot no ray from the lamp ever reaches.
The obstacle that makes a table chaotic
Put one round post in the middle of a square table and every trace of order goes. Two paths that start a hundred-thousandth of a degree apart end up on opposite sides of the table, and the reason is that a wall curving outwards multiplies a gap where a flat one only adds to it.
The number four points agree on
One inversion is a reflection and reverses orientation. Two of them compose to a motion, and what that motion leaves alone is a single number computed from any four points.
The chain that stops
Give a chain a state it cannot leave and there is no long run to find — every walk ends. What is worth computing instead is how long it lasts and where it finishes, and both are exact answers to a linear system rather than limits of anything.
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.
The time spent and the share held
The first rung's shares were a limit of distributions — where the walk probably is after many steps. This one is about a single walk: the fraction of its time spent in each state is that state's share, and the expected wait between visits is exactly the reciprocal.
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.
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.
How short a cycle could be
The drift argument cannot see cycles at all, which is why it is not a proof. What can see them is arithmetic — a cycle's shape has to be a fraction that approximates the logarithm of three to base two extraordinarily well, and there are very few such fractions.
The game the algorithm was playing
Change what Duplicator has to offer — a whole bijection instead of one element — and the game stops measuring first-order logic and starts measuring colour refinement, the algorithm every practical graph-isomorphism test begins with. Two subjects that grew apart are one game with the moves relabelled.
Slid, but never turned
Every construction on this ladder turns its pieces. Forbid the turn — allow the pieces to be slid and nothing else — and equal area stops being enough, for a reason that is a single number attached to each direction and that a cut cannot change.
Finitely many, and nobody says how many
The theorem promises a dissection exists and the proof produces one. Running the proof on a hexagon produces thirty-nine pieces, ingenuity produces five, and there is no method for proving that five cannot be four.
Named alongside it
The objects these essays reach for when they reach for this one.
Counting argumentAreaExhaustive searchCounterexampleDissectionFixed pointImpossibilityMarkov chainPermutationRandom walkSymmetryKnot