Skip to content

Problem Set | Mathematics - Wyatt's Notes

The following problems test understanding across all major topics. Full solutions are provided; Each problem includes a cross-reference to the relevant section for review.

Problem 1. Let GG be a group and gGg \in G an element of order nn. Prove that gk=n/gcd(n,k)|g^k| = n / \gcd(n, k).

Solution

Solution. Let d=gcd(n,k)d = \gcd(n, k) and write n=dn"n = dn", k=dkk = dk' with gcd(n,k)=1\gcd(n', k') = 1. We show (gk)n=e(g^k)^{n'} = e and that nn' is the smallest such positive exponent.

(gk)n=gkn=gdkn=gnk(g^k)^{n'} = g^{kn'} = g^{dk'n'} = g^{n'k}. Since n=dnn = dn'We have gkn=gdkn=(gdn)k=ek=eg^{kn'} = g^{dk'n'} = (g^{dn'})^{k'} = e^{k'} = e. So gk|g^k| divides n=n/dn' = n/d.

Conversely, if (gk)m=gkm=e(g^k)^m = g^{km} = e Then nn divides kmkm So dndn' divides dkmdk'm Hence nn' divides kmk'm. Since gcd(n,k)=1\gcd(n', k') = 1We get nn' divides mm. Thus gk=n=n/gcd(n,k)|g^k| = n' = n / \gcd(n, k). \blacksquare

If you get this wrong, revise: Section 1.6, Proposition 1.5; Section 2.4, Theorem 2.5.

Problem 2. Show that D4D_4 has exactly five subgroups of order 22 and determine which are normal.

Solution

Solution. D4={e,r,r2,r3,s,rs,r2s,r3s}D_4 = \{e, r, r^2, r^3, s, rs, r^2s, r^3s\} where r4=er^4 = e, s2=es^2 = e, srs=r1srs = r^{-1}.

Elements of order 22: r2r^2, ss, rsrs, r2sr^2s, r3sr^3s. So there are five subgroups of order 22: r2\langle r^2 \rangle, s\langle s \rangle, rs\langle rs \rangle, r2s\langle r^2s \rangle, r3s\langle r^3s \rangle.

For normality: rr2r1=r2r r^2 r^{-1} = r^2 and sr2s=r2=r2s r^2 s = r^{-2} = r^2 So r2D4\langle r^2 \rangle \trianglelefteq D_4. But s(rs)s=sr=r1s=r3srss(rs)s = sr = r^{-1}s = r^3s \notin \langle rs \rangle So rs\langle rs \rangle is not normal. Similarly, the other reflection subgroups are not normal. Only r2=Z(D4)\langle r^2 \rangle = Z(D_4) is normal. \blacksquare

If you get this wrong, revise: Section 1.3, 1.7; Section 4.1, Proposition 4.1.

Problem 3. Let H,KGH, K \leq G. Prove that HKGH \cap K \leq G.

Solution

Solution. HKH \cap K is non-empty since eHe \in H and eKe \in K So eHKe \in H \cap K. If a,bHKa, b \in H \cap K Then a,bHa, b \in H and a,bKa, b \in K. Since HH and KK are subgroups, ab1Hab^{-1} \in H and ab1Kab^{-1} \in K So ab1HKab^{-1} \in H \cap K. By the subgroup criterion, HKGH \cap K \leq G. \blacksquare

If you get this wrong, revise: Section 2.1, Theorem 2.1; Section 2.6, Theorem 2.6.

Problem 4. Find all subgroups of Z/12Z\mathbb{Z}/12\mathbb{Z} and draw the subgroup lattice.

Solution

Solution. By Theorem 2.4, every subgroup of the cyclic group Z/12Z\mathbb{Z}/12\mathbb{Z} is cyclic, And there is exactly one subgroup of order dd for each divisor dd of 1212.

The divisors of 1212 are 1,2,3,4,6,121, 2, 3, 4, 6, 12. The subgroups are: 0={0}\langle 0 \rangle = \{0\} (order 11), 6={0,6}\langle 6 \rangle = \{0, 6\} (order 22), 4={0,4,8}\langle 4 \rangle = \{0, 4, 8\} (order 33), 3={0,3,6,9}\langle 3 \rangle = \{0, 3, 6, 9\} (order 44), 2={0,2,4,6,8,10}\langle 2 \rangle = \{0, 2, 4, 6, 8, 10\} (order 66), 1=Z/12Z\langle 1 \rangle = \mathbb{Z}/12\mathbb{Z} (order 1212).

The subgroup lattice (Hasse diagram): Z/12Z\mathbb{Z}/12\mathbb{Z} connects to 2\langle 2 \rangle, 3\langle 3 \rangle, 4\langle 4 \rangle. 2\langle 2 \rangle connects to 4\langle 4 \rangle and 6\langle 6 \rangle. 3\langle 3 \rangle connects to 6\langle 6 \rangle. 4\langle 4 \rangle and 6\langle 6 \rangle connect to {0}\{0\}. \blacksquare

If you get this wrong, revise: Section 2.4, Theorem 2.4; Section 1.7.

Problem 5. Let H=(1 2 3 4)S4H = \langle (1\ 2\ 3\ 4) \rangle \leq S_4. Find all left cosets of HH in S4S_4 and verify HH is not normal.

Solution

Solution. H={e,(1 2 3 4),(1 3)(2 4),(1 4 3 2)}H = \{e, (1\ 2\ 3\ 4), (1\ 3)(2\ 4), (1\ 4\ 3\ 2)\} has order 44 [S4:H]=6[S_4 : H] = 6. Choose representatives from S4HS_4 \setminus HE.g., (1 2)(1\ 2), (1 3)(1\ 3) (2 3)(2\ 3), (1 2 3)(1\ 2\ 3), (1 3 2)(1\ 3\ 2). The six cosets are: HH, (1 2)H(1\ 2)H, (1 3)H(1\ 3)H, (2 3)H(2\ 3)H, (1 2 3)H(1\ 2\ 3)H, (1 3 2)H(1\ 3\ 2)H.

To show HH is not normal: (1 2)(1 2 3 4)(1 2)=(2 1 3 4)=(1 3 4 2)H(1\ 2)(1\ 2\ 3\ 4)(1\ 2) = (2\ 1\ 3\ 4) = (1\ 3\ 4\ 2) \notin H (since (1 3 4 2)(1\ 3\ 4\ 2) is not among the four elements of HH listed above). \blacksquare

If you get this wrong, revise: Section 3.1, 3.4; Section 4.1.

Problem 6. Prove that if [G:H]=2[G : H] = 2 Then HGH \trianglelefteq G.

Solution

Solution. Since [G:H]=2[G : H] = 2There are exactly two left cosets: HH and gHgH for some gHg \notin H. These partition GG So gH=GHgH = G \setminus H. Similarly, the two right cosets are HH and HgHg And Hg=GHHg = G \setminus H. Therefore gH=HggH = Hg for all gGg \in G. For hHh \in H: hH=H=HhhH = H = Hh. For gHg \notin H: gH=GH=HggH = G \setminus H = Hg. Thus gH=HggH = Hg for all gGg \in G So HGH \trianglelefteq G. \blacksquare

If you get this wrong, revise: Section 3.5, Corollary 3.7.

Problem 7. Compute Q8/{1,1}Q_8 / \{1, -1\} and identify the quotient group up to isomorphism.

Solution

Solution. Q8={1,1,i,i,j,j,k,k}Q_8 = \{1, -1, i, -i, j, -j, k, -k\} with Q8=8|Q_8| = 8 and Z(Q8)={1,1}Z(Q_8) = \{1, -1\} of order 22. The quotient has order 44. The cosets are Z={1,1}Z = \{1, -1\}, iZ={i,i}iZ = \{i, -i\}, jZ={j,j}jZ = \{j, -j\}, kZ={k,k}kZ = \{k, -k\}. Every non-identity element satisfies (iZ)2=i2Z=(1)Z=Z(iZ)^2 = i^2Z = (-1)Z = Z So every element has order 11 or 22. The quotient is abelian (since Z(Q8)Z(Q_8) contains the commutator subgroup). Thus Q8/Z(Q8)V4Z/2Z×Z/2ZQ_8 / Z(Q_8) \cong V_4 \cong \mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}. \blacksquare

If you get this wrong, revise: Section 4.2, 4.3; Section 5.3, Theorem 5.3.

Problem 8. Let ϕ:ZZ\phi : \mathbb{Z} \to \mathbb{Z} be defined by ϕ(n)=3n\phi(n) = 3n. Determine whether ϕ\phi is a group homomorphism, find its kernel and image, and explain why it is not a ring homomorphism.

Solution

Solution. As a group homomorphism (Z,+)(Z,+)(\mathbb{Z}, +) \to (\mathbb{Z}, +): ϕ(m+n)=3(m+n)=3m+3n=ϕ(m)+ϕ(n)\phi(m + n) = 3(m+n) = 3m + 3n = \phi(m) + \phi(n). ✓ ker(ϕ)={nZ:3n=0}={0}\ker(\phi) = \{n \in \mathbb{Z} : 3n = 0\} = \{0\}. im(ϕ)=3Z={3k:kZ}\mathrm{im}(\phi) = 3\mathbb{Z} = \{3k : k \in \mathbb{Z}\}.

ϕ\phi is NOT a ring homomorphism because ϕ(1)=31\phi(1) = 3 \neq 1. Ring homomorphisms between rings with unity must send 11 to 11. \blacksquare

If you get this wrong, revise: Section 5.1, Proposition 5.1; Section 8.6, Proposition 8.6.

Problem 9. State and prove the correspondence theorem (fourth isomorphism theorem).

Solution

Solution. Theorem. Let ϕ:GH\phi : G \to H be a surjective homomorphism with K=ker(ϕ)K = \ker(\phi). Then there is an inclusion-preserving bijection between subgroups of GG containing KK and Subgroups of HHGiven by Uϕ(U)U \mapsto \phi(U) with inverse Vϕ1(V)V \mapsto \phi^{-1}(V). Normality and indices are preserved.

Proof. Define Φ(U)=ϕ(U)\Phi(U) = \phi(U) and Ψ(V)=ϕ1(V)\Psi(V) = \phi^{-1}(V). Φ(Ψ(V))=ϕ(ϕ1(V))=V\Phi(\Psi(V)) = \phi(\phi^{-1}(V)) = V since ϕ\phi is surjective. Ψ(Φ(U))=ϕ1(ϕ(U))=U\Psi(\Phi(U)) = \phi^{-1}(\phi(U)) = U since KUK \subseteq U. For normality: UGϕ(U)HU \trianglelefteq G \Leftrightarrow \phi(U) \trianglelefteq H (by conjugation argument). For indices: [G:U]=[H:ϕ(U)][G : U] = [H : \phi(U)] (since G/U=H/ϕ(U)|G/U| = |H/\phi(U)| via the induced map). \blacksquare

If you get this wrong, revise: Section 5.7, Theorem 5.6.

Problem 10. Find the conjugacy classes of S4S_4 and verify the class equation.

Solution

Solution. Conjugacy classes in SnS_n are determined by cycle type. The cycle types in S4S_4 and Their sizes:

  1. (1)(2)(3)(4)(1)(2)(3)(4). Identity. Size: 11.
  2. (a b)(a\ b). Transpositions. Count: (42)=6\binom{4}{2} = 6.
  3. (a b c)(a\ b\ c) — 3-cycles. Count: (43)2=8\binom{4}{3} \cdot 2 = 8.
  4. (a b)(c d)(a\ b)(c\ d). Double transpositions. Count: (42)2=3\frac{\binom{4}{2}}{2} = 3.
  5. (a b c d)(a\ b\ c\ d) — 4-cycles. Count: 3!=63! = 6.

Class equation: S4=1+6+8+3+6=24|S_4| = 1 + 6 + 8 + 3 + 6 = 24. ✓ Z(S4)={e}Z(S_4) = \{e\} So Z(S4)=1|Z(S_4)| = 1 And the sum of [S4:CG(xi)][S_4 : C_G(x_i)] over non-central classes is 6+8+3+6=236 + 8 + 3 + 6 = 23. \blacksquare

If you get this wrong, revise: Section 6.4, Theorem 6.4; Section 1.4.

Problem 11. Let GG act transitively on a set XX with X=p|X| = p (prime). Prove that GG has a subgroup of index pp.

Solution

Solution. Let xXx \in X. Since GG acts transitively, Orb(x)=X=p|\mathrm{Orb}(x)| = |X| = p. By the orbit-stabilizer theorem, [G:Stab(x)]=p[G : \mathrm{Stab}(x)] = p So Stab(x)\mathrm{Stab}(x) has index pp in GG. Since Stab(x)\mathrm{Stab}(x) is a subgroup (Proposition 6.1), we are done. \blacksquare

If you get this wrong, revise: Section 6.2, Theorem 6.2.

Problem 12. Find all Sylow 22-subgroups of S3S_3.

Solution

Solution. S3=6=23|S_3| = 6 = 2 \cdot 3. Sylow 22-subgroups have order 22. n21(mod2)n_2 \equiv 1 \pmod{2} and n2n_2 divides 33 So n2{1,3}n_2 \in \{1, 3\}. The elements of order 22 in S3S_3 are the three transpositions: (1 2)(1\ 2), (1 3)(1\ 3), (2 3)(2\ 3). Each generates a subgroup of order 22: (1 2)\langle (1\ 2) \rangle, (1 3)\langle (1\ 3) \rangle, (2 3)\langle (2\ 3) \rangle. So n2=3n_2 = 3 and the three Sylow 22-subgroups are these. \blacksquare

If you get this wrong, revise: Section 7.1, 7.6; Theorem 7.3.

Problem 13. Prove that every group of order 1515 is cyclic.

Solution

Solution. G=15=35|G| = 15 = 3 \cdot 5. By Sylow’s third theorem: n51(mod5)n_5 \equiv 1 \pmod{5} and n5n_5 divides 33 So n5=1n_5 = 1. n31(mod3)n_3 \equiv 1 \pmod{3} and n3n_3 divides 55 So n3=1n_3 = 1.

Both the Sylow 33-subgroup PZ/3ZP \cong \mathbb{Z}/3\mathbb{Z} and the Sylow 55-subgroup QZ/5ZQ \cong \mathbb{Z}/5\mathbb{Z} are normal. Since PQ={e}P \cap Q = \{e\} (their orders are coprime) And PQ=PQ/PQ=15=G|PQ| = |P||Q|/|P \cap Q| = 15 = |G|We have G=PQG = PQ. Since both are normal with trivial intersection, GP×QZ/3Z×Z/5ZZ/15ZG \cong P \times Q \cong \mathbb{Z}/3\mathbb{Z} \times \mathbb{Z}/5\mathbb{Z} \cong \mathbb{Z}/15\mathbb{Z}. \blacksquare

If you get this wrong, revise: Section 7.3, Proposition 7.4; Section 7.7, Proposition 7.6.

Problem 14. Let GG be a group of order 21=3721 = 3 \cdot 7. Show that GG has a normal Sylow 77-subgroup. Must GG be abelian?

Solution

Solution. n71(mod7)n_7 \equiv 1 \pmod{7} and n7n_7 divides 33. Since 7(31)7 \nmid (3 - 1)We must have n7=1n_7 = 1. So the Sylow 77-subgroup QZ/7ZQ \cong \mathbb{Z}/7\mathbb{Z} is normal.

n31(mod3)n_3 \equiv 1 \pmod{3} and n3n_3 divides 77 So n3{1,7}n_3 \in \{1, 7\}. If n3=1n_3 = 1Both Sylow subgroups are normal and GZ/21ZG \cong \mathbb{Z}/21\mathbb{Z} (abelian). If n3=7n_3 = 7, GG is a semidirect product Z/7ZZ/3Z\mathbb{Z}/7\mathbb{Z} \rtimes \mathbb{Z}/3\mathbb{Z} Which is non-abelian. This group exists: it is the unique non-abelian group of order 2121. So GG need not be abelian. \blacksquare

If you get this wrong, revise: Section 7.3, 7.7; Theorem 7.3.

Problem 15. Prove that (2)(2) is a prime ideal of Z\mathbb{Z} but (4)(4) is not prime.

Solution

Solution. By Theorem 9.3, (p)(p) is prime in Z\mathbb{Z} iff Z/(p)\mathbb{Z}/(p) is an integral domain. Z/(2)Z/2Z\mathbb{Z}/(2) \cong \mathbb{Z}/2\mathbb{Z} is a field, hence an integral domain, so (2)(2) is prime.

Z/(4)\mathbb{Z}/(4): we have [2][2]=[4]=[0][2][2] = [4] = [0] but [2][0][2] \neq [0]. So Z/(4)\mathbb{Z}/(4) has zero divisors and is not an integral domain. Therefore (4)(4) is not prime. \blacksquare

If you get this wrong, revise: Section 9.3, Theorem 9.3; Section 8.4.

Problem 16. Show that x2+1x^2 + 1 is irreducible in R[x]\mathbb{R}[x] but reducible in C[x]\mathbb{C}[x].

Solution

Solution. In R[x]\mathbb{R}[x]: suppose x2+1=(x+a)(x+b)x^2 + 1 = (x + a)(x + b) with a,bRa, b \in \mathbb{R}. Then a+b=0a + b = 0 and ab=1ab = 1 So a2=1-a^2 = 1Giving a2=1a^2 = -1Which has no real solution. Thus x2+1x^2 + 1 is irreducible in R[x]\mathbb{R}[x].

In C[x]\mathbb{C}[x]: x2+1=(x+i)(xi)x^2 + 1 = (x + i)(x - i). \blacksquare

If you get this wrong, revise: Section 10.2; Section 12.7, Fundamental Theorem of Algebra.

Problem 17. Use the Euclidean algorithm to find gcd(x32x+1,x21)\gcd(x^3 - 2x + 1, x^2 - 1) in Q[x]\mathbb{Q}[x].

Solution

Solution.

x32x+1=x(x21)+(x+1)x^3 - 2x + 1 = x(x^2 - 1) + (-x + 1)

x21=(x1)(x+1)+0x^2 - 1 = (-x - 1)(-x + 1) + 0

Since the last non-zero remainder is x+1-x + 1We have gcd(x32x+1,x21)=x1\gcd(x^3 - 2x + 1, x^2 - 1) = x - 1 (up to multiplication by a unit in Q[x]\mathbb{Q}[x]I.e., a non-zero constant). \blacksquare

If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 11.1.

Problem 18. Prove that Z[x]\mathbb{Z}[x] is a UFD but not a PID.

Solution

Solution. UFD: By Gauss’s lemma, since Z\mathbb{Z} is a UFD, Z[x]\mathbb{Z}[x] is a UFD.

Not a PID: The ideal I=(2,x)={2f+xg:f,gZ[x]}I = (2, x) = \{2f + xg : f, g \in \mathbb{Z}[x]\} is not principal. Suppose I=(h)I = (h) for some hZ[x]h \in \mathbb{Z}[x]. Then hh divides both 22 and xx. Since hh divides 2Z2 \in \mathbb{Z}, hh is a constant polynomial, say h=cZh = c \in \mathbb{Z}. Then (c)=(2,x)(c) = (2, x) So cc divides 22 and cc divides xxHence c=±1c = \pm 1. But (1)=Z[x](2,x)(1) = \mathbb{Z}[x] \neq (2, x) since 1(2,x)1 \notin (2, x) (every element of (2,x)(2, x) has even constant term). Contradiction. Therefore (2,x)(2, x) is not principal, and Z[x]\mathbb{Z}[x] is not a PID. \blacksquare

If you get this wrong, revise: Section 11.3, Theorem 11.3; Section 8.1.

Problem 19. Compute [Q(2,3):Q][\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}] and find the Galois group.

Solution

Solution. First, [Q(2):Q]=2[\mathbb{Q}(\sqrt{2}) : \mathbb{Q}] = 2 since x22x^2 - 2 is irreducible over Q\mathbb{Q} (by Eisenstein with p=2p = 2). Then 3Q(2)\sqrt{3} \notin \mathbb{Q}(\sqrt{2}) (if 3=a+b2\sqrt{3} = a + b\sqrt{2} With a,bQa, b \in \mathbb{Q}Squaring gives 3=a2+2b2+2ab23 = a^2 + 2b^2 + 2ab\sqrt{2}Forcing ab=0ab = 0 and leading to contradiction). So [Q(2,3):Q(2)]=2[\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}(\sqrt{2})] = 2.

By the tower law: [Q(2,3):Q]=22=4[\mathbb{Q}(\sqrt{2}, \sqrt{3}) : \mathbb{Q}] = 2 \cdot 2 = 4.

The Galois group consists of four automorphisms determined by their action on 2\sqrt{2} and 3\sqrt{3}: id\mathrm{id}: 22\sqrt{2} \mapsto \sqrt{2}, 33\sqrt{3} \mapsto \sqrt{3} σ\sigma: 22\sqrt{2} \mapsto -\sqrt{2}, 33\sqrt{3} \mapsto \sqrt{3} τ\tau: 22\sqrt{2} \mapsto \sqrt{2}, 33\sqrt{3} \mapsto -\sqrt{3} στ\sigma\tau: 22\sqrt{2} \mapsto -\sqrt{2}, 33\sqrt{3} \mapsto -\sqrt{3}

Since all non-identity elements have order 22, Gal(Q(2,3)/Q)V4\mathrm{Gal}(\mathbb{Q}(\sqrt{2}, \sqrt{3})/\mathbb{Q}) \cong V_4. \blacksquare

If you get this wrong, revise: Section 12.1, Proposition 12.1; Section 13.1.

Problem 20. Prove that a quotient ring R/IR/I is an integral domain if and only if II is a prime ideal.

Solution

Solution. (\Rightarrow) Suppose R/IR/I is an integral domain. Let abIab \in I. Then (a+I)(b+I)=ab+I=0+I(a + I)(b + I) = ab + I = 0 + I The zero element of R/IR/I. Since R/IR/I has no zero divisors, either a+I=0+Ia + I = 0 + I or b+I=0+Ib + I = 0 + I I.e., aIa \in I or bIb \in I. So II is prime.

(\Leftarrow) Suppose II is prime. R/IR/I is a commutative ring with unity (since RR is). If (a+I)(b+I)=0+I(a + I)(b + I) = 0 + I Then abIab \in I So aIa \in I or bIb \in I (since II is prime). Thus a+I=0+Ia + I = 0 + I or b+I=0+Ib + I = 0 + IMeaning R/IR/I has no zero divisors. Also 1+I0+I1 + I \neq 0 + I since IRI \neq R. Therefore R/IR/I is an integral domain. \blacksquare

If you get this wrong, revise: Section 9.2, 9.3, Theorem 9.3; Section 8.4.

Problem 21. Let GG be a finite group acting on a finite set XX. Prove Burnside’s lemma: The number of orbits equals 1GgGFix(g)\frac{1}{|G|} \sum_{g \in G} |\mathrm{Fix}(g)|.

Solution

Solution. Let S={(g,x)G×X:gx=x}S = \{(g, x) \in G \times X : g \cdot x = x\}. Count S|S| in two ways.

Grouping by gg: S=gG{xX:gx=x}=gGFix(g)|S| = \sum_{g \in G} |\{x \in X : g \cdot x = x\}| = \sum_{g \in G} |\mathrm{Fix}(g)|.

Grouping by xx: S=xXStab(x)|S| = \sum_{x \in X} |\mathrm{Stab}(x)|.

For each orbit O\mathcal{O}Every xOx \in \mathcal{O} has Stab(x)=G/O|\mathrm{Stab}(x)| = |G|/|\mathcal{O}| (by orbit-stabilizer). So xOStab(x)=OG/O=G\sum_{x \in \mathcal{O}} |\mathrm{Stab}(x)| = |\mathcal{O}| \cdot |G|/|\mathcal{O}| = |G|.

Summing over all orbits: S=G(number of orbits)|S| = |G| \cdot (\mathrm{number\ of\ orbits}).

Combining: gGFix(g)=G(number of orbits)\sum_{g \in G} |\mathrm{Fix}(g)| = |G| \cdot (\mathrm{number\ of\ orbits}). \blacksquare

If you get this wrong, revise: Section 6.3, Theorem 6.3.

Problem 22. Show that A5A_5 is the smallest non-abelian simple group.

Solution

Solution. We show that every non-abelian group of order n<60n < 60 is not simple.

  • Order 66: S3S_3 has normal subgroup A3A_3.
  • Order 88: all groups of order p3p^3 have non-trivial center (Theorem 6.5).
  • Order 1010: n5=1n_5 = 1 by Sylow.
  • Order 1212: n3=1n_3 = 1 or 44. If n3=4n_3 = 4One checks A4A_4 has the normal Klein subgroup V4V_4.
  • Order 1414: n7=1n_7 = 1 by Sylow.
  • Order 1515: n5=1n_5 = 1, n3=1n_3 = 1 by Sylow.
  • Order 1818: n3=1n_3 = 1 by Sylow (since n31(mod3)n_3 \equiv 1 \pmod{3} and n3n_3 divides 22).
  • Order 2020: n5=1n_5 = 1 by Sylow (since n51(mod5)n_5 \equiv 1 \pmod{5} and n5n_5 divides 44).
  • Order 2121: n7=1n_7 = 1 by Sylow.
  • Order 2222: n11=1n_{11} = 1 by Sylow.
  • Order 2424: if GG is simple, n23n_2 \geq 3 and n34n_3 \geq 4. Counting elements gives a contradiction.
  • Order 2626: n13=1n_{13} = 1.
  • Order 2727: pp-group has non-trivial center.
  • Order 2828: n7=1n_7 = 1 by Sylow (since n71(mod7)n_7 \equiv 1 \pmod{7} and n7n_7 divides 44).
  • Order 3030: n5=1n_5 = 1 or n3=1n_3 = 1 by counting arguments (see Section 7.6).
  • Order 3333: n11=1n_{11} = 1.
  • Order 3434: n17=1n_{17} = 1.
  • Order 3535: n7=1n_7 = 1, n5=1n_5 = 1.
  • Order 3636: n3=1n_3 = 1 or 44. If n3=4n_3 = 4The action on Sylow 33-subgroups gives a homomorphism GS4G \to S_4 whose kernel is a proper normal subgroup.
  • Orders 38,39,40,42,44,46,48,50,51,52,54,55,56,57,5838, 39, 40, 42, 44, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58: similar arguments apply. For each, either a Sylow subgroup is unique, or counting arguments force a normal subgroup.

A5A_5 has order 6060 and is simple (Proposition 14.2). Therefore it is the smallest non-abelian simple group. \blacksquare

If you get this wrong, revise: Section 7.7, Proposition 7.7; Section 14.3, Proposition 14.2.

Problem 23. Prove that the quotient ring Z[x]/(x2+1)\mathbb{Z}[x]/(x^2 + 1) is isomorphic to Z[i]\mathbb{Z}[i].

Solution

Solution. Define ϕ:Z[x]Z[i]\phi : \mathbb{Z}[x] \to \mathbb{Z}[i] by ϕ(f(x))=f(i)\phi(f(x)) = f(i). This is a ring Homomorphism (evaluation at ii). It is surjective: any a+biZ[i]a + bi \in \mathbb{Z}[i] equals ϕ(a+bx)\phi(a + bx).

The kernel consists of polynomials fZ[x]f \in \mathbb{Z}[x] with f(i)=0f(i) = 0. Since x2+1x^2 + 1 is the minimal Polynomial of ii over Q\mathbb{Q}Every such ff is divisible by x2+1x^2 + 1 in Q[x]\mathbb{Q}[x]. By Gauss’s lemma, ff is divisible by x2+1x^2 + 1 in Z[x]\mathbb{Z}[x] as well. So ker(ϕ)=(x2+1)\ker(\phi) = (x^2 + 1).

By the ring isomorphism theorem, Z[x]/(x2+1)Z[i]\mathbb{Z}[x]/(x^2 + 1) \cong \mathbb{Z}[i]. \blacksquare

If you get this wrong, revise: Section 9.2, Theorem 9.2; Section 8.6.

Problem 24. Let FF be a field and let fF[x]f \in F[x] be irreducible of degree nn. Show that the Quotient ring F[x]/(f)F[x]/(f) is an nn-dimensional vector space over FF with basis {1,xˉ,xˉ2,,xˉn1}\{1, \bar{x}, \bar{x}^2, \ldots, \bar{x}^{n-1}\}.

Solution

Solution. Since ff is irreducible and F[x]F[x] is a PID, (f)(f) is a maximal ideal, so E=F[x]/(f)E = F[x]/(f) is a field. Write xˉ=x+(f)E\bar{x} = x + (f) \in E. Every element of EE is a coset g(x)+(f)g(x) + (f) for some gF[x]g \in F[x].

By the division algorithm, g=qf+rg = qf + r where deg(r)<n\deg(r) \lt n or r=0r = 0. Then g+(f)=r+(f)g + (f) = r + (f) So every element of EE can be written as r(xˉ)=a0+a1xˉ++an1xˉn1r(\bar{x}) = a_0 + a_1\bar{x} + \cdots + a_{n-1}\bar{x}^{n-1} With aiFa_i \in F. This representation is unique: if i=0n1aixˉi=i=0n1bixˉi\sum_{i=0}^{n-1} a_i \bar{x}^i = \sum_{i=0}^{n-1} b_i \bar{x}^i Then (aibi)xˉi=0\sum (a_i - b_i)\bar{x}^i = 0 So (aibi)xi(f)\sum (a_i - b_i)x^i \in (f)Meaning ff divides a polynomial Of degree <n=deg(f)\lt n = \deg(f)Which forces all aibi=0a_i - b_i = 0.

Therefore {1,xˉ,,xˉn1}\{1, \bar{x}, \ldots, \bar{x}^{n-1}\} is a basis for EE over FF And [E:F]=n[E : F] = n. \blacksquare

If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 12.3, Theorem 12.4.

Problem 25. Classify all finite fields of order pnp^n for p=2p = 2 and n4n \leq 4.

Solution

Solution. By Theorem 12.5, for each prime power there is a unique (up to isomorphism) finite field.

F2\mathbb{F}_2 (22 elements): {0,1}\{0, 1\}. Arithmetic modulo 22.

F4\mathbb{F}_4 (44 elements): F2[x]/(x2+x+1)\mathbb{F}_2[x]/(x^2 + x + 1). Elements: {0,1,α,1+α}\{0, 1, \alpha, 1+\alpha\} where α2=α+1\alpha^2 = \alpha + 1. Multiplicative group is cyclic of order 33: α3=1\alpha^3 = 1.

F8\mathbb{F}_8 (88 elements): F2[x]/(x3+x+1)\mathbb{F}_2[x]/(x^3 + x + 1). Elements: {a+bα+cα2:a,b,cF2}\{a + b\alpha + c\alpha^2 : a, b, c \in \mathbb{F}_2\} Where α3=α+1\alpha^3 = \alpha + 1. Multiplicative group is cyclic of order 77.

F16\mathbb{F}_{16} (1616 elements): F2[x]/(x4+x+1)\mathbb{F}_2[x]/(x^4 + x + 1). Elements: {a0+a1α+a2α2+a3α3:aiF2}\{a_0 + a_1\alpha + a_2\alpha^2 + a_3\alpha^3 : a_i \in \mathbb{F}_2\} Where α4=α+1\alpha^4 = \alpha + 1. Multiplicative group is cyclic of order 1515.

Note: F4\mathbb{F}_4 is NOT a subfield of F8\mathbb{F}_8 (since 44 does not divide 88), but F4\mathbb{F}_4 IS A subfield of F16\mathbb{F}_{16} (since 44 divides 1616). More generally, FpmFpn\mathbb{F}_{p^m} \subseteq \mathbb{F}_{p^n} If and only if mm divides nn. \blacksquare

If you get this wrong, revise: Section 12.4, Theorem 12.5; Section 12.6.

flowchart TD
A[18_Problem Set] --> B[Key Concepts]
A --> C[Core Principles]
A --> D[Practical Applications]
B --> E[Fundamental definitions]
C --> F[Design patterns]
D --> G[Real-world usage]

Abstract algebra is the study of symmetry made precise. Groups capture the structure of symmetries, rings capture the structure of arithmetic, and fields combine both. The Sylow theorems exploit prime factorisation to pin down the internal structure of finite groups, much like prime factorisation reveals the building blocks of integers. Galois theory connects field extensions to group theory, explaining why polynomial equations of degree five or higher cannot be solved by radicals. The recurring theme is that quotient structures collapse information in controlled ways, revealing hidden patterns.

Mistake 1: Forgetting that the order formula for elements requires gcd computation When computing the order of gkg^k in a group, students often write gk=g/k|g^k| = |g|/k instead of the correct gk=g/gcd(g,k)|g^k| = |g|/\gcd(|g|, k). The correct formula requires dividing by the greatest common divisor, not kk directly. Always verify by checking that (gk)n/d=e(g^k)^{n/d} = e where d=gcd(n,k)d = \gcd(n, k).

Mistake 2: Confusing conjugacy classes with cosets Conjugacy classes partition a group by the equivalence relation aba \sim b iff b=gag1b = gag^{-1} for some gg, while cosets partition a group by a subgroup. The class equation involves conjugacy classes, not cosets, and the size of each class divides the group order by the orbit-stabilizer theorem.

Mistake 3: Assuming all groups of a given order are isomorphic Groups of order p2p^2 (for prime pp) are always abelian, but groups of order p3p^3 are not all isomorphic. For example, there are two groups of order 8 that are non-abelian: D4D_4 and Q8Q_8. Always check whether the group is abelian before assuming a unique structure.