Proof without words — page 2

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.

Applied

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

Three people and a trimmed piece

For two people, one cut and one choice deliver a division nobody would swap out of. For three, the same promise costs a trimming, a residue and a choosing order contrived so that an advantage once given cannot be taken back — and the verdict is not three numbers but a whole three-by-three matrix.

Two polytopes, two optima, one number. The feasible regions of a linear program and of its dual, side by side, each with its optimal vertex, and a number line on which the gap between the two optima closes to nothing.

Applied

Two numbers that have to meet

Every linear program has a shadow — a second program built from the same numbers read the other way, whose minimum can never fall below the first's maximum. That much is a one-line calculation; the theorem is that the two numbers are always exactly equal.

The value of a 2×3 zero-sum game, named from both sides. The row chooser's expected payoff against each column as a line over the mixing probability, with the lower envelope and its maximum, beside the same construction from the column chooser's side. Both give 19/15.

Applied

The value from both sides

Two choosers move at the same instant, and each asks the cautious question — how much can be guaranteed, whatever the other does. With pure choices the two answers are usually different numbers; allow a probability and they are forced to be the same one.

The unit square, mapped: area × 5. The unit square and the parallelogram it becomes under a linear map, with the area of that parallelogram computed from its own corners and set against ad − bc.

Algebra

The number that says how much room is left

A linear map takes the unit square to a parallelogram. The area of that parallelogram is one number, it is computable from the four entries of the matrix, and almost everything the determinant is used for is a restatement of that sentence.

A point, a ray, and 9 crossings. A closed curve wound into a spiral corridor, with a marked point, a ray from it and every crossing marked; an odd count means the point is inside.

Topology

Which side of the line is inside

A closed curve with no self-crossings divides the plane into an inside and an outside. Nobody doubts it, almost nobody can prove it, and on a curve wound tightly enough nobody can see which side a given point is on either.

A lattice polygon of area 22.5. A polygon with all its corners on the integer grid, with the 20 grid points strictly inside and the 7 on its boundary marked; its area is the first count plus half the second, less one.

Discrete

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.

$A square cut into 7 pieces and a remainder. A square divided by cutting off a fixed fraction of what is left, over and over, so that the pieces are the terms of a geometric series and the uncut corner is the tail.$ Analysis

The sum that fits in one square

Half, then a quarter, then an eighth, forever. Adding infinitely many things sounds like it should give infinity, and the picture that says otherwise is a square with a corner left uncut.

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.

Geometry

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.

One line, and both shapes halved. Two shapes and the single straight cut that divides each of them into two equal areas. The direction was found by sweeping every angle and watching the imbalance change sign.

Topology

One line that halves them both

Two shapes lying anywhere on a page, of any sizes and any shapes at all. There is always a single straight line that cuts both of them into two equal halves at once — and finding it needs no cleverness, only the observation that a quantity which reverses sign has to pass through zero.

All 16 trees on 4 labelled points. Every tree on 4 labelled points, drawn one by one. There are 16 of them, which is 4 to the power 2.

Discrete

Sixteen trees on four points

How many ways are there to connect n labelled points into a single tree? The answer is n to the power n minus two, which is a strange enough formula to demand an explanation — and the explanation is a code that turns every tree into a short list of numbers, and every short list of numbers back into a tree.

Every ray from one focus arrives at the other. An ellipse with its two foci and 13 rays leaving the first. Each is reflected at the curve by the ordinary law of reflection and each passes through the second focus.

Geometry

Every ray comes back to the other focus

An ellipse has two foci and one property everybody remembers: the distances to them add to a constant. What that property forces is stranger and more useful — a mirror shaped like an ellipse sends every ray leaving one focus, in every direction, through the other.

A knotted rope pulled into a 3-4-5 triangle. A closed loop of rope carrying 12 equally spaced knots, held at three of them so the sides are 3, 4 and 5 knots long; the angle between the two shorter sides is 90.0 degrees.

Geometry

The rope that squares a corner

The theorem turns two sides into a third. Run it backwards and it turns three lengths into a right angle — which is a different statement, needs its own proof, and is the only one of the two that has ever been used to build anything.

Geometry

Two right angles and the diagonal of a box

The theorem applied once gives the diagonal of a floor. Applied again, standing on the first result, it gives the diagonal of the room — and the pattern does not stop at three, which is where a fact about triangles quietly becomes the definition of distance.

Two trees, sharing every edge between them. The cube flattened into a planar graph, with a spanning tree of its corners drawn solid and the leftover edges drawn dashed; the leftover edges join the faces into a second tree, and the two counts add to the number of edges.

Topology

Two trees, and every edge in exactly one of them

Euler's formula is usually proved by deleting things until nothing is left. There is a better argument that deletes nothing — a tree through the corners and a tree through the faces, which between them use every edge once and can therefore be counted.

A path folded about the first time it touches. A walk from 2 to 4 that touches the axis, with the part before its first touch reflected. The reflection is a path from the mirrored start to the same endpoint, and the correspondence is exact.

Probability

The path folded at its first touch

Counting the walks that touch a line looks like a question about a walk's whole history. Fold each one where it first touches, and it becomes a question about where walks end up — which is a binomial coefficient, and is already known.

The target, multiplied by one harmonic at a time. Four panels, each showing the square wave multiplied by a single sine. The areas cancel exactly except against the harmonics the wave actually contains.

Analysis

Where the coefficients come from

The recipe for a square wave has a four over pi in front and a one over three on the second term, and the essay that built a square wave from sines used them without saying where they came from. They come from multiplying by one harmonic and taking the area.

One swap frees a colour. A vertex of degree five whose neighbours carry five different colours, before and after a Kempe chain is recoloured. The swap frees one colour for the middle vertex.

Discrete

Five colours, and a chain that can be followed

The four-colour theorem cannot be checked by a person. The five-colour theorem can, in a page, and the argument that does it is the one Kempe thought had settled four — with the exact step where it fails visible in the picture.

A three-coloured triangulation, and the walk that finds a rainbow triangle. A triangle cut into 36 smaller ones, its corners coloured under Sperner's rule. The 9 small triangles carrying all three colours are shaded, and a path enters through a door on one edge and ends inside one of them.

Discrete

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.

Analysis

A rectangle grown on two sides

A product of two changing quantities is the area of a rectangle whose sides both move. The extra area is two strips and a corner, and the whole of the product rule is the observation that the corner is negligible and the strips are not.

Inversion in a circle of radius 1. Three points and their images under inversion in a circle: each image lies on the same ray from the centre, at the distance whose product with the original is the squared radius. Beside it, the tangent construction that finds the image with compass and straightedge.

Geometry

The map that trades circles for lines

Send every point to the one on the same ray whose distance multiplies with it to a fixed number, and circles become lines, lines become circles, angles survive untouched, and a ring of tangent circles falls out of a ring of equal ones.

Algebra

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

Algebra

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 triangle cut into three pieces that make a rectangle. A triangle sliced at half its height and again down the altitude of the small triangle, beside the rectangle the same three pieces make when each top piece is turned a half turn.

Computation

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.