Fixed points — the series

A map of the interval must fix a point. a continuous map of the interval, drawn with the diagonal. Every continuous map of the interval into itself meets the diagonal somewhere; this one does so at x = 0.6944.

Something always stays put

Stir a cup of coffee however violently and let it settle. Some molecule is exactly where it started. Crumple a map and drop it on the region it depicts, and one point lies over the place it names.

part 1 · topology

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.

part 2 · topology

A fixed point that attracts, and one that does not. The same map at two parameters, with the staircase walking towards the crossing in one and away in the other.

A point that pulls, and a point that pushes

Every crossing of a curve with the diagonal is a value the rule leaves alone. Whether anything ever arrives there is decided by one number — the slope at the crossing — and the picture makes the reason obvious.

part 3 · dynamics

A three-coloured triangulation, and the walk that finds a rainbow triangle. A triangle cut into 36 smaller ones, its corners coloured under Sperner's rule. The 9 small triangles carrying all three colours are shaded, and a path enters through a door on one edge and ends inside one of them.

Three colours force a triangle

Cut a triangle into small ones and colour the corners under one restriction. However the cutting and the colouring are done, some small triangle ends up with all three colours — and the number of them is always odd.

part 4 · discrete

x ↦ cos x: two starts, one destination. A map whose graph is nowhere steeper than a fixed factor under one, with staircases from two different starting points converging on the same crossing, and the distance to it falling under a geometric bound.

A map that shrinks everything

One extra hypothesis — that every distance is shortened by at least a fixed factor — turns the existence of a fixed point into its uniqueness, an algorithm for finding it, and a bound on the error after any number of steps.

part 5 · analysis

Three sets where a fixed point escapes, and one where it cannot. A ring turned about its centre, an open disc halved toward a point of its rim, the plane shifted sideways, and the closed disc turned and shrunk. Only the last has a point that its map leaves where it is.

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

part 6 · topology

Two loops of equal area, and the two points where they cross. An annulus with the loop of points whose angle is unchanged by the map and the image of that loop, drawn both on the annulus and unrolled into a rectangle. The loops cross at two points, which are the fixed points.

A twist that cannot avoid two points

Turn the two edges of a ring in opposite directions without changing any area, and something in between must stay exactly where it is — not one point, but at least two, and the reason is that two loops enclosing the same area have to cross.

part 7 · dynamics

A rule that meets the diagonal, and the same rule with a hole in it. Two panels, each the graph of a rule assigning a set of values to every point of the unit interval, drawn against the diagonal: the first meets the diagonal at a filled-in jump, the second has the jump left open and misses it.

A map that offers a choice

Brouwer's theorem needs a function, and the object it was most wanted for is not one — a best reply is a whole set whenever a chooser is indifferent. Allow a point to be sent to a set and the fixed point survives, provided the sets are convex, and the convexity is the entire hypothesis.

part 8 · topology

Sperner's corridor to the same fixed point, on a gentle map and a twisted one. Two 32 by 32 labelled grids; the corridor crosses 44 triangles reading 100 corners on the gentle map and 148 triangles reading 204 corners on the twisted one.

What it costs to find the point that stays put

Brouwer's theorem promises a point a map leaves where it is, and Sperner's corridor walks to it. On a gentle map the walk is short; twist the map about its fixed point and the corridor follows every turn, so its cost grows like the square of the grid. Halving the square by winding number finds the same point in a number of readings proportional to the grid's side whatever the map does — and no method that only reads the map can do fundamentally better.

part 9 · topology

Cutting the square down to a fixed point. λ = 0.999 with turning; accuracy 0.001: cutting 4 readings, iterating 7215.

A cut that gets sharper as the map gets lazier

Iterating a map that shrinks distances by 0.9999 takes 141,254 steps to reach its fixed point to a millionth. Cutting takes six: read the map at one point, and the fixed point must lie on the far side of the line halfway between the point and its image. The cut gets better exactly where iteration gets worse, because a map that barely shrinks puts its fixed point almost on every such line.

part 10 · topology

A full board has exactly one winner. A random 11 by 11 Hex board filled with two colours: second colour connects with a chain of 11 cells.

A board that cannot be drawn

Colour a rhombus of hexagons in two colours. One colour must join its two sides, and only one: in all 65,536 colourings of the four-by-four board, no exception. The proof is a walk along the colour boundary, the same walk that proves Sperner's lemma, and David Gale showed that the no-draw theorem of this board game is equivalent to Brouwer's fixed-point theorem. Nobody knows the winning strategy for a full-sized board, though a short argument proves one exists.

part 11 · topology

Crossings counted with signs. Circle maps x to dx plus a bend: degree 3: 2 fixed, signed sum -2; degree −2: 3 fixed, signed sum 3; degree 2, bent: 5 fixed, signed sum -1.

A number that counts what it cannot see

Whether a map has a fixed point seems to need the map. Lefschetz's number needs only what the map does to holes, and it stays the same however the map is bent. On a torus it is one determinant: |det(I − A)| fixed points, checked exactly on all 2,401 small matrices, 1, 5, 16, 45, 121 periodic points for Arnold's cat, and a formula that also counts solutions of equations over finite fields.

part 12 · topology