Crystallography & Symmetry
patterns derived from their groups
Concept

Lattice translation — where it appears

A translation that is one of the pattern's own repeats, as opposed to the fractional slide that a screw or a glide carries. Everything on this site is computed modulo these, which is what makes a group with infinitely many elements a finite object to work with.

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

The 4₁ screw axis. 1 of the eleven screw axes a lattice permits, each drawn as the helix it is: 4₁. A turn of 2π/n followed by an advance of m/n of the repeat, so that n turns land exactly m cells along. 0 of those drawn are its own mirror image; the rest come in left- and right-handed pairs.

Turning and climbing at once

A rotation has a fixed point and a screw has none. That sounds like a small difference and it is the reason a space group is not a point group with extra letters, the reason two hundred and thirty is not seventy-three, and the reason a helix can be a crystal.

space-groups · Screws and glides The five kinds of glide plane. All five glide letters: a, sliding by a/2; b, sliding by b/2; c, sliding by c/2; n, sliding by (a+b)/2, (b+c)/2 or (a+c)/2; d, sliding by (a+b)/4, (b+c)/4 or (a+c)/4. 3 of those drawn are axial — the slide is half of a single cell vector lying in the plane. A glide's square is a pure translation, so its slide can only be half of a lattice vector, and the quarter-cell d glide exists only where centring has already made the half-diagonal a lattice vector.

Reflect, then slide by half of something

A glide's slide must double to a lattice vector, which leaves three candidates in any plane and a fourth that exists only where centring has already made a half-diagonal into a lattice vector. Five letters, and the fifth is the one the enumeration explains.

space-groups · Screws and glides p4: the map comes back. p4 written on two bases related by an integer matrix of determinant one, and about two origins. The two descriptions share no coordinate; they are the same group. The matrix and the origin shift were then recovered from the two operation sets alone — which is what Bieberbach's theorem promises, carried out as a search over the integer matrices and the origins the lattice permits, and checked by applying what was found.

The same group means the same pattern

Seventeen patterns is not the same statement as seventeen groups. Two patterns that look nothing alike could in principle have symmetry groups that are abstractly the same, and then the classification would be a classification of drawings. Bieberbach's theorem says they cannot — and the affine map that proves it can be recovered from the two operation sets alone.

restriction · Finiteness A circuit that closes on the wrong point: (1, 0). A square lattice with one extra half-column, drawn as a graph: the rows above the core have one more site than the rows below, and the core is the site at the end of the extra column. The path is 4 steps east, 4 north, 4 west and 4 south — the same number out as back — and it ends one lattice vector from where it started. Every one of the 12 circuits in the survey that goes round the core fails by that vector, and all 10 that miss it close exactly.

The circuit that does not close

A defect in a crystal is usually introduced as a picture — an extra half-row of atoms, a wedge taken out. What makes a defect a crystallographic object rather than a drawing is a closure failure: walk a closed circuit through the lattice and come back to the wrong point, by an amount the lattice itself decides.

applied · Defects Four of the seventeen have a centre, and they are the four with no rotation. For each plane group: the order of its point group, how many of its operations are rotations, the lattice vectors every operation of the point group fixes, and the centre those vectors make. A central element must commute with every translation, which forces its linear part to be the identity — so the centre is a group of translations, and a translation is central exactly when the point group leaves it alone. A rotation leaves nothing alone but zero.

The four groups with a centre

An element that commutes with everything has to commute with every translation, and that forces its linear part to be the identity. So the centre of a plane group is a group of translations — the ones its point group leaves alone — and a rotation leaves nothing alone but zero. Four of the seventeen have a centre and thirteen have nothing at all.

operations · Composition Two turns and their undoing leave a slide. A turn g by 90° about the point c and a turn h by 60° about d. The marked point p is carried back 60° about d, back 90° about c, forward 60° about d and forward 90° about c, and does not return: it arrives displaced by a vector of length 2.371, which is 4·sin 45°·sin 30°·|c − d|. Two other points put through the same four motions move by the same vector, drawn beside them, because the commutator g h g⁻¹ h⁻¹ of two rotations of the plane is a translation — (I − A)(I − B)(c − d) exactly — whatever the angles and the centres.

What forces a lattice

Every enumeration here starts from a lattice of translations, and the lattice is usually taken as given. It need not be. A group of motions that is discrete, and leaves no point far from an orbit, has to contain one — in the plane by an argument four lines long, each line a picture, and in space by an inequality whose threshold turns out to be the six-fold rotation.

restriction · Finiteness p2's symmetries, sorted into classes by the group itself. A pattern with the symmetry of p2 over 2 by 2 cells, with its rotation centres and mirror lines marked in the International Tables' shapes and coloured by conjugacy class in the infinite group: two marks share a colour exactly when some operation of the group carries one element onto the other. Where rotations of several orders share a centre, the mark is the highest order's and so is its colour. Glides are not drawn. Classes counted: half-turns: 1 in the quotient, 4 in the group.

Two mirrors a coset cannot tell apart

Taken modulo its lattice a wallpaper group is finite, and its conjugacy classes are easy to list. But a coset holds every mirror of one direction at once, and the group itself keeps apart mirrors the list merges: pm has two classes of mirror, p2 four classes of half-turn, p3 six classes of rotation. Deciding which is which is Dehn's conjugacy problem, and for these groups it comes down to whether one vector lies in one lattice.

operations · What symmetry is Two dimensions to be ambiguous in, and one. Why a plane can carry two operations and a line cannot, side by side. Two reflections sharing a plane differ by a translation lying in that plane, and their slides are vectors in the plane — a two-dimensional space, in which a centring vector need not be a multiple of the slide. So the two slides can be genuinely different glides, b against c, and in 1992 the International Tables invented the letter e for the case where neither has a claim. Two rotations sharing an axis differ by a translation along that axis, because anything across it would move the line; their intrinsic parts are vectors along the line, a one-dimensional space in which every lattice vector is a whole multiple of the shortest. So the two differ by a whole number of repeats and are the same screw. The plane has one dimension of freedom left over and the line has none.

A line carries one screw

A plane can hold two glide operations at once, and in 1992 the International Tables invented a letter for the case where neither has a claim. The same question put to an axis has the opposite answer: across 3,388 axes, not one line carries two — and the reason is that a slide has two dimensions to be ambiguous in and an intrinsic translation has one.

space-groups · Screws and glides Three conditions, and a near-miss for each. Zassenhaus's characterisation asks a group for a normal subgroup that is free abelian of finite rank, of finite index, and maximal among the group's abelian subgroups. Four groups against those three clauses. The free group on two letters has no non-trivial abelian normal subgroup at all; the discrete Heisenberg group has one that is free abelian of rank two and maximal abelian, and its index is infinite; ℤ² × ℤ/2 has a free abelian normal subgroup of index two, and the maximal one has torsion in it. Each fails a different clause, which is what shows no clause is redundant. The infinite dihedral group passes and is crystallographic in one dimension.

Which groups a crystal could have

Bieberbach's theorem is a statement about a group acting: discrete, no point far from an orbit. Zassenhaus turned it round into a statement a group can satisfy on its own — a maximal abelian normal subgroup, free of finite rank, of finite index — and each of those three clauses is kept out of redundancy by a group that fails it and nothing else.

restriction · Finiteness An orbit on a parabola, discrete and cocompact. The images of the origin under the group generated by two commuting affine maps of the plane: A slides one step along x and lifts y by the x it started at plus a half, and B is the translation by one in y. The images are the points with whole-number first coordinate and second coordinate a whole number above half the square of it, so the large dots lie on the dashed parabola and the small ones are the rest of the orbit. No two distinct images come closer than 1.000, and no point of the square between the axes lies farther than 0.610 from one — so the action is discrete and its quotient is compact, which is exactly what Bieberbach's first theorem asks for.

Straight lines, and no distances

Every finiteness met so far rests on the motions preserving a metric, because the trick that produces one is an average and an average needs something to average over. Keep the straight lines and drop the distances, and Bieberbach's first theorem is false in the plane — by an example two lines long, whose group is the plane's own translations and whose translations have rank one.

restriction · Finiteness The closure is a lattice exactly when the orders allow one. Twelve pairs of rotation orders, with a centre of each order placed one unit apart and the group they generate closed out to words of length 6. The linear parts reached are exactly the least common multiple of the two orders, every time — two rotations generate rotations, and the angles they generate are the multiples of the smaller of two fractions of a turn. A lattice admits rotations of order one, two, three, four and six and no others, so the closure can be a plane group exactly when that multiple is one of those five. The pairs where it is not are the pairs where the translations keep getting shorter.

Closing the plane from two centres

Put two rotation centres down and close under composition: the result is a plane group or is not discrete, and nothing in between. What decides it is the least common multiple of the two orders, because two rotations generate rotations and the angles add — so the crystallographic restriction arrives as a condition on a closure rather than as one on a lattice.

operations · Composition The turns that keep the join discrete. Two copies of p4 on one square lattice, one turned against the other, with the shortest translation their union generates. At a turn whose cosine and sine are both rational the translations are a lattice, and its shortest vector is one over the square root of Σ — where Σ is the odd part of p² + q² for the rational point (p, q) — which the measurement reproduces to six places at every one tried. At a whole number of degrees other than a multiple of ninety there is no such point, and the search finds shorter translations the further it runs.

Two patterns laid over one another

Compose two plane groups rather than two operations. The group generated by both is one of the seventeen or is not discrete at all, with nothing between — and it takes two conditions, one on the rotation orders and one on the turn between the lattices. The turns that work have rational cosines, which by a theorem of Niven's means none of them is a whole number of degrees.

operations · Composition

Named alongside it

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

DiscretenessFixed pointTranslation groupClosureCrystallographic restrictionEnumerationFinite groupIntrinsic translationNormal subgroupCentringClassificationCommutator

All concepts