Crystallography & Symmetry
patterns derived from their groups
Concept

Generators — where it appears

A set of operations from which every other one follows by composition. A plane group is infinite and a handful of its operations rebuilds all of it, with a floor on how few from the abelianisation and a ceiling from an exhaustive search.

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

The wallpaper group p4m. A pattern with the symmetry of p4m, generated by applying the group's 8 operations to an asymmetric motif and repeating across the lattice. The symmetries of the result were then found independently and match the group exactly.

Reading Hermann–Mauguin

p4g looks like a licence plate and is in fact a set of instructions. Half an hour with the rules turns the seventeen from a list to be memorised into a notation that can be read.

classification · Seventeen Doing one after another. Two symmetries of a pattern, and the one that doing both lands on. The third picture is not a new operation drawn to fit — it is the composition, and it was already in the group.

Why it is a group and not a list

The symmetries of a pattern cannot be chosen independently. Do two of them in succession and the result is forced to be a third, which is why there is no eighteenth wallpaper for anybody to invent.

operations · What symmetry is p4g in 4 letters and 8 relations. The presentation of p4g, derived from the group's own operations. The two translations commute; each conjugation relation is read off a column of a matrix; and the point group's relations are corrected by the translation they actually come back as, which is what makes this group an extension rather than a semidirect product. Every relator is evaluated where the group lives and must be the identity, and coset enumeration on the letters alone returns 8, which is the order of the point group.

A group in four letters

Every other essay here describes a symmetry group by what it does to the plane. There is a second description — a handful of letters and the words in them that are required to equal nothing — and it can be counted with no plane anywhere in the computation.

operations · Presentations Every plane group from at most 4 operations. For each group, the fewest operations that generate the whole of it — the point operations and both lattice translations, since a group that does not reach its own translations is a different group. The floor is the abelianisation's number of invariant factors, which no group can beat, and the search is exhaustive over the operations within one cell of the origin. 14 of the seventeen meet their floor, which settles those exactly; the other 3 need more than the abelian argument can see, and p3m1 needs three where its abelianisation is cyclic.

How few operations make a pattern

A plane group is infinite, and a handful of its operations is enough to rebuild all of it. How small a handful is a question with a floor from the abelianisation and a ceiling from an exhaustive search, and for fourteen of the seventeen the two numbers meet.

operations · Presentations The region, and its copies. Words in S and T up to length 4, each carrying the region somewhere else. The copies do not overlap and they do not leave gaps: the upper half-plane is tiled by them, one copy per change of basis. That is the whole content of the claim that reduction picks a canonical basis — every basis of every lattice is in exactly one copy, and reduction is the walk back to the shaded one.

Two moves reach every basis

A lattice has infinitely many bases and reduction picks one. Why it can is a fact about a group with two generators and two relations — and the fundamental region tiles the plane with its own copies, one per basis, which is what makes the walk home finite.

lattices · Moduli

Named alongside it

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

ClosureCosetGroupPresentationRelatorSchreier lemmaAbelianisationBasis reductionCentringChange of basisCompositionContinued fraction

All concepts