Concept

Bravais lattice — where it appears

One of the fourteen lattice types of three-dimensional space, classified by the symmetry a lattice's metric admits. The usual plate of fourteen boxes is the answer with the argument removed; the argument is one question asked of twenty-five candidates.

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

P2₁/c, in the two diagrams the Tables print. Space group P2₁/c, number 14, projected down c on a primitive monoclinic cell. The symmetry elements drawn: 2 2₁ screw axes, 2 glide planes, 4 inversion centres. 4 general positions, the orbit of one point, each labelled with its height along c and marked with a comma where the operation that produced it reversed handedness.

The step a flat surface has no room for

Seventeen becomes two hundred and thirty, and the factor of thirteen is not a matter of having more directions to work in. It comes from an operation the plane cannot hold — a translation that no choice of origin will remove.

space-groups · Space groups
The five plane lattices. Every periodic pattern in the plane repeats on one of five lattices. The classification is by which point symmetries the lattice itself admits, and the five are exhaustive — a sixth would need a rotation order no lattice can carry.

Five lattices, and no others

A repeating grid can be oblique, rectangular, centred, square or hexagonal. That is the complete list for the plane, and the argument that closes it is a page long.

lattices · Lattice
The 48 point symmetries of a cubic lattice. Every operation that maps a cubic lattice onto itself, built as the integer matrices preserving that system's metric: 48 of them, of which 24 are proper rotations and 24 reverse handedness. The orders occurring among the rotations are 1, 2, 3, 4 — the same list the plane gives, so the crystallographic restriction does not change in three dimensions, and there is no six anywhere. The 13 rotation axes are counted from the rotations they carry rather than drawn from memory, and every rotation but the identity is checked to belong to exactly one of them.

The restriction in three dimensions

Space is roomier than the plane in every other respect, so the natural expectation is that it permits more rotation orders. It permits exactly the same five, and seeing why is more interesting than the result.

restriction · Restriction
The fourteen Bravais lattices. All fourteen lattices: triclinic P, with 2 symmetries; monoclinic P, with 4 symmetries; monoclinic C, with 4 symmetries; orthorhombic P, with 8 symmetries; orthorhombic C, with 8 symmetries; orthorhombic I, with 8 symmetries; orthorhombic F, with 8 symmetries; tetragonal P, with 16 symmetries; tetragonal I, with 16 symmetries; rhombohedral P, with 12 symmetries; hexagonal P, with 24 symmetries; cubic P, with 48 symmetries; cubic I, with 48 symmetries; cubic F, with 48 symmetries. The corner points are the conventional cell; the points in the second colour are the centring translations, drawn at every position inside the cell rather than one per face. The cell shapes are the picture's, chosen so no two systems look alike; only the angles a system is defined by mean anything.

Twenty-five cells, and fourteen lattices

The usual picture of the fourteen Bravais lattices is a plate of fourteen boxes, which is the answer with the argument removed. The argument is one question asked of twenty-five candidates, and the question has a computable answer.

lattices · The fourteen Bravais lattices
Six integers that do not depend on the description. The same monoclinic lattice written in 4 different bases, each obtained from the last by an integer matrix of determinant one, and each reduced by Niggli's algorithm. Every one of them gives the same six integers — the squared lengths and twice the dot products of the reduced basis. That is what makes the reduced form a fingerprint of the lattice: two cells with no number in common are the same lattice exactly when their reduced forms agree, and the comparison has no tolerance in it.

The cell that settles the argument

Two determinations of one compound can report cells that share no number and describe the same lattice. Reduction is the procedure that decides — six integers that depend on the lattice and not on anybody's choice of axes, and that agree exactly when the lattices do.

lattices · Lattice
Five shapes, and a lattice in space has no other. The five combinatorial types a Wigner–Seitz cell can have in three dimensions — cube, hexagonal prism, rhombic dodecahedron, elongated dodecahedron, truncated octahedron — each drawn from a lattice that produces it. Fedorov proved in 1885 that there are no others, and that fourteen faces is the most any of them has, which is Minkowski's bound of 2(2ⁿ − 1) in three dimensions. Each solid here is cut out by the perpendicular bisectors of nearby lattice vectors and its volume checked against the primitive cell's, which is what catches a face that failed to appear.

Five parallelohedra, and no others

The cell that needs no basis and no convention has, in three dimensions, exactly five shapes. The fourteen Bravais lattices produce all five between them — and which one a lattice gives is not decided by which of the fourteen it is.

lattices · Wigner–Seitz cells
Sublattices of index n, in space. How many sublattices a three-dimensional lattice has at each index, beside the plane's answer, with the Hermite enumeration and the coefficient of ζ(s)ζ(s−1)ζ(s−2) in separate columns. The two are computed by routines sharing no code, and a row where they disagreed would be a failure rather than a result. The last column counts the ones that survive every operation of the cubic group, and it is almost always empty.

The three that stay cubic

A lattice in space has far more sublattices than one in the plane — 651 of index sixteen against 31 — and almost none of them keeps the symmetry it came from. The ones that do exist at indices m³, twice m³ and four times m³, there is exactly one at each, and they are the primitive, face-centred and body-centred cubic lattices, arrived at by asking which sublattices keep a symmetry rather than by enumerating centrings.

lattices · Sublattices
One change of basis turns a Gram into its own adjugate. For each Gram matrix: the matrix after the basis change by a right-angle rotation, and the adjugate. They are equal, always — and the adjugate is the determinant times the inverse, which is the dual lattice's Gram. So the dual is the same lattice on a rotated basis, scaled by one over the determinant. Five rows are the named plane lattice types and the rest have entries picked at random, because the claim is an identity in integers and not a property of the five.

Every plane lattice is its own dual

The dual of a lattice has the inverse Gram matrix, and in two dimensions the inverse is the adjugate over the determinant — which is what one particular change of basis does to a Gram. So a plane lattice's dual is the lattice itself, turned through a right angle and scaled, for every lattice with no exception. In three dimensions it is a condition, and the face-centred and body-centred cubic lattices are duals of each other rather than of themselves.

lattices · Lattice
Perfection is a rank, and most lattices do not reach it. For each lattice, the rank of the matrices vvᵀ built from its shortest vectors, against the dimension of the space of symmetric matrices those live in. Reaching it means the shortest vectors pin the form down completely: no deformation keeps every one of them at its length. Falling short means there is a direction left to move in, and the lattice is not a local maximum of density.

One perfect form in space

Which lattice packs spheres most densely is a question about a maximum over a continuum, and Voronoi turned it into a rank calculation and a sign check. A lattice is a local maximum exactly when its shortest vectors pin its shape down completely and its inverse can be written over them with positive coefficients. Searching every reduced integer form of minimum two finds one such lattice in the plane and one in space.

lattices · Packing
How many similar sublattices the cubic lattice has at each scale. Every integer matrix satisfying MᵀM = α²I, counted up to the lattice's own point group by marking orbits rather than dividing. The even scales are drawn apart because they are the ones that give nothing new: a factor of two in the scale never produces a shape the smaller scale did not already have.

The shapes a lattice in space can thin to

In the plane, which indices admit a sublattice of the same shape is a question about which integers a quadratic form represents, and Fermat answered it. In space the question collapses: taking determinants shows the index is always a perfect cube, so there is nothing to represent. What is left is how many there are at each cube — and for a hexagonal lattice, whether there are any at all depends on one number.

lattices · Sublattices
Thirty-two classes, from fourteen Gram matrices. The five hundred and ten subgroups sorted by how many operations of each kind they contain — a determinant and a trace decide which of the ten kinds a matrix is. Thirty-two answers come out, and they are the thirty-two crystal classes: matched against the construction elsewhere in this collection by signature rather than by name, since nothing here names a point group.

Thirty-two from fourteen matrices

Write the fourteen Bravais lattices as Gram matrices, ask each one which integer matrices preserve it, and take every subgroup of every answer: five hundred and ten of them. Sort those by how many operations of each kind they contain — which a determinant and a trace decide — and thirty-two answers come out. They are the crystal classes, from a construction in which no point group is ever named.

point-groups · The fourteen Bravais lattices
Twenty-two halvings the fourteen lattices permit. Every lattice has exactly seven subgroups of index two, whatever its shape. The third column is how many of the seven the lattice's own group carries onto themselves, and the fourth is how many of those survive as distinct types once a change of basis within the type is allowed to identify them. The running total ends at twenty-two, which with the fourteen grey lattices is the thirty-six magnetic Bravais lattices — and the row that ends at zero is the face-centred cubic lattice.

The halving a lattice will not permit

Admit time reversal and a lattice splits into points that leave the moments alone and points that reverse them. The second set is a coset of a subgroup of index two, and every lattice has exactly seven of those, whatever its shape. What differs is how many of the seven the lattice's own symmetry survives — and the face-centred cubic lattice survives none of them.

lattices · Magnetic
Seventy-three arithmetic classes, from fourteen groups. Every subgroup of every lattice's own group, split by whether the subgroup's own Bravais group is that lattice's. The ones that are not belong to a lower lattice and are counted there, which is what stops the same class being counted twice. The running total ends at seventy-three, and no conjugacy in GL(3, ℤ) was ever decided.

Seventy-three, without a search

The unit a space group is built from is a point group together with the lattice it acts on, and there are seventy-three of them. Getting there looks like it needs conjugacy in GL(3,ℤ), which is a search this collection tried and abandoned. It does not: every finite group of integer matrices carries a canonical larger group that says which lattice it belongs to, and once that is computed the search has nothing left to do.

point-groups · The fourteen Bravais lattices
Seven indices in 40, and one lattice at each. For every index to 40, how many sublattices of a cubic lattice there are and how many of them the full cubic point group carries to itself. The first number runs into the hundreds; the second is nought at almost every index and one at 1, 2, 4, 8, 16, 27, 32. A cubic point group is forty-eight conditions on a sublattice, and forty-eight conditions leave very little. The richest point group in three dimensions has the poorest arithmetic of copies, and the two are the same fact.

The richest group has the poorest arithmetic

A plane group with no symmetry has seven hundred and sixty-two sublattices to grow by; one with a six-fold axis and mirrors has eight. Take the trend to its end in space and a cubic group has six to index forty — one at every cube, one at twice a cube, one at four times a cube, and nothing anywhere else. Every operation of a point group is a condition, and forty-eight conditions leave almost nothing.

space-groups · Isomorphic subgroups
Every finite normaliser of a lattice's group, found whole. The fourteen Bravais lattices on primitive bases, with the number of primitive vectors along the axes of their rotations, the order of the lattice's group, and the order of its normaliser in the integer matrices, found by trying every assignment of axis vectors to three independent ones. On the three lattices up to monoclinic the axis vectors lie on one line or none and the normaliser is infinite. On the other eleven it is finite (48, 16, 48, 48, 16, 16, 24, 12, 48, 48, 48), its largest entry is one, and it is exactly the set of matrices with entries −1, 0 and 1 that the space-group census used.

A normaliser must permute the axes

The space groups were counted with a small set of changes of basis, and past the monoclinic system nothing had shown that set was the whole normaliser. It is, and the reason is geometric: a change of basis that carries a lattice's group to itself must carry each rotation axis to a rotation axis, so it permutes a finite set of vectors, and past the monoclinic system three of them pin it down. Every such permutation tried, the eleven finite normalisers turn out to be exactly the matrices with entries −1, 0 and 1, and 219 and 230 stand without any table behind them.

restriction · Finiteness
How many reflection operations a plane of each lattice can carry. Every mirror of each of the fourteen Bravais lattices' holohedries, sorted by how many classes of lattice vector lie in it modulo the conventional cell's own translations — which is how many reflection operations any plane of that orientation can carry in any space group on that lattice. Primitive lattices carry one on every plane. Centred ones carry two on the planes their centring vectors lie in: one plane of the C-centred orthorhombic lattice, the diagonal planes of the body-centred tetragonal and cubic ones, and every mirror plane of the face-centred lattices. The rhombohedral lattice, on the hexagonal axes the Tables use, carries three on each of its three mirror planes. None carries four.

Three on a plane, and never four

A reflection plane in a space group carries one operation for each class of lattice vector lying in it, and a face-centred lattice has planes holding two independent centring vectors — enough for four. None of those planes is ever a mirror. The fourteen lattices decide the question without the two hundred and thirty: one, two or three operations on a plane, and never four — with the three on every mirror plane of the rhombohedral lattice, where the Tables' own hexagonal axes put them and the letters have no name for them.

space-groups · Screws and glides
The centrings each holohedry allows, prime by prime. For each of the seven holohedries on its conventional lattice and each prime from 2 to 7, how many of the lines and planes of the lattice reduced modulo that prime the holohedry leaves invariant, and which of them give a lattice other than the one being centred. At 2 they give C for the monoclinic system, C, I and F for the orthorhombic, I for the tetragonal and I and F for the cubic; at 3 they give the rhombohedral lattice from the hexagonal one; at 5 and 7 nothing new.

Only two and three can centre a lattice

The centring letters P, A, B, C, I, F and R are usually a list brought to the Bravais lattices. They can be derived instead: a centring is a subspace of the lattice reduced modulo a prime, and a centring that keeps a crystal system's symmetry is a subspace its holohedry leaves invariant. Enumerating every one for the seven holohedries and the primes up to seven gives exactly the fourteen, with new lattices only at two and three. The reason is the crystallographic restriction, one step removed: every holohedry has an order made of twos and threes.

lattices · Centring
The centrings six four-dimensional lattice groups allow, prime by prime. For each of the six four-dimensional lattices whose symmetry groups are maximal, with the group's order, and each prime from 2 to 7: the subspaces of the lattice modulo that prime the group keeps, sorted by what centring by each one makes. New Bravais types appear only at 2, three of them, all over the cube-and-line lattice, and at 5, where A₄ centred by fifths is A₄*. Both centrings of the hypercubic lattice by halves make D₄, which has three times the symmetry.

The body-centred hypercube is the checkerboard lattice

In three dimensions the centring letters come out as the subspaces a holohedry keeps modulo a prime, and only two and three make new lattices. In four dimensions the same census, run on the six lattices whose symmetry groups are maximal, finds a prime that the three-dimensional argument never could: five centres A₄ into its dual. It also finds that the most familiar centring does not survive the extra dimension. The body-centred hypercubic lattice is not a centred hypercube at all: its body centre is exactly as far away as an edge, and it is D₄, with three times the symmetry.

lattices · Centring
One arm of a star is cheap, and the whole star costs the cube. For nine wavevectors of the primitive cubic zone, the number of cells in the smallest periodic box that holds one arm of the wavevector's star, and in the smallest that holds every arm, on a logarithmic axis found by enumerating every box of each size. The zone corner R is held whole by two cells. The face centre X needs two cells for one arm and eight for its three; the thirds along an axis or a body diagonal need three for one arm and twenty-seven for the star; the quarters need four and up to sixty-four. Every smallest box for a whole star has the full symmetry of the cube.

A whole star needs a cubic box

A periodic box for a cubic crystal holds only the wavevectors its own lattice allows, and a box chosen to hold one wavevector usually holds one arm of its star and not the others. One arm of the face centre X fits in two cells; all three need eight. One arm of a third along an axis fits in three; the whole star needs twenty-seven. The smallest box that holds a whole star always keeps the cube's full symmetry, so a calculation either pays for the cube or reports a symmetry its box imposed.

classification · Flat space
Every four-dimensional lattice with a five-fold rotation, on one interval. The lattices with a five-fold rotation in four dimensions are one ring, ℤ[ζ₅], with the form Tr(a·x·x̄), and the number t = log(a/σ(a)) / 2 log φ, folded into the interval from 0 to 1, says which lattice a is. The dots are the members with a = u + v√5 for u up to 9, 8 distinct lattices. The two ends are A₄* and A₄, with 240 symmetries each; every point between has 20. The arcs join each member to the one a centring by fifths makes of it, its reflection t ↦ 1 − t.

A five-fold lattice has one free number

In four dimensions a lattice can have a five-fold rotation, and A₄ and its dual both do. Every other lattice with one turns out to be the same ring, the integers of the fifth roots of unity, with a single number deciding its shape. Folded onto an interval, the number runs from A₄* at one end to A₄ at the other, and every lattice strictly between has twenty symmetries. Centring by fifths does not make a new lattice. It reflects the interval end to end, exchanging A₄ with A₄* and pairing every other lattice with a partner, and no lattice sits at the middle to be its own.

lattices · Centring
Every stratum a primitive cubic cell lies on, and the steps between them. The ten lattice strata a primitive cubic cell lies on, from triclinic, with no condition, to cubic, with five, each with the number of linear conditions it imposes on the cell's six parameters, joined wherever one adds conditions to the other with nothing between. There are 14 steps and 10 paths from the bottom to the top: nine of four steps, through a monoclinic, the orthorhombic and a tetragonal stratum, and one of two, through the rhombohedral.

A cubic cell has fourteen chances to fail

In the plane, deciding whether a measured cell is square meant two steps up a short diagram, and dividing the error rate between them fixed the test. In space, a primitive cubic cell sits on ten strata joined by fourteen steps on ten different paths, and a walk that tests every step at five per cent calls more than a quarter of true cubic cells something less. Dividing the level by the steps of one path is not enough and dividing it by all fourteen is too much. Measured directly, the right level is two-thirds of a per cent a step, and calibrated that way the walk notices a tetragonal distortion more often than the single test it replaces.

operations · Subgroups
Every six-dimensional lattice with a seven-fold rotation, on one torus. The lattices with a rotation of order seven in six dimensions are the ring ℤ[ζ₇] with three positive weights, one on each complex line it spans. Up to scale and isometry the weights live on a torus, drawn as a sixty-degree rhombus with opposite sides glued, shaded by how well each lattice packs spheres. The Galois automorphism turns the torus a third of a turn about three points, on the long diagonal: A₆* with 10080 symmetries, A₆ with 10080, and the ideal (1 − ζ)² with 672, the densest lattice in the family. The small dots are integral members, each with 28 symmetries.

A seven-fold lattice lives on a folded torus

In six dimensions a lattice can have a seven-fold rotation, and every one that does is the integers of the seventh roots of unity with three weights on it. Up to scale the weights live on a hexagonal torus that a Galois symmetry folds by a third-turn, and the fold has three fixed points: A₆*, A₆, and a third lattice that packs better than either. Centring by sevenths is no longer a reflection, as fifths was in four dimensions. It moves every lattice a third of the way along the torus and carries the three special ones round in a cycle.

lattices · Centring
The five special eleven-fold lattices in ten dimensions. The five lattices at the fixed points of the Galois rotation of order five on the 4-torus of eleven-fold lattices: A₁₀*, A₁₀ and the ideals (1 − ζ)², (1 − ζ)³ and (1 − ζ)⁴ with the trace form. For each, where it sits on the torus's diagonal, its symmetry group (the root lattices' by identification, the others' by exhaustive search: 2,640 each), its kissing number, its centre density at determinant one (0.0020, 0.0094, 0.0274, 0.0189, 0.0221), and which of the five its dual is. The densest, (1 − ζ)², is shaded; the one duality fixes is (1 − ζ)³.

The densest eleven-fold lattice is not its own dual

Every ten-dimensional lattice with an eleven-fold rotation is one ring with five weights, and its shapes form a four-dimensional torus folded by a Galois rotation of order five. The seven-fold essay predicted five special lattices, the powers of 1 − ζ, cycled by centring, and all of that holds. What does not carry over is its best result. In six dimensions the densest seven-fold lattice was the one duality fixes. In ten, duality fixes (1 − ζ)³, and the densest is (1 − ζ)², whose dual is (1 − ζ)⁴.

lattices · Centring
The six special thirteen-fold lattices in twelve dimensions. The six lattices at the fixed points of the Galois rotation of order six on the 5-torus of thirteen-fold lattices: A₁₂*, A₁₂ and the ideals (1 − ζ)² to (1 − ζ)⁵ with the trace form. For each, where it sits on the line through the fixed points, the symmetries known for it, its kissing number (26, 156, 390, 312, 78, 26), its centre density at determinant one (0.0005, 0.0043, 0.0213, 0.0187, 0.0081, 0.0071), and which of the six its dual is. None is its own dual. The densest, (1 − ζ)², is shaded; the densest known twelve-dimensional lattice, Coxeter and Todd's, is given below for comparison.

Thirteen-fold, and nothing is its own dual

Every twelve-dimensional lattice with a thirteen-fold rotation is one ring with six weights, and its shapes form a five-dimensional torus folded six ways. The fold has six fixed points, the powers of 1 − ζ, and duality fixes none of them, as in four dimensions and unlike six and ten: it pairs them off. The eleven-fold essay asked whether a longer cycle would let a higher power take over as the densest. It does not. (1 − ζ)² is the densest member at seven, at eleven and at thirteen, whatever duality does.

lattices · Centring
Which of the fourteen lattices is a limit of which. The fourteen Bravais types, with an edge from one type up to another when the higher is a limit of the lower and no third type lies between: nineteen edges, computed from the subgroups of each lattice's own group. Primitive cubic is reached through primitive tetragonal and the rhombohedral type; body-centred and face-centred cubic through body-centred tetragonal and the rhombohedral type; the hexagonal lattice only through the C-centred orthorhombic one.

The centring survives the limit

Stretch a body-centred tetragonal lattice until its axes are equal and it becomes body-centred cubic; stretch it further and it becomes face-centred cubic. No stretching of a primitive tetragonal lattice reaches either. Which of the fourteen lattices can be deformed into which is decided by the subgroups of each lattice's own group, and the answer keeps track of centring in a way the familiar chain of crystal systems does not.

lattices · The fourteen Bravais lattices

Named alongside it

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

HolohedryCentringGram matrixDual latticeSublatticeHigher-dimensional latticeKissing numberSubgroupCrystallographic restrictionDeterminantIndexLattice

All concepts