GT Sheet 2 Solutions
GT Sheet 2 Solutions
Q1. Let K be a finite field. Show that there exists a positive integer d and a prime number
p such that |K| = pd . Hint: what is the prime subfield of K?
Solution. The field K contains the image of Z by the unique map of rings φ : Z → K
sending 1Z to 1K . The image of φ is a domain (since it is contained in a field) and hence
ker(φ) is a prime ideal. Hence the image of φ is isomorphic to Fp = Z/pZp for some
prime number p (because the prime ideals of Z are all of the of the form (p) for some
prime number p - see Rings and Modules). Hence we may view K as a Fp -vector space.
Furthermore, K is a finite-dimensional Fp -vector space since it is a finite set. We conclude
that there is an isomorphism of Fp -vector spaces K ' Fdp for some d ≥ 1. Hence we have
#K = pd for some d ≥ 1..
Q2. Factorise f (x) = x6 + x3 + 1 into irreducible factors over K for each of K =
F2 , F3 , F19 , Q.
Calculate the formal derivative Df . Over which of these fields K do the irreducible
factors of f have distinct roots in any splitting field for f ?
Solution.
- over F2 : irreducible
Check first that f (0), f (1) 6= 0 (mod 2). We deduce that if f (x) is reducible, it must have
a factor of degree ≤ 3 (by Q4 (d) in sheet 1). Now check that f (x) is not divisible by
a3 x3 + a2 x2 + a1 x + a0 when ai = 0, 1 (mod 2).
- over F3 : f (x) = (x + 2)6 .
Find the root −2 and compute that D(f ) = 6x5 + 3x2 = 0 (mod 2) in F3 [x]. Using Q4 (e) in
sheet 1 we deduce that (x + 2)2 divides f (x) and we compute
Now g(x) also has the root −2 and D(g) = 4x3 + 2, so that D(g)(−2) = 0. We conclude
similarly that g(x) is divisible by (x + 2)2 . Finally, we compute g(x)/(x + 2)4 = (x + 2)2 so
that f (x) = (x + 2)6 .
- over F19 : one checks by hand that f (x) has six distinct roots in F19 . This gives
- over Q: f (x) is irreducible because f (x) is monic, has coefficients in Z and is irreducible
over F2 (apply Gauss’s lemma - Lemma 2.12 in the notes).
1
The formal derivative of f (x) is 6x5 + 3x2 = x2 (6x3 + 3).
For the rest of the exercise, we shall need the
Lemma. Let Fp be a finite field and let P (x) ∈ Fp [x] be an irreducible polynomial. Then
P (x) is separable. In particular, any finite extension of a finite field is separable.
Proof. Let F := Fp [x]/(P (x)). Let α := x (mod P (x)) ∈ F. The map Frob : F → F such
that Frob(y) = y p is a map of rings (see Sheet 1, solution to Q6). The map Frob is injective
because if y p = 0 then y = 0 (since F is a field, in particular a domain). The map Frob is
also surjective, because its image has the same cardinality as F (because Frob is injective).
Hence Frob defines a permutation of the elements of F and in particular Frob has a finite
order c in the group of permutations of F (because this group is finite). In particular
c c
αp = α. Since P (x) is the minimal polynomial of α, we thus have P (x)|xp − x. Now
c c c c
xp − x is a separable polynomial, because (xp − x, D(xp − x)) = (xp − x, −1) = (1).
Hence P (x) is also separable.
From the lemma we conclude that over F2 , F3 , F19 , the irreducible factors of f (x) have no
repeated roots in any splitting field of f (x).
Any finite extension of Q is separable (see before Def. 3.7 in the notes) so the same is true
over Q.
Q3. Show that if f is a polynomial of degree n over K, then its splitting field has degree
less than or equal to n! over K.
Solution. By induction on n. The statement clearly holds if n = 1. Let P (x) be an
irreducible factor of f (x) and L := K[x]/(P (x)). Let α := x (mod P (x)) ∈ L. Let
Q(x) = f (x)/(x − α) ∈ L[x]. Let M be a splitting field of Q(x) over L. Then M is a
splitting field of f (x) because f (x) splits over M and is generated over K by the roots of
f (x) in M . Applying the inductive hypothesis, we see that [M : L] ≤ (n − 1)!. Applying
the tower law, we see that [M : K] ≤ n!.
Note that the solution of Q3 follows the construction of the splitting field given in Th.
3.13 (a) in the notes.
Q4. Find the degrees of the splitting fields of the following polynomials.
(a) x3 − 1 over Q;
(b) x3 − 2 over Q;
Solution.
2
(a) degree 2;
we have x3 − 1 = (x − 1)(x2 + x + 1), so the degree of the splitting field of x3 − 1 is the
√ √
degree of the splitting field of x2 + x + 1, which is generated by −3 = i 3 and thus has
degree 2.
Note. The splitting field of x3 − 1 over Q is an example of a cyclotomic field. See section
5.1 in the notes.
(b) degree 6;
the splitting field is Q(21/3 , j) where j is a primitive cube root of 1. Indeed the roots of
x3 − 2 in C are 21/3 , j21/3 , j 2 21/3 and so the splitting field of x3 − 2 is
in F11 [x] so x5 − 1 also splits in (F11 (t))[x]. The roots of x5 − t in L are all of the form
x0 ·(root of x5 − 1) (why?) so x5 −t splits in the simple subfield (F11 (t))(x0 ) of L. Therefore
(F11 (t))(x0 ) = L.
Now x5 − t is irreducible over F11 (t). To see this suppose for contradiction that P (x) is an
irreducible factor of x5 − t, which is of degree d = 2 (note that d = 1 is impossible because
t has no 5th root in F11 (t) (why?)). By the above, the roots of P (x) in L are of the form x0 l
and x0 m, where l and m are roots of x5 − 1. So
3
Note. This is an example of a Kummer extension. See section 5.2 in the notes.
Q5. Let L = Q(21/3 , 31/4 ). Compute the degree of L over Q.
Solution. [L : Q] = 5;
notice that L contains Q(21/3 ), which is of degree 3 over Q (because x3 −2 is irreducible by
Eisenstein’s criterion). The field L also contains Q(31/4 ), which is of degree 4 over Q by a
similar reasoning. Hence, by the tower law, the degree of Q(21/3 , 31/4 ) over Q is divisible
by 3 and by 4, hence by 12. On the hand, the degree of Q(21/3 , 31/4 ) over Q is smaller than
12, because the degree of Q(21/3 , 31/4 ) over Q(21/3 ) is smaller or equal to 4. Hence the
[Q(21/3 , 31/4 ) : Q] = 12.
Q6. Recall that α ∈ C is algebraic over Q if α satisfies a (monic) polynomial over Q,
equivalently if [Q(α) : Q] < ∞. Let
(a) Show that A is the union of all the subfields L of C which are finite extensions of Q.
(b) Prove that A is a subfield of C. [Hint: if α, β ∈ A, consider the extension Q(α, β) : Q.]
Solution.
(a) We have [Q(α) : Q] = deg(mα (x)). Hence α is contained in a finite extension of Q
(contained in C). On the other hand, let L|Q be a finite extension (with L ⊆ C) and α ∈ L.
Consider the map of rings φ : Q[x] → L, such that
Xd d
X
k
φ( ak x ) = ak α k .
k=0 k=0
Then the kernel of φ is not (0), for otherwise the finite-dimensional Q-vector space L
would contain a vector space isomorphic to Q[x], which is infinite-dimensional. Now let
P (x) ∈ ker(φ) with P (x) 6= 0. Then P (α) = 0 and so α is algebraic over Q.
(b) Let α, β ∈ A. By the tower law, the subfield Q(α, β) = Q(α)(β) is finite over Q and
thus Q(α, β) ⊆ A. Since, αβ, α−1 , α + β ∈ Q(α, β) ⊆ A, we see that A is a field.
√
(c) Let p be a prime number and n ≥ 1. Let α = 5 p. Then Q[x]/(xn − p) ' Q(α) is a finite
extension of degree n of Q because xn − p is irreducible (by Eisenstein’s criterion), and
Q(α) ⊆ A by (a). Since n is arbitrary, A cannot be finite over Q.
4
Note. One usually writes Q̄ for A. One can show that A is algebraically closed (ie every
polynomial with coefficients in A splits).
Q7. Which of the following fields are normal extensions of Q?
√ √
(a) Q( 2, 3);
(b) Q(21/4 );
Solution.
√ √ √ √
(a) Q( 2, 3) is normal over Q; indeed, Q( 2, 3) is the splitting field of (x2 − 2)(x2 − 3)
(apply Th. 3.16 in the notes).
(b) Q(21/4 ) is not normal over Q. Indeed, the minimal polynomial of 21/4 is x4 −2 (because
x4 − 2 annihilates 21/4 and x4 − 2 is an irreducible polynomial by Eisenstein’s criterion).
On the other hand x4 − 2 has the complex root i21/2 , which does not lie in Q(21/4 ) ⊆ R.
(c) Q(α) is normal over Q.
To prove this, we shall show that Q(α) is the splitting field of P (x) = x4 − 10x2 + 1.
This together with Th. 3.16 in the notes implies that Q(α) is normal over Q. Now note
that P (−α) = 0 and also that P (±1/α) = 0 (divide α4 − 10α2 + 1 by α4 ). The elements
α, −α, 1/α, −1/α are all distinct (why?) so that P (x) = (x − α)(x + α)(x − 1/α)(x + 1/α).
Note. A polynomial P (x) of degree d such that P (x) = xd P (1/x) is called palindromic.
The polynomial x4 − 10x2 + 1 is palindromic.