Topology — where it appears
Named by 22 essays across 4 fields — each of them below, with the objects they name alongside it.
Measuring curvature from inside
A flatlander with a ruler can find out that its world is round, by drawing a triangle and adding the angles. Gauss–Bonnet turns that into an exact statement, and the total curvature of a closed surface turns out to be a number obtained by counting.
A direction carried round a loop
Carry a bearing round a circuit, keeping it as parallel to itself as the surface allows, and it comes back turned. Round a parallel at 45° the turn is 4.443 radians and the cap enclosed is 1.840, and they sum to exactly one revolution — so the turning is not the curvature, and on a cone it is all of one and none of the other.
Two surfaces with the same curvature
The ladder's base says curvature is the obstruction to a faithful map. It has never asked whether curvature is the whole obstruction — and it is, locally: there is a whole family of surfaces with the unit sphere's curvature at every point, none of them a sphere, and a geodesic circle drawn on one agrees with the same circle on another to one part in 10¹⁴.
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.
The cut has to go somewhere
A solid lies flat only if it is cut open, and which edges to cut is a spanning tree of the face graph — so the icosahedron has exactly 5,184,000 distinct nets, a determinant rather than an estimate. All 384 of the cube's were laid flat and tested: not one overlaps, while an irregular tetrahedron overlaps in four of its sixteen.
The antimeridian is a cut in the numbers
A twenty-degree box across 180° has a bounding box of 359.4°, a planar area seventeen times too large, and a midpoint 20,015 kilometres from where it belongs — which is the antipode, exactly. Moving the cut moves the failure and never removes it, because a circle cannot be numbered by an interval.
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.
More faces, less distortion, more cutting
The five regular solids are where polyhedral mapping stops, and they stop because there are only five rather than for any reason about maps. Subdivide instead, and the family runs to any number of faces with two fitted exponents: distortion falls as the reciprocal of the count and cutting rises as its square root.
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.
Hexagons cannot tile the sphere
Hexagons are the best cell shape a plane offers and the sphere will not take them. Euler's formula forces exactly twelve pentagons into any such tiling — twelve at 42 cells and twelve at 642, while the hexagon count rises twenty-one-fold — and each of the twelve is measurably smaller than the hexagons around it.
A net can land on top of itself
Every one of the cube's 384 unfoldings is a net, and every one of the icosahedron's five million is too. Past the regular solids that stops being true: at 180 faces, 99 of every 100 randomly chosen unfoldings have faces sitting on top of each other, so choosing a net stops being a choice and becomes a search — except that the net anybody would actually draw works every time.
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 address is a curve through the sphere
A database does not fetch a set of cells, it reads ranges of identifiers — so the cost of a query is how many runs its cells form, not how many cells it needs. Hilbert order wins that measurement and loses the one usually quoted for it: its neighbouring cells are further apart in identifier than row-major's, on average and at worst.
A vector tile has an integer grid
Six essays on this ladder treat a vector tile as the thing a raster tile is not: geometry, resolution-free, styled at draw time. Its coordinates are integers on a lattice 4,096 units across a tile, the tile halves at every level, and at 55° north one unit is 88 metres at zoom 6 and 21 millimetres at zoom 18.
A tolerance is a promise about the picture
Douglas–Peucker guarantees exactly one thing: no vertex it discarded is further than ε from the line drawn in its place. It says nothing about the enclosed area, nothing about which side of the boundary a point ends up on, and nothing about whether the curve still fails to cross itself — and all three are what the geometry is usually being asked.
A polygon on a sphere has no outside
Seven essays have treated a stored ring as a boundary between inside and outside. A closed curve on a sphere divides it into two pieces and neither of them is the outside, so every polygon in every file depends on a convention that no coordinate carries — and the two conventions in common use disagree by a factor of fourteen on any ring that contains a pole.
A boundary that two features share
Three rungs simplify one curve and price what a tolerance covers. Almost no boundary in a real dataset belongs to one feature: a county's edge is the next county's edge, it is stored twice, and it is simplified twice. What opens between the two answers is a region belonging to both features or to neither, and its area is not bounded by the tolerance.
A ray from the centre hits the surface twice
Eleven rungs map bodies that are lumpy, triaxial and turning at a drifting rate, and every one assumes the surface is star-shaped about the centre — which is what makes a longitude and a latitude a coordinate at all. A contact binary is not: on a stated body with a neck a third of a lobe wide, 10.9 per cent of the sky has no single radius, and the shape model everybody publishes fills the neck in and adds 1.67 per cent of the volume.
On a body with a hole, north can be up everywhere
Twelve rungs vary the body's shape and none varies its topology, which is what every impossibility here actually rests on. A torus has a nowhere-zero tangent field, a total curvature of zero rather than 4π, and a conformal world map with no cut and no singular point — and it still cannot be flattened, for the one reason that survives.
Named alongside it
The objects these essays reach for when they reach for this one.
Euler characteristicInterruptionVerificationContinuityConventionAntimeridianClosed formGauss–Bonnet theoremInjectivityInvariantSeamTolerance