← 2017 Paper 2
UPSC 2017 Maths Optional Paper 2 Q1b — Step-by-Step Solution
10 marks · Section A
Cayley's Theorem · Algebra · Read the full method →
Question
Let G be a group of order n. Show that G is isomorphic to a subgroup of the permutation group Sn.
Technique
Left-regular representation — g↦Lg (left multiplication); show it is a permutation, a homomorphism, with trivial kernel; conclude G↪Sn.
Solution
This is Cayley’s theorem. The idea: each g∈G acts on the set G by left multiplication, and this action is a permutation of the n-element set G; the map sending g to that permutation is an injective homomorphism into Sym(G)≅Sn.
Step 1 — Left translation is a permutation of G
For g∈G define Lg:G→G by Lg(x)=gx. Then Lg is a bijection:
- Injective: Lg(x)=Lg(y)⇒gx=gy⇒x=y (cancel g).
- Surjective: for any y∈G, Lg(g−1y)=g(g−1y)=y.
Hence Lg∈Sym(G), the group of all bijections of the set G under composition. Since ∣G∣=n, Sym(G)≅Sn (relabel the n elements of G as 1,…,n).
Step 2 — The map Φ:G→Sym(G) is a homomorphism
Define Φ(g)=Lg. For all g,h,x∈G,
Lgh(x)=(gh)x=g(hx)=Lg(Lh(x))=(Lg∘Lh)(x),
so Lgh=Lg∘Lh, i.e. Φ(gh)=Φ(g)Φ(h). Thus Φ is a group homomorphism. (Associativity of G is exactly what makes this work; note Le=id since ex=x.)
Step 3 — Φ is injective
Compute the kernel. If Φ(g)=Lg=id, then gx=x for all x∈G; taking x=e gives g=ge=e. Hence
kerΦ={e},
so Φ is injective. (Equivalently, Φ is a monomorphism.)
Step 4 — Conclude via the first isomorphism theorem
Φ:G→Sym(G) is an injective homomorphism, so G≅Φ(G), and Φ(G) is a subgroup of Sym(G)≅Sn. Therefore
Answer
G is isomorphic to a subgroup of Sn.