Matpic
mathematics, in pictures
Concept

Euler characteristic

Vertices minus edges plus faces, which comes out the same for every way of dividing a given surface up. It is a topological invariant, so two surfaces with different values cannot be deformed into one another.

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

The five Platonic solids. Tetrahedron, cube, octahedron, dodecahedron and icosahedron, drawn at a common scale.

Why the list of perfect solids stops at five

There are infinitely many regular polygons and exactly five regular solids. The reason is not deep, but it is very sharp, and it can be checked on a single row of corners.

geometry · Regular polyhedra A Möbius band. A strip joined end to end after a half twist, so it has one side and one edge.

The surface with one side, and what happens when it is cut

A strip of paper, half a twist, and a join. The result has one side and one edge, and cutting it down the middle does not produce two of anything.

topology · Orientability A wheel of 5 rim regions needs 4 colours. A hub touching 5 rim regions arranged in a ring. The rim is odd, so the whole map needs 4 colours and no fewer.

Four colours, and a proof nobody can read

Every map on a plane can be coloured with four colours so that no two neighbours match. The statement is understandable by a child, it resisted a century of attempts, and the proof that settled it cannot be checked by a human being.

discrete · Graph colouring 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.

topology · Euler characteristic The plane divided by nearest neighbour. 10 sites, and every point of the rectangle shaded by which site is closest to it. The boundaries are the places where two sites tie.

The plane, divided by whoever is nearest

Scatter some points and colour every other point of the plane by which one is closest. The result is a tiling nobody designed, and its dual triangulation has a property that no part of the construction mentions.

geometry · Voronoi The field that cannot be combed. A tangent field on the sphere, flowing along the meridians. Every arrow is tangent to the surface, and at the two poles there is no direction for an arrow to take — the field is zero there, and no rearrangement removes both zeros.

Nothing on a sphere can be combed flat

Point an arrow along the surface at every place on a sphere, continuously, and somewhere an arrow has to vanish. On a doughnut it can be done. The difference between the two is a number that was already known from counting corners.

topology · Fixed points The four ways to glue a square's edges in pairs. Squares with their edges arrowed to show which is glued to which and which way round, each with the vertices, edges and faces the gluing leaves, and the surface those numbers name.

Every surface is a sphere with handles

Take a square and say which edges are to be glued to which, and which way round. Four such rules give four different surfaces — and two numbers computed from the rule, without ever building the surface, say which one.

topology · Surface classification 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.

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.

discrete · Pick theorem 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.

topology · Euler characteristic 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.

topology · Euler characteristic 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 Solids with every corner alike and more than one kind of face. truncated tetrahedron, cuboctahedron, truncated cube, icosidodecahedron, each cut from a Platonic solid and drawn in projection; every edge in each is the same length and every vertex is surrounded by the same faces.

Thirteen more when one word is dropped

The list of regular solids stops at five because the definition asks for two things at once. Ask for only the second — every corner alike — and thirteen more appear, each of them cut off a Platonic solid at a depth found rather than chosen.

geometry · Regular polyhedra The star polygon {5/2}. 5 equally spaced points joined every 2th, forming a closed path that winds 2 times about the centre with an interior angle of 36.0 degrees at each point.

The four that are allowed to cross themselves

Drop convexity from the definition of a regular solid and four more appear. Their faces are pentagrams, they pass through one another, and the alternating sum that gives two for every ordinary solid gives minus six for two of them.

geometry · Regular polyhedra The Klein bottle, drawn where it does not fit. A closed one-sided surface in three dimensions, drawn as a tube with a figure-eight cross-section that turns over once on the way round, with the circle where the drawing passes through itself marked.

The bottle that needs a fourth dimension

Take the Möbius band's rectangle and glue the second pair of edges too. The result is closed, one-sided, and cannot be built in three dimensions without passing through itself — which is a fact about the room rather than about the surface.

topology · Orientability The gluing abab makes a projective plane. A polygon whose edges carry the word abab, with arrows for the direction each edge is glued and the corners coloured by which vertex they become.

A disc sewn to a Möbius band

The band has one boundary curve, and a disc has one boundary curve. Sew them together and the result is the smallest closed surface with one side — the one every other one-sided surface is built out of.

topology · Orientability A sphere over a projective plane, cell by cell. An icosahedron with opposite faces drawn in matching colours, beside the count of cells it has and the count the quotient by the antipodal map has — every number halved, including the Euler characteristic.

Two sheets over a one-sided surface

Above every one-sided surface sits a two-sided one, exactly twice as large, and the map between them forgets which of the two senses of turning a point was carrying. Building it turns a question about sides into a question about covers.

topology · Orientability 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

Named alongside it

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

PolyhedronGenusDualityGluing diagramOrientabilityPlanar graphPlatonic solidsBoundaryKlein bottleOrientationPlanarityTopological invariant

All concepts