Symmetry
Named by 35 essays across 10 fields — each of them below, with the objects they name alongside it.
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.
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.
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 taken on trust here — it is what a search through all twenty-four relabellings of the corners comes back with.
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.
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.
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.
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.
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.
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.
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.
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.
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.
A plane no field built
Every finite field builds a projective plane, and for a long time every known plane was built that way. The plane over Dickson's nearfield of order nine has ninety-one points, ninety-one lines and every incidence right — and Desargues' theorem fails in it on most configurations tried, except for one line, from which it never fails at all.
An endless region with a finite area
A region that runs off to infinity can still have a finite area, and for the curves 1/xᵖ the exponent that makes the far end finite is exactly the one that makes the end at zero infinite. 1/x fails at both, no power succeeds at both, and a horn can hold less than π while needing infinite paint.
Fair bits from an unfair coin
Read a biased coin's flips in pairs, keep 01 as 0 and 10 as 1, and throw away the rest: the output is exactly fair, whatever the bias, and nobody needs to know the bias. The trick wastes most of the coin, the waste can be recycled almost up to the ceiling Shannon's entropy sets — and it fails quietly the moment the flips remember each other.
A road where nobody overtakes
Rule 184 moves every 1 one cell to the right whenever the cell ahead is empty. It is one of only five elementary rules that never change the number of 1s, and that single property turns it into a model of traffic with an exact transition: below half density every jam dissolves, above it jams can never all clear and drift backwards against the flow.
The fewest ordinary lines a polygon allows
Take the corners of a regular polygon and add the points at infinity where its parallel chords meet. Every chord then carries three points, the line at infinity carries all the new ones, and the only lines left with exactly two points are the tangents at the corners — half as many as there are points. Dirac guessed in 1951 that nothing does better, and Green and Tao proved it in 2013.
What a missing input is worth
A model prices a house at 180 from its size, its garden and its bedrooms, and the question is how much of the price each input is responsible for. Make the inputs the players and the average over orders answers it — once somebody decides what the model says when an input is not known. Three reasonable decisions give bedrooms nothing, nothing, and sixteen, for a model that never reads them.
Cutting a link costs both of its ends the same
Three players, any two of whom can earn 1 together — but only if they are linked. Link all three and each is due a third. Remove one link and the player holding both of the others is due two thirds. Averaging over orders on the game the network allows is the one rule under which breaking any link costs the two players it joined exactly the same, and it pays go-betweens more than their links.
Every chord slid to the middle
Take a shape, pick a line, and slide every chord that crosses the line at right angles until the line cuts it in half. The area cannot change, the boundary can only get shorter, and the result is symmetric. Do it again about another line, and another, and the shape is squeezed towards a disc — unless the lines are badly chosen, in which case it stops short.
The envelope that always looks better
Two envelopes, one holding twice as much as the other. Open one, see an amount, and reason that the other holds double or half with equal chance — so switching gains a quarter on average. By symmetry the same argument says switch back. The step that fails is not the arithmetic; it is the claim that double and half are equally likely whatever amount is seen, which no honest prior allows — and there is one prior under which the other envelope really does look better at every amount.
Three mirrors make every solid
Every symmetry of a regular solid, reflections included, is produced by just three mirrors meeting at its centre, reflected in one another over and over — a kaleidoscope. Put a single point between the three mirrors and its reflections are the corners of a solid: the regular solid itself if the point sits in a corner, and every one of its truncated and expanded relatives if it sits anywhere else.
Every power of x that draws a hyperoval
In a plane of order 2^h, the graph of x^k plus two points at infinity is sometimes a hyperoval — as many points as a plane allows with no three in line. Searching every exponent in every plane from order 4 to 4096 finds hundreds that work, and once six symmetries of the problem are applied they fall into exactly the families already known: the conic, the translation curves, Segre's x⁶ and Glynn's two. Whether that list is complete in every order is open.
Three sines tie a knot
Let a point move with a different sine wave in each of the three directions of space, the three frequencies whole numbers with no common factor, and it traces a closed curve that is usually knotted. With frequencies 2, 3 and 7 the curve is the knot 5₂. The trefoil, the simplest knot of all, can never be made this way: the half-turn that shifting time by half a period performs forces a condition on the knot's polynomial that the trefoil fails.
Almost every tree can be turned over
Cayley's n^(n−2) counts trees with labels on their points. Take the labels off and the count has no formula, because a symmetric shape absorbs labellings: the star on seven points can be labelled only seven ways, the one asymmetric shape 5,040. The bookkeeping that reconciles the two counts says something unexpected — almost every tree, labelled or not, can be turned over onto itself, where almost every graph cannot.
Wings that cut a chord equally
Take a chord of a circle and its midpoint. Draw any two more chords through the midpoint, join their ends crosswise, and the two crossing lines — the butterfly's wings — cut the first chord at equal distances from the middle. The proof is the inscribed angle and the power of a point working together; move the point off the middle and what survives is a law about reciprocals; replace the circle by any conic and the theorem does not notice.
A wait that ends and has no average
Draw a number, then keep drawing until one beats it. Half the time the very next draw does. The wait is certain to end, it is usually short, and its average is infinite — and the chance of still waiting after n draws is exactly 1/(n + 1), whatever the numbers are drawn from, because symmetry is the only thing the calculation uses.
Where charges settle on a sphere
Put equal electric charges on a sphere and let them push each other apart until nothing moves. Four settle at the corners of a tetrahedron, six of an octahedron, twelve of an icosahedron — but eight do not make a cube, and twenty do not make a dodecahedron. The cube loses to two squares turned half a corner apart, because charges on a sphere prefer triangles; and however many charges there are, exactly twelve more of them have five neighbours than have seven.
A partition piled into a corner
A partition is a row of numbers that never increases. Let it never increase down the columns too, and it becomes a pile of cubes pushed into the corner of a room. MacMahon counted the piles with one change to Euler's product — each part size k in k colours — and in a box with a product over its cells. The second direction moves the growth from e^(√n) to e^(n^(2/3)), puts ζ(3) where π was, and makes a count that grows with a box's area. One direction further, his guess fails at six.
The corners of a random hull
Drop ten thousand points at random into a triangle and stretch a band round them: about twenty points touch it. Drop them into a disc and about seventy-three do. The count grows like a logarithm in one shape and like a cube root in the other, and the reason is where the boundary bends.
The largest polygon of diameter one
Among pentagons whose points are never more than one unit apart, the regular pentagon has the most area, and the same is true for every odd number of sides. For six sides it is false: a lopsided hexagon found in 1975 beats the regular one by four per cent. Symmetry wins half the cases and loses the other half, and the reason is parity.
The fewest points that meet every line
In a finite plane any line meets every other line, so a single line is a set of points that every line passes through. Ask for such a set that contains no whole line and the answer is surprisingly expensive: in the plane of order 7, which has 57 points, it takes 12, and an exhaustive search over seventy-one million branches shows that 11 will not do. Two theorems predict the number — a square-root bound met by a copy of a smaller plane, and a bound of three halves for prime orders met by three half-lines.
The fewest entries that fix a Latin square
Reveal six of the twenty-five entries of the cyclic Latin square of order five — three in the top left corner, three in the bottom right — and only one Latin square agrees with them; reveal any five and at least two do. John Nelder conjectured that a square of order n can never be pinned down by fewer than ⌊n²/4⌋ entries. A search over every set of cells confirms it for every square to order five, and finds that the more symmetric a square is, the fewer entries it takes.
What a random chord is
Draw a chord of a circle at random. How often is it longer than the side of the inscribed equilateral triangle? Pick two random points on the rim and the answer is 1/3. Pick a radius and a random point on it, and the answer is 1/2. Pick a random midpoint in the disc, and the answer is 1/4. All three calculations are correct, and Bertrand published them in 1889 to warn that the phrase had no meaning. Eighty-four years later Jaynes argued that one answer is right after all.
Venn diagrams that turn into themselves
A Venn diagram shows every combination of in and out exactly once. Ask for one that looks the same after a turn of 1/n, each curve rotating onto the next, and a counting argument forbids it unless n is prime. Five congruent ellipses manage it, certified by Euler's formula; four rotated copies cannot, and it took until 2004 to show that every prime can.
Named alongside it
The objects these essays reach for when they reach for this one.
Exhaustive searchInvariantCircleCooperative gameCounting argumentGroupGroup actionIncidenceMarginal contributionPermutationProjective planeRegular polygon