How each projection escapes being one to one
Eighteen projections, and the theorem allows no fourth column. A map of the whole sphere either leaves ground undrawn, or draws one place as a curve, or is cut so that one ground curve appears twice — and 11 of the eighteen do more than one of those. The three columns are a solid angle, a count of places and a page length, which is why they are three columns rather than one score: there is no rate at which a hemisphere converts into a pole.
It is drawn by topology-figure with
show: "topology-figure" — one member of a family of
0 figures
that share a generator, so the drawing above is what that generator returns when it is asked
for this one and given nothing else.
8 essays call it. Every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.
Where it is called
Changing this changes every one of these figures.
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
Six rungs count cuts and none measures one. 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.
The second derivative cannot classify
Seven essays have used a second derivative to measure a size. The one thing a second derivative is classically used to do is say what KIND of thing is at a point, and on a sphere that use fails: the determinant test totals six where the truth is two, its failure is confined to exactly the field it is asked about, and the count that gets it right never differentiates twice.