Connectedness
Named by 9 essays across 3 fields — each of them below, with the objects they name alongside it.
The shape in every picture of itself
One line of arithmetic, repeated, with a single complex number as its only input. Sort the numbers by whether the result stays bounded and the boundary between the two answers is the most complicated object anyone draws from a rule this short.
One c, one picture
The same iteration, with the parameter held still and the starting point varied instead. Every complex number gets its own picture, and moving the parameter a hair can shatter it into dust.
Which side of the line is inside
A closed curve with no self-crossings divides the plane into an inside and an outside. Nobody doubts it, almost nobody can prove it, and on a curve wound tightly enough nobody can see which side a given point is on either.
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.
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.
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.
What is left when the middle is taken out
Cut a finite piece out of a group's picture and count the parts of what remains that run off forever. The integers leave two, the plane one, a tree more with every cut — and no group anywhere leaves exactly three, because a third end is always the first of infinitely many.
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.
A curve of pixels needs two kinds of touching
On a screen a closed curve is a ring of pixels, and whether it has an inside depends on which pixels count as touching. Let diagonal pixels touch, and the inside leaks out through the corners; forbid it, and a curve can fence in a region while being twelve separate dots. Of the 1,048,575 sets of pixels in a small window, every simple closed curve obeys the Jordan curve theorem exactly when the curve and the rest of the plane are given different rules.
Named alongside it
The objects these essays reach for when they reach for this one.
Euler characteristicClosed curveGenusParityTopological invariantBoundaryComplex numbersCounterexampleEscape-timeFractalGluing diagramIteration