Crystallography & Symmetry
patterns derived from their groups
Theme

The theme: Exactly this many — page 6

Seven friezes, seventeen wallpapers, fourteen lattices, two hundred and thirty space groups. Each number is a theorem with a finite proof, and the word that matters in every one of them is 'exactly'.
a lattice triangle: 1 inside, 6 on the edge, area 3. a lattice triangle on its lattice, with the 1 points strictly inside it in the first colour and the 6 points on its boundary in the measured colour. Pick's theorem says the area is the interior count plus half the boundary count less one, which is 1 + 6/2 − 1 = 3; the shoelace formula on the same integer coordinates gives twice the area as 6. The two agree, and both sides are integers, so the check has no tolerance in it. The theorem holds for a non-convex polygon and a polygon with no interior point alike, neither of which the usual triangle-and-square picture makes obvious. Lattices

How many points a shape holds

Draw a polygon on a lattice, count the points inside, then double the polygon and count again. The counts are not approximately a polynomial in the scale — they are one, exactly, with the area as its leading coefficient and a constant term of one for every polygon there is.

 18 extension classes, 17 groups. Each of the thirteen arithmetic classes with the number of ways translations may be attached to it — its cohomology — the shape of that group, and how many distinct plane groups the classes come to once the changes of basis that are mere relabellings are quotiented out. The two columns differ in exactly one row, 2mmp, where four extension classes are three groups because two of them are the same group with the axes swapped. No lattice is drawn anywhere in this computation. The classification

Seventeen, without a picture

Every other count of the plane groups has a plane in it — a pattern generated, a domain folded, an orbifold's curvature spent. The same seventeen come out of pure algebra: attach translations to a point group, keep the assignments that close, throw away the ones that differ only by where the origin was put, and add up over the thirteen arithmetic classes.

 p4m: 10 of 36 wavevectors have to be visited. The Brillouin zone of the square lattice with a grid of 36 wavevectors on it, of which 10 are drawn solid: one per star, which is everything a calculation over a p4m-symmetric operator has to visit. The share is 27.8 per cent against the 12.5 per cent that the order of the point group would give, and it is larger for a reason worth naming — the wavevectors on the boundary of the wedge have short stars, so they are over-counted by any argument that only divides by the group order. The identity that is checked is that the star sizes add to the whole grid. Operations

The domain in reciprocal space

A fundamental domain is the piece of a pattern the group repeats, and this collection has drawn several. The same idea in reciprocal space is what makes a calculation over a crystal affordable — and its share of the zone is larger than one part in the group's order, for a reason worth measuring.

 Two structures on 8 sites with the same vectors. Two arrangements of 4 atoms on a ring of 8 positions. They are not the same arrangement — no rotation of the ring and no reflection carries one onto the other — and every interatomic vector occurs the same number of times in both. The bars below are the shared vector counts, which is the Patterson function of each: the tall one at the origin is the atom count and carries no information, and everything else is what a diffraction experiment measures. Their diffraction patterns are identical in every intensity, so no measurement of intensities, at any resolution, distinguishes them. How it is known

Two structures, one Patterson

Eight arrangements of four atoms on a ring of eight sites, and only seven distinct sets of interatomic vectors between them. Two of the arrangements are genuinely different and no measurement of intensities can tell them apart — at any resolution, for ever.

 p = 2: 1, 3, 6, 12, 24 vertices at each distance. Every sublattice of index a power of 2, up to scale, joined when one contains the other with index 2. From the whole lattice there are 3 ways down, because a sublattice of index 2 is a line over the field of 2 elements and there are 3 of those; from each of those there are 3 again, one of which is the way back. So the counts are 1, 3, 6, 12, 24 — that is (2 + 1)·2^(k−1) — and the graph has no cycles, both of which are checked on every vertex whose whole neighbourhood was grown rather than read off the picture. The object is the Bruhat–Tits tree of the p-adic plane, and it is what the set of sublattices is rather than how many there are. Lattices

Every way down, and no way round

There are as many sublattices of a given index as the index has divisors, and counting them is where that essay stopped. This one asks what they are to each other, and the answer is a shape: an infinite tree in which every vertex has exactly p + 1 neighbours and no path ever comes back.

 15 classes may rotate light, 11 of them chiral. A crystal is chiral when its point group contains no improper operation, and there are 11 such classes. A crystal may rotate the plane of polarisation when its class permits a non-zero gyration tensor, and there are 15. The four in the difference — 4̅, m, 4̅2m, mm2 — are achiral and may still rotate light, which is why the two words are not synonyms. In each of the four, symmetry forces the tensor to be traceless, so the rotation changes sign with direction and cancels in any average over directions. What symmetry decides

Fifteen may rotate light, and eleven are chiral

Optical rotation and handedness are treated as the same thing and are not. Eleven crystal classes are chiral; fifteen permit a crystal to rotate the plane of polarisation; and the four in between are the reason quartz and sodium chlorate are the examples everybody uses.

 Order 5: 32,768 arrangements. An Aztec diamond of order 5, with every possible dimer drawn at an opacity equal to the fraction of arrangements it appears in — a probability computed exactly, by counting the arrangements of the region with that dimer's two sites removed, rather than sampled. The four corners come out nearly certain and the middle nearly even, with a circle between them. The most certain dimer here occurs in 0.97 of the arrangements, which is 1 − 2⁻5 exactly, so nothing is frozen at any finite size. Order without repetition

How many arrangements one rule allows

Every count in this collection so far has been a count of symmetries, or of orbits under one. Here is a different count: the arrangements a purely local rule permits on a fixed lattice, with no symmetry quotient anywhere in it. The answers are enormous, they are exact, and the useful quantity is not the number but its growth per site.

 8 tiles over 5 colours. Wang tiles: unit squares with a colour on each edge, which may be laid side by side only where the touching edges agree, and which may never be turned or reflected. That last restriction is what makes them a computational object rather than a jigsaw — an edge colour is a symbol passed from one tile to its neighbour, and turning a tile would let a symbol change direction. The set here was generated from a stated seed. The classification

Nothing decides whether a set of tiles tiles the plane

This collection rests on decidability — generate a pattern, forget the group, rediscover it, compare. One question in the same subject has no procedure at all: given a finite set of tiles, whether they cover the plane cannot be decided by any algorithm whatever. What can be done is two half-searches, and measuring what they leave behind.

 orders 5 and 7 reach a site of symmetry 1 and no more. A molecule whose only symmetry is one n-fold axis, and the highest site symmetry it may occupy in any of the 45 space groups this site builds. The site's symmetry has to be a subgroup of the molecule's, so the site's order must divide n and the site group must be cyclic. Orders 1, 2, 3, 4 and 6 reach a site of their own order. Orders 5 and 7 reach one, because no site symmetry in any space group contains an operation of order five or seven — the orders available are 1, 2, 3, 4, 6, computed by asking every operation of every group whether it moves a point. A five-fold molecule keeps its axis; the crystal simply has no use for it. What a lattice forbids

What a molecule gives up to sit in a crystal

A molecule brings its own symmetry. A crystal offers sites with symmetries of their own, and the two have to be compatible — the site's symmetry must be a subgroup of the molecule's. So a molecule may always keep more than its site offers, and a molecule with a five-fold axis may sit only where the crystal offers nothing at all.

 Where a homometric pair comes from. A set that factors as a sumset gives its own partner. If every point of A is a sum b + c with b in B and c in C, and every sum arises once, then reversing C produces a different set with the same vectors — because reversing a factor and reversing its conjugate cancel in the product that the vector set is. Both factors must be asymmetric, which is the constraint that decides where the construction can be used: a two-point set is its own reflection up to a translation, so the smallest useful factorisation is three points by three points, and the smallest structure it builds has nine atoms. How it is known

Where the pairs come from

A structure whose atoms are the sums of two smaller sets has a partner: reverse one factor and the interatomic vectors do not notice. The construction is Patterson's own, it explains why homometry exists, and the smallest structure it can build has nine atoms for a reason worth following.

 At which indices a group contains a copy of itself. A filled circle where the group has a subgroup of that index which is the same plane group again. The groups with no rotation past a half-turn take every index — the lattice can be stretched along one direction by any factor. The four-fold groups take the sums of two squares and the three- and six-fold groups take the Loeschian numbers, because a sublattice invariant under a quarter or a third of a turn is an ideal in the Gaussian or Eisenstein integers and its index is a norm. The groups with mirrors take fewer still, and p4g takes only the squares. Into space

The same group in a bigger cell

A subgroup usually gives something up. An isomorphic subgroup gives up nothing but scale — the same plane group again, on a coarser lattice — and the indices at which that is possible turn out to be the values of a quadratic form.

 Sums of two squares, arriving as superstructures. Which indices admit a sublattice of the same shape as the square lattice, drawn as a bar per index whose height is how many there are. The pattern is not a pattern about lattices at all: an index works exactly when it is a sum of two squares, because a similar sublattice of the square lattice is multiplication by a Gaussian integer and its index is that integer's norm. The indices that work up to 30 are 1, 2, 4, 5, 8, 9, 10, 13, 16, 17, 18, 20, 25, 26, 29, and the same list is produced here a second time by factorising rather than by searching, with the two required to agree. Lattices

The sublattices that are the same shape

Thinning a lattice usually changes its shape. Sometimes it does not: the sublattice is the parent rotated and scaled, and a drawing of it alone would be a drawing of the parent. Which indices allow it turns out to be a question Fermat answered in 1640.

 p4m: which distortions the atoms of each position can make. Every Wyckoff position of p4m, with the number of independent displacement patterns of each symmetry its atoms supply. A zero is a distortion those atoms cannot make however their amplitudes are chosen — an atom pinned at a rotation centre cannot move in a way that keeps less symmetry than the centre has. The row sums, weighted by the dimensions along the top, come to twice the number of atoms in the cell, which is the check that nothing has been lost. The last column is the number of free coordinates the position has, and it equals the multiplicity of the identity representation in that row: a displacement that keeps every symmetry is exactly a move of the position within its own Wyckoff set. Operations

Which modes a site can carry

An atom on a mirror cannot move in a way that breaks the mirror while its images move with it: the displacements of a Wyckoff orbit carry a representation, and some of its pieces have multiplicity zero. The count of those pieces is a character, and the one that breaks nothing is the position's own freedom.

 Y-pentomino: A B C D E F, with 6 arcs. The boundary of the Y-pentomino cut into six arcs. A runs from one corner to another and D is the same arc traversed backwards, so D is a translate of A and the translation is (3, 1) cells. Each of B, C, E and F is carried onto itself by the half turn about its own midpoint, and those midpoints are the four marked dots — That is Conway's criterion, and a shape meeting it tiles the plane by translations and half turns. The classification

A tiling of the whole plane, decided on one tile's edge

Whether a shape tiles the plane is a question about an infinite object, and there is no procedure that answers it. There is a procedure that answers it *sometimes*, and it reads nothing but the shape's own boundary — a closed path of a few dozen steps, cut into six arcs. When the cut exists the tiling exists, and the cut names the group that makes it.

 Ten ways for space to be flat. The thirteen groups, with each mirror-image pair counted once, because a shape and its mirror image are the same shape. 3 of the ten arrive that way — the three-fold, four-fold and six-fold screws, which are the enantiomorphic pairs this collection already counts among the two hundred and thirty. Six of the ten are orientable and four are one-sided. Into space

Ten ways for space to be flat

Thirteen of the two hundred and thirty space groups hold no point still, and folding space along one of them gives a shape with no curvature anywhere. There are ten such shapes, not thirteen, and the difference is the same eleven pairs that separate 230 from 219.

 Arrangements per site, falling towards the exact value. The number of configurations of an L × L torus obeying the ice rule, taken to the power of one over the number of sites. The largest computed here is 4,484,823,396 configurations on a 7 × 7 torus. The values fall towards Lieb's exact 1.54 from above, and every one of them is above Pauling's estimate of 1.5 — which undercounts, because it treats the vertices as independent and they are not. Order without repetition

The arrangements a crystal keeps at absolute zero

Ice has a residual entropy, and the number a calorimeter measures is the logarithm of a count of arrangements. Pauling's one-line estimate of that count is out by two and a half per cent; the exact count in two dimensions is available, falls towards its limit from above, and the whole disorder is invisible to a diffraction experiment, which sees only the average.

 Equilibrium and growth are different shapes. Two predictions for the habit of the same cubic crystal, computed through the same intersection of half-spaces. The equilibrium shape puts each face at a distance proportional to its surface energy, which is Wulff's construction; the growth shape puts it at a distance proportional to its growth rate, taken here from this site's own spacing rule. They differ — the equilibrium shape carries {111}, {110}, {100} and the growth shape {100} — and the difference is between two rules rather than between two pieces of code. A crystal on a bench has grown; a crystal annealed long enough has relaxed; the two look different and neither picture is wrong. Symmetry at work

The fast faces are the ones that vanish

A crystal has two predicted shapes and they are not the same. One minimises surface energy and is what a crystal settles into; the other is what growth leaves behind, and in it a face that grows quickly grows itself out of existence.

 Thirty-two classes, eighteen groups. Every abstract group the thirty-two crystal classes realise, with the classes that realise it. 8 of the eighteen carry more than one class, and the largest collision is the four hexagonal classes that are all the dihedral group of order twelve. Nothing here is looked up: two classes are put in the same row when a search over images of a generating set finds a bijection preserving multiplication, and the search is finite because a generating set is small and the elements it may map to are the ones of the same order. What symmetry decides

Thirty-two classes, eighteen groups

An inversion centre, a mirror and a two-fold rotation are three of the most different things a crystal can have, and they are the same group of order two. Forget the matrices and keep the multiplication table, and the thirty-two classes collapse to eighteen.

 7 cells explain the lines; one of them is right. A line list from a face-centred cubic cell of 5.64 Å, with a realistic error added, handed to a sweep over every cubic cell between 2 and 12 Å in all three centrings. 7 distinct cells explain every line within the tolerance, and each is a genuine solution rather than a numerical accident. The true cell comes top by de Wolff's figure of merit — the last Q over twice the mean discrepancy times the number of lines the candidate says should have been visible — which punishes a candidate for predicting lines nobody saw. That is the whole of what makes indexing decidable in practice: not the arithmetic, which has many answers, but a criterion for preferring one. Symmetry at work

Indexing a powder pattern

A powder pattern is a list of numbers and a cell is six. Getting the second from the first is the first step of every powder study and the one that fails — because the arithmetic has many answers, and choosing between them is a ranking rather than a deduction.

 A lattice placed in the region, and its distance to each special shape. The modular region, with the two special points marked — the square lattice at the top of the arc and the hexagonal one at its corner — and a third lattice placed by reducing its form. The distances are hyperbolic rather than Euclidean, and the choice is forced rather than aesthetic: a distance between lattice shapes has to be unchanged by every change of basis, and the hyperbolic metric is the one defined by being invariant under exactly that group. Writing the same lattice down on three other bases and measuring again gives the same two numbers to the last digit. Lattices

How far one lattice is from another

A crystal that is nearly hexagonal twins where an exactly hexagonal one would not, and 'nearly' does real work in that sentence. Giving it a number needs a distance that no change of basis can move — which forces the geometry to be hyperbolic rather than flat.

 anisohedral: 2 orbits of congruent tiles. A tiling of the plane by 8 copies of one shape per cell of a lattice of index 64, drawn 1 cell across and 8 up, and coloured by which orbit of the tiling's own symmetry group each tile belongs to. The group has 4 operations per cell and 2 orbits: every tile is congruent to every other, and no motion of the whole pattern carries a tile of one colour to a tile of another. Congruence is a fact about the shapes; an orbit is a fact about the pattern, and they are different facts. The classification

One shape, two kinds of tile

A tiling by copies of a single shape looks as though it must be homogeneous — every tile is congruent to every other, so what could distinguish them? The symmetry group can. There are shapes that tile the plane and admit no tiling whose group carries any tile to any other, and the smallest of them has eight cells.

 The invariant degrees exist for every n; the lattice permits five of them. The reflection group with an n-fold rotation has an invariant ring generated in degrees 2 and n, for every n whatever — the dimensions on the right are counted by pairing monomials in complex coordinates, which needs no matrix and therefore no lattice. Five of these groups can be written in integer matrices, and those five are named in the middle column; the rest cannot, because a lattice has no five-fold or seven-fold rotation. The crystallographic restriction is usually a statement about traces of matrices. Here it is the statement that only five of these invariant rings belong to a crystal, and the two arguments have nothing in common but their answer. What a lattice forbids

The degrees that name the restriction

The reflection group with an n-fold rotation has invariants of degrees 2 and n — for every n, with no lattice anywhere in the argument. Which of those groups a crystal may have is then the only question left, and its answer is the crystallographic restriction arriving from a direction nobody points it from.

 p4m: 4 and 4. The standard motif — three points in no particular arrangement — repeated by p4m, with each copy coloured by the sign of the area of the triangle it makes. 4 copies have one sign and 4 the other, because the group contains an operation that reverses orientation. A structure built from one enantiomer cannot sit here: the group would put its mirror image in the same crystal. The colours were computed from the coordinates rather than assigned. Into space

The groups a single hand may sit in

A protein is built from one enantiomer of every amino acid, and a crystal of it contains nothing else. That single fact deletes most of the classification at a stroke: any operation reversing orientation would put the other hand in the same crystal. The criterion is one line of arithmetic, and in the plane the enumeration is complete — five of the seventeen.

 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. What symmetry decides

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.

All themes · All essays