Matpic
mathematics, in pictures
Concept

Torus — where it appears

The surface of a doughnut — a sphere with one handle, on which a closed curve need not separate the surface in two. Its characteristic is zero, and a map drawn on it may need seven colours where a map in the plane needs four.

Named by 12 essays across 5 fields — each of them below, with the objects they name alongside it.

3 loops in one ring, and the number that separates them. Loops drawn in an annulus, each labelled with how many times it goes round the hole. Loops with different counts cannot be deformed into one another without leaving the ring.

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.

topology · Homotopy 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.

topology · Euler characteristic Seven regions on a doughnut, each touching all six others. A brick pattern of seven labelled regions on a torus, drawn as a rectangle whose opposite edges are identified. Every pair of regions shares a border, so no two may take the same colour.

Seven regions on a doughnut

A map on a torus can need seven colours, and the proof is a picture — seven regions, each sharing a border with all six others. The plane needed a computer and eighty-six years; the harder surface was settled in 1890 by drawing something.

discrete · Graph colouring the right triangle at an eighth of a turn: 16 directions, and a surface of genus 2. A polygonal billiard table with a long trajectory drawn on it, the finite set of directions that trajectory takes, and the arithmetic of the surface it unfolds into.

A table folded into a surface

Unfolding a square billiard gives a straight line on a torus. Unfolding any table whose angles are whole fractions of half a turn gives a straight line on some surface — and which surface it is decides how hard the dynamics will be.

dynamics · Billiards A four-by-four array holding every two-by-two block. A binary array, cyclic in both directions, drawn with its wrapped row and column, in which each of the sixteen two-by-two blocks appears exactly once.

A page that knows where it is

A four-by-four array of bits, cyclic in both directions, in which every two-by-two block appears exactly once. Print it repeatedly across a sheet and any four marks on that sheet are an address.

computation · De bruijn 5 circles filling a three-sphere, every pair linked once. Several closed curves in space, nested on tori of different sizes, each pair passing through the other exactly once and none of them touching.

The circles that fill a three-sphere

A three-sphere is filled by circles — one through every point, no two meeting, every two linked exactly once. Stereographic projection is the only way anybody sees it, and the projected picture is a nest of circles on tori whose linking can be counted off the drawing.

topology · Stereographic projection Lissajous figures for every coprime pair of frequencies up to 4. A 4 by 4 grid of Lissajous figures x = sin(pt + 0.3), y = sin(qt), with the crossing count 2pq − p − q under each and the non-coprime pairs left blank.

When two circular motions come home

Drive a point across with one sine wave and up and down with another. If the two frequencies are in a whole-number ratio the point retraces a closed figure whose crossings can be counted in advance — 2pq − p − q of them — and if they are not, it never comes back and fills the square, spending twenty times longer in the corners than in the middle.

analysis · Circular functions 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.

topology · Euler characteristic Loops on a torus that never cross themselves. Squares with opposite edges glued, each carrying one straight loop of a different slope, each labelled with its two crossing counts.

The loops on a torus that never cross themselves

Every loop on a torus is classified by two whole numbers: how often it goes round one way and how often the other. Some classes can be drawn without the loop ever crossing itself and some cannot, and the rule is the oldest in arithmetic — the two numbers must have no common factor. The same two numbers say how often any two loops must meet.

topology · Homotopy A twist along the horizontal loop, done once. Squares with opposite edges glued and a shaded horizontal band, showing one loop before and after the torus is twisted along the band.

A twist that carries one loop to another

Cut a torus along a loop, turn one side of the cut once round, and glue it back. Nothing is torn, so every loop that did not cross itself still does not — but a loop of class (0, 1) is now a loop of class (1, 1). Two such twists reach every loop that never crosses itself, by Euclid's algorithm, and the symmetries they generate are exactly the whole-number matrices of determinant one.

topology · Homotopy A ball in a cube and the word of walls it hits, direction (1, √2, √3). A cube drawn in perspective with a billiard path of 30 bounces inside it, each bounce point coloured by the pair of walls it is on, and the word ZYXZYZXYZZXYZYXZYZXYZZYXZYZXYZ below.

The word a line spells in a cube

A ball bouncing in a cube hits three kinds of wall, and the order spells a word in three letters. On a square table the word had n + 1 different blocks of length n; in the cube it has $n^2 + n + 1$ — three, seven, thirteen, twenty-one — for a direction in general position. What general position has to exclude turns out to be more than any rational relation among the three speeds.

dynamics · Billiards 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.

topology · Euler characteristic

Named alongside it

The objects these essays reach for when they reach for this one.

Euler characteristicGenusInvariantBilliardsCounting argumentEquidistributionFundamental groupHomotopyPolyhedronSimple closed curveUnfoldingAngle defect

All concepts