Generator

the trefoil

A generator in the topology library, called 128 times across 23 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.

knot 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 trefoil. the trefoil, drawn as a closed curve with 3 crossings. At each crossing the strand passing underneath is broken, which is the only information the flat picture carries that the curve alone does not.

A trefoil, and how far its tangent turns

A trefoil, and how far its tangent turns. The (2, 3) torus knot with tube radius 0.45; total curvature 16.8556 = 5.3653π.

In every direction the trefoil has at least two highest points

In every direction the trefoil has at least two highest points. Number of height maxima of the (2,3) torus knot (r = 0.45) over 4050 directions: minimum 2, maximum 4, area-weighted average 2.6807; total curvature 5.3652π.

Total curvature is a count of hilltops, averaged over directions

Total curvature is a count of hilltops, averaged over directions. circle: 2.000π vs 2.000π; tilted ellipse: 2.000π vs 2.000π; flower, 5 petals: 9.393π vs 9.500π; trefoil, tube 0.15: 4.075π vs 4.073π; trefoil, tube 0.6: 6.215π vs 6.226π; trefoil as (3, 2): 5.951π vs 5.954π; figure-eight knot: 6.610π vs 6.614π; (2, 5) torus knot: 8.577π vs 8.549π.

Squeezing a trefoil towards 4π

Squeezing a trefoil towards 4π. trefoil, twice round: 4.001π at r = 0.02, 7.254π at r = 0.9; trefoil, three times round: 6.000π at r = 0.02, 6.876π at r = 0.9; (2, 5) knot, twice round: 4.013π at r = 0.02, 10.876π at r = 0.9.

Where the tangent points: the circle's path and the trefoil's

Where the tangent points: the circle's path and the trefoil's. Tangent indicatrices of a circle (length 2π) and a (2, 3) torus knot of tube radius 0.45 (length 5.365π).

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 knot must turn twice, and a little more

Follow a closed curve and add up how far its direction turns. Any closed curve turns through at least one full circle; a knotted one turns through more than two. The proof is a count of hilltops — the total turning equals 2π times the number of highest points the curve has, averaged over every direction to look from — and a curve with a single hilltop in any direction cannot be knotted.

Topology

A polynomial behind the colourings

The figure-eight knot and the cinquefoil both have determinant five, so they admit exactly the same colourings, and every counting argument treats them as one. Put a variable where the colouring rule has a two and the determinant becomes a polynomial — and the two knots come apart.

Topology

A polynomial that tells left from right

The trefoil and its mirror image have the same colourings, the same determinant and the same Alexander polynomial, and the first proof that they differ was a hard argument about groups. Smooth every crossing both ways, count the circles in each of the resulting pictures, and add up the counts with the right weights: the total changes when the knot is reflected.

Topology

A whole number split into two that are not

Run a ribbon round a closed loop and its two edges link a whole number of times. That number is shared between two quantities that are nothing like whole numbers: how far the ribbon twists about its core, and how far the core coils about itself. Bend the loop and the twist and the coiling trade continuously, to three decimal places, while their sum stays fixed — the arithmetic behind a coiled telephone cord and a supercoiled loop of DNA.

Topology

Almost every long loop is knotted

Close a random walk into a loop and ask whether it is knotted. With ten steps almost never; with a hundred, more than one time in five it can be proved knotted by a single number; with two hundred and fifty, more than half. The chance of staying unknotted falls exponentially with length — Frisch, Wasserman and Delbrück guessed it for polymer rings around 1961, and it was proved in 1988 — because a knot needs only one small tangle somewhere, and a long loop has room for many.

Topology

Colours that count more than three

Three colours prove the trefoil is knotted and say nothing at all about the figure-eight, which refuses them exactly as an unknotted loop does. The repair is to stop colouring and start counting — with five colours, or seven, and with the arithmetic done modulo the number of them.

Topology

Every loop of the butterfly links every other

The Lorenz equations have infinitely many periodic orbits, each a closed loop winding round the two lobes in its own order. Name each loop by that order — LR, LLR, LLRLR — and the linking number of any two can be read off the names, without solving anything: it is half the number of times a left-going strand passes a right-going one. Every such crossing has the same sign, so every pair of loops links, positively. Computing forty-five pairs from the equations themselves, the Gauss integral lands on the predicted whole number every time.

Topology

How many changes undo a knot

Cut the string at a crossing, pass it through the other strand and join it up again, and any knot can be undone by doing that often enough. The fewest changes needed is the unknotting number, and proving that fewer will not do needs a number that each change can move only a little. The signature moves by at most two per change — enough to settle thirteen of the fourteen knots up to seven crossings, and not the fourteenth.

Topology

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

Many crossings and a small linking number

Two random loops of a thousand steps, tangled round a common centre, cross each other about a thousand times in any picture of them. The linking number is half the signed count of those crossings — and it is typically about three. The signs cancel in nearby pairs, wherever one loop dips under the other and comes back, and what survives grows roughly as the fourth root of the length. Shut the same loops in a box and the cancellation stops: the crossings grow as n², and the linking number as n.

Topology

Seven graphs that must link

Six points joined in every way cannot be placed in space without two disjoint triangles hooking together. Trade any triangle for a three-pointed star, or a star back for a triangle, and the property survives; doing it in every possible way from K₆ reaches exactly seven graphs, the Petersen graph among them, and stops. Every placement of every one of them links, by the same parity count. Remove any edge from any of them, and placements that link nothing appear at once. The seven are the whole answer: a graph must link exactly when it contains one of them.

Topology

Seven points and a knot they cannot avoid

Put seven points anywhere in space and join every pair with a straight segment. There are 360 closed paths that visit all seven points once each, and at least one of them is knotted — however the points are placed. The reason is a parity, as it was for six points and a linked pair: a number read off each path's knot adds up, over all 360, to something odd. Six points are not enough; seven always are.

Topology

Six points in space and a pair that must link

Put six points anywhere in space and join every pair with a straight segment. Split the six into two triangles — there are ten ways — and at least one of the ten pairs of triangles is linked like two rings of a chain. No placement avoids it. The reason is a parity: moving an edge through another changes exactly two of the ten linking numbers, so their sum stays odd whatever is done.

Topology

Six sticks tie a trefoil, and five cannot

Build a knot from straight sticks joined end to end and ask for the fewest. A trefoil takes six, and the six corners can be whole-number points in a box ten units wide. Five sticks can cross one another five times in a picture, as often as a cinquefoil needs, and still tie nothing — the five crossings always twist three one way and two the other. The fewest sticks is a measure of how knotted a knot is that no diagram shows directly.

Topology

The crossings an alternating knot cannot lose

Peter Guthrie Tait drew knots for years and believed, without proof, that a diagram whose crossings alternate over and under, and which has no twist that can be undone, is already drawn with the fewest crossings the knot allows. The proof took a century, and when it came it needed only the two most extreme ways of smoothing the diagram and Euler's count of the regions of a map.

Topology

The surface a knot bounds

Every knot is the edge of a surface with two sides, and Seifert found a way to build one from any diagram: smooth the crossings, fill the circles that result with discs, and join them with twisted bands. Counting the handles gives an upper bound on how complicated the knot is, the Alexander polynomial gives a lower one, and for the simplest knots the two meet.

Topology

Three moves, and what they cannot undo

A knot is a closed loop of string, and two knots are the same if one can be wiggled into the other. Reidemeister reduced all possible wiggling to three local pictures — which is what makes it possible to prove that a knot is knotted.

Analysis

Three sines tie a knot

Let a point move with a different sine wave in each of the three directions of space, the three frequencies whole numbers with no common factor, and it traces a closed curve that is usually knotted. With frequencies 2, 3 and 7 the curve is the knot 5₂. The trefoil, the simplest knot of all, can never be made this way: the half-turn that shifting time by half a period performs forces a condition on the knot's polynomial that the trefoil fails.

Topology

Torus knots that fill the three-sphere

Hopf filled the three-sphere with circles, every two linked once. Let the circles turn at two different speeds instead — p turns one way while they make q the other — and the three-sphere is filled with (p, q) torus knots, trefoils when p and q are 2 and 3, every two of them linked exactly pq times. Two exceptional fibres remain plain circles; every knot links them q and p times, and they link each other once. Computed from the drawn curves for ten fibrations, every pair comes out at pq to six decimal places.

Topology

Two 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.

Topology

Two pieces, in every dimension

A closed curve cuts the plane in two. A closed curve in space cuts nothing at all, and it takes a closed surface to do the job — which is the shape of the general theorem, and the reason the word "dimension" means anything.

Topology

Which knots a random loop ties

Long random loops are almost always knotted, but knotted as what? Sorting 14,000 closed random polygons by two values of the Alexander polynomial answers it. The trefoil leads at every length, five times as common as the figure-eight at 400 sticks. Each knot's share, divided by the unknotted share, grows like a power of the length, and the trefoil tied twice grows about twice as fast as the trefoil — what a loop carrying independent small tangles would do. Up to 300 sticks the double trefoil turns up exactly as often as two independent trefoils should.

Topology

Zero can mean two different things

The linking number counts how often one loop pierces a surface the other one bounds. Two punctures of opposite sign add to nothing, and a loop that never goes through adds to nothing as well — so the answer zero is two pictures wearing one number.

The whole library · What the figures prove