Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
254 views19 pages

Fields

The document contains solutions to problems on an algebra qualifying exam. It discusses several problems involving fields, field extensions, Galois theory, and the Galois group of a polynomial. Specifically: - It proves that every algebraic field extension is balanced, and gives an example of a non-algebraic balanced extension. - It finds the Galois group and number of Galois subextensions for the splitting field of the polynomial x4 - 2x2 - 2 over Q. - It discusses the factorization of a polynomial over a normal field extension.

Uploaded by

zelihaha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
254 views19 pages

Fields

The document contains solutions to problems on an algebra qualifying exam. It discusses several problems involving fields, field extensions, Galois theory, and the Galois group of a polynomial. Specifically: - It proves that every algebraic field extension is balanced, and gives an example of a non-algebraic balanced extension. - It finds the Galois group and number of Galois subextensions for the splitting field of the polynomial x4 - 2x2 - 2 over Q. - It discusses the factorization of a polynomial over a normal field extension.

Uploaded by

zelihaha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Algebra Qual Solutions September 12, 2009

UCLA ALGEBRA QUALIFYING EXAM


Solutions
JED YANG
F. Fields
Errors. We exclude trivial extensions in Qual Problem F6s3 and Qual Problem
F3f3.
F9s1.
F9s2.
F9s3.
F8f1. Let L/F be a cubic (of degree 3) eld extension of characteristic zero. Prove
that there is an element a F and a cubic eld extension L
0
of the eld F
0
= Q(a)
such that L is the composite FL
0
of F and L
0
over F
0
.
Proof. Pick b LF, which is necessarily of degree 3 over F. Let P be its minimal
polynomial. Recall that the disciminant D of P is a square in F, or else F(b)
blah blah blah, oops. We claim that there is some a F without cubic root NOT
(necessarily) TRUE
F8f2. A eld extension L/F is said to be balanced if every eld homomorphism
L L over F is an isomorphism.
(a) Prove that every algebraic (possibly innite) eld extension is balanced.
Proof. Let L/F be an algebraic extension. Let f : L L be a homomor-
phism xing F. Recall that eld homomorphisms are always injective, it
remains to show that it is surjective. Let a L. As L/F is algebraic, there
exists a
1
, . . . , a
d
F such that a satisfy p(x) = x
d
+a
1
x
d1
+. . . +a
d
. Let
S = s L : p(s) = 0. As f is a homomorphism xing the coecients of
the polynomial p(x), if s S, then f(s) S as well. Thus we may consider
f : S S as a set map. Since it is still injective, as [S[ d is nite, it
is also surjective. Thus a is in the image of f, but as a is arbitrary, we are
done.
(b) Give an example of a balanced non-algebraic eld extension.
Proof. Consider R/Q. The number of algebraic numbers over Q is count-
able, so R/Q is non-algebraic. By Qual Problem F5w1, if a homomorphism
xes Q, then it xes R. Thus the only eld homomorphism of R over Q is
the identity, which is an isomorphism.
September 12, 2009 Yang 2
F8f3. Let p be a prime integer and F a eld such that the degree of every nontrivial
nite eld extension of F is divisible by p. Prove that for any ntie eld extension
L/F, there exists a tower of eld extensions F = F
0
F
1
. . . F
n
= L such
that [F
i+1
: F
i
] = p for any i = 0, . . . , n 1.
Proof.
F8s1. Consider the polynomial P(x) = x
5
4x + 2 in Q[x].
(a) Show that P is irreducible and has 3 real roots and 2 complex ones.
Proof. The polynomial P is irreducible by Eisenstein. By Descartes rule of
signs, P has 2 or 0 positive roots and 1 negative root. Now since P(0) = 2,
P(1) = 1, and P(2) = 26, we conclude that there are two positive roots,
in (0, 1) and (1, 2), respectively. We conclude that P has 3 real roots and 2
complex ones.
(b) Show that the Galois group of P is S
5
.
Proof. Let G be the Galois group, and as usual, consider it a subgroup of
S
5
. Since there are precisely two complex roots, complex conjugation gives
a transposition in G. Since P is irreducible, adjoining one root gives an
extension of degree 5, thus 5 [ [G[ and there is an element of order 5 by
Cauchy. By Qual Problem G8s1, G = S
5
.
F8s2. Let
n
= exp(2i/n) be a primitive n
th
root of unity. Let F
n
= Q(
n
), and
d
n
= [F
n
: Q].
(a) Let n = 6. Find an irreducible polynomial of degree d
6
in Q[x] whose roots
generate F
6
.
Proof. Recall that d
n
= (n), where is the Euler function. Recall that
x
n
1 =

n
k=1
(x
k
n
). Let the cyclotomic polynomial be dened as

n
(x) =

gcd(j,n)=1
(x
j
n
). Since
n/d
n
is a primitive d
th
root of unity for
d [ n, we conclude that

d|n

d
(x) = x
n
1. Notice that F
n
is the splitting
eld of
n
(x). Let be a root of
n
(x). Since generate F
n
, the minimal
polynomial of has degree d
n
, hence is
n
(x). Thus
6
(x) is an irreducible
polynomial of degree d
6
that we are looking for.
For p a prime, x
p
1 =
1
(x)
p
(x), where
1
(x) = x 1. This gives

p
(x) = x
p1
+. . . +x +1. Using this, we get that (x 1)(x +1)(x
2
+x +
1)
6
(x) = x
6
1. Long division gives
6
(x) = x
2
x + 1.
(b) Let n = 12. Find an irreducible polynomial of degree d
12
in Q[x] whose
roots generate F
12
.
Proof. To calculate
12
(x), we rst calculate
4
(x). Indeed,
4
(x) = (x
4

1)/((x 1)(x +1)) = x


2
+1, hence
12
(x) = (x
12
1)/((x 1)(x +1)(x
2
+
x + 1)(x
2
+ 1)(x
2
x + 1)) = x
4
x
2
+ 1.
F8s3.
F7f1. Let F be a eld. Show that the unit group F0 of F is nitely generated
if and only if F is nite.
September 12, 2009 Yang 3
Proof. If F is nite, then its unit group is cyclic by Qual Problem F6f1, hence
nitely generated. Conversely, suppose the unit group F

is nitely generated. By
Qual Problem G5f1, any subgroup is also nitely generated. If chF = 0, then
F contains Q and thus Q

< F

is nitely generated, a contradiction, as there


are innitely many primes. Otherwise, suppose chF = p > 0, then F contains
k = Z/p (see Qual Problem F6f1). Suppose F

is generated by x
1
, . . . , x
n
. If x
i
is not algebraic over k, then k(x)

= k(x
i
) F. Thus the unit group of k(x) is
nitely generated, a contradiction, as there are innitely many monic irreducible
polynomials in k[x]. Thus we conclude that the x
i
are algebraic over k, thus F is
a nite algebraic extension of k, hence nite.
F7f2. Let f(x) be the polynomial x
4
2x
2
2 over Q and K be a splitting eld
of f(x). Determine the Galois group Gal(K/Q), and nd the number of Galois
extensions of Q inside K.
Proof. Let =
_
1 +

3, and let K = Q(,

2i). In K, f factors as (x )(x +


)(x

2i/)(x +

2i/); furthermore, the roots generated K, hence K is the


splitting eld. Now is a root of f, which is irreducible over Q by Eisenstein,
hence [Q() : Q] = 4. Since

2i has minimal polynomial x


2
+2 (in Q), which stays
irreducible over Q() R, we get that [K : Q] = 8. Moreover, as K is a splitting
eld, it is normal; as there are no repeated roots, it is separable, hence Galois. The
Galois group G = Gal(K/Q) has order 8. Since Q()/Q is not normal, G cannot be
abelian. Thus G may be D
8
or Q
8
. An automorphism send

2i to

2i and to
one of the four roots of f. By degree considerations, evidently all eight choices are
indeed automorphisms. Notice that

2i

2i and are two dierent


elements of order 2, which does not happen in Q
8
. Thus we conclude that G

= D
8
.
By the fundamental theorem of Galois theory, Galois extensions of Q inside K
correspond bijectively with the normal subgroups of D
8
. The proper normal sub-
groups of D
8
are the 3 subgroups of index 2, and the centre (TODO: Proof?).
Adding the trivial group and D
8
, we get 6 normal subgroups, hence 6 Galois ex-
tensions of Q inside K, including Q/Q and K/Q.
F7f3. Let f(x) be an irreducible polynomial over the eld F and let K/F be a
nite extension.
(a) Dene what it means for the extension K/F to be normal.
Proof. The extension K/F is normal if, for every irreducible polynomial f
over F, as long as K contains one root of f then it contains all roots of
f.
(b) Show that if K is normal over F, then, in K[x], f(x) factors into a product
of irreducible polynomials of the same degree.
Proof. Let f
1
and f
2
be irreducible factors of f in K. It suces to show
that deg f
1
= deg f
2
. Let
i
be a root of f
i
in the algebraic closure, i = 1, 2.
Then F(
i
) is isomorphic to F[x]/f(x), i = 1, 2. Let : F(
1
) F(
2
)
be an F-isomorphism sending
1
to
2
. Extend to the algebraic closure.
If K/F is normal, xes K. Thus (f
1
) is irreducible in (K) = K with
(
1
) =
2
as a root. Thus deg f
1
= deg (f
1
) = [K(
2
) : K] = deg f
2
.
(c) Show by example that this result does not hold for K not normal.
September 12, 2009 Yang 4
Proof. Consider f(x) = x
3
2, which is irreducible by Eisenstein over Q.
Now K(
3

2) is real, hence does not contain the two imaginary roots of f.


Thus f factors into a linear and a quadratic factor.
F7s1. Let F = Q() where = e
2i/5
and let E/F be a cyclic Galois extension of
degree 5. Prove that there exists F such that E = F(
5

).
Proof. Let Gal(E/F) be a generator, and consider it as a linear transformation
of the vector space E over F. Then
5
= id, so the minimal polynomial of the
transformation satises x
5
1, thus is an eigenvalue. Let E be an associated
eigenvector, that is () = .
Let =
5
. Now () = (
5
) = (())
5
= ()
5
= , thus is xed by
) = Gal(E/F), hence F. Now
5

=
i
for some i, which generates an
intermediate eld of E/F. But it is not xed by hence is not of degree 1. So
[E : F] = 5 being prime forces
5

to be of degree 5, thus generating E.


F7s2. Let K = Q(

3,
7

5).
(a) Prove that K has only one subeld F K such that [F : Q] = 2.
Proof. a
(b) Find all subelds of K.
Proof. b
(c) Find an element u K such that K = Q(u).
Proof. c
(d) Describe all elements u K such that K = Q(u).
Proof. d
F7s3. Let F = Z/3. First explain why F[x]/(x
2
2) is isomorphic to F[x]/(x
2

2x 1). Then nd an explicit isomorphism:


: F[x]/(x
2
2) F[x]/(x
2
2x 1).
Proof. Let f be an irreducible polynomial of degree n and its root. Then F[x]/f

=
F(), which is the unique eld of degree n over F. Notice that x
2
2 and x
2
2x1
are both irreducible as they have no roots in F. Therefore the two elds in question
are isomorphic. Let be a root of x
2
2, then = +1 is a root of x
2
2x1 =
(x 1)
2
2. Thus : + 1 is an explicit isomorphism between F() and
F().
F6f1. Let F be a nite eld of positive characteristic p. Show that the unit group
F0 of F is a cyclic group and that F is a Galois extension of Z/p.
September 12, 2009 Yang 5
Proof. Let G = F0 be the unit group. We immediately get that G = Z/a
1

Z/a
2
. . . Z/a
n
, with a
1
[ a
2
[ . . . [ a
n
. Now for g G, we notice that a
n
g = 0,
which, when written multiplicatively, is g
an
= 1. Thus each element is a root of
x
an
1, which has (at most) a
n
roots; hence [G[ a
n
. But on the other hand,
[G[ = a
1
a
2
. . . a
n
, thus forcing n = 1, as desired.
Now it is apparent that Z/p is a subeld. It remains to show that a nite
extension of a nite eld is Galois. Recall that a nite eld F is normal as it is
the splitting eld of x
|F|
x. Also, recall that the Frobenius map x x
p
is an
endomorphism in characteristic p. Moreover, it is injective (obvious) and surjective
(by niteness and injectivity), hence nite elds are perfect, and any (algebraic)
extension of a nite eld is separable.
F6f2. Let f(x) be the polynomial x
6
+ 3 over Q. Determine the Galois group of
f(x), i.e., the Galois group of K/Q where K is a splitting eld of f(x).
Proof. See Qual Problem F4s1.
F6f3. Let f(x) be an irreducible polynomial over F and K/F a normal extension.
Show that f(x) factors into irreducible polynomials over K all of the same degree.
Proof. Repeat of Qual Problem F7f3-b.
F6s1.
(a) Show that the Galois group of the splitting eld of X
4
2 over Q has order
8.
Proof. Let =
4

2. Since X
4
2 is irreducible (Einsenstein) and separable,
with roots , i, we get a Galois extension. Let K = Q(, i). Then the
roots are in K, and also generate K. Thus K is the splitting eld of X
4
2
over Q. The Galois group has order the same as the degree [K : Q]. It is
obvious that [K : Q] = [K : Q()][Q() : Q] = 2 4 since i is degree 2 over
Q() R and adjoining a root of a fourth degree irreducible gives a fourth
degree extension.
(b) Is this Galois group isomorphic to the dihedral group, the quarternion group
or one of the three abelian groups of order 8?
Proof. By the discussion above, it is obvious that [Q() : Q] is not a normal
extension. Thus by the Fundemental Theorem for Finite Galois Extensions,
the corresponding Gal(K/Q()) is not normal in G = Gal(K/Q). This
shows that G is nonabelian. The only nonabelian groups of order 8 are the
dihedral group D
8
and the quarternion group Q
8
. Since G permute the 4
roots of X
4
2, we get G S
4
, which has order 3 8. Thus G is a 2-Sylow
subgroup of S
4
, which is D
8
. Indeed, notice that Q
8
is not a subgroup of
S
4
. Indeed, it has 6 elements of order 4 (the same as S
4
), hence it must
contain both (1234) and (1324), whose product is (142), an element of order
3, a contradiction. As such, the Galois group is isomorphic to the dihedral
group.
F6s2. Let F be a nite eld.
(a) Show that more than half the elements of F are squares.
September 12, 2009 Yang 6
Proof. Notice 0 = a
2
b
2
= (a+b)(ab) yields a+b = 0 if a ,= b. As such,
each square can be the square of at most 2 elements. But 0 is the square of
only one element, so more than half the elements are squares.
(b) Show that every element of F is the sum of two squares.
Proof. Let x F be arbitrary and let S = a
2
: a F be the squares.
Consider S (x S). Since [S[ = [x S[ >
1
2
[F[, the intersection is
nonempty. That is, there exists a, b F such that a
2
= x b
2
.
F6s3. Let K be a nite extension of the eld F with no proper intermediate elds.
(a) If K/F is normal, show [K : F] must be prime.
Proof. Suppose [K : F] ,= 1 (otherwise obviously false). Let G = Aut
F
(K)
be the group of automorphism of K xing F, and let M = K
G
be the xed
eld of G. Then K/M is Galois with Galois group G. Moreover, we have
K/M/F. Since there are no proper intermediate elds, either M = F or
M = K. If M = F, then K/F is Galois. If [K : F] is not prime, then there
exists a proper subgroup H < G by Cauchy, whose xed eld K
H
is a proper
intermediate eld of K/F, a contradiction. Otherwise, M = K, then any
automorphism of K xing F is trivial. As [K : F] ,= 1 = [Aut
F
(K)[, K/F
is not Galois. But K/F is normal, hence it is not separable. Let KF
be a non-separable element and m

(x) be its minimal polynomial. Since


K/F is normal, m

(x) = (x)(x
2
) . . . (x
n
) splits in F() K.
But if ,=
i
, then a nontrivial F-automorphism would exist by switching
the two. Thus =
i
for all i, that is, m

(x) = (x )
n
. Recall that
inseperable polynomials exist only in positive charasteristic p > 0 and are
of the form f(x
p
). Thus we conclude that m

(x) = (x )
pt
for some
t 1. Then the minimal polynomial for
t
is m

t (x) = (x
t
)
p
, hence
[F(
t
) : F] = p. The nontrivial extension F(
t
)/F thus forces K = F(
t
),
yielding [K : F] = p as well.
(b) Give an example to show that [K : F] need not be prime if K/F is not
normal, explaining why your example works.
Proof. There is an irreducible polynomial of degree n with Galois group S
n
over Q. [Indeed, see DummitFoote 14.8: Let f
p
F
p
[x] be polynomials
of degree n, p = 2, 3, 5, such that f
2
is irreducible, f
3
is the product of an
irreducible quadratic with irreducibles of odd degree, and f
5
is the product
of x with an irreducible of degree n1. And then f Z[x] be a polynomial
such that f(x) f
p
(x) (mod p) for p = 2, 3, 5. Then f is irreducible, and
the Galois group contains a transposition and an (n1)-cycle hence is S
n
.]
Take such a polynomial f of degree 4, and let be a root. Then by
the fundamental theorem of Galois theory, Q() corresponds to a subgroup
H < S
4
of index 4. If Q()/Q admit an intermediate eld, then it must
correspond to A
4
, the only subgroup of index 2 (see Qual Problem G3w3).
Then [A
4
: H] = 2, a contradiction. Indeed, a subgroup of index 2 is normal
(see Qual Problem G4s2), but A
4
is simple.
Remark. To avoid using the simplicity of A
n
, n 5, we could investigate the two
possibilities for groups of order 6 by hand. Indeed, S
3
and Z/6 contain an odd cycle
and an element of order 6, respectively.
September 12, 2009 Yang 7
F5f1. Let F
q
be the nite eld with q = p
n
elements and let N : F
q
F
p
be the
norm map, dened by
Nx =

(x)
where runs over the Galois group G = Gal(F
q
/F
p
). Prove that N is surjective.
Proof. This is a special case of Qual Problem F5w3.
F5f2. Let (x) = x
4
+a
3
x
3
+a
2
x
2
+a
1
x+a
0
be an irreducible polynomial of degree
4 in Q[x] and let K be the eld generated by the complex roots
1
,
2
,
3
,
4
of .
Let F be the eld generated by:

1
= (
1
+
2
)(
3
+
4
),

2
= (
1
+
3
)(
2
+
4
),

3
= (
1
+
4
)(
2
+
3
).
Prove that K/F is an abelian extension, that is, the Galois group H = Gal(K/F)
is abelian.
Proof. Recall that in characteristic 0, irreducible polynomials are separable. Hence
the roots
i
are distinct. If
1
=
2
, then (
1

4
)(
2

3
) = 0, a contradiction.
We conclude by symmetry that the
i
are all distinct. Let S
4
act on the roots

i
by permuting them in the natural way. We may consider H as a subgroup of
S
4
, consisting of the elements that x each of the
i
. By running through the
cycle types, one easily checks that H consists precisely of the identity and the
(2, 2)-cycles. So H has order 4 and is abelian.
F5f3. Let K be the splitting eld of f(x) = x
11
7 over Q. Describe the Galois
group G = Gal(K/Q) by giving generators and relations. Determine the number
of quadratic subelds of K (a quadratic subeld is a subeld E K such that
[E : Q] = 2).
Proof. Let be a primitive 10
th
root of unity and let =
11

7. The roots of f are

i
for i = 0, . . . , 10. It is obvious that these root generate K = Q(, ), and f
split in that eld. Therefore K is indeed the splitting eld of f over Q.
Now [Q() : Q] = 11 and [Q() : Q] = 10 are relatively prime, hence [G[ =
[Q(, ) : Q] = 110. The Galois group is determined by the action on the gener-
ators and . Now the possibilities are
a
for a = Z/11 and
b
for
b (Z/11)

. Since this gives 110 possibilities, the order of G, all these possibilities
are evidently valid elements. Let be given by and , and let be
given by and
2
. Then and generate the Galois group. Indeed,
notice that
11
=
10
= 1. Also
1
xes and sends , hence =
2
.
We thus have two generators, know their orders, and know how they commute. In
conclusion: G =

, :
11
=
10
=
1

2
= 1
_
. TODO: Actually, we proba-
bly need to prove that this actually yield 110 elements. Group presentations is an
unsolvable problem in formal logic.
A quadratic subeld E of K corresponds to the (normal) subgroups of G with
index 2. Indeed, E is the xed eld of Gal(K/E) < G, and [G : Gal(K/E)] = [K :
Q]/[K : E] = [E : Q] = 2. TODO: The rest is left as exercise to the reader. (See
DummitFoote 14.2.)
F5w1. Show that the identity map is the only eld automorphism of the real
numbers. Show this is not true of the complex numbers.
September 12, 2009 Yang 8
Proof. Let f : R R be a eld automorphism, implying f(0) = 0 and f(1) = 1.
Thus f(n) = n for n Z. Then b f(
a
b
) = f(b
a
b
) = f(a) = a for a, b Z, b ,= 0.
Thus f(
a
b
) =
a
b
. Thus f xes Q.
A homomorphism xing Q xes R. [Indeed, rst notice that f is order-preserving.
Indeed, if a > b, then a b = c
2
for some c ,= 0. Thus f(a) f(b) = f(a b) =
f(c
2
) = (f(c))
2
> 0 as f(c) ,= 0. Suppose, towards a contradiction, that f(x) ,= x.
WLOG, let x < f(x). As Q is dense in R, there exists y Q such that x < y =
f(y) < f(x). Then x < y but f(y) < f(x), a contradiction.]
Recall that complex conjugation is a non-identity eld automorphism of the
complex numbers. It is trivial to check.
F5w2. Let F be a eld of positive characteristic p and f the polynomial x
p
xa
F[x]. Let K/F be a splitting eld of f. Show that K/F is Galois and determine
explicitly the Galois group of K/F.
Proof. (ArtinShreier). Let be a root of f in the algebraic closure of F. Notice
that + i is a root of x
p
x a for all i Z/p. So f splits completely in F(),
which is therefore normal. If F then [K : F] = 1 and we are done. Otherwise,
f(x) =

p1
i=
(x ( +i)) is irreducible. Indeed, if f(x) factors in F[x], then there
exists I Z/p such that

iI
(x ( + i)) F[x]. Let d = [I[ and consider
coecient of x
d1
, which is d

iI
i. This proves that d F, which implies
(since / F) that p [ d p, hence I = Z/p, and thus P is irreducible. All this
implies [F() : F] = deg f = p. Since we have enumerated p dierent roots of f,
it is separable. Thus K/F is Galois with G = Gal(K/F) of order p. Explicitly, we
get Z/p Gal(K/F) given by i
i
, where
i
: +i.
F5w3. Let K/F be a nite extension of nite elds. Prove that the norm map
N
K/F
: K F is surjective.
Proof. Let [F[ = q, then [K[ = q
m
for some m. Recall that the multiplicative group
K

is cyclic (see Qual Problem F6f1); let g be its generator. The subgroup F

is
the unique subgroup of order q 1, hence it is generated by h = g
(q
m
1)/(q1)
.
Recall that N
K/F
(0) = 0. It suces to prove that any h
a
F

is in the image
of N = N
K/F
. By denition, N(x) =

(x), where runs over the Galois group


G = Gal(K/F). Recall that the Gal(K/F) is generated by the q-Frobenius auto-
morphism x x
q
(see DummitFoote 14.3). Thus N(x) = x
1+q+q
2
+...+q
m1
=
x
(q
m
1)/(q1)
. Thus N(g
a
) = h
a
, as desired.
F4f1. Let a be an integer and let p be a prime. Show that if a is not a p
th
power,
then x
p
a is irreducible over Q.
Proof. Let b =
p

a be the real root, then x


p
a factors as

n
i=1
(x
i
b) in Q.
Suppose, towards a contradiction, that a is not a p
th
power, that is, b / Q, but
x
p
a is reducible over Q. Then for some nontrivial I 1, 2, . . . , n we have

iI
(x
i
b) Q[x], where k = [I[ satises 1 k < p. In particular, the constant
term (1)
k

P
I
b
k
Q. Since b is real, we conclude that
P
I
is real as well. As it
has magnitude 1, it is necessarily 1. Therefore b
k
Q. But if 1 k < p, then
(k, p) = 1, so by the Euclidean algorithm, b Q, a contradiction.
September 12, 2009 Yang 9
F4f2. Show that if K and L are nite separable extensions of F with K Galois
over F, such that K L = F, then [KL : F] = [L : F][K : F]. Show that if neither
K nor L are Galois over F, then this fact need not be true.
Proof. (See DummitFoote, 14.4, Prop. 19.) Let K and L be nite separable
extensions of F with K Galois over F, such that KL = F. Notice that if K is the
splitting eld of a polynomial f over F, then KL is the splitting eld of f over L, and
as such, KL/L is indeed Galois. It suce to prove that Gal(KL/L)

= Gal(K/F).
As K/F is Galois (in particular, normal), an embedding of K that xes F is an
automorphism of K. Thus the restriction map : Gal(KL/L) Gal(K/F)
is well-dened. It is a homomorphism (easy), with a trivial kernel. Indeed, if
ker , then xes L ( Gal(KL/L)) and K ( ker ), and thus xes KL.
Now let H = (Gal(KL/L)) < Gal(K/F), and let K
H
be its xed eld. As H
xes L, K
H
contains F = KL. On the other hand, K
H
L is xed by Gal(KL/L),
thus by Fundamental Theorem, K
H
L L (obviously, with equality), and hence
K
H
L, concluding that K
H
KL = F. Finally, K
H
= F gives H = Gal(K/F)
by Fundamental Theorem, as desired.
Let K = Q(
3

2) and L = Q(
3

2), where is a primitive cubic root of unity.


It is obvious that [K : F] = [L : F] = 3, while KL is the splitting eld of x
3
2,
which has degree (dividing) 6.
F4f3. By using several quadratic extensions of the rational function eld in two
variables F = F
2
(x, y) where F
2
is the eld with 2 elements, give an example of
a eld extension of nite degree of F that possesses innitely many intermediate
elds.
Proof. By Qual Problem F0f3-d, the biquadratic extension F(

x,

y)/F has in-


nitely many intermediate elds.
F4s1. Let K be a nite extension of Q obtained by adjoining to Q a root of
f(x) = x
6
+ 3.
(a) Show that K contains a primitive 6
th
root of unity.
Proof. Let be a root of x
6
+3 and K = Q(). Notice that = (
3
+1)/2
is a primitive 6
th
root of unity. Indeed, by direction computation,
6
= 1,
so is a 6
th
root. Also, ,= 1,
2
= (
3
1)/2,
3
= 1, showing that it is
indeed primitive.
(b) Show that K is a Galois extension of Q.
Proof. Notice that x
6
+3 splits in Q(), since it has roots , (
4
)/2.
Also, notice that all six roots are distinct, so K is the splitting eld of f
and is separable, hence K/Q is Galois.
(c) Determine the number of elds F of degree 3 over Q with F K.
Proof. Notice that the extension is of degree 6, hence the Galois group
G = Gal(K/Q) is of order 6. Since there is only one generator, the auto-
morphisms xing Q are determined by the action on , which necessarily
is one of the six roots of the polynomial for which it is the splitting eld
for. This explicitly gives us the 6 elements of G. Indeed, e : is the
identity, : has order 2, : ( +
4
)/2 also has order 2 by
direct computation. This means that G

= S
3
(and not Z/6, the other group
of order 6).
September 12, 2009 Yang 10
Since K/Q is of degree 6, if F/Q is of degree 3, then F is a subeld of K
such that [K : F] = 2. These correspond to subgroups H < G of order 2.
Recall that in S
3
, there are 3 elements of order 2, so there are 3 subgroups
of G of order 2, and hence the number of elds is also 3.
F4s2. Suppose that f(x) is a polynomial in Q[x] of degree d > 1 with d roots
x
1
, . . . , x
d
in C. If x
2
= ax
1
for a Q dierent from 1, prove that f(x) is
reducible.
Proof. Let f(x) = a
0
+ a
1
x + a
2
x
2
+ . . . + a
d
x
d
, with a
d
,= 0. If a = 0 then 0 is a
root and f(x) is reducible. Otherwise, suppose a ,= 0 and, towards a contradiction,
that f is irreducible. There must be some a
i
,= 0 for i < d, lest f(x) = a
d
x
d
be
reducible. Consider f(ax) = a
0
+ a
1
ax + a
2
a
2
x + . . . + a
d
a
d
x
d
. Since f(ax) and
a
d
f(x) have the same leading coecient and both have x
1
as a root, they must
be the same. Comparing coecient for x
i
, we get a
i
a
i
= a
i
a
d
, thus a is a root of
unity. But a Q is dierent from 1, thus a = 1. But then x
1
= x
2
is a repeated
root, and all irreducible polynomials of Q (being characteristic 0) are separable, a
contradiction.
Remark. This is false if a = 1, as seen in (x +i)(x i).
F4s3. Let K be a eld and L a nite extension of K. Consider the set A of all
elements x L with the property that K[x] is a Galois extension of K with an
abelian Galois group Gal(K[x]/K). Show that A is a subeld of L containing K.
Proof.
F3f1. Determine the Galois group of the polynomial x
4
+ 3x
2
+ 1 over Q.
Proof. Using the quadratic formula, the roots are
_
3

5
2
. Let =
_
3+

5
2
,
then by direct computation we see that the other 3 roots are , 1/, and 1/.
Therefore the splitting eld of the polynomial is simply Q() of degree 4, since
the polynomial is irreducible, by direct computation. Each element of the Galois
group necessarily sends to one of the roots of its irreducible polynomial. This also
completely determines the action of that element. So evidently, , 1/,
and 1/ all give Q-automorphisms. It is also easily seen that they are all
of order 2. Therefore the Galois group is Z/2 Z/2, not Z/4, the other group of
order 4.
F3f2. Let f(x) be a polynomial of degree n > 0 over a eld F.
(a) Prove that there is a eld homomorphism : F(x) F(x) such that
(x) = f(x).
Proof. Simply dene such that (x) = f(x), and extend by linearity. It
is simple to check that this is a well-dened eld homomorphism.
(b) Let L be the image of . Prove that the eld extension F(x)/L is nite and
nd its degree.
September 12, 2009 Yang 11
Proof. Now L contains polynomials in f(x), that is, L = a
0
+ a
1
f(x) +
a
2
(f(x))
2
+ . . . + a
d
(f(x))
d
. Notice that L is obviously an intermediate
eld of F(x)/F. It remains to nd the minimal polynomial of x to get the
degree of F(x)/L. First, notice that x satises f(T) f(x) as a polynomial
in L[T], so the minimal polynomial has degree at most n. Suppose, towards
a contradiction, that the minimal polynomial has degree d < n. Then it is
of the form p
d
T
d
+p
d1
T
d1
+. . . +p
1
T +p
0
, where the p
i
L. Since p
i
is a
polynomial in f(x), the degree with respect to x is a multiple of n. As such,
the leading term of each monomial p
i
x
i
has degree i modulo n. Since d < n,
all d + 1 monomials p
i
x
i
have dierent leading term degrees, and hence
has no chance of cancellation, a contradiction. We thus establish that the
minimal polynomial of x over L is f(T)f(x), and hence [F(x) : L] = n.
(c) Find the minimal polynomial of x over L.
Proof. See part (b).
F3f3. Let p be a prime integer. Suppose that the degree of every nite extension
of a eld F is divisible by p. Prove that the degree of every nite extension of F is
a power of p.
Proof. Suppose the degree of every non-trivial (otherwise obviously false) nite
extension of F is divisible by p. Let E/F be a nite extension. Let L be the
separable closure of F in E, then E/L is purely inseparable, hence its degree is a
power of the characteristic q. But if q ,= p, then F is perfect, hence [E : L] = 1.
Indeed, otherwise, some element a F has no q
th
root in F, then a root of x
q
a
generate an extension of degree q, not divisible by p. It remains to show that [L : F]
is a power of p. Since it is separable, there is a eld E containing L such that E/F
is Galois. Since [L : F] divides [E : F], it remains to show that [E : F] is a power of
p. Let P be a p-Sylow subgroup of Gal(E/F), and consider the corresponding xed
eld E
P
. Recall that [E
P
: F] = [Gal(E/F) : P], which is not a multiple of p by
denition, so E
P
/F must not be a non-trivial nite extension. Thus we conclude
Gal(E/F) = P is a p-group, hence [E : F] is a power of p.
F3w1. Let F
q
be the nite eld of q elements.
(a) List all subelds of F
p
6 for a prime p.
Proof. Let F
q
F
p
6. We know that q is a prime power, and that p
6
is a
power of q (which is the degree of the extension). As such, it is obvious that
q = p, p
2
, p
3
, and p
6
.
(b) Find a formula for the number of monic irreducible polynomials of degree
6 in F
p
[x].
Proof. Recall that x
p
n
x is the product of the monic irreducible polynomi-
als of degree d, where d runs through (positive) divisors of n. Let f(d) denote
the degree of the product of the monic polynomials of degree d. Then it is
evident that f(1) = p, f(2) = p
2
f(1) = p
2
p, f(3) = p
3
f(1) = p
3
p,
and nally f(6) = p
6
f(3) f(2) f(1) = p
6
p
3
p
2
+ p. There-
fore the number of monic irreducible polynomials of degree 6 is
1
6
f(6) =
(p
6
p
3
p
2
+p)/6.
September 12, 2009 Yang 12
Remark. By the Mobius inversion formula, the number of monic irreducible poly-
nomials of degree n is
1
n

d|n
(d)p
n/d
, where is the Mobius function that is 0 if
not square-free and (1)
r
if it has r distinct prime factors. See, say, DummitFoote
14.3 for details.
F3w2. Let K/F be a quadratic extension of elds and M/F be a Galois extension
over F containing K such that Gal(M/K) is a cyclic group of odd prime order p.
(a) Determine the possible groups Gal(M/F) up to isomorphisms.
Proof. Let G = Gal(M/F), with [G[ = 2p, p an odd prime. Let H = g) be
a 2-Sylow subgroup of G. Let P be a p-Sylow subgroup of G, it is normal
as it has index 2 (see Qual Problem G4s2). Thus we get G = P

H, with
: H Aut(P). Now (g) has order dividing 2. As Aut(P)

= Z/(p 1)
is cyclic of even order, there is precisely one element of order 2. Thus
there are two possible Gal(M/F), namely, the abelian group Z/2p and the
dihedral group D
2p
.
(b) Find the number of intermediate elds L between F and M with [L : F] = p.
Proof. By the fundamental theorem of Galois theory, these intermediate
elds are in bijective correspondence with the subgroups H < Gal(M/F)
of index p, which have order 2, and hence in bijective correspondence with
the elements of order 2. Since Z/2p is cyclic of even order, it has precisely
one element of order 2. As for D
2p
, since p is odd, the elements of order 2
are the p reections.
F3w3. Find the degree of the splitting eld E of x
6
3 over the following elds.
(a) Q[

3].
Proof. The degree is 6. Let =
6

3 and = e
2i/6
a primitive 6
th
root of
unity. Notice that f = x
6
3 has roots
j
, j = 0, . . . , 5, which generate
E = Q(, ), and splits in E. Thus E is the splitting eld of f over Q. As

5
=

3 (say, by using Euclidean geometry on the complex plane),


M = Q[

3] is an intermediate eld of E/Q, and thus E is also the splitting


eld of f over M. It is apparent that [M : Q] = 2 as

3 satises x
2
+ 3,
which is irreducible over Q by Eisenstein. As x
6
3 is irreducible over
Q by Eisenstein, [Q() : Q] = 6. As Q() is real, is not in it; but
satises x
2
x + 1 (by Euclidean geometry), hence [E : Q()] = 2. Thus
[E : M] = [E : Q()][Q() : Q]/[M : Q] = 6, as desired.
(b) F
7
.
Proof. The degree is 6. Recall that any eld extension of F
7
is of the form
F
7
n, which is the splitting eld of x
7
n
x. Since x
6
3 is separable (its
derivative is nonzero), if it splits in F
7
n, we have x
6
3 [ x
7
n
x. If
(x
6
3)f = x
7
n
x, then f must have the form

k
i=0
3
i
x
7
n
6i6
. Then
(x
6
3)f = x
7
n
3
k+1
x
7
n
6k6
, thus we must have 3
k+1
1 (mod 7) and
7
n
6k 6 = 1. Solving the rst equation we get k 5 (mod 6). Now
6k = 7
n
7 = 6(7
n1
+ 7
n2
+. . . + 1), hence k n 1 (mod 6). Thus n
is a multiple of 6. That is, x
6
3 splits in F
7
n if and only if n is a multiple
of 6. Thus the splitting eld is F
7
6.
(c) F
5
.
September 12, 2009 Yang 13
Proof. The degree is 2. Similarly, if (x
6
3)f = x
5
n
x, then f has the
form

k
i=0
3
i
x
5
n
6i6
, yielding 3
k+1
1 (mod 5) and 5
n
6k6 = 1. The
rst gives k 3 (mod 4). Since n = 2 is the smallest value of n that works,
the splitting eld is F
5
2.
F2f1.
(a) Determine the minimal polynomial of u =
_
3 + 2

2 over Q.
Proof. Notice that u =
_
3 + 2

2 =
_
(1 +

2)
2
= 1 +

2. It evidently
satises (x 1)
2
2, which is clearly irreducible. Thus it is the minimal
polynomial.
(b) Determine the minimal polynomial of u
1
over Q.
Proof. Notice that u
1
=

2 1, which evidently satises (x + 1)


2
2,
again irreducible.
F2f2.
(a) Let F be the eld generated by the roots of the polynomial x
6
+ 3 over Q.
Determine the Galois group of F/Q.
Proof. See Qual Problem F4s1. The Galois group is S
3
.
(b) Describe all subelds of F.
Proof. Let be a root of x
6
+ 3 and a primitive 6
th
root of unity. By
the fundamental theorem of Galois theory, the subelds correspond to the
subgroups of S
3
. Notice that S
3
consists of the identity, three transpositions
of order 2, and two 3-cycles. Besides the trivial cases, there are obviously
three subgroups of order 2 and 1 subgroup of order 3. They evidently
correspond to the subelds Q(
i

2
) for i = 0, 2, 4 and the subeld Q(
3
),
respectively. Details are left as an exercise to the reader.
F2f3. Let p be a prime integer such that p 2 or 3 (mod 5). Prove that the
polynomial 1 +x +x
2
+x
3
+x
4
is irreducible over Z/p.
Proof. Let f = 1 + x + x
2
+ x
3
+ x
4
. Recall that nite elds are unique. Thus if
f were reducible, then it would have a root in F
p
2, the degree 2 extension of Z/p.
Any element in there satisfy x
p
2
x. Let be a root of f, notice that it satises
(x 1)f = x
5
1. Since p
2
4 (mod 5),
p
2
=
4
, yielding
3
= 1 as
,= 0. But combining with
5
= 1 gives = 1, which is not a root of f.
F2s1. Let F
7
be the eld with 7 elements and let L be the splitting eld of the
polynomial x
171
1 over F
7
. Determine the degree of L over F
7
.
Proof. The degree is 3. Indeed, a nite extension of F
7
is necessarily F
7
n for some
n, in which all elements satisfy x
7
n
x. Let f = x
171
1, which has nonzero
derivative hence is separable. As such, if it splits in F
7
n, we have f [ x
7
n
1
1.
But that happens if and only if 171 [ 7
n
1. So we seek the smallest n such that
it is true.
F2s2. Show that there exists a Galois extension of Q of degree p for each prime p.
September 12, 2009 Yang 14
Proof. This is a baby Inverse Galois Theory problem. Let q be a prime, to be
chosen later, and let be a primitive q
th
root of unity. We know that Gal(Q()/Q)
is cyclic of order q 1. If p [ q 1, then there is a subgroup of index p (see Qual
Problem G0f3). Then by the fundamental theorem of Galois theory, this subgroup
corresponds to an intermediate eld extension of degree p over Q. It remains to
pick prime q such that q 1 (mod p). This is possible by the famous Dirchlets
theorem in number theory, which says there are innitely many primes congruent
to a modulo b, given (a, b) = 1.
F2s3. Let =

i + 2 where i =

1.
(a) Compute the minimal polynomial of over Q.
Proof. Evidently satises (x
2
2)
2
+1 = x
4
4x
2
+5, which is irreducible
by Eisenstein (shift x x + 1), hence is the minimal polynomial of .
(b) Let F be the splitting eld and compute the degree of F over Q.
Proof. Notice that the roots are

2 i, which generate Q(,

5). Notice
that the minimal polynomial of over Q remains irreducible over Q(

5),
which can be checked by direct computation. As such [F : Q] = [F :
Q(

5)][Q(

5) : Q] = 8.
(c) Show that F contains 3 quadratic extensions of Q.
Proof. Notice that F contains i,

5, and i

5, each of order 2, and evidently


generate distinct elds.
(d) Use this information to determine the Galois group.
Proof. Since the subextension [Q() : Q] is not normal, the Galois group G
is not abelian. Thus G is either the dihedral group D
8
or the quarternion
group Q
8
. By the fundamental theorem of Galois theory, the extensions
[Q(

2 i) : Q] correspond to subgroups of G with index 4, namely of order


2. But Q
8
only has one element of order 2, thus we conclude G

= D
8
.
F2w1. The discriminant of the special cubic polynomial f(x) = x
3
+ax+b is given
by 4a
3
27b
2
. Determine the Galois group of the splitting eld of x
3
x+1 over
the following elds:
(a) F
3
, the eld with 3 elements.
Proof. If a cubic is reducible, it must have a root. Since x
3
x + 1 has no
root in F
3
, it is irreducible. Adjoining one root gives an extension of degree
3. Since nite elds are perfect, that is the splitting eld. The Galois group
is of order 3, hence necessarily is Z/3.
(b) F
5
, the eld with 5 elements.
Proof. Notice that in F
5
the polynomial factors as (x 3)(x
2
+3x 2). So
the extension is necessarily of degree 2, yielding Z/2 as the Galois group.
(c) Q, the rational numbers.
Proof. Let G be the Galois group, which we identify with a subgroup of
S
3
as usual. Since the polynomial has no rational root, it is irreducible,
thus 3 [ [G[. The disciminant is 23, hence not all roots (in C) are real.
Thus, complex conjugation is an automorphism of order 2, so 2 [ [G[. Thus
[G[ = 6, hence G

= S
3
.
September 12, 2009 Yang 15
F2w2. A eld extension K/Q is called biquadratic if it has degree 4 and if K =
Q(

a,

b) for some a, b Q.
(a) Show that a biquadratic extension is normal with Galois group Gal(K/Q)

=
Z/2 Z/2 and list all sub-extensions.
Proof. Notice that K is the splitting eld of (x
2
a)(x
2
b), hence K/Q
is normal. The roots are

a,

b. But a ,= b, lest [K : Q] = 2. Thus


the extension is separable as well, hence Galois. Since

a

a and

b are evidently two dierent elements of G = Gal(K/Q) of degree


2, we conclude that G

= Z/2 Z/2, not Z/4, the other group of order
4. By the fundamental theorem of Galois theory, the proper subextensions
corresponds to the nontrivial subgroups of G, which are evidently Q(

a),
Q(

b), and Q(

ab).
(b) Prove that if K/Q is a normal extension of degree 4 with Gal(K/Q)

=
Z/2 Z/2 then K/Q is biquadratic.
Proof. Let K/Q be a normal extension of degree 4 with Gal(K/Q)

=
Z/2 Z/2. Then K is the splitting eld of a separable polynomial f over
Q. We may, of course, replace f by the product of its irreducible factors.
The degree of each irreducible factor must divide [K : Q] = 4. If there were
an irreducible factor of degree 4, then Gal(K/Q)

= Z/4 if it has order 4, a
contradiction. Thus f is a product of irreducible quadratics. Furthermore,
each quadratic with discriminant d can be replaced by x
2
d, while pre-
serving the splitting eld. Take an irreducible factor x
2
a from f, we have
[Q(

a) : Q] = 2. Consider f over Q(

a), it cannot split completely, lest


Gal(K/Q) be of order 2. Thus some factor, say x
2
b, remains irreducible,
then [Q(

a,

b) : Q(

a)] = 2, yielding K = Q(

a,

b).
F2w3. Let K be a nite extension of the eld F with no proper intermediate
subelds.
(a) If K/F is normal, show that the degree [K : F] is a prime.
(b) Give an example to show that [K : F] need not be prime if K/F is not
normal.
Proof. Repeat of Qual Problem F6s3.
F1f1. Let f(x) = x
3
2x 2.
(a) Show that f(x) is irreducible over Q.
Proof. As f is degree 3, if it is reducible, it must have a root. But the
rational roots of a monic polynomial must divide the constant term. It is
easily seen that 1, 2 are not roots, hence f is irreducible.
(b) Let be a complex root of f(x). Express
1
as a polynomial in with
coecients in Q.
Proof. As is a root of f, we have
3
2 2 = 0. Multiplying by
1
,
we get
2
2 2
1
= 0. Thus
1
=
1
2

2
1.
Remark. Seriously, what kind of qual question is this?
F1f2. Let f(x) = x
3
+ nx + 2, where n is an integer. Determine the (innitely
many) values of n for which f is irreducible over Q.
September 12, 2009 Yang 16
Proof. If f were reducible, it would then have a root. The rational roots of a monic
polynomial must divide the constant term. Thus n must be such that f has a root
in 1, 2. Solving, n must be in 3, 1, 5. Thus f is irreducible over Q if and
only if n Z3, 1, 5.
F1f3. Let G be the Galois group of x
p
2 over Q where p is a prime. Show that
G is isomorphic to the group of matrices of the form
_
a b
0 1
_
where a (Z/p)

and b Z/p.
Proof. Let be a primitive p
th
root of unity, and =
p

2 be the real root. Notice


that the roots of x
p
2 are precisely
b
for b Z/p. Thus the roots generate Q(, )
and x
p
2 split in it. Further notice that [Q() : Q] = p and [Q() : Q] = p 1
are coprime, so [G[ = p(p 1) by order considerations. Let (a, b) be dened by

a
and
b
. Since each element of G must map the generators ,
to their conjugates, we have at most p(p 1) possible automorphisms. As this
is also the order of [G[, we conclude that (a, b) for a (Z/p)

and Z/p
are precisely the distinct elements of G. Now notice that by direct computation,
(a, b) (c, d) = (ac, ad +b), exactly how the rst row of the matrices multiply.
Thus it is a trivial matter to check that (a, b)
_
a b
0 1
_
is indeed a group
isomorphism.
F1s1. Let F be a prime eld, i.e., the rationals or a eld with p elements. Prove
that an algebraic closure of F has innite degree over F.
Proof. Let F = Q. Notice [Q(
n

23) : Q] = n for any n. The algebraic closure


contains all these eld extensions, hence must be innite.
Let F = F
p
. If the algebraic closure E has nite degree over the nite eld
F
p
, then E is also nite. But a nite eld cannot be algebraically closed. Indeed,
1 +

aE
(x a) is well-dened yet has no root.
F1s2. Let f Q[x] be a polynomial of degree three. Let K = Q() be a splitting
eld of f. Determine all the possibile Galois groups of K/F, prove these are all
such, and give explicit examples of K, i.e., determine a or f.
Proof. Recall that in characteristic 0, all nite extensions are simple, so the re-
quirement that K = Q() is simple is automatically satised. The Galois groups
are (isomorphic to) subgroups of S
3
, which are 1, Z/2, Z/3, and S
3
. If f splits in
Q, say, f = x
3
, then the Galois group is trivial. If precisely one root is in Q, say
f = x(x
2
+ 23), then the splitting eld is the same as the irreducible quadratic,
hence Galois group is Z/2. Otherwise, no roots are in Q, so adjoining any root
give an extension of degree 3. If there are two complex roots, say f = x
3
23,
then complex conjugation is an element of order 2 in the Galois group, hence is S
3
.
Finally, we want to exhibit Z/3 as a Galois group. Let be a primitive 7
th
root
of unity. Then [Q() : Q] = 6, and complex conjugation generates a (normal) sub-
group of order 2. Thus its xed eld K is Galois over Q of degree 3. Now complex
conjugation xes
i
+
7i
for i = 1, 2, 3. We thus get that K is the splitting eld
of f =

3
i=1
(x
i

7i
) = x
3
+x
2
2x 1.
September 12, 2009 Yang 17
F1s3. Prove that the polynomial x
4
+1 is not irreducible over any eld of positive
characteristic.
Proof. It suces to prove that x
4
+1 is not irreducible over any eld F
p
. If p = 2,
then x
4
+ 1 = (x + 1)
4
is reducible. Otherwise, p is odd, so p
2
1 (mod 8). Then
x
4
+ 1 [ x
8
1 [ x
p
2
1
1 [ x
p
2
x. If were a root of x
4
+ 1, then it satises
x
p
2
x, whose solutions form the eld F
p
2. Thus we conclude F
p
() is a subeld
of F
p
2. Thus [F
p
() : F
p
] 2 is not 4, hence x
4
+ 1 is not irreducible.
F0f1. Find the minimal polynomial of =

2 +
3

3 over the eld of rational


numbers Q.
Proof. Let a and b be degrees p and q over a eld F, respectively. Then [F(a, b) :
F] pq. If p and q are coprime, then obviously since p and q both divide [F(a, b) :
F], we have equality. If p and q are distinct primes, then we get F(a, b) = F(a+b).
Indeed, one inclusion is obvious; it remains to show a + b has degree pq. Since
F(a, a + b) = F(a, b), we get pq = [F(a, b) : F] = [F(a, a + b) : F] [F(a) :
F] [F(a +b) : F]. Thus [F(a +b) : F] q. And similarly, [F(a +b) : F] p. Since
a +b F(a, b), it has degree dividing pq, thus it is pq, as desired.
This shows that has degree 6 over Q, now it remains to nd a monic polynomial
of degree 6 that satises. Notice that (

2)
3
3 = 0. Expanding and
rearranging, we get
3
+ 6 3 =

2(2 + 3
2
). Squaring and rearranging, we get

6
6
4
6
3
+ 12
2
36 + 1 = 0. Therefore x
6
6x
4
6x
3
+ 12x
2
36x + 1
is the minimal polynomial.
Remark. Actually, as long as p and q are coprime, and F has characteristic 0,
then F(a, b) = F(a + b). See I. M. Isaacs, Degrees of Sums in a Separable Field
Extension, http://www.jstor.org/stable/2036661.
F0f2. Let be a primitive 16
th
root of unity over the eld F. Determine the
dimension [F() : F] when F is the following:
(a) The eld of 9 elements.
Proof. The degree is 2. Notice satises x
16
1. Since 16 [ 9
2
1, by Qual
Problem F0s2, the splitting eld of x
16
1 is F
9
2. So [F() : F] [ 2. But
since is primitive, it cannot satisfy x
8
1, so it is not in F.
(b) The eld of 7 elements.
Proof. The degree is 2. Again, the splitting eld of x
16
1 is F
7
2 of degree
2; and is not in F.
(c) The eld of 17 elements.
Proof. The degree is 1. The elements of F are precisely the roots of x
17
x,
which includes .
(d) What can you say in the case the characteristic p = 2? The degree is 1.
In characteristic 2, by the Freshmens dream, we have x
16
1 = (x 1)
16
,
hence 1 is the only 16
th
root of unity.
F0f3. Let F be an innite eld of characteristic p > 0. Recall that a nite dimen-
sional extension L/F is said to be simple if L = F(u) for some element u L.
(a) Suppose L/F has a nite number of intermediate elds. Show that L/F is
simple.
September 12, 2009 Yang 18
Proof. Clearly L is nitely generated over F, thus with induction, it suces
to show that F(, ) is simple over F. Consider intermediate elds F(+c)
for c F. Since F is innite, and each of these is an intermediate eld of
L/F, we conclude that for some c ,= d, K = F( +c) = F( +d). This
means (c d) K, and as c d F

, we get K and nally in K.


So F(, ) = F( +c) is simple over F, as desired.
(b) Let K be an intermediate eld F K L, and suppose that L = F(u)
with x
r
+a
1
x
r1
+. . . +a
r
the monic irreducible polynomial of u over K,
a
i
K. Show that K = F(a
1
, a
2
, . . . , a
r
).
Proof. Since L = K(u), we have [L : K] = r. Now F

= F(a
1
, . . . , a
r
) is a
subeld of K. But since L = F

(u), and u satises a degree r polynomial,


it follows that [L : F

(u)] r. This implies K = F

, as desired.
(c) Conclude that L/F is simple if and only if there are a nite number of
intermediate elds.
Proof. By part (a), we have the backward implication. Conversely, let L =
F(u), and f be the minimal polynomial of u over F. Take intermediate
subeld K, then the minimal polynomial g of u in K is a factor of f. By
part (b), g determines completely the subeld K. Since there are nitely
many factors of f, the number of subelds is nite.
(d) Let E = F(x, y) where x and y are indeterminates, and set M = E(
p

x,
p

y).
Show that M/E has an innite number of intermediate elds.
Proof. Let =
p

x and =
p

y and follow the proof of part (a). If


intermediate elds E( + c) = E( + d) for c ,= d in E, then M =
E(+c). But in characteristic p, we have Freshmens dream, (+c)
p
=
x + c
p
y E. So + c has degree (at most) p over E, a contradiction to
[M : E] = p
2
. Thus the elds E( + c) for c E are all dierent. Since
[E[ is innite, there are innitely many intermediate elds in M/E.
F0s1. Let = 1 +
3

2 +
3

4.
(a) Find the degree of over Q.
Proof. By direct computation, we see that satises x
3
3x
2
3x 1.
Since tihs is degree 3, it must have a root if reducible, which is not the case
by rational root theorem. Thus is of degree 3 over Q.
(b) Find a normal closure of Q()/Q.
Proof. The normal closure must contain the roots of the minimal polynomial
x
3
3x
2
3x 1. Thus we calculate its splitting eld. Factoring in C, we
get (x)(x
2
(3)x+1/). The disciminant is d = (3)
2
4/ < 0.
The roots generate Q(,

d), and the polynomial split in this, thus this is


the splitting eld.
F0s2. Let q be a power of a prime integer, n N. Let k be the least positive
integer such that q
k
1 (mod n). Prove that the nite eld F
q
k is a splitting eld
of the polynomial x
n
1 over F
q
.
September 12, 2009 Yang 19
Proof. Recall that the any nite eld extension of F
q
is of the form F
q
m, whose
nonzero elements are the roots of x
q
m
1
1. If n is a multiple of p, the characteristic
of F
q
, then q
k
is a power of p, thus p [ n [ q
k
1, a contradiction. Thus p n, so
the derivative nx
n1
, 0, hence x
n
1 is separable over F
q
. So if x
n
1 splits in
F
q
m, we get x
n
1 [ x
q
m
1
1. But this happens if and only if n [ q
m
1. Thus
the smallest eld that x
n
1 split over is F
q
k, as desired.
F0s3.

You might also like