3 loops in one ring, and the number that separates them
loops 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
Six lists of cycle shapes, and how many coverings each has
The same count as a sum over the characters of S4
4 sheets branched over 3 points of a sphere: a surface of genus 0
3 sheets, 8 of 26 words coming back
The rank of every cover of a wedge of 2 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.
- rows 0 and 1 of the character table are orthogonal ×42
- on the 1-sheeted cover, the lift of a loop winding 0 times closes exactly when it should ×24
- generator 1 acts as a permutation of the 3 sheets ×14
- point 1's entry is a permutation of the 4 sheets ×13
- edge 1's entry is a permutation of the 3 sheets ×10
- the rank comes out at 1 + 3(2 − 1), which is the index times one less than the rank below ×9
- classes within 1 letters once the letters commute ×8
- elements within 1 letters in the free group ×8
- a loop winding 0 times lifts to a closed path exactly when 0 is a multiple of 3 ×7
- rows 0 and 0 of the character table are normalised ×7
- the class sizes of S2 add to its order ×4
- vertex 1 has at most one a leaving it ×4
- vertex 1 has at most one b leaving it ×4
- face 1 closes up on its own sheet ×3
- the loop drawn for class 0 is a whole number ×3
- 4 sheets, two 4-cycles and a double swap: the character sum and the enumeration agree ×2
- the loop drawn for class -2 is a whole number ×2
- the symmetry returns to the identity first at the 4th power ×2
- 2 sheets, four swaps: the character sum and the enumeration agree ×1
- 240 words of length 10 ×1
- 3 sheets, three 3-cycles: the character sum and the enumeration agree ×1
- 4 sheets, three double swaps: the character sum and the enumeration agree ×1
- 4 sheets, two double swaps and a 3-cycle: the character sum and the enumeration agree ×1
- a class on the torus is a pair of whole numbers, not both zero ×1
- a closed lift on the grid encloses a whole number of squares, counted with sign ×1
- a free group of rank two has four words of length one ×1
- a list containing a single d-cycle — a polynomial — is always realised ×1
- a meander crossing the line 6 to 14 times ×1
- a meander is found ×1
- a spanning tree of a connected graph has one edge fewer than it has vertices ×1
- a straight loop of a coprime class never crosses itself ×1
- a three-crossing curve whose one non-trivial symmetry moves no region gives five plane curves, one for each region ×1
- a twist is a homeomorphism, so a loop that did not cross itself still does not ×1
- and are not under the other one ×1
- and at most one arriving ×1
- and at the same height ×1
- and by the end the loop has been dragged through the hole ×1
- and consecutive ones differ by exactly one turn ×1
- and every list that is not realised passes the count and the parity anyway ×1
- and exactly one arriving ×1
- and in the second, so it closes up on the torus ×1
- and inside the outer boundary ×1
- and it goes round each hole a net zero times ×1
- and its degree is even ×1
- and its degree is odd ×1
- and its exponent sums vanish ×1
- and on exactly two, once in each direction ×1
- and the answer is a whole number, as a count of lists must be ×1
- and the losses add to an even number, as the sign of a product of permutations forces ×1
- and the same word cancels to nothing on the wedge, where it stays four letters long ×1
- and the top and bottom ×1
- and the top and bottom as many times as its second ×1
- and their number divides the number of sheets ×1
- and they are those multiples in order ×1
- and twelve of length two ×1
- and up ×1
- between one and five words to be refused ×1
- between one and four generator words in a, b and their inverses ×1
- between three and six of the shape lists the family knows are tabulated ×1
- between two and eight branch points ×1
- between two and five sheets ×1
- between two and six sheets ×1
- beyond 3 the small windings are commoner than the big ones ×1
- both loops start at the same point of the ring ×1
- both words are already reduced ×1
- Brownian windings have the Cauchy tail at 3 ×1
- by thirty sheets nearly every covering is connected and nearly the whole count comes from the two one-dimensional characters ×1
- carrying the loop along either path leaves its class alone ×1
- commuting pairs of permutations of n things number n! times the partitions of n ×1
- crossings plus turning number is always odd ×1
- curve is read only by the twist views ×1
- curves is read only by the slopes and simple views ×1
- each curve is counted once for every way of starting and orienting it, divided by its symmetries ×1
- each loop in the orbit is in its class, across ×1
- each loop on the torus is a pair of whole numbers, not both zero ×1
- each pair: one to four pairs of whole numbers, not both zero ×1
- each shape names a conjugacy class of the group ×1
- each sheet has exactly one edge of each label leaving it ×1
- eight failures at ten sheets contain no shape with all cycles equal ×1
- every branch point's cycles fit side by side inside its column ×1
- every class drawn here is coprime ×1
- every class on the way is coprime ×1
- every coprime class walks down to (1, 0) ×1
- every cover's counted rank matches the formula ×1
- every curve along the way turns twice ×1
- every letter is used as often forwards as backwards ×1
- every letter names one of the nails ×1
- every lifted edge appears on some face ×1
- every loop dies inside the plotted range ×1
- every marked point actually branches ×1
- every pair is counted once, and exactly Cₙ pairs make n loops — the pairs of identical systems ×1
- every point of the fibre projects onto the marked point of the circle ×1
- every sheet is reached by some word, so the cover is connected ×1
- every turning number is a whole number ×1
- every two-letter loop nought in homology is the trivial loop ×1
- every word a curve realises satisfies Gauss's even-interlacing condition ×1
- exceptions by degree 3 to 13 ×1
- four crossings give nineteen curves on the sphere ×1
- four or eight nails ×1
- Frobenius's formula counts the solutions of [a, b][c, d] = 1 in the symmetric group exactly ×1
- from is read only by the twistpath view ×1
- Gauss's condition first admits a word no curve realises at five crossings ×1
- going round all the branch points returns every sheet, so this is a covering of the sphere ×1
- going round the face returns every sheet to itself, so the permutations describe a covering ×1
- Hall's recursion agrees with counting every pair ×1
- in the disc every stage of the shrink stays inside ×1
- lattice windings have a tail at 3 far thinner than the Cauchy law's ×1
- longer loops are less often unwound ×1
- longer loops hide more and have longer words ×1
- moving every point by at most δ moves the long bar's ends by at most 2δ ×1
- no sample of the loop lands on the point it is wound about ×1
- no step of the walk turns more than a quarter of a turn ×1
- no two cycles drawn in one lane overlap ×1
- no two deck transformations agree on the base vertex ×1
- of the 36 four-letter closed lifts, 28 are trivial words ×1
- one permutation for each of the 2g edges ×1
- one to four nails ×1
- one to four pairs of loops ×1
- order 6 to 9 ×1
- over the line, the only loop that lifts to a loop is the one that goes nowhere ×1
- pairs is read only by the meet view ×1
- pulling any one nail lets the picture fall ×1
- running one loop then the other adds the counts ×1
- six to twenty nails ×1
- so the two maps are not the same map ×1
- so the whole fibre sits over one point ×1
- so there are at most as many symmetries as sheets ×1
- span is read only by the primitive view ×1
- symmetry is read only by the twistorder view ×1
- the a's in the word add up to the winding number about that hole ×1
- the b's in the word add up to the winding number about that hole ×1
- the base circle itself does not lift to a loop ×1
- the bouquet below has two or three circles ×1
- the bouquet has between one and four circles ×1
- the bouquet has two to four circles ×1
- the cells count what the Riemann–Hurwitz formula says ×1
- the chance a random pair is not transitive is about 1/n ×1
- the character sum and the enumeration agree ×1
- the character table of this symmetric group is one the family carries ×1
- the class is coprime with both counts positive ×1
- the class walked down: one to four pairs of whole numbers, not both zero ×1
- the classes drawn are whole numbers no bigger than four ×1
- the classes that lift to loops are the multiples of the sheet count ×1
- the classes weighed by one over their symmetries add to the labelled codes over 8n ×1
- the commutator does not cancel down any further ×1
- the commutator has exponent sum zero in the first generator ×1
- the composition of two deck transformations is one ×1
- the conjugacy classes 1, 3, 7, 26, 97 ×1
- the cover has between two and five sheets ×1
- the cover has between two and four sheets ×1
- the cover has genus d(g − 1) + 1 ×1
- the cover is connected, so its deck group acts on one object ×1
- the cover is connected, so the index argument applies ×1
- the cover is connected, so the sheets are one orbit ×1
- the cover's Euler characteristic is even, as a closed orientable surface's must be ×1
- the covering is one of torus, genus2, cuberoot, power, simple ×1
- the curve about the left hole is a whole number ×1
- the curve about the right hole is a whole number ×1
- the curve round one handle reads a reduced commutator ×1
- the curve: one to four pairs of whole numbers, not both zero ×1
- the curves: one to four pairs of whole numbers, not both zero ×1
- the degree of the map that is not odd is a whole number ×1
- the degree of the odd map is a whole number ×1
- the disc lifts to one face on every sheet ×1
- the drawing shows between two and five turns ×1
- the edges outside the tree are exactly the free generators the graph carries ×1
- the eight four-letter loops that are nought in homology and not trivial are the commutators ×1
- the Euler characteristic is that of a closed orientable surface ×1
- the Euler characteristic multiplies by the number of sheets ×1
- the example winds zero times round each puncture and is still a word of length four or more ×1
- the extrapolated growth rate lies between 11 and 13.5 ×1
- the first loop is a whole number ×1
- the first map really does send opposite points to opposite points ×1
- the first word found solves the puzzle ×1
- the folded graph has at least one independent loop ×1
- the free group on two letters has 1, 3, 13, 71, 461 subgroups of index 1 to 5 ×1
- the free group on two letters has thirteen subgroups of index three ×1
- the free group outgrows the abelian group of the same rank ×1
- the gallery's turning numbers are 1, 0, 2, 3, 4 and −2 ×1
- the generator aa is accepted by the folded graph ×1
- the generator ab is accepted by the folded graph ×1
- the generator abab is accepted by the folded graph ×1
- the generator abaB is accepted by the folded graph ×1
- the generator ba is accepted by the folded graph ×1
- the generator bb is accepted by the folded graph ×1
- the halved commutator solves the puzzle ×1
- the hole is between a fifth and three fifths of the ring ×1
- the identity is a deck transformation ×1
- the index of the subgroup is the number of sheets ×1
- the integers have one subgroup of each index ×1
- the lattice runs from 4 to 12 each way ×1
- the lattice walks are already much narrower than the Cauchy law, whose quartiles are 2 apart ×1
- the lift ends a whole number of turns above where it started ×1
- the lift ends at the letters' exponent sums ×1
- the limaçon's tangent turns through exactly two full turns ×1
- the loop at p is a whole number ×1
- the loop being lifted is a whole number ×1
- the loop crosses itself one time fewer than the common factor ×1
- the loop crosses the side edges as many times as its first count ×1
- the loop drawn at p has the class claimed ×1
- the loop drawn for a class really has that class ×1
- the loop is in the class it claims, across ×1
- the loop lifted goes round between one and four times ×1
- the loop lifted is the one asked for ×1
- the loop lifted winds between zero and six times ×1
- the loop stays clear of the hole ×1
- the loops composed have counts no bigger than three ×1
- the loops tabulated wind between zero and eight times ×1
- the marked point is on the base circle ×1
- the meanders of each order match the published counts ×1
- the monodromy table is drawn over two generators ×1
- the nested commutator solves the puzzle ×1
- the number of sheets is what one lap advances by ×1
- the number of subgroups of index 30 is within one per cent of 2n (n!)^(2g−2) ×1
- the option is one this view reads ×1
- the pairs sorted by the orbit of the first sheet account for all of them ×1
- the path crosses the side edges as many times as its first count says ×1
- the permutations connect every sheet to every other ×1
- the permutations reach every sheet from every other, so the covering is connected ×1
- the plane counts are 1, 2, 5, 20, 82, 435, 2645 ×1
- the printed terms add to the printed answer ×1
- the probe's two images are exactly opposite under the odd map ×1
- the second loop is a whole number ×1
- the second map does not, which is what makes it a control ×1
- the seven-sheet list (4,3), (3,3,1), (2,2,2,1) is realised ×1
- the shape list is one the family knows ×1
- the share falls with every two letters ×1
- the share of coprime classes is near 6/π² ×1
- the shortest words for two, three and four nails have 4, 10 and 16 letters ×1
- the shrink is legal to begin with and stops being legal ×1
- the slide is drawn in three to five stages ×1
- the speed stays well away from nought along the whole deformation ×1
- the speed vanishes exactly at s = ½ and nowhere else nearby ×1
- the sphere counts are 1, 1, 2, 6, 19, 76, 376 ×1
- the subgroup counts 1, 3, 13, 71, 461, 3447 ×1
- the surface has genus 1, 2 or 3 ×1
- the symmetries reach every sheet exactly when there are as many of them as sheets ×1
- the symmetry is ab or aba ×1
- the table holds a list that is realised and a list that is not ×1
- the table runs to between three and six sheets ×1
- the table runs to between two and six sheets ×1
- the three permutations multiply to the identity ×1
- the torus has σ(n) subgroups of index n ×1
- the turning number is 1 before the cusp and 0 after it ×1
- the twist is done one to three times ×1
- the twisted loop crosses the side edges as the matrix predicts ×1
- the two run one after the other is a whole number ×1
- the two squares never overlap during the slide ×1
- the view is one the family draws ×1
- the walk ends ×1
- the winding number is a whole number ×1
- the word a is refused ×1
- the word aa is refused ×1
- the word ab is refused ×1
- the word b is refused ×1
- the word is one this family realises ×1
- the word is reduced and not empty, so the loop is not trivial in the group ×1
- the word read off the curve is the word the curve was built from ×1
- the words that come back are closed under composition ×1
- there are exactly eight meanders of order three ×1
- three crossings give six curves on the sphere and twenty in the plane ×1
- three letters give 7 and 97 subgroups of index two and three ×1
- times is read only by the twist view ×1
- two alternating squares multiply to four swaps ×1
- two fixed-point-free involutions realise only the even split ×1
- two matchings forming one alternating cycle multiply to two equal cycles ×1
- two non-trivial loops lift to closed paths ×1
- two or three circles below ×1
- two straight loops meet as often as the determinant of their classes says ×1
- two to four nails ×1
- two words land on the same sheet exactly when one undoes the other into the subgroup ×1
- up to eight sheets nineteen data fail, none of them in prime degree ×1
- while a word that really is trivial reduces away, so the test can fail ×1
- Whitney's formula holds on every random curve ×1
- with the last point's permutation removed, going round no longer returns every sheet ×1
- words of length up to two to four are listed ×1
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.
A ball whose outside is not one
Alexander's sphere separates space into two pieces, exactly as the theorem promises. Its inside is an ordinary ball. Its outside is not, and the obstruction is a tree of clasped horns whose tips never stop.
TopologyA count that can say zero
The branched count ends on a list of cycle shapes that passes every test and describes no covering. There is an exact formula for how many coverings a list has — a sum over the character table of a symmetric group — and it returns nought without giving any reason why.
TopologyA 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.
TopologyA hole that lasts across scales
A cloud of points sampled from a circle has no hole at all, and joined at the right scale it has exactly one — but nobody knows the right scale in advance. Persistent homology joins the points at every scale at once and records how long each hole survives. The circle's hole lasts; accidental holes vanish almost at once; and moving every point by δ moves every survival time by at most 2δ.
TopologyA 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.
TopologyA picture that falls when any nail is pulled
Hang a picture on two nails so that it stays up, but falls the moment either nail is pulled out. The string has to go round the nails in a pattern that is a commutator — once round each, then back round each in the same order — and the reason is that a loop in a plane with holes in it is a word in a group in which order matters. With more nails the commutators nest, and an exhaustive search finds the shortest strings for two, three and four nails: 4, 10 and 16 passes.
TopologyA 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.
TopologyCounting the subgroups of a free group
The free group on two letters has one subgroup of index 1, three of index 2, thirteen of index 3, then 71, 461, 3,447 and nearly thirty-two million of index 10. Each is a covering of a figure-eight with a marked sheet, so counting them is counting pairs of permutations that join every sheet to every other. Marshall Hall did it in 1949 by sorting every pair by how far one sheet can travel, and the recursion that comes out says the count is almost exactly n times n factorial.
TopologyCovering 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.
TopologyCurves that cross a line and close
Draw a closed curve that crosses a straight line 2n times and never crosses itself. Above the line it is a set of nested arches, below it another, and every such curve is a pair of the Catalan number's arch systems that happen to close into one loop. There are 1, 2, 8, 42, 262, 1,828 of them, and every count computed so far grows by a factor creeping towards 12.26 — a number nobody can prove, with an exponent conjectured from the physics of random surfaces.
TopologyCutting 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.
TopologyEvery 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.
TopologyFolding a graph until it decides
A subgroup of a free group usually arrives as a list of words, and almost nothing about it is readable from the list. Draw the words as loops, merge every pair of edges with the same label leaving one point, and what is left is a machine that decides membership by reading.
TopologyHow 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.
TopologyHow many ways a curve can cross itself
A closed curve that crosses itself three times can be drawn in exactly six essentially different ways on a sphere, and twenty in the plane. Four crossings give nineteen and eighty-two; six give 376 and 2,645. Every one of them is a word — the order in which the crossings are met — and a choice of direction at each crossing, and the whole census comes from asking which of those choices close up on a sphere.
TopologyLinked, 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.
TopologyOne line that halves them both
Two shapes lying anywhere on a page, of any sizes and any shapes at all. There is always a single straight line that cuts both of them into two equal halves at once — and finding it needs no cleverness, only the observation that a quantity which reverses sign has to pass through zero.
TopologyThe 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.
TopologyThe lists no covering can have
A covering of the sphere by itself with three branch points is three permutations of the sheets whose product is the identity. The Riemann–Hurwitz count says which lists of cycle shapes might work, and a search through every permutation says which do. Up to thirteen sheets, 150 lists pass the count and fail the search — and not one of them has a prime number of sheets.
TopologyThe 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.
TopologyThe 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.
TopologyThe 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.
TopologyThe subgroups of a surface group
A covering of a surface with n sheets is a choice of permutations for its handles whose commutators multiply to the identity, and counting those choices is a question about the characters of the symmetric group. Only their dimensions are needed — the numbers of ways to fill a Young diagram — and they give the torus σ(n) subgroups of index n, the genus-two surface 15, 220, 5,275, 151,086, and every surface a count that soon becomes 2n times a power of n factorial.
TopologyThe 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.
TopologyThe turns a tangent makes
Drive once round a closed track and count how many full turns the steering has made. A circle is one turn, a figure-eight is nought, and every loop adds one. Whitney and Graustein proved that this one number decides when one track can be bent into another without ever stopping — and it can be read off the crossings of a drawing without following the curve at all.
TopologyTwo loops and one number
Give each crossing between two closed curves a sign, add them up, halve — and the answer does not depend on how the curves were drawn, how they are pushed about, or which way the picture was projected.
TopologyWhat a branch point subtracts
Let the sheets of a covering meet at a few points and the count stops multiplying — but it fails by an amount that can be read off each point's permutation. Cut the sphere into a star, lift the cells, and the Riemann–Hurwitz formula falls out of a subtraction. The same count then turns out to be necessary and not sufficient.
TopologyWhat 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.
TopologyWhere the fixed point escapes
The theorem asks for a set that is closed, bounded and free of holes. Drop any one of the three and a map appears that moves every single point — and in each case the point that should have stayed still can be seen leaving.
TopologyWhy 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.