Classification of Groups of Small Order
The following table summarizes the classification of groups of small order:
| Order | Groups |
|---|---|
| 1 | |
| 2 | |
| 3 | |
| 4 | , |
| 5 | |
| 6 | , |
| 7 | |
| 8 | , , , , |
| 9 | , |
| 10 | , |
| 11 | |
| 12 | , , , , |
Proposition 16.1. Every group of prime order is cyclic, and every group of order (where Is prime) is abelian (hence isomorphic to or ).
Proof. For prime order, see Section 3.3. For order See Corollary 6.6.
Proposition 16.2. There are exactly five groups of order .
Proof. The abelian groups of order are classified by the structure theorem: , , .
For non-abelian groups of order : by Theorem 6.5, . If Then has order and is cyclic, making abelian (contradiction). So and .
If every non-central element has order : is generated by three involutions Commuting with each other and with Giving (abelian). So some non-central element has order Say with and .
Pick . Then or . If : is abelian, contradiction. If : we get when and when . These are the only two non-abelian groups of order .
Proposition 16.3. There are exactly five groups of order .
Proof sketch. .
and divides So or .
: The Sylow -subgroup is normal. is a semidirect product where is a Sylow -subgroup ( or ). Computing the possible actions gives: And (the dicyclic group of order ).
: The Sylow -subgroup is not normal. There are four Sylow -subgroups, Contributing elements of order . The remaining elements (plus ) form The unique Sylow -subgroup, which must be (since has order and Has no element of order besides its unique subgroup… Actually, the argument is more subtle). This gives .
Total: five groups of order .
:::caution Common Pitfall The number of groups grows rapidly with the order. While there are exactly groups of order There are groups of order and groups of order . Classification by hand is only Feasible for small orders. For prime-squared orders, the abelian classification is straightforward, But non-abelian cases require careful analysis of possible semidirect products.
:::
Common Pitfalls
Section titled “Common Pitfalls”- Assuming all groups of a given order are abelian: While groups of order and are always abelian, groups of order need not be (e.g., and are non-abelian of order 8). Never assume abelianness without proof.
- Forgetting to check semidirect product distinctness: Different homomorphisms can produce isomorphic semidirect products. Always verify that two actions actually yield non-isomorphic groups.
- Misapplying Sylow’s theorems when divides the group order only once: For with , the condition and forces when , but may equal when .
- Confusing direct products with semidirect products: In a direct product , both factors are normal; in a semidirect product , only is guaranteed normal. The notation always requires specifying the action.
Key Relationships
Section titled “Key Relationships”- Prime order implies cyclic: By Lagrange’s theorem, a group of prime order has no proper subgroups, so every non-identity element generates the entire group.
- Order is always abelian: If for prime , then by Theorem 6.5, and is cyclic, forcing to be abelian.
- Sylow theorems constrain group structure: The number of Sylow -subgroups must divide the group order and satisfy , severely limiting possible group structures.
- Non-abelian groups of order require : For with primes, is cyclic unless divides , in which case a non-abelian semidirect product exists.
- The classification table grows rapidly: While there are only 5 groups of order 8 and 5 of order 12, the number jumps to 14 groups of order 16 and 51 groups of order 32.
Worked Examples
Section titled “Worked Examples”Example 1: Finding All Groups of Order 6
Section titled “Example 1: Finding All Groups of Order 6”Problem: Classify all groups of order 6.
Solution: . By Sylow theorems, and , so . Thus the Sylow 3-subgroup is normal. Similarly, and , so or . If , then both Sylow subgroups are normal, giving . If , the action of on the three Sylow 2-subgroups gives a non-abelian group, which is .
Example 2: Identifying by Properties
Section titled “Example 2: Identifying Q8Q_8Q8 by Properties”Problem: Show that the quaternion group is the unique non-abelian group of order 8 in which every element has order dividing 4.
Solution: In , we have and , so every non-identity element has order 2 or 4. The element is central, so . Since is non-abelian, by Proposition 16.2 it must be either or . In , there are elements of order 2 outside the centre (reflections), but has no such elements. Thus is uniquely determined by this property.
Further Orders
Section titled “Further Orders”Beyond order 12, the classification continues to grow in complexity:
- Order 14: Only two groups: and (since , a non-abelian semidirect product exists).
- Order 15: Only one group: (cyclic, since and ).
- Order 18: Five groups: two abelian (, ) and three non-abelian (, , ).
- Order 20: Five groups: , , , the dicyclic group , and .
Applications
Section titled “Applications”- Cryptography: Understanding group structure is essential for elliptic curve cryptography, where the group of points on a curve must have suitable properties.
- Crystallography: The 230 space groups describe all possible crystal symmetries, built from small-order groups acting on lattices.
- Particle physics: The Standard Model is based on the gauge group , whose finite subgroups classify possible symmetry-breaking patterns.