Crystallography & Symmetry
patterns derived from their groups
Concept

Closure — where it appears

Composing the operations of a set until nothing new appears, which is how a group is built from generators. What a closure returns holding that it was never given is the whole content of several classifications on this site, including the collapse of sixteen frieze candidates onto seven.

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

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 The symmetry elements of Ccmm. Space group Ccmm, number 63, projected down c on a C-centred orthorhombic cell. The symmetry elements drawn: 4 2-fold rotation axes, 6 glide planes, 12 2₁ screw axes, 2 mirror planes, 8 inversion centres. 2 kind(s) of element in this group have no line or mark in a projection down c — an axis at an angle to the page, or a plane lying parallel to it — and are not in the picture.

The operations nobody put in

A group is not a list of generators. Compose two of them and something arrives that neither contained — a screw where there were only mirrors, a glide where there was only a mirror and a centring vector — and in three dimensions most of a group's operations get there this way.

space-groups · Screws and glides Why seven — all 16 candidates. Every subset of the 4 extras available on a strip, closed under composition and named from the operations that come out. 16 candidates give 7 distinct groups: 9 of them generate operations they were not given and land on a group already listed.

Why sixteen become seven

Four extra operations give sixteen combinations and seven groups. The nine that vanish are not cases anybody forgot — each one comes back from the closure holding something it was never given, and one of them changes the lattice underneath it.

classification · Friezes 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 5 units of 70.53°: 7.36° left. 5 tetrahedral units of face-centred cubic metal, each the mirror image of its neighbour in a {111} plane, arranged about a common ⟨110⟩ edge. The angle between two such planes is arccos(1/3) = 70.53°, computed from the plane normals rather than quoted, and 5 of them come to 352.64°. The shaded sector is what is left over: 7.36°, or 2.04 per cent of a full turn, which must be taken up by strain, by a gap, or by a defect along the axis.

Five copies, and the gap they leave

Gold, silver and silicon grow particles with a five-fold axis down the middle, out of a lattice that forbids one. Nothing is violated: five tetrahedral pieces of ordinary face-centred metal, each the mirror image of its neighbour, come to three hundred and fifty-two and a half degrees rather than three hundred and sixty — and the seven degrees left over have to go somewhere.

restriction · Local symmetry P2₁/c from 27 marks. The marks of P2₁/c's plan, counted by kind, and what they rebuild to. Each mark is reduced to what a reader can see and handed to a closure with the matrices withheld: an axis gives its direction, its position and how far one turn advances along it; a plane gives its normal, its position and its slide. The lattice supplies the candidate matrices, the closure supplies the rest, and what comes back is the group — 4 operations against 4, with nothing missing and nothing extra.

The plan contains the group

A space-group diagram has always been treated here as a picture of the group. It is more than that: hand back the marks alone — no matrices, no operations, not even the centring — and the group comes out exactly, forty-five times out of forty-five.

space-groups · Space groups The seven groups a uniform field can have. Five of them have an axis and two do not. A cone has every rotation about its axis and mirrors containing it; a cylinder adds the mirror across the axis and the two-folds that go with it; turning either one destroys the mirrors that would reverse the turn. The sphere and the sphere made of something with a handedness are the two with no axis to speak of. Each drawing is the definition: the group is the set of motions leaving the picture unchanged.

The seven groups a field can have

Every group in this collection so far has been finite, because a lattice forbids the alternatives. A uniform field has no lattice: rotate it about its own axis through any angle at all and nothing has changed. There are exactly seven such groups, and they come out of the same closure argument that turns sixteen frieze candidates into seven.

point-groups · Curie 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 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.

CompositionCrystallographic restrictionLattice translationCentringCosetDisclinationDiscretenessEnumerationGeneratorsGlide planeLocal symmetryPlane group

All concepts