Group Actions, Class Equation and Sylow Theorems
CSIR NET algebra: group actions, orbit-stabiliser, Burnside, conjugacy classes, class equation, p-groups, Cauchy and Sylow theorems, finite abelian groups.
- 20 min
On this page · 15 sections
Prerequisites
- Groups, Subgroups and Homomorphisms: Lagrange, normal subgroups, quotients, cycle types in \( S_n \) and the generalised Cayley theorem are used throughout.
- Number Theory: Congruences, CRT and Primitive Roots: Sylow counting is arithmetic with divisors and congruences.
- Combinatorics: Counting, Pigeonhole and Derangements: Burnside’s lemma below is a counting tool, and partitions of \( n \) count abelian groups.
The Hook: How Many Different Necklaces?
Group Actions
A group \( G \) acts on a set \( X \) if there is a map \( G \times X \to X \), \( (g, x) \mapsto g \cdot x \), with \( e \cdot x = x \) and \( g \cdot (h \cdot x) = (gh) \cdot x \). Equivalently, a homomorphism \( G \to \mathrm{Sym}(X) \).
- Orbit: \( \mathrm{Orb}(x) = \{g \cdot x : g \in G\} \). Orbits partition \( X \).
- Stabiliser: \( G_x = \{g : g \cdot x = x\} \), a subgroup of \( G \).
Burnside’s lemma. The number of orbits is the average number of fixed points:
$$\boxed{\lvert X / G \rvert = \frac{1}{\lvert G \rvert}\sum_{g \in G}\lvert \mathrm{Fix}(g) \rvert}$$For necklaces of \( n \) beads in \( k \) colours under rotation, the rotation by \( j \) places fixes \( k^{\gcd(j, n)} \) colourings, so the count is \( \frac{1}{n}\sum_{j=0}^{n-1} k^{\gcd(j, n)} \). With \( n = 6 \), \( k = 2 \): 14. With \( n = 4 \), \( k = 3 \): \( \frac{1}{4}(81 + 3 + 9 + 3) = 24 \). If flips are also allowed (the dihedral group of order 12 acting), 6 beads in 2 colours give 13.
The actions that matter
| Action | Orbits | Stabiliser | Payoff |
|---|---|---|---|
| \( G \) on itself by left multiplication | one | trivial | Cayley’s theorem |
| \( G \) on left cosets of \( H \) | one | conjugates of \( H \) | \( G \to S_{[G:H]} \) with kernel inside \( H \) |
| \( G \) on itself by conjugation | conjugacy classes | centraliser \( C(a) \) | class equation |
| \( G \) on its subgroups by conjugation | conjugacy classes of subgroups | normaliser \( N(H) \) | number of conjugates of \( H \) is \( [G : N(H)] \) |
| \( G \) on its Sylow \( p \)-subgroups | one (Sylow II) | \( N(P) \) | \( n_p = [G : N(P)] \) divides \( \lvert G \rvert \) |
Conjugacy Classes and the Class Equation
The conjugacy class of \( a \) is \( \mathrm{cl}(a) = \{gag^{-1} : g \in G\} \). By orbit-stabiliser, \( \lvert \mathrm{cl}(a) \rvert = [G : C(a)] \). A class has size 1 exactly when \( a \in Z(G) \).
| Group | Class equation | Number of classes |
|---|---|---|
| abelian of order \( n \) | \( 1 + 1 + \dots + 1 \) | \( n \) |
| \( S_3 \) | \( 6 = 1 + 2 + 3 \) | 3 |
| \( D_4 \), \( Q_8 \) | \( 8 = 1 + 1 + 2 + 2 + 2 \) | 5 |
| \( D_5 \) | \( 10 = 1 + 2 + 2 + 5 \) | 4 |
| \( A_4 \) | \( 12 = 1 + 3 + 4 + 4 \) | 4 |
| non-abelian group of order 21 | \( 21 = 1 + 3 + 3 + 7 + 7 \) | 5 |
| \( S_4 \) | \( 24 = 1 + 3 + 6 + 6 + 8 \) | 5 |
| \( A_5 \) | \( 60 = 1 + 12 + 12 + 15 + 20 \) | 5 |
| \( S_5 \) | \( 120 = 1 + 10 + 15 + 20 + 20 + 30 + 24 \) | 7 |
Dihedral groups \( D_n \) (order \( 2n \)): for odd \( n \), the class equation is \( 1 + \underbrace{2 + \dots + 2}_{(n-1)/2} + n \), giving \( \frac{n+3}{2} \) classes; for even \( n \), \( 1 + 1 + \underbrace{2 + \dots + 2}_{(n-2)/2} + \frac{n}{2} + \frac{n}{2} \), giving \( \frac{n+6}{2} \) classes.
In \( S_n \) the classes are the cycle types, so there are \( p(n) \) classes (partitions of \( n \)): 3, 5, 7, 11 for \( n = 3, 4, 5, 6 \). In \( A_n \), an \( S_n \)-class splits into two \( A_n \)-classes exactly when its cycle type consists of distinct odd lengths (fixed points counted as cycles of length 1); that is why the 24 five-cycles of \( A_5 \) form two classes of 12.
Simplicity of \( A_5 \). A normal subgroup is a union of classes including \( \{e\} \), with order dividing 60. No sub-sum of \( 1 + 12 + 12 + 15 + 20 \) containing the 1 gives a proper divisor of 60 other than 1. So \( A_5 \) is simple, the smallest non-abelian simple group.
p-Groups and Cauchy’s Theorem
A \( p \)-group is a group of order \( p^n \), \( p \) prime.
Cauchy’s theorem. If a prime \( p \) divides \( \lvert G \rvert \), then \( G \) has an element of order \( p \). (The number of elements of order \( p \) is then a multiple of \( p - 1 \), and in fact is \( \equiv -1 \pmod p \).)
The Sylow Theorems
Let \( \lvert G \rvert = p^a m \) with \( p \nmid m \). A Sylow \( p \)-subgroup is a subgroup of order \( p^a \). Let \( n_p \) be their number.
| Group | \( n_2 \) | \( n_3 \) | \( n_5 \) |
|---|---|---|---|
| \( S_3 \) | 3 | 1 | |
| \( A_4 \) | 1 (\( V_4 \)) | 4 | |
| \( S_4 \) | 3 (each \( \cong D_4 \)) | 4 | |
| \( A_5 \) | 5 (each \( \cong V_4 \)) | 10 | 6 |
| \( \mathbb{Z}_n \), any abelian group | 1 | 1 | 1 |
When a Sylow subgroup has prime order \( p \), distinct ones intersect trivially, so \( G \) has exactly \( n_p(p - 1) \) elements of order \( p \). This element counting is the engine of most non-simplicity proofs.
Standard applications
Groups of order \( pq \) (\( p < q \) primes). \( n_q \mid p \) and \( n_q \equiv 1 \pmod q \) force \( n_q = 1 \). If moreover \( p \nmid q - 1 \), then \( n_p = 1 \) too, and \( G \cong \mathbb{Z}_p \times \mathbb{Z}_q \cong \mathbb{Z}_{pq} \). So every group of order 15, 33, 35, 51, 65, 77, 85, 95 is cyclic. If \( p \mid q - 1 \), there are exactly two groups of order \( pq \) (cyclic and one non-abelian), e.g. order 6, 10, 21.
Order 45 \( = 3^2 \cdot 5 \): \( n_5 \mid 9 \), \( n_5 \equiv 1 \pmod 5 \Rightarrow n_5 = 1 \); \( n_3 \mid 5 \), \( n_3 \equiv 1 \pmod 3 \Rightarrow n_3 = 1 \). So \( G \cong P_3 \times P_5 \) is abelian: \( \mathbb{Z}_{45} \) or \( \mathbb{Z}_3 \times \mathbb{Z}_{15} \).
Order 56 \( = 2^3 \cdot 7 \): \( n_7 \in \{1, 8\} \). If \( n_7 = 8 \), there are \( 8 \times 6 = 48 \) elements of order 7, leaving 8 elements, exactly enough for one Sylow 2-subgroup, so \( n_2 = 1 \). Either way \( G \) is not simple. (\( n_7 = 8 \) does occur: the affine group \( x \mapsto ax + b \) over the field of 8 elements has order 56 and no normal subgroup of order 7.)
Order 30: if \( n_5 = 6 \) and \( n_3 = 10 \), there would be \( 24 + 20 = 44 > 30 \) elements. So one of them is 1; then a subgroup of order 15 exists and has index 2. Every group of order 30 has a normal cyclic subgroup of order 15.
Order 36 \( = 2^2 \cdot 3^2 \): \( n_3 \in \{1, 4\} \). If \( n_3 = 4 \), \( G \) acts on its 4 Sylow 3-subgroups, giving \( G \to S_4 \); since \( 36 \nmid 24 \), the kernel is non-trivial and proper. Not simple.
Order 12: \( n_3 \in \{1, 4\} \). If \( n_3 = 4 \), there are 8 elements of order 3 and the remaining 4 form the unique Sylow 2-subgroup. Not simple (this is \( A_4 \)).
graph TD
O["Order n = p^a m"] --> L["List n_p: divides m, is 1 mod p"]
L --> U{"Some n_p forced to 1?"}
U -->|yes| N[Normal Sylow subgroup: not simple]
U -->|no| C["Count elements of prime order: n_p times (p-1)"]
C --> X{"Total exceeds n?"}
X -->|yes| N
X -->|no| A["Act on Sylow subgroups: G to S_np"]
A --> K{"n divides n_p factorial?"}
K -->|no| N
K -->|yes| H[Look harder: maybe simple, e.g. 60]Finite Abelian Groups
Counting. If \( n = p_1^{a_1}\cdots p_k^{a_k} \), the number of abelian groups of order \( n \) up to isomorphism is \( p(a_1)\,p(a_2)\cdots p(a_k) \), where \( p(a) \) is the number of partitions of \( a \): \( p(1), \dots, p(6) = 1, 2, 3, 5, 7, 11 \).
| Order | Factorisation | Abelian groups |
|---|---|---|
| \( p^2 \) | 2 | |
| \( p^3 \) | 3: \( \mathbb{Z}_{p^3} \), \( \mathbb{Z}_{p^2} \times \mathbb{Z}_p \), \( \mathbb{Z}_p^3 \) | |
| 72 | \( 2^3 \cdot 3^2 \) | \( 3 \times 2 = 6 \) |
| 360 | \( 2^3 \cdot 3^2 \cdot 5 \) | \( 3 \times 2 \times 1 = 6 \) |
| 1000 | \( 2^3 \cdot 5^3 \) | \( 3 \times 3 = 9 \) |
| 64 | \( 2^6 \) | 11 |
| squarefree \( n \) | 1 (only \( \mathbb{Z}_n \)) |
Converting. \( \mathbb{Z}_2 \times \mathbb{Z}_4 \times \mathbb{Z}_3 \times \mathbb{Z}_9 \) (elementary divisors) groups as \( (\mathbb{Z}_2 \times \mathbb{Z}_3) \times (\mathbb{Z}_4 \times \mathbb{Z}_9) \cong \mathbb{Z}_6 \times \mathbb{Z}_{36} \) (invariant factors, \( 6 \mid 36 \)).
Consequences. A finite abelian group is cyclic iff for each prime \( p \) it has at most \( p - 1 \) elements of order \( p \), iff it has at most one subgroup of each order. A finite abelian group of order \( n \) has a subgroup of every order dividing \( n \).
Groups of Small Order
| \( n \) | 1–3, 5, 7, 11, 13 | 4, 9, 25 | 6, 10, 14 | 8 | 12 | 15 | 16 |
|---|---|---|---|---|---|---|---|
| Groups up to isomorphism | 1 (cyclic) | 2 (both abelian) | 2 (\( \mathbb{Z}_{2p} \), \( D_p \)) | 5 | 5 | 1 | 14 |
- Order 8: \( \mathbb{Z}_8 \), \( \mathbb{Z}_4 \times \mathbb{Z}_2 \), \( \mathbb{Z}_2^3 \) (abelian); \( D_4 \), \( Q_8 \) (non-abelian).
- Order 12: \( \mathbb{Z}_{12} \), \( \mathbb{Z}_2 \times \mathbb{Z}_6 \) (abelian); \( A_4 \), \( D_6 \), and the dicyclic group \( \mathbb{Z}_3 \rtimes \mathbb{Z}_4 \) (non-abelian).
- Smallest non-abelian group: \( S_3 \) (order 6). Smallest non-abelian simple group: \( A_5 \) (order 60). Smallest non-cyclic group: \( V_4 \).
Memory Tricks
Don’t Confuse
| This | vs | That |
|---|---|---|
| \( \lvert \mathrm{cl}(a) \rvert = [G : C(a)] \) | number of conjugates of a subgroup \( H \): \( [G : N(H)] \) | |
| \( n_p \mid m \) (the \( p' \)-part) | \( n_p \mid \lvert G \rvert \) (true but weaker) | |
| elementary divisors \( \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3 \) | invariant factors \( \mathbb{Z}_2 \times \mathbb{Z}_{12} \) (same group) | |
| \( \mathbb{Z}_4 \times \mathbb{Z}_2 \) | \( \mathbb{Z}_8 \) (not isomorphic) | |
| Cauchy: an element of order \( p \) | Sylow I: a subgroup of order \( p^a \) (not necessarily cyclic) | |
| \( p \nmid q - 1 \Rightarrow \) order \( pq \) cyclic | \( p \mid q - 1 \): a non-abelian group also exists |
Common Mistakes
Practice
All questions below are original practice questions written for this page. They are not from any CSIR NET paper. In Level 3, as in Part C, one or more options may be correct.
Level 1: Foundation
- Write the class equation of \( S_3 \).
- A group has order 21. What are the possible values of \( n_7 \)?
- How many abelian groups of order 72 are there up to isomorphism?
Answers
- \( 6 = 1 + 2 + 3 \): identity, two 3-cycles, three transpositions.
- \( n_7 = 1 \) only: \( n_7 \mid 3 \) and \( n_7 \equiv 1 \pmod 7 \).
- 6: \( 72 = 2^3 \cdot 3^2 \), \( p(3)p(2) = 3 \cdot 2 \).
Level 2: Part B Style
Practice Q1. The number of Sylow 5-subgroups of \( A_5 \) is:
(a) 1 (b) 5 (c) 6 (d) 12
Answer: (c)
\( A_5 \) has 24 five-cycles; each subgroup of order 5 contains 4 of them, and distinct ones meet trivially: \( \frac{24}{4} = 6 \). Check: \( 6 \equiv 1 \pmod 5 \) and \( 6 \mid 12 \). It cannot be 1, since \( A_5 \) is simple.
Practice Q2. The number of conjugacy classes of the dihedral group \( D_5 \) of order 10 is:
(a) 3 (b) 4 (c) 5 (d) 10
Answer: (b)
\( \{e\} \), \( \{r, r^4\} \), \( \{r^2, r^3\} \), and all five reflections: \( 10 = 1 + 2 + 2 + 5 \), so 4 classes \( = \frac{5+3}{2} \).
Practice Q3. The number of abelian groups of order 1000, up to isomorphism, is:
(a) 3 (b) 6 (c) 9 (d) 27
Answer: (c)
\( 1000 = 2^3 \cdot 5^3 \); \( p(3) \cdot p(3) = 3 \cdot 3 = 9 \).
Practice Q4. The number of distinct necklaces with 6 beads, each black or white, where two necklaces are the same if one is a rotation of the other, is:
(a) 10 (b) 13 (c) 14 (d) 64
Answer: (c)
Burnside with the cyclic group of order 6: rotations by 0, 1, 2, 3, 4, 5 places fix \( 2^6, 2^1, 2^2, 2^3, 2^2, 2^1 \) colourings. Average: \( \frac{64 + 2 + 4 + 8 + 4 + 2}{6} = 14 \). Option (b) is the count when reflections are also allowed.
Level 3: Part C Style
Practice Q5. Let \( G \) be a group of order 56. Which of the following are true?
(a) \( G \) is not simple. (b) The number of Sylow 7-subgroups of \( G \) is 1 or 8. (c) \( G \) always has a normal Sylow 7-subgroup. (d) If \( G \) has 8 Sylow 7-subgroups, then \( G \) has a normal Sylow 2-subgroup.
Answer: (a), (b) and (d)
- (b) True. \( n_7 \mid 8 \) and \( n_7 \equiv 1 \pmod 7 \).
- (d) True. With \( n_7 = 8 \), there are \( 8 \times 6 = 48 \) elements of order 7. The other 8 elements must contain a Sylow 2-subgroup (order 8), so they are exactly one Sylow 2-subgroup, and \( n_2 = 1 \).
- (a) True. By (b) and (d), either the Sylow 7-subgroup or the Sylow 2-subgroup is normal.
- (c) False. The group of maps \( x \mapsto ax + b \) (\( a \ne 0 \)) over the field with 8 elements has order \( 8 \times 7 = 56 \). The maps \( x \mapsto ax \) form a subgroup of order 7 that is not normal: conjugating by the translation \( x \mapsto x + b \) gives the maps \( x \mapsto ax + (1 - a)b \), a different subgroup. So \( n_7 = 8 \) here, and the normal Sylow 2-subgroup is the group of translations, as (d) predicts.
Practice Q6. Which of the following are true?
(a) Every group of order 49 is abelian. (b) If \( \lvert G \rvert = 27 \), then \( \lvert Z(G) \rvert \in \{3, 27\} \). (c) A group of order 8 with exactly one element of order 2 is cyclic. (d) A non-abelian group of order 8 has exactly 5 conjugacy classes.
Answer: (a), (b) and (d)
- (a) True. \( 49 = 7^2 \); groups of order \( p^2 \) are abelian.
- (b) True. \( Z(G) \ne \{e\} \) for a \( p \)-group. If \( \lvert Z(G) \rvert = 9 \), then \( G/Z(G) \) has order 3, is cyclic, and \( G \) would be abelian, so \( Z(G) = G \): contradiction. So 3 or 27.
- (c) False. \( Q_8 \) has exactly one element of order 2 (\( -1 \)) and is not cyclic.
- (d) True. \( \lvert Z(G) \rvert = 2 \) (a non-abelian group of order \( p^3 \) has centre of order \( p \)). For \( a \notin Z(G) \), \( C(a) \) contains \( Z(G) \) and \( a \), so \( \lvert C(a) \rvert \ge 4 \), and \( C(a) \ne G \), so \( \lvert C(a) \rvert = 4 \) and the class of \( a \) has size 2. Class equation \( 8 = 1 + 1 + 2 + 2 + 2 \): five classes.
Practice Q7. Which of the following can be the class equation of some finite group?
(a) \( 21 = 1 + 3 + 3 + 7 + 7 \) (b) \( 12 = 1 + 3 + 4 + 4 \) (c) \( 10 = 1 + 1 + 1 + 2 + 5 \) (d) \( 8 = 1 + 1 + 3 + 3 \)
Answer: (a) and (b)
- (a) Possible. The non-abelian group of order 21 (\( \mathbb{Z}_7 \rtimes \mathbb{Z}_3 \)) has trivial centre; its 6 elements of order 7 have centraliser of order 7 (class size 3, two classes) and its 14 elements of order 3 have centraliser of order 3 (class size 7, two classes).
- (b) Possible. It is the class equation of \( A_4 \).
- (c) Impossible. The three 1s say \( \lvert Z(G) \rvert = 3 \), which does not divide 10.
- (d) Impossible. Class sizes must divide \( \lvert G \rvert = 8 \).
Quick Revision Table
| Idea | Fact |
|---|---|
| Orbit-stabiliser | \( \lvert \mathrm{Orb}(x) \rvert = [G : G_x] \) |
| Burnside | orbits = average number of fixed points |
| Class equation | \( \lvert G \rvert = \lvert Z(G) \rvert + \sum [G : C(a_i)] \) |
| \( p \)-groups | non-trivial centre; order \( p^2 \) abelian |
| Cauchy | \( p \mid \lvert G \rvert \Rightarrow \) element of order \( p \) |
| Sylow III | \( n_p \equiv 1 \pmod p \), \( n_p \mid m \); normal iff \( n_p = 1 \) |
| Order \( pq \), \( p \nmid q - 1 \) | cyclic |
| Classes of \( S_n \) | \( p(n) \): 3, 5, 7, 11 for \( n = 3, \dots, 6 \) |
| \( A_5 \) | \( 1 + 12 + 12 + 15 + 20 \); simple |
| Abelian groups of order \( n \) | \( \prod p(a_i) \) |
| Groups of order 8, 12, 16 | 5, 5, 14 |
Key Takeaways
What’s Next
- Rings, Ideals and Polynomial Rings: the same quotient-and-kernel ideas for rings.
- Fields, Extensions and Galois Theory: Galois groups are subgroups of \( S_n \), and their subgroup lattices (Sylow and all) mirror intermediate fields.
- Groups, Subgroups and Homomorphisms to revise cycle types before tackling class equations of \( S_n \).
- Algebra: Quick Revision.