The thread: Measured, not named — page 8
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.
An edge has no order of convergence
On a smooth field the three resampling kernels converge at orders 1, 2 and 3 and the choice is obvious. Across a discontinuity they converge at 0.78, 0.58 and 0.60 — within a factor of 1.4 of each other, in an order that puts nearest-neighbour first, and a real raster is mostly edges.
The size at which the second derivative arrives
Six essays have measured a projection's second derivative at points, over regions and under transformations, and none of them says at what size it stops being a curiosity. The answer needs a figure with an extent rather than a point, and it is smaller than anybody drawing a national map would guess: the indicatrix alone places a shape to one part in a thousand out to thirteen kilometres.
The blunder the network cannot see
A least-squares adjustment has no concept of a mistake. The smallest blunder its test will find in the least-checked leg of a braced quadrilateral is 87 millimetres, and by the time it fires a station has moved by nearly ten times the accuracy the same adjustment reports for it.
The tolerance that decides the verdict
Eight rungs of this ladder hand out verdicts, and every one rests on a tolerance chosen once, in the site's second phase, at sixty times a measured noise floor. Swept, it decides nothing: the population is bimodal, the tolerance sits in a gap 238,000 times wide for conformality and 646 million times wide for equal area, and the verdict with the least room is a passing one whose margin is the arithmetic's rather than the map's.
The gnomonic crosses a seam without a corner
Eight rungs choose a solid, a face map and where to cut. This one is about a seam the net does not cut, where two faces stay joined and carry two different maps — and the expectation was a corner in every feature crossing one. At the midpoint of the edge — which is where every crossing here is taken, and which turns out to be the one place on it a face's own mirror forces the corner to vanish — the gnomonic gives none at any obliquity on any Platonic solid, and the equal-area face map gives one of up to 0.39 degrees.
How wrong a flat picture has to be
The rung below proves no flat picture of four places is exact and leaves the size of the failure to a determinant nobody can read. 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.
A crossing is a chain of decisions
Eleven rungs hand back a curve and stop, and nothing anybody flies is decided once. Re-planning is worth exactly nothing when the forecast turns out right — a sub-path of an optimal path is optimal, and the chain is the plan. When it turns out wrong it recovers 19 per cent of the cost at two decisions and 83 at eighteen, and never all of it.
The height of the pass between two basins
The previous rung recorded a shortfall: the fracture threshold falls as the −1.33 power where the argument predicts −1, and the difference was supposed to be the height of the pass. It is not. Measuring the pass directly gives −1.60, which is further from the prediction, and the two basins turn out to be exact symmetric copies with nothing to decompose.
The corner is not at the midpoint
The rung below measured the corner a feature gets crossing a polyhedral seam, and found none at all under the gnomonic face map. It crossed at the edge's own midpoint every time — the one point on the edge where a face's own mirror symmetry forces the corner to vanish. Two fifths of the way to the vertex the gnomonic gives 20.15°, the equal-area map 7.28° and the conformal map under a degree, which reverses the ordering entirely.
Further north on the grid is not further north
Thirteen rungs price a grid's origin, scale, units and zones, and every one treats a coordinate as a position. It is also an ordering, and the two disagree: a parallel climbs 4,379 metres of northing on its way to the edge of a UTM zone, so two places 4.4 kilometres apart in latitude can be listed in the wrong order — and the share of pairs it happens to is the convergence, in a different unit.
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.
The difference of two coordinates
Three essays give a single coordinate a width. Every practical use of one is a difference of two — a distance, a bearing, a movement, an area — and the width of a difference is not the two widths combined, because the errors are not independent. Far from its datum a one-leg baseline is six times more certain than the positions it joins.
A conformal map of a body with three axes
This site built an equal-area map of a triaxial body and wrote down what it could not do: the conformal one, which needs an isothermal coordinate that a surface with no axis of revolution was said not to have. It has one, Jacobi found it in 1839 for a different reason, and it takes two one-dimensional integrals.
A tilted view has no zoom level
Every essay about the screen so far assumes the map lies flat on it, which was true until about 2015. Pitch the camera sixty degrees and one frame asks for 3.6 zoom levels at once, a square tile covers ground four and a half times deeper than it is wide, and the pyramid has one integer per tile to answer with.
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.
One edge is not an edge
The three resampling kernels were measured across a discontinuity and came out at 0.78, 0.58 and 0.60 — one straight edge at 27° to the graticule. Across thirteen edges the same kernels span 0.19 to 0.87, the ranking between them reverses, and for an edge lying along a parallel the error does not fall with refinement at all.
The nearest equal-area map to an impossible request
Every number in the previous rung is inside the conformal achievable set, because Liouville's is the conformal condition. The equal-area set is one equation on two functions and never refuses: the same four requests are met to nine parts in a billion, and charged for in angle instead.
The line a height is measured along
Five rungs have argued about the surface a height is measured *from* and every one of them took the line it is measured *along* to be straight and known. It is neither: through a stated buried mass a plumb line arrives 47 millimetres from the point below the summit, and the height it gives depends on the density of rock nobody has seen — 342 millimetres of spread at 4,000 metres and 1.37 metres at 8,000.
A rotation is not absorbed the way a shift is
The previous rung expected a datum's rotations 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.
An average of ellipses is not an ellipse
Rung three integrates distortion over a region and finds the weighting is somebody's opinion. It never asked what was being averaged. An indicatrix is a positive-definite matrix, matrices form a cone rather than a vector space, and the arithmetic average of an equal-area map's indicatrices comes back inflating area by up to 11 per cent.
The network's answer is decided before it is measured
Nine rungs measure what an adjustment does with observations. Every quantity a specification is written about — the error ellipses, the redundancy numbers, the smallest detectable blunder — is a function of the geometry and the weights alone, and does not contain an observed value anywhere. Four layouts of five stations with the same ten distances differ by a factor of 20.9 in their worst coordinate.
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 slope of a field that was measured
Three rungs differentiate a formula, which is what makes the projection the only thing under test. A real field is a grid of numbers with an error on each of them, and differencing such a thing divides the noise by the spacing — so a finer grid gives a worse slope, there is a best spacing, and it is the cube root of the noise.