Crystallography & Symmetry
patterns derived from their groups
Generator

(17, 5) and (23, 7) reduced in 3 steps

(17, 5) and (23, 7) reduced in 3 steps
(17, 5) and (23, 7) reduced in 3 steps. Lagrange's reduction, run on the basis (17, 5), (23, 7). Each step subtracts a whole multiple of the shorter vector from the longer and swaps them; after 3 steps neither can be shortened by the other and the pair is reduced. The faint arrows are the intermediate bases and the solid pair is the answer, of length 1.41. The procedure always terminates and always finds the shortest vector, and in the plane that is a theorem rather than a hope.

Lagrange's reduction, run on the basis (17, 5), (23, 7). Each step subtracts a whole multiple of the shorter vector from the longer and swaps them; after 3 steps neither can be shortened by the other and the pair is reduced. The faint arrows are the intermediate bases and the solid pair is the answer, of length 1.41. The procedure always terminates and always finds the shortest vector, and in the plane that is a theorem rather than a hope.

11 essays call descriptions. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about. Every one of this site's 522 essays names its parameters at the call site, which the standard pass of 2026-08-09 established and param-floor holds.

Where it is called

Changing this generator changes every one of these figures.

P222: 16 descriptions of one structure. P222 has 4 operations in a cell. 8 origins leave every one of them exactly where it was, and 8 linear parts of the lattice's holohedry normalise the group, so its Euclidean normaliser has 64 elements per cell and the index is 16. That index is the number of coordinate lists that describe one and the same arrangement of atoms. Each was applied to a motif and the resulting point sets compared: the numbers differ and the sets are identical, which is the check that makes the count mean anything. Operations

One crystal, and sixteen coordinate lists

Two structure reports can disagree in every number and describe the same arrangement of atoms, because a space group does not fix its own origin or its own axes. How many genuinely different lists there are is the index of the group in its Euclidean normaliser — a number, computable, and the thing a structural database has to divide out before it can say two entries are the same compound.

 (17, 5) and (23, 7) reduced in 3 steps. Lagrange's reduction, run on the basis (17, 5), (23, 7). Each step subtracts a whole multiple of the shorter vector from the longer and swaps them; after 3 steps neither can be shortened by the other and the pair is reduced. The faint arrows are the intermediate bases and the solid pair is the answer, of length 1.41. The procedure always terminates and always finds the shortest vector, and in the plane that is a theorem rather than a hope. Lattices

The shortest vector, and where it stops being easy

Two moves find the shortest vector of a plane lattice, and they always terminate. A crystal never needs more, because a crystal's lattice has two or three dimensions. In general the same question is NP-hard, the best polynomial procedure returns an answer that may be exponentially too long, and an entire branch of cryptography is built on the gap.

 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.

 342 unlabelled spots, cell volume 52. A bag of 342 reflection positions with no indices on them, collected out to a bound of 3 on each index. Their pairwise differences generate the reciprocal lattice; a basis of that is taken by integer elimination and then reduced, and the reduced basis is printed. Its determinant is 52, which is the volume of the cell the reflections were computed from — so the cell has been recovered from positions alone, with no intensity used anywhere. Symmetry at work

A cell from a bag of spots

A single-crystal experiment returns a list of directions with no labels on them. Recovering the cell is recovering the lattice those directions generate, and the whole of it is take differences, reduce, read the answer. What no quantity of data settles is whether the lattice found is the true one or a sublattice of it.

 19 site symmetries, and the counts each can impose. Every distinct site symmetry across the space groups this site builds, named by the multiset of its operation types, with the orientation counts a disordered molecule there may take. The counts are the indices of the site group's subgroups, computed by closing subsets under multiplication rather than looked up. Nearly every row offers every divisor of its order. One does not: a site of order twelve whose group is the tetrahedral rotation group refuses an orientation count of two, because that group has no subgroup of order six. What a lattice forbids

How many orientations a disorder needs

A molecule at a site with more symmetry than it has resolves the contradiction by occupying several orientations at once. How many is not fitted: it is the index of the molecule's symmetry in the site's, so the occupancy is the reciprocal of a whole number — and one site in the census refuses a divisor of its own order.

 Disorder models against occupancies, site by site. Every distinct site symmetry in the space groups built here — 19 of them — with its order, its number of subgroups, the number of distinct disorder models, which are the subgroups up to conjugacy by the operations of the site symmetry, and the number of different occupancies those models can have. The last column is the largest number of models that share one occupancy. In all, 162 models share far fewer occupancies; the most crowded is 4/mmm, where 11 different models all give an occupancy of 1/4. At every site, the classes of operation a model keeps separate it from every other model with the same occupancy. What a lattice forbids

The occupancy does not name the disorder

A molecule disordered on a special position takes a number of orientations fixed by a group index, and its occupancy is the reciprocal. Many different disorders share one occupancy — eleven at a single kind of tetragonal site — and what separates them is which of the site's operations the molecule keeps, which the averaged structure records and the occupancy does not.

 The average is the site's orbit, with occupancies. A molecule at a site of symmetry mmm keeping a subgroup of order two takes four orientations, and the average over them is the site group's orbit of each of the molecule's atoms, every image at one over the length of its own orbit. Atoms in general positions give eight images at an eighth each, and give the same eight whichever subgroup the molecule keeps. Atoms on a locus the model keeps give a shorter orbit at a higher occupancy, drawn larger and darker, and those are the only atoms that differ between models. The total scattering is the same for every model, so all of them agree exactly at zero scattering angle. What a lattice forbids

The molecule size that hides a disorder

Two disorder models with the same occupancy leave averaged structures that differ only in a handful of partial atoms. The difference is 20% in structure factors for a ten-atom molecule and 3% for a sixty-atom one — so the data choose between the models for a small molecule and stop choosing for a large one, and seven pairs are identical at any size.

 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 a lattice forbids

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.

 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. What a lattice forbids

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.

 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. What a lattice forbids

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.

 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. What a lattice forbids

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.

The whole library · All essays