The collection

Every essay — page 16

One idea per essay, ordered so that the earlier ones set up the later ones — but nothing here depends on being read in sequence.

Operations

Rotations, mirrors, glides and translations — what a symmetry is, how they compose, and why the composition is a group rather than a list.

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.

7 figures

Into space

Seventeen becomes two hundred and thirty. Screw axes, glide planes, and the translations that no choice of origin can remove — the operations a flat surface has no room for.

What lies between a group and its copies at index 25. For each group, the lattices carried to themselves by its point group that contain a copy of the group at index 25, arranged by index, with lines for containment; each lattice is labelled by the Gaussian or Eisenstein integer that generates it. Copies are the bottom row, drawn large when nothing lies between them and the whole lattice. p4: 3 copies at index 25, 0 maximal, with invariant lattices between of index 5; p4m: 1 copies at index 25, 1 maximal, with invariant lattices between of index none.

The primes a cell can grow by

A plane group contains copies of itself in bigger cells, and the International Tables list the ones that are maximal — the copies nothing else sits between. For p4 they come at 2, at 5, 13, 17 and 29 twice each, and at 9 and 49 once, and the list is the list of primes of the Gaussian integers. Put mirrors on the pattern and the copies at 5 and 13 vanish while 25 becomes maximal: a mirror cannot keep one factor of a prime without the other.

5 figures

Operations

Rotations, mirrors, glides and translations — what a symmetry is, how they compose, and why the composition is a group rather than a list.

Subgroups, the classes a group sorts them into, and the sets its normaliser does. For every plane group, the number of subgroups of index two and of index three, the number of conjugacy classes those fall into under the group's own operations, and the number of sets they fall into under its Euclidean normaliser. Over the seventeen there are 74 subgroups of index two in 74 classes and 56 sets, and 82 of index three in 36 classes and 32 sets. 9 of the thirty-four rows have fewer sets than classes, which is where the tables' "equivalent" entries come from. Counts of subgroups and of classes agree with an independent count from transitive actions on n points.

Three of them, and they are equivalent

The subgroup tables print a count and sometimes a word beside it. Three subgroups of one type may be three copies the group itself shuffles, or three the group holds firmly apart and only a change of description exchanges. p3 has three copies of itself at index three, no operation of p3 moves any of them, and one shift by a third of a cell exchanges all three.

7 figures

Free going down, two conditions going up. The edge between p2 and p4 in the diagram of maximal translationengleiche relations, read in both directions. Downwards it costs nothing: the quarter-turns are discarded and the lattice is exactly the lattice that was there, so every p4 pattern contains a p2 pattern. Upwards the added quarter-turns must carry the lattice onto itself, which forces the cell to have equal edges at a right angle — two conditions on a general oblique cell, which has only two parameters to give. So a p2 structure has a p4 supergroup exactly when its measured cell happens to be square, and the question is about the metric rather than about the group.

Going up costs the cell a parameter

The usual asymmetry — finitely many maximal subgroups below, infinitely many minimal supergroups above — is false in both halves for a plane group. Both directions are infinite and equinumerous index by index. The real asymmetry is that 17 of the 31 edges cost the lattice a parameter going up and nothing going down.

7 figures

How it is known

A crystal's structure is read from the pattern it scatters. The reciprocal lattice, systematic absences, and what an experiment can and cannot see.

The same structure, mapped from intensities and from differences. Left, the ordinary Patterson map of the structure: 14762 interatomic vectors, a continuous field of overlapping peaks, and the two vectors between the anomalous scatterers — circled — nowhere among its strongest. Right, the map from squared Bijvoet differences over the same reflections: two peaks after the origin, and they are those two vectors. The difference map is 7381 times smaller a problem to read.

A map of the atoms that break the law

Feed a Patterson synthesis the differences between the two halves of each Friedel pair instead of the intensities, and the map that comes back holds the vectors between the anomalous scatterers and nothing else. Two atoms among a hundred and twenty-two: 14,762 vectors become two.

7 figures

Into space

Seventeen becomes two hundred and thirty. Screw axes, glide planes, and the translations that no choice of origin can remove — the operations a flat surface has no room for.

One matrix, four rules

Changing the setting of a structure is one matrix and one origin shift — and the cell, the coordinates, the indices and the operations each obey a different rule under it. Three of the four ways of getting it wrong still leave a closed group of the right order, so closure catches none of them.

5 figures

How it is known

A crystal's structure is read from the pattern it scatters. The reciprocal lattice, systematic absences, and what an experiment can and cannot see.

$Two symmetric structures a diffraction pattern cannot separate. Two arrangements of 6 atoms on a 6 × 6 torus, each invariant under the plane group p6m, drawn beside the Patterson they share. No translation and no inversion carries one onto the other, so they are different structures; every one of the thirty-six interatomic vector counts is the same, so every diffracted intensity is the same and no measurement at any resolution separates them. Of the 4 structures with this symmetry and this many atoms, there are only 3 Pattersons — so imposing the most symmetric of the seventeen plane groups has not removed the ambiguity.$

Symmetry does not rescue a Patterson

Every homometric pair found so far sits on a bare ring with no operations imposed, and a real crystal sits in a space group. Impose one and the ambiguity does not go away: 12 of the 13 groups searched still have pairs, and at six atoms the hexagonal groups are indistinguishable two to three times as often as the general position.

7 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

The window of a three-letter chain. The cut-and-project window of the tribonacci chain: every prefix of the chain, projected onto the plane spanned by the two complex roots of x³ = x² + x + 1, and coloured by the letter that follows it. 223,317 points. It is a bounded region in three pieces whose areas are 0.542, 0.296, 0.162 of the whole, which are the frequencies of the three letters; it fills 71.5 per cent of its bounding box, and a straight cut across it meets up to 6 separate pieces. A window for a two-letter chain is an interval.

A window that is not an interval

The usual cut-and-project construction takes a strip through a lattice and keeps the points falling within an interval. Add a third letter and the window stops being an interval: the tribonacci chain's window is a fractal in three pieces, and a straight cut across it meets up to six.

6 figures

Into space

Seventeen becomes two hundred and thirty. Screw axes, glide planes, and the translations that no choice of origin can remove — the operations a flat surface has no room for.

A thread's two signs, and the four kinds of operation. Every operation of a rod group carries the axis to itself, so it does two independent things: it keeps or reverses the direction along the thread, by a sign σ, and it keeps or reverses the handedness of the plane across the thread, by the determinant of a 2 × 2 matrix. The determinant in space is the product, so the shaded cells are the proper operations — a turn or screw about the axis, and a half-turn crossing it — and the unshaded ones are the improper. A rod group is chiral when all of its operations sit on the shaded diagonal, and polar along its axis when all of them sit on the top row. The two conditions pick out different diagonals of the same square, which is why neither implies the other.

A thread's hand is not a choice

A sheet's handedness in space depends on a sign that the plane pattern does not fix, so one plane group carries several sheets and exactly one of them is chiral. A thread has no such freedom: 32 of the 75 rod groups are chiral, they sit over 9 of the 27 axial classes, and which they are is settled before any structure is drawn. Only its direction depends on how the class lies along it.

7 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

$Every rational holds a window, and there is nothing in between. The ground state density of a chain of particles with a convex repulsion, against the chemical potential that sets how many of them there are. Every density with denominator up to 24 is a flat step of positive width — 177 of them — and the steps with the simplest fractions are the widest: a half takes 19 per cent of the whole range on its own. The risers between them are not smooth stretches; they are where the densities with larger denominators sit, and a finer computation fills them with more steps. What is left after every rational has taken its window is the irrational densities, which are the genuinely incommensurate ground states and have no width at all.$

Every fraction holds a window

Three essays here name the devil's staircase and none computes one. A chain of particles with any convex repulsion has a ground state at every rational density holding an interval of chemical potential to itself — 709 of them computed, the widest taking 19% of the axis and the narrowest two parts in a million million — and the incommensurate densities are what is left over.

7 figures

Into space

Seventeen becomes two hundred and thirty. Screw axes, glide planes, and the translations that no choice of origin can remove — the operations a flat surface has no room for.

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.

7 figures

What a lattice forbids

Only two-, three-, four- and six-fold rotations are compatible with periodicity. The proof takes one line and the exception took a Nobel Prize.

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.

7 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

Identical layers, each turned by an angle no number of turns undoes. Plan views of 4 layers of a stack. Each layer is the same square lattice with one cell shaded and one direction drawn, and each is turned from the one below through the angle whose cosine is three fifths, about 53.13 degrees. That angle is not a rational part of a full turn, so no number of layers brings the drawn direction back to where it started. A tiling of space with this structure has a symmetry that turns one layer onto the next and climbs one layer, and it has no translation.

Aperiodic is two words in space

A tile is aperiodic when none of its tilings is periodic, and periodic has been read two ways: a tiling with a translation, or a tiling with infinitely many symmetries. In the plane those are one condition, provably. In space they come apart, and a prism found in 1988 sits exactly in the gap.

7 figures

What a lattice forbids

Only two-, three-, four- and six-fold rotations are compatible with periodicity. The proof takes one line and the exception took a Nobel Prize.

A centre at every other ring

A census cannot settle an infinite row, and the construction proposed to settle it was a tube capped at both ends, lengthened a ring at a time. Carried out, it alternates: a centre appears at every other ring and never between, the two families it permits reach two arithmetic progressions rather than a row, and the first of them opens with exactly the cage the census found could not halve.

8 figures

Everything except the hexagons

Three counts of what a closed net must carry end on the same admission: an arithmetic saying what a net must charge does not say that a net exists. Eberhard's theorem says how close the charge comes to being enough, and the answer has a shape nobody would guess — it fixes every face count except the hexagons, and the hexagons are exactly the entry it cannot see.

8 figures

The fewest contacts twelve pentagons can have, by size. For every cage of pentagons and hexagons up to forty-four atoms, the number of pairs of pentagons sharing a bond. The lower line is the fewest any cage of that size achieves — 30, 24, 21, 18, 17, 15, 14, 12, 11, 10, 9, 8 — the upper line the most, and the dashed line the bound that counting edges gives: the twelve pentagons carry sixty edges between them, a contact uses two and an edge to a hexagon uses one, so the contacts cannot fall below 30 − 3h with h hexagons. The bound is attained while the hexagons are few and goes loose at five, after which each extra hexagon removes about one contact rather than three. The number of cages at each size is printed beneath, and it is the least rather than the average that the bound is about.

How close the twelve must be

The charge fixes twelve pentagons and says nothing about where they go, because it is a sum over faces and cannot see which face touches which. What it cannot see is a graph on twelve points, and the fewest edges that graph can have falls from thirty to eight over the cages a census reaches — then keeps falling at a rate that puts its first zero exactly where the truncated icosahedron is.

7 figures

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.

7 figures

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.

7 figures

Two, seventeen, two hundred and thirty, and then. The number of arithmetic crystal classes and the number of crystallographic groups in each of the first six dimensions, with the second divided by the first. The classes multiply by between five and fourteen a dimension; the groups multiply by much more, and the quotient — how many groups an average class carries — goes 1.00, 1.31, 3.15, 6.74, 36.5 and 339. The last column says what is derived on this page and what is quoted: the plane in full, six of the seventy-three classes in space, and nothing at all above three dimensions, where the counts come from machine enumerations of the 1970s onwards.

Finitely many is not few

Bieberbach's third theorem says each dimension holds finitely many crystallographic groups and gives no idea how many. The counts are 2, 17, 230, 4783, 222018 and 28927922, and dividing them by the number of arithmetic classes says which of the classification's three steps supplies the explosion — the step that attaches translations, not the one that finds the matrix groups.

6 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

What a defect costs the count

Each broken vertex relaxes the rule and so adds arrangements — the question left standing was whether each adds a fixed amount or the cloud around it costs some back. The exact count at every defect number at once answers the first half outright: almost all of the rise is the freedom to choose which vertices break, and what is left once that is taken out exactly is small, uneven, and lowest at the first count that needs a four.

7 figures

What a lattice forbids

Only two-, three-, four- and six-fold rotations are compatible with periodicity. The proof takes one line and the exception took a Nobel Prize.

$The turns a rolled sheet can make are square roots. Every primitive rolling of a square and of a hexagonal sheet with at most 66 cells in a repeat, one mark per distinct turn. Across is the number of cells n₀ in one repeat of the tube; up is the turn, as a fraction of a circle, of the screw that climbs one n₀-th of the repeat. Most columns are empty, and the occupied ones hold two or four marks rather than anything up to n₀: on the square sheet the turns are exactly the square roots of minus one modulo n₀, on the hexagonal sheet the roots of the corresponding congruence for minus three. The pattern is symmetric about half a turn because a root and its negative are the two hands of one tube.$

A rolled sheet turns by a square root

Roll a square sheet into a tube of thirteen cells and its screw could, on paper, turn by any of twelve fractions of a circle. It turns by five thirteenths or eight, and nothing else, because five squared plus one is a multiple of thirteen. Every rolled tube's screw is a square root of minus the sheet's determinant — which is why handed tubes appear only at the orders Fermat allows, why they always come in both hands, and why the crystallographic ones need an accident.

8 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

The count that depends on the edge

A residual entropy is supposed to be a bulk number: so much per vertex, whatever surrounds the lattice. Square ice has two of them. On a torus the count per vertex heads for 1.5396 and inside a domain wall it heads for 1.2990, with the same rule on the same lattice — and the sixteen per cent between them is sitting in the corners.

6 figures

What a lattice forbids

Only two-, three-, four- and six-fold rotations are compatible with periodicity. The proof takes one line and the exception took a Nobel Prize.

How the space groups are spread over their classes. For each number of groups, how many arithmetic classes carry exactly that many space-group types, in space and in the plane, every count derived from the classes' cohomology and the normaliser's action on it. In the plane ten of the thirteen classes carry one group. In space twelve of the seventy-three carry one, thirty-five carry two and fifteen carry four, so the typical class carries two; the long tail is the orthorhombic and tetragonal classes with eight, ten and sixteen.

Two hundred and nineteen over seventy-three

The space groups average three to an arithmetic class, and an average of three could be a few classes carrying dozens or every class carrying a handful. Derived class by class from the cohomology and its normaliser, the answer is the second: twelve classes carry one group, the median carries two, and the largest carries sixteen. Sixty-one of the seventy-three admit a non-symmorphic group, and the step that merges relabellings, which the plane barely uses, removes more than a quarter of the list.

6 figures

Order without repetition

Penrose tilings and quasicrystals — patterns with long-range order, five-fold symmetry, and no repeating cell at all.

Three colours on a chessboard

Colour the cells of a board in three colours so that no two sharing an edge agree. The number of ways is the number of ice arrangements on the same board — the same integer, to the last digit, at every even size — so a residual entropy a calorimeter reads is also the answer to a colouring problem with no physics in it at all. At odd sizes the two counts part company, and why they do is a condition on going round.

6 figures

By idea · By group · By object · Search