Crystallography & Symmetry
patterns derived from their groups
Concept

Commutator — where it appears

The element g h g⁻¹ h⁻¹, which is the identity exactly when g and h commute. For two turns of the plane it is always a translation, and in a group of motions it measures how far the group is from being commutative.

Named by 5 essays across 3 fields — each of them below, with the objects they name alongside it.

p3m1 and p31m, told apart without a picture. The two groups this site returns to most often: same point group, same lattice, same number of operations, and distinguished in every other essay here by where their mirrors sit relative to the lattice — which is a fact about the plane. Abelianised, they are ℤ2 and ℤ6, which are not isomorphic. That difference is a fact about the groups: no change of basis, no redrawing and no relabelling can carry one to the other, and the argument never mentions a mirror line.

What is left when the order is forgotten

Abelianising a group throws away the order of the letters in every word and leaves a small abelian group behind. It is computed by a Smith normal form, it never mentions the plane, and it separates p3m1 from p31m — which a picture can only illustrate.

operations · Presentations Two turns and their undoing leave a slide. A turn g by 90° about the point c and a turn h by 60° about d. The marked point p is carried back 60° about d, back 90° about c, forward 60° about d and forward 90° about c, and does not return: it arrives displaced by a vector of length 2.371, which is 4·sin 45°·sin 30°·|c − d|. Two other points put through the same four motions move by the same vector, drawn beside them, because the commutator g h g⁻¹ h⁻¹ of two rotations of the plane is a translation — (I − A)(I − B)(c − d) exactly — whatever the angles and the centres.

What forces a lattice

Every enumeration here starts from a lattice of translations, and the lattice is usually taken as given. It need not be. A group of motions that is discrete, and leaves no point far from an orbit, has to contain one — in the plane by an argument four lines long, each line a picture, and in space by an inequality whose threshold turns out to be the six-fold rotation.

restriction · Finiteness An orbit on a parabola, discrete and cocompact. The images of the origin under the group generated by two commuting affine maps of the plane: A slides one step along x and lifts y by the x it started at plus a half, and B is the translation by one in y. The images are the points with whole-number first coordinate and second coordinate a whole number above half the square of it, so the large dots lie on the dashed parabola and the small ones are the rest of the orbit. No two distinct images come closer than 1.000, and no point of the square between the axes lies farther than 0.610 from one — so the action is discrete and its quotient is compact, which is exactly what Bieberbach's first theorem asks for.

Straight lines, and no distances

Every finiteness met so far rests on the motions preserving a metric, because the trick that produces one is an average and an average needs something to average over. Keep the straight lines and drop the distances, and Bieberbach's first theorem is false in the plane — by an example two lines long, whose group is the plane's own translations and whose translations have rank one.

restriction · Finiteness One invariant for every invertible chain. The quantity x² + y² + z² − 2xyz − 1, built from the half-traces of the transfer matrices of the two words a substitution produces at each level and of their product, for six substitutions at one energy, logarithmic. For the golden, silver and bronze chains and for the golden rule reversed it is V²/4 = 0.09 at every level — the same number for all four, computed in exact integers. For period-doubling and Thue–Morse it wanders by orders of magnitude from one level to the next.

One invariant for every chain that can be undone

The Fibonacci chain's transfer matrices obey a recursion with a quantity it cannot change, and the natural guess is that every quasiperiodic chain has its own. It does not. The conserved quantity is the trace of the commutator of the two tiles' matrices, so every chain a reversible substitution builds from the same two tiles — golden, silver, bronze — conserves the same number, exactly, at every length and every energy. Period-doubling and Thue–Morse, whose rules cannot be undone, conserve nothing.

aperiodic · Quasicrystals Tribonacci keeps one number at every length, and its neighbours do not. The size of tr(ABC) − tr(ACB), computed in exact integers on three two-site tiles, at each application of four rules, on a logarithmic scale. Under tribonacci it stays 24 while the traces themselves reach dozens of digits. Under the plastic rule and the rule x³ = x² + 1, both of which can be undone, it wanders and grows. Under a rule that cannot be undone it passes through zero and runs off the scale.

Three tiles keep a number that asks which way they face

Two tiles always conserve something: every reversible rule keeps the trace of their commutator. Three letters were expected to conserve nothing, and most rules do conserve nothing. The tribonacci rule keeps exactly one number, the difference between a product of three matrices and the same product reversed. It is zero for any tile that reads the same both ways, so it measures direction rather than difference, and one rule in fifty keeps it, for a reason that can be read off the words.

aperiodic · Quasicrystals

Named alongside it

The objects these essays reach for when they reach for this one.

InvariantAutomorphismCovering radiusDiscretenessFinite groupFixed pointInflation factorLattice translationSubstitutionTraceTransfer matrixTranslation group

All concepts