Skip to content

Groups, Subgroups and Homomorphisms

CSIR NET algebra: subgroups, Lagrange, cyclic groups, permutation groups and cycle types, normal subgroups, quotient groups, homomorphisms and Cayley's theorem.

  • 22 min read
  • Updated
On this page · 16 sections
  1. Prerequisites
  2. The Hook: Shuffling Cards Back to the Start
  3. Groups and the Standard Examples
  4. Subgroups and Lagrange’s Theorem
  5. Cyclic Groups
  6. Permutation Groups
  7. Normal Subgroups and Quotient Groups
  8. Homomorphisms and the Isomorphism Theorems
  9. Cayley’s Theorem
  10. Memory Tricks
  11. Don’t Confuse
  12. Common Mistakes
  13. Practice
  14. Quick Revision Table
  15. Key Takeaways
  16. What’s Next

Prerequisites

The Hook: Shuffling Cards Back to the Start

Groups and the Standard Examples

A group is a set \( G \) with an associative operation, an identity \( e \) and inverses. It is abelian if \( ab = ba \) for all \( a, b \). The order of \( a \in G \), written \( o(a) \), is the least \( n \ge 1 \) with \( a^n = e \) (or \( \infty \)).

GroupOrderAbelian?Centre \( Z(G) \)Remarks
\( \mathbb{Z}_n \) (addition mod \( n \))\( n \)yesallcyclic
\( U(n) \) (units mod \( n \))\( \varphi(n) \)yesallcyclic iff \( n = 1, 2, 4, p^k, 2p^k \)
\( V_4 = \mathbb{Z}_2 \times \mathbb{Z}_2 \) (Klein)4yesallsmallest non-cyclic group
\( S_n \)\( n! \)only for \( n \le 2 \)trivial for \( n \ge 3 \)all permutations of \( n \) symbols
\( A_n \)\( \frac{n!}{2} \)only for \( n \le 3 \)trivial for \( n \ge 4 \)even permutations; simple for \( n \ge 5 \)
\( D_n \) (symmetries of a regular \( n \)-gon)\( 2n \)only for \( n \le 2 \)for \( n \ge 3 \): trivial if \( n \) odd, \( \{e, r^{n/2}\} \) if \( n \) even (\( D_2 = V_4 \) is abelian, centre all)\( r^n = s^2 = e \), \( srs = r^{-1} \)
\( Q_8 = \{\pm 1, \pm i, \pm j, \pm k\} \)8no\( \{\pm 1\} \)every subgroup normal; one element of order 2
\( GL(n, F) \)\( \prod_{i=0}^{n-1}(q^n - q^i) \) for \( F = \mathbb{F}_q \)no (\( n \ge 2 \))scalar matrices\( SL(n, F) \) is the kernel of det

\( D_n \) here has order \( 2n \); some books write \( D_{2n} \) for the same group. Read the question’s convention.

Order facts used everywhere

  • \( o(a^k) = \frac{o(a)}{\gcd(k, o(a))} \) when \( o(a) \) is finite.
  • \( o(ab) = o(ba) \), \( o(a) = o(a^{-1}) = o(gag^{-1}) \).
  • If \( ab = ba \) and \( \gcd(o(a), o(b)) = 1 \), then \( o(ab) = o(a)o(b) \). Without commuting, nothing can be said: two elements of order 2 in \( D_n \) can multiply to an element of order \( n \).
  • In \( G \times H \), \( o(a, b) = \mathrm{lcm}(o(a), o(b)) \).

Subgroups and Lagrange’s Theorem

\( H \subseteq G \) is a subgroup (\( H \le G \)) if it is a group under the same operation.

  • One-step test: \( H \ne \emptyset \) and \( ab^{-1} \in H \) for all \( a, b \in H \).
  • Finite test: a non-empty finite subset closed under the operation is a subgroup.
  • An intersection of subgroups is a subgroup. A union \( H \cup K \) is a subgroup only if \( H \subseteq K \) or \( K \subseteq H \); in particular, no group is a union of two proper subgroups.

Cosets. The left cosets \( aH \) partition \( G \) into blocks of size \( \lvert H \rvert \). Their number is the index \( [G : H] \).

The converse is false. \( A_4 \) has order 12 but no subgroup of order 6. (Such a subgroup would have index 2, hence be normal, hence contain all 8 three-cycles: too many.) The converse does hold for cyclic groups, for finite abelian groups, and for prime-power divisors in any finite group (Sylow).

Product formula. For subgroups \( H, K \) of a finite group,

$$\boxed{\lvert HK \rvert = \frac{\lvert H \rvert\,\lvert K \rvert}{\lvert H \cap K \rvert}}$$

\( HK \) is a subgroup iff \( HK = KH \); this holds whenever one of \( H, K \) is normal.

Special subgroups. The centre \( Z(G) = \{z : zg = gz \ \forall g\} \); the centraliser \( C(a) = \{g : ga = ag\} \); the normaliser \( N(H) = \{g : gHg^{-1} = H\} \); the commutator subgroup \( G' \), generated by all \( aba^{-1}b^{-1} \).

Cyclic Groups

\( G \) is cyclic if \( G = \langle a \rangle \) for some \( a \). Every cyclic group is isomorphic to \( \mathbb{Z} \) (infinite) or \( \mathbb{Z}_n \).

Direct products. \( \mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn} \) iff \( \gcd(m, n) = 1 \). So \( \mathbb{Z}_3 \times \mathbb{Z}_{10} \cong \mathbb{Z}_{30} \), but \( \mathbb{Z}_4 \times \mathbb{Z}_6 \) is not cyclic (largest order \( \mathrm{lcm}(4, 6) = 12 < 24 \)).

Groups that are not cyclic though they look simple: \( V_4 \); \( (\mathbb{Q}, +) \) (but every finitely generated subgroup of it is cyclic); \( (\mathbb{R}, +) \) (uncountable); \( \mathbb{Q}^{*} \) and \( \mathbb{R}^{*} \) under multiplication. A finite subgroup of the multiplicative group of any field is cyclic; the finite subgroups of \( \mathbb{C}^{*} \) are the groups of \( n \)th roots of unity.

Permutation Groups

Every permutation is a product of disjoint cycles, uniquely up to order. Its cycle type is the list of cycle lengths, a partition of \( n \).

  • Order of a permutation = lcm of its cycle lengths. \( (1\,2\,3)(4\,5) \) has order 6.
  • Sign: a \( k \)-cycle is a product of \( k - 1 \) transpositions, so it is even iff \( k \) is odd. A permutation is even iff the number of even-length cycles is even.
  • Conjugacy in \( S_n \): two permutations are conjugate iff they have the same cycle type. So the conjugacy classes of \( S_n \) correspond to the partitions of \( n \) (5 classes for \( S_4 \), 7 for \( S_5 \)).
  • Number of elements of a cycle type with \( m_k \) cycles of length \( k \):
$$\boxed{\frac{n!}{\prod_k k^{m_k}\, m_k!}}$$

For example, the number of 3-cycles in \( S_5 \) is \( \frac{120}{3 \cdot 1 \cdot 1 \cdot 2!} = 20 \) (two fixed points count as \( m_1 = 2 \)), and the number of double transpositions in \( S_4 \) is \( \frac{24}{2^2 \cdot 2!} = 3 \).

GroupCycle types (count)Elements of order 2Largest order
\( S_3 \)\( 1^3 \) (1), \( 2\,1 \) (3), \( 3 \) (2)33
\( S_4 \)\( 1^4 \) (1), \( 2\,1^2 \) (6), \( 2^2 \) (3), \( 3\,1 \) (8), \( 4 \) (6)94
\( S_5 \)\( 1^5 \) (1), \( 2\,1^3 \) (10), \( 2^2 1 \) (15), \( 3\,1^2 \) (20), \( 3\,2 \) (20), \( 4\,1 \) (30), \( 5 \) (24)256
\( S_6 \)756
\( S_7 \)23112
\( A_4 \)\( 1^4 \) (1), \( 2^2 \) (3), \( 3\,1 \) (8)33
\( A_5 \)\( 1^5 \) (1), \( 2^2 1 \) (15), \( 3\,1^2 \) (20), \( 5 \) (24)155

Largest order of an element of \( S_n \) is the maximum of \( \mathrm{lcm} \) over partitions of \( n \): 3 for \( S_3 \), 4 for \( S_4 \), 6 for \( S_5 \) and \( S_6 \), 12 for \( S_7 \) (\( 3 + 4 \)), 15 for \( S_8 \) (\( 3 + 5 \)).

Generators. \( S_n \) is generated by the transpositions; by \( (1\,2), (1\,3), \dots, (1\,n) \); and by just \( (1\,2) \) and \( (1\,2\,\cdots\,n) \). \( A_n \) (\( n \ge 3 \)) is generated by 3-cycles.

Facts about \( S_n \) and \( A_n \). \( A_n \) is the only subgroup of index 2 in \( S_n \). For \( n \ge 5 \) the normal subgroups of \( S_n \) are \( \{e\}, A_n, S_n \); \( S_4 \) has one more, \( V_4 = \{e, (12)(34), (13)(24), (14)(23)\} \). The commutator subgroup of \( S_n \) is \( A_n \) (\( n \ge 2 \)), and that of \( A_4 \) is \( V_4 \).

Normal Subgroups and Quotient Groups

\( N \le G \) is normal (\( N \trianglelefteq G \)) if \( gNg^{-1} = N \) for all \( g \), equivalently \( gN = Ng \) for all \( g \).

Ways to recognise normality quickly:

  • Every subgroup of an abelian group is normal.
  • Every subgroup of index 2 is normal. More generally, a subgroup whose index is the smallest prime dividing \( \lvert G \rvert \) is normal.
  • Kernels of homomorphisms are normal; \( Z(G) \) and \( G' \) are normal.
  • A subgroup that is the unique subgroup of its order is normal (even characteristic).
  • Normality is not transitive: in \( D_4 \), \( \{e, s\} \trianglelefteq \{e, s, r^2, sr^2\} \trianglelefteq D_4 \), but \( \{e, s\} \) is not normal in \( D_4 \).
  • \( Q_8 \) is non-abelian yet every subgroup is normal (a Hamiltonian group).

Quotient group. If \( N \trianglelefteq G \), the cosets form a group \( G/N \) under \( (aN)(bN) = abN \), of order \( [G : N] \).

QuotientIsomorphic to
\( \mathbb{Z}/n\mathbb{Z} \)\( \mathbb{Z}_n \)
\( S_n / A_n \)\( \mathbb{Z}_2 \)
\( S_4 / V_4 \)\( S_3 \)
\( A_4 / V_4 \)\( \mathbb{Z}_3 \)
\( Q_8 / \{\pm 1\} \), \( D_4 / Z(D_4) \)\( V_4 \)
\( GL(n, \mathbb{R}) / SL(n, \mathbb{R}) \)\( \mathbb{R}^{*} \)
\( \mathbb{R}/\mathbb{Z} \)circle group \( S^1 \)
\( G / G' \)the largest abelian quotient of \( G \)

Homomorphisms and the Isomorphism Theorems

A homomorphism \( f : G \to H \) satisfies \( f(ab) = f(a)f(b) \). Then \( f(e) = e \), \( f(a^{-1}) = f(a)^{-1} \), and \( o(f(a)) \) divides \( o(a) \). The kernel \( \ker f \) is a normal subgroup; \( f \) is injective iff \( \ker f = \{e\} \).

Counting homomorphisms

A homomorphism from a cyclic group \( \langle a \rangle \) of order \( m \) is fixed by the image \( b = f(a) \), and any \( b \) with \( b^m = e \) works.

$$\boxed{\#\mathrm{Hom}(\mathbb{Z}_m, \mathbb{Z}_n) = \gcd(m, n)} \qquad \#\{\text{onto homs } \mathbb{Z}_m \to \mathbb{Z}_n\} = \begin{cases}\varphi(n) & n \mid m \\ 0 & \text{otherwise}\end{cases}$$
  • \( \#\mathrm{Hom}(\mathbb{Z}_m, G) \) = number of \( g \in G \) with \( g^m = e \). Example: all 6 elements of \( S_3 \) satisfy \( g^6 = e \), so there are 6 homomorphisms \( \mathbb{Z}_6 \to S_3 \).
  • Any homomorphism from \( G \) to an abelian group factors through \( G/G' \). Since \( S_n/A_n \cong \mathbb{Z}_2 \), every homomorphism \( S_n \to \) (abelian) has image of order at most 2; \( S_3 \) has no onto homomorphism to \( \mathbb{Z}_3 \).
  • If \( \gcd(\lvert G \rvert, \lvert H \rvert) = 1 \), the only homomorphism \( G \to H \) is trivial.

Automorphisms

Group\( \mathrm{Aut}(G) \)
\( \mathbb{Z} \)\( \mathbb{Z}_2 \)
\( \mathbb{Z}_n \)\( U(n) \), order \( \varphi(n) \)
\( V_4 \)\( S_3 \)
\( \mathbb{Z}_p^k \)\( GL(k, \mathbb{F}_p) \), order \( \prod_{i=0}^{k-1}(p^k - p^i) \)
\( S_3 \)\( S_3 \) (all inner)
\( Q_8 \)\( S_4 \)

Inner automorphisms \( x \mapsto gxg^{-1} \) form \( \mathrm{Inn}(G) \cong G/Z(G) \), a normal subgroup of \( \mathrm{Aut}(G) \). So \( \mathrm{Aut}(G) \) cyclic forces \( G/Z(G) \) cyclic, hence \( G \) abelian.

Cayley’s Theorem

Proof sketch. For \( g \in G \), let \( \lambda_g(x) = gx \). Each \( \lambda_g \) is a bijection of \( G \), \( \lambda_{gh} = \lambda_g\lambda_h \), and \( \lambda_g = \mathrm{id} \) only for \( g = e \). So \( g \mapsto \lambda_g \) is an injective homomorphism.

Generalised Cayley. If \( H \le G \) has index \( n \), the action of \( G \) on the left cosets of \( H \) gives a homomorphism \( G \to S_n \) whose kernel lies inside \( H \). Consequence: if \( \lvert G \rvert \nmid n! \), then \( H \) contains a non-trivial normal subgroup of \( G \), so \( G \) is not simple. This is the “index trick” used with Sylow on the next page.

Cayley’s embedding is often far from optimal: \( S_3 \) embeds in itself, not just in \( S_6 \). But some groups need the full size: \( Q_8 \) embeds in \( S_8 \) and in no smaller \( S_n \) (a faithful action needs an orbit with trivial stabiliser, since every non-trivial subgroup of \( Q_8 \) contains \( -1 \)).

graph TD
    G[Finite group G] --> S[Subgroup H]
    S -->|"Lagrange: order of H divides order of G"| L[Index = number of cosets]
    S --> N{Normal?}
    N -->|yes| Q["Quotient G/H"]
    N -->|no| A["Act on cosets: G to S_n"]
    Q --> F["First isomorphism theorem: G/ker f = image"]
    A --> C["Kernel inside H: index trick"]

Memory Tricks

Don’t Confuse

ThisvsThat
\( D_n \) of order \( 2n \)\( D_{2n} \) notation for the same group in other books
\( Z(G) \): commutes with everything\( C(a) \): commutes with one element
\( \mathbb{Z}_m \times \mathbb{Z}_n \) cyclic iff \( \gcd(m,n) = 1 \)\( \mathbb{Z}_m \times \mathbb{Z}_n \) always abelian
\( \#\mathrm{Hom}(\mathbb{Z}_m, \mathbb{Z}_n) = \gcd(m, n) \)\( \lvert \mathrm{Aut}(\mathbb{Z}_n) \rvert = \varphi(n) \)
conjugate in \( S_n \) iff same cycle typein \( A_n \), a class of \( S_n \) may split into two
Cayley: \( G \hookrightarrow S_{\lvert G \rvert} \)generalised Cayley: \( G \to S_{[G:H]} \), kernel in \( H \)

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

  1. Find the order of \( (1\,2\,3)(4\,5) \in S_5 \). Is it even or odd?
  2. How many generators does \( \mathbb{Z}_{20} \) have?
  3. How many homomorphisms are there from \( \mathbb{Z}_{12} \) to \( \mathbb{Z}_{18} \)?
Answers
  1. Order 6, odd. \( \mathrm{lcm}(3, 2) = 6 \); one cycle of even length (the transposition), so odd.
  2. 8. \( \varphi(20) = 8 \).
  3. 6. \( \gcd(12, 18) = 6 \): \( 1 \mapsto b \) with \( 12b \equiv 0 \pmod{18} \), i.e. \( b \in \{0, 3, 6, 9, 12, 15\} \).

Level 2: Part B Style

Practice Q1. The number of elements of order 2 in \( S_5 \) is:

(a) 10 (b) 15 (c) 25 (d) 30

Answer: (c)

Transpositions \( \binom{5}{2} = 10 \) plus double transpositions \( \frac{5!}{2^2 \cdot 2! \cdot 1} = 15 \): total 25. Option (a) forgets the double transpositions.

Practice Q2. Which of the following groups is cyclic?

(a) \( \mathbb{Z}_4 \times \mathbb{Z}_6 \) (b) \( \mathbb{Z}_3 \times \mathbb{Z}_{10} \) (c) \( U(8) \) (d) \( S_3 \)

Answer: (b)

\( \gcd(3, 10) = 1 \), so \( \mathbb{Z}_3 \times \mathbb{Z}_{10} \cong \mathbb{Z}_{30} \). (a) has largest order 12 < 24. (c) \( U(8) \cong V_4 \). (d) is non-abelian.

Practice Q3. The number of normal subgroups of \( S_4 \) (including the trivial subgroup and \( S_4 \)) is:

(a) 2 (b) 3 (c) 4 (d) 5

Answer: (c)

\( \{e\}, V_4, A_4, S_4 \). A normal subgroup is a union of conjugacy classes (sizes 1, 3, 6, 6, 8) containing the identity with order dividing 24: \( 1 \), \( 1 + 3 = 4 \), \( 1 + 3 + 8 = 12 \), \( 24 \). No other sum works and gives a subgroup.

Practice Q4. The largest order of an element of \( S_7 \) is:

(a) 7 (b) 10 (c) 12 (d) 21

Answer: (c)

Partitions of 7: \( \mathrm{lcm}(3, 4) = 12 \) beats \( 7 \), \( \mathrm{lcm}(2, 5) = 10 \), \( \mathrm{lcm}(1,2,4) = 4 \), \( \mathrm{lcm}(2,2,3) = 6 \). Order 21 would need \( 3 + 7 = 10 \) symbols.

Level 3: Part C Style

Practice Q5. Which of the following are true?

(a) \( A_4 \) has a subgroup of order 6. (b) Every element of order 2 in \( A_5 \) is a product of two disjoint transpositions. (c) \( S_n \) is generated by \( (1\,2) \) and \( (1\,2\,\cdots\,n) \). (d) \( Z(S_n) \) is trivial for every \( n \ge 3 \).

Answer: (b), (c) and (d)
  • (a) False. A subgroup \( H \) of order 6 has index 2, so \( G/H \) has order 2 and \( g^2 \in H \) for every \( g \in A_4 \). Every 3-cycle \( c \) equals \( (c^2)^2 \), so all eight 3-cycles would lie in \( H \), which has only 6 elements.
  • (b) True. In \( S_5 \) the elements of order 2 are transpositions (odd) and double transpositions (even). Only the latter lie in \( A_5 \).
  • (c) True. Conjugating \( (1\,2) \) by powers of the \( n \)-cycle gives all \( (i\ i{+}1) \), which generate \( S_n \).
  • (d) True. Given \( \sigma \ne e \) with \( \sigma(i) = j \ne i \), pick \( k \notin \{i, j\} \) (possible as \( n \ge 3 \)); then \( \sigma \) does not commute with \( (j\,k) \).

Practice Q6. Which of the following are true?

(a) There are exactly 6 homomorphisms from \( \mathbb{Z}_6 \) to \( S_3 \). (b) There is a surjective homomorphism from \( S_4 \) onto \( S_3 \). (c) There is a surjective homomorphism from \( S_3 \) onto \( \mathbb{Z}_3 \). (d) Every homomorphism from \( \mathbb{Z}_5 \) to \( S_4 \) is trivial.

Answer: (a), (b) and (d)
  • (a) True. Homomorphisms correspond to \( g \in S_3 \) with \( g^6 = e \); all six elements have order 1, 2 or 3.
  • (b) True. \( S_4 \to S_4/V_4 \cong S_3 \).
  • (c) False. The kernel would be a normal subgroup of order 2; \( S_3 \) has none (its subgroups of order 2 are not normal). Equivalently, abelian images of \( S_3 \) have order at most \( [S_3 : A_3] = 2 \).
  • (d) True. The image of the generator must have order dividing 5; \( S_4 \) has no element of order 5 (\( 5 \nmid 24 \)).

Practice Q7. Compare \( Q_8 \) and \( D_4 \) (both of order 8). Which of the following are true?

(a) \( Q_8 \) and \( D_4 \) have the same number of elements of order 2. (b) Every subgroup of \( Q_8 \) is normal. (c) \( Q_8 / Z(Q_8) \cong \mathbb{Z}_2 \times \mathbb{Z}_2 \). (d) \( Q_8 \) is isomorphic to a subgroup of \( S_4 \).

Answer: (b) and (c)
  • (a) False. \( Q_8 \) has one element of order 2 (\( -1 \)); \( D_4 \) has five (\( r^2 \) and four reflections).
  • (b) True. The subgroups are \( \{1\} \), \( \{\pm 1\} \) (the centre), three cyclic subgroups of order 4 (index 2), and \( Q_8 \).
  • (c) True. The quotient has order 4, and is not cyclic (else \( Q_8 \) would be abelian), so it is \( V_4 \).
  • (d) False. A subgroup of order 8 of \( S_4 \) is a Sylow 2-subgroup, and those are isomorphic to \( D_4 \) (the symmetries of a square acting on its vertices). \( Q_8 \not\cong D_4 \) by (a).

Quick Revision Table

IdeaFact
Lagrange\( \lvert H \rvert \mid \lvert G \rvert \); converse fails (\( A_4 \), no subgroup of order 6)
\( \lvert HK \rvert \)\( \lvert H \rvert\lvert K \rvert / \lvert H \cap K \rvert \)
Cyclic of order \( n \)\( \tau(n) \) subgroups; \( \varphi(n) \) generators; \( \varphi(d) \) elements of order \( d \)
\( \mathbb{Z}_m \times \mathbb{Z}_n \) cycliciff \( \gcd(m, n) = 1 \)
Permutation orderlcm of cycle lengths
Cycle-type count\( n! / \prod k^{m_k} m_k! \)
Max order in \( S_5, S_6, S_7, S_8 \)6, 6, 12, 15
Normalindex 2; kernels; \( Z(G) \); not transitive
\( G/Z(G) \) cyclic\( \Rightarrow G \) abelian
Homs \( \mathbb{Z}_m \to \mathbb{Z}_n \)\( \gcd(m, n) \)
\( \mathrm{Aut}(\mathbb{Z}_n) \)\( U(n) \); \( \mathrm{Inn}(G) \cong G/Z(G) \)
Cayley\( G \hookrightarrow S_{\lvert G \rvert} \)

Key Takeaways

What’s Next