Concept

Fundamental group

The loops in a space based at one point, counted up to deformation, composed by running one after another. It separates spaces that no count of pieces can separate, and for a ring it is the whole numbers under addition.

Named by 16 essays across one field — 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
The line spiralling over the circle. A circle with a helix drawn above it: the helix is the real line, and the map that sends each of its points straight down onto the circle covers the circle once per turn. Above one marked point sits a column of points, one per turn.

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 · Covering spaces
A wedge of 2 circles. Several circles all passing through one common point, each labelled with a generator, so that a loop is a word in those letters.

The subgroup that is freer than the group

A free group on two letters contains a subgroup of index three that is free on four. Nothing about a group makes that plausible; everything about a graph makes it obvious, and the argument is to stop looking at the group and start looking at the space whose loops it is.

topology · Covering spaces
the Borromean rings, with every crossing signed. A diagram of the Borromean rings with the under-strand broken at each crossing and each crossing between two components marked with its sign, which add to twice the linking number.

Linked, and no two of them are

Three rings that cannot be pulled apart, in which every pair comes apart the moment the third is removed. Every pairwise linking number is zero, so the number cannot see it — and what does see it is a word in two letters that refuses to cancel.

topology · Linking number
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 same loop, seen from two places. An annulus with two marked points and a loop based at the first. Two paths join the points, differing by a full turn round the hole, and each carries the loop to a loop based at the second point.

The group a space has at a point

The loops of a space form a group once a starting point is fixed, and the fixing looks like an arbitrary choice that ought to be removable. It is removable, but only up to conjugation, and the residue is exactly what makes a non-commutative fundamental group harder to state than to compute.

topology · Homotopy
3 sheets, and the subgroup they name. A circle with its 3-sheeted cover drawn as a spiral above it, beside a table of the winding classes and whether each lifts to a closed loop. The ones that do are exactly the multiples of 3.

Every cover is a subgroup

A space can be unrolled, and the ways of unrolling it are not arbitrary. They correspond exactly to the subgroups of its fundamental group — index equals sheets, normality equals symmetry — so a question about a group becomes a question about a picture and back again.

topology · Homotopy
Three spaces, cut into pieces. 3 panels, drawn from: a sphere split into two caps meeting along a circle, two circles joined at a point, and a square whose opposite edges are glued into a torus. Each carries the fundamental group that van Kampen's theorem computes for it.

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 · Homotopy
Sliding one square past another. 4 stages of a slide in which two labelled squares inside a larger one exchange positions without ever overlapping. The larger square's boundary is the base point throughout, and the exchange is what makes the composition commutative.

Why the second group commutes

Replace loops by spheres and the same construction gives a second homotopy group. It is always commutative, and the reason is not a fact about spheres or about any space — it is a two-line argument about any set carrying two compatible operations.

topology · Homotopy
3 symmetries over 3 sheets: a regular covering. A 3-sheeted covering of a wedge of 2 circles, with the permutations of its sheets that commute with every generator. There are 3, against 3 sheets.

The symmetries a cover has of its own

A covering space can be shuffled without disturbing anything below it, and how many ways there are is decided by the subgroup it corresponds to. When there are as many symmetries as sheets the covering is called regular, and that is the same statement as the subgroup being normal.

topology · Covering spaces
3 sheets, 8 of 26 words coming back. A table of reduced words in two generators with the sheet each sends the base sheet to. The words returning to it are the covering's subgroup, and the 3 sheets are its cosets.

A covering is a permutation

Describing a covering means saying where each loop sends each sheet, which is a permutation for every generator. So a covering of a wedge of circles is nothing but a homomorphism to a symmetric group, and the subgroup it corresponds to is a stabiliser.

topology · Covering spaces
3 sheets over a surface of genus 2: a surface of genus 4. A 3-sheeted covering of the closed surface of genus 2, drawn as 3 copies of its 8-sided face with each side coloured by its generator and numbered with the sheet it glues to. The Euler characteristic −6 is 3 times −2, and the cover has genus 4.

Covering a surface multiplies its count

A covering of a closed surface is a permutation of the sheets for each edge of the surface's one face — with one condition that a covering of a graph never had to meet. When the condition holds, the cells of the cover can be counted directly, and the count is the base's count times the number of sheets. That multiplication decides which surfaces can cover which, before any cover is built.

topology · Covering spaces
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 loop that cannot be undone, and the surface it bounds. The loop aba⁻¹b⁻¹ on the figure eight, which cannot be pulled tight, beside a square whose boundary reads the same word, showing that the loop bounds a surface.

What homology forgets about a loop

Let the letters of a loop commute and the loop group of a space becomes its first homology group: a loop now records only how often it went round each hole. What is thrown away is exactly the loops that bound a surface. On the figure eight that is nearly everything — of the loops of sixty letters that homology calls nought, about one in 6,700 is a loop that actually shrinks.

topology · Homotopy
The two-handled surface's octagon, eight to a corner. Regular hyperbolic octagon with angles π/4 and 64 neighbouring copies in the Poincaré disc.

An octagon only the hyperbolic plane can hold

Glue an octagon's sides in the pattern that makes a surface with two handles and its eight corners become one point, so their angles must add to a single turn. A flat octagon's add to three. The octagon that fits has corners of 45° and lives in the hyperbolic plane, where its area is forced to be exactly 4π and its four gluing moves are motions of the plane whose commutators multiply to the identity.

topology · Surface classification
A random walk winding round a puncture. Lattice walk of 4000 steps around (½, ½); final winding -4.861 turns; box -12..26 × -29..22.

How a random path winds round a point

A path in the plane with one point removed has a class in the punctured plane's fundamental group: how many times it has wound round the point. For a random path the class grows like the logarithm of time, and its spread has a law. Brownian motion follows Spitzer's Cauchy law, so heavy-tailed that the mean winding does not exist; a walk on a grid follows the hyperbolic secant law instead, with tails that fall exponentially. The difference is made entirely by close passes, which a grid forbids. With two points removed the class becomes a word, and some loops wind round neither point and still cannot be shrunk.

topology · Homotopy

Named alongside it

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

Covering spaceHomotopyFree groupWinding numberSubgroupGenusIndexDeck transformationEuler characteristicGroupLiftingLoop

All concepts