Math 121 Homework 4 Solutions

Problem 2, Section 9.4. Prove that the following polynomials are irre-
ducible in Z[x]. (a) x4 − 4x3 + 6;
(c) x4 + 4x3 + 6x2 + 2x + 1 (Substitute x − 1 for x.)
Remark: By Gauss’ Lemma (Proposition 5 on page 303), a monic polyno-
mial that is irreducible in Z[x] is irreducible in Q[x]. So these polynomials
are irreducible in Q[x].
Solution. For (a), use Eisenstein’s Criterion with p = 2. For (c), if f (x) =
x4 + 4x3 + 6x2 + 2x + 1 then f (x − 1) = x4 − 2x + 2. Although f (x) is not
an Eisenstein polynomial, f (x − 1) is Eisenstein for p = 2. Thus f (x − 1) is
irreducible. This implies that f (x) is irreducible.

Problem 7, Section 9.4. Prove that R[x]/(x2 + 1) is a field which is

isomorphic to the field of complex numbers.
We will give two solutions. The first solution uses only facts that are available
in Chapter 9. The second solution makes use of results from Chapter 13.
First Solution. The polynomial x2 + 1 has degree 2 and has no real root.
Therefore it is irreducible by Proposition 10 on page 308.
Since R[x] is a principal ideal domain and the polynomial x2 + 1 is irre-
ducible, the ideal (x2 + 1) is prime by Proposition 11 on page 284 and hence
maximal by Proposition 7 on page 280. Hence the quotient R[x]/(x2 + 1) is
a field by Proposition 12 on page 254.
Now define a homomorphism ε : R[x] −→ C that is evaluation at i.
That is, if f (x) ∈ R[x] then ε(f ) = f (i). Clearly x2 + 1 is in the kernel
of ε and so (x2 + 1) ⊆ ker(ε). But (x2 + 1) is maximal, and since ker(ε)
is a proper ideal since ε(1) = 1. Therefore ker(ε) cannot be strictly larger
than (x2 + 1), proving that ker(ε) = (x2 + 1). It now follows from the First
Isomorphism Theorem for rings (Theorem 7 on page 243) that R[x]/(x2 +1) =
R[x]/ ker(ε) ∼
= C.

1
Second Solution. We argue as in the First Solution that p(x) = x2 + 1 is
irreducible. We may now apply Theorem 6 on page 517 with F = R, α = i,
and the isomorphism

C = R(i) ∼
= R[x]/(x2 + 1)

is proved in the theorem.

Problem 3, Section 13.6. Prove that if a field F contains the n-th roots
of unity for n odd, then it contains the 2n-th roots of unity.
Solution. Since n is odd (−1)n = 1. Therefore ζ is an 2n-th root of
unity, then

0 = ζ 2n − 1 = (ζ n − 1)(ζ n + 1) = −(ζ n − 1)(((−ζ)n − 1).

This means that either ζ or −ζ is in F . Therefore ζ ∈ F , as required.

Problem 7, Section 13.6. Use the Möbius Inversion Formula indicated in

Section 14.3 to prove
Y
Φm (x) = (xd − 1)µ(m/d) .
d|n

Solution. The Möbius inversion formula says that if

X
G(n) = F (d)
d|n

then X n
F (n) = µ G(d)
d
d|n

where µ is the Möbius function defined by


(−1)k if n is a product of k distinct primes,
µ(n) =
0 if n is not squarefree.

Taking this as known, we may now prove the following multiplicative version.

2
Proposition 1. Let f be a function on the positive integers that is never
zero. Let Y
g(n) = f (d).
d|n

Then Y
f (n) = g(d)µ(n/d) .
d|n

Proof. Since f is never zero, for each positive integer n, we may chose F (n)
such that eF (n) = f (n). Now
 
Y Y X
g(n) = f (d) = eF (n) = exp  F (d) = exp(G(n))
d|n d|n d|n

where X
G(n) = F (d).
d|n

By Möbius inversion, X n

F (n) = µ G(d).
d
d|n

Now exponentiating this identity

 
X n Y Y
f (n) = exp  µ G(d) = exp(G(d))µ(n/d) = g(d)µ(n/d) .
d
d|n d|n d|n

Now let us apply this with f (n) = Φn (x). We have

Y Y
f (n) = Φn (x) = xn − 1. (1)
d|n d|n

Indeed,
( )
Y Y Y
xn − 1 = (x − ζ) = (x − ζ)
ζ an n-th root of unity d|n ζ a primitive n-th root of unity

3
because every n-th root of unity is a primitive d-th root of unity for a unique
divisor d of n. Now applying Proposition 1, (1) implies that
Y
Φn (x) = (xd − 1)µ(n/d) .
d|n

Problem 1, Section 14.1. (a) Show that if the field K is generated over F
by the elements α1 , · · · , αn , then an automorphism σ of K fixing F is uniquely
determined by σ(α1 ), · · · , σ(αn ). In particular, show that an automorphism
fixes K if and only if it fixes a set of generators for K.
(b) Let G 6 Gal(K/F ) be a subgroup of the Galois group of the extension
K/F and suppose σ1 , · · · , σk are generators for G. Show that the subfield
E/F is fixed by G if and only if it is fixed by the generators σ1 , · · · , σk .
Solution. I think part (a) is obvious, but here is a formal argument. The
field K consists of all fractions
f (α1 , · · · , αn )
(2)
g(α1 , · · · , αn )
where f and g are polynomials with coefficients in F , and g(α1 , · · · , αn ) 6= 0.
Indeed, this set is obviously a field, contains the αi , and any field containing
all the αi contains these elements, so this is the field generated by the αi .
Now if we apply the automorphism σ to (2) we get
f (σ(α1 ), · · · , σ(αn ))
. (3)
g(σ(α1 ), · · · , σ(αn ))
This formula shows that if we know σ(αi ) then we know what σ does to
a typical element (2). Therefore the automorphism σ is determined by the
values σ(αi ). In particular if σ(αi ) = αi then (3) equals (2) showing that σ
fixes K.
For (b), if E is fixed by G then obviously it is fixed by any elements, in
particular the σi . So one direction is obvious, and what we must show is that
if K is fixed by the σi then it is fixed by any element. Every element σ of G
may be written as a product of the σi , say
σ = σi1 · · · σik .
Now if a ∈ K then σik (a) = a so
σ(a) = σi1 · · · σik−1 σik (a) = σi1 · · · σik−1 (a).
Then σik−1 (a) = a, so this equals σi1 · · · σik−2 (a), etc. Eventually we obtain
σ(a) = a, which is what we are required to prove.

4
Problem 2, Section 14.1. Let τ : C −→ C be the complex conjugation,
defined by τ (a + bi) = a − bi. Prove that τ is an automorphism of C.
First Solution. Every element of C may be written uniquely as a + bi. To
see that τ is a ring homomorphism, we must check that

τ ((a + bi) + (c + di)) = τ (a + bi) + τ (c + di)

and
τ ((a + bi)(c + di)) = τ (a + bi)τ (c + di).
The first identity is easy to check. The second means

ac − bd − (ad + bc)i = (a − bi)(c − di),

which is also easy to check.

Second Solution. Note that C = R(i) is the splitting field of the irreducible
polynomial x2 + 1. This has roots i, −i an it follows from Theorem 8 on page
519 that there is an isomorphism τ : C −→ C over R such that τ (i) = −i.
Now τ (a + bi) = τ (a) + τ (b)τ (i) = a − bi, that is, τ is complex conjugation.
This proves that complex conjugation is an automorphism.

Problem 3, Section 14.1. Determine the fixed field of complex conjugation

on C.
Solution: Any complex number may be written uniquely as a + bi with
a, b ∈ R. If τ (a + bi) = a + bi then a − bi = a + bi which is equivalent to b = 0
and so a + bi = a ∈ R. Therefore the fixed field of complex conjugation τ is
R.
√
√

Problem 4, Section 14.1. Prove that Q 2 and Q 3 are not isomor-
phic.
√
√

Solution. If there is an isomorphism φ : Q 2 −→ Q 3 and then
√
√ √
2 √
φ 2 = a + b 3 satisfies a + b 3 = 2. That is, a2 + 3b2 + 2ab 3 = 2.
√
Note that 1 and 3 are linearly independent over Q, so 2ab = 0, that is,
either a = 0 or b = 0. Thus either a2 = 2 or b2 = 2/3. Neither of these
equations may be solved with a or b in Q, which is a contradiction.