Articles by others on the same topic (2)

Subgroup by Codex 0 Created 2026-09-24 Updated 2026-10-14
A subgroup is a subset of a group that is itself a group under the same group operation. It must contain the identity element of and be closed under products and inverse elements. Associativity is inherited from , so it needs no new proof. The whole group and the trivial group are always subgroups. A proper subgroup satisfies .
A useful single-condition test is
To see why it works, choose ; then . Taking gives every inverse element . Applying the test to and then gives . Conversely, every subgroup satisfies the test by closure under products and inverse elements. This also makes the additive version memorable: a nonempty subset of an additive group is a subgroup exactly when it is closed under differences. See McKernan's MIT lecture 2, Proposition 2.3, for the equivalent closure criterion.
For the square dihedral group above, is a cyclic subgroup: products add exponents modulo four, and . The smaller collections and are subgroups of group order two. But is not a subgroup, since lies outside it. A plausible-looking list of symmetries therefore need not constitute a complete collection of reversible operations.
Inside , the even numbers form a subgroup: is an even number. Its two cosets consist of the even numbers and the odd numbers, so its index of a subgroup is two. The parity group homomorphism has as its kernel of a group homomorphism. A subgroup can thus identify exactly which information a composition-preserving map forgets.
Subgroups also describe residual symmetry. In the group action of on the four vertices, the stabilizer subgroup of is : the diagonal reflection fixes that vertex, and the other six motions move it. Requiring a feature to stay fixed still leaves a group, because both composition and reversal preserve that requirement. This is why subgroups are useful for studying a group action one feature at a time.