Chapter 6 · Introduction

Chapter 6 — Groups

Symmetry made precise: groups and subgroups, cyclic groups and Lagrange's theorem, normal subgroups, quotients and homomorphisms, permutation groups and group actions, and the Sylow theorems that organise every finite group.

In 1770 Joseph-Louis Lagrange tried to understand why the quadratic, cubic and quartic equations can be solved by formulas built from radicals, and noticed that the answer lay in how certain expressions in the roots change when the roots are permuted. Sixty years later the twenty-year-old Évariste Galois turned this observation into a theory: to every polynomial he attached its group of permutations of the roots, and he showed that the equation is solvable by radicals exactly when this group can be broken down, step by step, into abelian pieces. The general quintic fails because its group, $S_5$, contains the simple group $A_5$, which cannot be broken down at all. Galois summarised his results in a famous letter written on the night before the duel in which he was killed in 1832; it took Liouville, Jordan and others until 1870 to make them generally understood. Meanwhile Augustin-Louis Cauchy had developed the algebra of permutations, Arthur Cayley in 1854 gave the first abstract definition of a group (and proved that every group is a group of permutations), and Ludwig Sylow in 1872 proved the theorems on subgroups of prime-power order that still organise the study of finite groups.

Groups are the mathematics of symmetry, and symmetry is everywhere. The $230$ space groups classified by Fedorov and Schoenflies in 1891 describe every possible crystal structure and are used daily in X-ray crystallography; the Standard Model of particle physics is built on the groups $U(1)$, $SU(2)$ and $SU(3)$; the $43\,252\,003\,274\,489\,856\,000$ positions of a Rubik's cube form a group, and solving the cube is a word problem in it; and the Diffie–Hellman and elliptic-curve key exchanges behind secure internet traffic are computations in large cyclic groups. In this chapter we build the theory from the axioms. Section 6.1 treats subgroups, cyclic groups, cosets and Lagrange's theorem; Section 6.2 normal subgroups, quotient groups, homomorphisms and the isomorphism theorems; Section 6.3 permutation groups, group actions and the class equation; and Section 6.4 the Sylow theorems and the classification of finite abelian groups. The number theory of Chapter 5 reappears throughout: $\mathbb{Z}_n$ and $U(n)$ are our first examples, and Euler's theorem becomes a one-line consequence of Lagrange's.

Axioms & examples→Subgroups, orders→Cyclic groups→Cosets & Lagrange→Normal subgroups→Quotients & homomorphisms→Isomorphism theorems→Permutations, Aₙ→Group actions→Class equation→Sylow theorems→Finite abelian groups
🎯 By the end of this chapter you can…
  • verify the group axioms, work fluently in $\mathbb{Z}_n$, $U(n)$, $S_n$, $D_n$, $GL(n,F)$ and $Q_8$, and tell groups apart by counting elements of each order;
  • test subgroups, compute orders of elements, and describe every subgroup and every generator of a cyclic group;
  • use cosets and Lagrange's theorem, decide when $U(n)$ is cyclic, and bound $|H\cap K|$ through $|HK|=|H||K|/|H\cap K|$;
  • recognise normal subgroups, form and identify quotient groups, and apply the isomorphism and correspondence theorems;
  • count homomorphisms between cyclic groups, compute $\operatorname{Aut}(\mathbb{Z}_n)$, $\operatorname{Inn}(G)$ and direct products;
  • compute with permutations — cycle type, order, parity, conjugacy classes in $S_n$ — and apply Cayley's theorem;
  • use group actions, the orbit–stabiliser theorem, Burnside's lemma and the class equation, and prove that $p$-groups have non-trivial centre;
  • apply the Sylow theorems to count Sylow subgroups, prove that groups of given order are not simple, and list the abelian groups of a given order.
Teaser — The Dihedral Group at Work

Press r to rotate the polygon through $2\pi/n$ and s to reflect it in the vertical axis. However long the sequence of moves, the result is one of only $2n$ symmetries, each of the form $r^is^a$ ($0\le i\lt n$, $a\in\{0,1\}$) — the grid on the right lights up the one you are at. Try $s\,r\,s$: you land on $r^{-1}$, the relation that makes $D_n$ non-abelian. Each symmetry also permutes the labels $1,\dots,n$ of the corners, so $D_n$ sits inside $S_n$ (Cayley's idea, §6.3). Press Play for a random walk.

moves so far—
symmetry rⁱsᵃ—
its order—
as a permutation of corners—

How this is examined

Group theory is the most heavily examined part of the algebra syllabus in CSIR NET, and almost every paper has several questions from it. Part B favours short computations with one correct answer: the number of elements of a given order in $\mathbb{Z}_n$, $D_n$, $S_n$ or a direct product; the number of subgroups or generators of a cyclic group; the number of homomorphisms $\mathbb{Z}_m\to\mathbb{Z}_n$ (or onto ones); $|\operatorname{Aut}(\mathbb{Z}_n)|$; the order of a permutation or the number of conjugates of a given cycle type; the number of Sylow $p$-subgroups; the number of abelian groups of order $n$ up to isomorphism. Part C, where more than one option may be correct, asks for statements to be judged: "every group of order $n$ is cyclic / abelian", "$U(n)$ is cyclic", "a group of order $pq$ is not simple", "$G/Z(G)$ cyclic implies…", "which of these subgroups are normal?", "$\mathbb{Z}_m\times\mathbb{Z}_n\cong\mathbb{Z}_{mn}$". The false options are built from a short list of standard counterexamples — $A_4$ with no subgroup of order $6$, $Q_8$ with every subgroup normal, $S_3$ as a non-abelian extension of abelian groups, $V_4$ and $U(8)$ as non-cyclic groups with cyclic subgroups, $D_4$ for non-transitivity of normality — and each section's ⚠️ box collects them. GATE MA asks very similar questions, often as numerical-answer items.

Sections in this chapter

✅ Before you start

You need the language of sets, functions and equivalence relations — in particular that the classes of an equivalence relation partition a set — from the sister course CSIR NET Unit 1 — Analysis and Linear Algebra (§1.1), and matrices and determinants from its linear algebra chapters. From this course you need divisibility, gcd, Euclid's lemma and congruences (§5.2), Euler's function $\varphi$, Gauss's identity $\sum_{d\mid n}\varphi(d)=n$ and primitive roots (§5.3), and basic counting (§5.1). Roots of unity (§1.1) give the groups $\mu_n$. Read the sections in order: §6.2 uses everything in §6.1, and §6.4 relies on the group actions of §6.3.