Euler characteristic — the series

V − E + F = 2, five times. Vertices, edges and faces of the five regular solids, with the alternating sum. The edges are counted from the faces rather than listed, and the sum is 2 in every row.

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.

part 1 · topology

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.

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.

part 2 · topology

The gap at a corner of the cube. The 3 faces meeting at one corner of the cube, unfolded onto the page. They leave a gap of 90.0 degrees, and the 8 gaps come to 720 degrees in total.

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.

part 3 · topology

A solid where V − E + F is 0. a slab with one hole through it, drawn as a wireframe. Its 32 vertices, 64 edges and 32 faces give an alternating sum of 0 rather than 2.

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.

part 4 · topology

Twelve units of shortfall, on every solid with three faces at a corner. A bar for each of 8 polyhedra with three faces at every vertex, divided into each face's shortfall from six sides; every bar has total length twelve, and the hexagons contribute nothing.

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.

part 5 · topology

The six regular 4-polytopes, and an alternating sum of 0. A table of the six regular polytopes in four dimensions with their numbers of vertices, edges, faces and cells and the alternating sum, which is zero for each.

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.

part 6 · topology

Every count of corners and faces a convex solid can have. A grid of pairs (V, F) from 4 to 16, with the 85 realisable pairs filled between the lines F = 2V − 4 and V = 2F − 4, and the regular solids labelled.

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.

part 7 · topology

Counting overlapping targets from sensor counts alone, by integrating against χ. A 36 by 32 grid of sensor counts from 7 overlapping discs; the sum of the Euler characteristics of the level sets is 7.

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.

part 8 · topology

Counting targets from sensor readings with mistakes in them. Three 80 by 72 sensor fields over 8 targets: true counts (integral 8), counts with 415 mistaken readings (integral 160), and the mistaken counts smoothed (rounded persistence count 8).

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.

part 9 · topology

A random surface and the region above height 1. A smooth Gaussian random field on a 64 by 64 torus and its excursion set above 1: 14 pieces, 0 holes, Euler characteristic 14; expected 13.8.

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.

part 10 · topology

The pieces of a random vibration. Random plane wave, 240×240 grid, wavelength 24: 23 positive and 18 negative domains.

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.

part 11 · topology