Crystallography & Symmetry
patterns derived from their groups
Theme

The theme: The lattice forbids — page 4

Periodicity is a strong constraint. It rules out five-fold rotations, most rotation orders above six, and a great many patterns that look perfectly reasonable until the arithmetic is done.
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. What a lattice forbids

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.

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

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.

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

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.

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

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.

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

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.

 The turns that keep the join discrete. Two copies of p4 on one square lattice, one turned against the other, with the shortest translation their union generates. At a turn whose cosine and sine are both rational the translations are a lattice, and its shortest vector is one over the square root of Σ — where Σ is the odd part of p² + q² for the rational point (p, q) — which the measurement reproduces to six places at every one tried. At a whole number of degrees other than a multiple of ninety there is no such point, and the search finds shorter translations the further it runs. Operations

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.

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

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.

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

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.

 Pentagon contacts as pieces of the icosahedron. The icosahedron drawn with one vertex at the centre, two rings of five, and the twelfth vertex as the outer circle; each vertex is a pentagon and each edge a possible contact. Left: the dodecahedron, whose twelve pentagons all touch five others, uses every edge. Centre: the commonest contact graph among the 5,770 cages to sixty atoms, 6 contacts in clusters of 3 + 3 + 2 + 2 + 1 + 1, carried by 179 cages, placed on the icosahedron with every contact on an edge. Right: the one cage with no contacts at all. All but two of the 340 contact graphs can be placed this way. What a lattice forbids

Three hundred and forty ways for twelve pentagons to touch

Every cage of pentagons and hexagons has twelve pentagons, and which of them share a bond is a graph on twelve points. Over all 5,770 cages from twenty atoms to sixty there are only 340 such graphs, and the graph almost never tells one cage from another: the commonest is shared by 179 cages and one recurs at thirteen different sizes. And every one of them except two, both from small cages, fits inside a single graph, the icosahedron's, which is what the dodecahedron's twelve pentagons make when every one touches five others.

 Twelve kinds of operation six dimensions adds, and the lattices that carry them. The twelve rational kinds of operation whose orders first appear in five or six dimensions — 7, 9, 14, 15, 18, 20 (two kinds), 24 (two) and 30 (three) — against six lattices whose symmetry groups were computed element by element. Every kind is carried by at least one. All three kinds of order thirty are carried by A₄ ⊕ A₂, forty-eight symmetries each; the single-block kinds Φ₇ and Φ₁₄ only by A₆, and Φ₉ and Φ₁₈ by E₆ and by three hexagonal planes. What a lattice forbids

The thirties share a lattice

Four dimensions has three kinds of operation of order twelve and no lattice carries all three. Six dimensions has three kinds of order thirty, and one lattice carries every one of them, forty-eight times each. The difference is not the order. One of the twelves is a single block that cannot be split, and no thirty is: thirty needs eight dimensions to be irreducible, so in six it is always a five-fold piece beside a three-fold one, and the lattice that is both pieces holds every combination.

 Three rules for 'square' are three shapes, and the cell falls between them. A measured cell placed by how far it is from each of the two conditions a square cell needs — equal edges across, a right angle up — each in its own standard uncertainties, so the square cells are the origin. Three rules for accepting the cell as square at the five per cent level are three regions. The two-condition χ² accepts inside the larger circle, of radius 2.45; testing each condition separately accepts inside the square of half-side 1.96; reading the distance as if it were one condition accepts inside the smaller circle, of radius 1.96. The measured cell, 2.22 and 0.75 from the two conditions, is inside the first region and outside the other two. Operations

Two conditions are not one condition twice

Whether a plane structure has a higher-symmetry supergroup is decided by its measured cell, and the obvious measure — how many standard uncertainties the cell sits from a right angle, or from equal edges — cannot rank the candidates on its own. A square needs two conditions and a rectangle one, so a single distance means different things on each; counted properly, a square can score above the equal-edged lattices that contain it, and walking up the diagram one condition at a time is the reading that keeps the ranking coherent, at a price that has to be paid in its error rate.

 Three mirrors of a 30–30–120 triangle, closed. A triangle with angles of thirty, thirty and a hundred and twenty degrees, shaded, and every image of it under the group its three side-mirrors generate, within a window. The images alternate between the triangle and its mirror image, and they tile the plane — so the closure is discrete. But the group it produces has a mirror along the triangle's own altitude, drawn dashed, that is none of the three given: the triangle is two copies of the thirty–sixty–ninety triangle, and the group is that triangle's, p6m. The closure found a mirror the generators did not name. Operations

Four groups are made of mirrors

Close the plane from located mirrors instead of rotation centres and the closure is discrete only for four triangles of mirrors — and one of those four manufactures a mirror along its own altitude. Of the ten plane groups that contain a reflection, exactly four are generated by their mirrors; three hold a kaleidoscope at index two, three and four, which are the numbers in front of the star in their orbifold symbols; and three have mirrors in one direction only, which generate nothing along themselves.

 How many reflection operations a plane of each lattice can carry. Every mirror of each of the fourteen Bravais lattices' holohedries, sorted by how many classes of lattice vector lie in it modulo the conventional cell's own translations — which is how many reflection operations any plane of that orientation can carry in any space group on that lattice. Primitive lattices carry one on every plane. Centred ones carry two on the planes their centring vectors lie in: one plane of the C-centred orthorhombic lattice, the diagonal planes of the body-centred tetragonal and cubic ones, and every mirror plane of the face-centred lattices. The rhombohedral lattice, on the hexagonal axes the Tables use, carries three on each of its three mirror planes. None carries four. Into space

Three on a plane, and never four

A reflection plane in a space group carries one operation for each class of lattice vector lying in it, and a face-centred lattice has planes holding two independent centring vectors — enough for four. None of those planes is ever a mirror. The fourteen lattices decide the question without the two hundred and thirty: one, two or three operations on a plane, and never four — with the three on every mirror plane of the rhombohedral lattice, where the Tables' own hexagonal axes put them and the letters have no name for them.

 Face- and body-centred cubic change places at t = 1. The Gaussian sum of the face-centred cubic lattice minus that of the body-centred cubic lattice, both at unit volume, across widths from 0.35 to 2.8. Below t = 1 the difference is positive, so the body-centred lattice has the smaller sum; above, it is negative and the face-centred lattice does. At t = 1 the two are equal to the last digit a computer carries, and not by accident: at unit volume each lattice's sum at width t is the other's at width 1/t times a known factor, and at t = 1 the factor is one. Neither lattice is best at every width, and no other lattice can be either. Lattices

No lattice in space wins at every width

Spread a Gaussian over every point of a lattice and add them up. In the plane one lattice gives the smallest sum at every width — the hexagonal one — and that is a theorem. In space no lattice does, and the proof is two lines: at large widths the winner must be the densest lattice, at small widths it must be the densest lattice's dual, and in space those are face- and body-centred cubic. They change places at exactly the width where each is the other's dual.

 E₈ has the smallest sum at every width. For four eight-dimensional lattices of unit covolume — D₈, its dual D₈, the cubic lattice Z⁸ and two copies of D₄ — the ratio of their Gaussian sums, less the constant term, to E₈'s, at widths from 0.2 to 5, logarithmic. Every ratio exceeds one everywhere: E₈ wins at every width against every rival. The closest approach is at t = 1, where D₈ and its dual are equal, a factor of 1.31 above E₈. D₈ is the better of the pair at wide widths and D₈ at narrow ones, and neither comes close to E₈ at either end. Lattices

In eight dimensions one lattice wins at every width

In space no lattice has the smallest Gaussian sum at every width, because the densest lattice wins when the Gaussian is narrow and its dual wins when it is wide, and fcc is not bcc. The argument fails exactly when the densest lattice is its own dual. In eight dimensions it is: E₈, with 240 shortest vectors, beats D₈, its dual, the cubic lattice and a sum of two four-dimensional lattices at every width tried, by a factor of at least 1.31, and its sum is mirror-symmetric in the logarithm of the width.

 Almost every descent ends at D₄. At five widths of the Gaussian, twelve local minimisations of the lattice sum over all four-dimensional lattices of unit covolume, each from a random lattice, each marked by where it ends and labelled with the number of shortest vectors of the lattice it ends at. Fifty-nine of the sixty end at D₄, with twenty-four shortest vectors. One, at the widest Gaussian, ends at A₄*, with ten, a lattice whose sum is higher than D₄'s but which no small change lowers. Lattices

The two lattices where a four-dimensional descent stops short

In four dimensions the argument that rules out a single best lattice in space has nothing to act on, so whether one lattice wins at every width is left to be measured. A search over every four-dimensional lattice finds D₄ from almost anywhere. The exceptions are the finding: two lattices, A₄ and its dual, where a descent can stop short, each at one end of the widths and neither in the middle, for the same reason Voronoi found four dimensions has two perfect forms.

 The centrings each holohedry allows, prime by prime. For each of the seven holohedries on its conventional lattice and each prime from 2 to 7, how many of the lines and planes of the lattice reduced modulo that prime the holohedry leaves invariant, and which of them give a lattice other than the one being centred. At 2 they give C for the monoclinic system, C, I and F for the orthorhombic, I for the tetragonal and I and F for the cubic; at 3 they give the rhombohedral lattice from the hexagonal one; at 5 and 7 nothing new. Lattices

Only two and three can centre a lattice

The centring letters P, A, B, C, I, F and R are usually a list brought to the Bravais lattices. They can be derived instead: a centring is a subspace of the lattice reduced modulo a prime, and a centring that keeps a crystal system's symmetry is a subspace its holohedry leaves invariant. Enumerating every one for the seven holohedries and the primes up to seven gives exactly the fourteen, with new lattices only at two and three. The reason is the crystallographic restriction, one step removed: every holohedry has an order made of twos and threes.

 The seventy-five rod groups by what fixes the axis and what moves along it. Every rod group sorted by its kernel, the plane point group of operations that leave every point of the axis in place, and by the group of the line it maps onto: translations only, or translations and reversals. Each chip counts the rods with that kernel, that line group and a given number of steps to the repeat. 29 never reverse the axis and 46 do, seventy-five in all, derived from the kernel and the rule that joins it to the line and agreeing cell by cell with the rods counted class by class. The classification

Seventy-five is twenty-nine and forty-six

The eighty layer groups came out as a plane group with a sign on each operation. The seventy-five rod groups have an account of the same shape turned round: a finite group of the plane across the rod, which is what leaves the axis alone, extended by a group of the line, which is what moves along it. Twenty-nine rods never turn their axis over and forty-six do, and the count comes out cell by cell as the rods counted class by class. The screw of a rod is the turn its smallest step gives the plane, and the kernel decides its subscript.

 Two cuts that give back the mirror a single cut takes away. A sheet whose only symmetry beyond translation is a centre of inversion: each flag has a copy turned half round and moved to the underside, drawn open, and the dots are the centres. Every single cut leaves a chiral edge, and the piece on the far side carries its mirror image. The upper ribbon is cut symmetrically about a row of centres, so each centre on its middle line carries the ribbon onto itself with its two edges exchanged, and the ribbon is achiral. The lower ribbon, cut at the same width about a line with no centre on it, keeps nothing but translations and is chiral. Into space

A ribbon can be achiral where its edges are not

Cut an achiral sheet once and the edge is usually chiral, in almost every direction. Cut it twice, into a ribbon, and the ribbon may be achiral even when both its edges are chiral, because an operation can carry the ribbon onto itself by exchanging the edges — but only if the ribbon's middle line sits on a centre of inversion or a mirror parallel to the cut. Seven of the eight sheets with no achiral edge give achiral ribbons, and one achiral sheet gives nothing but chiral strips however it is cut.

 The centrings six four-dimensional lattice groups allow, prime by prime. For each of the six four-dimensional lattices whose symmetry groups are maximal, with the group's order, and each prime from 2 to 7: the subspaces of the lattice modulo that prime the group keeps, sorted by what centring by each one makes. New Bravais types appear only at 2, three of them, all over the cube-and-line lattice, and at 5, where A₄ centred by fifths is A₄*. Both centrings of the hypercubic lattice by halves make D₄, which has three times the symmetry. Lattices

The body-centred hypercube is the checkerboard lattice

In three dimensions the centring letters come out as the subspaces a holohedry keeps modulo a prime, and only two and three make new lattices. In four dimensions the same census, run on the six lattices whose symmetry groups are maximal, finds a prime that the three-dimensional argument never could: five centres A₄ into its dual. It also finds that the most familiar centring does not survive the extra dimension. The body-centred hypercubic lattice is not a centred hypercube at all: its body centre is exactly as far away as an edge, and it is D₄, with three times the symmetry.

 One arm of a star is cheap, and the whole star costs the cube. For nine wavevectors of the primitive cubic zone, the number of cells in the smallest periodic box that holds one arm of the wavevector's star, and in the smallest that holds every arm, on a logarithmic axis found by enumerating every box of each size. The zone corner R is held whole by two cells. The face centre X needs two cells for one arm and eight for its three; the thirds along an axis or a body diagonal need three for one arm and twenty-seven for the star; the quarters need four and up to sixty-four. Every smallest box for a whole star has the full symmetry of the cube. The classification

A whole star needs a cubic box

A periodic box for a cubic crystal holds only the wavevectors its own lattice allows, and a box chosen to hold one wavevector usually holds one arm of its star and not the others. One arm of the face centre X fits in two cells; all three need eight. One arm of a third along an axis fits in three; the whole star needs twenty-seven. The smallest box that holds a whole star always keeps the cube's full symmetry, so a calculation either pays for the cube or reports a symmetry its box imposed.

 Which plane groups can be coloured with five, seven, eleven or thirteen colours. For each of the seventeen plane groups and each of the primes 5, 7, 11 and 13, the number of its colourings with that many colours, as subgroups of that index, and the group that permutes the colours: cyclic (C), dihedral (D), or the affine group of the colours with a multiplier of order 3, 4 or 6 (written p:3, p:4, p:6). Totals 104, 172, 268 and 420. The square groups p4 appear at 5 and 13, the three-fold and six-fold groups p3 and p6 at 7 and 13, and p4m, p4g, p3m1, p31m and p6m never. The classification

Five colours, seven colours, and the primes that split

Four colours gave the seventeen plane groups 281 colourings, five different groups permuting the colours and ninety-six designs. Five colours give 104 colourings, three groups and fourteen designs, and from five upwards every prime behaves the same way. A prime number of colours that the point group cannot divide forces every colouring onto a sublattice the rotations keep, and whether the square and hexagonal patterns have one is decided by whether the prime splits in the Gaussian or the Eisenstein integers.

 Whole stars of the hexagonal zone, and the boxes that hold them. For ten wavevectors of the primitive hexagonal zone, the number of cells in the smallest periodic box holding one arm of the star, in the smallest holding every arm, and, where it differs, in the smallest n by n grid of cells holding the star. The corner K is a single arm up to sign and is held whole by three cells, against nine for a grid; K raised to the top face, H, by six against eighteen; halfway to K, T, by twelve against thirty-six. M needs two cells for one arm and four for its three, and L two and eight. Every smallest box for a whole star keeps the full hexagonal symmetry. The classification

The corner of a hexagon fits in three cells

A periodic box for a hexagonal crystal holds a whole star of wavevectors only if it keeps the crystal's full symmetry, as a cubic box must. What the cube never offered is a box turned through thirty degrees. It holds the corner of the hexagonal zone in three cells where every grid needs nine, and the saving is always exactly a factor of three and always at the same stars. Turn a box through any other angle that the six-fold axis allows and it loses the mirrors, and comes with a mirror image.

 Along the rod above a reflection, a free sheet loses its peak. The Bragg intensity per site squared of a warm square-lattice sheet at the in-plane reflection (1, 0) and at heights 0.1, 0.2 and 0.3 along the rod above it, against the sheet's size, on logarithmic axes. In the plane the peak falls as a power of the size whatever the sheet does out of it. Above the plane a free sheet's peak collapses faster and faster, to 2.3e-2 at size 128 and height 0.3; under tension every height falls as a power, to 0.38. How it is known

A flapping sheet keeps its peaks in the plane

A warm sheet one atom thick wanders out of its plane far more than within it: a free sheet with only bending stiffness has a mean-square height that grows with its area. That wandering cannot touch a reflection whose scattering vector lies in the plane, which fades exactly as it would if the sheet were held flat. Every reflection with a component along the normal loses its peak faster than any power of the size. Tension puts it back on a power law.

All themes · All essays