Chapter 10 · Introduction

Chapter 10 — Groups: Basics & Homomorphisms

Symmetry made precise: the group axioms and the standard examples, subgroups and cyclic groups, cosets and Lagrange's theorem, and then normal subgroups, quotient groups, homomorphisms and the isomorphism theorems that let us compare one group with another.

In 1770 Joseph-Louis Lagrange set out to understand why the quadratic, cubic and quartic equations can be solved by formulas built from radicals. He studied how an expression in the roots changes when the roots are permuted, and noticed that the number of different values such an expression can take always divides $n!$ — the seed of the theorem that now carries his name. Évariste Galois, around 1830, went much further: he attached to every polynomial its group of permutations of the roots, singled out the subgroups we now call normal, and showed that solvability by radicals depends on how the group can be broken down through them. Arthur Cayley gave the first abstract definition of a group in 1854; Camille Jordan's treatise of 1870 made the theory widely known; Otto Hölder introduced quotient groups in 1889; and Emmy Noether, in the 1920s, put the homomorphism and isomorphism theorems into the general form in which we use them today.

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; clock arithmetic is the cyclic group $\mathbb{Z}_{12}$; and the Diffie–Hellman key exchange behind secure web traffic is a computation in a large cyclic group, safe because taking "logarithms" there is hard. In this chapter we build the theory from the axioms. Section 10.1 treats the standard examples, subgroups, orders of elements, cyclic groups, cosets and Lagrange's theorem; Section 10.2 asks when cosets can be multiplied, and answers with normal subgroups, quotient groups, homomorphisms, the isomorphism and correspondence theorems, direct products and automorphisms. The number theory of Chapter 9 reappears throughout: $\mathbb{Z}_n$ and $U(n)$ are our first examples, the generators of a cyclic group are counted by Euler's $\varphi$, and Euler's theorem becomes a one-line consequence of Lagrange's. Chapter 11 then uses all of this to study permutation groups, group actions and the Sylow theorems.

Axioms & examples→Subgroups, orders→Cyclic groups→Cosets & Lagrange→The size of HK→Normal subgroups→Quotient groups→Homomorphisms, kernels→Isomorphism theorems→Direct products, Aut
🎯 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)$, $Q_8$ and $V_4$, and tell groups apart by counting their elements of each order;
  • test subsets for being 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, use "$G/Z(G)$ cyclic $\Rightarrow$ $G$ abelian", and apply the isomorphism and correspondence theorems;
  • count homomorphisms between cyclic groups, decide when $\mathbb{Z}_m\times\mathbb{Z}_n$ is cyclic, and compute $\operatorname{Aut}(\mathbb{Z}_n)\cong U(n)$ and $\operatorname{Inn}(G)\cong G/Z(G)$.
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. The rotations form the subgroup $\langle r\rangle$ of index $2$, the reflections form its other coset, and "which coset am I in?" is a homomorphism $D_n\to\mathbb{Z}_2$ with kernel $\langle r\rangle$ (§10.2). Press Play for a random walk.

moves so far—
symmetry rⁱsᵃ—
its order—
coset of ⟨r⟩ → image in ℤ₂—
as a permutation of corners—

How this is examined

The basic theory of groups is one of the most regularly examined parts of the algebra syllabus in CSIR NET. Part B favours short computations with one correct answer: the number of elements of a given order in $\mathbb{Z}_n$, $U(n)$, $D_n$ or a direct product such as $\mathbb{Z}_m\times\mathbb{Z}_n$; the number of subgroups or of generators of a cyclic group; the number of homomorphisms $\mathbb{Z}_m\to\mathbb{Z}_n$ (or of onto or one-one ones); $|\operatorname{Aut}(\mathbb{Z}_n)|$; the order and the isomorphism type of a quotient such as $(\mathbb{Z}_4\times\mathbb{Z}_6)/\langle(2,3)\rangle$. Part C, where more than one option may be correct, asks for statements to be judged: "every group of order $n$ is cyclic", "$U(n)$ is cyclic", "the union of two subgroups is a subgroup", "$G/Z(G)$ cyclic implies…", "which of these subgroups are normal?", "$\mathbb{Z}_m\times\mathbb{Z}_n\cong\mathbb{Z}_{mn}$", "what can $|H\cap K|$ be?". 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 although it is not abelian, $V_4$ and $U(8)$ as non-cyclic groups all of whose proper subgroups are cyclic, $D_4$ for the non-transitivity of normality — and the ⚠️ box of each section 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, Sets, Functions and Countable Sets), and matrices and determinants from its linear algebra chapters. From this course you need divisibility, gcd, Euclid's lemma and congruences (§9.2), Euler's function $\varphi$, Gauss's identity $\sum_{d\mid n}\varphi(d)=n$ and primitive roots (§9.3), and basic counting (§9.1). Roots of unity (§1.1) give the groups $\mu_n$. Read the two sections in order: §10.2 uses everything in §10.1, and Chapter 11 (permutation groups and Sylow theory) builds on both.