The thread: Computed, not quoted — page 8
A partition under a directed cost has two versions
Dividing a surface among several sites is one question when the cost is a distance and two questions when it is not. Under a steady flow at 0.45 of a vehicle's own speed, the division by who can reach a place soonest and the division by which place can be reached soonest disagree about 50.7 per cent of the sphere — while no site's own share of the world moves by more than 3.87 points.
The weights are a guess the solve believes
Choosing what to hold fixed is a decision inside the least-squares problem that no residual can see. There is a second, made more often and thought about less. Every observation enters with a weight nobody measured, the weights move the coordinates by a factor of 1.8, and the standard check on them can be made to pass by a scaling that moves nothing at all.
A deflection is the slope of a mass
One arcsecond of deflection of the vertical is 4.85 millimetres of geoid slope in a kilometre, and that exact relation produces no deflection anywhere by itself, because a deflection is the gradient of a geoid and a geoid model is cited rather than computed. State a mass instead, and every quantity is a closed form: a salt dome five kilometres across bends the plumb line by 2.21 arcseconds.
Water runs downhill on the ground, not on the page
A drainage network is the set of steepest-descent trajectories of a field, so it is built entirely out of directions. A conformal map preserves those directions exactly and therefore preserves the whole network; an equal-area map does not, and sends a route up to 892 kilometres away from where the water actually goes.
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.
A projection defined by a table has an interpolation in it
One member of this library has no formula: Robinson set nineteen pairs of numbers by eye and the table is the definition. Three published interpolations of it draw graticules that differ by four parts in a thousand of the map's span and report angular deformations that differ by 8.4 degrees.
The address is a curve through the sphere
A database does not fetch a set of cells, it reads ranges of identifiers — so the cost of a query is how many runs its cells form, not how many cells it needs. Hilbert order wins that measurement and loses the one usually quoted for it: its neighbouring cells are further apart in identifier than row-major's, on average and at worst.
Four cities that cannot be drawn to scale
Every impossibility in this field so far has been about a surface. This one is about four numbers: London, New York, Tokyo and Sydney have six distances between them, and no four dots on any sheet of paper have those six separations. The test is a determinant Cayley wrote down in 1841, and it comes out −3.34 × 10²³ where zero is required.
The shortest route between two coasts
A shortest path is usually asked for between two points. Between two regions the answer is attained at a pair of boundary points, and which pair is not the pair any page makes look nearest — a cylindrical map picks a pair 2,135 kilometres from the right one across the Atlantic, and 1,716 kilometres wrong between Chile and New Zealand, where its route is 22.5 per cent long.
A chain of transformations does not close
Two datum transformations applied one after the other are not the sum of their fourteen published numbers. The gap is seven millimetres in Britain, doing the two in the other order moves the answer twenty, and the rotation matrix everybody prints is not a rotation.
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
Every verdict handed out about a projection's claimed property rests on a tolerance chosen once, long ago, 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
Choosing a polyhedral map means choosing 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
A determinant proves no flat picture of four places is exact and leaves the size of the failure where nobody can read it. 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
A route is handed back as a curve, 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
One thing was left owed: the fracture threshold falls faster than the argument predicts, and the difference was supposed to be the level set's blindness to the height of the pass. Measured directly, the pass between the two deepest basins falls as the −1.34 power at R-squared 0.986 — nearer the predicted −1 than the level set's −1.57 on the same projection, and not onto it. It is not the pass that breaks the set first, and at five of six sizes the second basin is the first one's mirror twin.
The corner is not at the midpoint
An earlier measurement took 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.