Identifiability — where it appears
Named by 14 essays across 4 fields — each of them below, with the objects they name alongside it.
Two projections that cannot be told apart
Over a small enough region every projection is the same picture, so the question is how small. The answer is not one number: two conformal projections need twelve degrees of extent before their graticules can be separated, and two projections with different anisotropy separate below one.
What a careless copy hides
A photocopier that stretches one axis is a nuisance to remove before a projection can be identified. Removing it costs more than it looks: an affine fit absorbs the entire difference between the cylindrical equal-area projections, so Gall-Peters and Behrmann become the same picture at any size, to sixteen decimal places.
When the answer is not in the library
Fitting twenty candidates to a map and ranking the residuals always produces a winner, which makes it a ceremony unless it can also produce a refusal. Held out of its own library, a Mercator map is named as a conformal conic, leaving 0.4 per cent of the map's width unexplained — and the quantity that tells the two situations apart is not the residual but the margin, which is 1.6 when the truth is absent and 10¹³ when it is present.
The landscape the search walks on
The three-parameter aspect search was run and its answer recorded with a note admitting nothing proved it global. Mapping the objective finds 26 to 34 local minima for every projection and region tried, a downhill walk from a random start reaching the best of them 6 to 35 per cent of the time — and one seed from the coarse grid the search already uses reaching it in all four cases. The score is reproducible to two per cent across a sevenfold refinement; the pole it names moves 60 degrees.
Where the control points are
Five rungs fit a library to a map and ask how much to trust the winner. None asks whether the parameters are recoverable at all. On control points along one parallel an equirectangular's standard parallel is not merely hard to find — it is invisible, exactly, and five hundred and twelve points on the same parallel are as blind as eight.
The shape of the valley
An aspect search returns three numbers, two searches return triples that differ by a hemisphere, and the maps they produce agree. One cause is an exact degeneracy and the rest was called a valley and left unmeasured. Sampled densely, it is neither a valley nor a basin: a connected sheet spanning 170° of pole that splits in two at twice the best score and into thirteen pieces by 1.7 times it.
Where the valley breaks in two
A near-optimal set is one connected sheet at a loose threshold and thirteen basins at a tight one, and the transition was explained without being tested. The explanation is a prediction about region size and projection sharpness: swept over both, the threshold falls from 2.10 to 0.27 as a region grows from 6° to 30°, three projections lie on nearly one curve, and a fourth declines to join for a reason worth having.
The datum hides inside the projection's parameters
Six essays recover a projection from control points with the body it was drawn on taken as known. It is not known, and the fit cannot find it: a 99-metre datum shift is absorbed to 99.7 per cent on a two-degree sheet and to 85 per cent on a hemisphere, leaving eleven parts per million of the map behind.
A rotation is not absorbed the way a shift is
A datum's rotations were expected to be the part a plane fit could not swallow. They are the part it swallows best — 93 times better than the translations over a hemisphere, and 24 times better per metre moved — and the reason is that the rotation which matters is a change of longitude, which is a symmetry of the map.
The answer is a set
Fitting a projection to control points produces a best fit — one projection, ranked first, with a margin. A best fit without a spread is not a measurement, and the spread is free: a control point has a width, and every candidate whose residual is inside that width has not been ruled out. At one per cent noise a four-degree region admits ten of twenty candidates and a forty-degree one admits exactly one.
A levelling loop weighs the root, and a triangle weighs the mountain
A mountain range is carried partly by a root of light crust beneath it, and a survey that knows the ground can ask how much. Put a root thirty kilometres down under a stated range and it moves a levelling loop's misclosure by 85 per cent as much as the mountains' own rock does, and a triangle's excess by 16 per cent: the root's gravity is a smoothed copy of the ground, and a smoothed copy crosses the contours. Read against their noise, pinning the root's share to a tenth takes about 2,700 fifty-kilometre loops, a million triangles or 550 astronomic stations — and if the rock's density is unknown too, a triangle cannot tell a compensated mountain from a lighter one.
A loop reads a root's depth from its own pattern, and a triangle reads none of it
A levelling loop and a geodetic triangle respond to a buried root in proportions that change with its depth, so their ratio looked like a gauge of how deep a range is compensated. It is not, because a triangle's response to a root at 30 km is a hundredth of its own noise. The depth is there in the loops alone: a root changes the pattern of misclosures from loop to loop as it deepens, and 1,600 loops of 50 km place a 10 km root within a factor of 1.5 three times in four and a 30 km root about half the time. A 60 km root is not placed even by 6,400, and when the depth is fitted rather than stated, such a root is read as a light shallow one carrying 25 per cent of the mass where it carries 60.
The parameters are not independent
Rung seven gives the seven parameters their own uncertainty and stops at seven numbers. There are twenty-eight, and the twenty-one nobody publishes are not small: a translation and the rotation that mimics it correlate at 0.94, the normal matrix has a condition number of 4 × 10¹⁶, and propagating from the diagonal alone overstates the transformation's uncertainty by up to a factor of thirty-six.
Gravity is worth four loops a station, and the background still hides a deep root
Levelling loops alone place a range's compensating root at ten kilometres three times in four from 1,600 loops, and do not place one at sixty from 6,400. Gravity measured on the ground reads the root's attraction directly, and a station is worth about four loops for a shallow root and two for one at thirty kilometres. It does not place the deep root either: 1,600 stations put a sixty-kilometre root within a factor of 1.5 of its depth in fewer than one survey in five. With the background field taken away, a hundred stations place it every time. What hides the deep root is not the reading but the geoid's own mass that the range does not explain, and either half of its spectrum is enough to do it. Fitted for depth, gravity reads the deep root as too heavy, where the loops read it as too light.
Named alongside it
The objects these essays reach for when they reach for this one.
Least-squaresResidualVerificationInverse problemDegeneracyProjection identificationAspectCorrelationDatumEstimatorIsostasyLevelling