Cartographic Projection
every map is wrong, and by exactly how much
Concept

Rigidity — where it appears

Whether a set of constraints pins a figure against every small movement, or leaves it free to flex. For distances and for bearings alike the count is 2n − 3 on n places in the plane, and which particular constraints reach that count is decided by their arrangement rather than their number.

Named by 3 essays across one field — each of them below, with the objects they name alongside it.

The share of its distances a flat picture can hold. A picture of n places on a plane has 2n coordinates and is unchanged by two translations and a rotation, so 2n − 3 numbers in it are genuinely free; each distance held exactly is one equation. So at most 2n − 3 of the n(n−1)/2 distances can be right, whatever the places are and however hard the map maker tries. The share falls as 4/n: five of six for four places, thirteen of twenty-eight for eight, and 197 of 4,950 — 4.0% — for a hundred. The dashed curve is 4/n, which the count approaches from below and never crosses.

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.

impossibility · Embedding Two pairs of ten are in every picture that can be drawn. London, New York, Tokyo, Sydney, Cape Town, drawn holding seven of their ten pairs' bearings exactly — the most any flat picture of five places can hold. Of the 15,360 ways of choosing seven pairs and a direction on each, 152 give a picture whose held arrows all point forwards, and London–Tokyo and Sydney–Cape Town, drawn heavy, appear in every one of them. The three pairs this particular choice leaves out are dashed. The price is paid by the rest: the worst, New York to Sydney, is 142.1° from the truth.

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.

impossibility · Embedding Six of eighteen, where either kind alone can hold only five. London, New York, Tokyo, Sydney, drawn holding five distances exactly — the thick edges — and one bearing exactly, the arrow from London to New York. Six exact constraints, where five distances is the most any flat picture of four places can hold and five bearings is the most it can hold of those. All six are satisfied to 1.9 × 10⁻¹¹. The sixth is not free room found by luck: a picture is blind to where it sits, how it is turned and how large it is, distances see the last of those three and bearings see the second, and a picture holding both kinds is blind only to where it sits. Tokyo–Sydney, dashed, is the distance left out; the picture is wrong about it by 6.9%.

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.

impossibility · Embedding

Named alongside it

The objects these essays reach for when they reach for this one.

ConstraintDegrees of freedomEmbeddingVerificationAzimuthBearingEnumerationEquidistanceAzimuthalClosed formConvergence of meridiansDistance matrix

All concepts