Generator

The four ways to glue a square's edges in pairs

A generator in the topology library, called 67 times across 17 essays. Below: what it draws with nothing chosen and at each mode an essay asks for, what it checks while drawing, and everywhere it is used.

gluing is one function. Everything below came out of it during this build, at parameters taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and if the generator changes, this page changes with it.

With nothing chosen

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.

The gluing abab makes a projective plane

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 sphere, and a sphere with handles

A sphere, and a sphere with handles. Two-sided closed surfaces in order: a sphere, then one with a handle, then two, then three, each with the Euler characteristic that counts them.

A sphere, and a sphere with cross-caps

A sphere, and a sphere with cross-caps. One-sided closed surfaces in order: the projective plane, the Klein bottle, and spheres with more cross-caps, each with the Euler characteristic that counts them and the orientable surface that shares it.

A sphere over a projective plane, cell by cell

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.

Every way to cut a genus-2 surface into pairs of pants

Every way to cut a genus-2 surface into pairs of pants. 2 thickened graphs, one for each type of pants decomposition of the closed surface of genus 2, each with 2 coloured junctions and 3 cutting circles.

What it checks while it draws

Collected by running the family and recording what it asserted, not written here. The count is how many separate times the claim was put to the test while these drawings were made.

Where it is called

Every figure on this list is drawn by the same rule, so a change to the rule changes all of them at once. That is why the list is published.

Topology

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

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

Cutting a space to find its group

A space assembled from two pieces has a fundamental group assembled from theirs, and the recipe is exact — take everything both groups offer and impose the relations the overlap forces. Almost every fundamental group anybody knows is computed this way, including all of the surfaces.

Topology

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

Every surface is sewn from pants

A sphere with three holes — a pair of pants — is the smallest piece a surface with two or more handles can be cut into. Every such surface falls apart into them, and the Euler characteristic alone says how many pieces and how many cuts, however the cutting is done. What it does not say is the pattern, and the patterns are counted by drawing each one as a graph: two for two handles, five for three, seventeen for four.

Topology

Every way to pair a polygon's edges

A hexagon's six edges can be paired in fifteen ways. Glue each pair head to tail and five of the fifteen give a sphere and ten give a torus; an octagon's 105 pairings give 14 spheres, 70 tori and 21 surfaces with two handles. The spheres are exactly the pairings whose chords never cross, and the whole table obeys one recurrence found in 1986.

Topology

Every word driven to a normal form

The classification is usually met as a statement: two numbers name the surface. The proof is a procedure — a short list of cut-and-reglue moves that drive any gluing word to one of the standard forms, with a measure that never rises to say why the procedure stops.

Topology

Orientation is a sign

Carry a pair of arrows once round a loop and compare them with the pair they started as. The comparison is a determinant, its sign is the whole of the answer, and no room, no side and no normal vector appears anywhere in the statement.

Topology

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

The fewest corners a surface needs

Build a closed surface from triangles, any two meeting along a whole edge, at a single corner or not at all, and ask for the fewest corners. Two lines of counting give a floor for every surface, in terms of its Euler characteristic alone. The torus meets it with seven, the projective plane with six — and the Klein bottle, which the counting says could be built from seven, cannot, as a search of every possible arrangement shows.

Topology

The same loop, unrolled

Spread a circle out into a line spiralling above it, and a loop that closes downstairs becomes a path that does not — so a question about which loops can be shrunk becomes a question about where a path ends, which is easy.

Topology

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

The surface a random gluing makes

Pair the edges of a large polygon at random and glue each pair head to tail. The surface almost always has nearly as many handles as the polygon allows: a thousand edges leave about seven and a half vertices, and the genus is within four of its ceiling of 250. The vertices behave like the cycles of a random permutation, and their average is a harmonic number.

Topology

The third number a surface needs

Leave an edge unpaired in a gluing word and the surface acquires an edge of its own. Two numbers no longer name it — a count of boundary circles is needed as well — and with that third number the list is complete again, every triple occurring exactly once.

Topology

Two copies of the polygon, cross-matched

The two-sided surface that lies over a one-sided one can be built from the gluing word alone: take two copies of the polygon, one read each way round, glue a letter within the copies when it is used once each way, and across them when it is used twice the same way. The recipe works for every surface at once, doubles every count, and shows that a sphere with k cross-caps is covered by the surface with k − 1 handles — and that among all its connected double covers, exactly one is two-sided.

Discrete

Two graphs that will not lie flat

Five points, every pair joined: no matter how the points are placed or how the lines are drawn, two of the lines cross. The proof is not about drawing at all — it counts edges against faces and finds one edge too many.

Topology

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.

The whole library · What the figures prove