Chapter 7 · Algebra

7.1 Groups, Homomorphisms, Group Actions and Sylow Theorems

Groups from the axioms to the Sylow theorems — orders of elements, cyclic groups and $U(n)$, normal subgroups and quotients, homomorphisms and automorphism groups, permutations, group actions and the class equation — with the counting tools that GATE MA turns into MCQ, MSQ and NAT questions.

A group is what is left of arithmetic when only one operation is kept: a set with an associative product, an identity and inverses. That is very little structure, and yet it is enough to force surprisingly rigid conclusions. Lagrange's theorem says that the order of every subgroup divides the order of the group; Cauchy and Sylow turn this around and guarantee subgroups of prime-power order; and a few lines of counting then show, for example, that every group of order $35$ is cyclic and that no group of order $56$ is simple. Groups appear wherever there is symmetry — the symmetries of a molecule or a crystal, the shuffles of a deck of cards, the moves of a Rubik's cube, the invertible residues used in RSA encryption, the error-correcting codes in a phone — and the counting arguments of this section are the ones used in all of those places.

GATE MA asks about groups in a very characteristic way: almost every question is a count. How many elements of order $6$ does a group have? How many homomorphisms are there between two given groups, how many automorphisms does a group have, how many Sylow $5$-subgroups can it have, how many abelian groups of order $360$ are there? MSQs then list statements about normal subgroups, quotients and simple groups whose false options are standard counterexamples ($A_4$, $Q_8$, $S_3$). This section collects exactly these tools, with the key proofs; the 📚 box at the end links to the complete development in the CSIR NET course. Throughout, $\mathbb{Z}_n$ is the additive group of residues mod $n$, $U(n)$ the multiplicative group of units mod $n$, $D_n$ the dihedral group of order $2n$, and permutations are composed right to left, like functions.

Groups, Subgroups, Orders and Cyclic Groups

📘 Definition 7.1 — Group; the standard examples

A group is a set $G$ with a binary operation $(a,b)\mapsto ab$ that is associative, has an identity $e$ ($ea=ae=a$ for all $a$), and in which every $a$ has an inverse $a^{-1}$ ($aa^{-1}=a^{-1}a=e$). $G$ is abelian if $ab=ba$ for all $a,b$. The order $|G|$ is the number of elements of $G$. The examples used throughout:

$\mathbb{Z}_n$ and $U(n)$$\mathbb{Z}_n=\{0,1,\dots,n-1\}$ under addition mod $n$ (order $n$); $U(n)=\{a\in\mathbb{Z}_n:\gcd(a,n)=1\}$ under multiplication mod $n$ (order $\varphi(n)$, Euler's function). Both abelian.
$S_n$ and $A_n$All permutations of $\{1,\dots,n\}$ (order $n!$), composed right to left: $\sigma\tau$ means "first $\tau$, then $\sigma$". $A_n$ = even permutations, order $n!/2$.
$D_n$ ($n\ge3$), order $2n$Symmetries of a regular $n$-gon: rotations $r^i$ and reflections $r^is$, with $r^n=s^2=e$ and $srs^{-1}=r^{-1}$, so $sr^k=r^{-k}s$.
$Q_8$ and $V_4$$Q_8=\{\pm1,\pm i,\pm j,\pm k\}$ with $i^2=j^2=k^2=ijk=-1$. $V_4=\mathbb{Z}_2\times\mathbb{Z}_2$, the Klein four-group: three elements of order $2$.
Matrix groups$GL(n,F)$, invertible matrices over a field $F$; $SL(n,F)$, those of determinant $1$. $|GL(2,\mathbb{Z}_p)|=(p^2-1)(p^2-p)$, $|SL(2,\mathbb{Z}_p)|=p(p^2-1)$.
Infinite groups$(\mathbb{Z},+)$, $(\mathbb{Q},+)$, $(\mathbb{R},+)$, $\mathbb{Q}^*$, $\mathbb{R}^*$, $\mathbb{C}^*$, the circle $S^1=\{z:|z|=1\}$, and $\mathbb{Q}/\mathbb{Z}$.
📘 Definition 7.2 — Subgroup; generated subgroup; centre
A subset $H\subseteq G$ is a subgroup, $H\le G$, if it is a group under the operation of $G$. For $S\subseteq G$, $\langle S\rangle$ is the smallest subgroup containing $S$ (all finite products of elements of $S$ and their inverses). The centre is $Z(G)=\{z\in G:zg=gz\ \text{for all }g\in G\}$, and the centraliser of $a$ is $C(a)=\{g\in G:ga=ag\}$; both are subgroups.
📐 Theorem 7.1 — Subgroup tests
Let $\varnothing\ne H\subseteq G$. (a) $H\le G$ if and only if $ab^{-1}\in H$ for all $a,b\in H$. (b) If $H$ is finite, $H\le G$ if and only if $H$ is closed under the product. (c) The intersection of subgroups is a subgroup; the union $H\cup K$ of two subgroups is a subgroup only if $H\subseteq K$ or $K\subseteq H$.

Proof. (a) Taking $b=a$ gives $e\in H$; then $b^{-1}=eb^{-1}\in H$, and $ab=a(b^{-1})^{-1}\in H$. (b) For $a\in H$ the powers $a,a^2,a^3,\dots$ lie in the finite set $H$, so $a^i=a^j$ for some $i\lt j$, whence $a^{j-i}=e$ and $a^{-1}=a^{j-i-1}\in H$; now use (a). (c) The first part is immediate from (a). If $h\in H\setminus K$ and $k\in K\setminus H$, then $hk\in H$ would give $k=h^{-1}(hk)\in H$, and $hk\in K$ would give $h\in K$; so $hk\notin H\cup K$. ∎

📘 Definition 7.3 — Order of an element; cyclic group
The order $o(a)$ of $a\in G$ is the least $n\ge1$ with $a^n=e$, or $\infty$ if there is none; it equals $|\langle a\rangle|$, where $\langle a\rangle=\{a^k:k\in\mathbb{Z}\}$. $G$ is cyclic if $G=\langle g\rangle$ for some $g$, a generator. Every cyclic group is isomorphic to $\mathbb{Z}$ or to some $\mathbb{Z}_n$.
📐 Theorem 7.2 — Rules for orders
Let $o(a)=n\lt\infty$.
  1. $a^m=e\iff n\mid m$; and $a^i=a^j\iff i\equiv j\pmod n$.
  2. $o(a^k)=\dfrac{n}{\gcd(n,k)}$. In particular $a^k$ generates $\langle a\rangle$ iff $\gcd(k,n)=1$.
  3. $o(a^{-1})=o(a)$ and $o(gag^{-1})=o(a)$; hence $o(ab)=o(ba)$.
  4. If $ab=ba$ and $\gcd(o(a),o(b))=1$, then $o(ab)=o(a)\,o(b)$.

Proof. (1) Write $m=qn+r$ with $0\le r\lt n$: $a^m=(a^n)^qa^r=a^r$, which is $e$ iff $r=0$ by minimality of $n$. (2) $(a^k)^m=e$ $\iff$ $n\mid km$ $\iff$ $\frac{n}{d}\mid\frac kd m$ $\iff$ $\frac nd\mid m$, where $d=\gcd(n,k)$ and $\gcd(\frac nd,\frac kd)=1$. (3) $(gag^{-1})^m=ga^mg^{-1}$ is $e$ iff $a^m=e$; and $ba=a^{-1}(ab)a$. (4) Let $m=o(a)$, $k=o(b)$. Clearly $(ab)^{mk}=a^{mk}b^{mk}=e$. If $(ab)^t=e$ then $a^t=b^{-t}\in\langle a\rangle\cap\langle b\rangle$, a subgroup whose order divides both $m$ and $k$ (Lagrange, below), hence is $\{e\}$; so $a^t=b^t=e$, $m\mid t$, $k\mid t$, and $mk\mid t$. ∎

📐 Theorem 7.3 — Fundamental theorem of cyclic groups
  1. Every subgroup of a cyclic group is cyclic.
  2. If $|\langle a\rangle|=n$, then for every divisor $d$ of $n$ there is exactly one subgroup of order $d$, namely $\langle a^{n/d}\rangle$, and there are no others. So $\mathbb{Z}_n$ has exactly $\tau(n)$ subgroups ($\tau$ = number of divisors).
  3. For $d\mid n$, $\langle a\rangle$ has exactly $\varphi(d)$ elements of order $d$; it has $\varphi(n)$ generators; and $\sum_{d\mid n}\varphi(d)=n$.
  4. In $\mathbb{Z}_n$ the equation $dx=0$ has exactly $\gcd(d,n)$ solutions, for every $d\ge1$.

Proof. (1) Let $H\le\langle a\rangle$, $H\ne\{e\}$, and let $k$ be the least positive integer with $a^k\in H$. For $a^m\in H$ write $m=qk+r$, $0\le r\lt k$; then $a^r=a^m(a^k)^{-q}\in H$, so $r=0$: $H=\langle a^k\rangle$. (2) By (1) a subgroup is $\langle a^k\rangle$, of order $n/\gcd(n,k)$; and $\langle a^k\rangle=\langle a^{\gcd(n,k)}\rangle$ because each is a power of the other (Bézout). So the subgroups are the $\langle a^{e}\rangle$ with $e\mid n$, one for each order $n/e$. (3) The elements of order $d$ all lie in the unique subgroup of order $d$, which is cyclic of order $d$, and there they are the generators: $\varphi(d)$ of them by Theorem 7.2(2). Counting the $n$ elements of $\langle a\rangle$ by their orders gives $\sum_{d\mid n}\varphi(d)=n$. (4) $dx\equiv0\pmod n$ iff $\frac{n}{\gcd(d,n)}\mid x$. ∎

📘 Definition 7.4 — Cosets and index
For $H\le G$ and $a\in G$, the left coset is $aH=\{ah:h\in H\}$ and the right coset $Ha$. The number of left cosets (equal to the number of right cosets, via $aH\mapsto Ha^{-1}$) is the index $[G:H]$.
📐 Theorem 7.4 — Lagrange's theorem and its consequences
Let $G$ be finite and $H\le G$. Then $|G|=[G:H]\,|H|$; in particular $|H|$ divides $|G|$. Consequently:
  1. $o(a)$ divides $|G|$ and $a^{|G|}=e$ for every $a\in G$;
  2. a group of prime order $p$ is cyclic, generated by each of its $p-1$ non-identity elements;
  3. (Euler, Fermat) $a^{\varphi(n)}\equiv1\pmod n$ when $\gcd(a,n)=1$, and $a^p\equiv a\pmod p$ for $p$ prime;
  4. if $K\le H\le G$ then $[G:K]=[G:H][H:K]$.

Proof. The relation $a\sim b\iff a^{-1}b\in H$ is an equivalence relation whose classes are the left cosets, so the cosets partition $G$. Each coset has $|H|$ elements, because $h\mapsto ah$ is a bijection $H\to aH$ (its inverse is $x\mapsto a^{-1}x$). Hence $|G|$ is $|H|$ times the number of cosets. (1) Apply this to $H=\langle a\rangle$, of order $o(a)$, and use Theorem 7.2(1). (2) If $a\ne e$ then $o(a)\gt1$ divides $p$, so $o(a)=p$ and $\langle a\rangle=G$. (3) Apply (1) in $U(n)$, of order $\varphi(n)$. (4) Divide $|G|=[G:H]|H|$ by $|K|$. ∎

📐 Theorem 7.5 — The product formula
For finite subgroups $H,K\le G$ the set $HK=\{hk:h\in H,\ k\in K\}$ has $$|HK|=\frac{|H|\,|K|}{|H\cap K|}.$$ $HK$ is a subgroup if and only if $HK=KH$; this holds in particular when $H$ or $K$ is normal (Definition 7.5).

Proof. The map $H\times K\to HK$, $(h,k)\mapsto hk$, is onto, and $hk=h'k'$ iff $h'=ht$, $k'=t^{-1}k$ for some $t=h^{-1}h'=kk'^{-1}\in H\cap K$. So every element of $HK$ has exactly $|H\cap K|$ preimages. If $HK=KH$, then $(HK)(HK)^{-1}=HKK^{-1}H^{-1}$, which is $HKH=HHK=HK$, so $HK\le G$ by Theorem 7.1; conversely a subgroup $HK$ equals its set of inverses $K^{-1}H^{-1}=KH$. ∎

📐 Theorem 7.6 — The structure of $U(n)$
  1. If $\gcd(m,n)=1$ then $U(mn)\cong U(m)\times U(n)$ (Chinese remainder theorem), so $\varphi(mn)=\varphi(m)\varphi(n)$.
  2. For an odd prime $p$, $U(p^k)$ is cyclic of order $p^{k-1}(p-1)$. $U(2)$ and $U(4)\cong\mathbb{Z}_2$ are cyclic, and for $k\ge3$, $U(2^k)\cong\mathbb{Z}_2\times\mathbb{Z}_{2^{k-2}}$ (generated by $-1$ and $5$).
  3. $U(n)$ is cyclic if and only if $n\in\{1,2,4,p^k,2p^k\}$ with $p$ an odd prime. In particular $U(p)$ is cyclic for every prime $p$ — more generally every finite subgroup of the multiplicative group of a field is cyclic.

Proof (of the parts GATE uses). (1) $a\bmod mn\mapsto(a\bmod m,\ a\bmod n)$ is a bijection $\mathbb{Z}_{mn}\to\mathbb{Z}_m\times\mathbb{Z}_n$ preserving products, and $a$ is prime to $mn$ iff it is prime to $m$ and to $n$. (3), "only if": a cyclic group has at most one element of order $2$ (Theorem 7.3(3) with $d=2$). For $k\ge3$, $U(2^k)$ contains the three elements $-1$ and $2^{k-1}\pm1$ of order $2$, since $(2^{k-1}\pm1)^2=2^{2k-2}\pm2^k+1\equiv1$. If $n=mn'$ with $\gcd(m,n')=1$ and $m,n'\gt2$, then $\varphi(m)$ and $\varphi(n')$ are both even, so $U(m)\times U(n')$ contains $(-1,1)$, $(1,-1)$, $(-1,-1)$, three elements of order $2$. The remaining $n$ are exactly those listed. The cyclicity of $U(p^k)$ (existence of a primitive root) is proved in the 📚 box. ∎

🧭 Counting elements of a given order in an abelian group
  1. In $G=\mathbb{Z}_{n_1}\times\cdots\times\mathbb{Z}_{n_k}$ let $N(d)$ be the number of solutions of $dx=0$. By Theorem 7.3(4), $N(d)=\gcd(d,n_1)\cdots\gcd(d,n_k)$.
  2. The number of elements of order exactly $d$ is obtained from the $N$'s by inclusion–exclusion over the prime divisors of $d$: for $d=p^a$ it is $N(p^a)-N(p^{a-1})$; for $d=pq$ it is $N(pq)-N(p)-N(q)+N(1)$; in general $\sum_{e\mid d}\mu(d/e)N(e)$.
  3. The order of $(x_1,\dots,x_k)$ is $\operatorname{lcm}(o(x_1),\dots,o(x_k))$ (Theorem 7.12), so the largest order is $\operatorname{lcm}(n_1,\dots,n_k)$, and $G$ is cyclic iff that lcm equals $|G|$.
  4. For $U(n)$, first split it with Theorem 7.6 into a product of cyclic groups.
✏️ Example 1 — Orders in cyclic groups and their products
(a) In $\mathbb{Z}_{60}$, find the number of elements of order $12$, the number of generators and the number of subgroups, and list the elements of order $12$. (b) Is $\mathbb{Z}_6\times\mathbb{Z}_9$ cyclic? Find its largest element order and the number of elements of order $6$. (c) How many elements of order $4$ does $\mathbb{Z}_4\times\mathbb{Z}_8$ have? (d) Is $\mathbb{Z}_8\times\mathbb{Z}_{15}$ isomorphic to $\mathbb{Z}_{120}$?
(a) By Theorem 7.3 there are $\varphi(12)=4$ elements of order $12$, $\varphi(60)=16$ generators and $\tau(60)=12$ subgroups. The elements of order $12$ generate the unique subgroup of order $12$, which is $\langle 60/12\rangle=\langle5\rangle$; they are $5k$ with $\gcd(k,12)=1$: $5,\ 25,\ 35,\ 55$. Check: $o(25)=60/\gcd(25,60)=60/5=12$ ✓.
(b) Not cyclic The largest order is $\operatorname{lcm}(6,9)=18\lt54$, so $\mathbb{Z}_6\times\mathbb{Z}_9$ is not cyclic. With $N(d)=\gcd(d,6)\gcd(d,9)$: $N(6)=6\cdot3=18$, $N(3)=3\cdot3=9$, $N(2)=2\cdot1=2$, $N(1)=1$. The elements of order exactly $6$ number $$N(6)-N(3)-N(2)+N(1)=8.$$
(c) $N(4)=\gcd(4,4)\gcd(4,8)=16$ and $N(2)=\gcd(2,4)\gcd(2,8)=4$, so there are $N(4)-N(2)=12$ elements of order $4$.
(d) Yes $\gcd(8,15)=1$, so $(1,1)$ has order $\operatorname{lcm}(8,15)=120$ and generates (Theorem 7.12).
✏️ Example 2 — The structure of $U(20)$, $U(27)$ and $U(32)$
(a) Find the orders of all elements of $U(20)$ and identify the group. (b) Show that $U(27)$ is cyclic with generator $2$, and count its generators. (c) Identify $U(32)$ and find its elements of order $2$.
(a) $U(20)=\{1,3,7,9,11,13,17,19\}$, of order $8$. Squares: $9^2=81\equiv1$, $11^2=121\equiv1$, $19^2=361\equiv1$, while $3^2=9$, $7^2=49\equiv9$, $13^2=169\equiv9$, $17^2=289\equiv9$ and $9^2\equiv1$, so $3,7,13,17$ have order $4$. Orders: one of order $1$, three of order $2$, four of order $4$. Theorem 7.6: $U(20)\cong U(4)\times U(5)\cong\mathbb{Z}_2\times\mathbb{Z}_4$ — not cyclic, as $20=4\cdot5$ is not of the form $p^k$, $2p^k$.
(b) $27=3^3$, so $U(27)$ is cyclic of order $\varphi(27)=18$. The order of $2$ divides $18$. Now $2^9=512=18\cdot27+26\equiv-1$, so $o(2)\nmid9$; and $2^6=64\equiv10\ne1$, so $o(2)\nmid6$. The only divisor of $18$ dividing neither $9$ nor $6$ is $18$ itself: $2$ is a generator. There are $\varphi(18)=6$ generators, namely $2^k$ with $\gcd(k,18)=1$.
(c) $U(32)\cong\mathbb{Z}_2\times\mathbb{Z}_8$ (Theorem 7.6(2), $k=5$). The three elements of order $2$ are $31=-1$ and $2^4\pm1=15,\,17$: $15^2=225=7\cdot32+1$ ✓, $17^2=289=9\cdot32+1$ ✓. The largest order is $8$, attained e.g. by $3$ ($3^4=81\equiv17\ne1$, $3^8\equiv17^2\equiv1$).

Normal Subgroups, Quotients, Homomorphisms and Automorphisms

📘 Definition 7.5 — Normal subgroup
A subgroup $N\le G$ is normal, $N\trianglelefteq G$, if $gNg^{-1}=N$ for every $g\in G$; equivalently $gN=Ng$ for every $g$. The commutator subgroup $G'$ is the subgroup generated by all commutators $[x,y]=xyx^{-1}y^{-1}$.
📐 Theorem 7.7 — Recognising normal subgroups
  1. $N\trianglelefteq G$ iff $gng^{-1}\in N$ for all $g\in G$, $n\in N$; it suffices to check $g$ in a generating set of $G$ and $n$ in a generating set of $N$ when $G$ is finite.
  2. Every subgroup of an abelian group is normal; $Z(G)$ and $G'$ are normal in $G$.
  3. Every subgroup of index $2$ is normal. (E.g. $A_n\trianglelefteq S_n$, and the rotations $\langle r\rangle\trianglelefteq D_n$.)
  4. Kernels of homomorphisms are normal (Theorem 7.9). If $H\le G$ is the only subgroup of its order, then $H\trianglelefteq G$.
  5. Normality is not transitive: $K\trianglelefteq H\trianglelefteq G$ does not imply $K\trianglelefteq G$.

Proof. (1) $gNg^{-1}\subseteq N$ for all $g$ gives, applied to $g^{-1}$, $N\subseteq gNg^{-1}$. For a finite $G$, conjugation by a fixed $g$ is a bijection that maps $N$ into $N$ as soon as it maps generators of $N$ into $N$, and the set of $g$ with $gNg^{-1}=N$ is a subgroup. (2) $gzg^{-1}=z$ for $z\in Z(G)$; and $g[x,y]g^{-1}=[gxg^{-1},gyg^{-1}]$. (3) If $[G:H]=2$, the left cosets are $H$ and $G\setminus H$, and so are the right cosets; thus $gH=Hg$ for every $g$. (4) $gHg^{-1}$ is a subgroup of the same order as $H$. (5) In $D_4$: $\langle s\rangle\trianglelefteq\{e,r^2,s,r^2s\}\trianglelefteq D_4$, each of index $2$ in the next, but $rsr^{-1}=r^2s\notin\langle s\rangle$. ∎

📘 Definition 7.6 — Quotient group
If $N\trianglelefteq G$, the cosets of $N$ form a group $G/N$ under $(aN)(bN)=abN$, with identity $N$ and $(aN)^{-1}=a^{-1}N$; $|G/N|=[G:N]$. The order of $aN$ is the least $k\ge1$ with $a^k\in N$, so it divides $o(a)$.

The product is well defined exactly because $N$ is normal: if $aN=a'N$ and $bN=b'N$, then $a'b'=a n_1 b n_2=ab(b^{-1}n_1b)n_2\in abN$.

📐 Theorem 7.8 — If $G/Z(G)$ is cyclic, then $G$ is abelian
Consequently $[G:Z(G)]$ is never a prime, and a nonabelian group has $[G:Z(G)]\ge4$. Also, $G/N$ is abelian if and only if $G'\subseteq N$.

Proof. Let $G/Z=\langle gZ\rangle$, $Z=Z(G)$. Every element of $G$ has the form $g^iz$ with $z\in Z$, and $(g^iz)(g^jw)=g^{i+j}zw=(g^jw)(g^iz)$ because $z,w$ are central. If $[G:Z]$ were prime, $G/Z$ would be cyclic, hence $G$ abelian and $[G:Z]=1$. Finally, $G/N$ is abelian iff $xyN=yxN$ for all $x,y$, iff $x^{-1}y^{-1}xy\in N$ for all $x,y$, iff $G'\subseteq N$. ∎

📘 Definition 7.7 — Homomorphism, kernel, image, isomorphism
A map $\phi:G\to H$ is a homomorphism if $\phi(ab)=\phi(a)\phi(b)$ for all $a,b$. Its kernel is $\ker\phi=\{g:\phi(g)=e_H\}$ and its image is $\phi(G)$. A bijective homomorphism is an isomorphism, $G\cong H$.
📐 Theorem 7.9 — Properties of homomorphisms
Let $\phi:G\to H$ be a homomorphism. Then $\phi(e)=e$, $\phi(a^{-1})=\phi(a)^{-1}$; $o(\phi(a))$ divides $o(a)$; $\ker\phi\trianglelefteq G$; $\phi$ is injective iff $\ker\phi=\{e\}$; images of subgroups are subgroups, and preimages of (normal) subgroups are (normal) subgroups. If $H$ is abelian, $G'\subseteq\ker\phi$. Isomorphic groups have the same number of elements of each order.

Proof. $\phi(e)=\phi(e)^2$ gives $\phi(e)=e$, and then $\phi(a)\phi(a^{-1})=\phi(e)=e$. If $a^n=e$ then $\phi(a)^n=\phi(a^n)=e$. If $\phi(k)=e$ then $\phi(gkg^{-1})=\phi(g)\phi(g)^{-1}=e$. $\phi(a)=\phi(b)\iff ab^{-1}\in\ker\phi$. If $H$ is abelian, $\phi([x,y])=[\phi(x),\phi(y)]=e$. An isomorphism preserves orders in both directions. ∎

📐 Theorem 7.10 — The isomorphism theorems
  1. First. If $\phi:G\to H$ is a homomorphism, $G/\ker\phi\cong\phi(G)$. In particular $|G|=|\ker\phi|\,|\phi(G)|$ for finite $G$, so $|\phi(G)|$ divides both $|G|$ and $|H|$.
  2. Second. If $H\le G$ and $N\trianglelefteq G$, then $HN\le G$, $H\cap N\trianglelefteq H$ and $HN/N\cong H/(H\cap N)$.
  3. Third. If $N\subseteq K$ are normal in $G$, then $K/N\trianglelefteq G/N$ and $(G/N)/(K/N)\cong G/K$.
  4. Correspondence. $K\mapsto K/N$ is a bijection from the subgroups of $G$ containing $N$ to the subgroups of $G/N$, preserving inclusion, index and normality.

Proof of (1). Put $K=\ker\phi$ and define $\bar\phi(gK)=\phi(g)$. It is well defined and injective because $gK=g'K\iff g^{-1}g'\in K\iff\phi(g)=\phi(g')$; it is a homomorphism because $\bar\phi(gK\,g'K)=\phi(gg')=\phi(g)\phi(g')$; and its image is $\phi(G)$. (2)–(4) follow by applying (1) to $h\mapsto hN$ on $H$, to $gN\mapsto gK$ on $G/N$, and to the projection $G\to G/N$; see the 📚 box. ∎

📐 Theorem 7.11 — Homomorphisms out of a cyclic group
  1. A homomorphism $\phi:\mathbb{Z}_m\to H$ is determined by $h=\phi(1)$, and any $h\in H$ with $h^m=e$ (i.e. $o(h)\mid m$) gives one. So the number of homomorphisms $\mathbb{Z}_m\to H$ equals the number of solutions of $h^m=e$ in $H$; homomorphisms $\mathbb{Z}\to H$ correspond to all $h\in H$.
  2. The number of homomorphisms $\mathbb{Z}_m\to\mathbb{Z}_n$ is $\gcd(m,n)$. There is a surjective one iff $n\mid m$, and an injective one iff $m\mid n$.

Proof. (1) $\phi(k)=h^k$ is forced, and it is well defined on residues mod $m$ iff $h^m=e$ (Theorem 7.2(1)); it is then a homomorphism. (2) By (1) and Theorem 7.3(4), the count is the number of $x\in\mathbb{Z}_n$ with $mx=0$, which is $\gcd(m,n)$. The image is the cyclic subgroup $\langle x\rangle$, of order dividing $\gcd(m,n)$; it is all of $\mathbb{Z}_n$ only if $n\mid m$, and the kernel is trivial only if $m$ divides $n$ (conversely $x=1$, resp. $x=n/m$, works). ∎

📘 Definition 7.8 — Direct product
$G\times H=\{(g,h)\}$ with componentwise product. $G$ is the internal direct product of $H,K\le G$ if $H,K\trianglelefteq G$, $H\cap K=\{e\}$ and $HK=G$; then $G\cong H\times K$.
📐 Theorem 7.12 — Orders in direct products; when $\mathbb{Z}_m\times\mathbb{Z}_n$ is cyclic
$o((g,h))=\operatorname{lcm}(o(g),o(h))$. Hence $\mathbb{Z}_m\times\mathbb{Z}_n\cong\mathbb{Z}_{mn}$ if and only if $\gcd(m,n)=1$; more generally $\mathbb{Z}_{n_1}\times\cdots\times\mathbb{Z}_{n_k}$ is cyclic iff the $n_i$ are pairwise coprime.

Proof. $(g,h)^t=(g^t,h^t)=e$ iff $o(g)\mid t$ and $o(h)\mid t$, iff $\operatorname{lcm}\mid t$. The largest order in $\mathbb{Z}_m\times\mathbb{Z}_n$ is $\operatorname{lcm}(m,n)=mn/\gcd(m,n)$, which equals $mn$ iff $\gcd(m,n)=1$. ∎

📘 Definition 7.9 — Automorphisms and inner automorphisms
An automorphism of $G$ is an isomorphism $G\to G$; they form a group $\operatorname{Aut}(G)$ under composition. For $g\in G$, conjugation $c_g(x)=gxg^{-1}$ is an inner automorphism; these form $\operatorname{Inn}(G)$.
📐 Theorem 7.13 — Automorphism groups GATE uses
  1. $\operatorname{Inn}(G)\trianglelefteq\operatorname{Aut}(G)$ and $\operatorname{Inn}(G)\cong G/Z(G)$.
  2. $\operatorname{Aut}(\mathbb{Z}_n)\cong U(n)$, of order $\varphi(n)$; $\operatorname{Aut}(\mathbb{Z})\cong\mathbb{Z}_2$.
  3. $\operatorname{Aut}(\mathbb{Z}_p^{\,k})\cong GL(k,\mathbb{Z}_p)$, of order $(p^k-1)(p^k-p)\cdots(p^k-p^{k-1})$. So $\operatorname{Aut}(V_4)\cong GL(2,\mathbb{Z}_2)\cong S_3$ and $|\operatorname{Aut}(\mathbb{Z}_2^{\,3})|=7\cdot6\cdot4=168$.
  4. For $n\ge3$, $|\operatorname{Aut}(D_n)|=n\varphi(n)$ (the automorphisms are $r\mapsto r^a$, $s\mapsto r^bs$ with $\gcd(a,n)=1$); e.g. $|\operatorname{Aut}(D_4)|=8$. $\operatorname{Aut}(Q_8)\cong S_4$. For $n\ne2,6$, $\operatorname{Aut}(S_n)=\operatorname{Inn}(S_n)\cong S_n$.

Proof. (1) $g\mapsto c_g$ is a homomorphism $G\to\operatorname{Aut}(G)$ ($c_gc_h=c_{gh}$) with image $\operatorname{Inn}(G)$ and kernel $\{g:gx=xg\ \forall x\}=Z(G)$; apply Theorem 7.10(1). Normality: $\alpha c_g\alpha^{-1}=c_{\alpha(g)}$. (2) An automorphism of $\mathbb{Z}_n$ is $x\mapsto ax$ (Theorem 7.11), and it is bijective iff $a$ generates, i.e. $a\in U(n)$; composition multiplies the $a$'s. (3) A homomorphism of $\mathbb{Z}_p^{\,k}$ satisfies $\phi(cx)=c\phi(x)$ for $c\in\mathbb{Z}_p$, so it is $\mathbb{Z}_p$-linear; automorphisms are invertible matrices. Count: the first column is any of the $p^k-1$ nonzero vectors, the second any of the $p^k-p$ vectors outside its span, and so on. (4) An automorphism of $D_n$ must send $r$ to an element of order $n$ in $\langle r\rangle$ (for $n\ge3$ the reflections have order $2$) and $s$ to a reflection (otherwise the image would lie in $\langle r\rangle$), and every such choice respects $srs^{-1}=r^{-1}$. For $Q_8$: $i$ can go to any of the $6$ elements of order $4$ and $j$ to any of the $4$ elements of order $4$ outside $\langle\phi(i)\rangle$, giving $24$ automorphisms. The statement on $S_n$ is proved in the 📚 box. ∎

✏️ Example 3 — Counting homomorphisms
Find the number of group homomorphisms (a) $\mathbb{Z}_{12}\to\mathbb{Z}_{18}$; (b) $\mathbb{Z}_6\to S_3$; (c) $S_3\to\mathbb{Z}_6$. (d) Show that there is no homomorphism from $\mathbb{Z}_8$ onto $\mathbb{Z}_2\times\mathbb{Z}_4$.
(a) $\gcd(12,18)=6$ homomorphisms, with $\phi(1)\in\{0,3,6,9,12,15\}$ (the solutions of $12x\equiv0\pmod{18}$). None is onto ($18\nmid12$) and none is injective ($12\nmid18$).
(b) By Theorem 7.11(1) we count $h\in S_3$ with $h^6=e$. The orders in $S_3$ are $1,2,3$, all dividing $6$: all $6$ elements qualify, so there are $6$ homomorphisms.
(c) $\mathbb{Z}_6$ is abelian, so the kernel contains $S_3'=A_3$ (Theorem 7.9), and $\phi$ factors through $S_3/A_3\cong\mathbb{Z}_2$. Homomorphisms $\mathbb{Z}_2\to\mathbb{Z}_6$: $\gcd(2,6)=2$. So there are $2$: the trivial one and $\sigma\mapsto0$ or $3$ according as $\sigma$ is even or odd.
(d) The image of a cyclic group is cyclic (generated by $\phi(1)$), but $\mathbb{Z}_2\times\mathbb{Z}_4$ is not cyclic ($\gcd(2,4)\ne1$).
✏️ Example 4 — Centres, quotients and automorphisms
(a) Find $Z(D_n)$, and identify $D_4/Z(D_4)$ and $\operatorname{Inn}(D_4)$. (b) Identify $(\mathbb{Z}_4\times\mathbb{Z}_6)/\langle(2,3)\rangle$. (c) Find $|\operatorname{Aut}(\mathbb{Z}_{24})|$ and decide whether $\operatorname{Aut}(\mathbb{Z}_{24})$ is cyclic. (d) Show directly that $\operatorname{Aut}(V_4)\cong S_3$.
(a) A reflection $r^is$ does not commute with $r$ ($r\cdot r^is=r^{i+1}s$ but $r^is\cdot r=r^{i-1}s$, and $r^{i+1}\ne r^{i-1}$ as $n\ge3$), so it is not central. A rotation $r^k$ commutes with $s$ iff $r^k=r^{-k}$, iff $n\mid2k$. So $Z(D_n)=\{e\}$ for odd $n$ and $Z(D_n)=\{e,r^{n/2}\}$ for even $n$. For $n=4$, $D_4/Z(D_4)$ has order $4$, and it is not cyclic (Theorem 7.8), so it is $V_4$; hence $\operatorname{Inn}(D_4)\cong V_4$.
(b) The quotient has order $24/2=12$. The coset of $(1,1)$ has order the least $k$ with $(k,k)\in\{(0,0),(2,3)\}$; $(k,k)=(2,3)$ would need $k\equiv2\pmod4$ and $k\equiv3\pmod6$, impossible (parity). So its order is $\operatorname{lcm}(4,6)=12$ and the quotient is $\mathbb{Z}_{12}$.
(c) $|\operatorname{Aut}(\mathbb{Z}_{24})|=\varphi(24)=8$, and $\operatorname{Aut}(\mathbb{Z}_{24})\cong U(24)$, where $U(24)=\{1,5,7,11,$ $13,17,19,23\}$. Every element squares to $1$ (e.g. $5^2=25$, $7^2=49$, $11^2=121$, all $\equiv1$), so it is $\mathbb{Z}_2^{\,3}$ — not cyclic, consistent with Theorem 7.6(3).
(d) $V_4=\{e,a,b,c\}$ with the product of any two distinct non-identity elements equal to the third. An automorphism fixes $e$ and permutes $\{a,b,c\}$; conversely every permutation of $\{a,b,c\}$ preserves the rule "product of two distinct = the third", so it is an automorphism. Thus $\operatorname{Aut}(V_4)\cong S_3$, of order $6$.

Permutations, Group Actions and the Class Equation

📘 Definition 7.10 — Cycles, parity and the alternating group
A $k$-cycle $(a_1\,a_2\,\dots\,a_k)$ sends $a_1\mapsto a_2\mapsto\cdots\mapsto a_k\mapsto a_1$ and fixes all other points. A permutation is even or odd according as it is a product of an even or an odd number of transpositions; $\operatorname{sgn}:S_n\to\{\pm1\}$ is a homomorphism, and its kernel is the alternating group $A_n$, of index $2$. The cycle type of $\sigma$ is the list of lengths of its disjoint cycles, a partition of $n$.
📐 Theorem 7.14 — Cycle decomposition, order, parity and counts
  1. Every permutation is a product of disjoint cycles, unique up to order; disjoint cycles commute.
  2. The order of $\sigma$ is the lcm of its cycle lengths.
  3. A $k$-cycle is a product of $k-1$ transpositions, so it is even iff $k$ is odd; $\sigma$ is even iff it has an even number of cycles of even length.
  4. The number of permutations of cycle type $1^{a_1}2^{a_2}\cdots n^{a_n}$ ($a_k$ cycles of length $k$) is $$\frac{n!}{\prod_k k^{a_k}\,a_k!}.$$

Proof. (1) Follow $i\mapsto\sigma(i)\mapsto\sigma^2(i)\mapsto\cdots$ until it returns; the orbits of $\langle\sigma\rangle$ give the cycles. (2) Disjoint cycles commute, so $\sigma^t=e$ iff each cycle to the power $t$ is $e$, and a $k$-cycle has order $k$. (3) $(a_1\,\dots\,a_k)=(a_1\,a_k)(a_1\,a_{k-1})\cdots(a_1\,a_2)$, right to left; that the parity is well defined is proved in the 📚 box. (4) Write the $n$ symbols in the $n!$ orders into a template of the given type; each permutation arises $\prod_kk^{a_k}a_k!$ times (each $k$-cycle can start at any of its $k$ entries, and the $a_k$ cycles of length $k$ can be listed in any order). ∎

📐 Theorem 7.15 — Conjugacy in $S_n$
$\tau(a_1\,\dots\,a_k)\tau^{-1}=(\tau(a_1)\,\dots\,\tau(a_k))$. Hence two permutations are conjugate in $S_n$ iff they have the same cycle type; $S_n$ has $p(n)$ conjugacy classes ($p$ = partition function: $p(3),\dots,p(7)=3,5,7,11,15$), and the class of type $1^{a_1}2^{a_2}\cdots$ has the size given in Theorem 7.14(4), with centraliser of order $\prod_kk^{a_k}a_k!$.

Proof. $\tau\sigma\tau^{-1}$ sends $\tau(a_i)\mapsto\tau(a_{i+1})$, so conjugation relabels the cycles. Conversely, two permutations of the same type are conjugate by the $\tau$ that matches their cycles entry by entry. The class size is $|S_n|/|C(\sigma)|$ by Theorem 7.16 below. ∎

📘 Definition 7.11 — Group action, orbit, stabiliser
An action of $G$ on a set $X$ is a map $G\times X\to X$, $(g,x)\mapsto g\cdot x$, with $e\cdot x=x$ and $g\cdot(h\cdot x)=(gh)\cdot x$. The orbit of $x$ is $Gx=\{g\cdot x:g\in G\}$, the stabiliser is $G_x=\{g:g\cdot x=x\}\le G$, and $\operatorname{Fix}(g)=\{x:g\cdot x=x\}$. Equivalently an action is a homomorphism $G\to\operatorname{Sym}(X)$; its kernel $\bigcap_xG_x$ consists of the elements acting trivially.
📐 Theorem 7.16 — Orbit–stabiliser theorem
The orbits partition $X$, and for finite $G$ $$|Gx|=[G:G_x]=\frac{|G|}{|G_x|}.$$ In particular orbit sizes divide $|G|$, and points in the same orbit have conjugate stabilisers: $G_{g\cdot x}=gG_xg^{-1}$.

Proof. "Being in the same orbit" is an equivalence relation ($y=g\cdot x\Rightarrow x=g^{-1}\cdot y$), so orbits partition $X$. The map $gG_x\mapsto g\cdot x$ from left cosets of $G_x$ to $Gx$ is well defined and injective because $g\cdot x=h\cdot x$ $\iff$ $h^{-1}g\in G_x$ $\iff$ $gG_x=hG_x$, and it is onto by definition of the orbit. Finally $h\cdot(g\cdot x)=g\cdot x\iff g^{-1}hg\in G_x$. ∎

📐 Theorem 7.17 — Cayley's theorem; the coset action; Burnside's lemma
  1. (Cayley) Every group $G$ is isomorphic to a subgroup of $\operatorname{Sym}(G)$; a group of order $n$ embeds in $S_n$.
  2. If $H\le G$ has index $n$, the action of $G$ on the left cosets of $H$ gives a homomorphism $G\to S_n$ whose kernel is contained in $H$. Hence, if $|G|$ does not divide $n!$, then $H$ contains a nontrivial normal subgroup of $G$. The smallest-prime case: a subgroup whose index is the smallest prime dividing $|G|$ is normal.
  3. (Burnside) If a finite $G$ acts on a finite $X$, the number of orbits is $\dfrac{1}{|G|}\sum_{g\in G}|\operatorname{Fix}(g)|$.

Proof. (1) $G$ acts on itself by left multiplication, and only $e$ acts trivially. (2) $g$ acts trivially on the cosets only if $gH=H$, i.e. $g\in H$. If $|G|\nmid n!$ the kernel $K$ is not $\{e\}$ (else $G$ would embed in $S_n$). For the last claim see the 📚 box. (3) Count the pairs $(g,x)$ with $g\cdot x=x$ in two ways: $\sum_g|\operatorname{Fix}(g)|=\sum_x|G_x|=\sum_x|G|/|Gx|$, and each orbit $O$ contributes $|O|\cdot|G|/|O|=|G|$ to the last sum. ∎

📘 Definition 7.12 — Conjugacy classes; $p$-groups
$G$ acts on itself by conjugation, $g\cdot x=gxg^{-1}$. The orbits are the conjugacy classes $\operatorname{cl}(x)=\{gxg^{-1}\}$, and the stabiliser of $x$ is its centraliser $C(x)$. A class has size $1$ iff $x\in Z(G)$. For a prime $p$, a $p$-group is a group of order $p^k$, $k\ge0$.
📐 Theorem 7.18 — The class equation
For a finite group $G$, with $x_1,\dots,x_r$ representatives of the conjugacy classes of size greater than $1$, $$|G|=|Z(G)|+\sum_{i=1}^r[G:C(x_i)],$$ and every term $[G:C(x_i)]$ is a divisor of $|G|$ greater than $1$. The number of classes of $G$ equals $|G|$ iff $G$ is abelian.

Proof. The classes partition $G$; the classes of size $1$ make up $Z(G)$, and $|\operatorname{cl}(x)|=[G:C(x)]$ by Theorem 7.16. ∎

📐 Theorem 7.19 — $p$-groups
Let $|G|=p^k$, $k\ge1$. Then:
  1. $Z(G)\ne\{e\}$; more generally, if $G$ acts on a finite set $X$, then $|X|\equiv|\operatorname{Fix}(G)|\pmod p$, where $\operatorname{Fix}(G)$ is the set of points fixed by all of $G$.
  2. Every group of order $p^2$ is abelian: $\mathbb{Z}_{p^2}$ or $\mathbb{Z}_p\times\mathbb{Z}_p$.
  3. If $G$ is nonabelian of order $p^3$, then $|Z(G)|=p$, $G/Z(G)\cong\mathbb{Z}_p\times\mathbb{Z}_p$, every noncentral class has size $p$, and $G$ has $p^2+p-1$ conjugacy classes.
  4. $G$ has a normal subgroup of every order $p^j$, $0\le j\le k$.

Proof. (1) Orbits not consisting of a fixed point have size $[G:G_x]$, a power of $p$ greater than $1$; so $|X|-|\operatorname{Fix}(G)|$ is divisible by $p$. For conjugation, $\operatorname{Fix}(G)=Z(G)$, and $|Z(G)|\equiv p^k\equiv0$, so $|Z(G)|\ge p$. (2) $|Z(G)|\in\{p,p^2\}$; if it were $p$, then $G/Z(G)$ would have prime order, hence be cyclic, contradicting Theorem 7.8. So $G=Z(G)$ is abelian; it is $\mathbb{Z}_{p^2}$ if it has an element of order $p^2$, and otherwise every non-identity element has order $p$ and $G\cong\mathbb{Z}_p\times\mathbb{Z}_p$. (3) $|Z(G)|\in\{p,p^2\}$, and $p^2$ is excluded as in (2), so $|Z|=p$ and $G/Z$ has order $p^2$, not cyclic. For $x\notin Z$, $C(x)$ contains $Z$ and $x$, so $|C(x)|\ge p^2$, and $C(x)\ne G$; thus $|C(x)|=p^2$ and the class has $p$ elements. The number of classes is $p+(p^3-p)/p=p^2+p-1$. (4) Induction using a central subgroup of order $p$ (it exists by (1) and Cauchy) and the correspondence theorem. ∎

✏️ Example 5 — Permutations and class equations
(a) Write $\sigma=(1\,3\,5)(2\,4)(1\,2)\in S_5$ as a product of disjoint cycles and find its order and sign. (b) In $S_5$, count the elements of orders $2$, $4$ and $6$, and find the largest order. (c) Find the class equation of $D_4$. (d) Prove or disprove: some group has class equation $10=1+1+3+5$.
(a) Right to left: $1\xrightarrow{(12)}2\xrightarrow{(24)}4\xrightarrow{(135)}4$; $4\mapsto4\mapsto2\mapsto2$; $2\mapsto1\mapsto1\mapsto3$; $3\mapsto3\mapsto3\mapsto5$; $5\mapsto5\mapsto5\mapsto1$. So $\sigma=(1\,4\,2\,3\,5)$, a $5$-cycle: order $5$, even (also: sign $=(+1)(-1)(-1)=+1$).
(b) Order $2$: types $2\,1^3$ and $2^2\,1$: $\tfrac{120}{2\cdot3!}+\tfrac{120}{2^2\cdot2!}=10+15=25$. Order $4$: $4$-cycles, $\tfrac{120}{4}=30$. Order $6$: type $3\,2$ (lcm $6$), $\tfrac{120}{3\cdot2}=20$. The seven partitions $5$, $4{+}1$, $3{+}2$, $3{+}1{+}1$, $2{+}2{+}1$, $2{+}1{+}1{+}1$, $1^5$ have lcm's $5,4,6,3,2,2,1$, so the largest order is $6$.
(c) $Z(D_4)=\{e,r^2\}$ (Example 4). $r$ is conjugate to $srs^{-1}=r^{-1}=r^3$, so $\{r,r^3\}$ is a class. $rsr^{-1}=r^2s$, so $\{s,r^2s\}$ is a class, and similarly $\{rs,r^3s\}$. Class equation: $8=1+1+2+2+2$ (five classes).
(d) False Every class size divides $|G|=10$ (Theorem 7.18), and $3\nmid10$.

Cauchy, Sylow and Finite Abelian Groups

📐 Theorem 7.20 — Cauchy's theorem
If a prime $p$ divides $|G|$, then $G$ has an element of order $p$. Consequently a finite group is a $p$-group iff every element has $p$-power order.

Proof. Let $X=\{(g_1,\dots,g_p)\in G^p:g_1g_2\cdots g_p=e\}$. The first $p-1$ entries can be chosen freely and determine $g_p$, so $|X|=|G|^{p-1}\equiv0\pmod p$. The group $\mathbb{Z}_p$ acts on $X$ by cyclically rotating the entries (if $g_1\cdots g_p=e$ then $g_2\cdots g_pg_1=g_1^{-1}eg_1=e$). By Theorem 7.19(1), the number of fixed points is $\equiv|X|\equiv0\pmod p$. The fixed points are the constant tuples $(g,\dots,g)$ with $g^p=e$; $(e,\dots,e)$ is one, so there are at least $p\ge2$, and any $g\ne e$ among them has order $p$. ∎

📘 Definition 7.13 — Sylow subgroups and normalisers
Let $|G|=p^am$ with $p\nmid m$. A subgroup of order $p^a$ is a Sylow $p$-subgroup; $\operatorname{Syl}_p(G)$ is the set of them and $n_p=|\operatorname{Syl}_p(G)|$. The normaliser of $H\le G$ is $N_G(H)=\{g:gHg^{-1}=H\}$, the largest subgroup of $G$ in which $H$ is normal.
📐 Theorem 7.21 — The Sylow theorems
Let $|G|=p^am$ with $p$ prime and $p\nmid m$.
  1. (Existence) $G$ has a subgroup of order $p^j$ for every $0\le j\le a$; in particular Sylow $p$-subgroups exist. Every $p$-subgroup of $G$ is contained in a Sylow $p$-subgroup.
  2. (Conjugacy) Any two Sylow $p$-subgroups are conjugate.
  3. (Counting) $n_p=[G:N_G(P)]$ for any $P\in\operatorname{Syl}_p(G)$, so $n_p\mid m$; and $n_p\equiv1\pmod p$.

Proof (sketch; the full proof is in the 📚 box). Existence, by induction on $|G|$. If $p$ divides $|Z(G)|$, take an element $z$ of order $p$ in $Z(G)$ (Cauchy); $\langle z\rangle$ is normal, $G/\langle z\rangle$ has order $p^{a-1}m$ and by induction a subgroup of order $p^{a-1}$, whose preimage has order $p^a$. If $p\nmid|Z(G)|$, the class equation shows that some noncentral class has size $[G:C(x)]$ prime to $p$; then $p^a$ divides $|C(x)|\lt|G|$ and induction applies to $C(x)$. Conjugacy and containment: let $Q$ be a $p$-subgroup and $P$ Sylow; $Q$ acts on the $m$ left cosets of $P$ by left multiplication, and since $p\nmid m$, Theorem 7.19(1) gives a fixed coset $gP$: $QgP=gP$, so $Q\subseteq gPg^{-1}$. Counting: $G$ acts transitively on $\operatorname{Syl}_p(G)$ by conjugation with stabiliser $N_G(P)\supseteq P$, so $n_p=[G:N_G(P)]$ divides $[G:P]=m$. Now let $P$ act on $\operatorname{Syl}_p(G)$ by conjugation. If $P$ fixes $Q$, then $P\le N_G(Q)$, and $P,Q$ are Sylow subgroups of $N_G(Q)$, conjugate in it; but $Q\trianglelefteq N_G(Q)$, so $P=Q$. Thus $P$ is the only fixed point and $n_p\equiv1\pmod p$ by Theorem 7.19(1). ∎

📐 Theorem 7.22 — Using the Sylow theorems
  1. $n_p=1$ if and only if the Sylow $p$-subgroup is normal. In an abelian group every $n_p=1$.
  2. If $|P|=p$ (i.e. $a=1$), distinct Sylow $p$-subgroups meet trivially, so $G$ has exactly $n_p(p-1)$ elements of order $p$. If $a\ge2$ and $n_p\ge2$, the union of two Sylow $p$-subgroups already contains at least $2p^a-p^{a-1}$ elements.
  3. If $n_p=k\gt1$, conjugation on $\operatorname{Syl}_p(G)$ is a nontrivial homomorphism $G\to S_k$. So if $|G|\nmid k!$, $G$ has a proper nontrivial normal subgroup; and if $G$ is simple (Definition 7.14) of composite order, it embeds in $A_k$, so $|G|$ divides $k!/2$.
  4. If $G=P_1P_2\cdots P_r$ where the $P_i$ are normal Sylow subgroups for the distinct primes, then $G\cong P_1\times\cdots\times P_r$; a finite abelian group is the direct product of its Sylow subgroups.

Proof. (1) By conjugacy, $\operatorname{Syl}_p(G)=\{gPg^{-1}\}$, which is $\{P\}$ iff $P\trianglelefteq G$. (2) Two distinct subgroups of prime order intersect in a subgroup of order dividing $p$ and different from $p$, i.e. trivially; each contributes its $p-1$ elements of order $p$, and every element of order $p$ generates a Sylow $p$-subgroup. For $a\ge2$: $|P\cup Q|=2p^a-|P\cap Q|$ and $|P\cap Q|\le p^{a-1}$. (3) The action is transitive on $k\gt1$ points, so it is not trivial; its kernel is a normal subgroup, proper because the action is nontrivial and nontrivial if $|G|\gt|$image$|$, which holds when $|G|\nmid k!$. If $G$ is simple the kernel is trivial; the image meets $A_k$ in a subgroup of index $\le2$, which is normal, so (as $G$ has no subgroup of index $2$ — it would be normal) the image lies in $A_k$. (4) Normal subgroups of coprime orders commute elementwise and intersect trivially; apply Definition 7.8 repeatedly. ∎

📘 Definition 7.14 — Simple group
A group $G\ne\{e\}$ is simple if its only normal subgroups are $\{e\}$ and $G$. The abelian simple groups are the $\mathbb{Z}_p$, $p$ prime; $A_n$ is simple for $n\ge5$, and $A_5$ (order $60$) is the smallest nonabelian simple group, the next being of order $168$.
📐 Theorem 7.23 — Groups of order $pq$ and $2p$
Let $p\lt q$ be primes and $|G|=pq$. Then the Sylow $q$-subgroup is normal. If moreover $p\nmid q-1$, then $G$ is cyclic. If $p\mid q-1$ there are exactly two groups of order $pq$: $\mathbb{Z}_{pq}$ and a nonabelian one. In particular every group of order $2p$ ($p$ an odd prime) is $\mathbb{Z}_{2p}$ or $D_p$.

Proof. $n_q\mid p$ and $n_q\equiv1\pmod q$; since $p\lt q$, $n_q=1$. Also $n_p\mid q$, so $n_p\in\{1,q\}$, and $n_p=q$ requires $q\equiv1\pmod p$. If $p\nmid q-1$, both Sylow subgroups are normal, so $G\cong\mathbb{Z}_p\times\mathbb{Z}_q\cong\mathbb{Z}_{pq}$ (Theorems 7.22(4), 7.12). The count when $p\mid q-1$ uses semidirect products (📚 box). ∎

📐 Theorem 7.24 — Fundamental theorem of finite abelian groups
Every finite abelian group is isomorphic to a product of cyclic groups of prime-power order (its elementary divisors), uniquely up to order; equivalently, to $\mathbb{Z}_{d_1}\times\cdots\times\mathbb{Z}_{d_s}$ with $d_1\mid d_2\mid\cdots\mid d_s$ (its invariant factors), uniquely. Hence, if $n=p_1^{a_1}\cdots p_r^{a_r}$, the number of abelian groups of order $n$ up to isomorphism is $$p(a_1)\,p(a_2)\cdots p(a_r),$$ where $p(a)$ is the number of partitions of $a$ ($p(1),\dots,p(6)=1,2,3,5,7,11$). Moreover, a finite abelian group has a subgroup of every order dividing $|G|$.

Proof (sketch). By Theorem 7.22(4), $G$ is the product of its Sylow subgroups, so it suffices to treat an abelian $p$-group; one shows it splits off a cyclic subgroup generated by an element of maximal order and inducts. Uniqueness: the numbers $|\{x:p^jx=0\}|$ determine the partition of exponents. A partition of $a_i$ is exactly a choice of cyclic factors $\mathbb{Z}_{p_i^{b_1}}\times\cdots$ with $b_1+b_2+\cdots=a_i$. Full proof in the 📚 box. ∎

🧭 Is there a simple group of order $n$? (and other Sylow questions)
  1. Factor $n=p_1^{a_1}\cdots p_r^{a_r}$ and list, for each $p$, the divisors of $n/p^a$ that are $\equiv1\pmod p$. If for some $p$ only $1$ is possible, the Sylow $p$-subgroup is normal: not simple (orders $20,\,40,\,63,\,p^kq$ with $p^k\lt q$…).
  2. Embedding test: for a simple $G$, each $n_p$ must satisfy $|G|\mid n_p!/2$. Discard the values that fail (orders $36$, $48$, $72$, $80$…).
  3. Element counting: if every $n_p$ is at least its smallest surviving value, count elements of $p$-power order using Theorem 7.22(2); if the total exceeds $|G|$, some $n_p=1$ (orders $12$, $30$, $56$, $105$, $132$…).
  4. If all three tests pass (orders $60$, $120$, $168$), Sylow counting does not decide; $60$ and $168$ do have simple groups, $120$ does not.
  5. To show $G$ is cyclic or abelian: find all $n_p=1$, then $G\cong\prod P_i$ (Theorem 7.22(4)), and use that groups of order $p$ and $p^2$ are abelian.
✏️ Example 6 — Sylow counting at work
(a) Show that every group of order $12$ has a normal Sylow $2$- or Sylow $3$-subgroup. (b) Show that a group of order $30$ has a normal cyclic subgroup of order $15$, and deduce $n_3=n_5=1$. (c) Show that no group of order $56$ is simple. (d) Check the Sylow theorems against $S_4$.
(a) $12=2^2\cdot3$: $n_3\mid4$, $n_3\equiv1\pmod3$, so $n_3\in\{1,4\}$; $n_2\mid3$, $n_2\in\{1,3\}$. If $n_3=4$, there are $4\cdot2=8$ elements of order $3$, leaving $12-8=4$ elements; a Sylow $2$-subgroup has $4$ elements, none of order $3$, so it consists of exactly these $4$, and it is unique: $n_2=1$. ($A_4$ has $n_3=4$, $n_2=1$; $D_6$ has $n_3=1$, $n_2=3$.)
(b) $n_3\in\{1,10\}$, $n_5\in\{1,6\}$. If $n_3=10$ and $n_5=6$, there would be $20+24=44\gt30$ elements of orders $3$ and $5$. So $P_3$ or $P_5$ is normal, and then $H=P_3P_5$ is a subgroup (Theorem 7.5) of order $15$, cyclic by Theorem 7.23 ($3\nmid4$), of index $2$, hence normal. Every Sylow $5$-subgroup $Q$ has odd order, so its image in $G/H\cong\mathbb{Z}_2$ is trivial: $Q\subseteq H$. As the cyclic $H$ has only one subgroup of order $5$, $n_5=1$; likewise $n_3=1$.
(c) $56=2^3\cdot7$: $n_7\in\{1,8\}$. If $n_7=8$ there are $8\cdot6=48$ elements of order $7$, leaving $8$ elements, which must form the unique Sylow $2$-subgroup. Either way some Sylow subgroup is normal and proper.
(d) $|S_4|=24=2^3\cdot3$. Sylow $3$-subgroups are generated by $3$-cycles: $8/2=4$ of them, and $4\equiv1\pmod3$, $4\mid8$ ✓. Sylow $2$-subgroups have order $8$: they are the three copies of $D_4$ (each the symmetry group of a square labelled $1,2,3,4$ in one of the $3$ cyclic orders), so $n_2=3\equiv1\pmod2$ and $3\mid3$ ✓. Since $n_2,n_3\gt1$, neither is normal; yet $S_4$ is not simple ($A_4$ and $V_4$ are normal).
✏️ Example 7 — Orders $pq$ and abelian groups
(a) Show that every group of order $35$ is cyclic, and explain why the same argument fails for order $21$. (b) List the abelian groups of order $360$ by elementary divisors and by invariant factors. (c) How many abelian groups of order $16$ have an element of order $8$?
(a) $35=5\cdot7$ and $5\nmid7-1=6$: Theorem 7.23 gives $G\cong\mathbb{Z}_{35}$. Directly: $n_7\mid5$ and $n_7\equiv1\ (7)$ give $n_7=1$; $n_5\mid7$, $n_5\equiv1\ (5)$ give $n_5=1$. For $21=3\cdot7$, $3\mid6$ and $n_7=1$ but $n_3\in\{1,7\}$: indeed there is a nonabelian group of order $21$ with $n_3=7$.
(b) $360=2^3\cdot3^2\cdot5$: $p(3)p(2)p(1)=3\cdot2\cdot1=6$ groups. Elementary divisors and invariant factors:
2-part3-partinvariant factors
$\mathbb{Z}_8$$\mathbb{Z}_9$$\mathbb{Z}_{360}$
$\mathbb{Z}_8$$\mathbb{Z}_3^{\,2}$$\mathbb{Z}_3\times\mathbb{Z}_{120}$
$\mathbb{Z}_4\times\mathbb{Z}_2$$\mathbb{Z}_9$$\mathbb{Z}_2\times\mathbb{Z}_{180}$
$\mathbb{Z}_4\times\mathbb{Z}_2$$\mathbb{Z}_3^{\,2}$$\mathbb{Z}_6\times\mathbb{Z}_{60}$
$\mathbb{Z}_2^{\,3}$$\mathbb{Z}_9$$\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_{90}$
$\mathbb{Z}_2^{\,3}$$\mathbb{Z}_3^{\,2}$$\mathbb{Z}_2\times\mathbb{Z}_6\times\mathbb{Z}_{30}$
(each row with the factor $\mathbb{Z}_5$; the invariant factors are built by multiplying the largest prime-power from each column, then the next largest, and so on).
(c) The $p(4)=5$ abelian groups of order $16$ correspond to $4,\ 3{+}1,\ 2{+}2,\ 2{+}1{+}1,\ 1{+}1{+}1{+}1$. An element of order $8$ needs a cyclic factor of order at least $8$: $\mathbb{Z}_{16}$ and $\mathbb{Z}_8\times\mathbb{Z}_2$. Answer: $2$.
🧭 Groups of small order — the table to know
ordergroups (up to isomorphism)number
$p$ prime$\mathbb{Z}_p$1
$p^2$$\mathbb{Z}_{p^2}$, $\mathbb{Z}_p\times\mathbb{Z}_p$2
$2p$, $p$ odd$\mathbb{Z}_{2p}$, $D_p$2
8$\mathbb{Z}_8$, $\mathbb{Z}_4\times\mathbb{Z}_2$, $\mathbb{Z}_2^{\,3}$, $D_4$, $Q_8$5
12$\mathbb{Z}_{12}$, $\mathbb{Z}_2\times\mathbb{Z}_6$, $A_4$, $D_6$, $\mathbb{Z}_3\rtimes\mathbb{Z}_4$5
15, 33, 35, …cyclic only ($pq$ with $p\nmid q-1$)1
165 abelian and 9 nonabelian14

Telling groups of order $8$ apart: elements of order $2$ — $\mathbb{Z}_8$: $1$; $\mathbb{Z}_4\times\mathbb{Z}_2$: $3$; $\mathbb{Z}_2^{\,3}$: $7$; $D_4$: $5$; $Q_8$: $1$ (and $Q_8$ is nonabelian with six elements of order $4$). In $D_n$ the elements of order $2$ number $n$ for odd $n$ and $n+1$ for even $n$.

⚠️ Counterexamples and pitfalls
  1. The converse of Lagrange's theorem is false. $A_4$ has order $12$ but no subgroup of order $6$: such an $H$ would have index $2$, so $g^2\in H$ for every $g$ (as $A_4/H\cong\mathbb{Z}_2$); every $3$-cycle $c$ equals $(c^2)^2$, so all eight $3$-cycles would lie in $H$, which has only six elements. It is true for abelian groups and for prime-power divisors (Sylow).
  2. Cauchy is only for primes. $4\mid|V_4|$ but $V_4$ has no element of order $4$; $S_3$ has no element of order $6$.
  3. All subgroups normal does not mean abelian: every subgroup of $Q_8$ is normal. Normality is not transitive: $\langle s\rangle\trianglelefteq\langle r^2,s\rangle\trianglelefteq D_4$ but $\langle s\rangle\not\trianglelefteq D_4$.
  4. $o(ab)$ is not determined by $o(a)$ and $o(b)$. In $S_3$, $(1\,2)(2\,3)=(1\,2\,3)$: two elements of order $2$ with product of order $3$. Theorem 7.2(4) needs both commuting and coprime orders: $a=b$ of order $2$ commute, but $ab=e$.
  5. $\mathbb{Z}_m\times\mathbb{Z}_n$ is cyclic only when $\gcd(m,n)=1$ — $\mathbb{Z}_2\times\mathbb{Z}_2$ is not $\mathbb{Z}_4$. And $U(n)$ is usually not $\mathbb{Z}_{\varphi(n)}$: $U(8)\cong V_4$.
  6. The same quotient does not mean the same subgroup, and isomorphic subgroups can have different quotients. In $\mathbb{Z}_4\times\mathbb{Z}_2$, $H=\langle(2,0)\rangle\cong K=\langle(0,1)\rangle\cong\mathbb{Z}_2$, but the quotient by $H$ is $V_4$ while the quotient by $K$ is $\mathbb{Z}_4$.
  7. $N$ and $G/N$ abelian does not make $G$ abelian: $A_3\trianglelefteq S_3$. $[G:Z(G)]$ is never prime (Theorem 7.8).
  8. Counting elements of each order does not determine a group. $\mathbb{Z}_4\times\mathbb{Z}_4$ and $\mathbb{Z}_2\times Q_8$ both have $1$, $3$ and $12$ elements of orders $1$, $2$, $4$, but one is abelian and the other is not.
  9. Sylow's conditions are necessary, not sufficient. For $|G|=66$ they allow $n_3=22$, yet every group of order $66$ has $n_3=1$: the normal Sylow $11$-subgroup and a Sylow $3$-subgroup generate a cyclic subgroup of order $33$ and index $2$ that contains every element of order $3$.
  10. "Not decided by Sylow counting" is not "simple". Orders $60$ and $168$ have simple groups, $120$ does not ($S_5$, $SL(2,\mathbb{Z}_5)$ and the other groups of order $120$ all have proper normal subgroups).
  11. Conventions change products. Right to left $(1\,2)(1\,3)=(1\,3\,2)$; left to right the same symbols give $(1\,2\,3)$. Check which convention a question uses.
📚 Go deeper — full proofs in the CSIR NET course

Two Labs

Interactive 1 — Powers of an Element and the Order Profile

Left: every element of the chosen group as a dot, coloured by its order. Press Play (or move the slider) to pick an element $g$ and watch its powers $g,g^2,g^3,\dots$ walk round until they return to $e$ — the dots visited form the cyclic subgroup $\langle g\rangle$, and the number of steps is $o(g)$, always a divisor of $|G|$. Right: the order profile — how many elements have each order $d$, with the amber tick showing $\varphi(d)$, the count in a cyclic group of the same order. The group is cyclic exactly when the bar at $d=|G|$ is nonempty.

|G|—
g—
o(g)—
cyclic?—
Interactive 2 — The Sylow Sieve: Can a Group of Order n Be Simple?

For each prime $p$ dividing $n$, the dots are the divisors of $n/p^a$. Green: allowed values of $n_p$ for a simple group ($\equiv1\pmod p$ and $n\mid n_p!/2$). Amber: $\equiv1\pmod p$ but killed by the embedding test. Blue: $n_p=1$ (a normal Sylow subgroup). Grey: not $\equiv1\pmod p$. The bar below adds up the elements of $p$-power order forced by the smallest green values; if it overflows $n$, no simple group exists. Press Play to run through the orders.

n—
forced elements—
normal Sylow?—
verdict—

Exercises

I
Orders, cyclic groups, $U(n)$ and Lagrange.
  • 1 How many elements of order $10$ does $\mathbb{Z}_{100}$ have? How many subgroups does it have?
  • 2 Find the order of $(4,6)$ in $\mathbb{Z}_{12}\times\mathbb{Z}_{15}$.
  • 3 How many elements of order $5$ are there in $\mathbb{Z}_{25}\times\mathbb{Z}_5$? Is the group cyclic?
  • 4 Show that $U(18)$ is cyclic and find a generator.
  • 5 Show that $U(15)$ is not cyclic, and identify it as a product of cyclic groups.
  • 6 Prove that a group in which every non-identity element has order $2$ is abelian.
  • 7 Prove that $o(ab)=o(ba)$ in every group, and give an example where $o(ab)\ne\operatorname{lcm}(o(a),o(b))$.
  • 8 $H,K$ are subgroups of a group of order $120$ with $|H|=12$ and $|K|=20$. Find the possible orders of $H\cap K$.
  • 9 Give an example of an infinite group in which every element has finite order, and of an infinite group in which every non-identity element has infinite order.
1 $\varphi(10)=4$ elements of order $10$ (namely $10k$, $\gcd(k,10)=1$); $\tau(100)=9$ subgroups.
2 $o(4)=12/\gcd(4,12)=3$ in $\mathbb{Z}_{12}$ and $o(6)=15/\gcd(6,15)=5$ in $\mathbb{Z}_{15}$, so the order is $\operatorname{lcm}(3,5)=15$.
3 $N(5)=\gcd(5,25)\gcd(5,5)=25$, so $N(5)-N(1)=24$. Not cyclic: $\gcd(25,5)\ne1$ (largest order $25\lt125$).
4 $18=2\cdot3^2$ is of the form $2p^k$, so $U(18)$ is cyclic of order $6$. $5^2=25\equiv7$, $5^3\equiv35\equiv17=-1$, so $o(5)=6$: $5$ generates.
5 $U(15)=\{1,2,4,7,8,11,13,14\}$; $4^2=16\equiv1$, $11^2=121\equiv1$, $14^2=196\equiv1$: three elements of order $2$, impossible in a cyclic group. $U(15)\cong U(3)\times U(5)\cong\mathbb{Z}_2\times\mathbb{Z}_4$.
6 $x^2=e$ means $x=x^{-1}$ for every $x$. So $ab=(ab)^{-1}=b^{-1}a^{-1}=ba$.
7 $ba=a^{-1}(ab)a$ is conjugate to $ab$, and conjugation preserves order (Theorem 7.2(3)). Example: $a=(1\,2)$, $b=(2\,3)$ in $S_3$, where $ab=(1\,2\,3)$ has order $3\ne\operatorname{lcm}(2,2)=2$.
8 $|H\cap K|$ divides $\gcd(12,20)=4$, and $|HK|=240/|H\cap K|\le120$ forces $|H\cap K|\ge2$. So $|H\cap K|\in\{2,4\}$.
9 $\mathbb{Q}/\mathbb{Z}$: the coset of $a/b$ has order dividing $b$. (Also the group of all roots of unity in $\mathbb{C}^*$.) $(\mathbb{Z},+)$ has every non-identity element of infinite order.
II
Normal subgroups, quotients, homomorphisms and automorphisms.
  • 1 How many homomorphisms $\mathbb{Z}_{20}\to\mathbb{Z}_{30}$ are there? How many are injective?
  • 2 How many homomorphisms $\mathbb{Z}_4\to\mathbb{Z}_2\times\mathbb{Z}_2$ are there? How many are onto?
  • 3 How many homomorphisms $S_3\to\mathbb{Z}_3$ are there?
  • 4 Show that $\{e,(1\,2)\}$ is not normal in $S_3$, but $A_3$ is.
  • 5 Find $|\operatorname{Aut}(\mathbb{Z}_{15})|$. Is $\operatorname{Aut}(\mathbb{Z}_{15})$ cyclic?
  • 6 Find $Z(Q_8)$, identify $Q_8/Z(Q_8)$, and show that every subgroup of $Q_8$ is normal.
  • 7 Identify $(\mathbb{Z}_4\times\mathbb{Z}_4)/\langle(2,2)\rangle$.
  • 8 Prove that no group $G$ has $|G/Z(G)|=7$; give a group with $|G/Z(G)|=4$.
  • 9 Show that $\operatorname{Aut}(S_3)\cong S_3$ using Theorem 7.13(1) and a count of the possible images of $(1\,2)$ and $(1\,2\,3)$.
1 $\gcd(20,30)=10$ homomorphisms. None is injective: the image has order dividing $\gcd(20,30)=10\lt20$.
2 Every $h\in\mathbb{Z}_2\times\mathbb{Z}_2$ satisfies $4h=0$, so there are $4$. None is onto: the image of a cyclic group is cyclic.
3 The kernel contains $S_3'=A_3$, so $\phi$ factors through $\mathbb{Z}_2$, and the only homomorphism $\mathbb{Z}_2\to\mathbb{Z}_3$ is trivial ($\gcd(2,3)=1$). Answer: $1$.
4 $(1\,3)(1\,2)(1\,3)^{-1}=(3\,2)\notin\{e,(1\,2)\}$. $A_3$ has index $2$ (Theorem 7.7(3)).
5 $\varphi(15)=8$. $\operatorname{Aut}(\mathbb{Z}_{15})\cong U(15)\cong\mathbb{Z}_2\times\mathbb{Z}_4$ (Exercise I.5): not cyclic.
6 $Z(Q_8)=\{\pm1\}$: $\pm i,\pm j,\pm k$ do not commute with each other ($ij=-ji$). $Q_8/\{\pm1\}$ has order $4$ and every element squares into $\{\pm1\}$, so it is $V_4$. Subgroups: $\{1\}$, $\{\pm1\}$, $\langle i\rangle,\langle j\rangle,\langle k\rangle$ (index $2$), $Q_8$ — each is normal (central, index $2$, or trivial).
7 Let $H=\langle(2,2)\rangle=\{(0,0),(2,2)\}$; the quotient $Q$ has order $8$. Every element of $\mathbb{Z}_4\times\mathbb{Z}_4$ has order dividing $4$, so $Q$ has no element of order $8$. The coset of $(1,0)$ has order $4$, because $2(1,0)=(2,0)\notin H$. A coset $x+H$ satisfies $2(x+H)=H$ iff $2x\in H$: $2x=(0,0)$ for the $4$ elements $x\in\{0,2\}^2$ and $2x=(2,2)$ for the $4$ elements $x\in\{1,3\}^2$ — $8$ elements, i.e. $4$ cosets: the identity and $3$ of order $2$. So $Q\cong\mathbb{Z}_4\times\mathbb{Z}_2$.
8 If $|G/Z(G)|=7$, it is cyclic, so $G$ is abelian and $G/Z(G)$ is trivial — contradiction. $|D_4/Z(D_4)|=4$ (Example 4).
9 $Z(S_3)=\{e\}$, so $\operatorname{Inn}(S_3)\cong S_3$ has $6$ elements. An automorphism maps $(1\,2)$ to one of the $3$ transpositions and $(1\,2\,3)$ to one of the $2$ three-cycles, and these two images determine it: at most $6$ automorphisms. Hence $\operatorname{Aut}(S_3)=\operatorname{Inn}(S_3)\cong S_3$.
III
Permutations, actions and the class equation.
  • 1 Write $(1\,2\,3\,4)(2\,4\,5)$ as a product of disjoint cycles (right to left) and find its order and sign.
  • 2 How many elements of order $3$ does $S_6$ have?
  • 3 Find the largest order of an element of $S_8$, and of $S_7$.
  • 4 How many elements of order $2$ does $A_6$ have?
  • 5 Find the size of the conjugacy class of $(1\,2\,3\,4)$ in $S_6$ and the order of its centraliser.
  • 6 $D_6$ acts on the six vertices of a regular hexagon. Find the orbit and the stabiliser of a vertex, and verify the orbit–stabiliser theorem.
  • 7 Prove that every group of order $25$ is abelian, and list them.
  • 8 Which of these are class equations of some group: $21=1+3+3+7+7$; $12=1+1+2+2+3+3$; $15=1+1+1+3+3+6$?
  • 9 Use Burnside's lemma to count the colourings of the four vertices of a square with $2$ colours, up to rotation.
1 Apply $(2\,4\,5)$ first: $1\mapsto1\mapsto2$; $2\mapsto4\mapsto1$; $3\mapsto3\mapsto4$; $4\mapsto5\mapsto5$; $5\mapsto2\mapsto3$. So the product is $(1\,2)(3\,4\,5)$: order $6$, odd (a $4$-cycle is odd and a $3$-cycle even).
2 Types $3\,1^3$: $\binom63\cdot2=40$; $3^2$: $\tfrac{720}{3^2\cdot2!}=40$. Total $80$.
3 Maximise the lcm over partitions: for $8$, $5+3$ gives $15$; for $7$, $4+3$ gives $12$.
4 Order-$2$ elements of $S_6$ have types $2\,1^4$, $2^2\,1^2$, $2^3$; only $2^2\,1^2$ is even: $\tfrac{720}{2^2\cdot2!\cdot2!}=45$.
5 Type $4\,1^2$: class size $\tfrac{720}{4\cdot1^2\cdot2!}=90$; centraliser of order $720/90=8$ (generated by the $4$-cycle and the transposition $(5\,6)$).
6 The rotations move a vertex to all six vertices, so the orbit has $6$ elements; the stabiliser is $\{e,\text{the reflection through that vertex}\}$, of order $2$; and $6\cdot2=12=|D_6|$ ✓.
7 $25=5^2$: Theorem 7.19(2). The groups are $\mathbb{Z}_{25}$ and $\mathbb{Z}_5\times\mathbb{Z}_5$.
8 $21$: yes — the nonabelian group $\mathbb{Z}_7\rtimes\mathbb{Z}_3$ of order $21$ has trivial centre, two classes of $3$ elements of order $7$ and two classes of $7$ elements of order $3$. $12$: yes — it is the class equation of $D_6$: $\{e\}$, $\{r^3\}$, $\{r,r^5\}$, $\{r^2,r^4\}$, and the reflections split into $\{s,r^2s,r^4s\}$ and $\{rs,r^3s,r^5s\}$. $15$: no — $6\nmid15$; besides, every group of order $15$ is cyclic (Theorem 7.23), so its class equation is $15=1+1+\cdots+1$.
9 Rotations by $0^\circ,90^\circ,180^\circ,270^\circ$ fix $2^4,2^1,2^2,2^1$ colourings. Orbits: $\tfrac{16+2+4+2}{4}=6$.
IV
Sylow theorems and finite abelian groups.
  • 1 List the values of $n_2$, $n_3$, $n_5$ allowed by the Sylow theorems for a group of order $60$, and give the actual values for $A_5$.
  • 2 Prove that every group of order $45$ is abelian.
  • 3 Prove that no group of order $20$ is simple.
  • 4 Prove that no group of order $48$ is simple.
  • 5 Show that a group of order $105$ has a normal Sylow $5$- or Sylow $7$-subgroup.
  • 6 How many elements of order $5$ does a group of order $35$ have?
  • 7 How many abelian groups of order $1000$ are there?
  • 8 Which abelian groups of order $72$ have exactly three elements of order $2$?
  • 9 (Research-flavoured) Show that $S_5$ has no subgroup of order $30$, using Theorem 7.17(2) and the normal subgroups of $S_5$.
1 $60=2^2\cdot3\cdot5$: $n_2\in\{1,3,5,15\}$, $n_3\in\{1,4,10\}$, $n_5\in\{1,6\}$. In $A_5$: $n_5=24/4=6$, $n_3=20/2=10$, $n_2=5$ (the five copies of $V_4$).
2 $45=3^2\cdot5$: $n_3\mid5$, $\equiv1\ (3)$ gives $n_3=1$; $n_5\mid9$, $\equiv1\ (5)$ gives $n_5=1$. So $G\cong P_3\times P_5$, a product of a group of order $9$ (abelian) and one of order $5$: abelian.
3 $n_5\mid4$ and $n_5\equiv1\ (5)$ force $n_5=1$: the Sylow $5$-subgroup is normal.
4 $48=2^4\cdot3$: $n_2\in\{1,3\}$. If $n_2=3$, conjugation gives a homomorphism $G\to S_3$ whose kernel is nontrivial ($48\nmid6$) and proper (the action is transitive). Either way $G$ has a proper nontrivial normal subgroup.
5 $n_5\in\{1,21\}$, $n_7\in\{1,15\}$. If both were large: $21\cdot4+15\cdot6=84+90=174\gt105$ elements.
6 The group is cyclic (Theorem 7.23), so $\varphi(5)=4$.
7 $1000=2^3\cdot5^3$: $p(3)^2=9$.
8 The elements of order $2$ live in the $2$-part: $\mathbb{Z}_8$ has $1$, $\mathbb{Z}_4\times\mathbb{Z}_2$ has $3$, $\mathbb{Z}_2^{\,3}$ has $7$. So the $2$-part is $\mathbb{Z}_4\times\mathbb{Z}_2$, and the $3$-part is $\mathbb{Z}_9$ or $\mathbb{Z}_3^{\,2}$: the groups $\mathbb{Z}_2\times\mathbb{Z}_{36}$ and $\mathbb{Z}_6\times\mathbb{Z}_{12}$.
9 A subgroup $H$ of order $30$ has index $4$; the action on its cosets gives $\phi:S_5\to S_4$ with $\ker\phi\subseteq H$. The normal subgroups of $S_5$ are $\{e\}$, $A_5$, $S_5$; $A_5$ and $S_5$ do not fit inside $H$, so $\ker\phi=\{e\}$ and $S_5$ would embed in $S_4$ — impossible, as $120\gt24$.
🎯 GATE corner GATE MA · MCQGATE MA · MSQGATE MA · NAT

E1. GATE MA · MCQ The group $U(40)$ of units modulo $40$ is isomorphic to (A) $\mathbb{Z}_{16}$; (B) $\mathbb{Z}_2\times\mathbb{Z}_8$; (C) $\mathbb{Z}_4\times\mathbb{Z}_4$; (D) $\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_4$.

Idea Split by the Chinese remainder theorem: $U(40)\cong U(8)\times U(5)$ (Theorem 7.6).
Compute $U(8)=\{1,3,5,7\}\cong\mathbb{Z}_2\times\mathbb{Z}_2$ (every element squares to $1$) and $U(5)\cong\mathbb{Z}_4$. So $U(40)\cong\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_4$, with $7$ elements of order $2$.
Options (A) is cyclic, but $40$ is not of the form $p^k,2p^k$. (B) has an element of order $8$ and only $3$ of order $2$. (C) has only $3$ elements of order $2$.
Answer (D).

E2. GATE MA · MCQ The number of group homomorphisms from $\mathbb{Z}_6$ to $S_4$ is (A) $6$; (B) $12$; (C) $18$; (D) $24$.

Idea Theorem 7.11(1): count $h\in S_4$ with $h^6=e$, i.e. $o(h)\in\{1,2,3,6\}$.
Count $S_4$ has $1$ identity, $6$ transpositions and $3$ double transpositions (order $2$), $8$ three-cycles (order $3$), and no element of order $6$ (that would need cycle type $3+2$, on $5$ points). Total $1+9+8=18$.
Options (A) counts only the cyclic shape $\mathbb{Z}_6\to\mathbb{Z}_6$; (D) is $|S_4|$, forgetting that the $6$ four-cycles have order $4\nmid6$.
Answer (C).

E3. GATE MA · MSQ CSIR Part C Let $G$ be a group of order $63$. Which of the following is/are necessarily true? (One or more options may be correct.) (A) $G$ has a normal subgroup of order $7$. (B) $G$ is abelian. (C) $G$ has an element of order $3$. (D) $G$ has exactly $6$ elements of order $7$.

(A) True $63=3^2\cdot7$: $n_7\mid9$ and $n_7\equiv1\pmod7$ force $n_7=1$.
(B) False $3\mid7-1$, so $\mathbb{Z}_3$ acts nontrivially on $\mathbb{Z}_7$ (by $x\mapsto2x$, as $2^3\equiv1\pmod 7$), and $(\mathbb{Z}_7\rtimes\mathbb{Z}_3)\times\mathbb{Z}_3$ is a nonabelian group of order $63$.
(C) True Cauchy's theorem, since $3\mid63$.
(D) True The unique Sylow $7$-subgroup has order $7$ and contains every element of order $7$: exactly $7-1=6$ of them (Theorem 7.22(2)).
Answer (A), (C) and (D).

E4. GATE MA · MSQ Which of the following statements about $S_5$ and $A_5$ is/are true? (One or more options may be correct.) (A) $S_5$ has an element of order $6$. (B) $A_5$ has an element of order $6$. (C) $S_5$ has exactly $6$ Sylow $5$-subgroups. (D) $S_5$ has a subgroup of order $30$.

(A) True $(1\,2\,3)(4\,5)$ has order $\operatorname{lcm}(3,2)=6$.
(B) False In $S_5$ the only elements of order $6$ have type $3+2$, which is odd. The orders in $A_5$ are $1,2,3,5$.
(C) True $S_5$ has $4!=24$ five-cycles; each Sylow $5$-subgroup contains $4$ of them and distinct ones meet trivially: $24/4=6$ (and $6\equiv1\pmod5$, $6\mid24$ ✓).
(D) False Exercise IV.9: a subgroup of index $4$ would give an injective homomorphism $S_5\to S_4$.
Answer (A) and (C).

E5. GATE MA · NAT The number of elements of order $6$ in the symmetric group $S_6$ is ______.

Idea The cycle types of $6$ with lcm $6$ are $6$ and $3\,2\,1$ ($3\,3$ and $2\,2\,2$ have lcm $3$ and $2$).
Count Type $6$: $\tfrac{720}{6}=120$. Type $3\,2\,1$: $\tfrac{720}{3\cdot2\cdot1}=120$.
Answer $240$.

E6. GATE MA · NAT Let $G$ be a nonabelian group of order $27$. The number of conjugacy classes of $G$ is ______.

Idea Theorem 7.19(3): $|Z(G)|=3$ and every noncentral class has size $3$.
Count $3$ central classes of size $1$, and $(27-3)/3=8$ classes of size $3$. Class equation $27=1+1+1+3+\cdots+3$ (eight $3$'s).
Answer $11$ $(=p^2+p-1$ with $p=3)$.
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Orders and cyclic groups. Definition 7.1 with the rule cards (fix the right-to-left convention now). Theorems 7.2–7.4 with proofs; the counting strategy box and Example 1 on the board. Project Interactive 1 on $\mathbb{Z}_{12}$, then $\mathbb{Z}_2\times\mathbb{Z}_6$: same order, different profile. Theorem 7.6 and Example 2 (let students find the three square roots of $1$ in $U(20)$).
  2. Normal subgroups and homomorphisms. Theorem 7.7, quotients and Theorem 7.8, the first isomorphism theorem with proof, Theorem 7.11 and Example 3 as a quick-fire GATE drill. Automorphism groups (Theorem 7.13) with Example 4. Then permutations: Theorems 7.14–7.15 and Example 5(a), (b).
  3. Actions and Sylow. Orbit–stabiliser and the class equation (Theorems 7.16–7.19), the Cauchy proof by rotating tuples, the Sylow theorems (Theorem 7.21, sketch) and Theorem 7.22. Project Interactive 2 and run through $12$, $30$, $36$, $60$, $120$. Examples 6 and 7, the table of small groups, and GATE corner E3 and E5.

Discussion questions. (1) Interactive 1 shows that the number of elements of order $d$ is always a multiple of $\varphi(d)$. Why? (Group the elements of order $d$ by the cyclic subgroup they generate.) (2) Why does the existence of a subgroup of index $2$ rule out simplicity, while a subgroup of index $5$ in a group of order $60$ does not? (3) The Sylow sieve leaves $60$, $120$ and $168$ undecided. What extra information settles $120$?

Misconceptions to watch for. Believing the converse of Lagrange's theorem; thinking $o(ab)=\operatorname{lcm}(o(a),o(b))$ always; reading $U(n)$ as cyclic of order $\varphi(n)$; treating "allowed by Sylow III" as "occurs"; forgetting that $n_p\mid m$, not $n_p\mid|G|$; composing permutations in the wrong order; assuming that groups with the same order profile are isomorphic.

Suggested homework. I(1, 3, 5, 8), II(1, 3, 6, 7), III(1, 2, 4, 8, 9), IV(2, 4, 5, 8, 9); GATE corner E1, E4, E6.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. How many different chlorobenzenes are there — molecules obtained from benzene, C₆H₆, by replacing some of the six hydrogen atoms with chlorine — and how does the symmetry group of the hexagon answer this without drawing every molecule?

Why it matters. Chemists counting isomers, crystallographers classifying patterns and engineers enumerating network designs all face the same problem: many configurations are "the same" up to a symmetry. Burnside's lemma (Theorem 7.17(3)) turns the count into an average of fixed points, and its refinement by Pólya underlies software used to enumerate chemical structures.

What to do.

  1. The symmetry group of the hexagonal ring is $D_6$, of order $12$, acting on the $2^6=64$ ways to put H or Cl on the six positions. List the $12$ elements by cycle type as permutations of the six positions: the identity, rotations by $\pm60^\circ$, $\pm120^\circ$, $180^\circ$, three reflections through opposite vertices and three through opposite edges.
  2. A labelling is fixed by $g$ iff it is constant on each cycle of $g$, so $|\operatorname{Fix}(g)|=2^{c(g)}$ with $c(g)$ the number of cycles. Compute the twelve values and apply Burnside's lemma.
  3. Refine the count by the number $k$ of chlorine atoms: count the orbits on labellings with exactly $k$ chlorines for $k=0,\dots,6$ (again with Burnside, now counting fixed labellings with $k$ chlorines). Name the three dichlorobenzenes (the ortho, meta and para isomers).
  4. Repeat for three substituents (H, Cl, Br): how many orbits on the $3^6$ labellings?

Tools: pencil and paper; optionally a short Python script that applies all twelve permutations to the $64$ labellings and counts orbits directly, as a check.

Hand in: the table of cycle types and fixed-point counts, the total number of chlorobenzenes, the counts for each $k$, and the answer for three substituents, each checked by computer.

Going further. Read about Pólya's enumeration theorem and the cycle index, which produces all the counts of step 3 at once as the coefficients of a polynomial, and about its use in counting isomers of alkanes.

Instructor note: cycle counts $c(g)$: identity $6$; $\pm60^\circ$: $1$ each; $\pm120^\circ$: $2$ each; $180^\circ$: $3$; vertex reflections: $4$ each; edge reflections: $3$ each. Burnside: $64+2\cdot2+2\cdot4+8+3\cdot16+3\cdot8=156$ and $156/12=13$. By number of chlorines $k=0,\dots,6$: $1,1,3,3,3,1,1$ (total $13$). For three substituents: $729+2\cdot3+2\cdot9+27$ $+\,3\cdot81+3\cdot27=1104$ and $1104/12=92$.

🧪 Self-check quiz

0/5 correct

Q1. The number of generators of the cyclic group $\mathbb{Z}_{20}$ is

Q2. Which of the following groups is cyclic?

Q3. The number of conjugacy classes of $S_5$ is

Q4. In a group of order $40$, the number of Sylow $5$-subgroups is

Q5. The number of abelian groups of order $72$, up to isomorphism, is