Chapter 11 — Sylow Theory & Permutation Groups
Groups at work: permutations, parity and conjugacy in $S_n$; groups acting on sets, the orbit–stabiliser theorem, Burnside's lemma and the class equation; and the Sylow theorems and the classification of finite abelian groups, which together organise every group of small order.
Groups were born as groups of permutations. Paolo Ruffini in 1799 and, conclusively, Niels Henrik Abel in 1824 proved that the general quintic equation cannot be solved by radicals by studying how its five roots can be shuffled; Augustin-Louis Cauchy, in long papers of 1815 and 1844–46, developed the algebra of permutations — the cycle notation we still use, the sign of a permutation, and the theorem that a prime dividing the order of a group is the order of one of its elements. Galois's insight was that solvability is decided by the structure of the group of the equation: for the general quintic that group is $S_5$, and its subgroup $A_5$ cannot be broken down any further. In 1872 the Norwegian schoolteacher Ludwig Sylow proved the theorems on subgroups of prime-power order that bear his name; Frobenius and Stickelberger classified the finite abelian groups in 1879; and the orbit-counting lemma, known through William Burnside's book of 1897 but already used by Cauchy and Frobenius, became in George Pólya's hands (1937) a standard method for counting chemical isomers.
The idea that ties all of this together is a group acting on a set: rotations act on the faces of a cube, the $43\,252\,003\,274\,489\,856\,000$ positions of a Rubik's cube form a single orbit of the cube group, a group acts on itself by conjugation, and it acts on its own Sylow subgroups. Counting orbits and stabilisers turns structural questions into arithmetic — which is why one can prove, without ever writing down a multiplication table, that every group of order $15$ is cyclic and that no group of order $30$ is simple. Section 11.1 develops permutations (cycles, parity, the alternating group, conjugacy classes), Cayley's theorem, group actions, the orbit–stabiliser theorem, Burnside's lemma and the class equation with its consequences for $p$-groups. Section 11.2 proves Cauchy's and Sylow's theorems, applies them to groups of order $pq$ and to the non-existence of simple groups of many orders, shows that $A_5$ is simple, and classifies finite abelian groups. Both sections lean on the subgroups, cosets, quotients and homomorphisms of Chapter 10 and on the congruences of Chapter 9; the simplicity of $A_5$ returns in Galois theory (§13.4).
- compute with permutations — cycle decomposition, order as an lcm, parity, the number of permutations of a given cycle type — and decide which orders occur in $S_n$ and $A_n$;
- describe conjugacy classes and centralisers in $S_n$ by cycle type, and tell when a class of $S_n$ splits in $A_n$;
- use group actions, Cayley's theorem, the orbit–stabiliser theorem and Burnside's lemma, for instance to count colourings up to symmetry;
- write and test class equations, prove that $p$-groups have non-trivial centre and that groups of order $p^2$ are abelian;
- apply Cauchy's and the Sylow theorems to count Sylow subgroups, settle groups of order $pq$, and prove that groups of a given order are not simple;
- list the abelian groups of a given order by elementary divisors and invariant factors, and decide when two such groups are isomorphic.
How this is examined
Permutation groups and Sylow theory are among the most regularly examined topics of CSIR NET algebra. Part B favours computations with a single answer: the order of a given permutation, the number of elements of a given order or cycle type in $S_n$ or $A_n$, the size of a conjugacy class or of a centraliser, the largest order of an element of $S_n$, the number of essentially different colourings of a necklace or a cube, the number of Sylow $p$-subgroups of $S_4$, $A_5$ or a group of given order, the number of elements of order $p$ forced by Sylow counting, and the number of abelian groups of a given order up to isomorphism. Part C, where more than one option may be correct, asks for statements to be judged: "which of these are class equations of a group?", "a group of order $p^3$ has non-trivial centre", "every group of order $p^2$ is abelian", "every group of order $pq$ is cyclic", "no group of order $n$ is simple", "$A_n$ is simple for $n\ge5$", "these two abelian groups are isomorphic". The traps are standard: $S_3$ shows that a group of order $pq$ need not be cyclic when $p\mid q-1$; $A_4$ shows that Lagrange's theorem has no converse for orders that are not prime powers; $D_4$ and $Q_8$ have the same order and the same number of classes but different numbers of elements of order $2$; and $\mathbb{Z}_2\times\mathbb{Z}_6\not\cong\mathbb{Z}_{12}$ although both have order $12$. The ⚠️ boxes of the two sections collect these. GATE MA asks very similar questions, often as numerical-answer items.
Sections in this chapter
Permutation Groups, Group Actions and the Class Equation
Cycle notation, orders and parity of permutations, the alternating group, conjugacy classes in $S_n$ and $A_n$ by cycle type, Cayley's theorem, group actions, orbit–stabiliser, Burnside's lemma, the class equation, $p$-groups and groups of order $p^2$.
Sylow Theorems and Finite Abelian Groups
Cauchy's theorem, the three Sylow theorems, counting Sylow subgroups, groups of order $pq$, proving that groups of given order are not simple, the simplicity of $A_5$, and the fundamental theorem of finite abelian groups.
This chapter uses all of Chapter 10 (Groups: Basics & Homomorphisms): subgroups, orders of elements and cyclic groups, cosets, index and Lagrange's theorem (§10.1), and normal subgroups, quotient groups, the centre, homomorphisms, the first isomorphism theorem and direct products (§10.2). Counting with factorials, multinomial coefficients and partitions (§9.1) is used to count permutations and colourings, and congruences and gcds (§9.2) and orders modulo $n$ (§9.3) run through the Sylow arguments. Read the sections in order: the proofs of §11.2 are built from the group actions and the class equation of §11.1.