Chapter 6 · Groups

6.4 Sylow Theorems and Finite Abelian Groups

Lagrange's theorem has no general converse, but prime powers behave: Cauchy's and Sylow's theorems produce subgroups of every prime-power order dividing $|G|$ and count them. That arithmetic decides the groups of order $pq$, rules out simple groups of most orders, proves $A_5$ simple — and finite abelian groups are classified completely.

Lagrange's theorem says that the order of a subgroup divides the order of the group. Its converse is false: $A_4$ has order $12$ but no subgroup of order $6$ (Example 1). The great discovery of Cauchy (1845) and of the Norwegian schoolteacher Ludwig Sylow (1872) is that the converse is true for prime powers: if $p^a$ is the largest power of a prime $p$ dividing $|G|$, then $G$ has subgroups of order $p^a$, they are all conjugate, and their number $n_p$ satisfies two simple arithmetic conditions. From these conditions alone one can often read off the structure of every group of a given order — every group of order $15$ is cyclic, every group of order $45$ is abelian, no group of order $30$, $56$ or $105$ is simple.

The second half of the section classifies finite abelian groups completely: each is a direct product of cyclic groups of prime-power order, in exactly one way. Counting abelian groups of a given order then becomes counting partitions. Both halves are among the most heavily examined topics of CSIR NET algebra: "how many Sylow $5$-subgroups can a group of order $100$ have?", "is every group of order $99$ abelian? cyclic?", "how many abelian groups of order $7200$?", "which of these groups are isomorphic?" appear in almost every paper. Throughout we use the language of §6.3: group actions, orbit–stabiliser, the class equation and the fixed-point congruence for $p$-groups.

Cauchy's Theorem

A group of order $n$ need not have elements of order $d$ for every divisor $d$ of $n$ (a non-cyclic group has no element of order $n$). For prime divisors, however, there is no exception.

📐 Theorem 6.51 — Cauchy's theorem
Let $G$ be a finite group and $p$ a prime dividing $|G|$. Then $G$ has an element of order $p$. More precisely, the number of solutions of $x^p=e$ in $G$ is a multiple of $p$, so the number of elements of order $p$ is $\equiv-1\pmod p$ and in particular at least $p-1$.

Proof. (This argument is due to J. McKay.) Let $X=\{(x_1,x_2,\dots,x_p)\in G^p: x_1x_2\cdots x_p=e\}$. The first $p-1$ entries can be chosen freely and then $x_p=(x_1\cdots x_{p-1})^{-1}$ is forced, so $|X|=|G|^{p-1}$, a multiple of $p$. The cyclic group $\mathbb{Z}_p$ acts on $X$ by rotating the entries: if $x_1x_2\cdots x_p=e$ then $$x_2\cdots x_px_1=x_1^{-1}(x_1x_2\cdots x_p)x_1=e,$$ so the rotated tuple is again in $X$, and rotating $p$ times is the identity. A tuple is fixed by the rotation iff all its entries are equal, i.e. it is $(x,x,\dots,x)$ with $x^p=e$. Since $\mathbb{Z}_p$ is a $p$-group, the fixed-point congruence (§6.3, Theorem 6.47) gives $$\#\{x\in G:x^p=e\}=|X^{\mathbb{Z}_p}|\equiv|X|\equiv0\pmod p.$$ The solution $x=e$ is one of them, so there are at least $p$ solutions, and the solutions other than $e$ — exactly the elements of order $p$ — number $\equiv-1\pmod p$. ∎

📐 Theorem 6.52 — Characterisation of $p$-groups
A finite group $G$ is a $p$-group if and only if the order of every element of $G$ is a power of $p$.

Proof. If $|G|=p^n$, every element order divides $p^n$ (Lagrange). Conversely, if a prime $q\ne p$ divided $|G|$, Cauchy's theorem would give an element of order $q$, which is not a power of $p$. ∎

✏️ Example 1 — Cauchy at work; the failure of Lagrange's converse
(a) Show that a group of even order has an odd number of elements of order $2$. (b) Show that $A_4$ has no subgroup of order $6$. (c) Let $G$ be a finite group in which $x^3=e$ for every $x$. Show that $|G|$ is a power of $3$.
(a) By Theorem 6.51 with $p=2$ the number of elements of order $2$ is $\equiv-1\equiv1\pmod2$. (Directly: the elements with $x\ne x^{-1}$ come in pairs $\{x,x^{-1}\}$, so the number of $x$ with $x=x^{-1}$, i.e. $x^2=e$, has the same parity as $|G|$; removing $e$ leaves an odd number.)
(b) Suppose $H\le A_4$ with $|H|=6$. Then $[A_4:H]=2$, so $H\trianglelefteq A_4$ (§6.3, Theorem 6.44), and $A_4/H$ has order $2$; hence $g^2H=(gH)^2=H$, i.e. $g^2\in H$ for every $g\in A_4$. Every $3$-cycle is a square of a $3$-cycle: $(a\ b\ c)=(a\ c\ b)^2$. So $H$ contains all eight $3$-cycles of $A_4$, impossible as $|H|=6$.
(c) Every element has order $1$ or $3$, a power of $3$; by Theorem 6.52, $|G|=3^n$. (Groups of exponent $3$ need not be abelian: there is a non-abelian one of order $27$.)
Moral Lagrange: subgroup orders divide $|G|$. Cauchy: every prime divisor is an element order. Between the two lies Sylow: every prime-power divisor is a subgroup order — but $6$ is not a prime power, and $A_4$ shows that nothing more can be said in general.

The Sylow Theorems

📘 Definition 6.25 — Sylow subgroups and normalisers

Let $G$ be finite, $p$ a prime, and write $|G|=p^am$ with $p\nmid m$. A subgroup of order $p^a$ — a $p$-subgroup of the largest possible order — is a Sylow $p$-subgroup of $G$. The set of them is $\operatorname{Syl}_p(G)$ and their number is $n_p=n_p(G)$. (If $p\nmid|G|$, the Sylow $p$-subgroup is $\{e\}$ and $n_p=1$.)

The normaliser of a subgroup $H$ is $N_G(H)=\{g\in G:gHg^{-1}=H\}$, the largest subgroup of $G$ in which $H$ is normal; it is the stabiliser of $H$ under the conjugation action of $G$ on its subgroups.

📐 Theorem 6.53 — First Sylow theorem (existence)
If $|G|=p^am$ with $p\nmid m$, then $G$ has a subgroup of order $p^a$. Consequently $G$ has a subgroup of order $p^k$ for every $p^k$ dividing $|G|$.

Proof. Induction on $|G|$; if $a=0$ take $\{e\}$. Let $a\ge1$ and assume the result for all groups of smaller order. Consider the class equation (§6.3, Theorem 6.46) $$|G|=|Z(G)|+\sum_i[G:C_G(a_i)].$$

Case 1: $p$ divides $|Z(G)|$. By Cauchy's theorem $Z(G)$ contains an element $z$ of order $p$. $N=\langle z\rangle$ is normal (it is central), and $|G/N|=p^{a-1}m\lt|G|$. By induction $G/N$ has a subgroup of order $p^{a-1}$, which by the correspondence theorem (§6.2) has the form $P/N$ with $N\le P\le G$; then $|P|=p\cdot p^{a-1}=p^a$.

Case 2: $p$ does not divide $|Z(G)|$. Since $p$ divides $|G|$, it cannot divide every term $[G:C_G(a_i)]$; choose $i$ with $p\nmid[G:C_G(a_i)]$. Then $|C_G(a_i)|=|G|/[G:C_G(a_i)]$ is divisible by $p^a$, and $C_G(a_i)\ne G$ because $a_i$ is not central. By induction $C_G(a_i)$, and hence $G$, has a subgroup of order $p^a$.

Finally, a Sylow $p$-subgroup is a $p$-group of order $p^a$, so it has subgroups of every order $p^k$, $k\le a$ (§6.3, Theorem 6.50). ∎

📐 Theorem 6.54 — Second Sylow theorem (conjugacy)
Let $P$ be a Sylow $p$-subgroup of $G$. Every $p$-subgroup $Q$ of $G$ is contained in some conjugate $gPg^{-1}$. In particular any two Sylow $p$-subgroups of $G$ are conjugate.

Proof. Let $Q$ act on the set $G/P$ of left cosets of $P$ by left multiplication, $q\cdot gP=qgP$. The set has $[G:P]=m$ elements, and $p\nmid m$. As $Q$ is a $p$-group, the fixed-point congruence gives a fixed coset $gP$: $qgP=gP$ for all $q\in Q$, i.e. $g^{-1}qg\in P$, i.e. $q\in gPg^{-1}$. So $Q\subseteq gPg^{-1}$. If $Q$ is itself a Sylow $p$-subgroup, both sides have order $p^a$ and $Q=gPg^{-1}$. ∎

📐 Theorem 6.55 — Third Sylow theorem (counting)
Let $|G|=p^am$ with $p\nmid m$, and $P\in\operatorname{Syl}_p(G)$. Then $$n_p=[G:N_G(P)],\qquad n_p\mid m,\qquad n_p\equiv1\pmod p.$$

Proof. $G$ acts on $\operatorname{Syl}_p(G)$ by conjugation (a conjugate of a subgroup of order $p^a$ has order $p^a$). By Theorem 6.54 the action is transitive, and the stabiliser of $P$ is $N_G(P)$; orbit–stabiliser gives $n_p=[G:N_G(P)]$. Since $P\le N_G(P)$, $n_p$ divides $[G:P]=m$.

For the congruence, restrict the action to $P$. A Sylow subgroup $Q$ is fixed by $P$ iff $xQx^{-1}=Q$ for all $x\in P$, i.e. $P\le N_G(Q)$. In that case $P$ and $Q$ are both Sylow $p$-subgroups of the group $N_G(Q)$ (they have the largest possible $p$-power order there), so by Theorem 6.54 applied in $N_G(Q)$ they are conjugate by an element of $N_G(Q)$. But $Q$ is normal in $N_G(Q)$, so its only conjugate there is $Q$ itself: $P=Q$. Thus $P$ has exactly one fixed point (namely $P$) on $\operatorname{Syl}_p(G)$, and the fixed-point congruence gives $n_p\equiv1\pmod p$. ∎

📐 Theorem 6.56 — Consequences for normality and counting
(a) A Sylow $p$-subgroup $P$ is normal in $G$ iff $n_p=1$; then $P$ contains every $p$-subgroup of $G$, i.e. every element of $p$-power order. (b) In a finite abelian group every $n_p=1$. (c) If $|P|=p$, distinct Sylow $p$-subgroups meet only in $e$, and $G$ has exactly $n_p(p-1)$ elements of order $p$. (d) If $q\ne p$ are primes, Sylow subgroups for $p$ and for $q$ meet only in $e$.

Proof. (a) All Sylow $p$-subgroups are conjugate to $P$, so $n_p=1$ iff $gPg^{-1}=P$ for all $g$. If $P$ is normal and $Q$ is a $p$-subgroup, $Q\subseteq gPg^{-1}=P$ by Theorem 6.54. (b) In an abelian group every subgroup is normal. (c) Two distinct subgroups of prime order intersect in a proper subgroup of a group of order $p$, i.e. in $\{e\}$; each contains $p-1$ elements of order $p$, and every element of order $p$ generates one of them. (d) The intersection has order dividing both a power of $p$ and a power of $q$. ∎

🧭 Problem-solving strategy — finding the possible $n_p$
  1. Factor $|G|=p^am$ with $p\nmid m$ and list the divisors $d$ of $m$. (A divisor of $|G|$ that is $\equiv1\pmod p$ is prime to $p$, so it automatically divides $m$.)
  2. Keep those with $d\equiv1\pmod p$. These are the only candidates for $n_p$; if the only one is $1$, the Sylow $p$-subgroup is normal and $G$ is not simple (unless $G=P$).
  3. If $n_p\gt1$ is possible, look for extra information: count elements (Theorem 6.56(c)), use $n_p=[G:N_G(P)]$, or let $G$ act on its $n_p$ Sylow subgroups (Theorem 6.44 of §6.3).
  4. Check with an example: $S_4$ has $n_2=3$, $n_3=4$; the abelian group $\mathbb{Z}_{12}$ has $n_2=n_3=1$.
✏️ Example 2 — Sylow numbers in practice
(a) Show that every group of order $12$ has a normal Sylow $2$-subgroup or a normal Sylow $3$-subgroup. (b) Find $n_2$ and $n_3$ for $\mathbb{Z}_{12}$, $D_6$, $A_4$ and $S_4$. (c) Find $n_2$, $n_3$, $n_5$ for $S_5$, and the normaliser of a Sylow $5$-subgroup.
(a) Candidates $12=2^2\cdot3$. $n_2\mid3$ and $n_2$ odd: $n_2\in\{1,3\}$. $n_3\mid4$ and $n_3\equiv1\pmod3$: $n_3\in\{1,4\}$.
(a) Counting Suppose $n_3=4$. The four Sylow $3$-subgroups have order $3$, so they contribute $4\cdot2=8$ elements of order $3$ (Theorem 6.56(c)). The remaining $12-8=4$ elements must contain a Sylow $2$-subgroup, which has exactly $4$ elements; so there is room for only one, and $n_2=1$. Hence $n_3=1$ or $n_2=1$.
(b)
group$n_2$$n_3$reason
$\mathbb{Z}_{12}$$1$$1$abelian
$D_6$$3$$1$$\langle r^2\rangle$ is the only subgroup of order $3$; the subgroups $\{e,r^3,sr^i,sr^{i+3}\}$, $i=0,1,2$, have order $4$
$A_4$$1$$4$$V_4=\{e,(1\,2)(3\,4),(1\,3)(2\,4),(1\,4)(2\,3)\}$ is normal; eight $3$-cycles
$S_4$$3$$4$three copies of $D_4$, e.g. $\langle(1\,2\,3\,4),(1\,3)\rangle$; four $\langle(a\,b\,c)\rangle$
(c) $|S_5|=120=2^3\cdot3\cdot5$. Sylow $5$-subgroups are generated by $5$-cycles; there are $24$ five-cycles and each subgroup contains $4$, so $n_5=6$ (and indeed $6\equiv1\pmod5$, $6\mid24$). Similarly $20$ three-cycles give $n_3=10$. The Sylow $2$-subgroups have order $8$; one is $\langle(1\ 2\ 3\ 4),(1\ 3)\rangle\cong D_4$, fixing $5$. Every Sylow $2$-subgroup $P$ fixes a point (its orbits on $\{1,\dots,5\}$ have sizes $1,2,4$ or $8$ and add up to $5$, so one has size $1$) and moves the other four, so it is a Sylow $2$-subgroup of exactly one point stabiliser $\cong S_4$, which has three of them. Hence $n_2=5\cdot3=15$. Finally $|N_{S_5}(P)|=120/n_5=20$ for $P=\langle(1\ 2\ 3\ 4\ 5)\rangle$: it is generated by $P$ and $(2\ 3\ 5\ 4)$, which conjugates $(1\ 2\ 3\ 4\ 5)$ to its square (§6.3, Example 4).
Interactive 1 — The Sylow Test Bench: Is There a Simple Group of Order $n$?

Choose an order $n$. For each prime $p$ the chips are the divisors of $m=n/p^a$; the green ones are $\equiv1\pmod p$ — the only possible values of $n_p$. Four standard arguments then try to prove that no group of order $n$ is simple: a forced $n_p=1$; counting elements (each Sylow subgroup of prime order $p$ brings $p-1$ elements of its own; for $p^a$ with $a\ge2$, two distinct Sylow subgroups already bring at least $2p^a-p^{a-1}-1$); the action on the $n_p$ Sylow subgroups (a simple $G$ would embed in $A_{n_p}$); and the "twice an odd number" argument of §6.3. Press Play to tour instructive orders, or drag the slider.

n—
possible nₚ—
counting bound—
verdict—

Groups of Order $pq$ and Non-simple Orders

📘 Definition 6.26 — Simple groups
A group $G\ne\{e\}$ is simple if its only normal subgroups are $\{e\}$ and $G$. An abelian group is simple iff it has prime order (every subgroup of an abelian group is normal, and by Cauchy's theorem a finite abelian group of composite order has a proper non-trivial subgroup).
📐 Theorem 6.57 — Groups of order $pq$
Let $p\lt q$ be primes and $|G|=pq$. (a) The Sylow $q$-subgroup is normal, so $G$ is not simple. (b) If $p\nmid q-1$, then $G\cong\mathbb{Z}_{pq}$. (c) If $p\mid q-1$, there are exactly two groups of order $pq$ up to isomorphism: $\mathbb{Z}_{pq}$ and a non-abelian group $\mathbb{Z}_q\rtimes\mathbb{Z}_p=\langle x,y: x^q=y^p=e,\ yxy^{-1}=x^r\rangle$, where $r$ has order $p$ modulo $q$.

Proof. (a) $n_q\mid p$ and $n_q\equiv1\pmod q$; as $p\lt q$, $n_q=p$ is impossible ($1\lt p\lt q+1$), so $n_q=1$. (b) $n_p\mid q$ and $n_p\equiv1\pmod p$; $n_p=q$ would need $p\mid q-1$, so $n_p=1$. Thus $P=\langle y\rangle$ and $Q=\langle x\rangle$ are both normal, $P\cap Q=\{e\}$ (Theorem 6.56(d)) and $|PQ|=|P||Q|=pq$, so $PQ=G$. For $u\in P$, $v\in Q$ the commutator $uvu^{-1}v^{-1}$ lies in $P$ (as $vu^{-1}v^{-1}\in P$) and in $Q$ (as $uvu^{-1}\in Q$), so it is $e$: elements of $P$ and $Q$ commute. Then $xy$ has order $\operatorname{lcm}(q,p)=pq$ and $G=\langle xy\rangle\cong\mathbb{Z}_{pq}$.

(c) Sketch. $Q=\langle x\rangle$ is normal, so $yxy^{-1}=x^r$ for some $r$, and $x=y^pxy^{-p}=x^{r^p}$ gives $r^p\equiv1\pmod q$. If $r\equiv1$, $G$ is abelian, hence cyclic as in (b). Otherwise $r$ has order $p$ in the cyclic group $U(q)$ of order $q-1$ (§5.3), which has a unique subgroup $\{1,r,r^2,\dots,r^{p-1}\}$ of order $p$; replacing $y$ by $y^j$ replaces $r$ by $r^j$, so all non-abelian choices give isomorphic groups. Such a group exists: the maps $t\mapsto at+b$ of $\mathbb{Z}_q$ with $a$ in the subgroup of order $p$ of $U(q)$ and $b\in\mathbb{Z}_q$ form a non-abelian group of order $pq$ under composition. ∎

✏️ Example 3 — Orders $pq$ and $2p$
(a) Show that every group of order $35$, $65$, $85$ or $91$ is cyclic. (b) Construct a non-abelian group of order $21$. (c) Show that a group of order $2p$, $p$ an odd prime, is isomorphic to $\mathbb{Z}_{2p}$ or to $D_p$.
(a) $35=5\cdot7$: $5\nmid6$. $65=5\cdot13$: $5\nmid12$. $85=5\cdot17$: $5\nmid16$. $91=7\cdot13$: $7\nmid12$. Theorem 6.57(b) applies each time. (By contrast $21=3\cdot7$, $39=3\cdot13$, $55=5\cdot11$ and $57=3\cdot19$ admit non-abelian groups, since $3\mid6$, $3\mid12$, $5\mid10$, $3\mid18$.)
(b) In $U(7)$, $2^3=8\equiv1$, so $\{1,2,4\}$ is the subgroup of order $3$. The $21$ maps $t\mapsto at+b$ on $\mathbb{Z}_7$, $a\in\{1,2,4\}$, $b\in\mathbb{Z}_7$, form a group under composition: $(t\mapsto at+b)\circ(t\mapsto ct+d)=(t\mapsto act+ad+b)$, and $ac\in\{1,2,4\}$. It is non-abelian: $x(t)=t+1$ and $y(t)=2t$ give $yxy^{-1}(t)=2(\tfrac t2+1)=t+2$, so $yxy^{-1}=x^2\ne x$.
(c) $n_p\mid2$ and $n_p\equiv1\pmod p$ force $n_p=1$: $Q=\langle x\rangle$, $o(x)=p$, is normal. Cauchy gives $y$ of order $2$, and $yxy^{-1}=x^r$ with $x=y^2xy^{-2}=x^{r^2}$, so $r^2\equiv1\pmod p$, i.e. $r\equiv\pm1$ ($\mathbb{Z}_p$ is a field). If $r=1$, $x$ and $y$ commute and $xy$ has order $\operatorname{lcm}(p,2)=2p$, so $G\cong\mathbb{Z}_{2p}$. If $r=-1$, $G=\langle x,y:x^p=y^2=e,\ yxy^{-1}=x^{-1}\rangle\cong D_p$.
🧭 Problem-solving strategy — proving "no group of order $n$ is simple"
  1. Forced $n_p=1$. If some prime has $1$ as its only candidate, the Sylow $p$-subgroup is normal. ($20,28,40,44,100,200,\dots$)
  2. Counting. Assume every $n_p\gt1$ and take the smallest candidates. Sylow subgroups of prime order contribute $n_p(p-1)$ elements each, disjointly; if the total exceeds $|G|$, some $n_p=1$. ($30$, $56$, $105$, $132$, …)
  3. Action on Sylow subgroups or cosets. If $n_p=k\gt1$, $G$ acts transitively on its $k$ Sylow $p$-subgroups, giving a non-trivial homomorphism $G\to S_k$. If $G$ were simple it would be injective, so $|G|$ would divide $k!$ (even $k!/2$). If this fails for every candidate $k$, $G$ is not simple. ($12$, $36$, $48$, $72$, …)
  4. Twice an odd number. If $|G|=2m$ with $m\gt1$ odd, $G$ has a normal subgroup of index $2$ (§6.3, Exercise III.7).
  5. If all of these fail, think harder — or suspect a genuine simple group: $60$ ($A_5$) and $168$ are the only orders below $200$ that carry a non-abelian simple group.
✏️ Example 4 — No simple groups of orders $30$, $56$, $36$ and $48$
Prove that no group of order $30$, $56$, $36$ or $48$ is simple.
$30$ $30=2\cdot3\cdot5$: $n_3\in\{1,10\}$, $n_5\in\{1,6\}$. If both exceed $1$, there are $10\cdot2=20$ elements of order $3$ and $6\cdot4=24$ of order $5$ — $44\gt30$ elements. So $n_3=1$ or $n_5=1$. (Alternatively: $30=2\cdot15$ with $15$ odd.)
$56$ $56=2^3\cdot7$: $n_7\in\{1,8\}$, $n_2\in\{1,7\}$. If $n_7=8$, there are $48$ elements of order $7$; the other $8$ elements must contain a Sylow $2$-subgroup, which has $8$ elements, so it is unique: $n_2=1$.
$36$ $36=2^2\cdot3^2$: $n_3\in\{1,4\}$. If $n_3=4$, the action of $G$ on its four Sylow $3$-subgroups is a non-trivial homomorphism $G\to S_4$; it cannot be injective since $36\nmid24$, so its kernel is a proper non-trivial normal subgroup. (Exercise IV.2 shows the kernel has order $3$.)
$48$ $48=2^4\cdot3$: $n_2\in\{1,3\}$. If $n_2=3$, the action on the three Sylow $2$-subgroups gives $G\to S_3$ with non-trivial kernel since $48\nmid6$. Either way there is a proper non-trivial normal subgroup.
📐 Theorem 6.58 — $A_5$ is simple
The alternating group $A_5$, of order $60$, is simple. More generally $A_n$ is simple for every $n\ge5$ (statement only), while $A_4$ is not: $V_4\trianglelefteq A_4$.

Proof (for $A_5$). A normal subgroup $N$ contains, with each element, its whole conjugacy class, so $N$ is a union of conjugacy classes of $A_5$. These have sizes $1,15,20,12,12$ (§6.3, Theorem 6.40). So $|N|=1+(\text{a sum of some of }15,20,12,12)$, and $|N|$ divides $60$. The possible values of $1+$(sub-sum) are $1,13,16,21,25,28,33,36,40,45,48,60$, and of these only $1$ and $60$ divide $60$. Hence $N=\{e\}$ or $N=A_5$. ∎

Sketch for $n\ge5$. (1) Every non-trivial normal subgroup $N$ of $A_n$ contains a $3$-cycle: take $\sigma\ne e$ in $N$ and a well-chosen $3$-cycle $\gamma$; the commutator $\gamma\sigma\gamma^{-1}\sigma^{-1}\in N$ moves few points, and repeating the trick produces a $3$-cycle. (2) For $n\ge5$ all $3$-cycles are conjugate in $A_n$ (§6.3, Exercise II.9). (3) The $3$-cycles generate $A_n$ (§6.3, Theorem 6.36). So $N=A_n$.

📐 Theorem 6.59 — Normal subgroups of $S_n$, $n\ge5$
For $n\ge5$ the only normal subgroups of $S_n$ are $\{e\}$, $A_n$ and $S_n$. In particular $S_5$ has no normal subgroup of order $2$, $5$, $6$, $10$, $20$, $24$, $30$ or $40$.

Proof. Let $N\trianglelefteq S_n$. Then $N\cap A_n\trianglelefteq A_n$, so $N\cap A_n$ is $\{e\}$ or $A_n$ by simplicity. If $N\cap A_n=A_n$, then $A_n\le N$ and $[S_n:A_n]=2$ forces $N=A_n$ or $S_n$. If $N\cap A_n=\{e\}$, then $N$ maps injectively into $S_n/A_n$ (the kernel of $N\to S_n/A_n$ is $N\cap A_n$), so $|N|\le2$. A normal subgroup $\{e,t\}$ of order $2$ satisfies $gtg^{-1}\in\{e,t\}$, so $gtg^{-1}=t$ for all $g$: $t\in Z(S_n)=\{e\}$ (§6.3, Exercise II.6), a contradiction. Hence $N=\{e\}$. ∎

✏️ Example 5 — Subgroups of $A_5$
Show that $A_5$ has no subgroup of order $30$, $20$ or $15$, although it has subgroups of orders $12$, $10$ and $6$.
Order 30 Index $2$, hence normal (§6.3, Theorem 6.44) — contradicting Theorem 6.58.
Order 20 Index $3$: the action on the $3$ cosets gives a homomorphism $A_5\to S_3$ whose kernel lies in the subgroup, so it is a proper normal subgroup; by simplicity it is $\{e\}$, and $A_5$ would embed in $S_3$ — impossible as $60\gt6$.
Order 15 A group of order $15$ is cyclic (Theorem 6.57), but $A_5$ has no element of order $15$ (its orders are $1,2,3,5$ — §6.3, Example 3).
They exist Order $12$: the copy of $A_4$ fixing $5$. Order $10$: $\langle(1\ 2\ 3\ 4\ 5),(2\ 5)(3\ 4)\rangle\cong D_5$ (the double transposition reverses the pentagon $1,2,3,4,5$). Order $6$: $\langle(1\ 2\ 3),(1\ 2)(4\ 5)\rangle\cong S_3$. (So $A_5$ has subgroups of orders $1,2,3,4,5,6,10,12,60$ and of no other order.)

Finite Abelian Groups

For abelian groups the Sylow theory collapses beautifully: each Sylow subgroup is normal, the group is their direct product, and each Sylow subgroup is a direct product of cyclic groups. We write abelian groups multiplicatively in proofs but think of $\mathbb{Z}_{n_1}\times\cdots\times\mathbb{Z}_{n_k}$ additively.

📐 Theorem 6.60 — When is a product of cyclic groups cyclic?
$\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. The order of $(a_1,\dots,a_k)$ is $\operatorname{lcm}(o(a_1),\dots,o(a_k))$.

Proof. $(a_1,\dots,a_k)^t=e$ iff $a_i^t=e$ for all $i$ iff $o(a_i)\mid t$ for all $i$; this gives the order formula. Hence every element of $\mathbb{Z}_m\times\mathbb{Z}_n$ has order dividing $\operatorname{lcm}(m,n)$, which is less than $mn$ when $\gcd(m,n)\gt1$: no element of order $mn$. If $\gcd(m,n)=1$, $(1,1)$ has order $\operatorname{lcm}(m,n)=mn$ and generates. (This is the Chinese Remainder Theorem of §5.2 in group language.) The general case follows by induction. ∎

📐 Theorem 6.61 — Primary decomposition
Let $G$ be a finite abelian group with $|G|=p_1^{a_1}\cdots p_k^{a_k}$ (distinct primes). For each $i$ let $G(p_i)=\{x\in G: x^{p_i^{a_i}}=e\}$, the unique Sylow $p_i$-subgroup. Then $|G(p_i)|=p_i^{a_i}$ and $$G\cong G(p_1)\times G(p_2)\times\cdots\times G(p_k).$$

Proof. In an abelian group $x\mapsto x^t$ is a homomorphism, so $G(p_i)$ (a kernel) is a subgroup; it consists of the elements of $p_i$-power order and contains every $p_i$-subgroup, in particular the unique Sylow $p_i$-subgroup (Theorem 6.56(b)); conversely it is a $p_i$-group (Theorem 6.52), so it is that Sylow subgroup and $|G(p_i)|=p_i^{a_i}$. Let $m_i=|G|/p_i^{a_i}$. Since $\gcd(m_1,\dots,m_k)=1$, Bézout's identity (§5.2) gives integers $u_i$ with $\sum_iu_im_i=1$. For $x\in G$, $$x=x^{\sum u_im_i}=\prod_i x^{u_im_i},$$ and $x^{u_im_i}\in G(p_i)$ because $(x^{m_i})^{p_i^{a_i}}=x^{|G|}=e$. So the multiplication map $\mu:G(p_1)\times\cdots\times G(p_k)\to G$, $(y_1,\dots,y_k)\mapsto y_1\cdots y_k$ — a homomorphism because $G$ is abelian — is onto. Both sides have order $\prod p_i^{a_i}$, so $\mu$ is an isomorphism. ∎

📘 Definition 6.27 — Elementary divisors and invariant factors
If a finite abelian group is written as $G\cong\mathbb{Z}_{q_1}\times\cdots\times\mathbb{Z}_{q_s}$ with each $q_j$ a prime power, the list $q_1,\dots,q_s$ is a list of elementary divisors of $G$. If it is written as $G\cong\mathbb{Z}_{d_1}\times\cdots\times\mathbb{Z}_{d_r}$ with $d_1\gt1$ and $d_1\mid d_2\mid\cdots\mid d_r$, the $d_i$ are invariant factors. The exponent of $G$ is the least $t\ge1$ with $x^t=e$ for all $x$, i.e. the lcm of the element orders.
📐 Theorem 6.62 — Fundamental theorem of finite abelian groups

Every finite abelian group $G$ is a direct product of cyclic groups of prime-power order, $$G\cong\prod_{p}\left(\mathbb{Z}_{p^{\lambda_1(p)}}\times\mathbb{Z}_{p^{\lambda_2(p)}}\times\cdots\right),\qquad \lambda_1(p)\ge\lambda_2(p)\ge\cdots\ge1,$$ and the elementary divisors $p^{\lambda_j(p)}$ are uniquely determined by $G$ (up to order). Equivalently, $G\cong\mathbb{Z}_{d_1}\times\cdots\times\mathbb{Z}_{d_r}$ with uniquely determined invariant factors $d_1\mid d_2\mid\cdots\mid d_r$; here $d_r$ is the exponent of $G$, and $r$ is the largest number of elementary divisors belonging to one prime.

Thus for each prime $p$ with $p^a\,\|\,|G|$, the $p$-part of $G$ corresponds to a partition $\lambda(p)$ of $a$, and two finite abelian groups are isomorphic iff they have the same partitions for every prime.

Proof (sketch, naming every step). Step 1 (reduction). By Theorem 6.61 it suffices to treat an abelian $p$-group $G$.

Step 2 (existence: splitting off a cyclic factor). Let $a\in G$ have the largest order $p^r$. Key lemma: there is a subgroup $K$ with $G=\langle a\rangle\times K$. One proves it by induction on $|G|$: in $\bar G=G/\langle a\rangle$, by induction $\bar G$ is a product of cyclic groups $\langle\bar b_1\rangle\times\cdots\times\langle\bar b_s\rangle$; each $\bar b_j$ (of order $p^{t}$, say) can be lifted to an element $b_j\in G$ of the same order $p^t$ — this is where the maximality of $o(a)$ is used: if $b^{p^t}=a^c$, then maximality forces $p^t\mid c$, and $b\,a^{-c/p^t}$ is a lift of order $p^t$. Then $K=\langle b_1,\dots,b_s\rangle$ works. Repeating the lemma on $K$ writes $G$ as a product of cyclic groups.

Step 3 (uniqueness). If $G\cong\mathbb{Z}_{p^{\lambda_1}}\times\cdots\times\mathbb{Z}_{p^{\lambda_s}}$, then for each $k\ge0$ $$\left|\{x\in G: x^{p^{k+1}}=e\}\right|\Big/\left|\{x\in G:x^{p^{k}}=e\}\right|=p^{\#\{j:\ \lambda_j\gt k\}},$$ because $\mathbb{Z}_{p^\lambda}$ has $p^{\min(\lambda,k)}$ elements killed by $p^k$. The left side depends only on $G$, so the numbers $\#\{j:\lambda_j\gt k\}$, $k=0,1,2,\dots$, and hence the partition $\lambda$, are determined by $G$.

Step 4 (invariant factors). Arrange the elementary divisors of each prime in decreasing order, and let $d_r$ be the product of the largest ones, $d_{r-1}$ the product of the second largest, and so on (a prime with fewer parts contributes $1$). By Theorem 6.60, $\mathbb{Z}_{d_i}$ is the product of the corresponding prime-power cyclic groups, and $d_1\mid\cdots\mid d_r$ by construction. Conversely invariant factors determine the elementary divisors (factor each $d_i$), so their uniqueness follows from Step 3. ∎

📐 Theorem 6.63 — Counting abelian groups; Lagrange's converse for abelian groups
(a) If $n=p_1^{a_1}\cdots p_k^{a_k}$, the number of abelian groups of order $n$ up to isomorphism is $\pi(a_1)\pi(a_2)\cdots\pi(a_k)$, where $\pi(a)$ is the number of partitions of $a$ ($\pi(1),\dots,\pi(6)=1,2,3,5,7,11$). In particular every abelian group of order $n$ is cyclic iff $n$ is square-free. (b) A finite abelian group has a subgroup of every order dividing $|G|$. (c) A finite abelian group is cyclic iff for every prime $p$ it has at most $p-1$ elements of order $p$, i.e. at most one subgroup of order $p$.

Proof. (a) By Theorem 6.62, choosing an abelian group of order $n$ amounts to choosing a partition of $a_i$ for each $i$, independently. All choices give $\mathbb{Z}_n$ iff each $a_i$ has only the partition $(a_i)$, i.e. $a_i=1$. (b) If $d=\prod p_i^{b_i}$ divides $|G|$, each $G(p_i)$ has a subgroup $H_i$ of order $p_i^{b_i}$ (§6.3, Theorem 6.50), and $H_1\times\cdots\times H_k$ has order $d$. (c) If the $p$-part is $\mathbb{Z}_{p^{\lambda_1}}\times\cdots\times\mathbb{Z}_{p^{\lambda_s}}$, the elements with $x^p=e$ form a copy of $\mathbb{Z}_p^{\,s}$, so there are $p^s-1$ elements of order $p$. This is $\le p-1$ iff $s\le1$ for every $p$, iff every $p$-part is cyclic, iff $G$ is cyclic (Theorem 6.60). ∎

✏️ Example 6 — The abelian groups of order $360$; deciding isomorphism
(a) List all abelian groups of order $360$, in elementary-divisor and invariant-factor form. (b) Decide whether $\mathbb{Z}_6\times\mathbb{Z}_{60}\cong\mathbb{Z}_{12}\times\mathbb{Z}_{30}$, and whether $\mathbb{Z}_6\times\mathbb{Z}_{60}\cong\mathbb{Z}_2\times\mathbb{Z}_{180}$.
Count $360=2^3\cdot3^2\cdot5$, so there are $\pi(3)\pi(2)\pi(1)=3\cdot2\cdot1=6$ groups. The $2$-part is $\mathbb{Z}_8$, $\mathbb{Z}_4\times\mathbb{Z}_2$ or $\mathbb{Z}_2^3$; the $3$-part $\mathbb{Z}_9$ or $\mathbb{Z}_3^2$; the $5$-part $\mathbb{Z}_5$.
(a) The list
elementary divisorsinvariant factors
$8,9,5$$\mathbb{Z}_{360}$
$8,3,3,5$$\mathbb{Z}_3\times\mathbb{Z}_{120}$
$4,2,9,5$$\mathbb{Z}_2\times\mathbb{Z}_{180}$
$4,2,3,3,5$$\mathbb{Z}_6\times\mathbb{Z}_{60}$
$2,2,2,9,5$$\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_{90}$
$2,2,2,3,3,5$$\mathbb{Z}_2\times\mathbb{Z}_6\times\mathbb{Z}_{30}$
For instance, for $4,2,3,3,5$: the largest parts give $d_2=4\cdot3\cdot5=60$, the next ones $d_1=2\cdot3=6$.
(b) Split each factor by the CRT (Theorem 6.60): $\mathbb{Z}_6\times\mathbb{Z}_{60}\cong(\mathbb{Z}_2\times\mathbb{Z}_3)\times(\mathbb{Z}_4\times\mathbb{Z}_3\times\mathbb{Z}_5)$ has elementary divisors $2,4;\ 3,3;\ 5$. $\mathbb{Z}_{12}\times\mathbb{Z}_{30}\cong(\mathbb{Z}_4\times\mathbb{Z}_3)\times(\mathbb{Z}_2\times\mathbb{Z}_3\times\mathbb{Z}_5)$ has the same list, so the groups are isomorphic. $\mathbb{Z}_2\times\mathbb{Z}_{180}$ has elementary divisors $2,4;\ 9;\ 5$: its $3$-part is $\mathbb{Z}_9$, not $\mathbb{Z}_3^2$, so it is not isomorphic to the others (it has an element of order $9$; they do not).
Interactive 2 — Every Abelian Group of Order $n$, Two Ways

Each row is a prime $p$; its blocks are the elementary divisors $p^{\lambda_j}$, drawn as stacks of $\lambda_j$ squares — a partition of the exponent of $p$. Blocks are lined up in columns from the largest (right) to the smallest, and multiplying down each column gives the invariant factors $d_1\mid d_2\mid\cdots$ (Theorem 6.62, Step 4). Press Play to run through all abelian groups of the chosen order.

group—
elementary divisors—
invariant factors—
exponent—
elements of order p—
✏️ Example 7 — Counting elements; groups that look alike
(a) Find the number of elements of order $2$, $4$ and $8$ in $\mathbb{Z}_2\times\mathbb{Z}_4\times\mathbb{Z}_8$. (b) Show that the five abelian groups of order $16$ are distinguished by their numbers of elements of each order. (c) Show that $\mathbb{Z}_4\times\mathbb{Z}_4$ and $Q_8\times\mathbb{Z}_2$ have the same number of elements of each order but are not isomorphic.
(a) In $\mathbb{Z}_{2^\lambda}$ the elements killed by $2^k$ number $2^{\min(\lambda,k)}$. In $G=\mathbb{Z}_2\times\mathbb{Z}_4\times\mathbb{Z}_8$: killed by $2$: $2\cdot2\cdot2=8$; by $4$: $2\cdot4\cdot4=32$; by $8$: $64$. So the orders $1,2,4,8$ occur $1$, $8-1=7$, $32-8=24$, $64-32=32$ times.
(b)
grouporder 2order 4order 8order 16
$\mathbb{Z}_{16}$1248
$\mathbb{Z}_8\times\mathbb{Z}_2$3480
$\mathbb{Z}_4\times\mathbb{Z}_4$31200
$\mathbb{Z}_4\times\mathbb{Z}_2^2$7800
$\mathbb{Z}_2^4$15000
All rows differ. (For abelian groups this always works: the counts of elements killed by $p^k$ determine the partition, Step 3 of Theorem 6.62.)
(c) In $Q_8\times\mathbb{Z}_2$ the elements of order dividing $2$ are $(\pm1,0),(\pm1,1)$: so $3$ of order $2$ and $16-4=12$ of order $4$, exactly as in $\mathbb{Z}_4\times\mathbb{Z}_4$. But $Q_8\times\mathbb{Z}_2$ is not abelian. The "same order statistics ⇒ isomorphic" principle is valid only among abelian groups.
⚠️ Counterexamples and pitfalls
  1. Lagrange has no converse. $A_4$ (order $12$) has no subgroup of order $6$; $A_5$ (order $60$) has none of order $15$, $20$ or $30$. Sylow guarantees only prime-power orders.
  2. The congruence is modulo $p$, not modulo $|P|$. For $|G|=72=2^3\cdot3^2$, $n_3=4$ is allowed ($4\equiv1\pmod3$, though $4\not\equiv1\pmod9$), and it occurs: $S_4\times\mathbb{Z}_3$ has four Sylow $3$-subgroups.
  3. Element counting needs Sylow subgroups of prime order. Sylow subgroups of order $p^2$ or more can intersect: in $S_4$ the three Sylow $2$-subgroups (copies of $D_4$) all contain $V_4$.
  4. $n_p=1$ for all $p$ does not mean cyclic. $\mathbb{Z}_2\times\mathbb{Z}_2$ and $Q_8$ have $n_2=1$; normal Sylow subgroups make $G$ their direct product, which need not be cyclic or even abelian.
  5. Sylow subgroups need not be cyclic or abelian. The Sylow $2$-subgroups of $S_4$ are $D_4$.
  6. "Every group of order $pq$ is cyclic" needs $p\nmid q-1$. $S_3$ (order $6$), the non-abelian groups of orders $21$, $39$, $55$ are counterexamples; every group of order $15$, $33$, $35$, $51$, $65$, $77$, $85$, $91$ is cyclic.
  7. Same order statistics, different groups. $\mathbb{Z}_4\times\mathbb{Z}_4$ and $Q_8\times\mathbb{Z}_2$; for abelian groups the order statistics do determine the group.
  8. $\mathbb{Z}_m\times\mathbb{Z}_n$ is cyclic only for coprime $m,n$. $\mathbb{Z}_2\times\mathbb{Z}_2\not\cong\mathbb{Z}_4$; $\mathbb{Z}_2\times\mathbb{Z}_6\not\cong\mathbb{Z}_{12}$; but $\mathbb{Z}_4\times\mathbb{Z}_9\cong\mathbb{Z}_{36}$.
  9. Subgroups of every order, but not cyclic ones. An abelian group has a subgroup of each order dividing $|G|$, but $\mathbb{Z}_2\times\mathbb{Z}_2$ has no cyclic subgroup of order $4$.
  10. Isomorphism is decided by elementary divisors, not by the factors written. $\mathbb{Z}_6\times\mathbb{Z}_{60}\cong\mathbb{Z}_{12}\times\mathbb{Z}_{30}$ although no factor matches; $\mathbb{Z}_2\times\mathbb{Z}_{180}\not\cong\mathbb{Z}_6\times\mathbb{Z}_{60}$: the same order $360$, but exponents $180$ and $60$.
  11. Square-free order does not make every group abelian. All abelian groups of order $30$ are cyclic, but $S_3\times\mathbb{Z}_5$ and $D_{15}$ are non-abelian groups of order $30$.

Exercises

I
Cauchy and Sylow.
  • 1 List the possible values of $n_p$, for every prime $p$, for groups of order $24$, $45$ and $100$.
  • 2 Show that every group of order $45$ is abelian, and list the groups of order $45$.
  • 3 Describe all Sylow $2$- and Sylow $3$-subgroups of $S_4$.
  • 4 A group of order $168$ has $n_7=8$. How many elements of order $7$ does it have?
  • 5 Show that for odd $n$, the dihedral group $D_n$ (order $2n$) has $n_2=n$.
  • 6 Let $N\trianglelefteq G$ and $P\in\operatorname{Syl}_p(G)$. Prove that $P\cap N\in\operatorname{Syl}_p(N)$.
  • 7 Show that if a Sylow $p$-subgroup $P$ is normal in $G$, then every element of $G$ of $p$-power order lies in $P$.
  • 8 Show that in a group of order $12$ the number of elements of order $3$ is $2$ or $8$, and give an example of each.
1 $24=2^3\cdot3$: $n_2\in\{1,3\}$, $n_3\in\{1,4\}$. $45=3^2\cdot5$: $n_3\mid5$, $\equiv1\pmod3$: $n_3=1$; $n_5\mid9$, $\equiv1\pmod5$: $n_5=1$. $100=2^2\cdot5^2$: $n_2\in\{1,5,25\}$; $n_5\mid4$, $\equiv1\pmod5$: $n_5=1$.
2 By I.1 both Sylow subgroups $P$ (order $9$) and $Q$ (order $5$) are normal, $P\cap Q=\{e\}$, so $G\cong P\times Q$ (as in the proof of Theorem 6.57). $P$ is abelian (order $p^2$, §6.3) and $Q$ is cyclic, so $G$ is abelian: $G\cong\mathbb{Z}_{45}$ or $\mathbb{Z}_3\times\mathbb{Z}_{15}$.
3 Sylow $3$: the four subgroups $\langle(a\ b\ c)\rangle$, one for each choice of fixed point. Sylow $2$ (order $8$): three copies of $D_4$, $\langle(1\ 2\ 3\ 4),(1\ 3)\rangle$, $\langle(1\ 3\ 2\ 4),(1\ 2)\rangle$, $\langle(1\ 2\ 4\ 3),(1\ 4)\rangle$, each the symmetry group of a "square" labelling, each containing $V_4$.
4 Sylow $7$-subgroups have order $7$ ($168=2^3\cdot3\cdot7$), so $8\cdot6=48$ elements of order $7$.
5 $|D_n|=2n$ with $n$ odd, so a Sylow $2$-subgroup has order $2$. The elements of order $2$ in $D_n$ are exactly the $n$ reflections (no rotation has order $2$ when $n$ is odd), each generating its own subgroup: $n_2=n$.
6 $PN$ is a subgroup ($N$ normal) and $|PN|=|P||N|/|P\cap N|$, so $[N:P\cap N]=[PN:P]$, which divides $[G:P]$ and is therefore prime to $p$. Since $P\cap N$ is a $p$-subgroup of $N$ of index prime to $p$, it is a Sylow $p$-subgroup of $N$.
7 If $o(x)=p^k$, then $\langle x\rangle$ is a $p$-subgroup, so $\langle x\rangle\subseteq gPg^{-1}=P$ for some $g$ (Theorem 6.54).
8 $n_3\in\{1,4\}$ and each Sylow $3$-subgroup contributes $2$ elements of order $3$: $2$ or $8$. Examples: $\mathbb{Z}_{12}$ or $D_6$ ($2$), $A_4$ ($8$).
II
Simplicity and groups of order $pq$.
  • 1 Show that no group of order $20$, $28$, $40$ or $44$ is simple.
  • 2 Show that no group of order $12$ is simple.
  • 3 Show that no group of order $105$ is simple.
  • 4 Show that no group of order $48$ and no group of order $80$ is simple.
  • 5 Let $p,q$ be distinct primes. Prove that a group of order $p^2q$ has a normal Sylow subgroup.
  • 6 Classify the groups of orders $35$, $77$ and $143$.
  • 7 Construct a non-abelian group of order $55$.
  • 8 Find all normal subgroups of $S_4$ by using its class equation.
1 $20$: $n_5\mid4$, $\equiv1\pmod5$, so $n_5=1$. $28$: $n_7\mid4$, so $n_7=1$. $40$: $n_5\mid8$, $\equiv1\pmod5$ ($6\nmid8$), so $n_5=1$. $44$: $n_{11}\mid4$, so $n_{11}=1$. A normal Sylow subgroup is proper and non-trivial.
2 Example 2(a): $n_2=1$ or $n_3=1$.
3 $105=3\cdot5\cdot7$: $n_3\in\{1,7\}$, $n_5\in\{1,21\}$, $n_7\in\{1,15\}$. If all exceed $1$: $7\cdot2+21\cdot4+15\cdot6=14+84+90=188$ non-identity elements, more than $105$.
4 $48$: Example 4. $80=2^4\cdot5$: $n_5\in\{1,16\}$. If $n_5=16$ there are $64$ elements of order $5$; the remaining $16$ must form the Sylow $2$-subgroup (order $16$), which is then unique: $n_2=1$.
5 If $p\gt q$: $n_p\mid q$ and $n_p\equiv1\pmod p$ force $n_p=1$. If $p\lt q$: $n_q\in\{1,p,p^2\}$; $n_q=p$ is impossible ($p\lt q$); if $n_q=p^2$ then $q\mid p^2-1=(p-1)(p+1)$, so $q\mid p+1$, and $q\gt p$ forces $q=p+1$, i.e. $p=2$, $q=3$, $|G|=12$ — handled in II.2. Otherwise $n_q=1$.
6 $35=5\cdot7$ ($5\nmid6$), $77=7\cdot11$ ($7\nmid10$), $143=11\cdot13$ ($11\nmid12$): each order has only the cyclic group (Theorem 6.57(b)).
7 $5\mid10=11-1$. In $U(11)$, $3$ has order $5$ ($3^5=243=22\cdot11+1$), with subgroup $\{1,3,9,5,4\}$. The maps $t\mapsto at+b$ on $\mathbb{Z}_{11}$ with $a\in\{1,3,4,5,9\}$ form a non-abelian group of order $55$.
8 $24=1+3+6+6+8$. A normal subgroup is a union of classes containing $\{e\}$ whose size divides $24$; the possible sizes $1+\dots$ are $1,4,7,9,10,12,13,15,16,18,21,24$ and only $1,4,12,24$ divide $24$. They are realised by $\{e\}$, $V_4$ ($1+3$), $A_4$ ($1+3+8$) and $S_4$.
III
Finite abelian groups.
  • 1 List all abelian groups of order $72$ in both forms.
  • 2 How many abelian groups are there of order $1000$? of order $64$? of order $210$?
  • 3 Write $\mathbb{Z}_6\times\mathbb{Z}_{20}\times\mathbb{Z}_{36}$ in invariant-factor form.
  • 4 Is $\mathbb{Z}_4\times\mathbb{Z}_6\cong\mathbb{Z}_2\times\mathbb{Z}_{12}$? Is it $\cong\mathbb{Z}_{24}$?
  • 5 How many elements of order $4$ has $\mathbb{Z}_4\times\mathbb{Z}_2\times\mathbb{Z}_2$? How many subgroups of order $2$?
  • 6 Show that $\mathbb{Z}_p^{\,n}$ has exactly $(p^n-1)/(p-1)$ subgroups of order $p$.
  • 7 Identify $U(15)$, $U(16)$, $U(20)$, $U(21)$ and $U(24)$ as products of cyclic groups.
  • 8 Prove that a finite abelian group has an element whose order equals the exponent of the group, and deduce that a finite abelian group whose exponent equals its order is cyclic.
1 $72=2^3\cdot3^2$: $3\cdot2=6$ groups. Elementary divisors → invariant factors: $8,9\to\mathbb{Z}_{72}$; $8,3,3\to\mathbb{Z}_3\times\mathbb{Z}_{24}$; $4,2,9\to\mathbb{Z}_2\times\mathbb{Z}_{36}$; $4,2,3,3\to\mathbb{Z}_6\times\mathbb{Z}_{12}$; $2,2,2,9\to\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_{18}$; $2,2,2,3,3\to\mathbb{Z}_2\times\mathbb{Z}_6\times\mathbb{Z}_6$.
2 $1000=2^3\cdot5^3$: $3\cdot3=9$. $64=2^6$: $\pi(6)=11$. $210=2\cdot3\cdot5\cdot7$ is square-free: $1$.
3 Elementary divisors: $6\to2,3$; $20\to4,5$; $36\to4,9$. By prime: $2$: $4,4,2$; $3$: $9,3$; $5$: $5$. Columns: $d_3=4\cdot9\cdot5=180$, $d_2=4\cdot3=12$, $d_1=2$. So $\mathbb{Z}_2\times\mathbb{Z}_{12}\times\mathbb{Z}_{180}$ (orders: $6\cdot20\cdot36=4320=2\cdot12\cdot180$).
4 $\mathbb{Z}_4\times\mathbb{Z}_6$ has elementary divisors $4,2,3$, as does $\mathbb{Z}_2\times\mathbb{Z}_{12}$: isomorphic. Not $\cong\mathbb{Z}_{24}$ (elementary divisors $8,3$): it has exponent $12$.
5 Elements killed by $2$: $2\cdot2\cdot2=8$; killed by $4$: $16$ (all). So $16-8=8$ elements of order $4$, and $7$ elements of order $2$, hence $7$ subgroups of order $2$.
6 All $p^n-1$ non-zero elements have order $p$; each subgroup of order $p$ contains $p-1$ of them and distinct such subgroups meet trivially. So there are $(p^n-1)/(p-1)$.
7 Count elements of order $2$ and look for large orders. $U(15)$, $U(16)$, $U(20)$: order $8$, three elements of order $2$, four of order $4$, none of order $8$: $\mathbb{Z}_2\times\mathbb{Z}_4$ each. $U(21)$: order $12$, three elements of order $2$ (so the $2$-part is $\mathbb{Z}_2^2$): $\mathbb{Z}_2\times\mathbb{Z}_6$. $U(24)$: all seven non-identity elements satisfy $x^2\equiv1\pmod{24}$: $\mathbb{Z}_2^3$.
8 With invariant factors $d_1\mid\cdots\mid d_r$, every element order divides $d_r$, and the generator of $\mathbb{Z}_{d_r}$ has order $d_r$; so the exponent is $d_r$ and is attained. If $d_r=|G|=d_1\cdots d_r$, then $r=1$ and $G\cong\mathbb{Z}_{d_1}$.
IV
Proofs and challenges.
  • 1 Prove that every group of order $255=3\cdot5\cdot17$ is cyclic.
  • 2 Prove that a group of order $36$ has a normal subgroup of order $3$ or $9$.
  • 3 Find the number of elements of order $5$ in $S_5$, deduce $n_5(S_5)$, and find the order of the normaliser of a Sylow $5$-subgroup.
  • 4 Show that $S_5$ has no subgroup of order $40$ or $30$, but has subgroups of orders $20$ and $24$.
  • 5 Find all $n\le30$ such that every group of order $n$ is cyclic.
  • 6 Prove that if every Sylow subgroup of a finite group $G$ is normal and cyclic, then $G$ is cyclic.
1 $n_{17}\mid15$ and $\equiv1\pmod{17}$, so $Q\in\operatorname{Syl}_{17}$ is normal, $Q\cong\mathbb{Z}_{17}$. Conjugation gives a homomorphism $G\to\operatorname{Aut}(Q)\cong U(17)$, of order $16$; its image has order dividing $\gcd(255,16)=1$, so $G$ centralises $Q$: $Q\le Z(G)$. Then $|G/Z(G)|$ divides $15$, and groups of order $1,3,5,15$ are cyclic (Theorem 6.57), so $G$ is abelian (§6.3, Theorem 6.48). An abelian group of square-free order is cyclic.
2 $n_3\in\{1,4\}$. If $n_3=1$ the Sylow $3$-subgroup (order $9$) is normal. If $n_3=4$, let $K$ be the kernel of the action on the four Sylow $3$-subgroups $P_1,\dots,P_4$. $K=\bigcap N_G(P_i)$, and $|N_G(P_i)|=36/4=9$, so $N_G(P_i)=P_i$ and $K\le P_1$: $|K|\in\{1,3,9\}$. $K\ne\{e\}$ since $36\nmid24$; $K\ne P_1$ since then $P_1$ would be normal and $n_3=1$. So $|K|=3$.
3 Elements of order $5$ are the $5$-cycles: $5!/5=24$. Each Sylow $5$-subgroup contains $4$, so $n_5=6$, and $|N_{S_5}(P)|=120/6=20$.
4 A subgroup $H$ of index $3$ or $4$ gives, by the coset action, a homomorphism $S_5\to S_3$ or $S_4$ with kernel inside $H$. By Theorem 6.59 the kernel is $\{e\}$, $A_5$ or $S_5$; it lies in $H$ (order $40$ or $30$), so it is $\{e\}$ and $S_5$ would embed in $S_4$ — impossible ($120\gt24$). Order $24$: the stabiliser $S_4$ of a point. Order $20$: the normaliser of a Sylow $5$-subgroup (IV.3), e.g. $\langle(1\ 2\ 3\ 4\ 5),(2\ 3\ 5\ 4)\rangle$.
5 $n$ must be square-free (else a non-cyclic abelian group exists) and, for primes $p,q\mid n$, $p\nmid q-1$ (else a non-abelian group of order $pq$ times a cyclic factor exists). For $n\le30$ this leaves $1,2,3,5,7,11,13,15,17,19,23,29$. (In general: every group of order $n$ is cyclic iff $\gcd(n,\varphi(n))=1$.)
6 With all Sylow subgroups $P_1,\dots,P_k$ normal, they pairwise intersect trivially and commute elementwise (as in Theorem 6.57), and $G\cong P_1\times\cdots\times P_k$ by counting orders. A product of cyclic groups of pairwise coprime orders is cyclic (Theorem 6.60).
🎯 Exam corner CSIR Part BCSIR Part CGATE MA

E1. CSIR Part B GATE MA Let $G$ be a group of order $175$. Which of the following is true? (A) $G$ is abelian. (B) $G$ is cyclic. (C) $G$ has exactly $7$ Sylow $5$-subgroups. (D) $G$ is simple.

Idea $175=5^2\cdot7$. $n_5\mid7$, $n_5\equiv1\pmod5$: $n_5=1$. $n_7\mid25$, $n_7\equiv1\pmod7$: the divisors $1,5,25$ are $\equiv1,5,4$, so $n_7=1$.
Options Both Sylow subgroups are normal, so $G\cong P\times Q$ with $|P|=25$ (abelian, §6.3) and $Q\cong\mathbb{Z}_7$: (A) true. (B) false: $\mathbb{Z}_5\times\mathbb{Z}_{35}$ is not cyclic. (C) false: $n_5=1$. (D) false.
Answer (A).

E2. CSIR Part B The number of abelian groups of order $7200$, up to isomorphism, is (A) $12$; (B) $18$; (C) $28$; (D) $42$.

Idea $7200=2^5\cdot3^2\cdot5^2$ (check: $32\cdot9\cdot25=7200$); Theorem 6.63(a).
Count $\pi(5)\pi(2)\pi(2)=7\cdot2\cdot2=28$.
Answer (C).

E3. CSIR Part B In a simple group of order $60$, the number of elements of order $5$ is (A) $4$; (B) $12$; (C) $24$; (D) $30$.

Idea $n_5\mid12$ and $n_5\equiv1\pmod5$: $n_5\in\{1,6\}$; a simple group cannot have a normal Sylow $5$-subgroup, so $n_5=6$.
Count Six subgroups of order $5$, meeting trivially, each with $4$ elements of order $5$: $24$. (In $A_5$: the $24$ five-cycles.)
Answer (C).

E4. CSIR Part C Let $G$ be a group of order $56$. Which of the following are necessarily true? (A) $G$ has a normal Sylow $7$-subgroup or a normal Sylow $2$-subgroup. (B) $G$ is not simple. (C) $G$ has an element of order $14$. (D) $G$ has a subgroup of order $4$.

(A) True Example 4: if $n_7=8$ the remaining $8$ elements form the unique Sylow $2$-subgroup.
(B) True By (A).
(C) False The affine group $\{t\mapsto at+b\}$ of the field $\mathbb{F}_8$ ($a\ne0$) has order $8\cdot7=56$. A map with $a\ne1$ has a unique fixed point and is conjugate to $t\mapsto at$, of order $o(a)=7$; a translation $t\mapsto t+b$, $b\ne0$, has order $2$ (characteristic $2$). So element orders are $1,2,7$ only. (Finite fields are treated in Chapter 8.)
(D) True A Sylow $2$-subgroup has order $8$ (Theorem 6.53), and a group of order $8$ has a subgroup of order $4$ (§6.3, Theorem 6.50).
Answer (A), (B), (D).

E5. CSIR Part C GATE MA Which of the following groups are necessarily cyclic? (A) A group of order $65$. (B) A group of order $99$. (C) $\mathbb{Z}_4\times\mathbb{Z}_9$. (D) The group $U(18)$ of units modulo $18$.

(A) Yes $65=5\cdot13$ and $5\nmid12$ (Theorem 6.57(b)).
(B) No $99=3^2\cdot11$: $n_3\mid11$ forces $n_3=1$ and $n_{11}\mid9$ forces $n_{11}=1$, so $G$ is abelian — but $\mathbb{Z}_3\times\mathbb{Z}_{33}$ has order $99$ and is not cyclic.
(C) Yes $\gcd(4,9)=1$, so $\mathbb{Z}_4\times\mathbb{Z}_9\cong\mathbb{Z}_{36}$ (Theorem 6.60).
(D) Yes $|U(18)|=\varphi(18)=6$, and $18=2\cdot3^2$ has a primitive root (§5.3): $5$ has order $6$ ($5,7,17,13,11,1$). Alternatively, the only abelian group of order $6$ is $\mathbb{Z}_6$.
Answer (A), (C), (D).

E6. CSIR Part C Let $G$ be an abelian group of order $16$ with exactly three elements of order $2$. Which of the following can $G$ be isomorphic to? (A) $\mathbb{Z}_{16}$. (B) $\mathbb{Z}_4\times\mathbb{Z}_4$. (C) $\mathbb{Z}_2\times\mathbb{Z}_8$. (D) $\mathbb{Z}_2\times\mathbb{Z}_2\times\mathbb{Z}_4$.

Idea A product of $s$ non-trivial cyclic $2$-groups has $2^s-1$ elements of order $2$ (Theorem 6.63(c)). Three elements means $s=2$.
Options (A) $s=1$: one element of order $2$ — no. (B) $s=2$: yes. (C) $s=2$: yes. (D) $s=3$: seven — no.
Answer (B), (C). (They are told apart by elements of order $8$: $\mathbb{Z}_2\times\mathbb{Z}_8$ has $8$, $\mathbb{Z}_4\times\mathbb{Z}_4$ none.)
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Cauchy and Sylow. Open with Example 1(b) ($A_4$ has no subgroup of order $6$) to motivate. McKay's proof of Cauchy's theorem (draw the necklace of $p$ group elements — it links to Burnside in §6.3). The three Sylow theorems with full proofs; stress that every proof is a fixed-point or orbit–stabiliser argument. Example 2 on the board.
  2. Using Sylow. Project Interactive 1 and go through $12, 30, 36, 56$, then $60$ and $168$ — let the class see the tests fail exactly where simple groups live. Theorem 6.57 and Example 3; the strategy box and Example 4; the simplicity of $A_5$ from the class sizes (Theorem 6.58) and Example 5.
  3. Abelian groups. Theorems 6.60–6.62 with the proof sketch; Interactive 2 for $n=72$ and $360$ (multiply down the columns); Examples 6 and 7, including the $Q_8\times\mathbb{Z}_2$ warning. Finish with Exam-corner E2, E5 and E6.

Discussion questions. (1) Each Sylow theorem is proved by letting a $p$-group act and counting fixed points mod $p$. What exactly is acting on what, in each proof? (2) Why does the counting argument work for Sylow subgroups of prime order but not in general? (3) Elementary divisors and invariant factors carry the same information; when is each form more convenient?

Misconceptions to watch for. Requiring $n_p\equiv1\pmod{p^a}$ instead of $\pmod p$; counting elements in Sylow subgroups of order $p^2$ as if they were disjoint; "order $pq$ ⇒ cyclic" without $p\nmid q-1$; "same orders of elements ⇒ isomorphic" for non-abelian groups; reading $\mathbb{Z}_6\times\mathbb{Z}_{60}$ and $\mathbb{Z}_{12}\times\mathbb{Z}_{30}$ as different because the factors differ.

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

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

Research question. Internet key exchange (Diffie–Hellman) relies on the difficulty of discrete logarithms in the cyclic group $U(p)$ of units modulo a large prime $p$. Why do security standards insist on "safe" primes $p=2q+1$ with $q$ prime — and what does the primary decomposition of a cyclic group have to do with it?

Why it matters. Every secure web connection, banking app and messaging service relies on key exchanges of this kind (over $U(p)$ or elliptic-curve groups). The Pohlig–Hellman algorithm (1978) shows that a discrete logarithm in a group of order $n$ is only as hard as discrete logarithms in its Sylow subgroups: if $p-1$ has only small prime factors, the "secret" exponent can be recovered quickly, whatever the size of $p$.

What to do.

  1. Take $p=8101$ (prime) and factor $p-1=8100=2^2\cdot3^4\cdot5^2$. Check that $g=6$ generates $U(8101)$ by verifying $6^{8100/q}\not\equiv1$ for $q=2,3,5$.
  2. Find $k$ with $6^k\equiv2026\pmod{8101}$ by brute force, counting the multiplications.
  3. Now use the decomposition $\mathbb{Z}_{8100}\cong\mathbb{Z}_4\times\mathbb{Z}_{81}\times\mathbb{Z}_{25}$: for each prime power $q^e$, raise both $6$ and $2026$ to the power $8100/q^e$ and solve the small discrete logarithm $k\bmod q^e$ in a subgroup of order $q^e$. Recombine with the Chinese Remainder Theorem (§5.2) and compare the work.
  4. Repeat with the safe prime $p=8039$ ($p-1=2\cdot4019$, $4019$ prime) and the generator $g=11$. Explain why Pohlig–Hellman gives almost no saving.

Tools: Python with pow(g, e, p); the CRT solver from §5.2; optionally sympy's discrete_log to check answers.

Hand in: Your two values of $k$, a table of the work done (brute force vs. Pohlig–Hellman) for both primes, and a short paragraph explaining the role of the Sylow subgroups of $U(p)$.

Going further. Read about the Pollard rho and index-calculus algorithms, and about why elliptic-curve groups of prime order are preferred in modern standards.

Instructor note: $6$ is the least primitive root modulo $8101$, and $6^{3808}\equiv2026\pmod{8101}$, i.e. $k=3808$ (so $k\equiv0\bmod4$, $k\equiv1\bmod81$, $k\equiv8\bmod25$). Brute force needs up to $8100$ multiplications; Pohlig–Hellman needs at most $4+81+25$ trial powers (fewer with digit-by-digit lifting). For $p=8039$, $11$ is the least primitive root and $11^{3351}\equiv2026$; the large factor $4019$ of $p-1$ leaves almost all the work in one Sylow subgroup.

🧪 Self-check quiz

0/5 correct

Q1. For a group of order $12$, the possible numbers of Sylow $3$-subgroups are

Q2. Every group of order $15$ is

Q3. The number of abelian groups of order $16$, up to isomorphism, is

Q4. $A_5$ has no subgroup of order

Q5. A simple group of order $168$ contains how many elements of order $7$?