The same thing twice — page 16
Regression is a square completed halfway
A bell in two variables, sliced at a fixed x, is a bell in y — and completing the square in y alone says where it is centred: at ρx, on a line flatter than the ellipse's own axis. That gap is regression to the mean, and the same completion says it runs backwards in time just as well as forwards.
The sine of a figure eight
Walk round a circle and read the height against the distance walked, and the reading is the sine. Do the same on Bernoulli's figure eight and the reading is a new function, with an arc integral that has t⁴ where the circle's has t², a length Gauss found inside an average, two periods instead of one — and exactly the same list of equal divisions that compass and straightedge can draw.
Every function is a tree with two marks
There are n to the n functions from n points to themselves, and n to the n − 2 trees on those points. André Joyal noticed in 1981 that the missing factor of n² is a choice of two points — a head and a tail — and that a function, read the right way, simply is a tree with a head and a tail. The reading turns Cayley's formula into one line and hands over a fact about random trees from the birthday problem.
Wings that cut a chord equally
Take a chord of a circle and its midpoint. Draw any two more chords through the midpoint, join their ends crosswise, and the two crossing lines — the butterfly's wings — cut the first chord at equal distances from the middle. The proof is the inscribed angle and the power of a point working together; move the point off the middle and what survives is a law about reciprocals; replace the circle by any conic and the theorem does not notice.
A total hung in a temple
Put a polygon's corners on a circle, cut it into triangles, and add up the radii of the circles inscribed in the triangles. Cut it a different way and the total is the same — for all fourteen ways of cutting a hexagon, to every digit. The fact was painted on a wooden tablet in a Japanese temple around 1800, and the reason for it is a theorem about one triangle and the distances from its circumcentre to its sides.
Divisors that make every amount
Twelve's divisors — 1, 2, 3, 4, 6, 12 — can be chosen to add to every whole number from one to twenty-eight. Numbers like that are called practical, a test on their primes decides them, and they turn out to be counted like the primes: about 1.336 x / log x of them below x. For practical numbers Goldbach's conjecture and the twin conjecture are theorems.
What homology forgets about a loop
Let the letters of a loop commute and the loop group of a space becomes its first homology group: a loop now records only how often it went round each hole. What is thrown away is exactly the loops that bound a surface. On the figure eight that is nearly everything — of the loops of sixty letters that homology calls nought, about one in 6,700 is a loop that actually shrinks.
The room a projective space needs, read off Pascal's triangle
The projective plane cannot sit in three-dimensional space without crossing itself, and the reason can be written as arithmetic: a polynomial that records how a shape twists, which a room must cancel. For the n-dimensional projective space that polynomial is a row of Pascal's triangle read mod 2, its inverse is another row, and the inverse's last term says how many extra dimensions the room must have — exactly enough, at every power of two.
The quintics that have a formula
No formula solves every equation of degree five, and yet x⁵ − 2 is solved by a fifth root and x⁵ − 5x + 12 by a longer expression of the same kind. A quintic can be solved by radicals exactly when the symmetries of its roots fit inside one group of twenty — the maps x ↦ ax + b on the numbers modulo 5 — and two exact tests on its coefficients say whether they do.
Settling in order settles everywhere at once
A sequence of functions can settle at every point and never settle uniformly — the largest gap stays put while each point escapes it. Dini found the circumstances in which that cannot happen: continuous functions, a continuous limit, every member above the next, and a closed interval. Under those four conditions convergence at each point is convergence everywhere at once, and Weierstrass's iteration for the square root becomes a sequence of polynomials converging uniformly to |x|.
Which vote finds the truth more often
A court that must decide two premises and their conjunction can vote on the premises or on the conclusion, and the two votes sometimes disagree. Suppose there is a right answer and each judge is more often right than wrong. Then the question has an exact answer: for three judges the conclusion vote is more often right when competence is below √½ and the premise vote above it, and in a large court the premise vote wins at any competence — while the conclusion vote turns out to be a built-in standard of proof.
One glove too many
Give some people left gloves and others right ones, and let any group sell the pairs it can make. If the two sides are equal, the core — the splits no group can beat by walking out — is every price at once. If one side has a single glove more, the core is one split: the scarce side takes the whole of every pair and the other side gets nothing, however large the market. The average over orders of arrival barely notices the difference, and the two rules disagree about almost everything a market is.
Chaos on the line between two roots
Newton's method for a quadratic is the one case solved completely: every starting point goes to the nearer root, and the plane splits into two half-planes. Cayley did it in 1879. What his solution also contains is a line on which the method never settles — and a change of variable shows that on that line Newton's method is exactly the doubling map, the simplest chaos there is. Run on the real line for x² + 1, which has no real root to find, it becomes a source of Cauchy-distributed randomness.
Small Mandelbrot sets among the cubics
For most cubics Newton's method finds a root from almost every start. For some it does not: a whole region of starting points falls into a cycle and never finishes. Which cubics are the bad ones is decided by a single starting point — the one critical point that is not a root — and when the cubics are laid out in a plane and coloured by where that point goes, the bad ones form small, exact copies of the Mandelbrot set.
The point nearest in total to three corners
Three towns want one depot with the least total road to all of them. The answer is not the centroid or any of the classical centres: it is the point from which every side of the triangle is seen at 120°, found by building equilateral triangles on the sides. Three straight lines through it have the same length, and that length is the least total. When an angle of the triangle reaches 120°, the answer jumps to that corner — and the same 120° rule shapes soap films and the shortest networks joining many points.
A spanning tree for every graph
Every connected graph has a spanning tree: a set of its edges that joins every point and closes no loop. For a finite graph the proof is a greedy pass over the edges. For an infinite graph the greedy pass has to keep going past the end of every list, and the statement turns out to be exactly as strong as the axiom of choice — Zorn's lemma supplies the tree, and the existence of spanning trees in every graph gives back the whole axiom.
Which way a prime's two squares point
A prime one more than a multiple of four is a sum of two squares in exactly one way, and the two squares make a point on a circle. Draw that point for every such prime and ask which way it faces. It faces every way equally — the angles spread evenly over the sector, which Hecke proved by giving each angle a remainder and copying Dirichlet. Measured over seventy-four thousand primes, they are even more evenly spread than random angles would be.
Two-thirds of a step past the line
Add random numbers between nought and one until the total passes one, and it takes e of them on average. Ask the same about passing any t and the answer is an exact finite sum that settles, within a few units, onto the line 2t + 2/3. The slope is one over the average step. The two-thirds is the interesting part: it is what the one step that crosses the line charges for being chosen by its length, and it is set entirely by how much the steps vary.
The tangent counts zigzags
Arrange the numbers 1 to n so that they go up, down, up, down. There are 1, 1, 2, 5, 16, 61, 272 such arrangements, and those are, multiplied by factorials, the Taylor coefficients of tan x and sec x — the odd lengths from the tangent, the even from the secant. Désiré André proved it in 1879 by splitting a zigzag at its largest number, and the split turns out to be the derivative of the tangent written out term by term.
Seven times half of π, and then not
The area under sin x / x, out to infinity, is π/2. Multiply in sin(x/3)/(x/3) and the area is still π/2; multiply in the waves for 5, 7, 9, 11 and 13 and it is still π/2, exactly. Add the wave for 15 and the area falls short — by about 2.3 × 10⁻¹¹. Nothing about the curves changes at the eighth factor. What changes is that 1/3 + 1/5 + … + 1/15 has just passed 1.
Every premise makes the verdict vote stricter
A court that must find several things true before it finds liability can vote on each of them or on the verdict. With two elements, judges right seven times in ten are enough for either. With five, the verdict vote needs judges right eighty-seven times in a hundred, or a larger court makes it worse — while the premise vote still needs only better than even. And when any one ground is enough instead of all, the two procedures swap their failures.
Every light on, from every light off
In Lights Out, pressing a light toggles it and its neighbours. On a five-by-five board only one pattern in four can be reached from all off — and yet all on is always one of them. The same is true on every board and on every network of lights whatever, provided the influence runs both ways. The proof is a single observation about symmetric matrices over a field with two elements, and it fails, as a three-arrow example shows, the moment influence runs one way.
Signs that make a determinant count
Hall's theorem says whether a board can be covered by dominoes. How many ways it can be covered is a different question, and for a general graph a hopeless one — the count is a permanent, and nobody expects an efficient way to compute permanents. On a flat board it is a determinant. Put a minus sign on the vertical pairs in every second column and the thirty-six coverings of a four-by-four board stop cancelling and add up; the chessboard has 12,988,816. A hole in the board breaks the rule in a way a cut repairs, and on K₃,₃, which cannot be drawn flat, no choice among its 512 signings works at all.
One constant for each shape of top
Feigenbaum's 4.669 is the same for every smooth one-humped map — provided the hump is rounded like a parabola. Make the top flatter, like the graph of x to the fourth, and the doublings crowd together at 7.285; make it sharper, like x to the power 1.25, and they crowd at 3.260. Measured across twenty shapes of top, the constant is a smooth rising curve with 4.669 as one point on it, and the spatial constant falls as it rises.