Crystallography & Symmetry
patterns derived from their groups
Generator

The wallpaper group p4m

The wallpaper group p4m
The wallpaper group p4m. A pattern with the symmetry of p4m, generated by applying the group's 8 operations to an asymmetric motif and repeating across the lattice. The symmetries of the result were then found independently and match the group exactly.

A pattern with the symmetry of p4m, generated by applying the group's 8 operations to an asymmetric motif and repeating across the lattice. The symmetries of the result were then found independently and match the group exactly.

24 essays call wallpaper. 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 393 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.

The hexagonal lattice. Every periodic pattern in the plane repeats on one of five lattices. The classification is by which point symmetries the lattice itself admits, and the five are exhaustive — a sixth would need a rotation order no lattice can carry. Lattices

The lattice underneath

Strip a pattern of everything but its repeats and a grid of points is left. That grid is not decoration — it is the object that decides which symmetries the pattern is permitted to have.

 The seventeen wallpaper groups. Every way of repeating a pattern across the plane, one cell of each. Each tile was generated from its group's operations and then examined independently to confirm it has exactly those symmetries and no others. The classification

The seventeen

Every way of repeating a pattern across a flat surface, exhibited rather than tabulated. The number is a theorem with a finite proof, and the proof is walkable in an afternoon.

 The wallpaper group p4m. A pattern with the symmetry of p4m, generated by applying the group's 8 operations to an asymmetric motif and repeating across the lattice. The symmetries of the result were then found independently and match the group exactly. The classification

Reading Hermann–Mauguin

p4g looks like a licence plate and is in fact a set of instructions. Half an hour with the rules turns the seventeen from a list to be memorised into a notation that can be read.

 The wallpaper group p3m1. A pattern with the symmetry of p3m1, generated by applying the group's 6 operations to an asymmetric motif and repeating across the lattice. The symmetries of the result were then found independently and match the group exactly. The classification

p3m1 and p31m

Two groups with the same lattice, the same point group and the same number of operations, differing only in where the mirrors sit. The pair is the clearest evidence that position is as much a part of a symmetry as presence.

 Two cells of equal area on one rhombic lattice. One lattice — the rhombic lattice that cm sits on — with two parallelograms drawn on it: the conventional cell, and a sheared cell whose edges are the integer combinations (1, 0) and (1, 1) of it. The points are identical in both outlines; only the description changes. Each cell's contents were counted by writing every lattice point in that cell's own coordinates and sharing each one out between the cells that meet at it — a quarter at a corner, a half on an edge, one inside — and the totals come to 1 and 1, which are the determinants of the two matrices. The alternative has determinant one, so its inverse is integral and it generates exactly the same lattice; that is the whole condition, and it is why a lattice has infinitely many bases and no arithmetic can prefer one. Lattices

The cell is a choice, the lattice is not

Every lattice has infinitely many unit cells and infinitely many bases, and crystallography picks one by convention. Knowing which convention is in force is the difference between a symbol that means something and a symbol that means nothing.

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

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.

 One lattice, two cells, and the absences the choice creates. The same set of points described on a centred rectangular cell and on its primitive rhombic cell, with what the centred description scatters. Half the reflections vanish, and they vanish because of how the cell was drawn rather than because of anything the crystal does. Lattices

Centring, and why cm is not pm

A centred cell has a lattice point in the middle and twice the area it needs, and crystallography prefers it anyway. The preference has a price, and the price is paid in reflections that vanish for reasons that have nothing to do with the crystal.

 Why p4 cannot be drawn with dots. The same group applied to a single dot and to a motif with no symmetry of its own. The dot's orbit turns out to have more symmetries than the group it was made with, so a figure drawn that way illustrates a different group from the one in its caption. The classification

The motif must be a comma

A dot is too symmetric to illustrate most wallpaper groups. Its orbit acquires mirrors nobody asked for, and the resulting figure is quietly of a different group from the one in its caption.

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

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.

 The crystal classes 3m, 3̅m, 6̅2m. 3m, 3̅m, 6̅2m: the orbit of a general direction under each group, giving 6, 12, 12 poles, with general positions and symmetry elements. Filled marks are poles above the plane of the page and open ones below it. What symmetry decides

3m1 and 31m are one class

This site has an essay arguing that p3m1 and p31m are genuinely different groups. As point groups the same two objects are one class — and the two subgroups are each normal in the hexagonal holohedry, so nothing in the lattice relates them. What does is a rotation of thirty degrees.

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

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.

 p4m, displaced and then measured. Every atom of a p4m pattern moved by up to 1.2 per cent of a cell edge, and the resulting positions examined at 26 tolerances. At zero tolerance only the identity survives, so the structure has no exact symmetry whatever. Between 0.021 and 0.094 the count sits at 8, which is the group that was displaced. Above that it climbs to 15, accepting operations no version of this pattern has. The climb is not even steady: at 4 of the 25 steps the count falls as the tolerance is loosened, because operations accepted separately at one threshold merge into one at the next. The correct answer is a step on a staircase and nothing in the coordinates says which step. How it is known

Near-symmetry, and the tolerance that is not here

Every claim on this site is decided by integer arithmetic, so no threshold is ever chosen. Measured coordinates do not arrive that way, and the moment a tolerance is introduced the answer stops being a fact about the structure and becomes a fact about the threshold.

 A fundamental domain for p6m. One representative from every orbit of p6m, 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 classification

Orbifold notation, the shorter language

Fold a pattern up along its own symmetries and what remains is a small surface with marked points. Its shape is a complete name for the group, and reading the name off costs an arithmetic sum that has to come to two.

 The friezes inside the seventeen. Every plane group contains frieze groups: keep only the operations that map one lattice row onto itself and what is left is a group on a strip, which must be one of the seven. Across all seventeen plane groups and their principal directions, all seven frieze groups appear. The commonest is p2, in 9 of the 32 rows examined. The classification

The friezes inside the seventeen

Take one lattice row of a wallpaper pattern and keep only the symmetries that leave that row where it is. What survives is a frieze group — and which of the seven it turns out to be is a fact about the plane group that its symbol does not state.

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

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

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.

 Every group decided by a window of radius 1. For each of the seventeen, the radius at which a round window on the pattern admits exactly the group's own operations and no others — with the numbers it admits at each smaller radius beside it. Two opposite failures are visible. Most groups under-report at small radii, because an operation carrying points out of the window cannot be tested at all; cm over-reports, admitting operations the pattern does not have. The groups that take longest to settle are the ones distinguished by a glide, which moves a point half a cell before anything can be compared. The classification

How much pattern is enough

Every claim here about a pattern's group is a claim about an infinite pattern. A reader sees a patch. Measuring what a finite window can decide gives a number — about one cell's radius — and two opposite ways of being wrong on the way there.

 Modulo 3 injective on all thirteen, modulo 2 on 5. Minkowski's lemma says the kernel of reduction modulo an integer of at least three is torsion-free, so a finite group of integer matrices is carried faithfully into a finite group of matrices over ℤ/3 — which is why the classification is finite, before any bound is computed. The middle column checks it on every finite subgroup of GL(2,ℤ) there is: thirteen classes, no collapses. The right column is the case the lemma has to exclude. Modulo 2, minus the identity is the identity, and 8 classes lose operations. What a lattice forbids

Reduction modulo three

A finite group of integer matrices survives being reduced modulo three: no two of its operations collide. That single fact proves the classification finite without computing any bound — and modulo two it is false, refuted by the inversion centre.

 p1 folds into a torus. The cell of p1 with its edges marked as the group joins them: both pairs by a plain translation, both arrows the same way round. Gluing top to bottom gives a tube and gluing its ends gives a torus. Nothing in p1 holds a point still, so the surface has no marked points and its first homology is two copies of the integers. The classification

The two that fold into a surface

Fold a wallpaper pattern along its own symmetries and what is left is usually a shape with corners and edges nobody drew. For two of the seventeen it is a plain surface with no marks on it at all — a torus and a Klein bottle — and which two is decided by a single question asked of every operation.

 18 extension classes, 17 groups. Each of the thirteen arithmetic classes with the number of ways translations may be attached to it — its cohomology — the shape of that group, and how many distinct plane groups the classes come to once the changes of basis that are mere relabellings are quotiented out. The two columns differ in exactly one row, 2mmp, where four extension classes are three groups because two of them are the same group with the axes swapped. No lattice is drawn anywhere in this computation. The classification

Seventeen, without a picture

Every other count of the plane groups has a plane in it — a pattern generated, a domain folded, an orbifold's curvature spent. The same seventeen come out of pure algebra: attach translations to a point group, keep the assignments that close, throw away the ones that differ only by where the origin was put, and add up over the thirteen arithmetic classes.

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

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 from 3 orbits of waves — detected p4m. A density built as a sum of 3 symmetry-adapted waves of p4m, each of them the average of a plane wave over the group, shaded from light to dark across one cell. The level set of this density — the darkest points of it — was handed to the same detector the pattern figures use, and it reports p4m, which is exactly the group the waves were built from. The waves are invariant by construction, so the density can never have less symmetry than the group; the interesting direction is the other one. The classification

How many waves a group permits

A pattern can be written as a sum of waves instead of as an orbit of a motif, and then the group ties the coefficients together and forbids some outright. Building a density from the permitted ones and handing it back to the detector closes the same loop through a different door — and at low resolution the density has symmetry the crystal has not.

 3m → 1: the two directions a wall between domains may take. The difference between the strains of two domains, sampled around a circle of directions: the first colour where that direction is stretched, the second where it is compressed. The two solid lines are the directions where it is neither, and those are the only orientations a straight wall between the two domains can take without straining itself — Sapriel's condition, one dimension down from the planes it is usually written for. There are exactly two, and that is not luck: the two domains are images of one another under the parent group, so their strains have the same area change and their difference changes no area at all. A form that changes no area takes both signs, and its zero set is a pair of directions. Symmetry at work

The walls a strain permits

Two domains of different shape can only meet along a line neither of them stretches. That condition is a quadratic in a direction, so a pair of domains has exactly two permissible walls — and the reason there are always two rather than sometimes none is that their strains differ by no area at all.

 p2's symmetries, sorted into classes by the group itself. A pattern with the symmetry of p2 over 2 by 2 cells, with its rotation centres and mirror lines marked in the International Tables' shapes and coloured by conjugacy class in the infinite group: two marks share a colour exactly when some operation of the group carries one element onto the other. Where rotations of several orders share a centre, the mark is the highest order's and so is its colour. Glides are not drawn. Classes counted: half-turns: 1 in the quotient, 4 in the group. Operations

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.

The whole library · All essays