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.
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$. ∎
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$. ∎
The Sylow Theorems
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.
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). ∎
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}$. ∎
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$. ∎
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$. ∎
- 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$.)
- 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$).
- 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).
- 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$.
| 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$ |
Groups of Order $pq$ and Non-simple Orders
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. ∎
- 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$)
- 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$, …)
- 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$, …)
- Twice an odd number. If $|G|=2m$ with $m\gt1$ odd, $G$ has a normal subgroup of index $2$ (§6.3, Exercise III.7).
- 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.
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$.
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\}$. ∎
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.
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. ∎
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. ∎
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. ∎
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). ∎
| elementary divisors | invariant 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}$ |
| group | order 2 | order 4 | order 8 | order 16 |
|---|---|---|---|---|
| $\mathbb{Z}_{16}$ | 1 | 2 | 4 | 8 |
| $\mathbb{Z}_8\times\mathbb{Z}_2$ | 3 | 4 | 8 | 0 |
| $\mathbb{Z}_4\times\mathbb{Z}_4$ | 3 | 12 | 0 | 0 |
| $\mathbb{Z}_4\times\mathbb{Z}_2^2$ | 7 | 8 | 0 | 0 |
| $\mathbb{Z}_2^4$ | 15 | 0 | 0 | 0 |
- 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.
- 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.
- 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$.
- $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.
- Sylow subgroups need not be cyclic or abelian. The Sylow $2$-subgroups of $S_4$ are $D_4$.
- "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.
- 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.
- $\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}$.
- 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$.
- 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$.
- 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
- 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 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 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 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.
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.
E2. CSIR Part B The number of abelian groups of order $7200$, up to isomorphism, is (A) $12$; (B) $18$; (C) $28$; (D) $42$.
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$.
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$.
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$.
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$.
Suggested plan — 3 lectures × 60 min.
- 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.
- 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.
- 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 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.
- 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$.
- Find $k$ with $6^k\equiv2026\pmod{8101}$ by brute force, counting the multiplications.
- 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.
- 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.
🧪 Self-check quiz
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$?