Crystallography & Symmetry
patterns derived from their groups
Concept

Quotient — where it appears

The set of orbits of a group action, with one point for each. Invariant functions are exactly the functions on it, and whether they separate its points is what makes the invariant ring a faithful description rather than a lossy one.

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

p1 folds into a torus. The cell of p1 with its edges marked as the group joins them: both pairs by a plain translation, both arrows the same way round. Gluing top to bottom gives a tube and gluing its ends gives a torus. Nothing in p1 holds a point still, so the surface has no marked points and its first homology is two copies of the integers.

The two that fold into a surface

Fold a wallpaper pattern along its own symmetries and what is left is usually a shape with corners and edges nobody drew. For two of the seventeen it is a plain surface with no marks on it at all — a torus and a Klein bottle — and which two is decided by a single question asked of every operation.

classification · Flat space Dropping one invariant of 3m makes two orbits agree. Every lattice point within four cells of the origin, coloured by the values a proper subset of 3m's invariants takes on it — the 2 generators with the first one removed, over a window of 4 cells. With the full set, the 25 orbits of the group take 25 distinct sets of values, one each, so the invariants are a complete set of coordinates on the quotient. With one removed, the two circled points — in different orbits, so no operation of the group carries one to the other — take the same values and become indistinguishable. That is the whole content of the statement that a complete set of invariants separates orbits: the completeness is what is doing the work.

An orbit is what the invariants cannot tell apart

Two points of the plane lie in the same orbit of a group exactly when every invariant polynomial takes the same value on both. One direction of that is a definition; the other is a theorem, and it is checked here by comparing every pair of points in a window both ways.

operations · Counting Every subgroup of index two is normal; at index three most are not. For each of the seventeen plane groups, its abelianisation and the number of normal subgroups of each small index against the number of subgroups of that index. The index-two column is complete every time, because the left and right cosets of a subgroup of index two are the same pair of sets. At index three and four the two numbers part, and the gap is what normality costs: a subgroup that is carried to a different subgroup by some operation of the group it sits in.

The quotient each normal subgroup leaves

Two hundred and eighty-one subgroups of index four across the seventeen plane groups, and ninety-seven of them normal. Which ones, and what is left when they are divided out, needs no enumeration at all: below order six every group is abelian, so a normal subgroup of small index is a subgroup of the abelianisation and its quotient is decided by a product of greatest common divisors.

operations · Subgroups Every closed surface, and the two that charge nothing. The same accounting indexed by Euler characteristic rather than by genus. An orientable surface has χ = 2 − 2g, so it only ever occupies an even row; a non-orientable one has χ = 2 − k and occupies every row from one downwards. The odd rows therefore belong to surfaces that cannot be oriented and to nothing else — and the first of them, the projective plane, charges six. Six pentagons is a bill no orientable surface presents.

The surfaces a count by genus skips

A count indexed by genus steps in twelves and lands only on even numbers. A closed surface can have any characteristic at or below two, and the odd ones belong to the surfaces that cannot be oriented — where the projective plane charges six pentagons, a bill no orientable surface ever presents.

restriction · Curvature Whether a rolled sheet ever comes back round. Three plane lattices, each with the same rolling vector C = 3a₁ + a₂ drawn from the origin and the line through the origin perpendicular to it. A translation of the rolled pattern straight up the tube, with no turn, is a lattice vector on that line. The square lattice has one, marked T, and the tube repeats every 10 turns. The general rectangular lattice has none in this direction — only along its cell edges — and the general oblique lattice has none in any direction at all, so its rolled pattern climbs forever without returning to the same angle.

Most sheets roll into a tube that never repeats

Rolling the honeycomb along a lattice vector always gives a tube with a repeat, and that is a property of the honeycomb rather than of rolling. Over the seventeen plane groups, 567 of 1,008 rolling directions give a tube with no translation along its axis at all — and every direction of an oblique pattern is one of them.

restriction · Finite groups Fifty-four of the seventy-five rod groups are a rolled plane pattern. Every rod group, one dot each, grouped by its crystal class. A dot is filled when some plane pattern rolled along some lattice vector has exactly that group, and the 106 crystallographic rollings of the seventeen plane groups fill 54 of them. The eighteen improper classes are full: every one of the 43 achiral rod groups is reached. The nine proper classes are not, and the twenty-one groups named on the right are what is missing — the sixteen whose screw is one of a left- and right-handed pair, and the five bare axes with no climb at all, p1, p112, p3, p4 and p6.

A rolled sheet is never one of a pair

Rolled up along every lattice vector that gives a crystallographic tube, the seventeen plane groups reach fifty-four of the seventy-five rod groups: every achiral one and eleven of the chiral. Not one of the sixteen screws that come in left- and right-handed pairs is among them, and the reason is a single fact about how far a rolled lattice can climb.

restriction · Finite groups 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

Named alongside it

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

AbelianisationEnumerationPlane groupScrew axisChiralityCrystallographic restrictionFree actionHelixOrientabilityPoint groupRod groupCombinatorial curvature

All concepts