Concept

Dimension

The number of independent directions in a space, and so the number of coordinates a point in it needs. It is what a basis counts, and it is preserved by every invertible linear map, which is why it can be used to tell spaces apart.

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

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 diagonal of a box, by using the theorem twice. A box 12 by 4 by 3 with the diagonal of its floor drawn, and the diagonal of the box standing on it; the two right triangles share a side and give the sum of three squares.

Two right angles and the diagonal of a box

The theorem applied once gives the diagonal of a floor. Applied again, standing on the first result, it gives the diagonal of the room — and the pattern does not stop at three, which is where a fact about triangles quietly becomes the definition of distance.

geometry · Pythagoras
The tower ℚ ⊂ ℚ(√2) ⊂ ℚ(√2, √3). A tower of field extensions with the degree of each step, beside the multiplication table of the basis.

A tower whose degrees multiply

Treat a field containing another as a vector space over it, and the size of an extension becomes a dimension — one that multiplies along a tower, so that three impossible constructions become arithmetic about which numbers divide which.

algebra · Field extensions
The quaternion multiplication table, from i² = j² = k² = ijk = −1. A four-by-four multiplication table of the quaternion units, with the row giving the left factor, every entry computed from Hamilton's rule, and the pair that differs between the two orders marked.

A multiplication that remembers the order

Four characters — i² = j² = k² = ijk = −1 — define a multiplication in which ab and ba are different numbers. Everything follows from them, including the fact that a rotation of a solid body has two names, and that two full turns are needed to get one of them home.

algebra · Quaternions
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 square's worth of points, on a line. A unit square with a point marked, the decimal places of its two coordinates woven into one number, and that number marked on a line beneath.

A line with as many points as a square

Interleave the decimal places of two numbers and one number comes out; take every other place back and the two return. The square has no more points than the segment, and dimension turns out to be invisible to counting.

logic · Cardinality
A ray through a knotted tube, crossing it 5 times. A closed surface in space — a tube round a trefoil knot — with a point, a ray from it and every crossing of the surface marked; the parity of the count says which side of the surface the point is on.

Two pieces, in every dimension

A closed curve cuts the plane in two. A closed curve in space cuts nothing at all, and it takes a closed surface to do the job — which is the shape of the general theorem, and the reason the word "dimension" means anything.

topology · Jordan curve
Alexander's horned sphere at stage 3. A tree of clasped pairs of horns, 7 of them, each pair's two circles passing once through the other's disc; the horns shrink geometrically and their tips converge.

A ball whose outside is not one

Alexander's sphere separates space into two pieces, exactly as the theorem promises. Its inside is an ordinary ball. Its outside is not, and the obstruction is a tree of clasped horns whose tips never stop.

topology · Jordan curve
An Apollonian gasket, 125 circles in. The Apollonian gasket generated from four mutually tangent circles of curvature −1, 2, 2 and 3, drawn to 4 generations; every curvature in it is a whole number.

Curvatures that stay whole

Four circles touching one another satisfy an equation in their curvatures. Read it as a quadratic and the second solution is the first subtracted from something — so a packing that starts with whole numbers stays whole forever.

geometry · Inversion
A rotation of four-space, and the two angles it turns through. The four by four matrix of the map sending x to p x conjugate q, beside two dials showing the angle it turns through in each of its two invariant planes.

A rotation of four-space takes two of them

One unit quaternion, conjugating, turns three-space about an axis. Two of them, multiplying from the left and the right, turn four-space — and a rotation of four-space has no axis at all, but two independent angles and two planes it spins in.

algebra · Quaternions
The octonion multiplication table, drawn as seven lines. The Fano plane with its seven points labelled by the imaginary octonion units and its seven lines carrying an arrow each, giving the products of every pair.

What is lost at eight

Double the quaternions and division still works, but ab times c and a times bc are no longer the same number. What survives is a weaker law that turns out to be enough for a great deal — and the whole multiplication table fits into a picture of seven lines.

algebra · Quaternions
Four solids with the same counts and every volume. The Reeve tetrahedra at heights 1, 2, 3, 5, drawn in wireframe with a table of their lattice-point counts and volumes. All have four boundary points and none inside; their volumes run from 0.17 to 0.83.

The theorem that has no version in space

A lattice polygon's area is decided completely by two counts of dots. The obvious guess is that a lattice solid's volume is decided by the same two counts in three dimensions, and there is a family of tetrahedra with identical counts and every volume that says otherwise.

discrete · Pick theorem
The flow, reduced to one dimension. A scatter of 2395 points: each successive maximum of the Lorenz trajectory's third coordinate against the one before it. The points lie along a single curve with a sharp peak, which is the one-dimensional map the flow induces.

The flow that is really a map

A trajectory wandering through three dimensions is hard to reason about. Record only the successive maxima of one coordinate and the wandering collapses onto a curve — a map of an interval to itself, with a corner in the middle, which is a thing the theory can handle.

dynamics · Strange attractor
The same modulus, four multipliers, four qualities. 4 linear generators at modulus 1021, drawn as scatters of consecutive pairs and ranked by the spacing of the lines their points fall on. The spacings differ by more than a factor of two.

The test that ranks the generators

Every linear generator's output lies on a family of parallel planes. Which generator is better is decided by how far apart those planes are, and that distance is the length of the shortest whole-number vector the modulus annihilates — a quantity that can be computed exactly rather than estimated by testing.

computation · Pseudorandomness
Every point of a hull, as a mixture of three of 11 points. A scatter of points with its convex hull outlined, and several interior points each shown inside a triangle of three of the scattered points, found by trying every triple.

Three points, however many there are

A point inside the hull of a thousand points is inside the hull of three of them. Any four points split into two groups whose hulls meet. And a family of convex sets, every three of which have a common point, has one common to all — three, in each case, being one more than the dimension.

analysis · Convexity
2 independent rows and 2 independent columns. An array of 3 rows and 4 columns beside its transpose, with the independent rows of each shaded, showing the same count on both.

Counted across and counted down

A rectangular array has a number of independent rows and a number of independent columns. The two are counted in different spaces, from different objects, by computations that share nothing — and they are always the same number, which is why 'rank' is one word.

algebra · Linear maps
2 independent cycles and 3 independent cuts, on 5 edges. A small graph beside its incidence matrix, with the matrix's rank and nullity given and shown to be the number of independent cuts and the number of independent cycles.

The cycles and the cuts

The count that splits a map's source into what dies and what survives has nothing to do with graphs. Apply it to a matrix built from a graph's edges and points and it says that a graph's independent cycles and its independent cuts add to its number of edges — a theorem about drawings, obtained from an array.

algebra · Linear maps
Seven powers of √2 + ∛3 in a space of six. A table of the powers 1 to (√2 + ∛3)⁶ as coordinate vectors over a six-element basis, with the coefficients of the dependency among them: the minimal polynomial x⁶ − 6x⁴ − 6x³ + 12x² − 36x + 1.

Seven powers in a space of six

Is √2 + ∛3 a root of some polynomial with whole-number coefficients? It lives in a field of dimension six, so its first seven powers are seven vectors in a six-dimensional space and must be dependent — and the dependency, solved exactly, is the polynomial. The same count shows every sum, product and quotient of algebraic numbers is algebraic, without ever needing a formula.

algebra · Field extensions
The six regular 4-polytopes, and an alternating sum of 0. A table of the six regular polytopes in four dimensions with their numbers of vertices, edges, faces and cells and the alternating sum, which is zero for each.

Zero in four dimensions

Corners minus edges plus faces is two for every solid. One dimension up, corners minus edges plus faces minus cells is zero for every one of the six regular four-dimensional solids, from the five-cell to the six-hundred-cell, and for every other convex solid in four dimensions. The alternating sum does not break when the dimension rises: it alternates, two in odd dimensions and zero in even ones, because it is measuring a sphere and not a solid.

topology · Euler characteristic
The ground a 1,500-step walk covers. A random walk on a square grid drawn as a path, with every grid square it visited shaded and its start and end marked.

The ground a walk covers

A random walk of a thousand steps visits far fewer than a thousand places: in one dimension about fifty, in the plane about four hundred, in space about six hundred and sixty. The share of steps that land on new ground is exactly the chance of never coming home — so the number that decides whether a walker returns also decides how much of the world it sees.

probability · Random walk
How much of a sphere lies near its equator. Curves of the share of the sphere within ε of the equator against ε, for spheres in 3, 10, 100, 1000 dimensions: a straight line in three dimensions, a near step in a thousand.

A sphere that is nearly all equator

On an ordinary globe, the band within a tenth of the radius of the equator holds a tenth of the surface. On a sphere in a thousand dimensions the same band holds 99.85% of it, and the band of a fifth holds all but about two parts in ten billion. Almost every point of a high-dimensional sphere is near every equator at once — and so any function that cannot change quickly is, over almost all of the sphere, almost constant.

probability · Concentration
The volume of the unit ball and the area of its sphere, dimension by dimension. Unit ball volumes for dimensions 0 to 20, largest at 5 (5.2638); sphere areas largest at 7 (33.0734).

The ball that is largest in five dimensions

A disc of radius one has area π, a ball of radius one volume 4π/3, and in each further dimension the unit ball grows — until five, where its volume is 5.264, after which it shrinks towards nothing. The recursion that shows it is the ring dissection of the disc, done one dimension at a time, and the shrinking is not the ball getting small: it is almost all of a high-dimensional cube lying outside the ball, and almost all of the ball lying in a thin rind at its surface.

geometry · Circle area
Every magic square of order three is a point in a space of three. Basis J, U = (1,-1,0,-1,0,1,0,1,-1), V = (0,-1,1,1,0,-1,-1,1,0); Lo Shu = 5J − 3U + V; dimension of the order-3 magic space 3.

The magic squares are a space

A magic square is a grid whose rows, columns and diagonals share one sum. The conditions are linear, so the squares form a space: three-dimensional for order three, eight-dimensional for order four, n² − 2n in general. Inside the space of order three the eight classical squares are eight points with coordinates ±1 and ±3. Of the 880 squares of order four, 640 are singular matrices, and the search finds the reason: a symmetry of the rows and columns that carries every number to the one it adds to seventeen with.

algebra · Linear maps
A ball counted slice by slice. Ball of radius 7.5: slices 0:177, 1:177, 2:169, 3:145, 4:129, 5:97, 6:69, 7:21; total 1791, volume 1767.146.

The dots a ball catches

Count the lattice points inside a ball and compare with its volume. In five dimensions the error is about the size of one spherical shell, and that is a theorem; in four a logarithm sneaks in; in three and two the true size of the error is unknown. The difficulty runs backwards because the arithmetic of sums of squares is most erratic when there are fewest squares to add.

discrete · Pick theorem
What junctions save in space. tetrahedron SMT/MST 0.81305; 12-point helix 0.79472.

A chain of tetrahedra saves more

In the plane, junctions never seem to shorten a network of roads by more than the equilateral triangle's 13.4%. In space the regular tetrahedron allows 18.7%, and the obvious guess — that it is the worst case, as the triangle is in the plane — is wrong. Points spaced along a chain of tetrahedra glued face to face do better with every point added: 20.5% at twelve, 21.4% at sixty, and about 21.6% in the limit. Random points come nowhere near, and a search that only goes downhill does not find the chain.

geometry · Triangle centres

Named alongside it

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

BasisSphereCounterexampleKernelRankCounting two waysExhaustive searchHomeomorphismHypercubeMatrixPolytopeQuaternion

All concepts