🀄 Wallpaper Symmetry Groups

A wallpaper group is a mathematical classification of the symmetries of a pattern that repeats infinitely across a two-dimensional plane. Each group is defined by which combination of translations, rotations, reflections and glide reflections maps the pattern onto itself, without changing its appearance.

The crystallographic restriction theorem limits the rotational symmetries compatible with a repeating lattice to orders 1, 2, 3, 4 and 6, and combining these allowed rotations with the possible reflection and glide-reflection symmetries yields a finite list. Evgraf Fedorov proved in 1891, and George Pólya independently confirmed in 1924, that this exhaustive combinatorial classification produces exactly 17 distinct groups, no more and no fewer.

Both groups have 90° rotation centers at every lattice point on a square lattice. The difference is reflection: p4 contains only rotations, with no mirror symmetry anywhere, while p4m adds four mirror axes through each rotation center, forming the full dihedral symmetry group of order 8 rather than the pure rotation group of order 4.

A glide reflection combines a mirror reflection across a line with a translation by half a lattice period along that same line. It is a distinct symmetry operation from an ordinary mirror reflection or a plain translation — groups like pg contain glide axes but no true mirror lines at all, which is what makes pg visually and mathematically different from pm.

All 17 wallpaper groups can be found in the tile mosaics of the Alhambra palace in Granada, created centuries before the classification theorem existed, and M. C. Escher studied those same tilings to build his own interlocking symmetric prints. Crystallographers also use the wallpaper group classification to describe the symmetry of two-dimensional atomic layers, surface structures and thin films.