Crystallography & Symmetry
patterns derived from their groups
Concept

Sublattice — where it appears

A subset of a lattice which is itself a lattice, sitting inside it at a whole-number index with a correspondingly larger cell. How many there are at each index is a divisor sum in the plane, and which of them keep the parent's symmetry is a question in number theory.

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

Centring the five lattices. Each of the five plane lattices with the midpoint of every cell added, and the type of lattice that results — read off the reduced basis of the new point set rather than looked up. Every centring halves the cell area, so the original lattice is a sublattice of index two in the centred one, and every centred lattice is again one of the five. Two of the five come back as themselves and are therefore no richer for being centred. The rectangular and rhombic lattices exchange, which is what makes them one family under two descriptions. And the hexagonal lattice centred is rectangular — its holohedry falls from 12 to 4, so centring destroys the symmetry it was meant to display.

Centring, counted as a sublattice

Adding the centre of every cell to a lattice produces another lattice, containing the first with index two. Doing it to each of the five in turn shows why the list is five rather than ten, and why only one of the five has a centred description worth keeping.

lattices · Centring The subgroups of p4m of index 2. p4m has 7 subgroup(s) of index 2 with cyclic quotient. 3 of them keep every translation and lose operations — the lattice is untouched and the pattern loses a symmetry at every point. 4 keep every operation and lose translations, and each is named beside the basis of the sublattice it keeps, written in the parent's own axes. Each subgroup is the kernel of a homomorphism onto a cyclic group, found by enumeration; each name is found by searching changes of basis and origin until the operation sets match exactly.

Two ways down from a group

A pattern can lose a symmetry by giving up an operation or by giving up a translation, and the two are different in kind. Sorting the seventy-four subgroups of index two among the seventeen splits them twenty-nine to forty-five — and a containment test that compares operations modulo one shared lattice can only see the twenty-nine.

operations · Subgroups Sublattices of index n in the plane. For each index up to 12: the number of sublattices found by building every Hermite normal form of that determinant, and the number the Dirichlet series ζ(s)ζ(s−1) predicts — the sum of the divisors in the plane, and a longer sum in space. The two columns are computed by routines that share no code, and the figure does not appear at all if any row disagrees.

How many ways there are to thin a lattice

A sublattice of index n keeps one lattice point in n, and there is never only one way to do it. In the plane the number of them is the sum of the divisors of n; in space it is a longer sum; and both are counted here by writing every one of them down.

lattices · Sublattices Σ5: two square lattices at 36.87°. Two square lattices, one turned through 36.87° about a shared point. At this angle one point in 5 lands exactly on a point of the other lattice — 29 of the 149 drawn — and those shared points are themselves a lattice, the coincidence site lattice, of index 5. The angle comes from tan(θ/2) = 1/3, and Σ is the odd part of 3² + 1² = 10. Nothing here is measured: whether a point is shared is decided by an integer congruence.

Turn a lattice against itself and almost nothing lines up

Two copies of one lattice rotated about a shared point share that point and, at almost every angle, no other. At a discrete set of angles they share a whole sublattice — one point in three, or five, or seven — and a grain boundary built on such an orientation costs a fraction of what a general one costs, because a fraction of the atoms are already where both sides want them.

applied · Interfaces Which indices have a square sublattice. For each index up to 26: how many sublattices of the square lattice are themselves square, found by testing whether the quarter-turn maps each one onto itself; the same count as a sum over divisors, +1 for each divisor one more than a multiple of four and −1 for each one less; and the ways of writing the index as a sum of two squares. The three agree at every row, which is Fermat's theorem — and it says that 3, 7 and 11 have no square sublattice at all while 5, 13 and 17 have two.

The sublattices that stay square

A sublattice of the square lattice is itself square exactly when its index is a sum of two squares — so index five has two and index seven has none, and which superstructures a surface can form is decided by a theorem of Fermat's about primes.

lattices · Sublattices Every coincidence index is odd. The rotations that bring a cubic lattice into coincidence with itself, up to index 25: 17 distinct relations across 12 indices, each found by enumerating integer quaternions and each index computed as the size of a sublattice rather than from the usual formula — the two are then required to agree. 5 of the 12 indices carry more than one relation, which is why the tables write 13a and 13b. Every index is odd. That is not a feature of this range: a rational orthogonal matrix written in lowest terms has an odd denominator, so the factors of two always cancel.

Every coincidence index is odd, and in the plane most of them do not exist

The indices at which two copies of a cubic lattice share points are 3, 5, 7, 9, 11 and every odd number after them. There is a two-line proof that no even index can occur. Ask the same question about a square lattice and the answer is a different list entirely, governed by which numbers are sums of two squares — so Σ3, which is the commonest boundary in every metal, has no plane analogue at all.

applied · Interfaces Subgroups of index 3, across the seventeen. Every subgroup of index 3 with cyclic quotient in each of the seventeen plane groups, sorted into the two kinds: 4 keep all the translations and lose operations, 22 keep all the operations and lose translations, and the total is 26. The split is decided by whether the homomorphism onto ℤ3 kills the two lattice translations, which is a property of the kernel and not a judgement. Every one of them is found by enumeration inside the finite quotient by 3Λ, and the count for the whole classification is a measurement.

Three colours, and why most patterns cannot have them

Seventy-four of the seventeen plane groups' subgroups have index two, and every group but one has at least one. At index three there are twenty-six, and ten of the seventeen have none at all — because a symmetry of order two cannot survive being asked to permute three colours.

classification · Colour Two species on one lattice, ordered at index 2. Every position is a lattice point of the parent and none of them has moved. What has changed is which atom sits where: the larger marks are a sublattice of index 2, the smaller ones its other 1 coset, and the outlined cell is the new repeat. The lattice of positions is untouched and the repeat of the contents is 2 times as large, which is the whole of what an ordering transition does and the reason its signature is in reciprocal space rather than in the positions.

The reflections a superlattice adds

Centring a lattice makes reflections vanish. Ordering two kinds of atom onto a sublattice makes new ones appear, exactly n − 1 of them per parent cell, and their intensity is a difference rather than a sum — which is why an ordered alloy of two neighbouring elements can be invisible to X-rays and obvious to neutrons.

lattices · Sublattices Subgroups of index two, three and four. Every plane group with the number of subgroups it has at each small index, counted by enumerating the transitive actions on that many points. The zeros are the interesting entries: p3 has no subgroup of index two and the four-fold groups have none of index three, because a subgroup of index n gives an action on n points and the group has to have a quotient that can act. A rotation of order three has nowhere to go in a set of two, and one of order four has nowhere to go in a set of three that is not the identity — so the index is constrained by the point group before any geometry is done.

How many subgroups of index three

Taking operations away and closing what is left finds the maximal subgroups and stops there. Counting instead the ways a group can act on three points finds all of them — and finds that a four-fold group has none of index three at all.

operations · Subgroups The cell of 3.4.6.4, and the vertices in it. 3.4.6.4 drawn with the cell its own translations define. The lattice is hexagonal and the cell holds 6 vertexes, marked. Neither was chosen: the translations are the vertex-to-vertex vectors that carry every polygon of the patch onto a polygon of the patch, and the cell is the shortest independent pair of them. Expressed in that basis the vertices have coordinates that are exact and are not fractions — a vertex of this tiling sits at 1/(1 + √3) of a cell — which is why the detector that decides its group works in ℚ(√3) rather than in the rationals.

Eleven tilings, five groups

Hand each of the eleven uniform tilings to a detector that has never heard of tilings and ask what its symmetry is. Six of them answer p6m. Twelve of the seventeen wallpaper groups never appear at all — and the coordinates the question has to be asked in are not fractions.

classification · Tilings p = 2: 1, 3, 6, 12, 24 vertices at each distance. Every sublattice of index a power of 2, up to scale, joined when one contains the other with index 2. From the whole lattice there are 3 ways down, because a sublattice of index 2 is a line over the field of 2 elements and there are 3 of those; from each of those there are 3 again, one of which is the way back. So the counts are 1, 3, 6, 12, 24 — that is (2 + 1)·2^(k−1) — and the graph has no cycles, both of which are checked on every vertex whose whole neighbourhood was grown rather than read off the picture. The object is the Bruhat–Tits tree of the p-adic plane, and it is what the set of sublattices is rather than how many there are.

Every way down, and no way round

There are as many sublattices of a given index as the index has divisors, and counting them is where that essay stopped. This one asks what they are to each other, and the answer is a shape: an infinite tree in which every vertex has exactly p + 1 neighbours and no path ever comes back.

lattices · Sublattices At which indices a group contains a copy of itself. A filled circle where the group has a subgroup of that index which is the same plane group again. The groups with no rotation past a half-turn take every index — the lattice can be stretched along one direction by any factor. The four-fold groups take the sums of two squares and the three- and six-fold groups take the Loeschian numbers, because a sublattice invariant under a quarter or a third of a turn is an ideal in the Gaussian or Eisenstein integers and its index is a norm. The groups with mirrors take fewer still, and p4g takes only the squares.

The same group in a bigger cell

A subgroup usually gives something up. An isomorphic subgroup gives up nothing but scale — the same plane group again, on a coarser lattice — and the indices at which that is possible turn out to be the values of a quadratic form.

space-groups · Isomorphic subgroups Sums of two squares, arriving as superstructures. Which indices admit a sublattice of the same shape as the square lattice, drawn as a bar per index whose height is how many there are. The pattern is not a pattern about lattices at all: an index works exactly when it is a sum of two squares, because a similar sublattice of the square lattice is multiplication by a Gaussian integer and its index is that integer's norm. The indices that work up to 30 are 1, 2, 4, 5, 8, 9, 10, 13, 16, 17, 18, 20, 25, 26, 29, and the same list is produced here a second time by factorising rather than by searching, with the two required to agree.

The sublattices that are the same shape

Thinning a lattice usually changes its shape. Sometimes it does not: the sublattice is the parent rotated and scaled, and a drawing of it alone would be a drawing of the parent. Which indices allow it turns out to be a question Fermat answered in 1640.

lattices · Sublattices 4_1: which index gives which group. The isomorphic subgroups of a 4₍1₎ screw group, index by index. An index sharing a factor with 4 gives nothing — the translation cannot be written on the new cell at all — and the rest give a screw whose index is the old one times the inverse of p modulo the axis order. So the answer alternates: some indices give the group back and others give its mirror image, and which is which is decided by p modulo the order of the axis.

A bigger cell, and sometimes the mirror

An isomorphic subgroup gives up nothing but scale — the same group again on a coarser lattice. In space the screw axes sharpen the question, and the answer contains a surprise: a cell three times taller holds the group's enantiomorphic partner, so a left-handed screw contains a right-handed one with nothing done to the crystal but a change of description.

space-groups · Isomorphic subgroups 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 monoclinic: 9 twin laws, 1 of them exact. The twin laws of a monoclinic lattice: a two-fold about the row [uvw] paired with the plane (hkl) it is meant to be a mirror in, kept when the twin index is at most six and the obliquity at most six degrees, which are Friedel's own limits and are a convention rather than a theorem. 9 of the 9 are listed. The index n is how many lattice nodes there are per node the operation restores, computed from the integers and checked against the sublattice built from the plane and the row. The obliquity is the angle between the row and the plane's normal: 1 of these laws have none, and for those the operation restores a sublattice exactly.

The index and the angle a twin misses by

Whether a crystal will twin on a given operation is decided by its lattice, not by its structure. Two numbers decide it: how many lattice nodes there are per node the operation restores, and how far the operation is from being a symmetry at all. Both are computed from integers, and one of them is a fiction that has to be labelled as one.

applied · Twinning 342 unlabelled spots, cell volume 52. A bag of 342 reflection positions with no indices on them, collected out to a bound of 3 on each index. Their pairwise differences generate the reciprocal lattice; a basis of that is taken by integer elimination and then reduced, and the reduced basis is printed. Its determinant is 52, which is the volume of the cell the reflections were computed from — so the cell has been recovered from positions alone, with no intensity used anywhere.

A cell from a bag of spots

A single-crystal experiment returns a list of directions with no labels on them. Recovering the cell is recovering the lattice those directions generate, and the whole of it is take differences, reduce, read the answer. What no quantity of data settles is whether the lattice found is the true one or a sublattice of it.

applied · Indexing Σ5: three lattices in one picture. Two copies of the square lattice turned by 36.87 degrees against one another — one drawn pale, one drawn in the second colour — with the points they share ringed. The fine dots are the lattice generated by both together, the DSC lattice, which contains each crystal with index 5 exactly as the coincidences sit inside each crystal with index 5. Three lattices nested at the same index, and the middle one is the crystal.

The dislocations a boundary allows

Two crystals meeting at a coincidence angle share one lattice and generate another. The second is where a boundary's own defects live, its shortest vector is one over the square root of the index, and a dislocation's energy is the square of that.

applied · Interfaces The alias accounts for every line and predicts more. The observed lines above, and below them the grid of a supercell that explains all of them. The full ticks are the observed lines, which the alias reproduces exactly; the faint ones are lines the alias predicts and nobody saw. That second set is the only thing that separates the two cells, and it is why an indexing criterion has to charge for unobserved lines rather than measure agreement.

Every alias is a supercell

A cell that explains every line of a powder pattern is not a near miss and not a coincidence: its reciprocal grid contains the true one, which means its own cell is a superlattice of the true cell. So the ambiguity of indexing is the arithmetic of superlattices, and it can be counted — two cells with one unknown, sixteen with two, sixty-two with three, all of them accounting for the same twenty lines exactly.

applied · Indexing 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 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 Which indices a screw axis contains itself at. The fifteen kinds of axis a space group may have, against the index of the sublattice taken along the axis. A filled cell is an index at which the axis contains a copy of its own kind; the darker cells are the indices at which what comes back is the mirror image instead. A pure rotation axis is filled everywhere and a screw is not, and which indices a screw loses is decided by one congruence rather than by any geometry.

A screw that contains its own mirror image

No proper motion turns a right-handed screw axis into a left-handed one; only a reflection can — that is what makes the eleven enantiomorphic pairs pairs. And yet a 4₁ axis contains copies of 4₃ as subgroups, at every index congruent to three modulo four. One congruence decides both which indices are possible and which hand comes back, and it is the same congruence for all fifteen kinds of axis.

space-groups · Isomorphic subgroups The same terms, added in two shapes. Partial sums of the alternating 1/r sum over the simple cubic lattice, taken over expanding cubes and over expanding spheres. The terms are identical and only the order differs. The cubes creep towards 1.747565 — 1.7258 by the last point drawn — and the spheres do not settle at all, landing at -3.527 after passing through values on both sides of it. A conditionally convergent sum has no value until the order is named.

The sum whose answer depends on the shape

Give the points of a cubic lattice alternating signs and add up one over the distance. Added over expanding cubes the total creeps towards 1.747565; added over expanding spheres it does not converge at all, landing on both sides of that number and never settling. The terms are identical and only the order differs. Splitting the sum in two with the theta transformation gives it a value — ten decimal places from a few thousand terms.

lattices · Lengths One crossing or the other, and never both. Two events on a square patch of lattice: a path of occupied sites crossing from left to right, and a path of vacant sites crossing from top to bottom. On the triangular lattice exactly one of them happens in every configuration tested — the claim is combinatorial rather than statistical, so one counterexample would end it. On the square lattice both can fail at once, and do, in more than a quarter of the configurations. That difference is the whole of what follows.

The threshold a symmetry pins down

Occupy sites at random and somewhere the occupied ones first join up across the crystal. For almost every lattice that occupancy is known only to a few digits. For the triangular lattice it is exactly a half, and the reason is that on a lattice whose faces are all triangles an occupied path and a vacant path cannot slip past each other — a statement about one configuration at a time, with no probability in it.

diffraction · Disorder What lies between a group and its copies at index 25. For each group, the lattices carried to themselves by its point group that contain a copy of the group at index 25, arranged by index, with lines for containment; each lattice is labelled by the Gaussian or Eisenstein integer that generates it. Copies are the bottom row, drawn large when nothing lies between them and the whole lattice. p4: 3 copies at index 25, 0 maximal, with invariant lattices between of index 5; p4m: 1 copies at index 25, 1 maximal, with invariant lattices between of index none.

The primes a cell can grow by

A plane group contains copies of itself in bigger cells, and the International Tables list the ones that are maximal — the copies nothing else sits between. For p4 they come at 2, at 5, 13, 17 and 29 twice each, and at 9 and 49 once, and the list is the list of primes of the Gaussian integers. Put mirrors on the pattern and the copies at 5 and 13 vanish while 25 becomes maximal: a mirror cannot keep one factor of a prime without the other.

space-groups · Isomorphic subgroups Free going down, two conditions going up. The edge between p2 and p4 in the diagram of maximal translationengleiche relations, read in both directions. Downwards it costs nothing: the quarter-turns are discarded and the lattice is exactly the lattice that was there, so every p4 pattern contains a p2 pattern. Upwards the added quarter-turns must carry the lattice onto itself, which forces the cell to have equal edges at a right angle — two conditions on a general oblique cell, which has only two parameters to give. So a p2 structure has a p4 supergroup exactly when its measured cell happens to be square, and the question is about the metric rather than about the group.

Going up costs the cell a parameter

The usual asymmetry — finitely many maximal subgroups below, infinitely many minimal supergroups above — is false in both halves for a plane group. Both directions are infinite and equinumerous index by index. The real asymmetry is that 17 of the 31 edges cost the lattice a parameter going up and nothing going down.

operations · Subgroups P4₁: the lattices, as an ideal across and a multiple along. Every sublattice the point group of P4₁ carries to itself, indexed by the norm of the ideal it uses across the axis and by the multiple it takes along it. The entry is the space group that sits on it: the parent's own type in one colour, a different type in the other, and a dash where no group with the parent's point group survives at all. A dot marks a lattice that is maximal — one whose step is a single prime, across or along, with nothing between it and the whole. The rows and columns are two divisibility orders and the table is their product, which is the shape the plane's answer predicted.

An ideal across and a prime along

In the plane a copy of a group inside itself grows by a prime ideal, and the maximal indices are the norms of the primes of a ring. In space with one principal axis there are two directions to grow in, and the question the plane left was whether the two constraints multiply. They do not — and the place they fail is an index the plane calls maximal, because the step in between carries the group's mirror image.

space-groups · Isomorphic subgroups A row of coefficients for every group. For eight of the seventeen, the number of sublattices of each index that the group's point group carries to itself. A nought means the group has no copy of itself at that index at all. p1 and p2 preserve every sublattice, so their rows are the counts of sublattices themselves — 1, 3, 4, 7, 6, 12 — which is the sum of the divisors. The rows thin out as the point group grows, and p4m and p6m have almost nothing in them. Every row is a sequence a Dirichlet series can be built on, and the next figure is what that series factors into.

A row written as a product

Every group's copies of itself sit at a row of indices, and every row so far has been read one entry at a time. Counting all of them at once turns a row into a Dirichlet series, and every one of the seventeen rows factors into a product over the primes — which is the statement that a copy is a chain of maximal steps, written as arithmetic. The plainest group of all has the most famous series in mathematics.

space-groups · Isomorphic subgroups One lattice, two copies of pm. pm on a lattice doubled across its mirrors. The mirrors of the parent are every vertical line; a copy of pm on the doubled lattice has mirrors every other line, and there are two ways to choose which — the solid set or the dashed set. Both are copies of pm with the same lattice and the same point group, and no translation of the parent carries one onto the other, because the translation that would is exactly the one the doubling removed. So a count of invariant lattices is not a count of subgroups, and the gap is visible in the smallest case there is.

A lattice is not a subgroup

Every count of copies so far has counted lattices, and the International Tables count subgroups. One invariant lattice can carry several copies of a group that nothing in the parent carries onto one another — pm's doubled lattice carries two, with its mirrors on the even lines or the odd ones — and how many is a cohomology computation, a first where the classification of the seventeen used a second.

space-groups · Isomorphic subgroups 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 square-lattice superstructure, by the size of its cell. The number of distinct arrangements of two species on the square lattice whose primitive cell holds exactly n sites, for n from one to twelve, logarithmic, counted over every cell shape at once: every sublattice of index n up to the lattice's own symmetry, every colouring of it up to translations and the sublattice's stabiliser, and only those whose true period is that sublattice. Odd prime sizes are low, because only a few cell shapes exist; sizes with many divisors are high.

Every superstructure counted once

The 805 arrangements of two species on a four-by-four cell were never the structures with sixteen atoms: forty-nine of them repeat in a smaller cell, and every sixteen-atom structure whose cell is not a four-by-four square is missing. Counting structures rather than arrangements means counting over every shape of cell at once, and discarding every arrangement that repeats sooner. On the square lattice that gives 2, 2, 4, 11, 16, 40, 48, 148 structures for cells of one to eight atoms, and 22,413 with sixteen.

operations · Counting How many superstructures a diffraction pattern tells apart. For two-species superstructures of the square lattice with one to twelve sites in the primitive cell: the number of structures, and the number of classes that the positions of their superlattice spots separate them into, the positions together with the composition, and every intensity. At twelve sites 2,012 structures give 167 sets of spot positions, 504 with the composition and 1,815 sets of intensities. At five, seven and eleven sites the positions distinguish only the cells; the intensities distinguish everything. The bar shows the share resolved by positions, dark, and by intensities, light.

The spots say the cell and little else

Of the 2,012 two-species superstructures of the square lattice with twelve sites in the cell, more than half light every superlattice spot their cell allows, so the positions of the spots say which cell and nothing more. Positions separate the 2,012 into 167 classes, the composition takes that to 504, and every intensity to 1,815. At a prime number of sites no spot is ever missing, because a sum of distinct p-th roots of unity cannot vanish.

operations · Counting Every four-colouring of the seventeen, by the group that permutes the colours. The 281 subgroups of index four across the seventeen plane groups, each a colouring of a pattern in four colours that the pattern's symmetries permute transitively, sorted by the permutation group they induce on the colours: ℤ₄ 20, Klein 77, D₄ 164, A₄ 8, S₄ 12. The groups without a three-fold rotation use only the cyclic, Klein and dihedral groups; the five with one use only A₄ and S₄, apart from a single Klein colouring of p6m.

Four colours, five ways to permute them

Two colours can be swapped in one way and three can be permuted in two. Four colours can be permuted transitively by five different groups, and the seventeen plane groups use all five: 281 four-colourings sort into 20 cyclic, 77 Klein, 164 square, 8 tetrahedral and 12 fully symmetric. The last twenty belong to the five groups with a three-fold rotation, and they are the lattice reduced modulo two.

classification · Colour 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 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 How few of their own operations the space groups need. The 212 space-group types that their own rotations, screws, mirrors, glides and inversions generate, by the fewest of those operations that suffice: 64 need 2, 93 need 3, 46 need 4, 8 need 5, 1 need 6. For 198 the number equals a lower bound read off the group's largest elementary abelian quotient; for the other 14 a finite quotient proves that one more is needed, and a set of that size is found.

Two operations make rock salt's group, and Pmmm needs six

Every space group that its own rotations, screws, mirrors, glides and inversions can build is built by a handful of them, and how small a handful is now known for all 212. A quotient of each group says how many it cannot do without, a search finds that many for 198, and for the other fourteen a finite quotient proves that one more is needed. Rock salt's group needs two operations, Pmmm six, and P312 needs four where its abelian quotient allows two.

space-groups · Screws and glides Which plane groups can be coloured with five, seven, eleven or thirteen colours. For each of the seventeen plane groups and each of the primes 5, 7, 11 and 13, the number of its colourings with that many colours, as subgroups of that index, and the group that permutes the colours: cyclic (C), dihedral (D), or the affine group of the colours with a multiplier of order 3, 4 or 6 (written p:3, p:4, p:6). Totals 104, 172, 268 and 420. The square groups p4 appear at 5 and 13, the three-fold and six-fold groups p3 and p6 at 7 and 13, and p4m, p4g, p3m1, p31m and p6m never.

Five colours, seven colours, and the primes that split

Four colours gave the seventeen plane groups 281 colourings, five different groups permuting the colours and ninety-six designs. Five colours give 104 colourings, three groups and fourteen designs, and from five upwards every prime behaves the same way. A prime number of colours that the point group cannot divide forces every colouring onto a sublattice the rotations keep, and whether the square and hexagonal patterns have one is decided by whether the prime splits in the Gaussian or the Eisenstein integers.

classification · Colour Whole stars of the hexagonal zone, and the boxes that hold them. For ten wavevectors of the primitive hexagonal zone, the number of cells in the smallest periodic box holding one arm of the star, in the smallest holding every arm, and, where it differs, in the smallest n by n grid of cells holding the star. The corner K is a single arm up to sign and is held whole by three cells, against nine for a grid; K raised to the top face, H, by six against eighteen; halfway to K, T, by twelve against thirty-six. M needs two cells for one arm and four for its three, and L two and eight. Every smallest box for a whole star keeps the full hexagonal symmetry.

The corner of a hexagon fits in three cells

A periodic box for a hexagonal crystal holds a whole star of wavevectors only if it keeps the crystal's full symmetry, as a cubic box must. What the cube never offered is a box turned through thirty degrees. It holds the corner of the hexagonal zone in three cells where every grid needs nine, and the saving is always exactly a factor of three and always at the same stars. Turn a box through any other angle that the six-fold axis allows and it loses the mirrors, and comes with a mirror image.

classification · Flat space Whole stars of the rhombohedral zone, and the boxes that hold them. For eight wavevectors of the rhombohedral zone, the number of cells in the smallest periodic box holding one arm of the star, in the smallest holding every arm, and, where it costs more, in the better of the two regular grids: the rhombohedral cell repeated n times along each edge, or the hexagonal triple cell repeated n by n by m. The axis end T is held whole in two cells against six, the face centre F in four against eight, and the in-plane third K₃ in nine against twenty-seven; L needs eight either way. Every smallest box for a whole star keeps all twelve operations of 3̅m.

A rhombohedral box saves a factor of two the hexagon never offered

A rhombohedral crystal is drawn on two cells, the small rhombohedron and the hexagonal cell three times its size, and a periodic box is usually one of them repeated. The smallest box that holds a whole star of wavevectors is the star's own lattice instead, and across every star with denominators up to eight it beats the better of the two grids by one, two or three, never more. Three was the hexagon's number. Two is new, and it is the face centre's. And the boxes that keep the three-fold axis and lose the mirrors still come in mirror pairs, now at nine cells as well.

classification · Flat space Which plane groups can be coloured with five, twenty-five, seven and forty-nine colours. For each of the seventeen plane groups, its colourings with 5, 25, 7 and 49 colours, as subgroups of that index. At p² colours the count splits into those whose translations meet the lattice in the whole plane pL and those that meet it in a cyclic sublattice. The five groups with a mirror across a rotation, shaded, have none at 5 or 7 and p² of them at 25 and 49, all on pL. In all, 104, 1449, 172 and 4197 colourings.

Twenty-five colours, and the mirrors come back

With a prime number of colours from five up, five of the seventeen plane groups can never be coloured at all: the ones with a mirror across a rotation. With the square of a prime they all can. A colouring with twenty-five colours may meet the lattice in the whole plane modulo five, which every group keeps, and the colours then form a plane the point group acts on by its matrices. The designs come out as the prime's count again, with one more for each of the seventeen groups.

classification · Colour Copies of a plane group of itself, counted to index ninety-six. For eight of the seventeen plane groups, the number of subgroups isomorphic to the group, up to conjugacy, of index at most N, on logarithmic axes. The curves fall into four tiers by their slopes: groups with no operation but a half-turn grow as N², groups with mirrors and nothing of order three or more as N log N, groups with a rotation of order three or more and no mirror as N, and groups with both as √N. By index 96 p2 has 13446 copies and p6m 13.

The copies a group keeps of itself grow at four speeds

A plane group's copies of itself sit on the sublattices all its operations keep, several to a lattice. A richer point group keeps fewer lattices and puts more copies on each, and the two trends run in opposite directions. Counted to index ninety-six they do not balance. The copies per lattice never exceed sixteen, while the lattices grow as N², N log N, N or √N according to the point group, so a richer group's early lead always ends, at index ten, eleven or twenty-seven, and never returns.

space-groups · Isomorphic subgroups Sublattices a space group's point group keeps, counted to index sixty-four. For six of the seventy-three arithmetic classes, the number of sublattices of ℤ³ of index at most N that every operation of the point group carries to itself, on logarithmic axes. The six curves have six slopes: N³ for a triclinic class, N² for a monoclinic one, N log² N for an orthorhombic one, N log N for a tetragonal class with no two-fold axis or mirror through its four-fold axis, N for one with them, and the cube root of N for a cubic class. By index 64 P1̅ keeps 176874 sublattices and Pm3̅m 9.

In space the sublattices a group keeps grow at six speeds

The plane's seventeen groups kept their sublattices at four rates. Counted to index sixty-four for all seventy-three arithmetic classes, space has six: the cube of the index, its square, the index times two logarithms, the index times one, the index, and its cube root. Four systems keep one rate each. The tetragonal, hexagonal and rhombohedral classes are cut in two, by whether anything turns their axis over. And the richer groups' lead lasts much longer than in the plane, because they carry up to five hundred and twelve subgroups on a single lattice.

space-groups · Isomorphic subgroups Where the two crossings the census could not reach fall. The ratio of cumulative subgroup counts with the full point group, poorer class over richer, against the largest index. P1̅ passes Pmmm at 20, as the census to sixty-four found. P2/m passes Pmmm at index 81 and stays ahead to 1,023. P4/m passes P4/mmm at index 12,104 and stays ahead to 65,536. Every count comes from the values at prime powers, multiplied.

The last two crossings fall at eighty-one and twelve thousand

A census to index sixty-four found that P2/m and P4/m must eventually overtake Pmmm and P4/mmm in the number of subgroups they keep of themselves, and could not see either happen. The count turns out to be multiplicative: a sublattice splits into pieces at the primes dividing its index, and so does the cohomology on it, which lives only at two. Every odd prime is then a closed form, two is a short computation, and the crossings fall at index 81 and at index 12,104.

space-groups · Isomorphic subgroups Discriminant −23 at the prime 2: the crater and three levels down. The lattices of discriminant minus 23 and of 4, 16 and 64 times that, joined by index-two sublattices. Three lattices form the crater, a cycle in which each has two neighbours of its own discriminant. Each crater lattice has one sublattice going down, and every lattice below has one edge up and two down. The levels hold 3, 3, 6, 12 lattices.

One way up and p ways down

Every plane lattice has exactly p + 1 sublattices of prime index p. Restrict an integer form to each and the discriminant can do only three things, so the lattices become the vertices of a graph with a definite shape: a ring of lattices at the top, and below it a tree in which every lattice has one way up and p ways down. Whether the ring exists at all is decided by how p factors, which is why the square lattice has two copies of itself at index five and none at index three.

lattices · Moduli One tile, two lattices. The smallest polyomino on exactly two lattices with no slide between them, of 5 cells. On the left its copies sit on one lattice and on the right on another, and neither tiling can be turned into the other by moving rows.

One tile, two lattices, and a row that slides

A crystal chooses its lattice, and it is natural to think a tile does too. Among all polyominoes to thirteen cells, more than five hundred that are not rectangles lie on more than one lattice, and some on seven. They fall into at most two families, and a family is a row of copies that can slide against the next row, which is exactly what makes polytypes possible in a real crystal. A tile with a prime number of cells has no such row unless it is a bar, and so it lies on at most two lattices.

classification · Isohedral

Named alongside it

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

IndexIsomorphic subgroupGaussian integerHolohedryHermite normal formMaximal subgroupSuperstructureBravais latticeCentringCountingSubgroupSum of two squares

All concepts