Field

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 rotation. The motif in the first colour, its images under a single rotation in the second, and the symmetry element marked where the operation itself says it lies.

What a symmetry actually is

Not a property of a shape but a motion that leaves it alone. Once symmetry is a verb rather than an adjective, everything else in the subject follows — including why there can only ever be seventeen wallpapers.

A glide. The motif in the first colour, its images under a single glide in the second, and the symmetry element marked where the operation itself says it lies.

The four motions of the plane

Slide, turn, flip, and the odd fourth thing that is a flip and a slide together but neither on its own. Every symmetry of every flat pattern that has ever been made is one of these.

Doing one after another. Two symmetries of a pattern, and the one that doing both lands on. The third picture is not a new operation drawn to fit — it is the composition, and it was already in the group.

Why it is a group and not a list

The symmetries of a pattern cannot be chosen independently. Do two of them in succession and the result is forced to be a third, which is why there is no eighteenth wallpaper for anybody to invent.

Growing the p4 orbit. One motif, then more of the group's operations applied to it, until applying another produces nothing new. The pattern is the orbit; the drawing is only its shadow.

The orbit is the pattern

A wallpaper is not designed and then found to have symmetry. It is the set of places a group sends a single mark, and once that is taken literally the pattern can be grown, checked, and caught out.

A conjugacy class of p4m. One conjugacy class of p4m drawn in place: every copy of the same symmetry that the group can carry onto every other. Conjugation was applied to each of the 8 operations by each of them in turn, and the kind and order of the result was checked to match every time.

The same symmetry, somewhere else

Two mirrors in a pattern can be the same symmetry or two different ones, and looking will not settle it. Conjugation is the operation that decides, and it turns an intuition about sameness into arithmetic.

Special positions in p4m. Every point of a 12×12 grid inside the cell of p4m, drawn at a size set by how many operations fix it. 80 of the 144 are general — nothing but the identity leaves them alone, so their orbit is the full 8 points. The other 64 are special, and fall into 3 kinds: 60 points fixed by 2 operations, with orbits of 4; 2 points fixed by 4 operations, with orbits of 2; 2 points fixed by 8 operations, with orbits of 1.

The points a group treats differently

Almost every point of a cell has an orbit as long as the group. The exceptions are the points some operation leaves alone, and they are where atoms sit, where a structure's formula comes from, and where a careless motif destroys the group it was meant to illustrate.

A fundamental domain for p4m. One representative from every orbit of p4m, shaded, with the images that tile the rest of the cell. The domain was found by computing orbits rather than by drawing a region, and every sample's orbit was checked to meet it exactly once — so the region has neither a gap nor an overlap.

The fundamental domain

The smallest piece of a pattern from which the group rebuilds the rest. Drawing one is easy and drawing one correctly is not, because a region with a gap or an overlap looks exactly like a region without.

The general positions of P2₁/c. Space group P2₁/c, number 14, projected down c on a primitive monoclinic cell. 12 general positions, the orbit of a three-point asymmetric motif, each labelled with its height along c and marked with a comma where the operation that produced it reversed handedness.

One part in however many, and why it is never quite that

A crystal's contents are the asymmetric unit repeated by the group. The unit's volume is the cell's divided by the order of the group — except that it is always a little more, and the excess is exactly the special positions counted whole.

p4 inside p4m, by area. A fundamental domain for p4m beside one for p4, drawn by the same construction on the same grid. p4 sits inside p4m with index 2: it has 8 ÷ 4 = 2 times as few operations to rebuild the pattern with, so it needs 2 times as much of the cell to rebuild it from — measured here at 1.51 times as many samples. The two domains are one region and 2 copies of it, and the ratio between them is the index rather than a coincidence of shape.

Domains of a subgroup

A group with half the operations needs twice as much of the cell to rebuild the pattern from. That single sentence is the index arithmetic of the whole classification, and it turns the containments among the seventeen into a statement about area.

The subgroups of p4m of index 2. p4m has 7 subgroup(s) of index 2 with cyclic quotient. 3 of them keep every translation and lose operations — the lattice is untouched and the pattern loses a symmetry at every point. 4 keep every operation and lose translations, and each is named beside the basis of the sublattice it keeps, written in the parent's own axes. Each subgroup is the kernel of a homomorphism onto a cyclic group, found by enumeration; each name is found by searching changes of basis and origin until the operation sets match exactly.

Two ways down from a group

A pattern can lose a symmetry by giving up an operation or by giving up a translation, and the two are different in kind. Sorting the seventy-four subgroups of index two among the seventeen splits them twenty-nine to forty-five — and a containment test that compares operations modulo one shared lattice can only see the twenty-nine.

The seventeen, arranged by what they can lose. Each group at the height of its own order, joined to every maximal subgroup that keeps all of its translations. Reading downwards is a crystal losing operations at a phase transition. The edges are the maximal ones only — every other containment is a path through these — and the whole graph is enumerated by closing every subset of each group's operations, so nothing is here because a table said so.

The descent with no shortcut

A subgroup can give up operations, or it can give up translations. Hermann's theorem says that a *maximal* subgroup does one or the other and never both at once — which is why a crystal losing symmetry can be followed one clean step at a time, and why every route from p6m down to p1 has exactly three steps.

The same pattern, described twice

Two coordinate lists for one structure can disagree in every number and describe exactly the same arrangement, because a group does not fix its own origin. The operations that may be applied to a description without changing what it describes are its normaliser, and they can be found by looking at pictures rather than at matrices.

Two half-turns make a translation. The half-turn about (0.25, 0.25) followed by the half-turn about (0.75, 0.5) is the translation by (1, 0.5) — twice the vector between the two centres, and not the vector itself. The open lens is a third centre, and it is not the midpoint of the two drawn: it is where the half-turn about the first lands when it is composed with one repeat vector of the lattice, which is half a repeat along. That is the step that puts two-fold centres on the half lattice and gives a p2 cell four inequivalent ones. Both the translation and the forced centre are computed from the operations and compared with the construction in exact rational arithmetic.

Where the product is

Composing two symmetries lands on a third — and the third one is somewhere. Two half-turns make a translation by twice the distance between their centres, and that single fact puts the lattice into a pattern before anybody chooses one.

What each group leaves distinct. The number of genuinely different ways of putting 2 species on the cells of a 4 × 4 block, for 9 plane groups. Every row starts from the same 65,536 arrangements; what differs is the group identifying them. Each count is Burnside's average of fixed points, and each was required to divide exactly by its group's order.

Counting what a group cannot tell apart

Sixty-five thousand ways of putting two species on sixteen sites; eight hundred and five structures. The difference between those numbers is not a division, because the symmetric arrangements have short orbits — and the count that gets it right is an average of fixed points.

p4g in 4 letters and 8 relations. The presentation of p4g, derived from the group's own operations. The two translations commute; each conjugation relation is read off a column of a matrix; and the point group's relations are corrected by the translation they actually come back as, which is what makes this group an extension rather than a semidirect product. Every relator is evaluated where the group lives and must be the identity, and coset enumeration on the letters alone returns 8, which is the order of the point group.

A group in four letters

Every other essay here describes a symmetry group by what it does to the plane. There is a second description — a handful of letters and the words in them that are required to equal nothing — and it can be counted with no plane anywhere in the computation.

p3m1 and p31m, told apart without a picture. The two groups this site returns to most often: same point group, same lattice, same number of operations, and distinguished in every other essay here by where their mirrors sit relative to the lattice — which is a fact about the plane. Abelianised, they are ℤ2 and ℤ6, which are not isomorphic. That difference is a fact about the groups: no change of basis, no redrawing and no relabelling can carry one to the other, and the argument never mentions a mirror line.

What is left when the order is forgotten

Abelianising a group throws away the order of the letters in every word and leaves a small abelian group behind. It is computed by a Smith normal form, it never mentions the plane, and it separates p3m1 from p31m — which a picture can only illustrate.

How few operations make a pattern

A plane group is infinite, and a handful of its operations is enough to rebuild all of it. How small a handful is a question with a floor from the abelianisation and a ceiling from an exhaustive search, and for fourteen of the seventeen the two numbers meet.

Subgroups of index two, three and four. Every plane group with the number of subgroups it has at each small index, counted by enumerating the transitive actions on that many points. The zeros are the interesting entries: p3 has no subgroup of index two and the four-fold groups have none of index three, because a subgroup of index n gives an action on n points and the group has to have a quotient that can act. A rotation of order three has nowhere to go in a set of two, and one of order four has nowhere to go in a set of three that is not the identity — so the index is constrained by the point group before any geometry is done.

How many subgroups of index three

Taking operations away and closing what is left finds the maximal subgroups and stops there. Counting instead the ways a group can act on three points finds all of them — and finds that a four-fold group has none of index three at all.

Telling two words apart

There are finitely presented groups in which no algorithm can decide whether two products of the generators are the same element. The seventeen are not among them, and the procedure that settles it is short enough to state in a sentence — which then makes it possible to measure how fast each group grows.

Every colour count at once

Eight hundred and five structures is the answer for two species on sixteen sites. For three species it is a different sum, and for four another. Averaging cycle counts instead of fixed-point counts turns the answer into a polynomial — and refining the same average says how many structures there are at each composition, which is the number anybody actually needs.

glide: 3 mirrors. A glide of the plane, drawn together with the mirrors it is a product of. The first shape is the motif; the pale ones are what each mirror in turn produces; the last is the image the motion itself gives. There are 3 mirrors, which is the smallest number that can produce this kind of motion, and their product was formed and compared with the motion before the figure was drawn.

Three reflections, and never four

Every motion of the plane is a product of mirrors, and the number needed is never more than three. That count is not a curiosity about mirrors — it is the classification of the four motions written as an integer, with the parity of the number deciding handedness and the geometry of the last two mirrors deciding everything else.

P4_1: a screw of 90°. One operation of P4_1, reduced to Chasles' three numbers: an axis, an angle of 90°, and a pitch of 1.25 along it. The points are the orbit of one position under repeated application, which climbs because the pitch is not zero — and it is not zero for any choice of origin, which is what makes this a screw rather than a rotation. It needs 4 mirrors, and their product was checked against the operation before this was drawn.

Every motion of space is a screw

A rigid motion of space that preserves handedness turns about some axis and slides along that same axis, and there is nothing else it can do. Rotations and translations are the two ends of that one description, the axis and the pitch are computed rather than recognised, and the operations a space group is made of stop being a list of kinds.

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.

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.

p1, p2, p4, p6m: every one quadratic. How many elements each group has at word length at most R, to 14 terms, against the same kind of generating set. Every curve is a quadratic in R — which is the group knowing its own dimension, since a crystallographic group of d dimensions grows like R to the d and nothing about the counting mentions the plane. The curves differ by a factor: p1 reaches 421, p2 reaches 786, p4 reaches 1464, p6m reaches 5478.

How fast a group grows

Take a wallpaper group, forget the plane, and keep only the generators and the rule for multiplying. Count the elements that can be spelled in at most R letters. The answer grows like R squared — for every one of the seventeen — and the group has told you the dimension of a plane it no longer knows about.

p4: a domain of 38 cells with 7 walls. The fundamental domain of p4 on a grid of 12ths, with the walls it shares with its neighbouring copies marked. Each wall names the element that carries this copy onto the copy across it, and there are 7 distinct such elements. Those elements generate the whole group — checked by closing them up and requiring every coset and the whole translation lattice to be reached, not assumed — which is Poincaré's theorem, and it means the generators of a wallpaper group can be read off a picture. The domain is pixelated rather than a polygon, so the wall count is a property of this domain and not of the group.

Every wall names a generator

The copies of a fundamental domain tile the plane and stand in one-to-one correspondence with the elements of the group. So the elements that carry the home copy across a wall generate everything — and the generators of a wallpaper group can be read off a picture rather than looked up.

The domain in reciprocal space

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

Dropping one invariant of 3m makes two orbits agree. Every lattice point within four cells of the origin, coloured by the values a proper subset of 3m's invariants takes on it — the 2 generators with the first one removed, over a window of 4 cells. With the full set, the 25 orbits of the group take 25 distinct sets of values, one each, so the invariants are a complete set of coordinates on the quotient. With one removed, the two circled points — in different orbits, so no operation of the group carries one to the other — take the same values and become indistinguishable. That is the whole content of the statement that a complete set of invariants separates orbits: the completeness is what is doing the work.

An orbit is what the invariants cannot tell apart

Two points of the plane lie in the same orbit of a group exactly when every invariant polynomial takes the same value on both. One direction of that is a definition; the other is a theorem, and it is checked here by comparing every pair of points in a window both ways.

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

Which modes a site can carry

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

One orbit of p4m, two of p4. The general position of p4m — 8 points in a cell, all equivalent under that group — with each point coloured by which orbit of p4 it belongs to. Losing half the operations does not move a single point; it changes which of them are related, and the one orbit becomes 2. An atom sitting on this position in the parent becomes 2 crystallographically distinct atoms in the child, which may then be different elements, or move independently, or order.

What a position becomes on the way down

Cool a crystal through a transition and it loses operations. Nothing moves — and one crystallographic site becomes two, which is how an ordering transition finds somewhere to put a second kind of atom.

Every subgroup of index two is normal; at index three most are not. For each of the seventeen plane groups, its abelianisation and the number of normal subgroups of each small index against the number of subgroups of that index. The index-two column is complete every time, because the left and right cosets of a subgroup of index two are the same pair of sets. At index three and four the two numbers part, and the gap is what normality costs: a subgroup that is carried to a different subgroup by some operation of the group it sits in.

The quotient each normal subgroup leaves

Two hundred and eighty-one subgroups of index four across the seventeen plane groups, and ninety-seven of them normal. Which ones, and what is left when they are divided out, needs no enumeration at all: below order six every group is abelian, so a normal subgroup of small index is a subgroup of the abelianisation and its quotient is decided by a product of greatest common divisors.

Four of the seventeen have a centre, and they are the four with no rotation. For each plane group: the order of its point group, how many of its operations are rotations, the lattice vectors every operation of the point group fixes, and the centre those vectors make. A central element must commute with every translation, which forces its linear part to be the identity — so the centre is a group of translations, and a translation is central exactly when the point group leaves it alone. A rotation leaves nothing alone but zero.

The four groups with a centre

An element that commutes with everything has to commute with every translation, and that forces its linear part to be the identity. So the centre of a plane group is a group of translations — the ones its point group leaves alone — and a rotation leaves nothing alone but zero. Four of the seventeen have a centre and thirteen have nothing at all.

The relations a polygon dictates

Poincaré's theorem has two halves. The walls of a fundamental domain name the generators, which is the half this collection already computes; walking round its corners names the relations, which needs a domain with corners rather than a domain made of pixels. Building the Dirichlet polygon exactly gives a presentation of each of the seventeen — and coset enumeration says every one of them is right.

The boundary a growing region forgets

Quoting a density assumes the region it was averaged over does not matter, and that assumption is a property of the group of translations rather than of the crystal. A ball in a plane group grows like R² and its boundary like R, so the edge becomes negligible — and where that fails, the average genuinely moves. The free group on two generators keeps two thirds of itself on the boundary forever, and a slab seven layers deep is wrong by exactly one seventh however wide it is made.

Four groups whose description count a metric can raise. Every plane group, the number of ways of writing one arrangement down on the lattice the group requires, and the number on the most symmetric lattice it may sit on. Eight groups already occupy the most symmetric lattice available to them and have nowhere to go. Four have a metric that raises the count, by two and in one case by six. The starred rows belong to groups whose normaliser has a free direction, where the quantity is a count of grid points rather than an index and cannot be compared.

The normaliser is not a function of the group

How many ways there are of writing one structure down is computed from the group and printed in a table beside its name. It is not a property of the group. Draw a p2 pattern on a hexagonal cell rather than an oblique one and the number goes from four to twenty-four, with nothing done to the group at all.

Seventy-two positions and the sets they fall into. Every plane group with the number of its Wyckoff positions, and the number of sets those positions fall into when the positions a normaliser exchanges are counted once: on the cell the group requires, on the most symmetric cell it may sit on, and under every change of basis carrying the group onto itself. 72 positions become 53 sets on the required cells and 51 on the best ones, and the last column never goes lower. The two groups a special cell changes are pmm and cmm.

The same site under two names

A structure report puts each atom on a Wyckoff position, and two correct reports of one crystal can name different positions. The positions that can trade places are exactly the ones the normaliser exchanges — and which those are depends on the cell as measured, not only on the group.

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.

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.

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.

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

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.

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.

All essays