Euler characteristic — the series
-
Every corner pays for itself
Count the corners of any solid, subtract the edges, add the faces. The answer is two. It is two for a cube, for a pyramid, for a football, for anything squashed or stretched — and the number is measuring the shape it is wrapped around rather than the shape itself.
-
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.
-
Seven hundred and twenty degrees of gap
Unfold the faces around any corner of a solid and they do not close up. The gap left over is different at every corner and on every solid, and the gaps always add to two full turns.
-
The solid where the answer is not two
A slab with a hole through it has flat faces, straight edges and sixteen corners, and its alternating sum is zero. It is not a trick and not a degenerate case — it is the object that shows the theorem had a hypothesis nobody had written down.
-
Twelve pentagons, whatever the hexagons
A football has twelve pentagons and twenty hexagons. A molecule of sixty carbon atoms has the same pattern, a molecule of seventy has twelve pentagons and twenty-five hexagons, and a geodesic dome of any size has twelve places where the pattern of six breaks. None of this is a coincidence of design: Euler's formula, rearranged, says that faces meeting three at a corner must fall short of hexagons by exactly twelve in total, and the hexagons are free.
-
Zero in four dimensions
Corners minus edges plus faces is two for every solid. One dimension up, corners minus edges plus faces minus cells is zero for every one of the six regular four-dimensional solids, from the five-cell to the six-hundred-cell, and for every other convex solid in four dimensions. The alternating sum does not break when the dimension rises: it alternates, two in odd dimensions and zero in even ones, because it is measuring a sphere and not a solid.
-
Every count a solid can have
Euler's formula ties the corners, edges and faces of a convex solid together, but it does not say which numbers are possible. Ernst Steinitz answered in 1906: V corners and F faces occur together exactly when neither is more than twice the other less four. The proof in one direction is two lines of counting; in the other it is two moves — cut off a corner, glue on a tetrahedron — that walk from the pyramids to every allowed pair.
-
Counting targets by their holes
The Euler characteristic adds up like an area: glue two shapes together and it is the sum of theirs minus that of their overlap. So it can be used to measure, and measuring with it does something no area can. A field of sensors that each report only how many targets they detect — not which, not where — can have its readings added up, weighted by the Euler characteristics of the regions where the count is high, and the answer is exactly the number of targets.
-
Counting targets when the sensors make mistakes
Add up the Euler characteristics of the regions where sensor counts are high and the answer is exactly the number of targets — until one sensor misreads. Each wrong reading is a new piece or a new hole, so the error grows with the number of sensors instead of averaging away. Smooth the readings and count each piece and hole by how long it survives as the threshold is lowered, and the count comes back exactly, with half the readings wrong, at the price of having to know how small a real feature can be.
-
Pieces minus holes on a random surface
Cut a random landscape at some height and the region above it breaks into pieces with holes in them. How many pieces, and how many holes, has no formula. Their difference does: the average Euler characteristic of the region above height u is a constant times u multiplied by the bell curve at u, exactly, for every smooth Gaussian surface — because the Euler characteristic is a sum of peaks, pits and saddles, and the average number of those can be computed point by point.
-
The pieces no formula counts
A random vibration of a large membrane splits the surface into regions where it bulges up and regions where it dips down. Pieces minus holes has an exact average; the number of pieces has none. Nazarov and Sodin proved it is proportional to the area, Bogomolny and Schmit predicted the constant from percolation, 0.0624, and counting the pieces of 51 random waves gives 0.0599 — below the prediction by several standard errors. The sizes of the pieces follow percolation's law; their number does not.
-
Where random discs change sign
Scatter discs at random over the plane and their union breaks into pieces with holes in them. Pieces minus holes has an exact average, η e^(−η)(1 − η) per disc area, where η is how many discs cover a point on average, and it changes sign at exactly η = 1, with 63.2% of the plane covered. The discs first join up across the whole plane later, at η ≈ 1.128. The sign change looks like the moment the union connects and is not; and for squares or long rectangles turned at random it comes earlier still, at 4πA/L², which only a disc reaches one.
-
A game decided before it starts
Draw some crosses on paper. Players take turns joining two free arms with a curve and adding a new cross on it. However they play, a game on n crosses lasts exactly 5n − 2 moves, so the winner is known before the first move: Euler's formula has already decided it. Its close relative Sprouts differs by one rule, leaving a real game whose winner for each size is known only by huge search, and which seems to depend on the size modulo six for no known reason.
-
Peaks, pits and passes
Take any lumpy closed surface and any direction of height. Peaks plus pits minus passes is 2 on a sphere and 0 on a torus, whatever the lumps, in every direction. Average one vertex's score over all directions and it becomes the corner's angle defect, computed from nothing but comparisons. So Gauss–Bonnet follows from a count of which neighbours lie higher.