The impossibility
No map is faithful
Not "no map yet", and not "no map at page size". Gaussian curvature can be computed from inside a surface, a sphere has some and a plane has none, and that closes the question permanently.
What can be unrolled
A cylinder is obviously curved and is intrinsically flat, so it lays out on a table with nothing stretched. A sphere is not. The distinction is exactly zero Gaussian curvature, and it is why paper tubes exist and paper globes do not.
The trade-off is two lines
Conformal means the two principal scales are equal. Equal-area means their product is one. Both at once forces both to one, which is an isometry, which the curvature forbids. That is the entire argument.
Total curvature and the scale rule
The impossibility has a size. A region covering a fraction of the sphere carries a fixed amount of curvature that any flat map must absorb, and for a circular region the least distortion any conformal projection can achieve is a closed form nobody can beat.
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.
How small is flat enough
A builder works in plane coordinates and a national mapping agency does not, and the line between them is not a convention. The unavoidable error of treating a patch of the Earth as flat grows as the square of its size, and the size at any stated tolerance is a number.
The curvature of the Earth is not one number
An ellipsoid's Gaussian curvature varies by 1.35% from equator to pole, so the sphere is not developable onto the ellipsoid any more than the plane is onto the sphere. The spherical approximation is a projection with an irreducible cost, and the cost is 6,739 parts per million.
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.
Curvature that varies from place to place
The impossibility this site is built on was argued on a sphere, where the curvature is one number. On the Earth it varies by 1.35 per cent, on Jupiter by 31, on Vesta by a factor of 2.7 — and on a body with three axes it varies along a parallel, which no formula in latitude can express.
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¹⁴.
Impossible in two derivatives, possible in one
The impossibility this whole collection rests on computes a second derivative, so it is a statement about maps that have two. Take one away and it is false: a corrugation restores an exact length while converging to the map that does not, and iterating it gives a flattening whose derivative converges and whose curvature runs to half a million.
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.
The places where a map is exactly right
Nine essays on this ladder say a map cannot be right everywhere. None asks where it IS right — and the answer is a curve, a pair of curves, or two isolated places, never a patch. Measured across fourteen projections the set's neighbourhood shrinks with an exponent of 0.48, 1.0 or 2.0, and the value the impossibility forbids is 0.
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.
Where the surface curves the other way
The impossibility of a perfect map is usually argued on surfaces whose curvature is positive everywhere. The surface a map of the ground actually depicts is not one of them: a stated terrain is saddle-shaped over 79 per cent of its curved area, its curvature runs to twenty-two thousand times the Earth's own, and even a single smooth hill is concave over 89 per cent of itself.
How big a triangle it takes
Gauss proved that a surface-dweller can read the curvature off a triangle's angles. Doing it is another matter: a fifty-kilometre triangle has 5.49 seconds of excess, a one-second theodolite gives that excess a standard deviation of 1.73, and reading K to one per cent needs a side of 281 kilometres. Not one of the great surveys built a triangle within a factor of three of that.
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.
How many triangles it takes
Pricing one triangle left the fact that a survey observes hundreds unaccounted for. Averaging n of them divides the noise by √n, and n is not free: a chain of fixed length holds fewer big triangles than small ones, so the accuracy improves as the side to the power three halves rather than two. Struve's 141 triangles of forty kilometres are worth exactly Gauss's seven of eighty-five.
Four cities that cannot be drawn to scale
Every impossibility in this field so far has been about a surface. This one is about four numbers: London, New York, Tokyo and Sydney have six distances between them, and no four dots on any sheet of paper have those six separations. The test is a determinant Cayley wrote down in 1841, and it comes out −3.34 × 10²³ where zero is required.
How wrong a flat picture has to be
A determinant proves no flat picture of four places is exact and leaves the size of the failure where nobody can read it. Measured directly, the least error falls as the square of how much sphere the places span — fitted exponent 2.0088 — and the same exponent comes back from five different arrangements while the constant in front of it moves by a factor of seventeen.
The best flat picture is not a map
A set of dots whose separations are as nearly right as separations can be made beats every projection in this collection — by a factor of thirteen on four world cities, and by eight per cent on sixteen. The collapse between those two numbers is not about cartography. It is that a picture of n places has 2n − 3 free numbers and n(n − 1)/2 distances to spend them on.
Five distances of six, and never more
A flat picture of n places has 2n − 3 free numbers and n(n−1)/2 distances, so it can be exactly right about 2n − 3 of them and no more — five of six for four places, twenty-nine of a hundred and twenty for sixteen, and 3.98 per cent for a hundred. The bound is reached by a construction with no fitting in it, and an azimuthal equidistant map spends only n − 1.
The escape is not a dimension
Four places that will not lie in a plane surely lie in a space — and they do not. The double-centred matrix of their great-circle distances has a negative eigenvalue, so no Euclidean space of any dimension holds them, and buying a third dimension improves the picture by nothing whatever, to fifteen decimal places. What does work is a page with curvature, and the curvature is pinned to within two per cent.
The error belongs to a few of the places
The least error of any flat picture of sixteen cities is 53.3 per cent, and it is not spread over the sixteen. Six pairs hold it there and Sydney is in three of them: leave Sydney out and it falls to 25.5, while leaving out any of five other cities changes it not at all. Choosing which places to draw is worth more than any choice of how to draw them.
A place with a size can be drawn to scale
Points on a sphere have distances no flat picture holds. Places are not points: give every place a radius and the distance between two of them becomes a range, and some flat picture is right about every range once the radius passes a threshold — 38 kilometres for London, New York, Tokyo and Sydney, six metres for five towns in Britain, growing as the cube of the set.
A flat picture has one direction between two places, and the Earth has two
The bearing from New York to Tokyo and the bearing back are not reverses of each other: they miss by 128 degrees. A flat picture draws one line between the two cities, so no picture containing both can have a bearing error below 64 degrees. On any set of places up to about fifty degrees across, the best flat picture sits exactly on that floor — and away from the poles, so does Mercator.
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.
Five bearings of twelve, and only eight ways to draw them
A flat picture of four places can hold five of their twelve one-way bearings exactly, the same count as distances, and the five are found by solving equations rather than searching. The equations cannot tell a line from its reverse. Of the 192 ways to choose five, eight can be drawn with every arrow pointing forwards, all eight leave London and New York unheld, and on sixteen cities no choice made at random can be drawn at all.
The pair that cannot be held is not the one the geometry names
Four world cities have exactly one pair of the six that no drawable picture holds, and the obvious candidate — the pair whose bearing there and bearing back disagree most — is not it. That quantity predicts something else exactly: whether a held pair's arrow has a forced direction. It separates the two groups with a clean gap and nothing in between. And at five places there is no forbidden pair at all, so the four-place case was a statement about how little room five constraints leave rather than about the map.
A mixed picture holds one more, and what it is holding is north
A flat picture of n places can hold 2n − 3 distances exactly, and it can hold 2n − 3 bearings exactly, and it is tempting to read one budget spent twice. It is not one budget. A distance cannot see which way the page is turned and a bearing cannot see how large it is drawn, so a picture constrained by both kinds is blind to one freedom instead of two — and holds 2n − 2. For four cities that is six of the eighteen available where either kind alone can hold five, and nothing whatever can hold seven: nought of 31,824 choices.
The geoid has a curvature only if you say where you stopped
Thirteen measurements have priced the curvature of surfaces that are stated — a sphere, an ellipsoid, a triaxial body, a surface with a hole, real relief. The surface a height actually refers to is none of them. It is an equipotential of the Earth's own gravity, it is only ever given as a series stopped at a degree, and its Gaussian curvature carries two more powers of the degree than its height does. So the omitted height converges, the omitted slope diverges as a logarithm, and the omitted curvature diverges as a power: EGM96 carries 0.36 per cent of the sphere's own curvature, EGM2008 carries 2.19, and a one-kilometre model would carry twenty.
Two numbers about the paper buy nothing about the places
A picture of n places has four freedoms, and a constraint holds only what its own blindness leaves: distances reach 2n − 3, bearings 2n − 3, the two together 2n − 2. Position is reached by neither, because nothing about how places stand to one another says where on the sheet to put them. A stated position does reach it, and two of them take the budget to 2n exactly. What the count conceals is that the extra two buy nothing: a largest picture holds six place constraints with the pins and six without, the same 7,596 of them, holding the same pairs at the same rates. The constraint system is a direct sum, and a pin is a different currency.
A second pin is a measurement of the places
Counted exactly, a picture of places is a direct sum: the distances and bearings spend its shape and two pins spend where it sits on the sheet. Given tolerances, the sum survives in one form and fails in another. Pins at one place put none of their error into the shape at any tolerance, and wherever the pins are, their average takes none of the distances' error. But every place pinned after the first is a statement about the geography, and held exact it makes the shape worse once its error passes about two thirds of the shape's own.
37 essays in this field, the first 16 of them shown with their opening figure.