Crystallography & Symmetry
patterns derived from their groups
Series

Lattice — the series

11 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. The hexagonal lattice. 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.

    The lattice underneath

    Strip a pattern of everything but its repeats and a grid of points is left. That grid is not decoration — it is the object that decides which symmetries the pattern is permitted to have.

    part 1 · lattices
  2. 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.

    part 2 · lattices
  3. Two cells of equal area on one rhombic lattice. One lattice — the rhombic lattice that cm sits on — with two parallelograms drawn on it: the conventional cell, and a sheared cell whose edges are the integer combinations (1, 0) and (1, 1) of it. The points are identical in both outlines; only the description changes. Each cell's contents were counted by writing every lattice point in that cell's own coordinates and sharing each one out between the cells that meet at it — a quarter at a corner, a half on an edge, one inside — and the totals come to 1 and 1, which are the determinants of the two matrices. The alternative has determinant one, so its inverse is integral and it generates exactly the same lattice; that is the whole condition, and it is why a lattice has infinitely many bases and no arithmetic can prefer one.

    The cell is a choice, the lattice is not

    Every lattice has infinitely many unit cells and infinitely many bases, and crystallography picks one by convention. Knowing which convention is in force is the difference between a symbol that means something and a symbol that means nothing.

    part 3 · lattices
  4. Reducing a basis. An awkward basis and the reduced one Gauss's algorithm returns. Both describe the same lattice — the change of basis has determinant one — and the reduced pair is the shortest vector together with the shortest independent of it, checked against an exhaustive search.

    Reduction, and the shortest basis

    Every lattice has infinitely many bases and no arithmetic picks a preferred one — until a rule is imposed. Reduction is that rule, it terminates in a handful of steps, and it is what lets a database decide whether two reported crystals are the same crystal.

    part 4 · lattices
  5. Building the reciprocal lattice from spacings. Each family of lattice rows has a spacing, and each contributes one reciprocal point: perpendicular to the rows, at the inverse of the spacing. The points built that way were compared against the algebraic definition and agree exactly.

    The dual lattice, as a construction

    The reciprocal lattice is usually introduced as a formula and then used as a fact. Building it instead — one point per family of lattice rows, at the inverse of the spacing — makes every property it has obvious rather than memorable.

    part 5 · lattices
  6. 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.

    part 6 · lattices
  7. incommensurate: "dense on a line". The shortest non-zero vector a subgroup contains, as the search widens, against the square lattice drawn flat behind it as a control. For a lattice the answer is constant: the shortest vector is the shortest vector, and looking further finds nothing nearer. For a subgroup that is not a lattice it falls without limit, because the convergents of a continued fraction give integers making the combination arbitrarily small. This one falls from 0.414 to 1.2e-2 over bounds 1 to 64, which is the verdict "dense on a line" arrived at by measurement rather than by reading a definition. Nothing here is decided by asking whether a ratio is rational; the ratio is a float and the question would be undecidable of one.

    Discrete, or dense, and nothing between

    Every count in this collection rests on a hypothesis nobody states, because it is built into the word lattice: the translations of a pattern form a discrete subgroup of the plane. Drop it and the counts do not become larger — they stop existing, because the object stops being a lattice. A subgroup of the plane is one of five things, and only two of them are lattices.

    part 7 · lattices
  8. (17, 5) and (23, 7) reduced in 3 steps. Lagrange's reduction, run on the basis (17, 5), (23, 7). Each step subtracts a whole multiple of the shorter vector from the longer and swaps them; after 3 steps neither can be shortened by the other and the pair is reduced. The faint arrows are the intermediate bases and the solid pair is the answer, of length 1.41. The procedure always terminates and always finds the shortest vector, and in the plane that is a theorem rather than a hope.

    The shortest vector, and where it stops being easy

    Two moves find the shortest vector of a plane lattice, and they always terminate. Nothing on this site has ever needed more, because every lattice here has two or three dimensions. In general the same question is NP-hard, the best polynomial procedure returns an answer that may be exponentially too long, and an entire branch of cryptography is built on the gap.

    part 8 · lattices
  9. a lattice triangle: 1 inside, 6 on the edge, area 3. a lattice triangle on its lattice, with the 1 points strictly inside it in the first colour and the 6 points on its boundary in the measured colour. Pick's theorem says the area is the interior count plus half the boundary count less one, which is 1 + 6/2 − 1 = 3; the shoelace formula on the same integer coordinates gives twice the area as 6. The two agree, and both sides are integers, so the check has no tolerance in it. The theorem holds for a non-convex polygon and a polygon with no interior point alike, neither of which the usual triangle-and-square picture makes obvious.

    How many points a shape holds

    Draw a polygon on a lattice, count the points inside, then double the polygon and count again. The counts are not approximately a polynomial in the scale — they are one, exactly, with the area as its leading coefficient and a constant term of one for every polygon there is.

    part 9 · lattices
  10. 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.

    part 10 · lattices
  11. The three minima of seven lattices. Every lattice scaled to covolume one, with the smallest radius at which a ball holds one, two and three independent lattice vectors. The last column is the shortest vector as a fraction of the longest any lattice of this volume can have — Hermite's constant — and only the face-centred cubic lattice reaches it. The fifth column is the product of the three, which is capped whatever the lattice.

    A lattice cannot have all its vectors long

    The three successive minima are the radii at which a ball first holds one, two and three independent lattice vectors. Nothing bounds any of them above on its own — a cell can be flattened without limit — but Minkowski's second theorem caps their product, so pushing one up forces another down. That is why every crystal has a shortest direction worth naming, and why a very anisotropic cell has a very short one.

    part 11 · lattices

All series