Chapter 7 · Introduction

Chapter 7 — Algebra

Groups and their symmetries, rings and their ideals, fields and their extensions — the three structures of abstract algebra, and the counting arguments (orders, Sylow numbers, units, irreducible polynomials, degrees) that GATE MA builds its algebra questions on.

A chemist identifying a molecule from its spectrum, a crystallographer sorting minerals into the $230$ space groups, a cryptographer choosing parameters for an elliptic-curve key exchange and an engineer designing the error-correcting code inside a QR label all use the same mathematics. They work with sets on which a few operations are defined — composing symmetries, adding and multiplying residues or polynomials — and they rely on facts that follow from the rules of those operations alone: how many elements of a given order there must be, which equations can be solved, which polynomials can be factored, how large a finite field can be. Abstract algebra is the study of such structures, and its power comes from how little it assumes: a theorem proved for all groups applies at once to permutations, matrices, residues and symmetries.

This chapter develops the three central structures in turn. Section 7.1 is about groups: orders of elements and Lagrange's theorem, cyclic groups and the groups of units $U(n)$, normal subgroups, quotients and homomorphisms, automorphism groups, permutations, group actions and the class equation, and finally the Sylow theorems, which decide the existence of subgroups of prime-power order and settle many "is there a simple group of order $n$?" questions. Section 7.2 is about rings: units, zero divisors and nilpotents, ideals and quotient rings, prime and maximal ideals, the chain Euclidean domain ⇒ PID ⇒ UFD with its counterexamples, and polynomial rings with Gauss's lemma and Eisenstein's criterion. Section 7.3 is about fields: extensions and their degrees, algebraic and algebraically closed fields, splitting fields, and the finite fields $\mathbb{F}_{p^n}$, built as quotients $\mathbb{F}_p[x]/\langle f\rangle$ by irreducible polynomials from §7.2.

Groups & orders→Lagrange, cyclic groups→Normal subgroups, quotients→Homomorphisms, automorphisms→Permutations, actions→Class equation, Sylow→Rings & ideals→Prime & maximal ideals→ED ⇒ PID ⇒ UFD→Irreducible polynomials→Field extensions→Finite fields
🎯 By the end of this chapter you can…
  • count elements of each order in cyclic groups, products, $U(n)$, $S_n$, $D_n$ and $Q_8$, and decide quickly whether a group is cyclic;
  • recognise normal subgroups, identify quotient groups, count homomorphisms between groups and compute automorphism groups such as $\operatorname{Aut}(\mathbb{Z}_n)\cong U(n)$;
  • use the orbit–stabiliser theorem, the class equation and the Sylow theorems to count conjugacy classes and Sylow subgroups, classify groups of orders $p^2$ and $pq$, show that groups of a given order are not simple, and count abelian groups of order $n$;
  • count units, nilpotents, idempotents and ideals in $\mathbb{Z}_n$ and in quotient rings, and decide which ideals are prime or maximal;
  • place a ring in the hierarchy field ⊂ ED ⊂ PID ⊂ UFD ⊂ domain with the standard counterexamples, and decide irreducibility of polynomials with the root test, Gauss's lemma, Eisenstein and reduction mod $p$;
  • compute degrees of field extensions with the tower law, describe splitting fields, and use the structure of finite fields (§7.3).
Teaser — Same Size, Different Group: Reading a Cayley Table

The Cayley table of a group lists every product $gh$ (row $g$, column $h$), each element with its own colour. Press Play: the scan highlights one row at a time — every row contains every element exactly once (a Latin square), because $h\mapsto gh$ is a bijection. When the scan finishes, the cells where $gh\ne hg$ are outlined in red: a group is abelian exactly when its table is symmetric about the diagonal. Compare the five groups of order $8$ — all Latin squares of the same size, yet no two of them the same group. What could tell them apart?

|G|—
abelian?—
|Z(G)|—
elements of order 2—

How this is examined

Algebra contributes a steady share of GATE MA questions in all three formats, and nearly all of them are counts or classifications rather than proofs. MCQs ask which group a given one is isomorphic to (a $U(n)$, a quotient of a product, a group of order $8$), for the number of homomorphisms between two groups, for the maximal ideal among four ideals of $\mathbb{Z}[x]$, or for the degree of an extension like $\mathbb{Q}(\sqrt2,\sqrt3)$. MSQs list statements about groups of a given order (is there a normal Sylow subgroup? must the group be abelian? cyclic?), about rings (which are integral domains, PIDs, UFDs, fields?) or about polynomials (which are irreducible?), and their false options are the standard counterexamples collected in each section's ⚠️ box — $A_4$, $Q_8$, $\mathbb{Z}[x]$, $\mathbb{Z}[\sqrt{-5}]$, $x^4+4$. NATs ask for a number: elements of order $6$ in $S_6$, conjugacy classes of a group of order $27$, abelian groups of order $360$, units of a quotient ring, monic irreducible cubics over $\mathbb{Z}_3$, the order of $\operatorname{Aut}(\mathbb{F}_{p^n})$. The same topics appear in IIT JAM and, with full proofs, in CSIR NET Part C; each section's 📚 box points to the CSIR course for those proofs.

Sections in this chapter

✅ Before you start

You need elementary number theory — divisibility, gcd and lcm, Bézout's identity, congruences mod $n$, Euler's function $\varphi$ and the Chinese remainder theorem — together with sets, functions and equivalence relations, and the arithmetic of polynomials (long division, roots and factors). A first course in group theory at BSc level helps but is not assumed: §7.1 starts from the axioms. Some matrix language from Chapter 3 is used for the groups $GL(n,\mathbb{Z}_p)$ and for $\operatorname{Aut}(\mathbb{Z}_p^{\,k})$ (see §3.1 for counting bases over a finite field), and the minimal polynomial of a matrix in §3.2 is the linear-algebra cousin of the minimal polynomial of an algebraic number in §7.3. If this is your first course of this kind, read the welcome page for how the sections are organised and how the 🎯 GATE corner works.