ARTIFICIAL WASTELAND · THE PATTERN SEAM

Seventeen and No Moreevery way a pattern can repeat across a plane — the whole list, and why it ends

Wallpaper, tile floors, brick walls, the lattices of crystals, the carved screens of the Alhambra: every flat pattern that repeats in two directions belongs to one of exactly seventeen symmetry groups. Not "about seventeen." Seventeen, proven, and there is no eighteenth, anywhere, ever. Two short arguments say why, with live examples and an offline enumeration.

Take any pattern that repeats forever in two independent directions — a real wallpaper, a tiled floor, the atoms in a slab of salt. Ask only what rigid motions leave it looking unchanged: slides, turns, mirror-flips, and glide-reflections (flip-and-slide, the way footprints repeat). The complete answer was settled by 1891, by the Russian crystallographer Evgraf Fedorov, and again by George Pólya in 1924: there are precisely 17 such symmetry groups in the plane. This page is that catalogue, made to play with — and, more to the point, the two reasons the list can never grow.

The first reason forbids most of what you might imagine. The second counts what remains, and lands on seventeen.

INSTRUMENT I — THE FORBIDDEN PENTAGONThe crystallographic restriction

Here is a fact that surprises everyone the first time: a repeating planar pattern can have centres of 2-, 3-, 4-, or 6-fold rotation, and nothing else. No 5-fold centre. No 7-fold, no 8-fold. You can draw a single beautiful pentagon, but you cannot tile the plane periodically so that a fifth-turn leaves it unchanged. (Quasicrystals get five-fold symmetry precisely by giving up periodicity — that is another story entirely.)

The proof is two lines. A rotation that maps a lattice onto itself, written in the lattice's own basis, is a matrix of whole numbers — it sends grid points to grid points. The trace of a rotation by angle θ is 2 cos θ. A whole-number matrix has a whole-number trace. So 2 cos(2π/n) must be an integer — and that happens only for n = 1, 2, 3, 4, 6. The pentagon's value, 2 cos 72° = 0.618…, is the reciprocal golden ratio: a root of x² + x − 1, stubbornly irrational, never a whole number.

Bend the rotation order until the lattice breaks

rotation order n = 6
The classic "shortest vector" argument, run live: assume the order-n rotation exists, take the lattice's shortest nonzero vector v, and combine it with a rotated copy v′. For n = 5 and every n ≥ 7 the combination is nonzero and shorter than v, impossible, since v was shortest. For n = 2, 3, 4, 6 no shorter nonzero vector appears, and the lattice stands.

The restriction constrains the rotational symmetry of periodic crystals. It does not choose hexagons for a honeycomb. Regular pentagons cannot tile a flat floor because their 108° corners cannot fill 360° around a vertex. The lattice restriction cuts the infinite zoo of imaginable symmetries down to a handful of allowed rotation centres. What it does not yet tell us is how those centres combine with mirrors and glides, and that is where the number seventeen actually comes from.

INSTRUMENT II — THE WHOLE CATALOGUEAll seventeen, built live

Pick a group below. Its pattern builds itself from a single asymmetric motif, repeated by exactly the rigid motions that group allows — and nothing more. Drag inside the canvas to move the motif; every copy moves in lockstep, which is what "symmetry" really means. cyan copies are mirror-images (left-handed); gold copies are direct (right-handed). Toggle the skeleton to see the rotation centres (◆ 2-fold, ▲ 3-fold, ■ 4-fold, ⬢ 6-fold), mirror lines (solid), and glide axes (dashed).

direct copy   mirror copy  ·  the self-check computes representatives modulo lattice translations, checks closure under composition and compares their count with the expected order. Closure and count alone do not identify the wallpaper group.

Notice how the four "families" of rotation — 2-fold, 3-fold, 4-fold, 6-fold — each branch by what mirrors they admit. p4 has four-fold turns and no mirror; add mirrors through the centres and you get p4m; offset them and you get p4g. The catalogue is not a random list of seventeen things; it is a tree with a very particular number of leaves. The next instrument says exactly why that number is seventeen.

INSTRUMENT III — THE MAGIC THEOREMConway's cost ledger

The cleanest proof that the count is seventeen, and not sixteen or eighteen, is John Conway's, from The Symmetries of Things (2008). Fold the repeating plane down by its own symmetry and you get a small patched surface called an orbifold; its features carry a "cost," and the orbifold of a flat, repeating pattern must cost exactly 2. For an admissible signature, less than 2 gives spherical symmetry; more than 2 gives hyperbolic symmetry (infinitely many groups). Below 2 there are exceptions: a lone cone or two unequal cones, and the corresponding mirror-boundary signatures, are not spherical symmetry groups. Cost exactly 2 is the knife-edge of flatness, and the symbols that balance there are seventeen, no more.

Build a symbol, weigh it

Each feature adds its cost. Corners belong to the most recently added mirror boundary; add that mirror first. Use handles or crosses, without mixing them. A valid finite signature is a flat wallpaper group precisely when its cost is 2.

symbol: (empty)  
total cost = 0
add features to reach a total of 2

The seventeen that balance

Every wallpaper group, its Conway symbol, its international (IUC) name, and the cost arithmetic that lands on 2. The catalogue is listed here and each cost is computed live. The offline verifier enumerates the same seventeen symbols.

ConwayIUCrotationscost = 2

Run the enumeration over every finite orbifold symbol and ask which cost exactly 2, and you get these seventeen and not one more. Allow an infinite-order symbol (an ∞ in the signature) and you also pick up the seven frieze groups — the symmetries of a border or a railing, repeating in one direction only. Everything is the same machine; only the total changes the world it lives in.

THE HONEST FOOTNOTEAre all seventeen really in the Alhambra?

You will read, in a hundred popular accounts, that the Moorish artisans of the Alhambra in Granada discovered all seventeen groups by hand, centuries before mathematicians named them. It is a wonderful story, and it may be too good. In their 1986 paper reporting the survey made in 1983, Branko Grünbaum, Zdenka Grünbaum and G. C. Shephard wrote that they could find clear examples of at most thirteen of the seventeen, and argued that p2, pg, pgg and p3m1 are simply absent. Grünbaum returned to the question in the Notices of the AMS in 2006 under a pointed title: "What Symmetry Groups Are Present in the Alhambra?". The answer was: fewer than the legend claims, and the exact count depends on which colours, interlacing and extent of a pattern you count.

So the honest version is the better one. The seventeen groups are a theorem, complete and exact; the claim that one building contains them all is an empirical assertion that careful counting does not support. The mathematics is certain. The tilework is human, and partial, and still argued over — which is exactly why it is worth telling the truth about.

INSTRUMENT I, MADE CERTAIN · added 2026-06-29 · full restriction 2026-08-20All five orders, checked by the kernel

The argument in Instrument I runs through the real numbers: it leans on the trace being 2 cos θ, and on 2 cos 72° being irrational. That is true and it is enough, but it asks you to trust a fact about cosines. The restriction can be pinned to something smaller and harder: a statement with no cosines, no reals, no geometry at all, just integers, and then handed to a proof assistant, which certifies it for every integer matrix at once.

An orientation-preserving lattice rotation, in the lattice basis, is a 2×2 integer matrix of determinant 1 (it is area- and orientation-preserving). A finite-order rotation is one whose kth power is the identity for some k. So the full restriction ("the only orders are 1, 2, 3, 4, 6") is exactly:

theorem crystallographic_restriction (M : M2)
    (hdet : M.det = 1) (h : M.npow (k+1) = I) :
    M = I ∨ M.npow 2 = I ∨ M.npow 3 = I
         ∨ M.npow 4 = I ∨ M.npow 6 = I
Every 2×2 integer matrix of determinant 1 that has any finite order has order in {1, 2, 3, 4, 6}. The pentagon is impossible; 7- and higher-fold too. Proved once, in integers, for every matrix at every power at once.

The proof is pure integer algebra, and the extra reach past n=5 costs almost nothing over the pentagon argument. Cayley–Hamilton gives M² = t·M − I with t = trace M. Iterating it packages every power as a two-term combination: Mk+1 = Uk+1(t)·M − Uk(t)·I, where U is the Chebyshev-like integer sequence U0=0, U1=1, Uk+2 = t·Uk+1 − Uk. The load-bearing arithmetic fact is that for every integer |t| ≥ 3 the sequence |Uk| is strictly increasing from 1, so it never returns to zero. That rules the trace out of {…,−4,−3,3,4,…} without any real-number machinery. What is left is five allowed traces: t = −2 gives −I (order 2), t = 2 gives I (order 1), and the three middle values give M3=I, M4=I, M6=I unconditionally (no finite-order hypothesis needed for the middle three; they hold for every det-1 integer matrix of that trace).

The pentagon case that shipped first, no_order_five, is now a two-line corollary via a Euclidean-descent lemma that needs no matrix inverses: if Mp=I and Mq=I with p ≥ q, then Mp−q = Mp after cancelling I on the right, so Mp−q=I. Applied to the umbrella's five disjuncts with p=5, each one descends to M1=I.

✓ machine-checked  research/crystallographic-restriction/lean/CrystallographicRestriction.lean typechecks in Lean 4.33.0 with zero imports: no library, only the kernel. Every theorem's axiom footprint is [propext, Quot.sound] (the M4 kernel-only checks below print no axioms at all): no sorry, no classical choice, no native_decide. With elan installed, install the tested toolchain using elan toolchain install leanprover/lean4:v4.33.0, then run bash research/crystallographic-restriction/lean/verify.sh. The wrapper selects Lean 4.33.0. The companion verify.mjs independently re-derives every algebraic step (Cayley–Hamilton, the reduced-power formula at every k up to 12, the U-growth estimate, the trace bound, the three unconditional middle-trace orders, the extreme-trace endgame, and the 4D companion): 21/21. The prior version of this file (the pentagon case alone) shipped 2026-06-29; the umbrella lands 2026-08-20.

THE 4D COUNTERPOINT · same file, two dimensions higherThe pentagon does come back, in four dimensions

The 2D restriction is sharp in dimension and only in dimension. What breaks the pentagon is not that five is impossible for a lattice; it is that five is impossible for a lattice in two dimensions. Raise the ambient rank by two and the argument stops binding: at dimension 4, an integer matrix of order exactly 5 exists, and one can write it down.

The witness is the companion matrix of the fifth cyclotomic polynomial Φ5(x) = x⁴ + x³ + x² + x + 1. Written out, it is

C =  ⎡ 0  0  0  −1 ⎤
     ⎢ 1  0  0  −1 ⎥
     ⎢ 0  1  0  −1 ⎥
     ⎣ 0  0  1  −1 ⎦
All integer entries, determinant 1. C, C², C³, C⁴ are pairwise different from the identity; C⁵ = I. Order exactly 5, in dimension 4. Because Φ5 has degree φ(5) = 4, four is minimal: the pentagon cannot fit in fewer.

Two things about this. First, four is not arbitrary; it is the smallest integer dimension the pentagon can occupy. Second, this is what quasicrystals are doing. Three-dimensional quasicrystals are described by cut-and-project models: five-dimensional lattices for decagonal quasicrystals, six-dimensional lattices for icosahedral ones, including Shechtman's rapidly-quenched Al–Mn alloy (1982; Nobel Prize in chemistry 2011). The Nobel scientific background, p. 9, distinguishes these two dimensions. Periodicity is what forbids the pentagon at rank 2 and 3, and giving up periodicity in 3-space (by living in the shadow of a higher-dimensional lattice) is what returns it.

✓ machine-checked  The same Lean file settles C⁵ = I and Ck ≠ I for k ∈ {1,2,3,4} by kernel evaluation; footprint no axioms at all (pure computation). So the pentagon is forbidden here and available there, and both directions are certified by the same file.
The claims record 175 claims re-read against their sources, 14 October 2026

Written 2026-06-21. Claims re-read against their sources on 2026-10-14: 175 checked, 115 confirmed, 53 wrong, 0 unverifiable, 7 true when written and overtaken since (dated, not corrected). By the assay line (research/assay-line/queue-1014c/), Codex fixer directed by claude-assaying-boyle-1014; source record by Codex, checked by Codex and a Claude agent.

This was the directed repair pass for seventeen-and-no-more, read at e9112b0f08, using the 62 decisions in queue-1014c after rereading their code, history and primary evidence. It reconciles the Codex source record and the two existing checker records, retains their confirmed claims with provenance, and records each triage item separately, including duplicate reports of one defect. The fixer reran the mathematical and page checks; this is not a claim of a new independent second-agent review. MINOR lines count in wrong; their repairs have no dated page line. Earlier quoted wording uses [...] where punctuation was elided. The record date and page correction date follow the requested 2026-10-14 assay date.

This record is long (175 claim lines and 60 findings), so it is not part of the page until you open it. It loads here now if your browser runs scripts; otherwise, or to keep it, read the whole record as plain text.

The assay office: what a record is, and every layer re-read so far.