The collection

Every essay — page 17

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

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.

What refinement takes back from a wrong disorder model. Every directed pair of disorder models sharing an occupancy, 462 in all: data made from one model's averaged structure, the other model refined against them with positions on its own loci, two-component displacement parameters and fixed occupancies. Across is the residual between the two ideal structures; up is the residual after refinement. Points on the dashed line lost nothing to refinement; the median point lost 58 per cent of its residual. Every point on the floor, where the wrong model fits exactly, is one whose loci contain the true model's.

What refinement takes back from a wrong model

Two disorder models sharing an occupancy leave averaged structures typically a sixth apart. Refine the wrong one against the right one's data and it takes back more than half of that — all of it wherever its loci contain the true ones. Yet the data still choose, even for a molecule of sixty-four atoms, because a likelihood summed over every reflection sees what no single reflection can, and the wrong model's partial atoms give it away through the size of their displacement parameters, not their shape.

8 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.

P4₁: the lattices, as an ideal across and a multiple along. Every sublattice the point group of P4₁ carries to itself, indexed by the norm of the ideal it uses across the axis and by the multiple it takes along it. The entry is the space group that sits on it: the parent's own type in one colour, a different type in the other, and a dash where no group with the parent's point group survives at all. A dot marks a lattice that is maximal — one whose step is a single prime, across or along, with nothing between it and the whole. The rows and columns are two divisibility orders and the table is their product, which is the shape the plane's answer predicted.

An ideal across and a prime along

In the plane a copy of a group inside itself grows by a prime ideal, and the maximal indices are the norms of the primes of a ring. In space with one principal axis there are two directions to grow in, and the question the plane left was whether the two constraints multiply. They do not — and the place they fail is an index the plane calls maximal, because the step in between carries the group's mirror image.

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.

Three rotations of order twelve

A four-dimensional lattice can be carried onto itself by three different integer matrices of order twelve, and only one of them turns anything by a twelfth of a turn. The totient that is usually said to decide which orders a dimension permits decides something else: which angles. The orders are decided by a sum over blocks, the two lists part company at six dimensions, and space already has an operation whose order is not its angle.

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.

A row of coefficients for every group. For eight of the seventeen, the number of sublattices of each index that the group's point group carries to itself. A nought means the group has no copy of itself at that index at all. p1 and p2 preserve every sublattice, so their rows are the counts of sublattices themselves — 1, 3, 4, 7, 6, 12 — which is the sum of the divisors. The rows thin out as the point group grows, and p4m and p6m have almost nothing in them. Every row is a sequence a Dirichlet series can be built on, and the next figure is what that series factors into.

A row written as a product

Every group's copies of itself sit at a row of indices, and every row so far has been read one entry at a time. Counting all of them at once turns a row into a Dirichlet series, and every one of the seventeen rows factors into a product over the primes — which is the statement that a copy is a chain of maximal steps, written as arithmetic. The plainest group of all has the most famous series in mathematics.

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.

All thirteen families of line groups, reached by rolling. Each of the seventeen plane groups, on its generic lattice, rolled into a tube along every lattice vector that gives a repeat, with a mark under each of the thirteen families of line groups some rolling lands in. The band above each column is the family's translational part: a general screw for families 1 and 5, a half-step screw for 4, 8 and 13, pure translations or glide planes for the rest. Every family is reached, six of them by a single plane group, and the two oblique groups reach nothing because an oblique lattice rolled in any direction never repeats.

The centring that turns into a screw

Rolled with no limit on the order, the seventeen plane patterns reach every one of the thirteen families of line groups — six of them through a single pattern each. And the families' translations are decided by one integer: a tube that keeps any reflection holds one or two cells of its sheet in a repeat, never more, and it holds two exactly when the sheet is centred along the rolling direction. The centring vector of the flat lattice is the half-step screw of the tube.

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 lattice, two copies of pm. pm on a lattice doubled across its mirrors. The mirrors of the parent are every vertical line; a copy of pm on the doubled lattice has mirrors every other line, and there are two ways to choose which — the solid set or the dashed set. Both are copies of pm with the same lattice and the same point group, and no translation of the parent carries one onto the other, because the translation that would is exactly the one the doubling removed. So a count of invariant lattices is not a count of subgroups, and the gap is visible in the smallest case there is.

A lattice is not a subgroup

Every count of copies so far has counted lattices, and the International Tables count subgroups. One invariant lattice can carry several copies of a group that nothing in the parent carries onto one another — pm's doubled lattice carries two, with its mirrors on the even lines or the odd ones — and how many is a cohomology computation, a first where the classification of the seventeen used a second.

5 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.

Better counting makes an uncorrected smooth error choose the wrong model. Eighteen pairs of disorder models, each decided by the likelihood ratio at the 0.1 per cent level, at sixty-four and a hundred and twenty-eight atoms, as the random error falls from 3% to 1% to 0.3% of the mean amplitude. In each group, the first bar has random error only, the second adds a smooth scale error of 3% across reciprocal space, and the third adds the same error with a degree-two scale surface refined alongside the structure. With random error only, better counting decides more pairs correctly. With the uncorrected smooth error it stops helping and the number decided for the wrong model grows, to three at a hundred and twenty-eight atoms. With the surface refined, the result is the random-only one in every group.

Better counting, and the wrong model

A smooth error across reciprocal space, as large as the random one, hardly changes which disorder model the data choose: it enters both models' residuals and cancels from their difference. What it changes is where better data lead. With random error alone, counting harder decides more pairs correctly. With the smooth error left in, counting harder stops helping and starts deciding pairs for the model that did not make the data — at the 0.1% level, and more of them the better the counting.

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.

Seven indices in 40, and one lattice at each. For every index to 40, how many sublattices of a cubic lattice there are and how many of them the full cubic point group carries to itself. The first number runs into the hundreds; the second is nought at almost every index and one at 1, 2, 4, 8, 16, 27, 32. A cubic point group is forty-eight conditions on a sublattice, and forty-eight conditions leave very little. The richest point group in three dimensions has the poorest arithmetic of copies, and the two are the same fact.

The richest group has the poorest arithmetic

A plane group with no symmetry has seven hundred and sixty-two sublattices to grow by; one with a six-fold axis and mirrors has eight. Take the trend to its end in space and a cubic group has six to index forty — one at every cube, one at twice a cube, one at four times a cube, and nothing anywhere else. Every operation of a point group is a condition, and forty-eight conditions leave almost nothing.

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.

Six matrices and eight: a monoclinic normaliser modulo two. For P2/m and C2/m, every 3 × 3 matrix over the field of two elements that preserves the reductions of the two eigen-sublattices of the class's two-fold or mirror — six on the primitive lattice and eight on the centred one — each drawn as a tile of nine squares filled where the entry is one. The whole infinite normaliser reduces into this set, and a dot under each tile marks that some normaliser element with entries −1, 0 and 1 reduces to it. Every tile is realised, and the same holds in all six monoclinic classes.

The normaliser only acts modulo two

The space groups were counted as orbits of a small, finite set of changes of basis — only those with entries −1, 0 and 1 — out of normalisers that are infinite in the monoclinic classes. That the counts came out right was evidence, not proof. It becomes proof in two steps. A missing change of basis can only leave the count too high, never too low, so the published totals already force every class. And in the monoclinic classes the infinite normaliser acts on the cohomology only through its reduction modulo two, where the small set already reaches everything.

6 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.

$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.

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.

Which four-dimensional lattices carry which rotations of order twelve. Six four-dimensional lattices, the order of each one's symmetry group, and how many of its symmetries are of each of the three kinds of order twelve: the single block Φ₁₂, the third-turn with a quarter-turn Φ₃Φ₄, and the quarter-turn with a sixth-turn Φ₄Φ₆. D₄ has 96 of the first among 1,152 symmetries, the two hexagonal planes 24 among 288, and the hexagonal-and-square sum 4 of each of the other two among 96. No lattice has all three, and none has the first with either other.

No lattice carries all three twelves

Four-dimensional lattices admit three different operations of order twelve: one that turns a single irreducible block by a twelfth, and two that turn two planes, by a third and a quarter or by a quarter and a sixth. Computing the symmetry group of every kind of four-dimensional lattice that can have a maximal one shows that no lattice carries all three, and none carries the first with either of the others. D₄, the most symmetric of them, has only the first.

7 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.

A screw out of two rotations that have none. Four pairs of located rotations of space, composed, with the result read back as a screw: its angle, and its pitch, which is the part of its translation lying along its own axis. Axes that meet give a rotation and no translation at all, because the point where they meet is fixed by both. Parallel half-turns give a translation. Skew axes give a screw — a motion with a translation in it, out of two motions with none — and the translation is twice the distance between the two axes. Nothing in either factor moves anything along the product's axis, and the product does.

The axis a product lies on

Two rotations of space about axes that do not meet compose to a screw — a motion with a translation in it, out of two that have none. The translation is twice the distance between the axes and the angle twice the angle between them, and the screw's own axis is not somewhere arbitrary: it lies on the two axes' common perpendicular, at a place the arithmetic gives.

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.

The eighty layers by what rolling does to their two faces. The eighty layer groups sorted by how the two tubes a sheet makes, one with each face outside, are related. Seventeen one-sided layers make two different tubes in every direction. Forty-six make the same tube in every direction, because they have a mirror or glide in the sheet or a centre of inversion. Sixteen relate the two tubes only along two, four or six special directions, and there as mirror images. One, the layer with a four-fold rotoinversion and nothing else that turns it over, exchanges its faces and still makes two different tubes in every direction.

A sheet with two faces rolls into two tubes

Roll a sheet whose two faces differ and every operation that turns it over dies, as expected: a tube's inside is not its outside. But the sheet can be rolled with either face out, and the operations that died are exactly the congruences between the two tubes that result. Over the eighty layer groups that settles, direction by direction, whether the two are one tube, a pair of mirror images or two different objects, and one layer exchanges its faces and still never rolls the same tube twice.

7 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.

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.

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.

The fewest pentagon contacts, from twenty atoms to sixty. The least number of pairs of pentagons sharing a bond, over every cage of pentagons and hexagons at each size from 20 to 60 atoms, with two lower bounds: 30 − 3h from counting edges, and 20 − h from counting the pentagons round each hexagon, which is also the prediction of one fewer contact for each hexagon added. The measured values past 44 atoms are 8, 8, 7, 5, 5, 4, 4, 3, 0; the bound is met at 20, 24, 26, 28, 36, 38, 40, 42, 44, 50, 60 atoms and nowhere else.

The last three contacts go at once

The fewest pentagon contacts a cage can have fell by one for every hexagon added over eight sizes up to forty-four atoms, which pointed straight at the truncated icosahedron at sixty. Carried to sixty by a faster search, the fall does not continue evenly. It pauses, jumps, pauses again, and loses its last three contacts in a single step. The steady fall was not a trend. It was a lower bound, twenty minus the number of hexagons, which a short count round each hexagon proves, and the census now shows where cages meet it and where they cannot.

7 figures

The classification

Exactly seventeen ways to fill the plane with a repeating pattern. Not a fact to memorise: a theorem, with a finite argument and no eighteenth case.

One group without an axis, and as many as the order with one. For a rotation of each order that an integer matrix can have in a small dimension, the number of space groups its arithmetic class admits — computed from the cohomology rather than enumerated. A rotation acting on the smallest lattice that will hold it fixes no direction and admits exactly one group: the symmorphic one, with no screw. Add a direction it leaves alone and the count becomes the order of the rotation, and the extra groups are its screws. The four-fold with an axis gives four, which are P4, P4₁, P4₂ and P4₃; the five-fold with an axis gives five, in five dimensions, where no published table exists to check it against.

The screw a dimension does not have

The extension count is a machine that runs in any dimension, and the seventeen were the case where every step could be checked against a list arrived at four other ways. Run on a cyclic point group it has a closed form two lines long — and it says a five-fold screw axis does not exist in four dimensions, which is a prediction rather than a check.

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.

One sheet with two faces rolled into two scrolls. The cross-section of a sheet with different atoms on its two faces, rolled three turns into an Archimedean spiral, once with face A outward and once with face B outward. Unlike a tube, a scroll has an inner edge and an outer edge and a radius that grows with every turn, so an isometry of space can neither turn it about its axis nor reverse the direction along the spiral: it can only slide it along the axis, reflect it across the axis, or reflect the spiral itself.

A scroll cannot be turned end for end

A sheet with two different faces rolls into two tubes, face A out and face B out, and for forty-six of the eighty layer groups the two tubes are one object whichever way the sheet is rolled. Roll the same sheets into scrolls, spirals with an inner edge and an outer one, and only seventeen keep that. A spiral cannot be turned about its axis or run backwards, so the half-turns and screws that joined the tubes have nothing to act on. What survives is a mirror lying in the sheet, and a two-fold axis lying along the roll.

7 figures

The classification

Exactly seventeen ways to fill the plane with a repeating pattern. Not a fact to memorise: a theorem, with a finite argument and no eighteenth case.

$Tight where there is an axis and vacuous where there is not. The order of a point group annihilates its cohomology, so every intrinsic translation is a multiple of one over that order — the bound every account of the subject quotes. What occurs is one over the exponent of the cohomology, which divides the bound. For a rotation with a direction it fixes the two agree exactly: a four-fold screw does need quarters and a six-fold sixths. For a rotation acting with no fixed direction the exponent is one — the cohomology is trivial and no fraction occurs at all — so the bound is slack by the whole order. The same bound is sharp and useless in the same table.$

The denominator a group actually needs

The order of a point group annihilates its cohomology, so every intrinsic translation is a multiple of one over that order — a bound every account of the subject quotes. What occurs is one over the exponent, which divides it. The same bound turns out to be attained exactly and to be slack by its whole size, in two rows of one table, and what decides which is whether the rotation fixes a direction.

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.

Every finite normaliser of a lattice's group, found whole. The fourteen Bravais lattices on primitive bases, with the number of primitive vectors along the axes of their rotations, the order of the lattice's group, and the order of its normaliser in the integer matrices, found by trying every assignment of axis vectors to three independent ones. On the three lattices up to monoclinic the axis vectors lie on one line or none and the normaliser is infinite. On the other eleven it is finite (48, 16, 48, 48, 16, 16, 24, 12, 48, 48, 48), its largest entry is one, and it is exactly the set of matrices with entries −1, 0 and 1 that the space-group census used.

A normaliser must permute the axes

The space groups were counted with a small set of changes of basis, and past the monoclinic system nothing had shown that set was the whole normaliser. It is, and the reason is geometric: a change of basis that carries a lattice's group to itself must carry each rotation axis to a rotation axis, so it permutes a finite set of vectors, and past the monoclinic system three of them pin it down. Every such permutation tried, the eleven finite normalisers turn out to be exactly the matrices with entries −1, 0 and 1, and 219 and 230 stand without any table behind them.

6 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 sign turns when the cross terms go weak. Every quartet among the strong reflections of a small structure, sorted by the mean of its three cross terms, with the mean cosine of the phase sum in each bin. Where the cross terms are strong the quartet behaves like a triplet and the cosine is near one. Where they are weakest it is -0.698 — negative — and 93 per cent of those quartets have a cosine below nought. The four reflections of the quartet are equally strong in every bin; what changes is three reflections that are not in the sum at all.

The relation that can say no

Every phase relation before this one pushes a sum towards zero, so none of them can contradict another — a phase set satisfying all of them badly is still satisfying them in the same direction. A quartet can be estimated at π instead, and it is when its three cross terms are weak, so the information arrives from the reflections nobody would have thought worth measuring.

5 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.

Which sites a smooth error can mislead. For the eighteen pairs of disorder models at three site symmetries, under a smooth scale error of degree two (five molecule sizes) and of degree four (three sizes): how many verdicts of perfect counting go the wrong way, how many pairs no data can decide, the largest correlation between the error and the two models' difference, and how many harmonics of the error's degree the site's group leaves unchanged. At the cubic site the degree-two error correlates with nothing, to rounding, and decides no pair wrongly; the degree-four error, which the cubic site keeps one harmonic of, reaches it.

A cubic site is blind to a degree-two error

A smooth scale error left uncorrected made perfect counting choose the wrong disorder model for eight of ninety pairs and sizes, and the obvious way to predict which is to correlate the error with the two models' difference before refining anything. That correlation predicts none of them. What it does predict, exactly, is which pairs can never go wrong: at a cubic site a scale error of degree two correlates with nothing and is absorbed by nothing, because a cubic group keeps no harmonic of degree two. A degree-four error, which it keeps one of, reaches the cubic site at once.

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.

An equality, with a known factor in it. Sayre's identity says the structure factor is proportional to the convolution of the structure factors with themselves — an equality, not a probability — with a factor that depends on the atoms and the resolution and on nothing else. Computed for a structure of Gaussian atoms, the ratio of the two sides falls with resolution exactly as predicted: the logarithm of the ratio is a straight line in the squared index, its slope is minus half the width in the atomic factor, and the ratio is very nearly real and positive, so the identity relates the phases and not only the amplitudes.

The relation that is an equality

Every relation of this kind so far is a probability — right nine times in ten, useless applied once and decisive applied ten thousand times. One is not. For a structure of equal, resolved atoms the squared density has peaks in the same places, so every structure factor is exactly a convolution of all the others, with a factor that depends only on the atom. It is exact, and on its own it is useless.

5 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 first-order prediction against the actual verdict, for every pair and size. The 85 decidable pairs of disorder models at five molecule sizes, each placed by the first-order prediction of the wrong model's misfit minus the right model's, made from the two error-free refinements and their Jacobians, and by the actual difference after refining against data with a 3% smooth error. Shaded quadrants are agreement. 77 agree. Of the 8 wrong verdicts, ringed, 4 are predicted; 4 right verdicts are predicted wrong.

The wrong model moves too far for first order

Which disorder models a smooth error will turn the wrong way was left as a calculation to make before any data exist: project the error onto the directions each refinement's parameters can move. Made, it gets the sign of the verdict right in seventy-seven of eighty-five cases, catches four of the eight wrong verdicts and raises four false alarms. Every case it gets wrong is either a near-tie or a refinement that absorbed more than twice, or less than half, of what its first-order directions allow.

5 figures

Order without repetition

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

$How often a broken vertex carries four. Of all the broken vertices in all the arrangements with a given number of them, the fraction whose four arrows all point the same way — on tori four, five and six vertices across. If the vertices were independent that fraction would be one in five at every count. With only two defects it is far lower, 0.085, 0.075 and 0.066 on the three tori, and falling with the size; as the count rises it climbs, oscillating, to one in five and stays there. The odd counts sit above the even ones because an odd number of defects cannot be made of twos alone — three defects must hold exactly one four, which is a share of one third.$

A four is not two twos

A vertex of square ice can break the rule with three arrows one way or with all four, and a census that counts the two apart finds them behaving as charges of two and four should: the fours are rare while defects are few, a pair of fours is squeezed about four times as hard as a pair of twos, and the dip an earlier census reported turns out to be nothing but the first count that cannot be made without a four.

7 figures

By idea · By group · By object · Search