Generator

Thirteen ways to hold a lattice — the arithmetic classes generator

Thirteen ways to hold a lattice

Every finite group of integer matrices in two dimensions, up to a change of integer basis: 13 of them. Ten different abstract groups appear, and three of the ten hold a lattice in two inequivalent ways — a mirror along an axis or along a diagonal, and the same for 2mm and for 3m. The enumeration is a search: every subgroup of the two maximal holohedries, merged by conjugacy under integer matrices of determinant ±1, with the answer checked for not depending on how wide the search was.

3 essays call arithmetic-classes. 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.

What a lattice forbids

Thirteen ways to hold a lattice

The crystallographic restriction is about one matrix. A crystal has a whole group of them acting on one lattice at once, and asking how many such groups there are gives thirteen — not the ten of the plane point groups, and not the seventeen of the plane groups.

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.

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.

The whole library · All essays