Concept

Mirror — where it appears

A reflection thought of as a line or a plane rather than as an operation: the fixed set of the reflection, which every point is carried across. A pattern's mirrors are the places its picture folds onto itself, and a group's are what a fundamental domain is bounded by.

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

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
Four angles, and the integer that picks them. Two roots at angle θ have Cartan integers whose product is 4cos²θ. Both are whole numbers and the product is below four, so it is nought, one, two or three — and each value fixes the angle between the two roots, and with it the angle between the mirrors perpendicular to them. The shaded wedge is the region the pair of mirrors folds the plane onto; the smaller it is, the larger the group they generate.

Four root systems, and the same four rotations

Two mirrors meeting at an angle generate a group. Ask that the group be finite and that a certain pairing between the mirrors come out a whole number, and the angle has only four possible values — from which the rotations that survive are of order two, three, four and six. The crystallographic restriction arrives with no lattice anywhere in the argument.

restriction · Restriction
Mirrors everywhere in a chain with none. Thirty-four tiles of the Fibonacci chain, long tiles L and short tiles S, with an arc over every window of at least 5 tiles that reads the same backwards, drawn from its own centre, and a tick at the centre where its mirror stands. The chain as a whole has no mirror, since no palindrome in it is infinite, yet mirrors of every size stand all along it, the long ones spaced further apart than the short ones, and every one of them a local symmetry the chain lacks globally.

A chain with no mirror has mirrors everywhere

The Fibonacci chain has no mirror: nowhere can it be reflected onto itself. Yet it holds exactly one window of every even length that reads the same backwards and exactly two of every odd length, each recurring all along the chain, and no aperiodic chain that is not of its kind manages that count. Every letter of it creates a palindrome never seen before, and a mirror of any size is never further away than a fixed multiple of that size.

aperiodic · Complexity
Every vertex of a Penrose patch, by the symmetry of what lies within three edges of it. A region of a Penrose rhomb tiling 15.2 edges across. Each vertex is marked by the local group of the patch of radius 3.05 edges about it: a short line along the mirror where that patch has one (98 vertices), a large dot where it has a five-fold centre (7), and a small dot where it has no symmetry at all (118). The mirrors are common and point in the tiling's ten directions; the five-fold centres are rare; nothing has a half-turn.

Five-fold centres stay few, and mirrors do not

The Fibonacci chain has one palindrome of every even length and two of every odd length, for ever. Run the same census on the patches of a Penrose tiling and the plane gives three different answers at once. Patches with a five-fold centre stop at four, however large they are drawn. Patches with a mirror grow in number with their radius, by about fifty for every edge. And no patch wider than a single tile has a half-turn at all. What decides which answer an operation gets is the size of the set it leaves fixed in internal space.

aperiodic · Complexity
Which two kinds of operation make each of the 64 two-generator space groups. For each of the fifteen pairs of kinds of operation, rotation, screw, mirror, glide and rotoinversion (the inversion included), the number of the 64 space-group types generated by two of their own operations that some pair of those kinds generates. Every one of the 960 cases is decided: by a generating pair found, by the pair's linear parts failing to generate the point group, or by a proof in a finite quotient of the group. A screw and a glide make 32 types; two mirrors and a rotation with a mirror make none.

Two mirrors never make a crystal

Sixty-four space groups are generated by two of their own operations. Which two kinds can do it is a finite question, and it has been settled for all sixty-four and all fifteen pairs of kinds. A screw and a glide make thirty-two of them. Two mirrors make none, and neither does a rotation with a mirror, for reasons that need no computation: two operations that undo themselves generate a dihedral group, and an axis and a plane always share a point or a direction. Two plain rotations make six groups, every one of them cubic and without a mirror.

space-groups · Screws and glides
Which three kinds of operation make each of the 93 three-generator space groups. For each of the 35 triples of kinds of operation (rotation, screw, mirror, glide, rotoinversion with the inversion), how many of the 93 space-group types that need three of their own operations some triple of those kinds generates. Of the 3255 cases 978 are generating triples found, 2275 are refuted (by the point group or in a finite quotient) and 2 remain undecided. Three mirrors make none; a screw and two glides make the most, 53.

Three mirrors never make a crystal either

Ninety-three space groups need three of their own operations to generate them, and which three kinds can do it is a finite question with 3,255 cases. All but two are now decided. Three mirrors make none of the ninety-three, as a theorem about reflection groups requires. A rotation with two mirrors makes exactly three, all cubic. Three plain rotations make thirteen, every one without a mirror. One group can be made thirty ways and three can be made only one.

space-groups · Screws and glides
Every square-symmetric grid of wavevectors has a point on a mirror. One cell of the square reciprocal lattice, centred on the zone centre, with the mirror lines of 4mm through it and three grids the four-fold rotation keeps with an offset off the axis. The quarter turn allows that offset at one place only, the second four-fold centre of the grid's own lattice, ringed. On an aligned grid of odd side the rotation fixes a point; on an aligned grid of even side the offset lies on a diagonal mirror; on a grid turned by 45 degrees it lies on an axial mirror. No grid escapes all three.

The offset a quarter turn allows lies on a mirror

A census of sampling grids found free grids for the tetragonal group 4/m and none for 4/mmm, to a hundred and twenty-eight points, with no reason. The reason is two lines long. A quarter turn lets a symmetric grid be offset to exactly one place off its axis, the second four-fold centre of the grid's own lattice, and a square lattice that a mirror keeps can only be aligned with its mirrors or turned by half a right angle. Either way that centre lies on a mirror line.

operations · Fundamental domain

Named alongside it

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

Glide planeDihedral groupFactor complexityGenerating setLocal symmetryRotoinversionScrew axisSohncke groupSpace groupWindowBrillouin zoneCartan integer

All concepts