Concept

Projection

A map that drops a dimension, casting a shape onto a line, a plane or a surface along a chosen family of rays. It is what loses information deliberately, and what survives it is exactly what the projection was chosen to preserve.

Named by 28 essays across 6 fields — each of them below, with the objects they name alongside it.

Four conic sections from one cone. Circle, ellipse, parabola and hyperbola, produced by tilting a single cutting plane further and further.

One cone, four curves

The circle, the ellipse, the parabola and the hyperbola look like four separate objects with four separate equations. They are one object, cut at four angles.

geometry · Conic sections
One point on the sphere for every point of the plane. Lines from the north pole of a sphere through each of its points land on a plane below, matching the sphere minus one point with the whole plane.

A sphere is a plane plus one point

Remove a single point from a sphere and what is left can be flattened out to cover an infinite plane exactly. The construction is one straight line, repeated.

topology · Stereographic projection
The dot product as a shadow. Two vectors and the shadow the first casts on the second. The shadow is 2.425 long and b is 4.123, so the dot product is 10.000.

The dot product is a shadow

Multiply the matching coordinates and add them up. That rule explains nothing, and it hides the fact that the answer is a length — how far one arrow reaches along another, times how long that other one is.

algebra · Inner product
the trefoil. the trefoil, drawn as a closed curve with 3 crossings. At each crossing the strand passing underneath is broken, which is the only information the flat picture carries that the curve alone does not.

Three moves, and what they cannot undo

A knot is a closed loop of string, and two knots are the same if one can be wiggled into the other. Reidemeister reduced all possible wiggling to three local pictures — which is what makes it possible to prove that a knot is knotted.

topology · Knots
Rational points on the unit circle. Lines of rational slope through the left-hand point of a circle, each meeting it again at a rational point.

Every triple, on one circle

Draw a line of rational slope through a single point of a circle. Wherever it comes out is a rational point, and clearing the denominators turns it into a Pythagorean triple — so every triple there is comes from one line through one point.

number · Pythagoras
A whole line arrives at the origin. A linear map whose determinant is zero, drawn before and after. One line of the plane is sent to the origin and the whole plane is sent onto another line; the dimension lost and the dimension kept add to two.

What a map throws away

A linear map redraws the grid, and the determinant measures how much it stretches area. When that measurement comes out zero the map has flattened the plane onto a line — and the question worth asking is not how much was lost but how much survived, because the two always add to what there was.

algebra · Linear maps
The target, multiplied by one harmonic at a time. Four panels, each showing the square wave multiplied by a single sine. The areas cancel exactly except against the harmonics the wave actually contains.

Where the coefficients come from

The recipe for a square wave has a four over pi in front and a one over three on the second term, and the essay that built a square wave from sines used them without saying where they came from. They come from multiplying by one harmonic and taking the area.

analysis · Fourier series
The regular solids of four dimensions. 5-cell, tesseract, 16-cell, 24-cell, each turned in four dimensions and projected to the page; the edges are the pairs of vertices at the shortest distance apart.

Six in four dimensions, and three forever after

The count of regular solids goes five in three dimensions, six in four, and then three in every dimension above — for good. Four dimensions is the last place anything unusual happens, and it happens twice.

geometry · Regular polyhedra
A circle stays a circle, unless it meets the pole. 3 circles on a sphere beside their stereographic images in the plane, which are circles, together with one circle through the projection point whose image is a straight line.

Angles survive and areas do not

Stereographic projection takes every circle on the sphere to a circle or a line, and every crossing angle to itself. It does both exactly, with no approximation anywhere, and it destroys area so thoroughly that a patch near the pole can be a thousand times its neighbour's size.

topology · Stereographic projection
A turn of the sphere, seen from the plane. A square grid in the plane and its image under the map obtained by lifting to the sphere, rotating by 62° about a tilted axis, and coming back down. The lines become arcs of circles and the crossings stay at right angles.

The sphere that complex numbers live on

Add one point to the complex plane and it becomes a sphere. The rotations of that sphere are exactly the maps written as one linear expression divided by another, so a fact about turning a ball is a fact about dividing polynomials.

topology · Stereographic projection
The parabola that proves |a·b| ≤ |a||b|. The squared length of a − t b plotted against t. It is a parabola opening upward whose least value is 7.118; that this is never negative is exactly the Cauchy–Schwarz inequality.

The square that cannot be negative

Cauchy–Schwarz is the load-bearing inequality of the whole subject and is nearly always stated without proof. It is one line away from a fact nobody would argue with, and the line is a parabola with no room to cross the axis.

algebra · Inner product
One subtraction clears a direction. Gram–Schmidt on two planar vectors, in 3 panels: the pair as given, the shadow of the second on the first, and the perpendicular pair that is left when the shadow is removed.

One subtraction clears a direction

A basis is a set of directions to measure along, and most bases are awkward because the directions get in each other's way. Removing one shadow at a time turns any basis into one where every coordinate is a shadow and nothing interferes.

algebra · Inner product
The nearest point of the plane the columns span. A target vector in space, the plane spanned by two columns, the point of that plane nearest the target, and the residual joining them, which meets the plane at a right angle.

The nearest point of a flat thing

More equations than unknowns almost never have a solution. Asking instead for the point of a plane nearest to where the answer should have been turns an unanswerable question into a shadow, and the shadow is what a line of best fit is.

algebra · Inner product
Six points on an ellipse, and the line their opposite sides meet on. A hexagon with its six corners on an ellipse. Its three pairs of opposite sides are extended until they meet, and the three meeting points lie on one straight line. Moving one corner off the ellipse breaks the alignment.

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.

geometry · Conic sections
"There is an x" is a shadow: x² + ax + 1 = 0 has a solution exactly when |a| ≥ 2. A grid with a horizontal and x vertical, marking the cells the curve x squared plus a x plus one equals zero passes through; beneath it, a strip marking the columns that contain a mark, which are exactly those with a at least two in size.

A quantifier is a shadow

'There is an x such that …' asks whether a column of a grid contains a mark — which is the same as asking whether a shape casts a shadow on the axis below it. Over the real numbers every such shadow can be described without the quantifier, by polynomial inequalities: 'x² + ax + 1 = 0 has a solution' is just a² ≥ 4. Over the whole numbers the same kind of shadow can carve out the primes, and any set a computer can list.

logic · Quantifiers
Bands of a sphere and of its cylinder, cut by the same planes. A unit sphere inside its cylinder with 3 horizontal bands; each sphere band has area 1.885, 1.885, 1.885, equal to the cylinder band of the same height.

A band of a sphere is a band of its cylinder

Cut a sphere with two parallel planes and the band between them has exactly the area of the band the same planes cut from the cylinder wrapped round the sphere — whatever the band's latitude. Near the equator the sphere's band is wide and nearly upright; near a pole it is narrow and nearly flat; and the two effects cancel exactly. Archimedes proved it, wanted it on his tomb, and it gives the area of the sphere, the only honest way to pick a random point on it, and a map on which no country is the wrong size.

geometry · Circle area
A trefoil knot made of six straight sticks. Hexagon with corners (6, 2, 3), (7, 7, 10), (1, 6, 4), (2, 1, 7), (8, 10, 5), (0, 9, 9); three crossings from above, determinant 3, Alexander polynomial t² − t + 1.

Six sticks tie a trefoil, and five cannot

Build a knot from straight sticks joined end to end and ask for the fewest. A trefoil takes six, and the six corners can be whole-number points in a box ten units wide. Five sticks can cross one another five times in a picture, as often as a cinquefoil needs, and still tie nothing — the five crossings always twist three one way and two the other. The fewest sticks is a measure of how knotted a knot is that no diagram shows directly.

topology · Knots
How often a closed random polygon is certainly knotted, by length. 10: 0.8% (mean crossings 2.8); 20: 1.5% (mean crossings 7.9); 40: 6.3% (mean crossings 21.2); 60: 10.5% (mean crossings 35.1); 80: 20.8% (mean crossings 51.3); 100: 22.0% (mean crossings 66.9); 130: 32.3% (mean crossings 94.9); 160: 45.7% (mean crossings 122.6); 200: 47.0% (mean crossings 154.5); 250: 51.7% (mean crossings 205.5).

Almost every long loop is knotted

Close a random walk into a loop and ask whether it is knotted. With ten steps almost never; with a hundred, more than one time in five it can be proved knotted by a single number; with two hundred and fifty, more than half. The chance of staying unknotted falls exponentially with length — Frisch, Wasserman and Delbrück guessed it for polymer rings around 1961, and it was proved in 1988 — because a knot needs only one small tangle somewhere, and a long loop has room for many.

topology · Knots
Four stages of the four-corner Cantor dust. Four panels showing stages 1 to 4 of the four-corner Cantor set: 4, 16, 64 and 256 squares kept at the corners.

A dust that almost every line misses

Keep the four corner squares of a square, then the four corners of each of those, and so on. What is left has a length, in the sense that measures length, and yet almost every straight line misses it entirely. Stage by stage the chance that a random line hits the dust falls — to 48% by the eighth stage — and how fast it falls to nothing is one of the few questions about a simple picture that is still open.

analysis · Arc length
Every slice of a tilted bell is a bell, centred off the axis. Contour ellipses of a two-variable bell with correlation 0.6, five vertical slices drawn as bells, their centres on the line y = 0.6x, and the ellipses' long axis on the diagonal y = x.

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.

algebra · Completing the square
An astrolabe is a stereographic projection in brass. Latitude 52°: 16 engraved curves, worst departure from a circle 8.88e-15; altitude-circle formulas within 2.2e-16; Cancer radius 0.6564, Capricorn 1.5235 of the equator's.

An instrument that computes with circles

An astrolabe is a stereographic projection of the sky cut in brass. Because the projection sends circles to circles, every line on it can be drawn with compasses, and turning the star map over the plate is a rotation that answers questions in spherical astronomy without a single calculation. Of the lines medieval makers engraved, one family is not a circle on the sphere — and the arcs they drew for it miss the truth by a third of a millimetre.

topology · Stereographic projection
A cube passes through a hole in a smaller cube. Cube passage: λ = 1.060660172 (3√2/4 = 1.060660172); outer hexagon, inner square.

A cube through a hole in a cube

Prince Rupert of the Rhine bet that a hole could be cut through a cube large enough for an equal cube to pass through it, and won. The trick is to look at the cube along a direction near its long diagonal, where its shadow is a hexagon wide enough to hold a square face with room to spare: a cube 6% larger can pass. All five Platonic solids turn out to have such a passage, found by searching over the directions from which a solid is seen — and in 2025 a solid was found that has none.

geometry · Regular polyhedra
The correlations that reverse a coefficient. rho = 0.6: wedge shares 0.2051 and 0.2051 of the ellipse; arcsin(0.6)/pi = 0.2048.

Holding one still turns the other over

A quantity can rise with an outcome and still predict it downwards once a second quantity is held fixed. Completing the square in two predictors says exactly when: the pair of correlations has to fall in a wedge whose angle is arcsin of the predictors' own correlation. Averaged over every possible correlation matrix the chance is exactly 1/4 − 1/π², about one coefficient in seven; two coefficients never reverse together, and with two dozen predictors almost two in five do.

algebra · Completing the square
Shrinking beats the nearest point at every true mean. p=3: ratio at |θ|²/p = 0, 1, 5: 0.667, 0.863, 0.976; p=5: ratio at |θ|²/p = 0, 1, 5: 0.400, 0.732, 0.931; p=10: ratio at |θ|²/p = 0, 1, 5: 0.200, 0.621, 0.886; p=25: ratio at |θ|²/p = 0, 1, 5: 0.080, 0.549, 0.855

The nearest point is not the best guess

Measure ten unrelated quantities once each, with noise, and report the measurements. Nothing seems better. Yet pulling all ten towards nought by an amount the data choose gives a smaller total error whatever the true values are — in three dimensions or more, and never in one or two. The reason is a right angle: in many dimensions noise is nearly perpendicular to the truth, so a measurement is always too long, and the best correction is the shadow of the truth on it.

algebra · Inner product
Two random loops and the crossings between them. 56 crossings, 25 positive, 31 negative, linking number -3.

Many crossings and a small linking number

Two random loops of a thousand steps, tangled round a common centre, cross each other about a thousand times in any picture of them. The linking number is half the signed count of those crossings — and it is typically about three. The signs cancel in nearby pairs, wherever one loop dips under the other and comes back, and what survives grows roughly as the fourth root of the length. Shut the same loops in a box and the cancellation stops: the crossings grow as n², and the linking number as n.

topology · Linking number
Which powers can reach x. Square-integral distance from x to the span of chosen powers, by count of powers: even 5.607e-9; primes 1.165e-4; squares 9.053e-2; powers 3.497e-2; limit for squares 0.090525.

Which powers of x are enough

Every continuous function on an interval is nearly a polynomial, and it seems that all the powers of x should be needed for that. They are not. The even powers will do, and so will the primes, though the primes run out at a rate of one number in ln n. The squares will not: however many are combined, they stay 0.0905 away from x itself. The dividing line, found by Müntz in 1914, is whether the reciprocals of the powers add up to infinity.

analysis · Harmonic series
Four walls that stop every line through a square. Opaque barriers for the unit square, all verified over 1440 directions: three sides 3.00000; two diagonals 2.82843; Steiner tree on all four 2.73205; three corners and a stub 2.63896.

The shortest wall that stops every line

A straight cable runs somewhere under a square field, and a trench has to find it for certain. Three sides of the field will do, at length 3. Two diagonals cost 2.83, and a Steiner tree 2.73. The best trench known has length 2.6390 and comes in two pieces that do not touch. Averaging over lines proves nothing shorter than 2 can work, and in over a century the gap between the two numbers has hardly moved.

analysis · Arc length
Six lines all at one angle. The six diagonals of the icosahedron: every pair meets at cosine 0.447214, an angle of 63.43 degrees.

Six lines all at one angle

Take the six long diagonals of an icosahedron: every pair meets at the same angle. Squaring each line into the matrix that projects onto it removes every sign and leaves a table no vector can kill, so at most d(d + 1)/2 lines can do this in d dimensions. The bound is reached at 2, 3, 7 and 23, and at no other dimension anyone can find.

algebra · Inner product

Named alongside it

The objects these essays reach for when they reach for this one.

Inner productOrthogonalityCrossing numberDot productStereographic projectionBasisConformalConicDimensionDiscriminantInvariantKnot

All concepts