Crystallography & Symmetry
patterns derived from their groups
Concept

Arithmetic class — where it appears

A point group together with the lattice type it acts on, taken up to a change of integer basis. There are seventy-three in space and thirteen in the plane. It is the unit the space groups are built from, because point operations and translations have to be compatible as integer matrices rather than merely as shapes.

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

21 superspace groups in (2+1) dimensions, from 31 names. The whole count, in the order it is built. Thirteen arithmetic classes of the plane; six of them admit an incommensurate wavevector; those six give ten sign assignments; each assignment contributes the plane cohomology times the internal cohomology, which is thirty-one names; and the names are merged by the changes of basis that are relabellings — a change of the plane basis, which moves the sign assignment and the internal cocycle with it, and the choice of q against −q. The last row is what the count would be if the two factors were quotiented separately, which over-counts because the merge is not independent of the internal part.

Superspace groups in the plane

A modulated crystal has no space group, and in a space of one more dimension it has one. Counting them in the plane is the seventeen's own extension arithmetic with a third coordinate on which the point group acts by a sign — and the sign has to be plus or minus exactly, which kills the three-fold, four-fold and six-fold classes before a single extension is counted.

aperiodic · Modulation 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 Three rotations of order twelve, and one twelve-fold. Three integer 4 × 4 matrices of order twelve, one from each rational class of that order on a four-dimensional lattice. A four-dimensional rotation turns two perpendicular planes, and each plane is drawn as a dial: a point, its images, and the path the operation takes round them. Φ₁₂ turns its planes by one twelfth and five twelfths of a turn, so a point runs round twelve positions. Φ₃ ⊕ Φ₄ turns one plane by a third and the other by a quarter, and Φ₄ ⊕ Φ₆ by a quarter and a sixth; each has order twelve because twelve is the least common multiple, and neither has a plane with twelve positions in it.

Three rotations of order twelve

A four-dimensional lattice can be carried onto itself by three different integer matrices of order twelve, and only one of them turns anything by a twelfth of a turn. The totient that is usually said to decide which orders a dimension permits decides something else: which angles. The orders are decided by a sum over blocks, the two lists part company at six dimensions, and space already has an operation whose order is not its angle.

restriction · Restriction Six matrices and eight: a monoclinic normaliser modulo two. For P2/m and C2/m, every 3 × 3 matrix over the field of two elements that preserves the reductions of the two eigen-sublattices of the class's two-fold or mirror — six on the primitive lattice and eight on the centred one — each drawn as a tile of nine squares filled where the entry is one. The whole infinite normaliser reduces into this set, and a dot under each tile marks that some normaliser element with entries −1, 0 and 1 reduces to it. Every tile is realised, and the same holds in all six monoclinic classes.

The normaliser only acts modulo two

The space groups were counted as orbits of a small, finite set of changes of basis — only those with entries −1, 0 and 1 — out of normalisers that are infinite in the monoclinic classes. That the counts came out right was evidence, not proof. It becomes proof in two steps. A missing change of basis can only leave the count too high, never too low, so the published totals already force every class. And in the monoclinic classes the infinite normaliser acts on the cohomology only through its reduction modulo two, where the small set already reaches everything.

restriction · Finiteness 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 Two hundred and twelve of the 219 are made of their own operations. The 219 affine space-group types divided by which of their own operations generate them, lattice translations included. 110 are generated both by their screws and glides alone and by their rotations, mirrors and inversions alone; 67 by their screws and glides only; 29 by their point operations only; 6 only by the two kinds together; and 7 by nothing they contain — P1, P2, Pm, Pmm2, P4, P3, P6 — which need a translation given outright.

Seven space groups cannot make their own translations

Every space group contains a lattice of translations, and for all but seven of the 219 types those translations are products of the group's other operations. A screw done twice climbs its axis and a glide done twice slides along its plane, so the non-symmorphic operations make lattices by themselves. The seven that cannot are exactly the seven plane groups with no glide, repeated along a line they all fix, and the reason is a difference between a glide line and a glide plane.

space-groups · Screws and glides 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

Named alongside it

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

CohomologyNormaliserPoint groupSpace groupBravais latticeCountingIndexIsomorphic subgroupScrew axisSubgroupSublatticeCentred lattice

All concepts