Curvature — where it appears
Named by 7 essays across 5 fields — each of them below, with the objects they name alongside it.
Three conditions are one too many
Two distances fix a point in a plane and a third has no freedom left to be satisfied with. Chamberlin's trimetric construction averages the three positions that satisfy two conditions each, and the spread between them — never zero anywhere, 22 km over North America, growing as the cube of the region — is the price of the extra clause.
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.
Where the surface curves the other way
Twelve rungs argue the impossibility 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.
The shortest route a vehicle can fly
Nine rungs find the shortest path under a metric and none asks whether the thing travelling can follow it. Bound the curvature and the route depends on two headings as well as two positions: the turning cost is a fixed 1.81 kilometres whatever the leg length, so it is 18 per cent of a short leg and 0.28 per cent of a long one, and the whole of it vanishes when the vehicle happens to be pointing the right way.
The indicatrix at a point that has none
Ten essays on this ladder take the derivative for granted. Rung three proved the indicatrix is a limit and every figure since has assumed the limit exists. There are points on the maps this collection draws where it does not, and they are not exotic: the horizon of a gnomonic map, and every corner of every polyhedral net.
The nearest map to an impossible request
Rung seven found that not every distortion can be asked for. It never asked what happens when one is asked for anyway — and the answer has a shape: the achievable fields are the solutions of an elliptic equation, a request is a point off that set, and the nearest point leaves a residual whose floor is the curvature rather than the size of the ask.
A thousand features are wrong in the same direction
The area a simplification costs is unpredictable in sign for one feature. Over a population it is not: twenty-four presentations of one shape all lose area, the mean is seventy standard errors below zero, and no amount of aggregation removes it.
Named alongside it
The objects these essays reach for when they reach for this one.
ConformalityConditionConstraintLeast-squaresOptimisationResidualTheorema EgregiumToleranceAggregationAngle deficitAnisotropyArea