Topology — the series
-
No map of the whole sphere is one to one
Eleven essays establish that no map preserves distance, and every step of that argument needs a distance. There is a second impossibility underneath it that needs nothing at all: a sphere is compact and has no boundary, so a continuous map of it into the page cannot also be one to one. Eighteen library projections, eighteen escapes, and not one of them free.
-
North cannot be up everywhere
Ground north is a field of arrows on the sphere, and a field of arrows on a sphere must vanish somewhere. The failure is not measured, it is counted: the indices of the zeros sum to two, obtained here as a winding number in seven different charts with no distance anywhere in the calculation, and it is the same two that Gauss–Bonnet gets by integrating curvature.
-
Two opposite places on the same spot
A projection may be continuous everywhere or one to one everywhere, and the first two rungs price both. What neither says is that the choice is not symmetric: a map that keeps continuity does not lose injectivity somewhere arbitrary. It loses it, always and at minimum, on a pair of places directly opposite each other on the Earth.
-
How many times, not whether
Three rungs of this ladder answer yes or no and have no other kind of answer. The degree is the first quantity here that counts: a continuous map of the sphere to itself covers it a whole number of times, injectivity forces that number to ±1, and the number is recoverable three ways — by counting preimages, by integrating swept area, and from the rate at which the preimages coalesce.
-
Four colours, and what a cut cannot do to them
Every projection removes a set, and a map cut at the antimeridian draws six of its fourteen countries in two pieces — twenty faces where the globe had fourteen regions. The obvious guess is that a map with split countries is the exclave problem and needs a fifth colour. It needs exactly four, and the reason is that the cut adds faces and adds no edges.
-
Two charts are enough, and one is not
The topological minimum for an atlas of the sphere is two sheets, and the counting fixes a price nobody chose: the worst point of any two-chart atlas is 90° from a chart's centre, where a conformal chart's areal factor is exactly 4 and an equal-area one's angular deformation is 38.94°. A national series has a hundred and twenty thousand sheets, and a hundred and twenty thousand minus two of them are bought by accuracy.
-
What a cut buys
Cuts are usually counted and never measured. A cut is a curve on the sphere with a length in kilometres, the shape distortion it removes is a falling function of that length, and the interruption everybody prints spends a hundred thousand kilometres to reach a figure the even-lobed curve reaches with sixty.
-
A ring can be drawn whole, and only one way
A band of latitude has a hole in it, and a region with a hole has a number no angle-keeping map can change. Draw the band without cutting it and that number forces the map: the stereographic from one pole is the least-varying picture there is. One cut along a meridian frees the cone constant, and the scale variation the cut buys back runs from nothing on a polar cap to a factor of 2.13 between the tropics.
-
Two islands are three numbers, and the proof does not survive them
A sea with one island at its centre has one conformal invariant and a forced best map. Put two islands in it and there are three invariants, readable in closed form because stereographic projection carries circles to circles — and the forcing is gone. The theorem that picked the map needed the region to be unchanged by rotation, not to have one hole, and a single harmonic term two hundredths in size beats the stereographic by 0.19 per cent the moment an island moves off centre.
-
One cut belongs to the island that would cost most alone
A sea with two islands pays a few per cent for being drawn whole by an angle-keeping map, and one cut buys back part of it. Which island to cut is a design choice that leaves the ground exactly where it was, and it is not decided by size: across twenty arrangements of a large island and a small one, the cut worth most goes to the island that would cost the sea most if it were alone in it — in eighteen of twenty, the other two near-ties — which is usually the more central one. A cut joining the two islands buys almost nothing, and the better cut is nearly always the longer.
-
The second cut goes across the sea
With two islands and one cut, the island that would cost the sea most alone names the cut. With three islands and two cuts, the obvious rule — cut the two dearest — names the best pair in only 23 of 40 seas, and loses up to 23 points of what three cuts would buy. It fails when the two dearest sit on the same side of the sea, where their cuts do each other's work. The best pair keeps the dearest island in 37 of 40; its partner is the island across the centre from it, which is right in 32 of 40 and never costs more than 12 points. A cut joining two islands is never worth a second cut to the sea.
-
A sea with five islands is seldom worth five cuts
With three islands in a sea, the second cut went across the sea from the first, and the number of cuts worth spending looked like the number of directions the islands point. With four and five islands that survives in part and breaks in part. Choosing the dearest island and then, each time, the island farthest in bearing from every island already cut names the best pair of cuts in 28 seas of 40, where the two dearest name it in 16 — and it fails at three cuts of five, because the best three cuts often do not contain the best two. The dearest island is no longer reliably among the best pair. And 39 seas of 40 are worth fewer cuts than they have islands: the count follows the widest gap in the islands' bearings more closely than it follows how many islands there are.