Math Labs

Worked solution: Smith–Myers–Kaplan–Goodman-Strauss's aperiodic monotiles: the hat and the Spectre (2023)

Step 1 of 8: The "hat": a 13-sided polykite built from eight kites
In plain words

Take a standard tiling of the plane made from identical kite shapes — quadrilaterals that look like the paper kites children fly — arranged 44 around every vertex in a repeating pattern. Now glue exactly eight of these kites together, in a specific pattern, into a single 1313-sided outline. That single glued-together piece is the "hat".

The surprise is that this one modest-looking shape can tile the entire infinite plane with no gaps or overlaps, yet it can never do so in a way that repeats itself by sliding — no matter how you arrange copies of it, the pattern never has translational symmetry.

That=K1∪K2∪⋯∪K8(kites from the [3.4.6.4] Laves tiling)T_{\text{hat}} = K_1 \cup K_2 \cup \cdots \cup K_8 \quad (\text{kites from the } [3.4.6.4] \text{ Laves tiling})
Detailed analysis

The hat is a polykite: its boundary is a union of edges of the kite-shaped tiles of the Laves [3.4.6.4][3.4.6.4] tiling (the dual of the Archimedean (3.4.6.4)(3.4.6.4) tiling, in which every vertex is surrounded by a triangle, two squares and a hexagon). Eight of these kites assemble into the 1313-sided, 60∘60^\circ-lattice-aligned shape That=K1∪⋯∪K8T_{\text{hat}} = K_1 \cup \cdots \cup K_8; all its edge directions lie in the 1212 directions of the triangular lattice, which is what makes its tilings amenable to combinatorial — rather than metric — analysis.

The discovery was empirical before it was rigorous: David Smith generated large patches with Myers's polyform tiling software and Kaplan's Heesch-number program. A tile that fails to tile the plane has a finite Heesch number (the number of concentric coronas it can support); the hat's patches already exceeded the previous record of 66 coronas, and forcing a periodic tiling would have required isohedral number at least 6464 — either observation alone signalled an extraordinary tile.

Everything proved about the hat is relative to the tiling convention used: tiles may be rotated, translated and reflected. The proof that follows splits into a geometric argument that no periodic tiling exists (Step 3), and a hierarchical-substitution argument that tilings exist and are forced into a unique non-repeating structure (Steps 4–6); the two halves are logically independent.

Terms in this step
Polykite
A shape formed by gluing together several copies of a kite (a quadrilateral with two pairs of adjacent equal sides) from a fixed kite tiling, edge-to-edge.
Heesch number and isohedral number
The Heesch number of a shape is the largest number of complete concentric rings of copies that can surround it without gaps (infinite if it tiles the plane); the isohedral number of a tiling is the smallest number of orbit classes its tiles fall into under the tiling's symmetries.
Knowledge used in this step