Degeneracy — where it appears
Named by 24 essays across 7 fields — each of them below, with the objects they name alongside it.
Where a fit leaves residuals
Seven parameters can carry a rigid motion and a size exactly. A triangulation network is neither, so the best possible transformation between two datums leaves metres on the table — in a pattern, not as noise — and which seven parameters come out depends on where the markers were.
The route with no shortest path
Between a point and the point diametrically opposite there are infinitely many shortest routes and no shortest route, and the standard formula for the distance between two places stops converging in a neighbourhood of it. The failure is a property of the question rather than a defect in the answer.
The aspect has three numbers, not one
The site's aspect search has swung the projection's axis through one plane for a long time, and recorded that a region whose long axis runs diagonally has its optimum somewhere that plane never reaches. Searching the whole sphere of pole positions finds 2.6 times more improvement over Japan and 3.4 over the conterminous United States.
Two parameter sets, one transformation
Agencies publish seven-parameter datum transformations that differ by hundreds of metres in translation, and the usual reading is that one of them is better. Over the region either was fitted to they are the same transformation: a hundred metres of translation, re-absorbed by the rotations and the scale, moves a British coordinate by 5.6 metres and an Australian one by 193.
What a closed figure cannot see
A closed traverse imposes exactly two conditions on its observations, so everything else is free — and the freedom is not spread evenly. At a twenty-millimetre tolerance the worst-placed station in a seven-station loop hides an angle blunder of 2.1 arcseconds and the station standing seventy-two metres from the close hides 57, because a rotation about a point near the finish moves the finish hardly at all.
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.
Report the map, not the parameters
The previous rung found the aspect search returning the same score to 2.3 per cent from poles sixty degrees of latitude apart, and recorded that as a shortfall: the answer was not reproducible. The shortfall assumed the disagreeing triples make disagreeing maps. They do not — the three answers agree on the distortion field to a quarter of the deformation the map already has.
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 fractures into fourteen pieces once the threshold tightens.
One pair of numbers, a hundred and twenty places
A UTM coordinate is two numbers and a zone. Drop the zone and the numbers are still valid in each of the sixty; drop the hemisphere too and the pair names a hundred and twenty places. They form two rings at one latitude each, spaced exactly six degrees apart, and every one of them has the same grid convergence and the same scale factor — so no further geometric measurement can choose between them.
The threshold is not a percolation
The rung below found the near-optimal aspect set breaking into twelve pieces rather than two, called the transition a percolation, and recorded that it had not measured the exponent. Swept finely, the piece count rises from one to twenty-three and falls back to one — and refining the grid by a factor of fifteen does not move the peak, while an uncorrelated field on the same lattice grows by a factor of twelve.
The ranking is not an order
The previous rung showed that a weighting can make almost any projection best. Remove the weights entirely, let each of the seven criteria vote once, and the answer is worse: over the whole sphere Mercator beats the sinusoidal, the sinusoidal beats Eckert IV, and Eckert IV beats Mercator — four such circles, every margin four to three, with a Condorcet winner sitting above them all.
The answer is a set
Eight rungs have produced 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.
The first break is mostly its denominator
Three rungs have fitted the near-optimal set's fracture threshold against region size and read the answer as a statement about the landscape. It is a ratio, and separating it takes one multiplication: the pass's own depth is constant to 12 per cent below twenty degrees of span, and the whole of the threshold's movement there is the denominator — the best score the region admits at all — rising with exponent 0.92.
The nodes were evenly spaced
The previous rung showed that refining an evenly collocated fit improves the solver's report and leaves the map alone. Moving the same number of nodes to the Chebyshev positions — crowded toward the corners, where a conformal map of a polygon is singular — makes the fit settle: 7.030 × 10⁻⁵ at forty-eight nodes and exactly that at every count above it, against an even fit that wanders by 43 per cent and never converges at all.
A tripoint defined three times
A tripoint is very often not a coordinate in any treaty. It is a description — the point where the boundary between A and B meets the boundary between B and C — and each of those boundaries is itself a description. So the point is defined three times, once by each pair, and under one convention throughout the three definitions agree to half a micrometre. Under three they enclose 6.69 square kilometres.
The sheet moved before it was measured
Nine rungs take control points off a map and assume the sheet they came from is the sheet the cartographer drew. Paper shrinks across its grain three times as fast as along it, and on a map whose grain runs along its own axis that shrinkage is EXACTLY a change of standard parallel — one per cent moves the recovered parallel by 0.57 degrees with the residual sitting at the solver's floor.
A map with no graticule
Ten rungs are handed control points, and a great many maps have none. Handed an outline with no labels on it at all, the method still works — and works better: the correspondence between ink and ground is recoverable exactly, because a similarity preserves ratios of arc length, and the margin on clean observations is 1.6 × 10¹⁰ against a graticule's 9.9 × 10⁶. What breaks it is noise, at three parts in a thousand.
The second derivative cannot classify
Seven essays have used a second derivative to measure a size. The one thing a second derivative is classically used to do is say what KIND of thing is at a point, and on a sphere that use fails: the determinant test totals six where the truth is two, its failure is confined to exactly the field it is asked about, and the count that gets it right never differentiates twice.
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.
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.
A tolerance in map units is not a tolerance
A snapping tolerance is a number, and the number is in whatever units the file is in. Five map units on Web Mercator is 4.97 metres of ground at the equator and 0.87 at eighty degrees — so a rule that merges two features three metres apart merges them everywhere below 52.8° north and refuses everywhere above it, in one pass, over one dataset, with nothing recording where the boundary is.
A density that asks for no room at all
Five rungs assume the density is positive everywhere, because the construction divides by it. Every cartogram anybody draws has an ocean, and an ocean is not sparsely populated but empty — 83.7 per cent of the sphere, exactly zero, and the construction returns nothing at all for a third of the probes.
One number changed and the whole map moved
Raise one bump's weight in a density specification, leave every other number identical, and solve again. London's own value is what changed; London moves 0.054 and Delhi moves 0.226 — four times as far, with its own number untouched. The largest displacement anywhere is thirty degrees from the change, and the antipodal band still moves a fifth of the peak.
Named alongside it
The objects these essays reach for when they reach for this one.
VerificationToleranceClosed formOptimisationAspectConventionPurposeRealisationResidualLeast-squaresObjective functionSimilarity transformation