Algebra Exam – Spring 2006

Alexander J. Wertheim
Last Updated: August 27, 2016

Contents
1 Groups 2
1.1 Problem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Problem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Problem 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 Rings 3
2.1 Problem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Problem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.3 Problem 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

3 Fields 4
3.1 Problem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3.2 Problem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.3 Problem 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

1
1 Groups
1.1 Problem 1
This is a well-known problem, answered by Frattini’s argument. Let G be a finite group, K a
normal subgroup of G and P a Sylow p-subgroup of K. Let g ∈ G, and let Q = gP g −1 . Since
K is a normal subgroup of G, gP g −1 ⊂ gKg −1 = K, and |P | = |Q| implies that Q is a Sylow
p-subgroup of K. By the second Sylow theorem, P and Q are conjugate subgroups of K, so
there exists k ∈ K such that P = kQk −1 . Then P = kQk −1 = kgP g −1 k −1 = kgP (kg)−1 , so
kg ∈ NG (P ). Then in particular, g ∈ hk −1 iNG (P ) ⊂ KNG (P ), so G ⊆ KNG (P ).

1.2 Problem 2
(a) Let GL2 (F4 ) be the set of 2 × 2 invertible matrices with coefficients in F4 , the field
of 4 elements. A 2 × 2 matrix with entries in F4 belongs to GL2 (F4 ) if and only if
its columns are linearly independent. To determine | GL2 (F4 )|, therefore, it suffices to
count the number of 2 × 2 matrices over F4 with linearly independent columns. The only
constraint on the first column is that both entries cannot be zero, yielding 42 − 1 = 15
possible choices for the first column. The second column cannot be an F4 -multiple of the
first column, and there are 4 F4 multiples of the first column, so there are 42 − 4 = 12
choices for the second column. Hence, | GL2 (F4 )| = 15 · 12 = 180.
Now, consider the map det : GL2 (F4 ) → F4× . Since the determinant is multiplicative,
this is a surjective group homomorphism with kernel SL2 (F4 ). By the first isomorphism
theorem for groups, GL2 (F4 )/ SL2 (F4 ) ∼ = F4× , i.e. |GL2 (F4 )|/| SL2 (F4 )| = |F4× | = 3.
Hence,
| GL2 (F4 )| 180
| SL2 (F4 )| = = = 60
3 3
(b) Let α be a root of the irreducible polynomial X 2 + X + 1 over F2 , so that F4 = F2 (α).
For any fixed v ∈ (F4 )2 , let Γv = {λv | λ ∈ F4 }, i.e. Γv is the linear subspace of (F4 )2
spanned by v. Let Ω = {Γv | v ∈ F4 }, and note that Ω consists of the following 5
elements:
{(0, 0), (0, 1), (0, α), (0, α+1)} {(0, 0), (1, 0), (α, 0), (α+1, 0)} {(0, 0), (1, 1), (α, α), (α+1, α+1)}
{(0, 0), (1, α), (α, α + 1), (α + 1, 1)} {(0, 0), (1, α + 1), (α, 1), (α + 1, α)}
Note that SL2 (F4 ) acts on Ω by sending Γv to ΓAvT , whence we obtain a group 
homomor-

x y
phism Φ : SL2 (F4 ) → S5 . We claim that Φ is injective. Indeed, suppose A = ∈
z w
ker(ϕ). Then A fixes Γ(0,1) , so A(0, 1)T ∈ Γ(0,1) , i.e.
    
x y 0 y
= ∈ Γ(0,1)
z w 1 w
so y = 0. Similarly, A fixes Γ(1,0) , so A(1, 0)T ∈ Γ(1,0) , i.e.
    
x 0 1 x
= ∈ Γ(1,0)
z w 0 z

2
 so z = 0. Finally, since A fixes Γ(1,1) , A(1, 1)T ∈ Γ(1,1) , i.e.
    
x 0 1 x
= ∈ Γ(1,1)
0 w 1 w

so x = w. As A ∈ SL2 (F4 ), det(A) = w2 = 1, so w is a root of X 2 − 1 = (X − 1)2 over

F4 , whence w = 1. Hence, A = I, so ker(Φ) is trivial, and Φ is an injection, so SL2 (F4 )
is isomorphic to a subgroup of S5 of order 60. If A5 is the unique subgroup of S5 of order
60, this implies SL2 (F4 ) ∼
= A5 , as desired. Indeed, this is the case: any subgroup of S5
of order 60 has index 2, and is therefore normal, hence the kernel of a surjective map
S5 → Z/2Z. Since S5 is generated by (1, 2), (1, 2, 3, 4, 5), any morphism S5 → Z/2Z is
determined by the images of these elements. Since (1, 2, 3, 4, 5) must be mapped to an
element of order dividing 5 in Z/2Z, it can only be sent to [0]2 . On the other hand,
(1, 2) can be sent to either [0]2 or [1]2 , and the map is surjective only in the latter case,
so this proves the claim.

1.3 Problem 3
Let G be a group of order 2000, and suppose P and P 0 are distinct Sylow 5-subgroups of G.

(a) Let I = P ∩P 0 . Since I is a proper subgroup of (say) P , Lagrange implies |I| | |P | = 125,
0|
so |I| ∈ {1, 5, 25}. As P P 0 is a subset of G, the formula |P P 0 | = |P |·|P
|I|
and the inequality
|P |·|P 0 | 1252
|P P 0 | 6 |G| together imply |I| > |G|
= 2000
> 5, so |I| = 25.

(b) Note that [P : I] = [P : I 0 ] = 5, the minimal prime dividing |P | = |P 0 |, so S04.G3(b)

implies I is a normal subgroup of both P and P 0 . Hence, P P 0 ⊂ NG (I). From part (a)
|P | · |P 0 | 1252
|P P 0 | = = = 625
|I| 25
so |NG (I)| > 625. Since NG (I) is a subgroup of G, NG (I) divides |G| = 2000 by
Lagrange, so NG (I) = 1000 or NG (I) = 2000, whence [G : NG (I)] 6 2.

2 Rings
2.1 Problem 1
Let D be an integral domain, and suppose D[X] is a principal ideal domain. Then D[X]/hXi ∼ =
D is a domain, so hXi is a prime ideal of D[X]. Since D[X] is a PID, prime ideals are max-
imal, so D[X]/hXi ∼ = D is a field. Alternatively, one can approach this problem as follows:
take a nonzero element d ∈ D, and show the ideal hd, Xi ⊂ D[X] must be the whole ring.

2.2 Problem 2
Let R be a commutative Noetherian ring with unit, and let M be a finitely generated R-
module. Since the direct sum a collection of Noetherian modules is Noetherian and R is

3
Noetherian as a left R-module, Rn is also a Noetherian R-module. Since M is finitely
generated, there exists a surjection ϕ : Rn → M , whence M ∼
= Rn / ker(ϕ). Every quotient
of a Noetherian module is Noetherian, so this implies M is Noetherian. Every surjective
endomorphism of a Noetherian module over a commutative ring is an isomorphism: this was
proved in S04.R1.

2.3 Problem 3
Let R be a commutative ring with unit, and let m be a maximal ideal of R.
(a) We prove the contrapositive. Let I1 , . . . , In ⊂ R be ideals, and suppose m does not
contain Ij for any j = 1,Q. . . , n. Then for each j = 1, . . . , n, there exists xj ∈ Ij such
/ m. Then x := nj=1 xj ∈ I1 I2 · · · Ij , but x ∈
that xj ∈ / m, since m is a prime ideal of R.
Hence, I1 I2 · · · In is not contained in m.
(b) See W05.R2.

3 Fields
3.1 Problem 1
(a) Let f (X) = X 4 − 2 ∈ Q[X]. Note f is irreducible over Q by Eisenstein at 2, and over
C, f splits as
3
Y √
(X − ik 2) ∈ C[X]
4
f (X) =
i=0
√
4
√ √ √ √
The
√ splitting field K of f over Q is therefore Q(
√ 2, i 4 2, − 4 2, −i 4 2) = Q(i, 4 2). Since
Q( 4 2) ⊂ R, X 2 + 1 is irreducible over Q( 4 2), so multiplicativity of field extension
degree shows
√
4
√4
√4
√
4
[Q(i, 2) : Q] = [Q(i, 2) : Q( 2)][Q( 2) : Q] = 2 · 4 = 8

(b) Observe
√ that any automorphism
√ of K fixing Q is determined by its values on the gener-
ators 4 2, i. Further, 4 2 must be sent to a root of X 4 − 2, and likewise i must be sent
to a root of X 2 + 1. There are four possible choices for the first assignment, and two
possible choices for the second, so there are a maximum of 2 · 4 = 8 automorphisms of
K over Q. From part (a), G := Gal(K/Q) has order 8, so each of these assignments
must yield an automorphism of K over Q. In particular, G is generated by σ, τ defined
on generators by √ √
4 4
σ( 2) = i 2, σ(i) = i
√
4
√4
τ ( 2) = 2, τ (i) = −i
√ √
Since σ 3 sends 4 2 to −i 4 2 and i to i,
√ √ √ √ √
σ(τ ( 2)) = σ( 2) = i 2 = τ (−i 2) = τ (σ 3 ( 2))
4 4 4 4 4

σ(τ (i)) = σ(−i) = −i = τ (i) = τ (σ 3 (i))

whence στ = τ σ 3 . Thus, G = hσ, τ | σ 4 = τ 2 = 1, στ = τ σ 3 i ∼
= D8 .

4
3.2 Problem 2
Let F be a finite field with q elements.

(a) Consider the group endomorphism ϕ : F × → F × given by x 7→ x2 . Note that the image
of ϕ consists of the nonzero squares in F . The kernel of ϕ consists of α ∈ F such that
α2 = 1, i.e. roots of the polynomial X 2 − 1 over F , which has either one root (1) if
char(F ) = 2, or two solutions (±1) if char(F ) 6= 2. Then Im(ϕ) ∼ = F × / ker(ϕ) implies
(
q−1
|F × | 2
if char(F ) 6= 2
| Im(ϕ)| = =
| ker(ϕ)| q − 1 if char(F )

Since 0 is trivially a square in F , this means there are q − 1 + 1 = q squares in F if

char(F ) = 2, and (q − 1)/2 + 1 = (q + 1)/2 > q/2 squares in F if char(F ) 6= 2.

(b) Let S be the set of squares in F , and for any fixed α in F , let Sα = {α − s | s ∈ S}.
The map S → Sα sending s to α − s is manifestly a bijection, so |S| = |Sα |. Since
2|S| > |F | by part (a), S ∩ Sα must be nonempty, whence there exist x, y ∈ F such that
α − x2 = y 2 , i.e. α = x2 + y 2 . Since α was arbitrary, this proves the claim.

3.3 Problem 3
Let K be a finite (nontrivial) extension of a field F with no proper intermediate fields.

(a) Suppose K/F is normal, and let Ksep denote the maximal separable subextension of
K over F . Since we have a tower of fields F ⊂ Ksep ⊂ K, the hypothesis on K
implies either (1) Ksep = K or (2) Ksep = F . In case (1), K/F is separable, thus
Galois, and the fundamental theorem of Galois theory implies that Gal(K/F ) has no
proper subgroups. Hence, Gal(K/F ) must be cyclic of order p for some prime p, so
[K : F ] = | Gal(K/F )| = p.
In case (2), Ksep = F implies K is purely inseparable over F . Thus char(F ) = p for
some prime p, and [K : F ] = pk for some k ∈ N. For any x ∈ K \ F , there exists
n n−1
n ∈ N such that xp ∈ F and y := xp / F . Then y p ∈ F , and F ( F (y) ⊆ K,
∈
whence the condition on the intermediate fields between F and K implies F (y) = K, so
[K : F ] = [F (y) : F ] = p.

(b) The idea here is to find a Galois extension whose Galois group has a maximal subgroup
of composite index: here is one example. Fix n ∈ N composite, and let K/F be a
Galois extension with Galois group Sn (examples are furnished, e.g., by Artin’s theorem:
an explicit example is given by Q(X1 , . . . , Xn )/Q(s1 , . . . , sn ), where s1 , . . . , sn are the
elementary symmetric functions in the variables X1 , . . . , Xn ). The subgroup Sn−1 ⊂ Sn is
maximal of index n, so there are no subgroups of Sn between Sn−1 and Sn in the subgroup
lattice of Sn . Correspondingly, via the fundamental theorem of Galois theory, there are
no subfields between K and the fixed field K Sn−1 , and [K : K Sn−1 ] = [Sn : Sn−1 ] = n,
which is composite by construction.