The same thing twice — page 8
Moving a map across a product
The transpose looks like a fact about a matrix: reflect its entries in the diagonal. It is a fact about the inner product. Measure lengths and angles differently and the map that slides to the other side of the product is a different matrix, and a matrix that was symmetric stops being so.
A denominator that reaches past the radius
The Taylor series of ln(1 + x) is useless beyond x = 1 however many terms it is given. The same coefficients spent on a numerator and a denominator converge at x = 3, and at x = 100, because a polynomial cannot imitate a singularity and a quotient of two polynomials can.
A plane disguised as an arrow
The cross product of two arrows is an arrow perpendicular to both, as long as the area of their parallelogram. Reflect everything in a mirror and it points the wrong way, because it was never an arrow: it is a plane, written as the one direction a plane in three dimensions leaves over.
Worth more for being seen first
Moving first sounds like a disadvantage, since the other side gets to see the move and answer it. When the move is a mixture that is announced and believed, it is never a disadvantage, it is worth exactly nothing in a game of pure conflict, and in other games it is worth more than any equilibrium — sometimes by announcing an action that would never be played in secret.
Equal area on a sphere, without a rectangle
On a sphere, two polygons of the same area can still be cut into each other, exactly as in the plane. Almost nothing in the plane proof survives the move: a sphere has no rectangles, no parallel strips and no similar triangles of different sizes. What carries the theorem instead is a quadrilateral with two right angles, built from a triangle's midline.
A remainder read two digits at a time
Lucas' theorem reads a binomial coefficient's remainder on division by a prime off its digits one at a time. On division by the prime's square the same reading is wrong at four odd entries in ten. What replaces it still reads digits — in overlapping pairs, with the prime taken out first and a sign that the carries decide.
Averaging down the triangle
Change one word in the rule that builds Pascal's triangle — take a share of each entry above instead of adding them — and the triangle stops counting and starts averaging. The same rule then draws smooth curves from polygons and approximates every continuous function by polynomials, at a rate that no amount of smoothness can improve.
A dimension for every rate of crowding
Spread a unit of mass over an interval by splitting it unevenly, again and again, and the result covers the whole interval while crowding almost all of its weight onto a set of smaller dimension. Every rate of crowding picks out its own set of points with its own dimension, and the whole family is read off one curve.
The room a jagged graph takes up
The graph of a continuous function is a curve, and a curve ought to have dimension one. Build the function by raising midpoints — by an amount that shrinks more slowly than the intervals do — and its graph needs more boxes than any line, at a rate fixed by one ratio. A random path built the same way needs exactly as many.
Six points on a conic, and the line they share
Put six points on an ellipse, join them into a hexagon, and extend each pair of opposite sides until they meet. The three meeting points always lie on one straight line. The statement uses no length, no angle and no focus — which is why it holds for every conic at once, and why a straightedge alone can draw the curve through any five points.
Equal diagonals in a curved quadrilateral
Two ellipses and two hyperbolas sharing the same foci cut out a four-sided region with curved sides and no symmetry to speak of. Its two diagonals are nevertheless exactly equal. The reason is a stretch that carries one ellipse onto the other and moves every pair of points so that crossed distances match — a property only confocal curves have.
Every derivation is a term
Write a variable for each assumption, an abstraction where one is discharged, and an application where an implication is used, and a natural-deduction derivation becomes a term. The formula it proves is the term's type, and checking the one is checking the other. A detour in the proof — a lemma introduced and at once used — is a term that simplifies, and simplifying it is removing the detour.
The arcs a line crosses on its way to a number
Draw a semicircle over every pair of neighbouring fractions and the half-plane above the number line is cut into curved triangles that never overlap. A straight line dropped towards any number crosses those arcs one after another, and the arcs it crosses, and the side it leaves each triangle by, are exactly the steps of the Stern–Brocot descent towards that number.
The function that sends fractions to binary
The Stern–Brocot tree and the tree of binary fractions have exactly the same shape, so there is a function that sends each fraction to the binary fraction in the same position. It is continuous and increasing, it turns every quadratic irrational into an ordinary fraction, and it does all of its rising on a set of numbers so thin that at almost every point its slope is nought.
Covering a surface multiplies its count
A covering of a closed surface is a permutation of the sheets for each edge of the surface's one face — with one condition that a covering of a graph never had to meet. When the condition holds, the cells of the cover can be counted directly, and the count is the base's count times the number of sheets. That multiplication decides which surfaces can cover which, before any cover is built.