Subgroups — the series
-
Two ways down from a group
A pattern can lose a symmetry by giving up an operation or by giving up a translation, and the two are different in kind. Sorting the seventy-four subgroups of index two among the seventeen splits them twenty-nine to forty-five — and a containment test that compares operations modulo one shared lattice can only see the twenty-nine.
-
The descent with no shortcut
A subgroup can give up operations, or it can give up translations. Hermann's theorem says that a *maximal* subgroup does one or the other and never both at once — which is why a crystal losing symmetry can be followed one clean step at a time, and why every route from p6m down to p1 has exactly three steps.
-
How many subgroups of index three
Taking operations away and closing what is left finds the maximal subgroups and stops there. Counting instead the ways a group can act on three points finds all of them — and finds that a four-fold group has none of index three at all.
-
The quotient each normal subgroup leaves
Two hundred and eighty-one subgroups of index four across the seventeen plane groups, and ninety-seven of them normal. Which ones, and what is left when they are divided out, needs no enumeration at all: below order six every group is abelian, so a normal subgroup of small index is a subgroup of the abelianisation and its quotient is decided by a product of greatest common divisors.
-
Going up costs the cell a parameter
The usual asymmetry — finitely many maximal subgroups below, infinitely many minimal supergroups above — is false in both halves for a plane group. Both directions are infinite and equinumerous index by index. The real asymmetry is that 17 of the 31 edges cost the lattice a parameter going up and nothing going down.