Generator

Which rotation orders each dimension permits

Which rotation orders each dimension permits
Which rotation orders each dimension permits. An n-fold rotation of a lattice is an integer matrix of order n, and the smallest one lives in φ(n) dimensions. Every order up to 14, against the dimensions drawn here: 2 admits 1, 2, 3, 4, 6; 3 admits 1, 2, 3, 4, 6; 4 admits 1, 2, 3, 4, 5, 6, 8, 10, 12.

An n-fold rotation of a lattice is an integer matrix of order n, and the smallest one lives in φ(n) dimensions. Every order up to 14, against the dimensions drawn here: 2 admits 1, 2, 3, 4, 6; 3 admits 1, 2, 3, 4, 6; 4 admits 1, 2, 3, 4, 5, 6, 8, 10, 12.

7 essays call totient-restriction. 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 48 point symmetries of a cubic lattice. Every operation that maps a cubic lattice onto itself, built as the integer matrices preserving that system's metric: 48 of them, of which 24 are proper rotations and 24 reverse handedness. The orders occurring among the rotations are 1, 2, 3, 4 — the same list the plane gives, so the crystallographic restriction does not change in three dimensions, and there is no six anywhere. The 13 rotation axes are counted from the rotations they carry rather than drawn from memory, and every rotation but the identity is checked to belong to exactly one of them. What a lattice forbids

The restriction in three dimensions

Space is roomier than the plane in every other respect, so the natural expectation is that it permits more rotation orders. It permits exactly the same five, and seeing why is more interesting than the result.

An integer matrix of order 5. The companion matrix of the 5th cyclotomic polynomial has whole-number entries and order exactly 5, so it is a genuine 5-fold symmetry of a 4-dimensional lattice. The plane it rotates sits at an irrational angle to that lattice, and the lattice's shadow on it is dense — which is why a projection needs a window before it becomes a pattern. What a lattice forbids

Where five-fold becomes legal

A five-fold rotation with whole-number entries exists — in four dimensions, as a four-by-four matrix that can be written down. The plane forbids it because the plane is too small, and knowing which dimension is large enough changes what a quasicrystal is.

The icosahedral group, counted. The sixty rotations of an icosahedron, found by trying every map that sends one adjacent pair of vertices to another and keeping those that carry the whole vertex set onto itself. They fall into 6 axes of order 5, 10 axes of order 3, 15 axes of order 2 — and the fivefold axes are the reason this group cannot be the point group of any crystal, since no three-dimensional lattice admits a rotation of order five. Quasicrystals have it anyway, which is what made 1982 an argument rather than a measurement. Order without repetition

Icosahedral symmetry

Sixty rotations, six fivefold axes, and no lattice in three dimensions that can hold any of them. It is the point group a crystal is forbidden, and the one the first quasicrystal turned out to have.

Why the seventeen is a number at all. The classification is finite because three counts in a row are finite, and the first two are where the work is. Finitely many lattice types, because a lattice's symmetry group is a finite group of integer matrices; finitely many such groups, by Minkowski's lemma and his bound; and finitely many ways to attach translations to each, which is the extension problem. Every step is a count this site makes elsewhere — five, thirteen, seventeen — and this is the reason each of those searches was allowed to stop. What a lattice forbids

Why there is a list at all

Five lattices, seventeen groups, thirty-two classes, two hundred and thirty. Every one of those counts came out of a search that had to know when to stop, and the reason it could stop is a divisibility Minkowski proved in 1887.

66 squares and 106 rhombs. The Ammann–Beenker tiling, built by keeping the points of a four-dimensional lattice whose companion image falls inside an octagon and projecting them into the plane. Every tile has the same edge length; the squares and the forty-five degree rhombs are told apart by their diagonals. Nothing was placed — the faces were found among the projected points. Order without repetition

Eight-fold, with the golden ratio taken out

Every quasicrystal on this site has been built on five: Penrose's rhombs, the Fibonacci chain, the ten-fold pattern Shechtman measured. A method that works only on the golden ratio is a method tuned to its answer — so here is the same construction run on eight, where the irrational is √2 and nothing else changes.

Rotation orders 1, 2, 3, 4, 6 and no others. Every net in this collection, with the orders of the rotations its own symmetry group has, and the degrees of its vertices beside them. The orders are 1, 2, 3, 4, 6 — the crystallographic restriction, arrived at with no length anywhere in the argument: the translations of a net are ℤ² by construction, an automorphism carries translations to translations, so it acts on ℤ² by an integer matrix, and an integer trace in the interval from minus two to two is one of five numbers. The degree column is there because the two are constantly confused: a net may perfectly well have vertices of degree five, and one here does. What a lattice forbids

The restriction, with no lattice assumed

The proof that only two-, three-, four- and six-fold rotations are possible is usually stated about a lattice, and every step of it turns out to need no lengths at all. A periodic graph has the same theorem, proved the same way — and a graph may have a five-fold symmetry the plane cannot receive.

Four angles, and the integer that picks them. Two roots at angle θ have Cartan integers whose product is 4cos²θ. Both are whole numbers and the product is below four, so it is nought, one, two or three — and each value fixes the angle between the two roots, and with it the angle between the mirrors perpendicular to them. The shaded wedge is the region the pair of mirrors folds the plane onto; the smaller it is, the larger the group they generate. What a lattice forbids

Four root systems, and the same four rotations

Two mirrors meeting at an angle generate a group. Ask that the group be finite and that a certain pairing between the mirrors come out a whole number, and the angle has only four possible values — from which the rotations that survive are of order two, three, four and six. The crystallographic restriction arrives with no lattice anywhere in the argument.

The whole library · All essays