Selected Solutions to Artins Algebra, Second Ed.

Takumi Murayama
July 22, 2014
These solutions are the result of taking MAT323 Algebra in the Spring of 2012,
and also TA-ing for MAT346 Algebra II in the Spring of 2014, both at Princeton
University. This is not a complete set of solutions; see the List of Solved Exercises
at the end. Please e-mail takumim@umich.edu with any corrections.

Contents
2 Groups
2.1 Laws of Composition . . . . .
2.2 Groups and Subgroups . . . .
2.4 Cyclic Groups . . . . . . . . .
2.6 Isomorphisms . . . . . . . . . .
2.8 Cosets . . . . . . . . . . . . . .
2.10 The Correspondence Theorem
2.11 Product Groups . . . . . . . .
2.12 Quotient Groups . . . . . . . .

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

6 Symmetry
6.3 Isometries of the Plane . . . . . . . . . . . . . . . .
6.4 Finite Groups of Orthogonal Operators on the Plane
6.5 Discrete Groups of Isometries . . . . . . . . . . . . .
6.6 Plane Crystallographic Groups . . . . . . . . . . . .
6.7 Abstract Symmetry: Group Operations . . . . . . .
6.8 The Operation on Cosets . . . . . . . . . . . . . . .
6.9 The Counting Formula . . . . . . . . . . . . . . . .
6.10 Operations on Subsets . . . . . . . . . . . . . . . . .
6.11 Permutation Representations . . . . . . . . . . . . .
1

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.

4
4
4
5
7
8
9
9
10

.
.
.
.
.
.
.
.
.

13
13
14
16
17
17
18
19
19
20

6.12 Finite Subgroups of the Rotation Group . . . . . . . . . . . . . . . .

6.M Miscellaneous Problems . . . . . . . . . . . . . . . . . . . . . . . . .
11 Rings
11.1 Definition of a Ring . . . .
11.2 Polynomial Rings . . . . .
11.3 Homomorphisms and Ideals
11.4 Quotient Rings . . . . . . .
11.5 Adjoining Elements . . . .
11.6 Product Rings . . . . . . .
11.7 Fractions . . . . . . . . . .
11.8 Maximal Ideals . . . . . . .
11.9 Algebraic Geometry . . . .
11.M Miscellaneous Problems . .

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

12 Factoring
12.1 Factoring Integers . . . . . . .
12.2 Unique Factorization Domains
12.3 Gausss Lemma . . . . . . . .
12.4 Factoring Integer Polynomials
12.5 Gauss Primes . . . . . . . . . .
12.M Miscellaneous Problems . . . .
13 Quadratic Number Fields
13.1 Algebraic Integers . . . . . .
13.2 Factoring Algebraic
Integers

13.3 Ideals in Z[ 5] . . . . . . .
13.4 Ideal Multiplication . . . . .
13.5 Factoring Ideals . . . . . . .

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.

21
23

.
.
.
.
.
.
.
.
.
.

24
24
25
27
32
33
35
37
38
40
42

.
.
.
.
.
.

45
45
46
50
51
56
59

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

61
61
62
62
63
63

14 Linear Algebra in a Ring

14.1 Modules . . . . . . . . . . . . .
14.2 Free Modules . . . . . . . . . . .
14.4 Diagonalizing Integer Matrices .
14.5 Generators and Relations . . . .
14.7 Structure of Abelian Groups . .
14.8 Applications to Linear Operators
14.M Miscellaneous Problems . . . . .

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

64
64
65
66
66
67
67
69

.
.
.
.
.

15 Fields
15.2 Algebraic and Transcendental Elements
15.3 The Degree of a Field Extension . . . .
15.4 Finding the Irreducible Polynomial . . .
15.6 Adjoining Roots . . . . . . . . . . . . .
15.7 Finite Fields . . . . . . . . . . . . . . .
15.8 Primitive Elements . . . . . . . . . . .
15.9 Function Fields . . . . . . . . . . . . . .
15.10 The Fundamental Theorem of Algebra .
15.M Miscellaneous Problems . . . . . . . . .
16 Galois Theory
16.1 Symmetric Functions . . . . . . .
16.2 The Discriminant . . . . . . . . .
16.3 Splitting Fields . . . . . . . . . . .
16.4 Isomorphisms of Field Extensions
16.5 Fixed Fields . . . . . . . . . . . .
16.6 Galois Extensions . . . . . . . . .
16.7 The Main Theorem . . . . . . . .
16.8 Cubic Equations . . . . . . . . . .
16.9 Quartic Equations . . . . . . . . .
16.10 Roots of Unity . . . . . . . . . . .
16.11 Kummer Extensions . . . . . . . .
16.12 Quintic Equations . . . . . . . . .
16.M Miscellaneous Problems . . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

70
70
71
72
73
74
76
77
77
78

.
.
.
.
.
.
.
.
.
.
.
.
.

81
81
83
86
86
87
88
88
91
92
94
95
95
96

2
2.1

Groups
Laws of Composition

Exercise 2.1.2. Prove the properties of inverses that are listed near the end of the
section.
Remark. The properties are listed on p. 40 as the following:
(a) If an element a has both a left inverse l and a right inverse r, i.e., if la = 1
and ar = 1, then l = r, a is invertible, r is its inverse.
(b) If a is invertible, its inverse is unique.
(c) Inverses multiply in the opposite order: If a and b are invertible, so is the
product ab, and (ab)1 = b1 a1 .
(d) An element a may have a left inverse or a right inverse, though it is not
invertible.
Proof of (a). We see l = lar = r.
Proof of (b). Let b, b0 be inverses of a. Then, b = bab0 = b0 , by (a).
Proof of (c). Consider ab. We see that b1 a1 is the inverse of ab since (b1 a1 )(ab) =
b1 a1 ab = b1 b = 1 by associativity. Uniqueness follows by (b).
Proof of (d). Consider Exercise 2.1.3 below. s is not invertible since it does not have
a two-sided inverse, but it does have a left inverse.
Exercise 2.1.3. Let N denote the set {1, 2, 3, . . .} of natural numbers, and let s : N
N be the shift map, defined by s(n) = n + 1. Prove that s has no right inverse, but
that it has infinitely many left inverses.
Proof. s does not have a right inverse since s does not map any element of N back
to 1; however, we can define a left inverse rk (n) = n 1 for n > 1, and rk (1) = k for
some k N; we see that this is a left inverse of s, i.e., that rk s = idN . Since k is
arbitrary this implies that there is an infinite number of rk s.

2.2

Groups and Subgroups

Exercise 2.2.3. Let x, y, z, and w be elements of a group G.

(a) Solve for y, given that xyz 1 w = 1.
(b) Suppose that xyz = 1. Does it follow that yzx = 1? Does it follow that
yxz = 1?
4

Solution for (a). We claim that y = x1 w1 z. This follows since

x(x1 w1 z)z 1 w = xx1 w1 zz 1 w = 1.
Solution for (b). Suppose xyz = 1. This implies x1 = yz, and by Exercise 2.1.2(a),
this left inverse is a right inverse, and so 1 = xyz = x(yz) = (yz)x = yzx.
Now consider yxz; the example










1 1
0 1
0 1
1 0
1 1
x=
, y=
, z=
, xyz =
, yxz =
0 1
1 0
1 1
0 1
1 0
in GL2 (R) shows that xyz = 1 does not imply yxz = 1.
Exercise 2.2.4. In which of the following cases is H a subgroup of G?
(a) G = GLn (C) and H = GLn (R).
(b) G = R and H = {1, 1}.
(c) G = Z+ and H is the set of positive integers.
(d) G = R and H is the set of positive reals. 

a 0
(e) G = GL2 (R) and H is the set of matrices
, with a 6= 0.
0 0
Solution for (a). H is a subset since R C implies H GLn (R). H is a subgroup
since GLn (R) is a group, hence contains an identity and is closed under multiplication
and inversion.
Solution for (b). H is a subgroup since it is clearly a subset, contains the identity 1,
and 1 1 = 1 implies H is closed under multiplication and inversion.
Solution for (c). H is not a subgroup since 1
/ H, though it is the inverse of 1.
Solution for (d). H is a subgroup since it is clearly a subset, contains 1, is closed
under multiplication since the product of two positive real numbers is a positive real
number, and since x H has inverse 1/x H, which is still positive and real.
Solution for (e). H is not a subgroup since it is not even a subset of G.

2.4

Cyclic Groups

Exercise 2.4.1. Let a and b be elements of a group G. Assume that a has order 7
and that a3 b = ba3 . Prove that ab = ba.
Proof. ab = aba7 = a(ba3 )a4 = a(a3 b)a4 = a4 (ba3 )a = a4 (a3 b)a = ba.
5

Exercise 2.4.3. Let a and b be elements of a group G. Prove that ab and ba have
the same order.
Proof. Suppose (ab)n = 1. We note that b = b(ab)n = (ba)n b, but this implies
(ba)n = 1, and so both have order n.
Exercise 2.4.6.
(a) Let G be a cyclic group of order 6. How many of its elements generate G?
Answer the same question for cyclic groups of order 5 and 8.
(b) Describe the number of elements that generate a cyclic group of arbitrary orders
n.
Solution for (b). By Prop. 2.4.3, if x generates G a cyclic group of order n, another
element xi G generates G if and only if gcd(i, n) = 1 for 1 i n, since then
|xi | = n. Thus, the number of elements that generate G is equal to the number of
numbers less than n that are coprime to n.
Solution for (a). By (b), it suffices to count the number of numbers less than n that
are coprime to n. For 6, {1, 5} are coprime to 6, hence two elements generate the
cyclic group of order 6. For 5, {1, 2, 3, 4} are coprime to 5, hence four elements
generate the cyclic group of order 5. For 8, {1, 3, 5, 7} are coprime to 8, hence four
elements generate the cyclic group of order 8.
Exercise 2.4.9. How many elements of order 2 does the symmetric group S4 contain?




Solution. The order 2 elements of S4 consist of 42 = 6 two-cycles, and 42 12 = 3
products of disjoint two-cycles, and so there are 9 elements of order 2.
Exercise 2.4.10. Show by example that the product of elements of finite order in a
group need not have finite order. What if the group is abelian?
Solution. Consider GL2 (R), and the following matrices in GL2 (R):




1 1
1 0
A=
,
B=
.
0 1
0 1
We see that A2 = B 2 = 1, and so

1
AB =
0

they are of order 2, whereas




1
1 n
n
= (AB) =
,
1
0 1

and so AB has infinite order.

Now suppose the group is abelian. Suppose a, b are our elements of finite order,
of order n, m respectively. Then, (ab)nm = anm bnm = (an )m (bm )n = 1, and so ab is
necessarily of finite order.
6

2.6

Isomorphisms

Exercise 2.6.2. Describe all homomorphisms : Z+ Z+ . Determine which are

injective, which are surjective, and which are isomorphisms.
Solution. By the definition of homomorphism, for all positive n Z+ , we have
(n) = (1) + + (1),
|
{z
}

(n) = (n),

(0) = (n) + (n) = 0.

n times

Thus, is fully determined by what 1 maps to. By the above, we then have that n :
z
nz for n Z+ are all the homomorphisms of Z+ . The injective homomorphisms
consist of those n for n 6= 0. The surjective homomorphisms consist of those n for
n = 1; these are also the isomorphisms of Z+ since they are injective.
Exercise 2.6.3. Show that the functions f = 1/x, g = (x 1)/x generate a group of
functions, the law of composition being composition of functions, that is isomorphic
to the symmetric group S3 .
Solution. We define
1
1
, f3 = 1 x, f4 =
,
x
1x
Then, we can construct the multiplication table:
f1 = x,

f2 =

f1
f2
f3
f4
f5
f6

f1
f1
f2
f3
f4
f5
f6

f2
f2
f1
f6
f5
f4
f3

f3
f3
f4
f1
f2
f6
f5

f4
f4
f3
f5
f6
f2
f1

f5
f5
f6
f4
f3
f1
f2

f5 =

x
,
x1

f6 =

x1
.
x

f6
f6
f5
f2
f1
f3
f4

This proves closure since every combination of factors is accounted for, identity since
every row/column contains e = f1 , and associativity since associativity holds for
composition of rational functions. We claim that this is isomorphic to S3 . This
follows since if we let f1
e, f2
(12), f6
(123), we get the following table:
e
(12) (13) (132) (23) (123)
e
e
(12) (13) (132) (23) (123)
(12) (12)
e
(132) (13) (123) (23)
(13) (13) (123)
e
(23) (132) (12)
(132) (132) (23) (12) (123) (13)
e
(23) (23) (132) (123) (12)
e
(13)
(123) (123) (13) (23)
e
(12) (132)
7

This proves it is a homomorphism since all of the multiplications are accurate, and
is an isomorphism since every element in S3 is mapped to, with inverse defined by
matching entries. This shows f2 , f6 generate the group of functions since (12), (123)
generate S3 as on p. 42.

 

1 1
1
Exercise 2.6.6. Are the matrices
,
conjugate elements of the group
1
1 1
GL2 (R)? Are they conjugate elements of SL2 (R)?
Solution. We explicitly calculate the conjugation for the conjugation matrix A:


 


a11 a12 1 1
1 0 a11 a12
=
a21 a22 0 1
1 1 a21 a22

 

a11 a11 + a12
a11
a12
=
a21 a21 + a22
a11 + a21 a12 + a22
This equality requires a11 = 0, a12 = a21 ; however, we see that then det A < 0 in this
case, so the matrices are not conjugate in SL2 (R).
We see that they are, however, conjugate elements of the group GL2 (R), since


 


0 1 1 1
1 0 0 1
=
.
1 0 0 1
1 1 1 0

2.8

Cosets

Exercise 2.8.4. Does a group of order 35 contain an element of order 5? of order

7?
Solution. Any element in G has order in {1, 5, 7, 35} by Cor. 2.8.10. Suppose G
had no elements of order 5; then, all non-identity elements must have order 7, for if
|x| = 35, then |x7 | = 5. Let h have order 7, and H = hhi; since |H| = 7, pick g
/ H.
Then, g 6= e and has order 7. The left cosets H, gH, g 2 H, . . . , g 6 H must be disjoint,
for, if g a hi = g b hj , then g ab = hij , and so picking r such that r(a b) 1 mod 7,
we have that g = g r(ab) = hr(ij) H, a contradiction. But this contradicts the
counting formula (2.8.8), since |G| = 35 6= 49 = 7 7 = |H|[G : H], and so G contains
an element of order 5.
Now suppose G had no elements of order 7; then all non-identity elements have
order 5 as before. Letting h have order 5 and H, g as before, the same argument gives
that H, gH, g 2 H, . . . , g 4 H are disjoint left cosets in G. This contradicts the counting
formula (2.8.8) again, since |G| = 35 6= 25 = 5 5 = |H|[G : H], hence G contains an
element of order 7.
8

Exercise 2.8.8. Let G be a group of order 25. Prove that G has at least one subgroup
of order 5, and that if it contains only one subgroup of order 5, then it is a cyclic
group.
Proof. Any element in G has order in {1, 5, 25} by Cor. 2.8.10. If G had no elements
of order 5, it must have an element x of order 25, but then |x5 | = 5, hence hx5 i is a
subgroup of order 5.
Now suppose H is the only subgroup of order 5 in G, and pick x
/ H. x has
order 5 or 25 by Cor. 2.8.10 again, and since e H. But |x| = 5 implies H = hxi,
hence x H, and so we know |x| = 25, i.e., G = hxi is cyclic.
Exercise 2.8.10. Prove that every subgroup of index 2 is a normal subgroup, and
show by example that a subgroup of index 3 need not be normal.
Proof. If H 6 G with [G : H] = 2, we see that, picking a
/ H, G = H q aH =
H q Ha, since this is the only we can form cosets of a in G. Thus, aH = Ha, hence
H C G by Prop. 2.8.17.
Now we consider S3 ; the 2-cycle y = (12) generates a subgroup H of order 2, and
therefore of index 3 by the counting formula (2.8.8). However, by the multiplication
table constructed last week, we see that, from (2.8.4) and (2.8.16),
xH = {x, xy} 6= {x, x2 y} = Hx.

2.10

The Correspondence Theorem

Exercise 2.10.3. Let G and G0 be cyclic groups of orders 12 and 6, generated by

elements x and y, respectively, and let : G G0 be the map defined by (xi ) = y i .
Exhibit the correspondence referred to in the Correspondence Theorem explicitly.
Solution. We note that K = ker = {e, x6 }. The subgroups of G that contain these
are hxi, hx2 i, hx3 i, hx6 i, and each correspond to hyi, hy 2 i, hy 3 i, e respectively, which
are all the subgroups of G0 .

2.11

Product Groups

Exercise 2.11.1. Let x be an element of order r of a group G, and let y be an

element of G0 of order s. What is the order of (x, y) in the product group G G0 ?
Solution. The order is lcm(r, s), since (x, y)n = (xn , y n ) = (e, e) implies r, s | n.

Exercise 2.11.3. Prove that the product of two infinite cyclic groups is not infinite
cyclic.
Proof. Recall that a cyclic group must be generated by a single element; since all
infinite cyclic groups are isomorphic to Z, we can consider Z Z. Suppose that (a, b)
is this single element. But then, we see that (2a, b) cannot be obtained from adding
(a, b) to itself, which implies that Z Z is not infinite cyclic.

2.12

Quotient Groups

Exercise 2.12.2. In the general linear group GL3 (R), consider the subsets

1
1 0
H = 0 1 , and K = 0 1 0 ,
0 0 1
0 0 1
where represents an arbitrary real number. Show that H is a subgroup of GL3 , that
K is a normal subgroup of H, and identify the quotient group H/K. Determine the
center of H.
Proof. H 6 GL3 since clearly

1 a11 a21
1 b11
0 1 a22 0 1
0 0
1
0 0
and since

I H,

b21
1 a11 + b11 a21 + b21 + a11 b22
H,
b22 = 0
1
a22 + b22
1
0
0
1

1 a11 a21
1 a11 a21 + a11 a22
0 1 a22 0
= I.
1
a22
0 0
1
0
0
1

We now show that K is a normal subgroup of H. Define ka as the matrix in K

that has the parameter a; we see k0 = I K, ka kb = ka+b , ka ka = I, and so it
only remains to show normality by showing hk = kh for h H, k K, which is
equivalent to hkh1 = k:

1 0 a
1 b11 b21
1 b11 a + b21
1 b11 b21
1 0 a
0 1 0 0 1 b22 = 0 1
b22 = 0 1 b22 0 1 0 .
0 0 1
0 0
1
0 0
1
0 0
1
0 0 1
By the additive nature of the ka relations, we see that K R+ .
10

The quotient group H/K is then represented by matrices of the form

1 b 0
0 1 c ,
0 0 1
i.e., the cosets are these times K, since multiplying by ka only alters the top-right
entry, and so multiplying by ka will keep b, c constant, and therefore remain in the
same coset. Moreover, this generates the entire space since we can multiply arbitrary
ka to a coset with arbitrary parameters b, c.
The center of H contains K, since K commutes with elements of H as shown
above; we claim the center is solely K. If A, B H, then by the above AB = BA is

1 a11 + b11 a21 + b21 + a11 b22

1 a11 + b11 a21 + b21 + a22 b11
0
= 0
.
1
a22 + b22
1
a22 + b22
0
0
1
0
0
1
This implies a11 b22 = a22 b11 . But if A is fixed and B is an arbitrary matrix in H, then
a11 b22 = a22 b11 must hold for all matrices B, and so a11 = a22 = 0, hence A K.
Thus, the center of H is K R+ .
Exercise 2.12.4. Let H = {1, i} be the subgroup of G = C of fourth roots of
unity. Describe the cosets of H in G explicitly. Is G/H isomorphic to G?
Solution. By (2.8.5), cosets aH, bH are equal if and only if b = ah for some h H,
and so if a = re2i , b = se2i for r, s R>0 , , [0, 1), then aH = bH if and
only if r = s and {0, 1/4, 1/2, 3/4}. Hence the cosets of H are {re2 H | r
R>0 , [0, 1/4)}.
Now consider the map : G G, x
x4 . Then, this is trivially a homomorphism of G; it is moreover surjective since any nonzero complex number has a fourth
root. We see that ker = H, and so G/H G by the isomorphism theorem.


a b
Exercise 2.12.5. Let G be the group of upper triangular real matrices
, with
0 d
a and d different from zero. For each of the following subsets, determine whether or
not S is a subgroup, and whether or not S is a normal subgroup. If S is a normal
subgroup, identify the quotient group G/S.
(i) S is the subset defined by b = 0.
(ii) S is the subset defined by d = 1.
(iii) S is the subset defined by a = d.
11

Solution for (i). S 6 G since the diagonal entries would multiply with each other
and not affect the other entries of the matrices, I S, and the inverse can be found
by letting the inverse have entries a1 , d1 . S is not a normal subgroup since


 
 
 


1 1 a 0
a d
a a
a 0 1 1
=
6=
=
.
0 1 0 d
0 d
0 d
0 d 0 1
Solution for (ii). This forms a subgroup since

1 

a b
1/a b/a
=
,
0 1
0
1
implies it is closed under inversion, and


  0

a b a0 b 0
aa ab0 + b
=
,
0 1 0 1
0
1
implies it is closed under multiplication; the identity is trivially in S.
We now see that it is a normal subgroup:



  0

a b a0 b0 1/a b/ad
a (b + ab0 a0 b)/d
=
S.
0 d 0 1
0
1/d
0
1
We see that the quotient group G/S would be represented by matrices of the form


1 0
,
0 d
for d R since this would cover all of G:


 

1 0 a b
a b
=
,
0 d 0 1
0 d
and since each matrix of the form above gives a different coset because multiplying
by elements in S keep d constant.
Solution for (iii). This is a

a
0

subgroup since it satisfies closure:


 

b c d
ac bc + ad
=
S,
a 0 c
0
ac

inverse:


a b
0 a

1


1/a b/a2
=
S,
0
1/a
12

and clearly the identity is in S.

We now check this subgroup is normal:



1  0

a b a0 b 0 a b
a ab0 /d
=
S.
0 d 0 a0 0 d
0
a0
The quotient group G/S would be represented by matrices of the form


1 0
,
0 d
for d R since this would cover all of G:


 

1 0 a b
a b
=
,
0 d 0 a
0 ad
and since each matrix of the form above gives a different coset since multiplying by
elements in S cannot give another matrix of the same form unless d is the same.

Symmetry

6.3

Isometries of the Plane

Exercise 6.3.2. Let m be an orientation-reversing isometry. Prove algebraically

that m2 is a translation.
Proof. By Thm. 6.3.2 and (6.3.3), m2 = tv rtv r = tv rtv r = tv tv0 =
tv+v00 , where v 00 = (r(v)).
Exercise 6.3.6.
(a) Let s be the rotation of the plane with angle /2 about about the point (1, 1)t .
Write the formula for s as a product ta .
(b) Let s denote reflection of the plane about the vertical axis x = 1. Find an
isometry g such that grg 1 = s, and write s in the form ta r.
Solution for (a). By (6.3.3),
s = t(1,1) /2 t(1,1) = t(1,1) t/2 (1,1) /2 = t(2,0) /2 .
Solution for (b). By (6.3.3), letting g = t1,0 /2 ,
s = grg 1 = t(1,0) /2 r/2 t(1,0) = t(1,0) rt(1,0) = t(1,0) t(1,0) r = t(2,0) r.
13

6.4

Finite Groups of Orthogonal Operators on the Plane

Exercise 6.4.2.
(a) List all subgroups of the dihedral group D4 , and decide which ones are normal.
(b) List the proper normal subgroups N of the dihedral group D15 , and identify the
quotient groups D15 /N .
(c) List the subgroups of D6 that do not contain x3 .
Solution for (a). We claim the subgroups of D4 form the lattice diagram
{e}
hyi

hx2 yi

hx2 i

hx3 yi

hx2 , yi

hxi

hx2 , xyi

hxyi

D4
By Lagranges theorem (Thm. 2.8.9), any subgroup H 6 D4 must have |H|
{1, 2, 4, 8}. {e} is the unique order 1 subgroup. The order 2 subgroups are generated by one order 2 element, hence are given by the second row above. The order
4 subgroups are either generated by an order 4 element or by two order 2 elements;
these give the third row. Finally, D4 is the unique order 8 subgroup.
We claim the normal subgroups of D4 are
{e}, hxi, hx2 i, hx2 , yi, hx2 , xyi, D4 .
hx2 i is normal since x2 commutes with all other elements of D4 ; the other proper
subgroups are normal because they are of index 2 by the counting formula (2.8.8),
and by Exercise 2.8.10. Lastly, the other four subgroups in the second row of the
diagram above are not normal since they are not closed under conjugation by x.
Solution for (b). Any proper subgroup H 6 D15 must have |H| {2, 3, 5, 15} by
Lagranges theorem (Thm. 2.8.9). The order 2 subgroups are of the form hxi yi; these
are not normal since they are not closed under conjugation by x. Since 2 - 3, 5, 15,
we know no other subgroup contains an element of the form xi y. Thus, every normal
subgroup of D15 must be of the form hxi i for i = 1, 3, 5, since any other i gives a
subgroup equal to one of these three. These are all in fact normal subgroups since
they are kernels of homomorphisms D15 Di for i = 1, 3, 5 mapping x
x, y
y.
14

By the first isomorphism theorem (Thm. 2.12.10), this implies the quotient groups
for each nontrivial N are isomorphic to
D15 /hxi D1 ,

D15 /hx3 i D3 ,

D15 /hx5 i D5 .

Solution for (c). By Lagranges theorem (Thm. 2.8.9), any subgroup H 6 D6 must
have |H| {1, 2, 3, 4, 6, 12}. {e} is the unique order 1 subgroup, and does not contain
x3 . The order 2 subgroups are hx3 i and hxi yi for 0 i 5; only the first contains
x3 . The unique order 3 subgroup is hx2 i, which does not contain x3 . The order 4
subgroups not containing x3 are of the form hxi y, xj yi for i 6= j since D6 contains no
elements of order 4, but this subgroup is of order 4 if and only if xji = x3 = xij ,
hence there are no order 4 subgroups not containing x3 . The order 6 subgroups must
be generated by an order 2 and an order 3 element, hence those not containing x3
are of the form hx2 , xi yi. But different choices i, j for i give the same subgroup if
and only if i j mod 2, hence the only subgroups of order 6 not containing x3 are
hx2 , yi and hx2 , xyi. The unique order 12 subgroup D16 contains x3 . In summary,
the subgroups that do not contain x3 are
{e}, hyi, hxyi, hx2 yi, hx3 yi, hx4 yi, hx5 yi, hx2 i, hx2 , yi, hx2 , xyi.
Exercise 6.4.3.
(a) Compute the left cosets of the subgroup H = {1, x5 } in the dihedral group D10 .
(b) Prove that H is normal and that D10 /H is isomorphic to D5 .
(c) Is D10 isomorphic to D5 H?
Solution for (a). The cosets are represented by e, x, x2 , x3 , x4 , y, xy, x2 y, x3 y, x4 y.
Solution for (b). To show that H is normal, it suffices to show x5 commutes with
every element of D10 : it trivially commutes with x, and with y since yx5 y = yyx5 =
x5 . Thus H C D10 .
Now the surjective homomorphism D10 D5 sending x
x, y
y has kernel
H, hence D10 /H D5 by the first isomorphism theorem (Thm. 2.12.10).
Solution for (c). Note D5 , D10 by having
x2 , hence to show D10 D5 H,
T x
it suffices by Prop. 2.11.4(d) to show H D5 = {e}, HD5 = G, and H, D5 C G with
this embedding of D5 . The normality of both groups follows by (b) and since D5 is
of index 2 in G (Exercise 2.8.10). Their intersection is e since x5
/ D5 . HD5 = G
5
since x commutes with every element of D5 D10 by (b), and so we can get any
element of the form xi , xi y for 0 i 9.

15

6.5

Discrete Groups of Isometries

Exercise 6.5.5. Prove that the group of symmetries of the frieze pattern C C C C
C C C is isomorphic to the direct product C2 C of a cyclic group of order 2 and
an infinite cyclic group.
Proof. Let G 6 M be the group of symmetries. By Thm. 6.3.2, any symmetry arises
as tv or tv r where tv are translations, are rotations, and r are reflections across
the x-axis. In both cases, must be zero to be a symmetry, and v must be an integer
multiple of the length of C. Hence the group C2 of reflections across the x-axis and
the group C of translations by integer multiples of lengths of C generate G.
We claim C2 C G. Since clearly C2 C = {e}, by Prop. 2.11.4(d) it only
remains to show C2 , C C G. C C G since it has index 2 in G by the classification
of symmetries above, and then by Exercise 2.8.10. C2 C G since our translations all
lie on the x-axis, and then by using (6.3.3).
Exercise 6.5.9. Let G be a discrete subgroup of M whose translation group is not
trivial. Prove that there is a point p0 in the plane that is not fixed by any element of
G except the identity.
Proof. We first claim that the set of points fixed by any nontrivial isometry m G
has Lebesgue measure zero. We proceed by considering each kind of isometry in
Thm. 6.3.4. If m is a nontrivial translation, then there are no fixed points. If m is
a nontrivial rotation around a point p, then p is a fixed point. If m is a nontrivial
reflection about a line `, then any point on ` is a fixed point. If m is a nontrivial glide,
then m has no fixed points. Thus, in all cases the set of fixed points has Lebesgue
measure zero in R2 .
Now for each m 6= e, let Fm be the set of fixed points of m; by the above, it
has Lebesgue measure zero. We claim there are only countably many m G. By
Thm. 6.3.2, any m is of the form tv or tv . By Thm. 6.5.5, there are only countably
many tv . By Prop. 6.5.10, there are only finitely many and r. Thus, there are
only countably many m G.
Finally, the set of all points fixed by some nontrivial element of G has Lebesgue
measure
!
[
X

Fm
(Fm ) = 0,
e6=mG

e6=mG

hence almost all points in R2 are not fixed by any nontrivial element of G.

16

6.6

Plane Crystallographic Groups

Exercise 6.6.2. Let G be the group of symmetries of an equilateral triangular lattice

L. Determine the index in G of the subgroup of translations in G.
Proof. The index of translations is given by [G : T ]. By Theorem 6.3.2, we see that
every isometry should be given by tv r; we therefore want the cardinality of the set
of rs. But this is exactly the set D3 , and so [G : T ] = |D3 | = 6.

6.7

Abstract Symmetry: Group Operations

Exercise 6.7.1. Let G = D4 be the dihedral group of symmetries of the square.

(a) What is the stabilizer of a vertex? of an edge?
(b) G operates on the set of two elements consisting of the diagonal lines. What
is the stabilizer of a diagonal?
Solution for (a). If the vertex lies along the axis of reflection for y, {e, y} is the
stabilizer. If it does not, {e, x2 y} is the stabilizer. If the given edge lies immediately
to the + direction of the line of reflection, the stabilizer is {e, xy}. If it does not,
{e, x3 y} is the stabilizer.
Solution for (b). The stabilizer of the diagonal is {e, x2 , y, x2 y}.
Exercise 6.7.2. The group M of isometries of the plane operates on the set of lines
in the plane. Determine the stabilizer of a line.
Solution. It suffices to consider the classes of isometries in Thm. 6.3.4. The stabilizer
of a line ` consists of translations along `, rotations of an angle about a point p `,
reflections about `, and glide reflections about `.
Exercise 6.7.8. Decompose the set C22 of 22 matrices into orbits for the following
operations of GL2 (C):
(a) left multiplication,
(b) conjugation.
Solution (a). Left multiplication by elements of GL2 (C) corresponds to products of
elementary row operations on matrices in C22 . By row reduction, we know that
applying elementary row operations on a given matrix in C22 gives a unique matrix
of one of the following forms:








1 0
1 a
0 1
0 0
,
,
,
.
0 1
0 0
0 0
0 0
17

Thus, C22 decomposes as





! 

 

a
1 0
1 a
0 1
0 0
GL2 (C)
q
GL2 (C)
q GL2 (C)
q
.
0 1
0 0
0 0
0 0
aC

Solution (b). Since every matrix is conjugate (similar) to a unique Jordan form (up
to ordering of Jordan blocks), we have that the orbits are generated by the different
Jordan forms, i.e., C22 decomposes as

!

!
a
a
1
0
GL2 (C)
q
GL2 (C) 1
.
0
0 2
C

1 2 ,i C

Exercise 6.7.11. Prove that the only subgroup of order 12 of the symmetric group
S4 is the alternating group A4 .
Proof. We first prove a lemma: If H is a subgroup of G, then H is normal if and
only if H is the union of conjugacy classes inSG. But H is normal if and only if it is
closed under conjugation if and only if H = hH G h.
Now suppose H 6 S4 has order 12. Then, by the counting formula (2.8.8),
|S4 | = 24 = 12 [S4 : H] = |H|[S4 : H] implies [S4 : H] = 2, and so H C S4 by
Exercise 2.8.10. So, we use the classification of conjugacy classes in S4 from p. 201,
following Prop. 7.5.1:
Partition
Element No. in Conj. Class
1+1+1+1
e

1
4
2+1+1
(ab)
=6
2

1 4
2+2
(ab)(cd)
=3
2 2

4
3+1
(abc)
2 3 =8
4
(abcd)
3! = 6
Now if H C S4 has order 12, it must arise from a union of conjugacy classes above
including {e} (since it is a subgroup), but the only way this is possible is the sum
1+3+8 = 12. The conjugacy classes associated with these terms are exactly the even
permutations in S4 , which form the subgroup A4 , and so A4 is the only subgroup of
order 12 in S4 .

6.8

The Operation on Cosets

Exercise 6.8.4. Let H be the stabilizer of the index 1 for the operation of the symmetric group G = Sn on the set of indices {1, . . . , n}. Describe the left cosets of H
in G and the map (6.8.4) in this case.
18

Solution. We see that H consists of all cycles that hold 1 fixed, i.e., permutations of
the remaining n 1 elements, hence is isomorphic to Sn1 . We claim
G/H = {(1i)H | i {1, . . . , n}}
Each (1i) gives a different coset since no (1i)H contains (1j) for i 6= j, and then by
(2.8.5). These are all the cosets since by Pop. 6.8.4, |G/H| = |O1 | = n. Thus, the
map  : G/H O1 is the map (1i)
i.

6.9

The Counting Formula

Exercise 6.9.4. Identify the group T 0 of all symmetries of a regular tetrahedron,

including orientation-reversing symmetries.
Solution. T 0 6 O3 (R) operates transitively on the set F of faces of order 4, hence is
given by a permutation of the set {f1 , f2 , f3 , f4 }, and so there is a homomorphism
T 0 S4 by Prop. 6.11.2. This is injective since if t T 0 fixes three faces, then it fixes
the three vectors defining the centers of each face, hence is the identity matrix in
O3 (R). We claim this homomorphism T 0 S4 is surjective, hence an isomorphism;
it suffices to show |T 0 | = 24. But the stabilizer Gf of a given face f is the group
D3 generated by a rotation by 2/3 about the center of f and a reflection about an
axis in f ; |D3 | = 6, and so the counting formula (6.9.2) gives |T 0 | = 6 4 = 24, hence
T 0 S4 .

6.10

Operations on Subsets

Exercise 6.10.1. Determine the orders of the orbits for left multiplication on the
set of subsets of order 3 of D3 .


Solution. We know that there are 63 = 20 subsets of order 3 of D3 ; we also know
by the counting formula (6.9.2) that there can only be orbits of order 1, 2, 3, 6 since
only these divide |D3 |. We see that only the subset {e, x, x2 } is a subgroup, which
produces the orbit {e, x, x2 }, {y, yx, yx2 }. The other 18 subsets form 3 orbits of order
6 of D3 . Letting H1 = {e, x, y}, we have
H1 = {e, x, y},
yH1 = {y, yx, e},

xH1 = {x, x2 , yx2 },

yxH1 = {yx, yx2 , x2 },

x2 H1 = {x2 , e, yx},
yx2 H1 = {y, yx2 , x}.

Letting H2 = {e, x, yx}, we have

H2 = {e, x, yx},
yH2 = {y, yx, x},

xH2 = {x, x2 , y},

yxH2 = {yx, yx2 , e},
19

x2 H2 = {x2 , e, yx2 },
yx2 H2 = {y, yx2 , x2 }.

Letting H3 = {e, x, yx2 }, we have

H3 = {e, x, yx2 },
yH3 = {y, yx, x2 },

xH3 = {x, x2 , yx},

yxH3 = {yx, yx2 , x},

x2 H3 = {x2 , e, y},
yx2 H3 = {y, yx2 , e}.

We therefore have one orbit of order 2 and three orbits of order 6; this means we
have 1 2 + 3 6 = 20 subsets in these orbits, and so we have found all of them.

6.11

Permutation Representations

Exercise 6.11.1. Describe all the ways in which S3 can operate on a set of four
elements.
Solution. By Cor. 6.11.3, it suffices to find all homomorphisms f : S3 S4 . Recall
from p. 42 that S3 is generated by x = (123), y = (12); a homomorphism f is then
fully determined by specifying f (x), f (y). We moreover note that x3 = e, y 2 = e
implies f (x)3 = f (y)2 = e, hence f (x) = e or is one of the eight 3-cycles in S4 by the
classification in Exercise 6.7.11; similarly, f (y) = e or is one of the nine elements of
order 2 in the table from Exercise 6.7.11.
If f (x) = e, then there is no restriction on f (y), thus there are ten homomorphisms f of this kind.
If f (x) = (abc), then since yx has order 2, f (yx)2 = f (y)2 f (x)2 = e. Thus
f (y) 6= e. Now suppose f (y) acts nontrivially on the fourth element d unaffected by
f (x); then without loss of generality, f (y) interchanges a, d, and so f (yx) d = a.
Hence f (yx) must map a
d as well, and so f (y) b = d. But then f (y)2 b =
a 6= b, contradicting that f (y) has order 2. Hence f (y) is a permutation of order
2 of the subset {a, b, c}, which are 2-cycles; assume without loss of generality that
f (y) = (ab). In the argument above, there are 4 choices for the fixed point d of f (x),
3 choices for the fixed point of f (y), and two choices for a = f (x) c. Each choice
gives a homomorphism f by just renaming a, b, c as 1, 2, 3, hence realizing f as the
canonical operation of S3 on the subset {1, 2, 3} {1, 2, 3, 4}. Thus, there are 24
homomorphisms f such that f (x) 6= e.
Exercise 6.11.5. A group G operates faithfully on a set S of five elements, and there
are two orbits, one of order 3 and one of order 2. What are the possible groups?
Hint: Map G to a product of symmetric groups.
Solution. Let S = {1, 2, 3, 4, 5} such that the two orbits are O3 = {1, 2, 3}, O2 =
{4, 5}, respectively. G operates on O3 , O2 separately, hence the action of G on
O3 , O2 respectively correspond to group homomorphisms f3 : G S3 and f2 : G
20

S2 . This defines a group homomorphism f = (f3 , f2 ) : G S3 S2 defined by

g
(f3 (g), f2 (g)). Since G acts faithfully on S, g is injective, hence G f (G) by
Cor. 2.12.11. Now the only group that acts transitively on O2 is S2 itself, and so
f2 (G) S2 . On the other hand, there are two groups that act transitively on O3 :
C3 and S3 . Hence G C3 S2 or S3 S2 .
Exercise 6.11.6. Let F = F3 . There are four one-dimensional subspaces of the space
of column vectors F 2 . List them. Left multiplication by an invertible matrix permutes
these subspaces. Prove that this operation defines a homomorphism : GL2 (F ) S4 .
Determine the kernel and the image of this homomorphism.
Proof. We have the following one-dimensional subspaces, denoting F = {0, 1, 2}:
   
   
   
   
1
2
0
0
1
2
2
1
V1 =
,
, V2 =
,
, V3 =
,
, V4 =
,
.
0
0
1
2
1
2
1
2
Call ei the first listed vector in Vi ; note that Vi = {ei , 2ei }. These are all the subspaces
in F 2 since there are only 3 3 1 = 8 nontrivial vectors in F 2 .
Left multiplication by an invertible matrix defines an action on the vectors in F 2
since left multiplication by matrices in F is associative, and since the identity matrix
defines the trivial action; this descends to a well-defined action on the subspaces Vi
since the span of Aei is equal to the span of 2Aei for any A GL2 (F ). Hence, by
Cor. 6.11.3, this action defines a homomorphism : GL2 (F ) S4 .
Now ker = {I, 2I} since clearly holds, and for A GL2 (F ), Ae1 V1 implies
the first column of A is either e1 or 2e1 , Ae2 V2 implies the second column of A is
either e2 or 2e2 , and Ae3 V3 implies that the coefficients on ei in each column have
to be the same, hence A = I or 2I.
We claim im = S4 . By Cor. 2.8.13, we have |GL2 (F )| = |ker ||im |, and since
|S4 | = 24 and |ker | = 2 from above, it suffices to show |GL2 (F )| = 48. Now every
matrix in GL2 (F ) consists of a pair of linearly independent vectors in F2 ; there are
8 6 = 48 of these pairs by the above decomposition of F2 into subspaces, hence
|GL2 (F )| = 48.

6.12

Finite Subgroups of the Rotation Group

Exercise 6.12.3. Let O be the group of rotations of a cube, and let S be the set of
four diagonal lines connecting opposite vertices. Determine the stabilizer of one of
the diagonals.

21

Solution. O acts on S, hence there is a homomorphism O S4 by Prop. 6.11.2. We

first show this homomorphism is injective. If s O fixes all four diagonals, then
s either fixes or interchanges the two endpoints of each diagonal. If s 6= e, i.e., it
acts nontrivially on the vertexes, then we can pick three pairs of opposite vertexes
such that s interchanges one of the pairs of vertexes, or such that s interchanges all
three pairs of vertexes. In either case, give R3 a basis that points along the three
diagonals connecting these pairs of vertexes; then the matrix for s in this basis has
an odd number of 1s on the diagonal, and so has determinant 1, contradicting
that O 6 SO3 (R). The homomorphism O S4 is surjective, since looking at the
faces of the cube, O acts transitively on the set of faces, and each face has stabilizer
C4 , hence |O| = |Of ||O f | = 4 6 = 24 by the counting formula (6.9.2).
Now we know O acts like S4 on the set of diagonals, hence the stabilizer of one
of the diagonals is the same as fixing one index in the set of indexes {1, 2, 3, 4} as
in Exercise 6.8.4, hence is equal to S3 .
Exercise 6.12.7. The 12 points (1, , 0)t , (0, 1, )t , (, 0, 1)t form the
vertices of a regular icosahedron if > 1 is chosen suitably. Verify this, and determine .
Proof. We have that the 12 points form three categories of the form above. By the
distance formula, if they are in the same category, we have three possibilities for
square distances:
Vertex
Square Distance

Change sign of 1 Change sign of

4
42

Change sign of both

4(2 + 1)

If they are in different categories, then we have two possibilities for square distances.
If our coordinates are (x1 , x2 , x3 ) and (y1 , y2 , y3 ), then there is only one i such that
xi , yi 6= 0, and xi , yi must have different absolute values for each i, giving the table
Vertex
Square Distance

xi , yi have same sign

2(2 + 1)

xi , yi have differing sign

2(2 + + 1)

where for a given vertexes, there are four vertexes each with square distance of each
form above.
We now find . There must be five vertexes of shortest distance from v0 ; by
comparing the possible distances above, this shortest square distance must be equal
to both 4 and 2(2 + 1). This gives the equation

1+ 5
2
2
2( + 1) = 4 = 1 = 0 = =
2
22

by choosing the root greater than 1. This shows each vertex has exactly five neighbors
of distance 2 away from it; we claim that the polyhedron formed by connecting
vertexes of distance 2 away from each other forms an icosahedron.
Now we show each face formed by the edges is a congruent equilateral triangle.
This is true since any face is formed by neighboring vertexes, which are distance 2
away from each other by the above. Each vertex moreover has the same number of
faces meeting there since every vertexes has exactly five neighbors by the above.
Finally, suppose we have two neighboring vertexes v, v 0 forming an edge; we claim
there are only two faces intersecting at that edge. It suffices to show there are only
two vertexes w that are of distance 2 from both. Suppose vi = vi0 = 0; in the
0
following, we consider subscripts mod 3. Then vi+1 = vi+1
with absolute value
0
1, so wi+1 = 0, |wi+2 | = 1, |wi | = 3 by the table above. Next vi+2 = vi+2
, hence
0
wi+2 must have the same sign as vi+2 , vi+2 . Finally, wi can have either sign since
vi = vi0 = 0, hence there are only two vertexes that are of distance 2 from v, v 0 .

6.M

Miscellaneous Problems

Exercise 6.M.7. Let G be a finite group operating on a finite set S. For each element
g of G, let S g denote the subset of elements of S fixed by g: S g = {s S | gs = s},
and let Gs be the stabilizer of s.
(a) We may imagine a true-false table for the assertion that gs = s, say with rows
indexed by elements of G and columns indexed by elements of S. Construct
such a table for the P
action of theP
dihedral group D3 on the vertices of a triangle.
(b) Prove the formula sS |Gs | = gG |S g |.
P
(c) Prove Burnsides Formula: |G| (number of orbits) = gG |S g |.
Solution for (a). We construct the true-false table:
e
x
x2
y
yx
yx2

s1
True
False
False
True
False
False

s2
True
False
False
False
True
False

s3
True
False
False
False
False
True

where S = {s1 , s2 , s3 } is the set of the vertices of the triangle, x = (s1 s2 s3 ) rotations,
and y is the reflection with preferred vertex s1 .

23

Proof of (b). By summing over different sets, we have

X
X
|Gs | = |{(g, s) G S | gs = s}| =
|S g |.
sS

gG

Proof of (c). By the orbit-stabilizer theorem (Prop. 6.8.4) we have that there is a
bijection between cosets G/Gs and orbits Os . By the counting formula (2.8.8), we
then have
|Gs | |Os | = |Gs | |G/Gs | = |G|.
Note in particular that |Gs0 | is equal for all s0 Os since Os = Os0 . Thus,
X
X
X
|G| (number of orbits) =
|G| =
|Gs | |Os | =
|Gs |,
orbits Os

orbits Os

sS

and so, combining (b),

|G| (number of orbits) =

|S g |.

gG

11
11.1

Rings
Definition of a Ring

Exercise 11.1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers.

3
3
3
Proof.
7
+
21x2 + 147x 345 = 0.

2 is a root of (x2 7) 2 2 = x
4
3 + 5 is a root of (x + 2) + 60 = x + 4x2 + 64 = 0.
Exercise 11.1.2. Prove that, for n 6= 0, cos(2/n) is an algebraic number.
Proof. Suppose n > 0. Recall that the Chebyshev polynomials Tn (x) are defined by
the recurrence relations T0 (x) = 1, T1 (x) = x, and Tn (x) = 2x Tn1 (x) Tn2 (x).
We claim Tn (cos ) = cos n for any . This is clear for n = 0, 1. For arbitrary n,
Tn (cos ) = 2 cos Tn1 (cos ) Tn2 (cos )
= 2 cos cos ((n 1)) cos ((n 2))
= cos n + cos ((n 2)) cos ((n 2)) = cos n,
and so Tn (cos ) = cos n for any as desired. Letting = 2/n, we have that
Tn (cos(2/n)) = cos 2 = 1, and so cos(2/n) satisfies the polynomial equation
Tn (x) 1 = 0.
If n < 0, then using the fact that cos(2/n) = cos(2/n), we see cos(2/n)
satisfies the polynomial equation Tn (x) 1 = 0 by the above.
24

Exercise 11.1.3. Let Q[, ] denote

the smallest
subring of C containing the rational
numbers Q and the elements = 2 and = 3. Let = +. Is Q[, ] = Q[]?
Is Z[, ] = Z[]?
Solution. Since Z[, ], Q[, ], the reverse inclusion holds in both cases. We
claim that the inclusion holds for Q, but not Z.
To show Q[, ] Q[], it suffices to show , Q[]. Now 2 = 5+2 Q[],
hence Q[], so = 3 + 2 Q[]. Thus = 2 Q[], and finally
= Q[] as well.
To show Z[, ] 6 Z[], we claim
/ Z[].PIt suffices to show that k only has
k
even coefficients for , for then, any element N
k=0 ak Q[] will have an even
coefficient for , hence cannot be expressed as such a sum.
To prove this, we claim
(
a + b for a, b odd
when k odd
k =
c + d for c odd, d even when k even
This is clear for k = 0, k = 1. For arbitrary n, consider first when k is even. Then,
by inductive hypothesis
k = k1 = (a + b)( + ) = 2a + 3b + (a + b),
for a, b odd, hence 2a + 3b is odd and a + b is even. Likewise, when k is odd,
k = k1 = (c + d)( + ) = (3d + c) + (c + 2d),
for c odd, d even, hence 3d + c, c + 2d are odd, and we are done.

11.2

Polynomial Rings

Exercise 11.2.1. For which positive integers n does x2 + x + 1 divide x4 + 3x3 +

x2 + 7x + 5 in [Z/(n)][x]?
Proof. We will perform the division algorithm on x4 + 3x3 + x2 + 7x + 5. We have
x2 + 2x 2
x2 + x + 1

x4 + 3x3 + x2 + 7x + 5
x4 x3 x2
2x3
+ 7x
2
2
2x 2x 2x
2x2 + 5x + 5
2x2 + 2x + 2
7x + 7
25

and so x4 + 3x3 + x2 + 7x + 5 = (x2 + 2x 2)(x2 + x + 1) + (7x + 7), where the

remainder 7x + 7 0 mod n if and only if n {1, 7}. Hence x2 + x + 1 divides
x4 + 3x3 + x2 + 7x + 5 in [Z/(n)][x] if and only if n {1, 7}.
Exercise 11.2.2. Let F be a field. The set of all formal power series p(t) = a0 +
a1 t + a2 t2 + , with ai in F , forms a ring that is often denoted by F [[t]]. By formal
power series we mean that the coefficients form an arbitrary sequence of elements of
F . There is no requirement of convergence. Prove that F [[t]] is a ring, and determine
the units in this ring.
P
P
P
i
i
i
Proof. We denote
+ defined as
i bi t , r(t)
P p(t) = k i ai t , q(t) =
P =P i ci t . Let
k
p(t) + q(t) = k (ak + bk )t and as p(t) q(t) = k i+j=k ai bj t .
+ makes F [[t]] an abelian group because associativity and commutativity follow
since + is defined termwise, and because having ai = 0 for all i defines an identity
and letting q(t) such that biP
= ai for all iPdefines an inverse for p(t).
is commutative since i+j=k ai bj = i+j=k bi aj , and is associative since
(p(t) q(t)) r(t) =

X X
`

ai bj t` r(t) =

X X

i+j=`

= p(t)

X X
`

ai bj ck t`

i+j+k=`

bj ck t` = p(t) (q(t) r(t)).

j+k=`

The identity is p(t) such that a0 = 1, ai = 0 for all i > 0.

It remains to show the distributive property:
X
X
X X
(p(t) + q(t)) r(t) =
(ai + bi )ti
cj tj =
(ai + bi )cj tk
i

X X
k

ai cj tk +

X X

i+j=k

i+j=k

bi cj tk

i+j=k

= p(t) r(t) + q(t) r(t).

Finally, we claim that the p(t) such that a0 6= 0 are the units. Any unit must
have a0 6= 0, for p(t) q(t) = 1 = a0 b0 = 1. In the other direction, suppose p(t)
is such that a0 6= 0. Define q(t) such that
b0 =

a1
0 ,

bi =

a1
0

i
X
j=1

26

aj bij .

Then, a0 b0 = 1 but
k
X

aki bi = a0 bk + a1 bk1 + a2 bk2 + + ak b0 = 0,

i=0

and so p(t) q(t) = 1.

11.3

Homomorphisms and Ideals

Exercise 11.3.3. Find generators for the kernels of the following maps:
(a) R[x, y] R defined by f (x, y)
f (0, 0),
(b) R[x] C defined by f (x)
f (2 +
i),
(c) Z[x] R defined by f (x) f (1+ 2),
(d) Z[x] C defined by x
2 + 3,
(e) C[x, y, z] C[t] defined by x
t, y
t2 , z
t3 .
Remark. We will denote each map as .
Solution for (a). We claim that (x, y) = ker . By the division algorithm, any polynomial f R[x, y] can be written g + a0 for g (x, y), and so (f ) = a0 = 0 if and
only if a0 = 0 if and only if f = g (x, y).
Solution for (b). We claim that (x2 4x + 5) = ker . x2 4x + 5 = (x (2 + i))(x
(2 i)), hence (x2 4x + 5) ker . Conversely, let f ker . By the division
algorithm, we can write f = g + r for g (x2 4x + 5), where r = a1 x + a0 for
ai R has degree less than 2. Then, (f ) = (g) + (r) = a1 (2 + i) + a0 , which is
zero only if a1 = a0 = 0, i.e., only if f = g (x2 4x + 5).

2
2
Solution
for (c). We2 claim that (x 2x1) = ker . x 2x1 = (x(1+ 2))(x
(1 2)), hence (x 2x 1) ker . Conversely, let f ker . By the division
algorithm, we can write f = g + r for g (x2 4x + 5), where r = a1 x + a0 for
ai Z
has degree less than 2, since x2 2x 1 is monic. Then,
(f ) = (g) + (r) =

a1 (1 + 2) + a0 , which is zero only if a1 = a0 = 0 since 1, 2 are linearly independent

over Z, i.e., only if f = g (x2 2x 1).
2
Solution for (d). We claim that (x4 10x
+ 1) = ker
.
We have (x4 10x2 + 1)

ker , since (x4 10x2 + 1) = ( 2 + 3)4 10( 2 + 3)2 + 1 = 0. Conversely,

27

let f ker . By the division algorithm, we can write f = g + r, where r =

a3 x3 + a2 x2 + a1 x + a0 for ai Z has degree less than 4. Then,

(f ) = (g + r) = r( 2 + 3)

= a3 ( 2 + 3)3 + a2 ( 2 + 3)2 + a1 ( 2 + 3) + a0

= (11a3 + a1 ) 2 + (9a3 + a1 ) 3 + (2a2 ) 6 + (5a2 + a0 ).

This gives rise to the system of equations represented by the matrices

1 0 5 0
a0
0
0 0 2 0 a1 0

0 1 0 9 a2 = 0 ,
0 1 0 11
a3
0

since 2, 3, 6, 1 are linearly independent over Z. But, this only has the trivial
solution a0 = a1 = a2 = a3 = 0, since


1 0 5 0 




1 0 0 


0 0 2 0 





 = 2 0 1 9  = 2 1 9  = 2(11 9) = 4 6= 0,
0 1 0 9 


1 11


0 1 11
0 1 0 11
which implies f = g (x4 10x2 + 1).
Solution for (e). We claim that (x2 y, x3 z, y 3 z 2 ) = ker . Clearly, (x2 y, x3
z, y 3 z 2 ) ker , since
(x2 y) = t2 t2 = 0,

(x3 z) = t3 t3 = 0,

(y 3 z 2 ) = t6 t6 = 0.

Conversely, we first regard f as a polynomial in z whose coefficients are in x, y,

as in Corollary 11.3.8. We can apply the division algorithm to get f = g1 + r1 for
g1 (y 3 z 2 ), where r1 is of degree less than 2 in z. If r1 = 0, then f (y 3 z 2 ), and
so we are done. If not, then we can apply the division algorithm again with x2 y,
this time in y, on r1 to have r1 = g2 + r2 for g2 (x2 y), where r2 is of degree 0 in
y, and degree less than 2 in z. If r2 = 0, then f = g1 + g2 (y 3 z 2 , x2 y), and
so we are done. If not, then we can apply the division algorithm again with x3 z,
this time in x, on r2 to have r2 = g3 + r3 for g3 (x3 z), where r3 is of degree less
than 2 in x, degree 0 in y, and degree less than 2 in z. This means that we have
(r3 ) = (a101 xz + a001 z + a100 x + a000 ) = a101 t4 + a001 t3 + a100 t + a000 = 0,
and the linear independence of tk over C implies that r3 = 0, and so f = g1 +g2 +g3
(y 3 z 2 , x2 y, x3 z).
28

Exercise 11.3.5. The derivative of a polynomial f with coefficients in a field F is

defined by the calculus formula (an xn + + a1 x + a0 )0 = nan xn1 + + 1a1 . The
integer coefficients are interpreted in F using the unique homomorphism Z F .
(a) Prove the product rule (f g)0 = f 0 g + f g 0 and the chain rule (f g)0 = (f 0 g)g 0 .
(b) Let be an element of F . Prove that is a multiple root of a polynomial f if
and only if it is a common root of f and of its derivative f 0 .
P
P
P
ProofP
of (a). Let f =
ai x i , g =
bj xj . Then by (11.2.7), f g =
ck xk , where
ck = i+j=k ai cj , and so
!
0

fg=

(i + 1)ai+1 x

!
X

i0

bj x

j0

X X

(i + 1)ai+1 bj xk ,

k0 i+j=k

and similarly
!
f g0 =

ai x i

i0

!
X

(j + 1)bj+1 xj

j0

X X

(j + 1)ai bj+1 xk .

k0 i+j=k

Thus,
!
X

k0

i+j=k

k0

i+j=k+1

f 0g + f g0 =

(i + 1)ai+1 bj + (j + 1)ai bj+1 xk

!

k0

(k + 1)

iai bj + jai bj

xk

ai bj xk =

i+j=k+1

(k + 1)ck+1 xk = (f g)0 .

k0

Proof of (b). Suppose f F [x]. Then, f = (x )k g for some k 0 and g F [x]

such that g() 6= 0. By (a), f 0 = k(x )k1 g + (x )k g 0 if k 1, and f 0 = g 0 if
k = 0. Hence f () = f 0 () = 0 if and only if k 2, i.e., is a multiple root of f if
and only if is a common root of f, f 0 .
Exercise 11.3.7. Determine the automorphisms of the polynomial ring Z[x].
Proof. Suppose Aut(Z[x]). Then (1) = 1, hence
n = (1) + + (1) = (1| + {z
+ 1}) = (n).
|
{z
}
n times

n times

29

Pn
Pn
j
j
Thus, if f =
j=0 bj x Z[x], then (f ) =
j=0 bj (x) , and so is uniquely
determined by (x).
P
So let (x) = di=0 ai xi . Then,
!d
d
n
d
X
X
X
(f ) =
ai
bj x j
= ad bn xnd + +
ai bdj .
(1)
i=0

j=0

i=0

hence deg((f )) = nd. Suppose f Z[x] is the unique element such that (f ) = x.
Then, nd = 1 and ad bn = 1 imply that d = 1 and a1 {1}. Thus (x) = x + a
for a Z, i.e., every Aut(Z[x]) must map x
x+a for a Z. Finally, all such
give automorphisms of Z since they define ring homomorphisms by the equation
(1), and since Z[x + a] = Z[x].
Exercise 11.3.8. Let R be a ring of prime characteristic p. Prove that the map
R R defined by x
xp is a ring homomorphism. (It is called the Frobenius
map).


Proof. We first claim that for p prime, p | pi if 1 i p 1. By definition,
 
p
p(p 1) (p i + 1)
=
.
i
i(i 1) 2 1
1 i implies p appears in the

numerator, and i pp
1 implies

p does not appear
p
p
in the denominator. Since i Z, this implies p | i , hence i = 0 R.
Now if x, y R, the binomial theorem gives
p  
p1  
X
X
p i pi
p i pi
p
p
p
(x + y) =
xy
=x +y +
xy
= xp + y p
i
i
i=0
i=1
Thus x
xp respects addition. Since trivially 1
1 and (xy)p = xp y p , we therefore
p
have that x
x defines a ring homomorphism R R.
Exercise 11.3.9.
(a) An element x of a ring R is called nilpotent if some power is zero. Prove that
if x is nilpotent, then 1 + x is a unit.
(b) Suppose that R has prime characteristic p 6= 0. Prove that if a is nilpotent
then 1 + a is unipotent, that is, some power of 1 + a is equal to 1.
Proof of (a). Suppose xN = 0. Then
(1 + x)(1 x + x2 + (1)N 1 xN 1 ) = 1 xN = 1,
hence 1 + x is a unit.
30

Proof of (b). Suppose aN = 0. By Exercise 11.3.8, x

xp is a homomorphism
R R, so (1 + a)p = 1 + ap . Iterating this map n times such that pn N gives
n
n
n
(1 + a)p = 1 + ap = 1 + aN ap N = 1.
Exercise 11.3.10. Determine all ideals of the ring F [[t]] of formal power series with
coefficients in a field F (see Exercise 11.2.2).
Solution. We claim all nonzero ideals are of the form (tn ) for some n. Let I be an
ideal and p I such the number n := min{i | ai 6= 0} is minimal. We claim I = (tn ).
First, p = tn q for some unit q, hence (tn ) I. Conversely, any r I has first nonzero
coefficient at degree n, hence tn s for some s F [[t]], and so r (tn ).
Exercise 11.3.11. Let R be a ring, and let I be an ideal of the polynomial ring
R[x]. Let n be the lowest degree among nonzero elements of I. Prove or disprove: I
contains a monic polynomial of degree n if and only if it is a principal ideal.
Proof of . If I = 0, then it is principal so suppose not. Let f be a monic polynomial
of lowest degree n. We claim (f ) = I. f I hence (f ) I. Now suppose g I;
then, by division with remainder we can write g = f q + r, where if r 6= 0, it has
degree lower than f . But then, f, g I, hence g f q = r I, so r = 0, and
g (f ).
Counterexample for . Consider I = (2x) Z[x]. Any element in I is obtained by
multiplying 2x by a polynomial of degree 1, in which case we get an element of
degree 2, or by multiplying by an element of Z. But then, 2
/ Z , hence there is
no monic polynomial of degree 1 in I.
Exercise 11.3.12. Let I and J be ideals of a ring R. Prove that the set I + J of
elements of the form x + y, with x in I and y in J, is an ideal. This ideal is called
the sum of the ideals I and J.
Proof. Let (x + y), (x0 + y 0 ) I + J and s R, where x, x0 I, y, y 0 J. Then,
s(x + y) + (x0 + y 0 ) = (sx + x0 ) + (sy + y 0 ) I + J, hence I + J is an ideal.
Exercise 11.3.13. Let I and J be ideals of a ring R. Prove that the intersection
I J is an ideal. Show by example that the set P
of products {xy | x I, y J} need
not be an ideal, but that the set of finite sums
x y of products of elements of I
and J is an ideal. This ideal is called the product ideal, and is denoted by IJ. Is
there a relation between IJ and I J?

31

Proof. Let x, y I J and s R. Then, sx + y I and sx + y J since I, J are

ideals, hence sx + y I J and so I J is an ideal.
Now let R = Z[x], I = (2, x), J = (3, x). Then, 3x, 2x are in the set of products,
but their
2x = x is not, and so the set of products is not anP
ideal.
Pdifference
P 0 3x
0
0
0
xi yi , xi yP
xi y i +
i IJ and s R, where xi , xi I, yi , yi J. Then, s
P Let
P
x0i yi0 = sxi yi + x0i yi0 IJ, hence IJPis an ideal.
We have in general IJ I J since
xi yi for xi I, yi J has xi yi I J.
IJ = I J if I + J = (1) by Exercise 11.6.8(a).
I J IJ does not hold in general, for if R = Z, I = (m), J = (n), then
I J = (lcm(m, n)) but IJ = (mn).

11.4

Quotient Rings

Exercise 11.4.2. What does the Correspondence Theorem tell us about ideals of Z[x]
that contain x2 + 1?
Solution. By the Correspondence Theorem (Thm. 11.4.3), there is a bijective correspondence between the ideals of Z[x] that contain x2 + 1 and the ideals of Z[x]/(x2 +
1) Z[i], where these two rings are isomorphic as in Ex. 11.4.5. By Prop. 12.2.5(c),
Z[i] is a Euclidean domain, hence a principal ideal domain by Prop. 12.2.7. Thus,
every ideal in Z[i] is of the form (a + bi) for a, b Z. These correspond to ideals
(a + bx) in Z[x]/(x2 + 1) by the isomorphism i
x from above, hence the ideals in
2
2
Z[x] containing x + 1 are of the form (a + bx, x + 1).
Exercise 11.4.3. Identify the following rings: (a) Z[x]/(x2 3, 2x + 4), (b) Z[i]/(2 +
i), (c) Z[x]/(6, 2x 1), (d) Z[x]/(2x2 4, 4x 5), (e) Z[x]/(x2 + 3, 5).
Solution for (a). We see that 2(x2 3) (x 2)(2x + 4) = 2 (x2 3, 2x + 4), and
so (x2 3, 2x + 4) = (x2 3, 2x + 4, 2) = (x2 3, 2), since 2(x + 2) = 2x + 4. Then,
Z[x]/(x2 3, 2x + 4) = Z[x]/(x2 3, 2). But then, Z[x]/(x2 3, 2) F2 [x]/(x2 3) =
F2 [x]/(x2 + 1) = F2 [x]/(x + 1)2 since x2 + 1 = (x + 1)2 in F2 .
Solution for (b). First recall Z[i] Z[x]/(x2 + 1). Thus, Z[i]/(2 + i) Z[x]/(x2 +
1, 2 + x). We first consider the quotient Z[x]/(2 + x). Since (2 + x) is the kernel of
the homomorphism Z[x] Z[2], f (x)
f (2), we see that this is isomorphic to
Z, as in Example 11.4.5. Then, we have that the residue of g = x2 + 1 is 5, and so
we have Z[i]/(2 + i) Z/5Z = F5 .
Solution for (c). We first note 6x 3(2x 1) = 3 (6, 2x 1), and so (6, 2x 1) =
(3, 2x 1). Also, 3x (2x 1) = x + 1 (3, 2x 1), and so (3, 2x 1) = (3, x + 1).
Thus, Z[x]/(6, 2x 1) = Z[x]/(3, x + 1) F3 [x]/(x + 1) = F3 .
32

Solution for (d). Since (4x + 5)(4x 5) 8(2x2 4) = 7 (2x2 4, 4x 5), hence
(2x2 4, 4x 5) = (7, 2x2 4, 4x 5). Hence Z[x]/(2x2 4, 4x 5) = Z[x]/(7, 2x2
4, 4x5) = F7 [x]/(2x2 4, 4x5). In F7 [x], 4(2x2 4) = x2 +5 and 2(4x5) = x+4,
hence (2x2 4, 4x5) = (x2 +5, x+4). But x+4 | x2 +5, hence (x2 +5, x+4) = (x+4).
Finally, F7 [x]/(2x2 4, 4x 5) = F7 [x]/(x2 + 5, x + 4) = F7 [x]/(x + 4) F7 .
Solution for (e). We see Z[x]/(x2 + 3, 5) F5 [x]/(x2 + 3). But since x2 + 3 6= 0 for
any x F5 ,
we see that we cannot reduce x2 + 3. But in F5 , x2 + 3 = x2 2, and so
we have F5 [ 2].
Exercise 11.4.4. Are the rings Z[x]/(x2 + 7) and Z[x]/(2x2 + 7) isomorphic?
Solution. We claim they are not. Let R = Z[x]/(x2 + 7) and S = Z[x]/(2x2 + 7).
Asume : R S is an isomorphism. (1) = 1, hence (2) = 2, and so if
is an isomorphism, then R/(2) S/(2). We claim this is a contradiction. For,
R/(2) F2 [x]/(x2 + 1) 6= 0, whereas S/(2) F2 [x]/(1) = 0.

11.5

Adjoining Elements

Exercise 11.5.1. Let f = x4 +x3 +x2 +x+1 and let denote the residue of x in the
ring R = Z[x]/(f ). Express (3 + 2 + )(5 + 1) in terms of the basis (1, , 2 , 3 )
of R.
Proof. We first have (x3 + x2 + x)(x5 + 1) = x8 + x7 + x6 + x3 + x2 + x. We then
perform the division algorithm:
x4
x4 + x3 + x2 + x + 1

x8 + x7 + x6
+ x3 + x2 + x
x8 x7 x6 x5 x4
x5 x4 + x3 + x2 + x
x5 + x4 + x3 + x2 + x
2x3 + 2x2 + 2x

and so (3 + 2 + )(5 + 1) = 23 + 22 + 2 Z[x]/(f ).

Exercise 11.5.3. Describe the ring obtained from Z/12Z by adjoining an inverse of
2.
Solution. Let R = (Z/12Z)[x]/(2x 1) be our ring; it is isomorphic to Z[x]/(12, 2x
1). (12, 2x 1) = (3, 2x 1) since clearly holds and 12x2 (3 + 6x)(2x 1) =
3 (12, 2x 1). Thus R Z[x]/(3, 2x 1) F3 [x]/(2x 1). But 2 F
3 , hence
F3 [x]/(2x 1) F3 , so R F3 .
33

Exercise 11.5.4. Determine the structure of the ring R0 obtained from Z by adjoining an element satisfying each set of relations.
(a) 2 = 6, 6 = 15, (b) 2 6 = 0, 10 = 0, (c) 3 + 2 + 1 = 0, 2 + = 0.
Solution for (a). Z[] = Z[x]/(2x6, 6x15). But (6x15)3(2x6) = 3 (2x
6, 6x15), and 3(x2)(2x6) = x (2x6, 6x15) imply (2x6, 6x15) = (x, 3).
Thus, Z[] Z[x]/(3, x) Z/3Z = F3 .
Solution for (b). Z[] = Z[x]/(2x 6, x 10). But (2x 6) 2(x 10) = 14 (2x
6, x10) and (x10)+14 = x+4 (2x6, x10) imply (2x6, x10) = (x+4, 14),
since 2x 6 = 2x(x + 4) 14. Thus, Z[] Z[x]/(x + 4, 14) Z/14Z.
Solution for (c). Z[] = Z[x]/(x3 + x2 + 1, x2 + x). But x3 + x2 + 1 x(x2 + x) =
1 (x3 + x2 + 1, x2 + x), and so Z[] Z[x]/(1) = 0, the zero ring.
Exercise 11.5.6. Let a be an element of a ring R, and let R0 be the ring R[x]/(ax1)
obtained by adjoining an inverse of a to R. Let denote the residue of x (the inverse
of a in R0 ).
(a) Show that every element of R0 can be written in the form = k b, with b
in R.
(b) Prove that the kernel of the map R R0 is the set of elements b of R such
that an b = 0 for some n > 0.
(c) Prove that R0 is the zero ring if and only if a is nilpotent (see Exercise 11.3.9).
P
Proof of (a). Any element R0 can be written as a finiteP
sum
bk k . Letting K
Kk
be the largest k such that bk 6= 0, we see that defining b =
a
bk , K b = .
Proof of (b). Let a (R) = {b R | an b = 0 for some n > 0}, and call the map
defined ; it suffices to show a (R) = 1 ((ax 1)), where (ax 1)P R[x]. But
b R has (b) (ax 1) if and only if (ax 1)g = b for some g =
gi xi R[x].
Solving recursively, we must have gi = ai b for all i. Such a g exists if and only if
b a (R), for otherwise g would be an infinite sum.
Proof of (c). a is nilpotent if and only if 1 a (R). By the proof of (b), this holds
if and only if 1 (ax 1), and since R[x] R0 is surjective, this holds if and only
if R0 = 0 by the first isomorphism theorem (Thm. 11.4.2(b)).

34

11.6

Product Rings

Exercise 11.6.1. Let : R[x] CC be the homomorphism defined by (x) = (1, i)

and (r) = (r, r) for r R. Determine the kernel and the image of .
Solution. is the evaluation map f
(f (1), f (i)). So f ker f (1) =
2
f (i) = 0 f ((x 1)(x + 1)), i.e., ker = ((x 1)(x2 + 1)).
We now claim im = R C. clearly holds. Now let (c, a + bi) R C. Then,
if f = a3 x3 + a2 x2 + a1 x + a0 R[x] is of degree 3,
(f ) = (a3 + a2 + a1 + a0 , ia3 a2 + a1 i + a0 )
= (a3 + a2 + a1 + a0 , (a0 a2 ) + (a1 a3 )i),
and the condition f

(c, a + bi) gives the system of equations

a0 + a1 + a2 + a3 = c
a0
a2
=a

a1
a3 = b

which has a solution by linear algebra, hence also holds, and im = R C.

Exercise 11.6.2. Is Z/(6) isomorphic to the product ring Z/(2) Z/(3)? Is Z/(8)
isomorphic to Z/(2) Z/(4)?
Solution. Letting R = Z/(6), I = (2), J = (3) in Exercise 11.6.8(c), we have Z/(6)
Z/(2) Z/(3), since IJ = 0 in R.
Z/(8) 6 Z/(2)Z/(4), for Z/(8) has an additive element of order 8 while Z/(2)
Z/(4) does not.
Exercise 11.6.3. Classify rings of order 10.
Proof. Let R be a ring of order 10. By the Sylow Theorems (Thms. 7.7.2, 7.7.4, 7.7.6),
the abelian group (R, +) contains exactly one normal subgroup each of orders 2 and 5,
with trivial intersection, hence by Prop. 2.11.4(d), (R, +) Z/(2) Z/(5) Z/(10).
It remains to show R Z/(10) also as a ring. Let a R be an element of order 10;
a then generates R, and so 1 R implies na = 1 for some 1 n 9. If n = 2, then
5a = 2a 5a = 10a2 = 0, contradicting that a has order 10; similarly, n 6= 5. Thus,
na = 1 has order 10, and generates R, hence R Z/(10).
Exercise 11.6.4. In each case, describe the ring obtained from the field F2 by adjoining an element satisfying the given relation:
(a) 2 + + 1 = 0, (b) 2 + 1 = 0, (c) 2 + = 0.
35

Remark. Since each equation is of degree 2, we can write F2 [] = {0, 1, , + 1} by

Prop. 11.5.5(a) in each case.
Solution for (a). Since ( + 1) = 2 + = 1, every element of F2 [] has an inverse.
Thus, we have a field of order 4, i.e., F2 [] = F4 .
Solution for (b). F2 [] = F2 [x]/(x2 + 1) = F2 [i], the ring of Gauss integers mod 2.
We see ( + 1)2 = 2 + 1 = 0, and so 2 = 1, ( + 1) = 2 + = + 1. This is
not a field, or even an integral domain, since ( + 1)2 = 0.
Solution for (c). We have 2 = , and so by Prop. 11.6.2 we have F2 [] F2 []
(+1)F2 []. Since F2 [] = {0, } and (+1)F2 [] = {0, +1} are both isomorphic
to F2 , we see that F2 [] F2 F2 .
Exercise 11.6.5. Suppose we adjoin an element satisfying the relation 2 = 1 to
the real numbers R. Prove that the resulting ring is isomorphic to the product R R.
Proof. The resulting ring is R = R[x]/(x2 1). Let : R[x] R R be defined
by f
(f (1), f (1)). ker = (x2 1) = ((x + 1)(x 1)), and so by the first
isomorphism theorem (Thm. 11.4.2(b)) it suffices to show is surjective, inducing
an isomorphism R R R. Letting f = ax + b R[x] of degree 1, we have
(ax + b) = (a + b, a b),
which can be solved for arbitrary (a + b, a b) = (x, y) by linear algebra.
Exercise 11.6.6. Describe the ring obtained from the product ring RR by inverting
the element (2, 0).
Solution. Using the isomorphism in Exercise 11.6.5, since x + 1

(2, 0), the ring is

R[x, y]
R[x, (x + 1)1 ]
R[x, (x + 1)1 ]
R[x, (x + 1)1 ]

=
=
R,
(x2 1, (x + 1)y 1)
(x2 1)
((x + 1)(x 1))
(x 1)
since x + 1 has residue 2 in R[x]/(x 1), which already has an inverse in R.
Exercise 11.6.7. Prove that in the ring Z[x], the intersection (2) (x) of the
principal ideals (2) and (x) is the principal ideal (2x), and that the quotient ring
R = Z[x]/(2x) is isomorphic to the subring of the product ring F2 [x] Z of pairs
(f (x), n) such that f (0) n modulo 2.

36

Proof. Clearly (2x) (2) (x). Conversely, if f (2) (x), then f = 2g = xh for
some g, h Z[x]. But this implies g (x), hence f (2x).
P
Now
consider
the
ring
homomorphism

:
Z[x]

F
[x]

Z
where
ai x i
2
P
(ai xi , a0 ), where ai is the residue of ai in F2 . We claim (Z[x]) = S := {(f (x), n)
F2 [x] Z | f (0) n mod 2}. By
(Z[x]) S; conversely, any
P construction,
(f (x), n) S must have f (x) =
ai xi where a0 = P
n, and so choosing representatives ai of ai in Z such that a0 = n, we see that
ai xi 7 (f (x), n), hence
(Z[x]) S.
Finally we show ker = (2x). (2x) ker by construction. Conversely, (f ) =
(0, 0) = a0 = 0 and 2 | ai for i 6= 0, hence f (2) (x) = (2x) by the above.
Thus, R S by the first isomorphism theorem (Thm. 11.4.2(b)).
Exercise 11.6.8. Let I and J be ideals of a ring R such that I + J = R.
(a) Prove that IJ = I J (see Exercise 11.3.13).
(b) Prove the Chinese Remainder Theorem: For any pair a, b of elements of R,
there is an element x such that x a modulo I and x b modulo J. (The
notation x a modulo I means that x a I.)
(c) Prove that if IJ = 0, then R is isomorphic to the product ring (R/I) (R/J).
(d) Describe the idempotents corresponding to the product decomposition in (c).
Proof of (a). Clearly IJ I J. In the other direction, let u+v = 1 for u I, v J.
Then, if x I J, x = x(u + v) = xu + xv IJ.
Proof of (b). It suffices to show the ring homomorphism : R R/I R/J defined
by x 7 (x+I, x+J) is surjective. Let (a+I, b+J) R/I R/J. Since I +J = R, we
have u + v = 1 for some u I, v J. Let x = bu + av. Then, (x) = (x + I, x + J) =
(av + I, bu + J) = (a(1 u) + I, b(1 v) + J) = (a + I, b + J).
Proof of (c). By definition in (b) ker = I J, and by (a), ker = IJ = 0, and so
we are done by the first isomorphism theorem (Thm. 11.4.2(b)).
Solution for (d). By (b), if u + v = 1 for u I, v J, then (v) = (1, 0) and
(u) = (0, 1). Hence the idempotents corresponding to the product decomposition
in (c) are the images of u, v from partitions of unity u + v = 1 for u I, v J.

11.7

Fractions

Exercise 11.7.1. Prove that a domain of finite order is a field.

37

Proof. Suppose R is a finite domain, and consider R := R \ {0}. It suffices to show

any r R is a unit. If |R | = n, then r R R since R is a domain, and
|r R | = n by the cancellation law (11.7.1). Hence 1 r R , and so rr0 = 1 for
some r0 R .
Exercise 11.7.2. Let R be a domain. Prove that the polynomial ring R[x] is a
domain, and identify the units in R[x].
Proof. Let f, g R[x] be nonzero, and suppose f g = 0. If deg f = d, deg g = d0 ,
then deg f g = d + d0 since the product ad bd0 of their leading coefficients is nonzero,
contradicting that deg f g is undefined. Hence R[x] is a domain.
If f g = 1 then deg f g = d + d0 = 0, so f and g are constant polynomials. Viewing
constant polynomials as elements of R, the units of R[x] are then the units of R.
Exercise 11.7.3. Is there a domain that contains exactly 15 elements?
Solution. Suppose R is such a domain; it is a field by Exercise 11.7.1. It suffices to
show any finite field F has order pn for some prime power pn , since 15 cannot be
written in this way. By Lem. 3.2.10, F has characteristic p for some prime p, and
so contains Fp . Then, F is of finite dimension n as a vector space over Fp , and so
contains pn elements.
Exercise 11.7.4. Prove that the field of fractions of the formal power series F [[x]]
over a field F can be obtained by inverting the element x. Find a neat description of
the elements of that field (see Exercise 11.2.2).
P
i
Proof. Take an element fg in the field of fractions of F [[x]] and suppose g =
i=n ai x
with n 0 and an 6= 0. Then, g = xn g0 , where g0 is a unit of F [[x]] by Exercise 11.2.2,
f g 1
and so fg = x0n . Thus, the field of fractions of F [[x]] is contained in F [[x]][x1 ], and
the reverse inclusion is clear, and so the field of fractions
is F [[x]][x1 ].
P of F [[x]]
i
This is the ring of infinite series of the form h = in ai x for n Z, which is
called the ring of formal Laurent series F ((x)).

11.8

Maximal Ideals

Exercise 11.8.1. Which principal ideals in Z[x] are maximal ideals?

Solution. We claim that none are. Suppose (f ) Z[x] is maximal. Then, deg f > 0,
for otherwise (f ) ( (f, x) ( Z[x], contradicting maximality of (f ). Now choose p
such that p - ai for any coefficient ai of f . Then, (f ) ( (p, f ) since p
/ (f ), and
(p, f ) ( Z[x] since Z[x]/(p, f ) = Fp [x]/(f ) 6= 0. Thus, (f ) cannot be maximal.
38

Exercise 11.8.2. Determine the maximal ideals of each of the following rings:
(a) R R, (b) R[x]/(x2 ), (c) R[x]/(x2 3x + 2), (d) R[x]/(x2 + x + 1).
Solution for (a). The units in R R are elements (a, b) for a, b 6= 0, and so any
maximal ideal in R R cannot contain a pair (a, 0) and (0, b) for a, b 6= 0. Hence
every element in a maximal ideal of R R must have the same coordinate equal to
zero, and so it is of the form R 0 or 0 R since 0 0 is not maximal; these are
maximal by Prop. 11.8.2(b) since taking quotients gives R, a field.
Solution for (b). The ideals in R[x]/(x2 ) are the ideals in R[x] containing (x2 ) by the
correspondence theorem (Thm. 11.4.3). Since R[x] is a PID by Props. 12.2.5, 12.2.7,
the only proper ideals containing (x2 ) are (x) and (x2 ), since if x2 (f ), then x2 = f g
implies f | x2 . We have (x2 ) ( (x), and so (x) is the only maximal ideal.
Solution for (c). x2 3x + 2 = (x 2)(x 1) and (x 2) + (x 1) = R[x] implies
R[x]/(x2 3x + 2) R[x]/(x 1) R[x]/(x 2) R R by Exercise 11.6.8(c).
The maximal ideals of R R are R 0 and 0 R as in (a), which correspond to
(x 2), (x 1), respectively, in R[x]/(x2 3x + 2).
Solution for (d). We note that x2 + x + 1 has no real roots, and so is irreducible in
R[x]. Thus, (x2 +x+1) maximal and R[x]/(x2 +x+1) is a field with unique maximal
ideal (0) by Prop. 11.8.2.
Exercise 11.8.3. Prove that the ring F2 [x]/(x3 +x+1) is a field, but that F3 [x]/(x3 +
x + 1) is not a field.
Proof. By Prop. 11.8.2(b), it suffices to show (x3 + x + 1) is maximal in F2 [x] but not
in F3 [x]. But this is true since x3 +x+1 has no roots in F2 (03 +0+1 = 1 = 13 +1+1),
while x3 + x + 1 has the root 1 in F3 (13 + 1 + 1 = 0), hence (x3 + x + 1) ( (x 1).
Exercise 11.8.4. Establish a bijective correspondence between maximal ideals of R[x]
and points in the upper half plane.
Proof. R[x] is a PID by Props. 12.2.5, 12.2.7, and so any maximal ideal is of the
form (f ). But (f ) is maximal if and only if f is an irreducible nonunit in R[x].
Every polynomial in R[x] of degree at least 3 has a real root, and therefore is not
irreducible. So, every maximal ideal is of the form (f ) for f a linear polynomial or
an irreducible quadratic polynomial.
Now recall we can identify the upper half plane with the subset of C of elements z
with Im(z) 0. Therefore, we can define the function H that sends every maximal
ideal (f ) to the root of f in the upper half plane. Notice that the function is
39

well-defined: if f is linear, then it has only one solution, a real number, and if f is an
irreducible quadratic polynomial, then z and z are the roots of f , for some z C \ R,
so only one of the roots is in the upper half-plane.
We need to show H is a bijection. We define the inverse H 1 sending z to the
ideal generated by x z if z R, and (x z)(x z) otherwise. H 1 is clearly a
two-sided inverse of H since (f ) = (cf ) for any c R, and so we are done.

11.9

Algebraic Geometry

Exercise 11.9.4. Let U and V be varieties in Cn . Prove that the union U V and
the intersection U V are varieties. What does the statement U V = mean
algebraically? What about the statement U V = Cn ?
Proof. Let U be defined by {f1 , . . . , fr }, and V by {g1 , . . . , gs }. U V is defined by
{f1 , . . . , fr , g1 , . . . , gs } since x U V if and only if fi (x) = 0 for all i and gj (x) = 0
for all j. We claim U V is equal to the variety W defined by {fi gj }i,j . U V W
since if x U (resp. V ), then fi = 0 for all i (resp. gj = 0 for all j), hence fi gj = 0
for all i, j. Conversely, suppose x W \ U V . Then, there exists i0 , j0 such that
fi0 (x), gj0 (x) 6= 0, and so fi0 gj0 6= 0, a contradiction.
Now by Thm. 11.9.1 and Cor. 11.9.3, U V = if and only if the quotient ring
C[x1 , . . . , xn ]/(f1 , . . . , fr , g1 , . . . , gs ) = 0, i.e., (f1 , . . . , fr , g1 , . . . , gs ) = (1).
Now U V = Cn if and only if any point x Cn is a common zero of all fi gj .
But there are only finitely many fi gj with finitely many zeros each, and so this holds
if and only if all the fi gj are equal to 0, which is true if and only if all the fi or all
the gj are 0, if and only if U or V equals Cn .
Exercise 11.9.5. Prove that the variety of zeros of a set {f1 , . . . , fr } of polynomials
depends only on the ideal they generate.
Proof. For sets of polynomials {f1 , . . . , fr } and {g1 , . . . , gs }, let V, W be the varieties
formed by their zero sets and let I, J be the ideals they generate, respectively. We
claim I J implies V W . Every gj can then be written as
Pa linear combination
of the fi , hence if x V , fi (x) = 0 for all i, and so gj (x) =
ai fi (x) = 0 for all j
as well, i.e., V W .
Finally, if I = J, then V W and W V , and so V = W . Thus, the variety
defined by a set {f1 , . . . , fr } depends only on the ideal (f1 , . . . , fr ).
Exercise 11.9.6. Prove that every variety in C2 is the union of finitely many points
and algebraic curves.

40

Proof. Let U be defined by {f1 , . . . , fr }, and let g = gcd(f1 , . . . , fr ); g exists since

C[x, y] is a UFD (Thm. 12.3.10). Then, U = V W , where V is defined by g and
W by {f1 /g, . . . , fr /g} as in Exercise 11.9.4. W is the union of finitely many points
by Thm. 11.9.10 since gcd(gcd(f1 /g, . . . , fr1 /g), fr /g) = Q
gcd(f1 /g, . . . , fr /g) = 1.
V is the union of finitely many algebraic curves since g = gi for some irreducible
polynomials gi , hence V is the union of curves defined by gi as in Exercise 11.9.4.
Exercise 11.9.11. Let C1 and C2 be the zeros of quadratic polynomials f1 and f2
respectively that dont have a common linear factor.
(a) Let p and q be distinct points of intersection of C1 and C2 , and let L be the
(complex) line through p and q. Prove that there are constants c1 and c2 , not
both zero, so that g = c1 f1 + c2 f2 vanishes identically on L. Prove also that g
is the product of linear polynomials.
(b) Prove that C1 and C2 have at most 4 points in common.
Proof of (a). Let (t) = (1 t)p + tq parametrize L C2 . Then, f1 ((t)), f2 ((t))
are quadratic in t, and so c1 f1 ((t)) + c2 f2 ((t)) is at most quadratic in t for any
ci C. Let t0 C \ {0, 1}, and choose ci such that c1 f1 ((t0 )) + c2 f2 ((t0 )) = 0;
we can moreover choose ci to be nonzero. Then, h(t) = c1 f1 ((t)) + c2 f2 ((t)) is at
most quadratic in t hence has at most two zeros if h 6= 0 by the fundamental theorem
of algebra (Thm. 15.10.1); but h(0) = h(1) = h(t0 ) = 0 implies h(t) = 0. Hence
g = c1 f1 + c2 f2 vanishes identically on L.
Now since g vanishes on L, by unique factorization (Thm. 12.3.10) g = gL g 0 for
some linear polynomial gL that defines L. g is at most quadratic, hence g 0 is either
linear or constant. In either case, g is then a product of linear polynomials.
Proof of (b). Suppose C1 C2 contains more than four points. Let g as in (a). Then,
g = c1 f1 + c2 f2 implies that C1 C2 {g = 0}. g is either the product of one
or two linear polynomials as in (a), and so C1 C2 is contained in either one or
two lines. In either case, this implies at least three points in C1 C2 lie on one line
parametrized by (t). Then, f1 ((t)), f2 ((t)) are quadratic and both vanish at three
values of t, and so f1 ((t)) = f2 ((t)) = 0 by the fundamental theorem of algebra
(Thm. 15.10.1). Thus, f1 , f2 have infinitely many common zeros in C2 , hence have a
common linear factor by Thm. 11.9.10, a contradiction.
Exercise 11.9.12. Prove in two ways that the three polynomials f1 = t2 + x2 2,
f2 = tx1, f3 = t3 +5tx2 +1 generate the unit ideal in C[x, t] in two ways: by showing
that they have no common zeros, and also by writing 1 as a linear combination of
f1 , f2 , and f3 with polynomial coefficients.

41

Proof. We first show that there are no common zeros. If f2 (x, t) = 0, then x, t 6= 0
and t = x1 . Thus,
f1 (x, x1 ) = x2 2 + x2 = x2 (x4 2x2 + 1) = x2 (x2 1)2 ,
hence if f (x, t) = 0 as well, then (x, t) = (1, 1). But f3 (1, 1) = 7, f3 (1, 1) = 5,
hence f1 , f2 , f3 have no common zeros, and (f1 , f2 , f3 ) = (1) by Exercise 11.9.4.
Now we write 1 as a linear combination of f1 , f2 , f3 . 1 can be expressed as

(6t2 x 24tx2
142t2 352tx
+ 53t 36x
)f1
1
+ ( 12t2 x 24tx2 36x3 + 284t2 568tx + 12x2 + 36t + 140x 1278)f2
1225
+(
6tx + 12x2 + 142t + 68x 53)f3
which we found by using Macaulay2.
Exercise 11.9.13. Let : C[x, y] C[t] be a homomorphism that is the identity on
C and sends x
x(t), y
y(t) and such that x(t) and y(t) are not both constant.
Prove that the kernel of is a principal ideal.
Proof. We claim ker is principal. If not, then ker contains two elements f, g
that do not have a common factor. We claim they do not have a common factor in
C(x)[y]. For, suppose h C(x)[y] is a common factor; then, h = a1 h0 for some
a C[x], h0 C[x, y] by clearing denominator. Assuming without loss of generality
that nothing of the form x divides h0 , then h0 divides f, g in C(x)[y], hence also
does in C[x, y] by Prop. 11.9.9, contradicting that f, g do not have a common factor.
Therefore, there exist r0 , s0 C(x)[y] such that r0 f + s0 g = 1, and clearing
denominators we get rf +sg = q C[x] for some r, s C[x]. This implies ker C[x]
is nontrivial, but this is a contradiction for any g ker C[x] must satisfy g(x(t)) =
0 for all t, hence g = 0.

11.M

Miscellaneous Problems

Exercise 11.M.3. Let R denote the set of sequences a = (a1 , a2 , a3 , . . .) of real

numbers that are eventually constant: an = an+1 = . . . for sufficiently large n.
Addition and multiplication are componentwise, that is, addition is vector addition
and multiplication is defined by ab = (a1 b1 , a2 b2 , . . .). Prove that R is a ring, and
determine its maximal ideals.
Proof. Denote a to be the real number a converges to. R is a ring since sums and
products of eventually constant sequences are eventually constant, commutativity
42

and associativity of +, and the distributive property follow since addition and
multiplication are defined componentwise, and R has additive identity (0, 0, . . .),
additive inverses a = (a1 , a2 , . . .) for a, and multiplicative identity (1, 1, . . .).
We now want to find its maximal ideals. Consider for each i Z>0 the map
i : R R defined by a
ai ; since +, are defined termwise, and 0
0, this
defines a ring homomorphism. It is moreover surjective, hence mi := ker i = {a |
ai = 0} is maximal by Prop. 11.8.2(a). Now consider the map : R R defined by
mapping a to the real number it converges to; since 0
0 and a + b = a + b, ab = ab,
this defines a ring homomorphism. It is moreover surjective, hence m := ker =
{a | a = 0} is maximal by Prop. 11.8.2(a).
We claim these are all the maximal ideals. It suffices to show if m R is maximal
and not equal to mi , it is equal to m . So suppose not; then, there exists a m such
that a 6= 0. There are therefore finitely many i such that ai = 0. Since m 6= mi , for
each i there exists a sequence ai with aii 6= 0; we can moreover assume aij = 0 for all
j 6= i by multiplying by the sequence in R with 1 in the ith index and 0 otherwise.
X
b=a+
ai m
{i|ai =0}

is then a unit in m, since bi 6= 0 for all i, contradicting maximality of m.

Exercise 11.M.4.
(a) Classify rings R that contain C and have dimension 2 as a vector space over
C.
(b) Do the same for rings that have dimension 3.
Solution for (a). Let {1, r} be a basis for R, and let : C[x] R be defined by
1
1, x
r. is then surjective, and ker = (f ) for some f C[x] since C[x] is
a PID (Props. 12.2.5, 12.2.7), giving R C[x]/(f ) by the first isomorphism theorem
(Thm. 11.4.2(b)). deg f > 1 since otherwise {1, r} would be linearly dependent; since
r2 = ar + b R for some a, b C, we then have f = x2 ax b = (x 1 )(x 2 )
for some 1 , 2 C. If 1 = 2 =: , then
R C[x]/(f ) C[x]/(x2 )
by composing with the isomorphism defined by x
(x 2 ) = R as ideals, hence

x + . If 1 6= 2 , then (x 1 ) +

R C[x]/(f ) C[x]/(x 1 ) C[x]/(x 2 ) C C

by Exercise 11.6.8(c). Hence the two possibilities are R C[x]/(x2 ) or C C.
43

Solution for (b). Suppose there exists r R such that {1, r, r2 } is a basis for R.
Then, defining the map : C[x] R by x
r, we again have that ker = (f ) for
deg f > 2, since if deg f 2 then {1, r, r2 } would not be linearly independent. Also,
r3 = ar2 + br + c for some a, b, c C, and so f = x3 ax2 bx c. If f has one
triple root , then
R C[x]/((x )3 ) C[x]/(x3 ).
If f has a double root and a simple root 0 , then since ((x )2 ) + (x 0 ) = R as
ideals,
R C[x]/((x )2 )(x 0 ))
C[x]/((x )2 ) C[x]/(x 0 )
C[x]/(x2 ) C
by the same argument as before. Finally, if f has three distinct roots, then
R C[x]/((x 1 )(x 2 )(x 3 ))
C[x]/(x 1 ) C[x]/(x 2 ) C[x]/(x 3 )
CCC
by repeated applications of Exercise 11.6.8(c) since, for example, ((x 1 )(x 2 )) +
(x 3 ) = R as ideals.
Now suppose no r R exists such that {1, r, r2 } is a basis for R. Thus, if {1, r, s}
is a basis for R, then
r 2 = a1 r + c 1 ,

s 2 = b2 s + c 2 ,

rs = a3 r + b3 s + c3

for some ai , bi , ci C. We claim we can assume c1 = c2 = 0. For, changing

coordinates r
r + gives
(r + )2 = a1 (r + ) + c1 = r2 = (a1 2)r (2 + a1 c1 ),
and so letting be such that 2 + a1 c1 = 0, we have r2 = a1 r. Similarly for s,
we have s2 = b2 s. We then have
(r + zs)2 = r2 + 2zrs + z 2 s2
= (a1 + 2a3 z)r + (b2 z 2 + 2b3 z)s + 2c3 z
= Az (r + s) + Bz
for some Az , Bz C since {1, r + zs, (r + zs)2 } is linearly dependent. Thus,
Az = a1 + 2a3 z = b2 z 2 + 2b3 z,
44

Bz = 2c3 z.

Since the first equation must hold for all z, we have a1 = b2 = 0, hence r2 = s2 = 0,
and also a3 = b3 . This implies (rs)2 = r2 s2 = 0, but since also
(rs)2 = (a3 r + a3 s + c3 )2
= 2a23 rs + 2a3 c3 r + 2a3 c3 s + c23
= 2a3 (a23 + c3 )r + 2a3 (a23 + c3 )s + c3 (2a23 + c3 ),
we have a3 (a23 + c3 ) = c3 (2a23 + c3 ) = 0. If one of a3 , c3 is nonzero, then the other is
also. But this is impossible, and so we have a3 = b3 = c3 = 0.
Finally, let : C[x, y] R be defined by 1
1, x
r, y
s. is then surjective, giving R C[x, y]/ker by the first isomorphism theorem (Thm. 11.4.2(b)).
We know I := (x2 , y 2 , xy) ker , and the reverse inclusion holds since for any
f C[x, y], f r + s + mod I for some , , C, and f
0 in the composition C[x, y]/I C[x, y]/ker R if and only if = = = 0 since {1, r, s} is a
basis for R, i.e., if and only if f I. Thus, in this case R C[x, y]/(x2 , y 2 , xy).
In summary, there are four possibilities for R:
C[x, y]/(x2 , y 2 , xy),

12
12.1

C[x]/(x3 ),

C[x]/(x2 ) C,

C C C.

Factoring
Factoring Integers

Exercise 12.1.4. Solve the following simultaneous congruences:

(a) x 3 modulo 8, x 2 modulo 5,
(b) x 3 modulo 15, x 5 modulo 8, x 2 modulo 7,
(c) x 13 modulo 43, x 7 modulo 71.
Solution for (a). x = 27 = 8 3 + 3 = 5 5 + 2.
Solution for (b). x = 93 = 15 6 + 3 = 8 11 + 5 = 7 13 + 2.
Solution for (c). x = 2421 = 56 34 + 13 = 34 71 + 7.
Exercise 12.1.5. Let a and b be relatively prime integers. Prove that there are
integers m and n such that am + bn = 1 modulo ab.
Proof. Since a, b are relatively prime, am + bn = 1 mod ab if and only if am + bn =
1 mod a and am + bn = 1 mod b. Note am + bn = bn mod a, and am + bn = am mod b.

45

Now consider a, a2 , a3 , . . . mod b. There are only b equivalence classes 0, 1, . . . , b

1 mod b, hence for some i < j we have ai aj mod b. Then, ai (aji 1) 0 mod b,
and so b | ai (aji 1). But a, b are relatively prime, hence b | aji 1. Thus, letting
m := j i, we have am 1 mod b.
By the same argument working mod a, there exists n such that bn 1 mod a,
and so am + bn 1 mod a and mod b, hence am + bn 1 mod ab.

12.2

Unique Factorization Domains

Exercise 12.2.1. Factor the following polynomials into irreducible factors in Fp [x].
(a) x3 + x2 + x + 1, p = 2, (b) x2 3x 3, p = 5, (c) x2 + 1, p = 7
Solution for (a). Let f (x) = x3 + x2 + x + 1. Since f (1) = 0, we can then factor out
x + 1 to get f (x) = (x + 1)(x2 + 1). Now since 12 + 1 = 0, x2 + 1 can be factored
into (x + 1)(x + 1), and so we have f (x) = (x + 1)3 .
Solution for (b). Let f (x) = x2 3x 3. Since f (1) = f (2) = 0, we claim f (x) =
(x1)(x2); this follows since (x1)(x2) = x2 3x+2 x2 3x3 mod 5.
Solution for (c). Since f (x) = x2 + 1 6= 0 for all x F7 (f (0) = 1, f (1) = 2, f (2) =
5, f (3) = 3, f (4) = 3, f (5) = 5, f (6) = 2), we know it is irreducible in F7 [x].
Exercise 12.2.2. Compute the greatest common divisor of the polynomials x6 + x4 +
x3 + x2 + x + 1 and x5 + 2x3 + x2 + x + 1 in Q[x].
Solution. We perform the Euclidean algorithm (p. 45):
x6 + x4 + x3 + x2 + x + 1 = x(x5 + 2x3 + x2 + x + 1) + (x4 + 1)
x5 + 2x3 + x2 + x + 1 = x(x4 + 1) + (2x3 + x2 + 2x + 1)




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


3 2 3 8
2x3 + x2 + 2x + 1 =
x +
x+0
4
4 3
Since the last nonzero remainder is 34 x2 + 34 , the greatest common divisor is x2 +1.
Exercise 12.2.5 (partial fractions for polynomials).
(a) Prove that every element of C(x) can be written as a sum of a polynomial and
a linear combination of functions of the form 1/(x a)i .
(b) Exhibit a basis for the field C(x) of rational functions as vector space over C.
46

Proof of (a). We first show that f (x)/(x a)i C(x) can be so written, where
(x a)i - f (x) C[x]. We apply the Euclidean algorithm (p. 45) considering f (x)
as an element in C[x] i times to obtain
f (x) = q1 (x)(x a) + r1
= (q2 (x)(x a) + r2 )(x a) + r1
..
.
= qi (x)(x a)i + ri1 (x a)i1 + + r2 (x a) + r1 ,
for some rj C, and qi (x) C(x). Dividing this out by (x a)i , we have
f (x)
ri1
r2
r1
= qi (x) +
+ +
+
.
i
i1
(x a)
(x a)
(x a)
(x a)i
Now suppose we have arbitrary f (x)/g(x) C(x), where we can
Qnassume without
loss of generality that gcd(f, g) = 1. We can first write g(x) = i=1 (x ai )i for
ai C, i N, by the fundamental theorem of algebra (Thm. 15.10.1) (and moving
any unit factor into f (x)). If n = 1, we are done by the above, and so we proceed by
induction on n. If g(x) has n distinct roots, we can write g(x) = (xa)j h(x) for some
a C, j N, h(x) C[x] where h(x) has n 1 distinct roots. Since (x a)j , h(x)
share no roots, they are relatively prime and so 1 = r(x)(x a)j + s(x)h(x) for some
r(x), s(x) C[x]. Multiplying throughout by f (x)/g(x) gives
f (x)
r(x)
s(x)
=
+
,
g(x)
h(x) (x a)j
where the first term can be written as in the statement by inductive hypothesis, and
the second by the above paragraph.
Proof of (b). We claim that
i

B = {x : i N}

[


1
: a C, i N
(x a)i

is a basis for C(x) over C. We see that this set spans C(x) by (a); it suffices to show
that any finite subset of this set is linearly independent to show this is a basis. Let
S ( B be finite, and suppose it is linearly dependent. Then,
X
jJ

cj x j +

X
iI

bi
= 0,
(x ai )i

47

where J indexes the xj S and I the 1/(x ai )i S. Let D(x) be the product of
all the denominators appearing in the sum on the right; then,
!
X
X
b
i
D(x)
cj x j +
= 0,
(x ai )i
jJ
iI
and so cj = 0 for all j since the powers of x that come from the sum over J have
higher degree than those that come from the sum over I. Thus, we have
D(x)

X
iI

bi
= 0.
(x ai )i

But then, all the bi must equal zero, for suppose not. Then, we can write
D(x)

X
{iI|a1 6=ai }

bi
= D(x)
(x ai )i

X
{iI|a1 =ai }

bi
(x ai )i

Note that the left side has all terms divisible by x a1 , while the right side has no
terms divisible by x a1 . Suppose the right side is zero; then the left side is nonzero
mod x a0 for any a0 6= a1 , while the right side is zero mod x a0 . If the right side
is nonzero, then the left side is zero mod x a1 and the right side is nonzero mod
x a1 . In either case this is a contradiction, and so cj = bi = 0 for all i, j, and B is
linearly independent.
Exercise 12.2.6. Prove that
the following are Euclidean domains:
2i/3
(a) Z[], = e
; (b) Z[ 2].

Proof. Let = or 2. In either case Z[] = {x + y | x, y Z}. We claim that

(x + y) := |x + y|2 is an appropriate size function. This simplifies to
(x + y) = |x + y|2 = (x + y)(x + y) = x2 + xt( + ) + y 2 ||2 .

(2)

We claim this is a nonnegative integer in both cases. If = , then + = 1 and

||2 = 1, and so
(x + y) = x2 xy + y 2 x2 2xy + y 2 = (x y)2 Z0 .
If =

2, then 2 + 2 = 0 and | 2|2 = 2, and so

(x + y) = x2 + 2y 2 Z0 .
48

Now suppose a, b Z[] are given; we want to show the property in (12.2.4) holds.
First, we have
b
ba
= 2 = s + t,
a
|a|
for some p, q Q, since ba Z[] and |a|2 Z by (2). We can then find q Z[]
close to s + t, by letting
1
1
where |x s| , |y t| ,
2
2
which is possible since every rational lies within 1/2 of an integer. By (2), if = ,

2
b

 q  = |(s x) + (t y)|2 = (s x)2 (s x)(t y) + (t y)2 3 < 1,
a

4

and if = 2,

2
b



 q  = (s x) + (t y) 22 = (s x)2 + 2(t y)2 3 < 1.
a

4
q = x + y,

Multiplying throughout by |a|2 and letting r = b aq, we either get r = 0 or

(r) = |b aq|2 < |a|2 = (a),
and so our function is an appropriate size function.
Exercise 12.2.9. Let F be a field. Prove that the ring F [x, x1 ] of Laurent polynomials (Chapter 11, Exercise 5.7) is a principal ideal domain.
Proof. It suffices by Prop. 12.2.7 to show that F [x, x1 ] is a Euclidean domain. We
define the size function (f ) as deg+ (f )deg (f ), where deg+ (f ) denotes the largest
power of x in f and deg (f ) denotes the smallest power of x in f , both including
negative powers. (f ) Z0 by considering possible values for the degree function.
Now consider the Euclidean algorithm on f where we divide by g. Let p = x deg (f )
and q = x deg (g) ; note they are both units in F [x, x1 ]. Then, f p, gq have all
non-negative exponents and
deg(gq) = deg+ (gq) = deg+ (g) deg (g) = (g).
Thus, f p, gq F [x]. We can then apply the Euclidean algorithm (p. 45) on f p, gq
in F [x] to get (f p) = r(gq) + s, where r, s F [x], and s = 0 or deg(s) < deg(gq)
by the Euclidean algorithm in F [x]. Then, dividing by p throughout, we get f =
g(rqp1 ) + sp1 , and (12.2.4) holds since either sp1 = 0, or
(sp1 ) = (s) = deg(s) < deg(gq) = (g).
49

12.3

Gausss Lemma

Exercise 12.3.1.
Let denote thehomomorphism Z[x] R defined by
(a) (x) = 1 + 2, (b) (x) = 12 + 2.
Is the kernel of a principal ideal? If so, find a generator.

Solution for (a). We want to find the polynomials f (x) such that f (1 +
2) = 0.
Using the canonical embedding of Z[x] into R[x], we see that(x (1 + 2))would
generate the kernel of in R[x]. But then, since (x (1 + 2))(x (1 2)) =
x2 2x 1, and (x2 2x 1) Z[x], we obtain (x2 2x 1) ker , as an ideal
in Z[x]. But
x2 2x 1 is primitive and irreducible in Q[x], since its roots
since
are (1 2), x2 2x 1 is irreducible in Z[x] by Prop. 12.3.7(a). Now suppose
that f (x) ker \ (x2 2x 1). By the Euclidean algorithm dividing f (x) by
x2 2x 1,
we can assume without loss of generality that f (x) = ax + b. But then,
(f ) = a+a 2+b 6= 0 unless a = b = 0, and so we see that (x2 2x1) = ker .
Solution for (b). We proceed similarly
to (a). Considering the embedding of Z[x]
into R[x], we first see that (x ( 12 + 2)) would generate the kernel in R[x], which

contains (x ( 12 + 2))(x ( 12 2)) = x2 x 74 . x2 x 74 is in Q[x], and is

irreducible since the roots are in the
extension R[x] as in (a). But then since Q is
a field, (4x2 4x 7) = x2 x 74 as ideals. This former ideal is generated by a
primitive and irreducible element in Q[x], which as an element of Z[x] is irreducible
as well by Prop. 12.3.7(a). We thus have (4x2 4x 7) ker . Now suppose that
f (x) ker \ (4x2 4x 7). But taking the canonical embedding of Z[x] into Q[x],
and seeing that the latter is a principal ideal domain since Q is a field, we obtain that
f (x) (4x2 4x7) as an ideal in Q[x]. But then, 4x2 4x7 | f (x) in Q[x], and by
Thm. 12.3.6, this implies 4x2 4x 7 | f (x) in Z[x]; thus (4x2 4x 7) = ker .
Exercise 12.3.2. Prove that two integer polynomials are relatively prime elements
of Q[x] if and only if the ideal they generate in Z[x] contains an integer.
Proof. f, g Z[x] are relatively prime in Q[x] if and only if af + bg = 1 for some
a, b Q[x]. By clearing denominators of a, b, this is true if and only if a0 f + b0 g = d
for some a0 , b0 Z[x], d Z, which is equivalent to saying (f, g) Z 6= .
Exercise 12.3.4. Let x, y, z, w be variables. Prove that xy zw, the determinant of
a variable 2 2 matrix, is an irreducible element of the polynomial ring C[x, y, z, w].
Proof. Suppose xy zw factors as pq for p, q
/ C, where p = a0 + a1 + a2 and q =
b0 + b1 + b2 for ai , bi homogeneous of degree i or zero. We claim p, q are homogeneous
of degree one; we proceed by comparing degrees. a0 b0 = 0 hence without loss of
50

generality a0 = 0. a1 b0 = 0 as well; if a1 = 0, then b1 = b2 = 0, contradicting that

q
/ C, hence a1 6= 0, b0 = 0. This implies b2 = 0, hence p, q are homogeneous of
degree one.
Thus, since xy zw = x2 (y/x z/x w/x) = x2 (p/x)(q/x), xy zw is reducible
only if y/x z/x w/x is reducible in C[y/x, z/x, w/x]. Relabeling variables and
taking the contrapositive, it suffices to show t rs is irreducible in C[r, s, t]. But
C[r, s, t]/(t rs) C[r, s], a domain, hence t rs is prime (Prop. 13.5.1(a)) and
thus irreducible since C[r, s, t] is a domain (Lem. 12.2.10).
Exercise 12.3.6. Let be a complex number. Prove that the kernel of the substitution map Z[x] C that sends x
is a principal ideal, and describe its generator.
Proof. Let be this map. By the mapping property of fractions (Thm. 11.7.2(c),
which is still true if is not injective), we have the commutative diagram

Z[x]

Q[x]
Since Q[x] is a Euclidean domain, ker is principal. We claim it is generated by the
polynomial f of minimal degree which has as a root, or zero if is transcendental.
For, in the former case, if g ker , we can write g = f q + r by the Euclidean
algorithm, and r 6= 0 implies deg r < deg f , contradicting the minimality of f .
We claim if f = cf0 as in Lem. 12.3.5 for f0 primitive, then ker = (f0 ).
(f0 ) ker by the commutativity of the diagram, so it suffices to show the opposite inclusion. Let g ker . Then, f | g in Q[x] by the above, hence f0 | g in Z[x]
by Thm. 12.3.6(a). Thus ker is generated by f0 , the primitive polynomial obtained
from f as above, or is zero if is transcendental.

12.4

Factoring Integer Polynomials

Exercise 12.4.4. Factor the integer polynomial x5 + 2x4 + 3x3 + 3x + 5 mod 2,

mod 3, and over Q.
Remark. We denote f (x) = x5 + 2x4 + 3x3 + 3x + 5.
Solution for F2 . f (x) = x5 + x3 + x + 1 over F2 . Then, f (1) = 0, hence f (x) = (x +
1)(x4 +x3 +1). Now x4 +x3 +1 has no roots in F2 hence has no linear factors; x2 +x+1
is the only irreducible quadratic in F2 [x] and has (x2 +x+1)2 = x4 +x2 +1 6= x4 +x3 +1,
hence we cannot factor further.
51

Solution for F3 . f (x) = x5 + 2x4 + 2 over F3 . Then, f (2) = 0, hence f (x) =

(x + 1)(x4 + x3 + 2x2 + x + 2). But 2 is also a root of x4 + x3 + 2x2 + x + 2,
hence f (x) = (x + 1)2 (x3 + 2x + 2), and we cannot factor further since x3 + 2x + 2
has no roots in F3 .
Solution for Q. From (a), (b), we suspect that 1 is a root. Indeed, f (x) = (x +
1)(x4 + x3 + 2x2 2x + 5). The residue x4 + x3 + 1 of the second factor in F2 [x] is
irreducible as in (a), and so x4 +x3 +2x2 2x+5 is irreducible in Q[x] by Prop. 12.4.3.
Thus we cannot factor further.
Exercise 12.4.6. Factor x5 + 5x + 5 into irreducible factors in Q[x] and in F2 [x].
Solution for Q[x]. x5 + 5x + 5 is irreducible in Q[x] by the Eisenstein criterion
(Prop. 12.4.6) since 5 doesnt divide the leading coefficient 1 while it divides all
other coefficients, and 52 = 25 does not divide the constant term 5.
Solution for F2 [x]. The residue in F2 [x] is x5 + x + 1, which is reducible in F2 [x] since
x5 + x + 1 = (x3 + x2 + 1)(x2 + x + 1); each of these factors have no roots in F2 hence
we cannot factor further.
Exercise 12.4.7. Factor x3 + x + 1 in Fp [x], when p = 2, 3, and 5.
Remark. We denote f (x) = x3 + x + 1.
Solution for p = 2. Since f (0) = 1, f (1) = 1, we see that there are no roots in F2 ,
and so x3 + x + 1 is irreducible.
Solution for p = 3. Since f (1) = 0, we can factor out (x + 2) to get f (x) = (x +
2)(x2 + x + 2). We cannot factor further since x2 + x + 2 has no roots in F3 .
Solution for p = 5. Since f (0) = 1, f (1) = 3, f (2) = 1, f (3) = 1, f (4) = 4, we see
that there are no factors of f (x) in F5 and so it is irreducible.
Exercise
(a) the
(b) the
(c) the

12.4.12. Determine:
monic irreducible polynomials of degree 3 over F3 ,
monic irreducible polynomials of degree 2 over F5 ,
number of irreducible polynomials of degree 3 over the field F5 .

Remark. It suffices to make sure our polynomials have no roots, for any factorization
of a quadratic or a cubic will produce a linear factor.

52

Solution for (a). We consider all polynomials of the form x3 + ax2 + bx + c in F3 .

c = 1, 2 since otherwise x = 0 would be a root. Moreover, 1 + a + b + c 6 0 mod 3
and 2 + a + 2b + c 6 0 mod 3 must be true for irreducibility. Suppose c = 1. Then,
1 + a + b + 1 6 0 implies a + b 6 1. Likewise, 2 + a + 2b + 1 a + 2b 6 0, and so the
only ordered triples that work for c = 1 are (0, 2, 1), (1, 2, 1), (2, 0, 1), (2, 1, 1), i.e.,
x3 + 2x + 1,

x3 + x2 + 2x + 1,

x3 + 2x2 + 1,

x3 + 2x2 + x + 1

are monic irreducible polynomials of degree 3 over F3 .

Suppose c = 2. Then, 1 + a + b + 2 a + b 6 0, and likewise, 2 + a + 2b + 2 6
0 implies a + 2b 6 2. Thus, the only ordered triples that work for c = 2 are
(0, 2, 2), (1, 0, 2), (1, 1, 2), (2, 2, 2), i.e.,
x3 + 2x + 2,

x3 + x2 + 2,

x3 + x2 + x + 2,

x3 + 2x2 + 2x + 2

are monic irreducible polynomials of degree 3 over F3 .

Solution for (b). We consider polynomials of the form x2 + ax + b in F5 . b = 1, 2, 3, 4
since otherwise x = 0 would be a root. Moreover, we have the system of equations

1 + a + b 6 0

4 + 2a + b 6 0
a, 4a 6 4 b,
=

4 + 3a + b 6 0
2a, 3a 6 1 b.

1 + 4a + b 6 0
We can consider this system for each b value. For b = 1, we have
(
a, 4a 6 3
= a = 1, 4.
2a, 3a 6 0
For b = 2, we have
(

a, 4a 6 2
= a = 0, 1, 4.
2a, 3a 6 4

a, 4a 6 1
= a = 0, 2, 3.
2a, 3a 6 3

For b = 3, we have

53

For b = 4, we have
(

a, 4a 6 0
= a = 2, 3.
2a, 3a 6 2

Thus, our monic irreducible polynomials of degree 2 over F5 are

x2 + x + 1, x2 + 4x + 1, x2 + 2,
x2 + 3, x2 + 2x + 3, x2 + 3x + 3,

x2 + x + 2, x2 + 4x + 2,
x2 + 2x + 4, x2 + 3x + 4.

Solution for (c). There are 5 monic polynomials of degree 1, and from (b) there are
10 monic irreducible polynomials of degree 2. The irreducible monic polynomials of
degree 3 are those that cannot be obtained by multiplying together polynomials of
lower degree. We see that any choice of factors gives a unique polynomial of degree
3 by Prop. 12.2.14(c), and so it suffices to count all monic polynomials of degree 3 in
F5 [x], and subtract those that can be obtained by multiplying together polynomials
of lower degree.
We see that reducible polynomials of degree 3 must be a product of 3 polynomials
of degree 1 or a product of 2 polynomials of degree 1 and 2 respectively. The number
of polynomials in the former category is
      
5
5 4
5
+
+
= 35,
3
1 1
1
where the terms describe all different, 2 same, and all same factors. The number
of polynomials in the latter category is 5 10 = 50. Since the number of degree 3
monic polynomials is 53 = 125, we see that there are 125 (35 + 50) = 40 degree 3
monic irreducible polynomials in F5 .
Since we want to find the number of (not necessarily monic) irreducible polynomials of degree 3 in F5 [x], we see that we can multiply our 40 monic polynomials by
any element of F5 \ {0}; this results in 160 irreducible polynomials of degree 3.
Exercise 12.4.13 (Lagrange interpolation formula).
(a) Let a0 , . . . , an be distinct complex numbers. Determine a polynomial p(x) of
degree n, which has a1 , . . . , an as roots, and such that p(a0 ) = 1.
(b) Let a0 , . . . , ad and b0 , . . . , bd be complex numbers, and suppose that the ai are
distinct. There is a unique polynomial g of degree d such that g(ai ) = bi for
each i = 0, . . . , d. Determine the polynomial g explicitly in terms of ai and bi .

54

Solution for (a). We let

pi (x) =

Y x aj
.
a
i aj
j6=i

Any aj with j 6= i is a root since pi (x) = 0 x aj = 0 for some j, and p(ai ) = 1

since each term in the product would equal 1. Letting p(x) = p0 (x), we are done.
Solution for (b). We let
g(x) =

d
X

bi pi (x) =

i=0

d
X
i=0

bi

Y x aj
,
a
i aj
j6=i

where pi (x) is as in (a). g(ai ) = bi for all i since pi (aj ) = ij . deg g d by the fact
that each term in the sum has degree d.
We now prove uniqueness. Suppose h(x) is another such polynomial. Then,
f (x) = g(x) h(x) has degree d and therefore has d roots; however, h(ai ) =
g(ai ) h(ai ) = bi bi = 0 for all 0 i d. But then, f (x) has d + 1 distinct roots,
which contradicts Prop. 12.2.20 unless g(x) = h(x).
Exercise 12.4.15. With reference to the Eisenstein criterion, what can one say
when
(a) f is constant, (b) f = xn + bxn1 ?
Claim (a). Let f (x) = an xn + + a0 Z[x] and let p Z be prime. Then f is
irreducible in Q[x] if (i) p - a0 ; (ii) p | ai for 1 i n; (iii) p2 - an . Note that (i)
and (ii) hold if and only if f is a nonzero constant.
Proof of Claim (a). Suppose not; then f = gh for g = br xr + + b0 , h = cs xs +
= a0 6= 0 by (i) and (ii), we see that g = b0 and
+ c0 , r + s = n. Since then f = gh
h = c0 since they must divide a0 . But then p | br and p | cs imply p2 | br cs = an .
Claim (b). Let f (x) = an xn + + a0 Z[x] and let p Z be prime. Then f is
irreducible in Q[x] if (i) an 1 mod p; (ii) p - an1 ; (iii) p | ai for 0 i n 2;
(iv) p - a0 . Note that (i), (ii), and (iii) hold if and only if f = xn + bxn1 .
Proof of Claim (b). Suppose not; then f = gh for g = br xr + + b0 , h = cs xs +
= xn + an1 xn1 = xn1 (x + an1 ) by (i), (ii),
+ c0 , r + s = n. Since then f = gh
and (iii), without loss of generality x + an1 | g, and so g = br xr1 (x + an1 ) and
= cs xs . But then, p | c0 implies p | b0 c0 = a0 .
h
Exercise 12.4.19. Factor x5 x4 x2 1 mod 2, mod 16, and over Q.
55

Remark. We denote f (x) = x5 x4 x2 1.

Solution for F2 . f (x) = x5 + x4 + x2 + 1 over F2 . Then, f (1) = 0, and so f (x) =
(x + 1)(x4 + x + 1). x4 + x + 1 has no roots in F2 , and the only irreducible quadratic
in F2 [x] is x2 + x + 1 which has (x2 + x + 1)2 = x4 + x2 + 1 6= x4 + x + 1, hence we
cannot factor further.
Solution for Z/16Z. f (5) 0 mod 16, and so f (x) = (x+5)(x4 6x3 2x2 +9x+3).
This does not factor further, for a factorization of x4 6x3 2x2 + 9x + 3 over Z/16Z
would produce a factorization of x4 + x + 1 over F2 , contradicting (a).
Solution for Q. The only possible factorization is as in (b). But the constant term of
the linear factor in (b) has constant term 5 6 1 mod 16, which would be necessary
for f to have constant term 1, and so f is irreducible.

12.5

Gauss Primes

Exercise 12.5.2. Find the greatest common divisor in Z[i] of (a) 11 + 7i, 4 + 7i, (b)
11 + 7i, 8 + i, (c) 3 + 4i, 18 i.
Proof of (a). First, (11+7i)(117i) = 112 +72 = 170 = 2517 = (1+i)(1i)(2+
i)(2 i)(4 + i)(4 i), and so 11 + 7i = (1 + i)(2 i)(4 + i) is a prime factorization.
Likewise, (4 + 7i)(4 7i) = 42 + 72 = 65 = 5 13 = (2 + i)(2 i)(3 + 2i)(3 2i), and
so 4 + 7i = (2 + i)(3 + 2i) is a prime factorization. Thus, gcd(11 + 7i, 4 + 7i) = 1.
Proof of (b). 11 + 7i = (1 + i)(2 i)(4 + i) is a prime factorization by (a). Then,
(8 + i)(8 i) = 82 + 12 = 65 = 5 13 = (2 + i)(2 i)(3 + 2i)(3 2i), and so
8 + i = (2 i)(3 + 2i). Thus, gcd(11 + 7i, 8 + i) = 2 i.
Proof of (c). Since (18 i)/(3 + 4i) = 2 3i, gcd(3 + 4i, 18 i) = 3 + 4i.
Exercise 12.5.3. Find a generator for the ideal of Z[i] generated by 3+4i and 4+7i.
Proof. Z[i] is a PID (Props. 12.2.5(c), 12.2.7), so it suffices to find gcd(3 + 4i, 4 +
7i). Since (3 + 4i)(3 4i) = 25 = (2 + i)2 (2 i)2 , (3 + 4i) = (2 + i)(2 + i) is a
prime factorization, and from Exercise 12.5.2(a), 4 + 7i = (2 + i)(3 + 2i) is a prime
factorization. Thus, 2 + i is a generator of the ideal.
Exercise 12.5.5. Let be a Gauss prime. Prove that and are associates if and
only if is an associate of an integer prime, or = 2.

56

Proof. Suppose and are associates. Then, e(a + bi) = a bi for some unit
e {1, i}. Thus, = e(a + bi)2 = e(a2 b2 + 2bi). First suppose e = 1. Then,
b = 0 since Z, and so = ea2 = a2 , since > 0. By Theorem 12.5.2(a),
prime implies a is an integer prime, and so must be an associate of a, an integer
prime. Now suppose e = i. Then, = i(a2 b2 + 2bi) = 2b i(a2 b2 ).
Then, a2 b2 = 0 since Z, and so = 2b. By Theorem 12.5.2(a), we see
b {1, 2}. But since a2 b2 = 0 and b = 2 imply a = 2, we have that 2 | ,
which contradicts its primeness. Thus, b = 1, and so = 2b = 2.
Now if is an associate of an integer prime, then = ep for some e {1, i},
and so = ep; since then / {1, i}, and are associates. Now suppose
= 2. Then, (a bi)(a + bi) = a2 + b2 = 2 = (1 + i)(1 i). By the fact that Z[i] is
a UFD, this prime factorization is unique (up to a unit), and so since 1 + i = i(1 i),
we see that and are associates.

Exercise 12.5.6. Let R be the ring Z[ 3]. Prove that an integer prime p is a
prime element of R if and only if the polynomial x2 + 3 is irreducible in Fp [x].

Proof. We consider the ring R = Z[ 3]/(p). Since R Z[x]/(x2 + 3), we can take
the quotient with respect to (p) and (x2 + 3) in different orders:
kill
p
Z[x]

kill
x2 + 3

kill
x2 + 3
R

Fp [x]

kill
p

Now R is a domain if and only if p is prime in R by Prop. 13.5.1. But R is a domain

if and only if x2 + 3 is prime in Fp [x] as well, and since Fp [x] is a domain, this is true
if and only if x2 + 3 is irreducible in Fp [x] by Lem. 12.2.10.
Exercise 12.5.7. Describe the residue ring Z[i]/(p) for each prime p.
Solution. Recall that Z[i] Z[x]/(x2 + 1), and so Z[i]/(p) (Z[x]/(p))/(x2 + 1)
Fp [x]/(x2 + 1).
When p 3 mod 4, p is a Gauss prime and so Fp [x]/(x2 + 1) Fp [i] is a field by
Lem. 12.5.3, and so is isomorphic to Fp2 by Thm. 15.7.3(d).
When p 1 mod 4 or p = 2, p is not a Gauss prime and so x2 + 1 is reducible in
Fp [x] with roots , 1 by Lem 12.5.3. Then, (x ) + (x 1 ) = Fp [x] as ideals,
57

and (x )(x 1 ) = (x2 + 1) = 0 as ideals in Fp [x]/(x2 + 1), hence by Exercise

11.6.8(c) we have Fp [x]/(x2 + 1) Fp [x]/(x ) Fp [x]/(x 1 ) Fp Fp .
Exercise 12.5.9. Let R = Z[] with = e2i/3 . Let p be a prime integer 6= 3. Adapt
the proof of Theorem 12.5.2 to prove the following:
(a) The polynomial x2 + x + 1 has a root in Fp if and only if p = 1 modulo 3.
(b) (p) is a maximal ideal of R if and only if p = 1 modulo 3.
(c) p factors in R if and only if it can be written in the form p = a2 + ab + b2 , for
some integers a, b.
Proof of (a). x2 + x + 1 has a root in Fp if and only if x3 1 has a nontrivial root

in Fp , i.e., F
p has an element of order 3. This is true if and only if 3 | |Fp | =
p 1 by corollaries to Lagranges theorem (Cor. 2.8.10) and the first Sylow theorem
(Cor. 7.7.3). This is equivalent to having p 1 mod 3.
Proof of (b). We consider the ring R = Z[]/(p). Since R Z[x]/(x2 + x + 1), we
can take the quotient with respect to (p) and (x2 + x + 1) in different orders:
kill
p
Z[x]

kill
x2 + x + 1

kill
x2 + x + 1
R

Fp [x]

kill
p

Now R is a field if and only if (p) is maximal in R by Prop. 11.8.2(b). But R is a

field if and only if (x2 + x + 1) is maximal in Fp [x] as well, and since Fp [x] is a PID
(Props. 12.2.5(b), 12.2.7), this is true if and only if x2 + x + 1 is irreducible in Fp [x]
by Cor. 12.2.9(C). But this holds if and only if p 1 mod 3 by (a) since all prime
integers 6= 3 are equivalent to 1 mod 3.
Proof of (c). If p = a2 + ab + b2 , then p factors as (a b)(a b 2 ) in R.
Conversely, suppose p factors in R. p is not a unit in R hence is divisible by a
prime R. Then, | p = p, so | p2 in R and Z, and so = p or p2 . The
latter case is impossible for otherwise p would be an associate of , hence irreducible.
Thus, p = (a b)(a b)(a b)(a b 2 ) = a2 + ab + b2 for some a, b Z.
Exercise 12.5.10.
(a) Let be a Gauss integer. Assume that has no integer factor, and that
is a square integer. Prove that is a square in Z[i].
58

(b) Let a, b, c be integers such that a and b are relatively prime and a2 + b2 = c2 .
Prove that there are integers m and n such that a = m2 n2 , b = 2mn, and
c = m2 + n2 .
Proof of (a). We can decompose = u1k1 nkn for j prime and u a unit, such
that i , j are not associates for any i 6= j; we want to show 2 | kj for each j. Then,
= u2 (1 1 )k1 (n n )kn = c2 for some c Z.
By Theorem 12.5.2(a), each j j is an integer prime or a square of an integer prime.
For each j, j j integer prime implies 2 | kj , since otherwise c2 would not be a
square integer. Now suppose j j is a square of an integer prime for some j. Then,
p2 = j j implies j is an associate of p, since this prime decomposition is unique up
to units; this implies p | , which contradicts that has no integer factor. Finally,
c2 > 0 hence u2 = 1, and so u = 1. In either case, is a square since i2 = 1.
Proof of (b). Not both of a, b are odd: otherwise, c2 = a2 + b2 1 + 1 = 2 mod 4,
a contradiction since all even square integers must be 0 mod 4. So assume without
loss of generality that a is odd. Let = a + bi. Then, = a2 + b2 = c2 , hence by
(a) letting = (m + ni)2 we have a = m2 n2 , b = 2mn, and c = m2 + n2 .

12.M

Miscellaneous Problems

Exercise 12.M.5. For which integers n does the circle x2 + y 2 = n contain a point
with integer coordinates?
Solution. We claim that x2 + y 2 = n has integer solutions if and only if every prime
3 mod 4 has even exponent in the prime factorization of n.
The prime factorization can be written n = ab2 , where a is square free. Then,
by Q
Thm. 12.5.2(d), every p that divides a can be written p = p p . Letting x + iy =
b p|a p , we have x2 + y 2 = (x iy)(x + iy) = ab2 = n.
Let n = x2 + y 2 = (x iy)(x + iy). If p 3 mod 4 divides a, it is a Gauss
prime by Thm. 12.5.2(b), and so p | x iy or x + iy. But then, p | x, y, hence
p | x iy. Thus, if pk is the power of p that appears in the prime factorization
for x iy, then p2k is the power of p that appears in the prime factorization for
(x iy)(x + iy) = n.
Exercise 12.M.6. Let R be a domain and let I be an ideal that is the product of
distinct maximal ideals in two ways, say I = P1 Pr = Q1 Qs . Prove that the
two factorizations are the same, except for the ordering of the terms.
59

Proof. Suppose there is an i such that Qj 6 Pi for all j. Let i : R R/Pi be the
canonical quotient map. Then, for each j there is qj Qj \ Pi , and so
!
Y
Y
i (qj ) = i
qj 6= 0 R/Pi ,
j

which is a contradiction since j qj Q1 Qs Pi . Thus, for every i, there is a j

such that Qj Pi ; since both ideals are maximal, we moreover have Qj = Pi . Thus,
{P1 , . . . , Pr } {Q1 , . . . , Qs } as sets; interchanging the role of the Pi and Qj gives
the opposite inclusion, so the two factorizations are equal.
Exercise 12.M.7. Let R = Z[x].
(a) Prove that every maximal ideal in R has the form (p, f ), where p is an integer
prime and f is a primitive integer polynomial that is irreducible modulo p.
(b) Let I be an ideal of R generated by two polynomials f and g that have no
common factors other than 1. Prove that R/I is finite.
Proof of (a). Let M R be a maximal ideal. It is not principal by Exercise 11.8.1,
and so there exist f1 , f2 M that do not share a common factor. f1 , f2 do not share
a common factor in Q[x], either by Thm. 12.3.6(b). Thus, r0 f1 + s0 f2 = 1 for some
r, s Q[x], and so clearing denominators, rf1 + sf2 = q Q for r, s Z[x], i.e.,
M Z 6= (0).
Now M Z is prime, since if ab M Z, then, say, a M and moreover
a Z for otherwise ab
/ Z. Thus, M Z = (0) or (p) for some prime p; the
former case is impossible by the above. Now consider the image M 0 of M in Fp [x];
then, Z[x]/M Fp [x]/M 0 is a field, and so M 0 is maximal by Prop. 11.8.2(b), and
is generated by some irreducible f0 Fp [x] by Cor. 12.2.9(c) since Fp [x] is a PID by
Props. 12.2.5(b), 12.2.7. Now if f Z[x] is a lift of f0 , then (p, f ) M since f = 0 in
Fp [x]/M 0 ; M (p, f ) since if g M \ (p, f ), then g 6= 0 Fp [x]/M 0 Z[x]/M .
Proof of (b). As in (a), if I = (f, g) and f, g have no common factors, then I Z 6=
(0); since Z is a PID, M Z = (n) for some
Z such that n 6= 1, for otherwise
Q nk
i
R/I = 0 and we are done. So, letting n = pi be a prime factorization, we claim
Q
(Z/pki i Z)[x] Y (Z/pki i Z)[x]
R
(Z/nZ)[x]

.
(3)
I
(f, g)
(f, g)
(f, g)
i
The first isomorphism is clear, and the second follows by applying Exercise 11.6.8(c)
repeatedly. For the third, consider the canonical surjection
Y
Y (Z/pki Z)[x]
ki
i
:
(Z/pi Z)[x]
.
(f, g)
i
i
60

ker = (f, g) since an element on the left maps to zero on the right if and only
if each direct factor is in (f, g), and so (3) holds by the first isomorphism theorem
(Thm. 11.4.2(b)). Let each direct factor on the right be called Ri .
It suffices to show each Ri is finite. Since f, g do not share a common factor,
without loss of generality pi - f . Then, separating out the terms in f , we can write
f = f1 f2 where pi - f1 while pi | f2 . Then, pki i | f2ki , hence in (Z/pki i Z)[x],
f1ki = f1ki f2ki = (f1 f2 )h = f h (f, g)
for some h (Z/pki i Z)[x]. If a is the leading coefficient of f1 , then f1ki has leading
coefficient aki . This is a unit since if not, then (aki ) is contained in a maximal ideal
of Z/pki i Z by Thm. 11.9.2, but (pi ) is the unique maximal ideal of this ring by the
correspondence theorem (Thm. 11.4.3), contradicting that pi - a. Thus, m = aki f1ki
is a monic polynomial in (Z/pki i Z)[x], hence each Ri is finite since any polynomial
with degree deg m can be reduced to a polynomial of lower degree using that
m = 0, and there are only finitely many polynomials in (Z/pki i Z)[x] with degree
< deg m since Z/pki i Z is finite.
Exercise 12.M.8. Let u and v be relatively prime integers, and let R0 be the ring
obtained from Z byadjoining
an element
with the relation v = u. Prove that R0



is isomorphic to Z uv and also to Z v1 .
Proof. We see that R0 = Z[x]/(vx u) Z[]. Now since v
 u = u by construction,
 
u
we see that having

gives
an
isomorphism
Z[]

Z
, and so R0 Z uv .
v
v






To show R0 Z v1 , we first see that Z v1 Z uv as a subring, since u v1 = uv .
Since u, v are relatively prime, au +
 bv
 = 1 for some
  a, b
 Z.
 Then, dividing out by
v gives a uv + b = v1 . Thus, v1 Z uv , and so Z v1 = Z uv .

13
13.1

Quadratic Number Fields

Algebraic Integers

Exercise 13.1.4. Let d and d0 be integers. When are the fields Q( d) and Q( d0 )
distinct?
2
0
02 0
0
Solution.
Write

d = s e and d = s 0 e such that e, e are square-free. We claim

Q( d) Q( d0 ) if and only if e = e . clearly holds by p. 384, so it suffices to
0
show . So
e 6= 1. We claim there
suppose e 6= e , and without loss of generality

0
is no x + y e with x, y Q such that e = (x + y e0 )2 = x2 + 2xy e0 + y 2 e0 . This
implies 2xy = 0 and x2 + y 2 e0 = e. If x = 0, then y 2 e0 = e, so if y = a/b for (a, b) = 1,

61

we have a2 e = b2 e0 ; since e, e0 are square-free, then a = b = 1, so e = e0 . On the

other hand, if y = 0, then x2 = e, contradicting that e =
6 1 is square-free.

13.2

Factoring Algebraic Integers

Exercise
13.2.2. For which negative integers d = 2 modulo 4 is the ring of integers
in Q[ d] a unique factorization domain?

Solution. Suppose d 2 mod 4. The integers R in Q[ d] are of the form a +b d

for a, b Z (Prop. 13.1.6). We claim R is a UFD if and only if d = 2. . Z[ 2]
is a Euclidean domain (Exercise 12.2.6), hence a UFD by Props.
12.2.7,

12.2.14(b).
. Suppose d 6= 2. Consider 2(2 d/2) = 4 d = (2 d)(2 +
d). We claim
2 is irreducible
in
R;
as
on
p.
386
it
suffices
to
show
there
is
no
a
+
b
d such that

2
2
2
N (a + b d) = a b d = 2. For, this would imply 2 | d hence 2 | a , and so 2 | a,
which implies a = 0, b = 1, d = 2 is the only
Thus, for
possibility,
a contradiction.

R to be a UFD we must have either 2 | 2 d or 2 + d, but 1 d/2

/ R when
d 2 mod 4 by Prop. 13.1.6.

13.3

Ideals in Z[ 5]

Exercise 13.3.2. Let := 5. Decide whether or not the lattice of integer

combinations of the given vectors is an ideal: (a) (5, 1 + ), (b) (7, 1 + ), (c)
(4 2, 2 + 2, 6 + 4).
Remark. We denote A to be the lattice spanned by the given vectors.
Solution for (a). A is not an ideal. For, suppose it were; then, (1+) = 5+ A,
and so 5 + = 5a + (1 + )b for some a, b Z. Thus, b = 1, but 5 = 5a + 1 has
no solution a Z.
Solution for (b). A is not an ideal, for if it were, then as in (a), (1 + ) = 5 + =
7a + (1 + )b A implies b = 1, but 5 = 7a + 1 has no solution a Z.
Solution for (c). We claim A is an ideal. A is closed under addition since it is a
lattice, and so it suffices to show A is closed under external multiplication. By the
distributive property, it is moreover sufficient to show times any of the generators
is in A, for A is closed under integer combinations. But this follows since
(4 2) = 10 + 4 =
(4 2) + 3(2 + 2)
(2 + 2) = 10 + 2 = 2(4 2) (2 + 2)
(6 + 4) = 20 + 6 = 4(4 2) + (2 + 2) (6 + 4)
62

Exercise 13.3.3. Let A be an ideal of the ring of integers R in an imaginary

quadratic field. Prove that there is a lattice basis for A, one of whose elements
is an ordinary positive integer.
Proof. Let a0 A; then a0 a0 A is a positive integer hence AN is nonempty. Choose
a A N that is minimal, and choose b0 A which is Z-linearly independent from
a0 . Consider the parallelogram (a, b0 ) = {ra + sb0 | 0 r, s 1}. A (a, b0 ) is
finite, and so we can choose b A (a, b0 ) with minimal positive imaginary part.
We claim a, b form a lattice basis for A. First, A (a, b) = {0, a, b, a + b}, for if
c (A (a, b)) \ {0, a, b, a + b}, then either c Z but c < a, violating minimality of
a, or 0 < Im(c) < Im(b), violating minimality of b. Finally, we can move (a, b) by
Z-linear combinations of a, b, and none of these parallelograms contain anything in
A other than linear combinations of a, b for otherwise we can move that point into
the parallelogram (a, b) with an appropriate Z-linear combination of a, b. Thus,
a, b form a lattice basis for A.

13.4

Ideal Multiplication

Exercise 13.4.3. Let R be the ring Z[], where = 5, and let A and B be ideals
of the form A = (, 12 ( + )), B = (, 12 ( + )). Prove that AB is a principal
ideal by finding its generator.
Solution. By Prop. 13.1.6, we know 2 | and 2 | . By Prop. 13.4.3(c), we have
A = 2 (2, 1 + ) and B = 2 (2, 1 + ). Thus, by (13.4.2) and Prop. 13.4.3(a), we get
 

2
AB =
(2, 1 + ) =
(4, 2 + 2, 4 + 2) =
(2) =
.
4
4
4
2

13.5

Factoring Ideals

Exercise 13.5.2. Let = 3 and R = Z[]. This is not the ring of integers in
the imaginary quadratic number field Q[]. Let A be the ideal (2, 1 + ).
(a) Prove that A is a maximal ideal, and identify the quotient ring R/A.
(b) Prove that AA is not a principal ideal, and that the Main Lemma is not true
for this ring.
(c) Prove that A contains the principal ideal (2) but that A does not divide (2).
Proof of (a). It suffices to show R/A is a field by Prop. 11.8.2(b). But R/A =
Z[]/(2, 1 + ) Z/(2) = F2 .

63

Proof of (b). First, we see

AA = (2, 1 ) (2, 1 + ) = (4, 2 + 2, 2 2, 4) = (4, 2 + 2) = 2A.
Now if the Main Lemma holds and AA is a principal ideal, then by the cancellation
law (Cor. 13.4.9(a)) we have A = (2), a contradiction since 1 + A \ (2).
Proof of (c). (2) A since 2 is a generator of A. Now suppose AB = (2) for some
ideal B ( R. B 6 A for otherwise
(2) = AB A2 = (2, 1 + )2 = (4, 2 + 2, 2 2) = 2A,
which implies 1 A, contradicting that A is maximal from (a). Then, 2A = AAB =
2AB by (b), and so A = AB. Now let C be a maximal ideal containing B as exists
by Thm. 11.9.2; note C 6= A since B 6 A. Then, A = AB AC A, and so we
have equalities throughout. But this contradicts Exercise 12.M.6, for A and AC are
two distinct factorizations of A into a product of distinct maximal ideals.

14
14.1

Linear Algebra in a Ring

Modules

Exercise 14.1.3. Let R = Z[] be the ring generated over Z by an algebraic integer
. Prove that for any integer m, R/mR is finite.
Proof. Let f (x) Z[x] be the (monic) irreducible polynomial for . Then, I = (m, f )
is an ideal in Z[x] generated by two polynomials that have no common factors, and
so R/mR Z[x]/(m, f ) is finite by Exercise 12.M.7(b).
Exercise 14.1.4. A module is called simple if it is not the zero module and if it
has no proper submodule.
(a) Prove that any simple R module is isomorphic to an R module of the form
R/M where M is a maximal ideal.
(b) Prove Schurs Lemma: Let : S S 0 be a homomorphism of simple modules.
Prove that is either zero, or an isomorphism.
Proof of (a). Let S be simple and let s S be nonzero. Define : R S by r 7 rs;
this is a homomorphism since S is a module. Then, im is a submodule of S, hence
equal to S since S is simple, and so is surjective. By the first isomorphism theorem
(Thm. 14.1.6(c)), R/ker S. Now M := ker is a submodule of R, then by the
correspondence theorem (Thm. 14.1.6(d)) M is a maximal submodule of R, hence a
maximal ideal of R by Prop. 14.1.3.
64

Proof of (b). ker is a submodule of S, and im is a submodule of S 0 . Since S 0 is

simple, im is 0 or S 0 . If im = 0, then = 0. If im = S 0 , then ker ( S 0 , hence
equals 0, and so S S 0 by the first isomorphism theorem (Thm. 14.1.6(c)).

14.2

Free Modules

Exercise 14.2.3. Let A be the matrix of a homomorphism : Zn Zm of free

Z-modules.
(a) Prove that is injective if and only if the rank of A, as a real matrix, is n.
(b) Prove that is surjective if and only if the greatest common divisor of the
determinants of the m m minors of A is 1.
Remark. By Thm. 14.4.6, there exist matrices P GLn (Z), Q GLm (Z) such that
A0 = Q1 AP is diagonal of the form

d1

..

.
(4)

dk
0
with di Z>0 and d1 | d2 | | dk . Note A defines an injective (resp. surjective) map
: Zn Zm if and only if A0 defines an injective (resp. surjective) map 0 : Zn Zm
since P, Q are invertible as integer matrices.
Proof of (a). is injective if and only if A0 above has k = n m, and this is
equivalent to A having rank n as a real matrix since rank is preserved by column
and row operations P, Q.
Proof of (b). is surjective if and only if A0 above has d1 = = dk = 1 and
k = m n, i.e., the greatest commmon divisor of the determinants of the m m
minors of A0 is 1. It suffices to show that this property is preserved by column and
row operations P, Q.
Recall (14.4.2): the operations are (i) adding an integer multiple of a row (resp.
column) to another, (ii) interchanging two rows (resp. columns), and (iii) multiplying a row (resp. column) by 1. But (i) simply adds integer multiples of some
determinants to others, (ii) switches some pairs of determinants and multiplies some
by 1, and (iii) multiplies some determinants by 1. So we are done.

65

14.4

Diagonalizing Integer Matrices

Exercise 14.4.6. Let : Zk Zk be a homomorphism given by multiplication by

an integer matrix A. Show that the image of is of finite index if and only if A is
non-singular that it if so, then the index is equal to |det A|.
Proof. Since Zk is abelian, the index of im 6 Zk is given by |Zk / im |. By
Thm. 14.4.6, there exist P, Q GLk (Z) such that A0 = Q1 AP is diagonal of the
form (4), with diagonal entries d1 | d2 | | dr followed by k r zeros, and so
r
Y
Z / im = Z /AZ Z /A Z
(Z/d1 Z) Zkr .
k

(5)

i=1

Thus, |Zk / im | < if and only if r = k. But this is true if and only if
0

det A = det Q det A det P = det Q det P

k
Y

di 6= 0,

(6)

i=1

i.e., det A is nonsingular. If |Zk / im | < , then (5) gives |Zk / im | =

which equals |det A| by (6).

14.5

Qk

i=1

di ,

Generators and Relations

Exercise 14.5.1. Let R = Z[] where =

as an R-module for the ideal (2, 1 + ).

5. Determine a presentation matrix

Proof. Let : R2 I that sends (x, y)

2x + (1 + )y. Now








1
+

2 
2  1+
ker = (x, y) R  x =
y yR 
yR
2
2
where denotes bijection. But y = 2, 1 are the elements in R with smallest norm
satisfying this condition, and moreover the corresponding vectors (3, 1 ), (1
, 2) R are independent over R since 2r 6= 1 for any r R. Thus, ker is
generated by these two vectors, and by pp. 424425 we have a presentation matrix


3 1
A=
.
1
2

66

14.7

Structure of Abelian Groups

Exercise 14.7.7. Let R = Z[i] and let V be the R-module given by the elements v1
and v2 with relations (1 + i)v1 + (2 i)v2 = 0 and 3v1 + 5iv2 = 0. Write this module
as a direct sum of cyclic modules.
Proof. We use the relations to find a presentation matrix A and then diagonalize it
following the proof of Thm. 14.4.6:


1+i 3
2 i 5i


1 0
1+i 1


i 0
1 0

1+i
3
i 3 + 8i

1
8 3i
1+i
3


0 1
1 0


1 0
1i 1

i 3 + 8i
1+i
3



1 8 3i
0 8 + 11i

This reduces to the 11 matrix (8+11i) by Prop. 14.5.7(iv), and so V R/(8+11i).

To decompose further, we need to factor 8 + 11i. But
N (8 + 11i) = 64 + 121 = 185 = 5 37 = (2 + i)(2 i)(6 + i)(6 i),
and i(2 i)(6 i) = i(12 8i 1) = 8 + 11i, hence V R/(8 + 11i) R/(2 i)
R/(6 i) by Exercise 11.6.8(c), where we note the map in Exercise 11.6.8 is also
an R-module isomorphism.

14.8

Applications to Linear Operators

Exercise 14.8.2. Let M be a C[t]-module of the form C[t]/(t )n . Show that there
is a C-basis for M , such that the matrix of the corresponding linear operator is a
Jordan block.
Proof. By Prop. 11.5.5, 1, t, . . . , tn1 is a basis for M over C, and following p. 435,
we have the following matrix for multiplication by t in this basis:

0
a0
1 0
a1
 

n
..
..

i
.
. , ani = ()
T = 1

i
..

. 0 an2
1 an1
67

by using the binomial formula. This has characteristic polynomial f (t) = (t )n as

on p. 435, hence by the Jordan normal form it suffices to show dim ker(I T ) = 1.
By rank-nullity it suffices to show rk(I T ) n1, for an eigenvalue has geometric
multiplicity at least one. For = 0, we are done, so suppose 6= 0. Then, the matrix

a0
1
a1

..
..

.
1
.
I T =

.
..

an2
1 + an1
turns into the matrix

1
1

..

a0 /
a1 / + a0 /2
..
.
an2 / + + a0 /n1
1 + an1 / + an2 /2 + + a0 /n

by Gaussian elimination, and so rk(I T ) n 1.

Exercise 14.8.4. Let V be an F [t]-module, and let B = (v1 , . . . , vn ) be a basis for
V as F -vector space. Let B be the matrix of T with respect to this basis. Prove that
A = tI B is a presentation matrix for the module.
Proof.
We want to show that im A = ker(p : F [t]n V ) where p is given by (fi )ni=1
Pn
i=1 fi vi . The inclusion is clear, for B is multiplication by
Pnt on V .
n
For
i=1 fi vi = 0. If each
P the j other direction, suppose (fi )i=1 ker p, i.e.,
fi = aij t , we then have
n
X

fi vi =

i=1

n X
X

aij tj vi

i=1 j0

n
X

"

#
ai0 vi +

i=1

aij t

j1

((t B)vi + Bvi )

j1

!n
= (p A)

aij tj1

j0

n
X
i=1

+
i=1

"

n
X
i=1

#
ai0 vi +

aij tj1 Bvi ,

j1

68

"

#
ai0 vi +

X
j1

aij tj1 Bvi

since p A = 0 by the above. Then, repeating this process, we get

n
X
i=1

fi vi =

n X
X

aij B vi =

i=1 j0

n
X

bi v i = 0

i=1

for some coefficients bi F , i.e., each contribution from the fi above could be put in
the form (p A)(w) for some w F [t]n , and so im A ker p.

14.M

Miscellaneous Problems

Exercise 14.M.10.
(a) Prove that the multiplicative group Q of rational numbers is isomorphic to the
direct sum of a cyclic group of order 2 and a free abelian group with countably
many generators.
(b) Prove that the additive group Q+ of rational numbers is not a direct sum of
two proper subgroups.
(c) Prove that the quotient group Q+ /Z+ is not a direct sum of cyclic groups.
Proof of (a). Let h1i = {1, 1} with the obvious group structure making it isomorphic to Z/2Z. Let hpi = {pk | k Z} with the obvious group structure making
it isomorphic to Z. Then, define the map
M
h1i
hpi Q
p prime

pkp

p prime

pkp

p prime

Note that hpi is a free abelian group. This

is a group
since
Q kmap
Q kp homomorphism
Q `p
p +`p
(, k2 , . . .) (, `2 , . . .) gets mapped to p
= p p . This map
is clearly surjective since any rational number r/s has prime decompositions for r
and s, which we use to find a preimage on the left. Similarly, this is injective since
something on the right is equal to 1 if and only if = 1 and kp = 0 for all p.
Proof of (b). Let G, H be proper nontrivial subgroups of Q+ ; it suffices to show they
have nontrivial intersection by Prop. 2.11.4(d). If p/q G, s/t H for some p, s 6= 0,
then qs(p/q) = pt(s/t) = ps G H, while ps 6= 0 by assumption.
L
Proof of (c). Suppose Q+ /Z+ k Hk for Hk cyclic. Let (the image of) pk /qk +
Z+ Hk generate Hk for (pk , qk ) = 1. Let spk + tqk = 1 for some integers s, t; then,
1
spk tqk
pk
+ Z+ =
+
+ Z+ = s + Z+ Hk ,
qk
qk
qk
qk
69

hence we can assume that (the image of) 1/qk generates Hk . Now consider the
element 1/q12 + Z+ Q+ /Z+ . 1/q12 + Z+ then has a decomposition
X rk
1
+
+
Z
=
+ Z+ ,
q12
q
k
k
where qk | rk for all but finitely many values of k. Adding it to itself q1 times gives
X q 1 rk
1
+ Z+ =
+ Z+
q1
q
k
k
and since we had a direct sum decomposition, qk | q1 rk for all k 6= 1, and q1 | q1 r1 1.
But this last property implies q1 | 1, a contradiction.

15
15.2

Fields
Algebraic and Transcendental Elements

Exercise 15.2.1. Let be a complex root of the polynomial x3 3x + 4. Find the

inverse of 2 + + 1 in the form a + b + c2 with a, b, c Q
Proof. Suppose 1 = (a + b + c2 )(1 + + 2 ). We can rewrite this as
1 = a + (a + b) + (a + b + c)2 + (b + c)3 + c4
We then note that 3 = 3 4 and 4 = 32 4, and so we get the equation
1 = a + (a + b) + (a + b + c)2 + (b + c)(3 4) + c(32 4)
= (a 4b 4c) + (a + 4b c) + (a + b + 4c)2
Since 1, , and 2 are linearly independent over Q, we get a system of linear equations, with solution

1

a
1 4 4
1
17 12 20
1
17
b = 1 4 1 0 = 1 5 8 3 0 = 1 5
49
49
c
1 1
4
0
3 5 8
0
3
and so (1 + + 2 )1 =

1
(17
49

5 32 ).

Exercise 15.2.3. Let = 3 2 where = e2i/3 , and let K = Q(). Prove that the
equation x21 + + x2k = 1 has no solution with xi in K.

3
Proof. has minimal polynomial x3 2, which has roots
2 = 2 , , and . Thus,

2
2
by Prop. 15.2.8, there is an isomorphism Q() Q( 3 2). Butthen, if x
1 + + xk =
3
3
1 has a solution in Q(), it has a solution xi = ai + bi 2 Q( 2) R by
Prop. 15.2.10, contradicting that this equation has no real solutions.
70

15.3

The Degree of a Field Extension

Exercise
15.3.2. Prove that the polynomial x4 + 3x + 3 is irreducible over the field

3
Q[ 2].
Proof. Since f := x4 + 3x + 3 x4 + x + 1 mod 2 is irreducible over F2 by Exercise
12.4.19, f is irreducible over Q as well by Prop. 12.4.3.

3
Now
let

be
a
root
of
f
;
then
[Q()
:
Q]
=
4
while
[Q(
2) :Q] = 3, and so

3
3
3
3
[Q(,
2)] = 12
by
Cor.
15.3.8.
But
12
=
[Q(,
2)
:
Q(
2)][Q(
2) : Q] implies

3
3
[Q(, 2) : Q( 2)] = 4 by the multiplicative
property of the degree (Thm. 15.3.5).

3
Thus, the minimal
polynomial of over Q( 2) has degree 4, and so x4 + 3x + 3 has

no factors in Q( 3 2)[x] by Lem. 15.3.2(b).

Exercise 15.3.5. Determine the values of n such that n has degree at most 3 over
Q.
Proof. If p is a prime dividing n, then pn = 1, hence Q(n ) Q(p ). Now [Q(p ) :
Q] = p 1 by Thm. 12.4.9, and so [Q(n ) : Q] 3 implies that if p | n, then
p {2, 3}. Thus, n = 2i 3j .
We claim i 2, j 1. [Q(2 ) : Q] = 1 and [Q(4 ) : Q] = 2 because the minimal
polynomial of 4 is x2 + 1. Similarly, [Q(3 ) : Q] = 2. But any extension of Q(4 ) or
Q(3 ) will have degree 4 over Q by Thm. 15.3.5, hence i 2, j 1.
By the above, n {1, 2, 3, 4, 6, 12}, and also [Q(n ) : Q] 3 for n {1, 2, 3, 4},
hence it suffices to check whether n {6, 12} are also possible values of n. 6 = 3
hence Q(6 ) = Q(3 ). On the other hand, Q(12 ) Q(3 , 4 ), which has degree 6
over Q by Thm. 15.3.5, and so n 6= 12. Thus, n {1, 2, 3, 4, 5, }.

Exercise 15.3.7. (a) Is i in the field Q( 4 2)? (b) Is 3 5 in the field Q( 3 2)?

4
Proof
of
(a).
Suppose
i

Q(
2). Then, there exists a, b Q such that (a +

b 4 2)2 = 1. But then,

(a + b 4 2)2 = a2 + 2ab 4 2 + b2 2 2 = 1,

and since {1, 4 2, 2 2} are linearly independent over Q by Prop. 15.2.7, a2 = 1,

which is impossible since a Q.

Proof of (b). If 3 5 Q( 3 2), then := 3 2 + 3 5 Q( 3 2) must have degree at

most 3 over Q. Let f (x) = x9 21x6 123x3 343; then, f () = 0. But f (x) is
irreducible by the Eisenstein criterion (Prop. 12.4.6) since 3 | 21, 123 while 9 - 343,
hence f is irreducible and so has degree 9 over Q, a contradiction.
71

Exercise 15.3.9. Let and be complex roots of irreducible polynomials f (x) and
g(x) in Q[x]. Let K = Q() and L = Q(). Prove that f (x) is irreducible in L[x]
iff g(x) is irreducible in K[x].
Proof. Let m = deg f, n = deg g. By the multiplicative property of the degree
(Thm. 15.3.5), we have [Q(, ) : Q] = [L() : L][L : Q] = [K() : K][K : Q].
Hence, f (x) is irreducible in L[x] if and only if [Q(, ) : Q] = mn if and only if g(x)
is irreducible in K[x].
Exercise 15.3.10. A field extension K/F is an algebraic extension if every element
of K is algebraic over F . Let K/F and L/K be algebraic field extensions. Prove
that L/F is an algebraic extension.
P
Proof. Let L; we want to show is algebraic over F . Let = m
i=1
Pbni i for
bi K, i L linearly independent and algebraic over K. Write i = j=1 cj j
for cj F , j K linearly independent and algebraic over F . Thus, we have
F (1 , . . . , n )(1 , . . . , m ). Now if is transcendental over F , then by Thm. 15.3.5,
[F (1 , . . . , n )(1 , . . . , m ) : F (1 , . . . , n )][F (1 , . . . , n ) : F ] [F () : F ] = ,
which contradicts Cor. 15.3.6(c).

15.4

Finding the Irreducible Polynomial

Exercise 15.4.1. Let K = Q(), where is a root of x3 x 1. Determine the

irreducible polynomial of = 1 + 2 over Q.
Proof. First, satisfies (x 1)(x 2)2 1 = x3 5x2 + 8x 5 = 0 since
( 1)( 2)2 1 = 2 (2 1)2 1 = (3 )2 1 = 12 1 = 0.
Now Thm. 15.3.5 implies [K : Q] = [K : Q()][Q() : Q] = 3 and so [Q() : Q] = 3
since
/ Q. Thus, x3 5x2 + 8x 5 is the irreducible polynomial of over Q.

Exercise 15.4.2. Determine

the irreducible
polynomial
for

=
3
+
5 over the

following fields. (a) Q, (b) Q( 5), (c) Q( 10), (d) Q( 15).

Solution for (a). Let f (x) = (x2 8)2 60 = x4 16x2 + 4. Then, f () = 0; we
claim f is irreducible. f cannot have linear factors since a root must be an integer
dividing 4 by the rational root test, and these are not roots. Now suppose f had
quadratic factors; then by Prop. 12.3.7(a), for some a, b, c, d Z we have
f (x) = (x2 + ax + b)(x2 + cx + d) = x4 + (a + c)x3 + (b + ac + d)x2 + (ad + bc)x + bd.
72

Now a + c = 0 implies ad + bc = a(d b) = 0. a 6= 0 since otherwise b + d = 16 and

bd = 4, a contradiction. So, d = b = 2, but then 2 + ac + 2 = 16 implies ac = 20,
which contradicts a + c = 0. Hence f is the irreducible polynomial for over Q.

2
Solution for (b). Let f (x) =(x 5)2 3 = x
2 5 +2; then
f () = 0. f splits
if
if the two roots 5
3 are in Q( 5). But 3
/Q( 5), for otherwise
and only

2
2
3 = a + b 5 implies 3 = a + 2ab 5 + 5b , and solving for 5 gives
that
5 Q,

a contradiction. Hence f is the irreducible polynomial for over Q( 5).

Solution for (c). Let f (x) = x4 16x2 + 4. By Cor. 15.3.8 and (a), Q(, 10) must
have degree either
4 or 8 over Q, hence by the multiplicative
property of the degree
(Thm. 15.3.5), 10 has degree 2 or 1 over Q(). To show 10 does not have degree
1 over Q(),
it suffices to show it is not in Q() by Lem. 15.3.2(b). But this is clear

since if 10 = a + b for a, b Q, then

10 = a2 + 2ab + b2 2 = a2 + 8b2 + 2ab 3 + 2ab 5 + 2b2 15

implies b = 0, contradicting that 10

/ Q. Now has degree 4 over Q( 10) since

[Q(, 10) : Q( 10)][Q( 10) : Q] = [Q(, 10) : Q( 10)] 2 = 8

and so f is the irreducible polynomial for over Q( 10).

Solution for (d). Let f (x) = x2 8 2 15; then f () = 0. Now

4 = [Q(, 15) : Q] = [Q(, 15) : Q( 15)][Q( 15) : Q]

by (a) since 15 = (2 8)/2 Q(), hence

has
degree
2
over
Q(
15), and so f

is the irreducible polynomial for over Q( 15).

15.6

Adjoining Roots

Exercise 15.6.1. Let F be a field of characteristic 0, let f 0 be the derivative of

f F [x], and let g be an irreducible polynomial that is a common divisor of f and
f 0 . Prove that g 2 divides f .
Proof. f = gh for some h F [x], hence f 0 = gh0 + g 0 h by Exercise 11.3.5(a). If
g | f 0 , then g | g 0 h. g is prime since it is irreducible, hence g | g 0 or g | h. But g - g 0
since deg g 0 < deg g, hence h = gr for some r F [x]. Thus, f = g 2 r, i.e., g 2 | f .

73

15.7

Finite Fields

Exercise 15.7.4. Determine the number of irreducible polynomials of degree 3 over

F3 and over F5 .
3

Proof. By Thm. 15.7.3(b), for prime p the irreducible factors of xp x are the monic
irreducible polynomials in Fp [x] with degree 1 or 3. x, x 1, x 2, . . . , x (p 1) are
the linear irreducible polynomials, hence there are p(p1)(p+1)/3 monic irreducible
polynomials of degree 3 in Fp [x]. Since by Thm. 15.7.3(c) there are p 1 units in Fp ,
we have that there are p(p 1)2 (p + 1)/3 irreducible polynomials of degree 3 over Fp .
Thus, for F3 we have 16, and for F5 we have 160 irreducible polynomials of degree
3. Note this matches our result from Exercise 12.4.12.
Exercise 15.7.6. Factor the polynomial x16 x over the fields F4 and F8 .
Solution for F4 . We claim x16 x factors as the product of all monic irreducible
polynomials over F4 of degree 1 and 2. First, x4 x | x16 x by Thm. 15.7.3(a), (e),
hence every monic irreducible polynomial of degree 1, x a | x16 x for a F4
divides x16 x. Now let g be a monic irreducible polynomial of degree 2 over F4 . If
is a root of g in F16 then [F4 () : F4 ] = 2, hence F4 () F16 by Thm. 15.7.3(d).
Thus, x | x16 x, so g | x16 x by considering the other root of g and proceeding
in the same way. Thus, x16 x is divisible by every monic irreducible polynomial
over F4 of degree
1 or 2. Now there are 4 irreducible monic polynomials of degree 1


4
2
and 4 2 4 = 6 irreducible monic polynomials of degree 2 over F4 , which means
the total degree of their product is 16 as desired. Thus, we have that
x16 x = x(x 1)(x )(x 1)(x2 + x + )(x2 + x + ( + 1))
(x2 + x + 1)(x2 + x + )(x2 + ( + 1)x + 1)(x2 + ( + 1)x + ( + 1)).
Solution for F8 . We claim x16 x factors in the same way as over F2 , i.e.,
x16 x = x(x 1)(x2 + x + 1)(x4 + x + 1)(x4 + x3 + 1)(x4 + x3 + x2 + x + 1)
It suffices to show the degree 4 factors are irreducible over F8 . Since there are no
intermediate fields between F2 and F8 by Thm. 15.7.3(e), we know there are no new
linear factors of x16 x, since its roots are the elements in F16 . Let F8 such that
F8 F2 (). Suppose one of the degree 4 factors has a degree 2 factor. Let be one
of its roots; by Thm. 15.7.3(a) it is an element of F16 , and F16 F2 () as in the
solution for F4 . Then, [F8 () : F8 ] = 2, hence F8 () F64 by Thm. 15.7.3(d). But
F64 F8 () F2 (, ) F2r where r = 12 by Cor. 15.3.8, a contradiction.
74

Exercise 15.7.7. Let K be a finite field. Prove that the product of the nonzero
elements of K is 1.
Proof. For every nonzero a K there is a1 K such that aa1 = 1 since K is a
field. In the product of nonzero elements of K, we can pair off each a, a1 such
that a 6= a1 so that is the product of all nonzero elements of K such that a1 = a.
We claim this is true if and only if a = 1. If a = a1 , then a2 = 1 and so a is a
root of x2 1 = (x + 1)(x 1). Since K[x] is a UFD (Prop. 12.2.14(c)), this implies
a = 1. Thus, = 1 (1) = 1.
Exercise 15.7.8. The polynomials f (x) = x3 + x + 1 and g(x) = x3 + x2 + 1 are
irreducible over F2 . Let K be the field extension obtained by adjoining a root of f ,
and let L be the extension obtained by adjoining a root of g. Describe explicitly an
isomorphism from K to L, and determine the number of such isomorphisms.
Proof. Let be a root of f , and one of g. Then, 3 = + 1 and 3 = 2 + 1. Any
field homomorphism : K L is specified by (), satisfying that (3 ) = (+1)
by the mapping property of quotient rings (Thm. 11.4.2). So let () = a + b + c 2 .
(3 ) = (a2 + b2 2 + c2 4 )(a + b + c 2 )
= (a3 + ac2 + b3 + b2 c + bc2 ) + (a2 b + ac2 + b2 c + bc2 + c3 )
+ (a2 c + ab2 + ac2 + b3 + b2 c + c3 ) 2
must then be equal to ( + 1).
We claim is an isomorphism if and only if (a, b, c) {(1, 1, 0), (1, 0, 1), (0, 1, 1)}.
By Prop. 11.8.4(b), it suffices to show is surjective if and only if this is true. Suppose
is surjective; then not both b, c are zero by the above. Matching 1, , 2 terms,
we have that if b = 0, then a = c = 1; if c = 0, then a = b = 1; and if b = c = 1,
then a = 0. Conversely, since ( + 1) = in the first case, (2 + + 1) = in
the second case, and (2 + 1) = in the third case, we see in each case that is
surjective by using that is an homomorphism.
Exercise 15.7.10. Let F be a finite field, and let f (x) be a nonconstant polynomial
whose derivative is the zero polynomial. Prove that f cannot be irreducible over F .
Lemma 15.7.10a. In a finite field of order pr , every element is a pth power.
Proof of Lemma 15.7.10a. Let a F ; if a = 0 we are done so suppose not. |F | =
r
r
r1
pr 1 by Thm. 15.7.3(c), hence ap 1 = 1 and ap = a. Thus, b := ap
satisfies
p
b = a.
75

Pn
Pn
i
0
i1
Main Proof. Let f (x) =
= 0, we have
i=0 ai x . Then, if f (x) =
i=1 iai x
iai = 0 for all iP
1. Since F is a domain, this implies either ai = 0 or i 0 mod p.
pj
Thus, f (x) = m
for some aj F where p = char F . There exist bj such
j=0 aj x
P
p
j
that bj = aj by Lemma 15.7.10a. Thus, f (x) = g(x)p where g(x) = m
j=0 bj x by
Exercise 11.3.8, and so f (x) is not irreducible.
Exercise 15.7.11. Let f = ax2 + bx + c with a, b, c in a ring R. Show that the ideal
of the polynomial ring R[x] that is generated by f and f 0 contains the discriminant,
the constant polynomial b2 4ac.
Proof. f 0 = 2ax + b. Proceeding as in the Euclidean algorithm (p. 45), we have
2ax2 + 2bx + 2c = x(2ax + b) + (bx + 2c),

b(2ax + b) = 2a(bx + 2c) + (b2 4ac),

hence b2 4ac = 4af + f 02 (f, f 0 ) R[x].

Exercise 15.7.13. Prove that a finite subgroup of the multiplicative group of any
field F is a cyclic group.
Proof. A finite subgroup H 6 F is a finite abelian group. Thus, H C1 Cn
where the Ci are cyclic groups, and |Ci | divides |Ci+1 | by Thm. 14.7.3. Let d := |Cn |.
Then, xd = 1 for every x H. This means that every x H is a root of xd 1.
Now, xd 1 has at most d roots, so d |H|. On the other hand, d |H| by the
decomposition above, so d = |H|, and n = 1, i.e., H is cyclic.

15.8

Primitive Elements

Exercise 15.8.2. Determine all primitive elements for the extension K = Q( 2, 3)
of Q.

Proof. We claim = a + b 2 + c 3 + d 6 is a primitive element for the extension

K/Q if and only if at least two of b, c, d are nonzero. Recall that

Q( 2, 3) = Q( 2, 6) = Q( 3, 6) = {a + b 2 + c 3 + d 6 | a, b, c, d Q}.
We can assume without loss of generality that a = 0 since
a). is
Q()= Q(
clear since if only one of b, c, d is nonzero, then K = Q( 2), Q( 3), or Q( 6).
Conversely, suppose at least two of b, c, d are nonzero.
If
exactly two of b, c, d
are nonzero, then relabel = k + j for , { 2, 3, 6}; we can moreover
assume k = 1 by dividing by k. Note K = Q(, ) as above, and so by Lem. 15.8.2
= + j is a primitive element for K/Q for all but finitely many j. In particular,
76

as in the proof of Lem. 15.8.2, fails to be primitive when at least two of j

are equal, but this occurs if and only if j = 0, a contradiction.
Now suppose that all three of b, c, d are nonzero. Letting

0 = 2 2b2 3c2 6d2 = 6cd 2 + 4bd 3 + 2bc 6,

we have that

b 0 6cd = 2d(2b2 3c2 ) 3 + 2c(b2 3d2 ) 6

c 0 4bd = 2d(3c2 2b2 ) 2 + 2b(c2 2d2 ) 6

d 0 2bc = 2c(3d2 b2 ) 2 + 2b(2d2 c2 ) 3

are all in Q(). But each of their coefficients have no nonzero solutions over Q by
clearing denominators and checking for integer solutions, hence any three of these
produces a primitive element for K/Q by the paragraph above, and so is a primitive
element for K/Q as well.

15.9

Function Fields

Exercise 15.9.1. Let f (x) be a polynomial with coefficients in a field F . Prove that
if there is a rational function r(x) such that r2 = f , then r is a polynomial.
Proof. Suppose f 6= 0 for otherwise r is necessarily 0. Let r = p(x)/q(x) for p, q
coprime; then p2 = f q 2 . Now using that F [x] is a UFD (Prop. 12.2.14(c)), since p - q
we have p2 | f , and so f = p2 s for some s F [x]. But then, f q 2 = p2 sq 2 = p2 , and
so sq 2 = 1 and s, q F [x]; since the units in F [x] are the constant polynomials, we
have s, q F and so r F [x].

15.10

The Fundamental Theorem of Algebra

Exercise 15.10.1. Prove that A C is algebraically closed, where A is the subset

of C consisting of the algebraic numbers.
Remark. We prove that a root of a polynomial with coefficients that are algebraic
over a field F is also algebraic.
Proof. Let f A[x] be non-constant, and let be a root of f . It suffices to show
is algebraic over F . Suppose not, and let a0 , . . . , an be the coefficients of f . Then,
[F () : F ] [F (, a0 , . . . , an ) : F ] n

n
Y
i=0

77

mi <

by Cor. 15.3.8, where mQ

i is the degree of ai over F . Thus, there exists a polynomial
in F [x] of degree n ni=0 mi with as a root.
Exercise 15.10.2. Construct an algebraically closed field that contains the prime
field Fp .
Remark. We prove that any field K is contained in an algebraically closed field L.
Proof. We first claim the monic irreducible polynomials of degree 1 in K[x] can be
well-ordered. This is a consequence of the well-ordering theorem, but in the case of
Fp (or any countable field) it is possible to well-order these polynomials without the
axiom of choice since there are only countably many of them. Then, letting (fi ) be
a well-ordering of these polynomials, and letting L0 = K and Li be the extension
S of
:=
Li1 such that fi splits completely which exists by Prop. 15.6.3, we claim L
i Li
is an algebraically closed field containing K. It suffices to show it is algebraically
closed, but this is true since if f (x) L[x] has a root , then the proof of Exercise
15.10.1 shows is algebraic over K, hence in L by construction.

15.M

Miscellaneous Problems

Exercise 15.M.1. Let K = F () be a field extension generated by a transcendental

element , and let be an element of K that is not in F . Prove that is algebraic
over F ().
Proof. Suppose K \ F ; then = p()/q() for p(x), q(x) F [x], and so
q() p() = 0. Thus, is a root of the polynomial q(x) p(x) F ()[x],
i.e., is algebraic over F ().
Exercise 15.M.2. Factor x7 + x + 1 in F7 [x].
Proof. First substitute x
x + 3, giving x7 + x. Then, x7 + x = x(x6 + 1). Now
x6 + 1 has solutions x2 = 3, 5, 6 F7 , hence x7 + x = x(x2 + 1)(x2 + 2)(x2 + 4). Now
1, 2, 4 are the squares in F7 , none of which are 3, 5, 6, hence we cannot factor further.
Substituting back x
x 3, since (x 3)2 = x2 + x + 2,
x7 + x + 1 = (x 3)(x2 + x + 3)(x2 + x + 4)(x2 + x + 6).
Exercise 15.M.3. Let f (x) be an irreducible polynomial of degree 6 over a field F ,
and let K be a quadratic extension of F . What can be said about the degrees of the
irreducible factors of f in K[x]?

78

Proof. K = F (), where is the root of some irreducible quadratic polynomial

g F [x]. Let be a root of f ; then, 2 = [K : F ] and 6 = [F () : F ] divide
[K() : F ] 12 by Cor. 15.3.8, and so [K() : F ] {6, 12}. In either case, 3 divides
[K() : K], and so the minimal polynomial for over K is of degree 3 or 6. In the
former case, f splits into a product of polynomials of degree 3 over K. In the latter,
f remains irreducible over K. These are the only possibilities for the irreducible
factors of f in K, for the only possibility is that the factors of degree 3 factor further
to include linear factors, which is impossible since is of degree 6 over F .
Exercise 15.M.4.
(a) Let p be an odd prime. Prove that exactly half of the elements of F
p are squares
and that if and are nonsquares, then is a square.
(b) Prove the same assertion for any finite field of odd order.
(c) Prove that in a finite field of even order, every element

is a square.
(d) Prove that the irreducible polynomial for = 2 + 3 over Q is reducible
modulo p for every prime p.
Remark. (b) implies (a) and Lemma 15.7.10a implies (c), so it suffices to show (b)
and (d).
Proof of (b). Let F be our finite field of odd order, and consider the group homomorphism : F F defined by
2 . If ker then 2 = 1, hence
2
(x ) | x 1 in F [x]. Since F [x] is a UFD (Prop. 12.2.14(c)), this implies = 1.
Thus |ker | = 2 since char F 6= 2 implies 1 6= 1, and so the set of squares im in
F has order 12 |F | by the counting formula (Cor. 2.8.13).
Now let be a nonsquare. Consider the map : F F of sets defined by

. This is a bijection, and so to show sends non-squares to squares, it suffices

to show sends squares to non-squares. But this is true since if is a square and
is also a square, then 1 is also a square, hence is also, a contradiction.
Proof of (d). First, f := x4 10x2 + 1 is the irreducible polynomial for since
f () = 0 and Q() = Q(, ) by Exercise 11.1.3, and so [Q() : Q] = 4. In this field,
we have the factorization

f = (x ( 2 + 3))(x ( 2 3))(x ( 2 + 3))(x ( 2 3)).

If f reduces over Fp , then it must reduce to quadratic factors since
/ Fp ; thus, f
can factor in one of the three following ways by pairing up the factors above:

(x2 1 2 2)(x2 1 + 2 2), (x2 + 1 2 3)(x2 + 1 + 2 3),

(x2 5 2 6)(x2 5 + 2 6).

79

The first factorization can occur if 2 is a square mod p, the second can occur if 3 is
a square mod p, and the last can occur if 6 is a square mod p. By (a), (c), at least
one of 2, 3, 6 is a square in Fp , so at least one of these factorizations is possible and
f is reducible mod p for all p.
Exercise 15.M.6.
(a) Prove that a rational function f (t) that generates the field C(t) of all rational
functions defines a bijective map T 0 T 0 .
(b) Prove a rational function f (x) generates the field of rational functions C(x) if
and only if it is of the form (ax + b)/(cx + d), with ad bc 6= 0.
(c) Identify the group of automorphisms of C(x) that are the identity on C.
Proof of (a). Let f (t) F = C(t), and f = p/q for some coprime p, q C[t].
C[t](f ) is then isomorphic to F , which is isomorphic to F [x]/(p qx); note this
is still isomorphic to F . Likewise, consider F [y]/(y); this is also isomorphic to F .
By Prop. 15.9.5, we have isomorphic field extensions, hence the Riemann surfaces
{p qx = 0} and {y = 0} are isomorphic branched coverings of T 0 . Since {y = 0} is
the complex t-plane T 0 , the isomorphism of coverings is an isomorphism T 0 T 0 .
Proof of (b). Any function (ax + b)/(cx + d) with ad bc 6= 0 generates C(x) by
Exercise 12.2.5, since any element in C(x) can be expressed as a C-linear combination
of elements 1/(cx + d)i , and then by using the Euclidean algorithm (p. 45) to get
ax + b
q(cx + d) + r
r
=
=q+
, q, r C
cx + d
cx + d
cx + d
which implies 1/(cx + d)i for any i can be expressed as a C-linear combination of
(ax + b)i /(cx + d)i . Conversely, suppose a rational function f (x) generates C(x).
By (a), it induces an automorphism of the Riemann surface T 0 ; it suffices to show
that the automorphisms of T 0 are of the stated form. Suppose f = p/q defines
an automorphism of T 0 ; then, if either p, q had degree larger than 1, the induced
morphism would not be bijective since then p has two zeros; likewise, if q had degree
larger than 1, considering 1/f gives us the same argument. Moreover, one of p, q
must be non-constant also to induce a bijection. ad bc 6= 0 corresponds to having
p, q coprime, which was necessary in (a).
Solution for (c). By (a), (b), Aut(C(x)) consists of maps x
(ax + b)/(cx + d) for
ad bc 6= 0, which is a group under composition. We claim there is a surjective
homomorphism : GL2 (C) Aut(C(x)) defined by ( ac db )
(ax + b)/(cx + d). This
1
0
map clearly maps ( 0 1 )
x, is surjective, and is a homomorphism since
 0 0 
  0

a b
a b
aa + b0 c a0 b + b0 d
=
,
c0 d 0
c d
ac0 + cd0 bc0 + dd0
80

and both sides get mapped to

 0
 

a x + b0
ax + b
a0 (ax + b) + b0 (cx + d)
(aa0 + b0 c)x + (a0 b + b0 d)

=
=
.
c0 x + d0
cx + d
c0 (ax + b) + d0 (cx + d)
(ac0 + cd0 )x + (bc0 + dd0 )
It remains to find the kernel of . (ax + b)/(cx + d) = x C(x) if and only if
ax + b = x(cx + d) if and only if c = b = 0 and a = d. Hence ker = C ( 10 01 ), and so
by the first isomorphism theorem (Thm. 11.4.2(b)), Aut(C(x)) GL2 (C)/ ker =:
PGL2 (C), the projective general linear group of order 2.
Exercise 15.M.7. Prove that the homomorphism SL2 (Z) SL2 (Fp ) obtained by
reducing the matrix entries modulo p is surjective.
Proof. Let : Z Fp be the quotient map reducing mod p. We first show that if
u, v Fp are not both zero, then there exist c, d Z such that (c) = u, (d) = v,
and gcd(c, d) = 1. So suppose v 6= 0, and let 0 u, v < p be lifts of u, v in Z. Now
since p - v, there exist x, y Z such that x
v + yp = 1 since (p) is maximal in Z, and
so let c = x
uv + yp and d = v. Then, (d) = v, (c) = u since x
v 1 mod p, and
gcd(c, d) = 1 since 1 = c + xd(1 u). If v = 0, then necessarily u 6= 0, and switching
the roles of u, v gives the desired result.
Now suppose we have ( us vt ) SL2 (Fp ); let 0 s, t < p be lifts of s, t in Z. Then,
letting c, d as constructed above, we have sd tc = 1 + N p for some N Z. So,
letting a = s + mp and b = t + np where m, n Z such that N = cn dm, which is
possible since gcd(c, d) = 1,
ad bc = (
s + mp)d (t + np)c
= sd tc + (dm cn)p = 1 + (N + dm cn)p = 1,
hence ( ac db ) SL2 (Z) maps to ( us vt ) SL2 (Fp ).

16
16.1

Galois Theory
Symmetric Functions

Exercise 16.1.1. Determine the orbit of the polynomial below. If the polynomial is
symmetric, write it in terms of the elementary symmetric functions.
(a) u21 u2 + u22 u3 + u23 u1 (n = 3),
(b) (u1 + u2 )(u2 + u3 )(u1 + u3 ) (n = 3),
(c) (u1 u2 )(u2 u3 )(u1 u3 ) (n = 3),
81

(d) u31 u2 + u32 u3 + u33 u1 u1 u32 u2 u33 u3 u31

(e) u31 + u32 + + u3n .

(n = 3),

Solution for (a). The orbit consists of u21 u2 + u22 u3 + u23 u1 and u23 u2 + u22 u1 + u21 u3 ,
corresponding to odd and even permutations respectively in S3 .
Solution for (b). The orbit consists of only (u1 + u2 )(u2 + u3 )(u1 + u3 ), i.e., this
polynomial is symmetric. Since this polynomial is homogeneous of degree 3, write
(u1 + u2 )(u2 + u3 )(u1 + u3 ) = c1 s31 + c2 s1 s2 + c3 s3 .
Substituting (1, 0, 0), we have c1 = 0. Substituting (1, 1, 0), we have 2 = 2c2 hence
c2 = 1. Lastly, substituting (1, 1, 1), we have 8 = 9 + c3 hence c3 = 1. Thus,
(u1 + u2 )(u2 + u3 )(u1 + u3 ) = s1 s2 s3 .
Solution for (c). The orbit consists of (u1 u2 )(u2 u3 )(u1 u3 ) and (u1 u2 )(u2
u3 )(u1 u3 ), corresponding to odd and even permutations respectively in S3 .
Solution for (d). The orbit consists of u31 u2 + u32 u3 + u33 u1 u1 u32 u2 u33 u3 u31 and
u33 u2 + u32 u1 + u31 u3 u3 u32 u2 u31 u1 u33 , corresponding to odd and even permutations
respectively in S3 .
Solution for (e). The orbit consists of only u31 + u32 + + u3n , i.e., this polynomial
is symmetric. Since this polynomial is homogeneous of degree 3, write
u31 + u32 + + u3n = c1 s31 + c2 s1 s2 + c3 s3 .
Substituting (1, 0, . . . , 0), we have 1 = c1 . Substituting (1, 1, 0, . . . , 0), we have 2 =
8 + 2c2 hence c2 = 3. Lastly, substituting (1, 1, 1, 0 . . . , 0), we have 3 = 27 27 + c3 ,
hence c3 = 3. Thus,
u31 + u32 + + u3n = s31 3s1 s2 + 3s3 .
Exercise 16.1.3. Let wk = uk1 + + ukn .
(a) Prove Newtons identities: wk s1 wk1 + sk1 w1 ksk = 0.
(b) Do w1 , . . . , wn generate the ring of symmetric functions?
Proof of (a). For 1 < i k, let ri be the sum of all distinct monomials of degree k
where each monomial is the product of one variable raised to the power i and k i
distinct other variables; note rk = wk . We claim ski wi = ri + ri+1 for 1 < i < k.
This is true since each product of terms with distinct variables on the left contributes
82

to ri , while each product which has the term from wi occurring in the term from
ski contributes to ri+1 , and since all terms on the right are obtained exactly once
in this way. For i = k we recall s0 = 1, hence s0 wk = wk = rk . Finally, for i = 1 we
have sk1 w1 = ksk + r2 , since the terms contributing to r2 arise in the same way as
before, while the remaining terms produce k times each monomial in sk . The desired
identity is formed by taking the alternating sum of these equations.
Claim (b). w1 , . . . , wn generates the ring of symmetric functions if and only if m
R for all 1 m n.
Proof of Claim (b). . By Thm. 16.1.6, it suffices to show sk R[w1 , . . . , wn ] for
all k; we proceed by induction. If k = 1 then we are done, for s1 = w1 . Then, if
sj R[w1 , . . . , wn ] for all j < k, by (a) we have
sk =

1
(wk s1 wk1 + sk1 w1 ) R[w1 , . . . , wn ].
k

. We show the contrapositive. Suppose m

/ R for some 0 < m n; we claim
sm
/ R[w1 , . . . , wn ]. Suppose not; then, since sm is homogeneous of degree m, write
X
Y
sm =
rI
wi , rI R.
I{1,...,n}
P
iI i=m

iI

Then, substituting u1 = = um = 1, um+1 = = un = 0, we get wi = m for all i,

while sm = 1. But this is a contradiction, for the right side is in the ideal mR while
the left side = 1
/ mR.

16.2

The Discriminant

Exercise 16.2.2.
(a) Prove that the discriminant of a real cubic is non-negative if and only if the
cubic has three real roots.
(b) Suppose that a real quartic polynomial has positive discriminant. What can
you say about the number of real roots?
Proof of (a). Recall that the discriminant D is the product of squares of the differences of roots. So, if f has 3 roots in R, then the discriminant is trivially non-negative.
Conversely, if f does not have 3 roots in R, we know it must have one root a R,
and the other two roots must be a conjugate pair z, z since otherwise the constant
term in f would not be real. Then, we have
2

D = (a z)2 (a z)2 (z z)2 = (a z)2 (a z) (z z)2 .

83

Now (a z)(a z) > 0, and so it suffices to show (z z)2 < 0. But this is true since
z z = 2 Im z.
Solution for (b). We claim that a real quartic polynomial with positive discriminant
can have 0 or 4 real roots; note in particular this implies all roots are distinct. The
discriminant is given by
D = (1 2 )2 (1 3 )2 (1 4 )2 (2 3 )2 (2 4 )2 (3 4 )2 ,
where i are our roots; recall that complex roots must come in conjugate pairs, and
so we can have 0, 2, or 4 real roots in general. If all the roots are real D is clearly
non-negative. If none of the roots are real and 2 = 1 , 4 = 3 , we get
D = (1 1 )2 (1 3 )2 (1 3 )2 (1 3 )2 (1 3 )2 (3 3 )2
2

= (2 Im 1 )2 (2 Im 3 )2 (1 3 )2 (1 3 ) (1 3 )2 (1 3 ) ,
which is positive since each consecutive pair of factors multiply to be positive. However, 2 real roots is impossible since if 2 = 1 and 3 , 4 are real,
D = (2 Im 1 )2 (1 3 )2 (1 4 )2 (1 3 )2 (1 4 )2 (3 4 )2
2

= (2 Im 1 )2 (1 3 )2 (1 3 ) (1 4 )2 (1 4 ) (3 4 )2 ,
which is negative since the first factor is negative and the rest of the product is
positive.
Exercise 16.2.4. Use undetermined coefficients to determine the discriminant of
the polynomial
(a) x3 + px + q, (b) x4 + px + q, (c) x5 + px + q.
Lemma 16.2.4a. The discriminant Dn of xn + px + q for n 2 is given by
(1)

(n1)(n2)
2

(n 1)n1 pn + (1)

n(n1)
2

nn q n1 .

Proof of Lemma 16.2.4a. Let Dn (p, q) be the determinant of xn +px+q. If u1 , . . . , un

are the roots of xn + px + q, by the first equation in 16.2 we have sn (u1 , . . . , un ) =
(1)n q, sn1 (u1 , . . . , un ) = (1)n1 p, and sk (u1 , . . . , un ) = 0 for all 0 < k < n 1.
Note the discriminant is a homogeneous symmetric polynomial of degree n(n 1);
we claim the only monomials in the si appearing in Dn (p, q) are pn , q n1 . For, by the
above sn1 , sn are the only nonzero elementary symmetric polynomials that would
appear in Dn (p, q), and moreover if pk q j had degree n(n 1), then the equation
84

k(n 1) + jn = n(n 1) must hold, for which k = 0, j = n 1 and k = n, j = 0 are

the only non-negative solutions. Thus, we have Dn (p, q) = r(n)pn + s(n)q n1 .
Now consider the discriminant Dn (p, 0) for xn + px; since this has the same roots
as xn1 + p in addition to the root un = 0, we have
Dn (p, 0) = Dn1 (0, p)

n1
Y

u2i = Dn1 (0, p)p2

i=1

and so r(n)pn = s(n1)pn , i.e., r(n) = s(n1), and Dn (p, q) = s(n1)pn +s(n)q n1 .
It remains to find s(n). Calculating the discriminant Dn (0, 1) for f := xn 1,
n1

Dn (0, 1) = (1)

g(n) = (1)

n(n1)
2

n Y
Y

(i j )

i=1 i6=j

Q
where i are the roots of xn 1. Then, we have the equation xn 1 =
i (x i ),
Q
and so deriving both sides and substituting in x = i , we get nin1 = i6=j (i j ),
n(n1) Qn
n1
and so Dn (0, 1) = (1) 2
. Since i satisfies f , in1 = i1 , and so
i=1 ni
Dn (0, 1) = (1)

n(n1)
2

n
Y

i1 = (1)

n(n1)
2

(1)n1 nn ,

i=1

hence s(n) = (1)

n(n1)
2

nn , and finally

(1)

(n1)(n2)
2

(n 1)n1 pn + (1)

n(n1)
2

nn q n1 .

Solution for (a). D3 = 4p3 27q 2 by Lemma 16.2.4a.

Solution for (b). D4 = 27p4 + 256q 3 by Lemma 16.2.4a.
Solution for (c). D5 = 256p5 + 3125q 4 by Lemma 16.2.4a.
Exercise
16.2.7. There are n variables. Let m = u1 u22 u33 un1
n1 and let p(u) =
X
(m). The Sn -orbit of p(u) contains two elements, p and another polynomial q.
An

Prove that (p q)2 = D(u).

Q
Proof. Let R[u1 , . . . , un ] be our polynomial ring, and let (u) = i<j (ui uj ). We
first claim ui uj | p q for all i < j. This is equivalent to showing p q = 0 if
ui uj = 0.
85

So suppose ui = uj for i < j, and let = (ij) Sn . Then, p(u) = p( (u)) and
q(u) = q( (u)), and we have
X
X
p( (u)) =
( (m)) =
0 (m) = q(u).
0 An

An

Similarly, q( (u)) = p(u), since An has exactly two cosets in Sn . Thus, p(u) q(u) =
q(u) p(u), and so p(u) q(u) = 0.
Now since (u) is homogeneous
of degree n(n 1)/2, as are p, q, ui uj | p q
Q
for all i < j implies
p

q
=
a
(u
i uj ) for some a R. But a = 1 since in the
i<j
Q
equation
in the expression
Qp q = Sn sgn()(m), the coefficient on m is 1, while
2
(u) = i<j (ui uj ), the coefficient on m is 1. Thus, (p q) = (u)2 = D(u).

16.3

Splitting Fields

Exercise 16.3.1. Let f be a polynomial of degree n with coefficients in F and let K

be a splitting field for f over F . Prove that [K : F ] divides n!.
Proof. We use induction on the degree of f . The claim is trivial if n = 1, so suppose
n > 1. Suppose f is reducible, and let g be an irreducible factor of f of degree
m. Then, we can choose a subfield F1 K such that g splits completely, hence
[F1 : F ] | m! by inductive hypothesis. Similarly, [K : F1 ] | (n m)! by inductive
hypothesis since K is a splitting field for f /g over F1 . Hence by the multiplicative
property of the degree (Thm. 15.3.5), [K : F ] | m!(n m)! | n!.
Now suppose f is irreducible. Then, F1 := F [x]/(f ) is a field extension of degree
n such that f has a root . Thus, [K : F1 ] | (n 1)! by inductive hypothesis since K
is a splitting field for f /(x ) over F1 , and so [K : F ] | n(n 1)! = n! as above.

16.4

Isomorphisms of Field Extensions

Exercise 16.4.1.

(a) Determine all automorphisms of the field Q( 3 2), and of the field Q( 3 2, ),
where = e2i/3 .
(b) Let K be the splitting field over Q of f (x) = (x2 2x 1)(x2 2x 7).
Determine all automorphisms of K.
Solution for (a). We first claim that any automorphism of either field must leave
Q fixed. Any integer is held fixed by Exercise 2.6.2 and since (1) = 1. Any rational
p/q must then be fixed since multiplicative inverses are preserved through .
86

Now let Aut Q(3 2). isthen determined by ( 3 2), and it is necessary
that

3
3
3
3
j 3
( 2) = 2. Thus, ( 2) = 2 for some j {0, 1, 2}; however, Q( 2) R, and
C \ R, hence j = 0
and = id.

Now let Aut

Q( 3 2, ). is then determinedby ( 3
2) and (), and it is

3
3
3
3
j 3
necessary that ( 2) = 2 and () = 1. Thus, ( 2) = 2 and () = k for
some j, k {0, 1, 2}. k 6= 0 for otherwise
is not surjective. Any of the remaining
3
choices gives an automorphism, hence Q( 2, ) has six automorphisms.

Solutionfor (b). The roots of f are 1 2, 1 2 2 by the quadratic formula, hence

K
= Q( 2), which only has the trivial automorphism and the automorphism sending
2
2 as in Ex. 16.4.1.

16.5

Fixed Fields

t+i
it i
and (t) =
of
ti
t+1
C(t) generate a group isomorphic to the alternating group A4 , and determine the
fixed field of this group.
Exercise 16.5.2. Show that the automorphisms (t) =

Solution. We first calculate products of , :

1
1
2 = ,
= ,
t
t
t+i
ti
it + 1
it + 1
2
2
2
=
,
=
,
=
, =
,
ti
t+i
it + 1
it + 1
t+1
it i
t+1
it + 1
2 =
,
=
, 2 =
,
2 =
,
it + i
t+1
it i
t+1
id = t,

= t,

(7)

where we have used the relations 3 = 3 = = id, hence there are 12 elements
in this group G. Now consider the four pairs of 3 points defining circles in CP1 :
{{0, i, 1}, {1, i, }},
{{0, i, 1}, {1, i, }},

{{0, 1, i}, {i, 1, }},

{{0, 1, i}, {1, i, }}.

Labeling these 1, 2, 3, 4 respectively, we have that permutes these pairs as (123)

and does as (234), hence G is isomorphic to a subgroup of S4 . By the above, this
has order 12; by Exercise 6.7.11 we then know that G A4 .
To find the fixed field, the first row in (7) gives a subgroup of A4 isomorphic to
the Klein 4-group C2 C2 . We then note by Thm. 16.5.2(a) that the irreducible
polynomial for t over the fixed field is the polynomial whose roots form its orbit:
(x t)(x + t)(x 1/t)(x + 1/t) = (x2 t2 )(x2 1/t2 ) = x4 (t2 + t2 )x2 + 1.
87

Thus letting u = t2 + t2 , we have that [C(t) : C(u)] 4. Note u is fixed by C2 C2 ,

hence C(u) C(t)C2 C2 , and that since by the fixed field theorem (Thm. 16.5.4),
[C(t) : C(t)C2 C2 ] = 4, it follows that C(u) = C(t)C2 C2 .
We now want to find the subfield of C(u) that is fixed by all of A4 ; by (7) since
and C2 C2 generate A4 , it suffices to find the subfield of C(u) fixed by . We have

2 
2
1
t+i
ti
2(t4 6t2 + 1)
2(u 6)
(u) = (t) +
=
+
=
=
(t)2
ti
t+i
(t2 + 1)2
u+2

2 
2
4
2
1
t+1
t1
2(t + 6t + 1)
2(u + 6)
2 (u) = 2 (t)2 + 2 2 = i
+ i
=
=
2
2
(t)
t1
t+1
(t 1)
u2
2

hence
(x u)(x (u))(x 2 (u)) = x3

u(u2 36) 2
4u(u2 36)
x

36x
+
.
u2 4
u2 4

36)
Now letting v = u(uu2 4
, v is fixed by and [C(u) : C(v)] 3, hence by the fixed
field theorem (Thm. 16.5.4) C(v) = C(u)hi = C(t)A4 . Explicitly,

v=

16.6

(t4 + 1)(t8 34t4 + 1)

.
t2 (t4 1)2

Galois Extensions

Exercise 16.6.1. Let be a complex rootof x3 + x + 1 over Q, and let K be a

splitting field of this polynomial over Q. Is 31 in the field Q()? Is it in K?

Solution. By the multiplicative

property of degree (Thm. 15.3.5),
31
/ Q()

since has degree 3 while 31 has degree 2 over Q. However, 31 K because

the discriminant of x3 + x + 1 is 31 by Exercise 16.2.4(a), and the square root of
the discriminant is a product of differences of elements in K.

16.7

The Main Theorem

Exercise 16.7.4. Let F = Q, and let K = Q( 2, 3, 5). Determine all intermediate fields.
Proof. K is the splitting field of the polynomial (x2 2)(x2 3)(x2 5), and so F K
is a Galois extension of order 8 with Galois group G =
2 C2 = h2 , 3 , 5 i,
C2 C
where k is the field automorphism over Q such that k
k.
88

The lattice diagram for subgroups of C2 C2 C2 is given by

{e}

h5 i

h2 i

h2 3 i

h2 3 5 i

h3 5 i

h2 5 i

h3 i

h3 , 5 i

h2 , 5 i

h2 , 3 i

h5 , 2 3 i h2 , 3 5 i h2 3 , 2 5 i h3 , 2 5 i

C2 C2 C2
which corresponds to the lattice diagram of intermediate fields

Q( 2, 3, 5)

Q( 2, 3) Q( 3, 5) Q( 5, 6) Q( 6, 10) Q( 2, 15) Q( 3, 10) Q( 2, 5)

Q( 2)

Q( 3)

Q( 5)

Q( 6)

Q( 15)

Q( 30)

Q( 10)

Q
by computing fixed fields according to Thm. 16.7.1.
Exercise 16.7.6. Let K/F be a Galois extension whose Galois group is S3 . Is K
the splitting field of an irreducible cubic polynomial over F ?
89

Solution. We claim it is. Let S2 6 S3 be the subgroup fixing 3, and consider the
chain F K S2 K. By Thm. 16.7.5, the first extension in this chain is not Galois
since S2 6 S3 is not normal, while the second extension is Galois with Galois group
S2 . By Cor. 16.7.2(c), [K S2 : F ] = [S3 : S2 ] = 3. Now if K S2 \ F , let f F [x] be
its irreducible polynomial; note that deg f = 3, and that K S2 = F (). Since K S2 /F
is not Galois, f does not split in K S2 by Thm. 16.6.4, but it does split in K by the
splitting theorem (Thm. 16.3.2). Since [K : K S2 ] = 2, there are no intermediate
fields between K S2 , K, and so K/F must be the splitting field of f .
Exercise 16.7.10. Let K/F be a Galois extension with Galois group G, and let H
be a subgroup of G. Prove that there exists an element K whose stabilizer is
equal to H.
Proof. Recall from p. 484 that we assume K, F have characteristic zero, and that
K/F is a finite extension. So consider the chain of extensions F K H K;
by the primitive element theorem (Thm. 15.8.1) there exists K H such that
K H = F (). We claim G = H. Clearly H G , so suppose G \ H. Then,
0
H 0 := hH, i ) H, and K H K H by Cor. 16.7.2(a). Every element in K H is
0
fixed by H 0 , hence K H = K H . But then [K : K H ] = |H| = |H 0 | by Cor. 16.7.2(c),
contradicting that H ( H 0 .

Exercise 16.7.11. Let = 3 2, = 3, and = + . Let L be the field Q(, ),

and let K be the splitting field of the polynomial (x3 2)(x2 3) over Q.
(a) Determine the irreducible polynomial f for over Q, and its roots in C.
(b) Determine the Galois group of K/Q.
Solution for (a). First, ( )3 = 3 3 2 + 9 3 = 2, hence
=

3 + 9 2
,
3 2 + 3

and so Q() = Q(, ). Moreover, since has degree 3 and has degree 2 over Q,
by Cor. 15.3.8 [L : Q] = 6. Thus, the irreducible polynomial for has degree 6. Now
letting f (x) = ((x )3 2)((x + )3 2), f () = 0 by construction, and
f (x) = (x3 + 9x 2 3(x2 + 1))(x3 + 9x 2 + 3(x2 + 1))
= (x3 + 9x 2)2 27(x2 + 1)2 = x6 9x4 4x3 + 27x2 36x 23.
Since deg f (x) = 6, it is then the irreducible polynomial for . Now z C is a root
of f (x) if and only if z = j where = e2i/3 and j {0, 1, 2}, hence the roots
of f (x) are + j .
90

Solution for (b). Denote G = G(K/Q). f (x) from (a) splits completely in K by the
splitting theorem (Thm. 16.3.2); similarly, (x3 2)(x2 3) splits completely in the
splitting field for f (x) since , can be obtained as linear combinations of the roots
of f (x). Thus, K is the splitting field for f (x). If j {1, 2},
+ j = +

1 (1)j i
1
(1)j
=
i,
2
2
2

hence K = Q(, i) = Q(, , i), and so [K : Q] = [K : Q()][Q() : Q] = 12 by the

multiplicative property of the degree (Thm. 15.3.5).
Now let K1 be the splitting field for x3 2 and let K2 be the splitting field for
2
x 3. We have the lattice diagram of intermediate fields
splits x2 3

K
splits x3 2

K1

K2

splits x3 2

splits x2 3

Q
Each field extension is Galois by Thm. 16.6.4(c), and so in particular the subgroups
G1 := G(K/K1 ) and G2 := G(K/K2 ) of G fixing K1 , K2 respectively are normal
subgroups of G by Thm. 16.7.5. The extension K/K1 is quadratic, hence G1 C2 ;
the extension K/K2 is cubic with [K : K2 ] = 6, hence G2 S3 as on p. 492.
We therefore claim G G1 G2 C2 S3 . Consider the multiplication map
: G1 G2 G. We first claim is injective. By Thm. 16.6.6(b), it suffices to show
any G1 G2 operates as the identity on + j . But j K1 and K2
by definition, hence G1 G2 = {1}. Now since also |G1 G2 | = 12 = |G|, is also
surjective, and is therefore an isomorphism.

16.8

Cubic Equations

Exercise 16.8.4. Let K = Q(), where is a root of the polynomial x3 + 2x + 1,

and let g(x) = x3 + x + 1. Does g(x) have a root in K?
Solution. Let f (x) = x3 + 2x + 1. By the rational root test, f (x), g(x) are both
irreducible in Q[x]. By (16.2.8), their discriminants are 59, 31 respectively, so
since both are not squares, by Thm. 16.8.5 their splitting fields Lf , Lg have degree 6
over Q, with Galois group S3 . Now if g(x) has a root in K, then it splits completely
91

in K by the splitting theorem (Thm. 16.3.2), hence Lf = Lg since both are of degree
6 over Q. Since the Galois group is
S3 , there should
be one intermediate field of
degree 2 over Q, but we have two, Q( 59) and Q( 31), a contradiction.

16.9

Quartic Equations

Exercise 16.9.6. Compute the discriminant of the quartic polynomial x4 + 1, and

determine its Galois group over Q.
Solution. By Exercise 16.2.4(c), the discriminant is 256. By Prop. 16.9.5, this implies
the Galois group G is A4 or D2 . Now the roots of x4 + 1 are
1
1
1 = (1 + i), 2 = (1 + i),
2
2

1
3 = (1 i),
2

1
4 = (1 i).
2

1 = 0, 2 = 2, 3 = 2 gives g(x) = x(x 2)(x + 2), so G = D2 by Prop. 16.9.8.

Exercise 16.9.13. Let K be the splitting field over Q of the polynomial x4 2x2 1.
Determine the Galois group G of K/Q, find all intermediate fields, and match them
up with the subgroups of G.
Solution. We find
the roots of x4 2x2 1. We first apply the quadratic equation

to get x2 = 1 2; then,
q
q

1 = 1 + 2, 2 = 1 2, 3 = 1 , 4 = 2 .
1 = 2i, 2 = 2, 3 = 2i, so g(x) = (x + 2)(x2 + 4). As in Ex. 16.9.2(a), G is a
subgroup of D4 = h, i where = (1234), = (24). By Prop. 16.9.8, G = D4 or C4 .
As in Ex. 16.9.2(a), = 2 = (13)(24) corresponds to an automorphism
K/Q; call

2
N the normal subgroup oforder 2 generated by . Now 1 = 1+ 2and 1 2 = i are
both fixed
K N . The chain of fields Q Q( 2, i) K N K
by , hence Q( 2, i)
N
has [Q( 2, i) : Q] = 4, [K : K ] = 2 by Thm. 16.5.4, and so [K : Q] = 8, so G = D4 .
The lattice diagram for subgroups of D4 is as given in Exercise 6.4.2:
{e}
{e, }

{e, 2 }

{e, 2 }

{e, }

{e, 2 , , 2 }

{e, , 2 , 3 }

{e, 2 , , 3 }

D4
92

{e, 3 }

which corresponds to the lattice diagram of intermediate fields

K
Q(1 )

Q(2 )

Q( 2, i)

Q(1 2 )

Q(i)

Q(i 2)

Q( 2)

Q(1 + 2 )

Q
by computing fixed fields according to Thm. 16.7.1.
2i/3
Exercise 16.9.14. Let F = Q(),
where = ep
. Determine the Galois group
p

3
over F of the splitting field of (a) 2 + 2, (b) 2 + 3 2.

Remark. We note there are analogues of results from 12.312.4 for checking irreducibility of polynomials in F [x]: Gausss lemma (Prop. 12.3.4(b)) only needs F
to be the fraction field of a UFD, and Z[] is a UFD by Exercise 12.2.6(a) and
Props. 12.2.7 and 12.2.14(b). Moreover, Eisenstens criterion generalizes to Z[][x]
by looking at prime elements p Z[].
p

3
Solution for (a). Let = 2 + 2, with splitting field K/F . satisfies the polynomial f (x) = (x3 2)2 2 = p
x6 4x3 + 2. The quadratic equation gives that

3
x3 = 2 2, hence writing 0 = 2 2, we can write the roots as
1 = , 2 = 0 ,

3 = ,

4 = 0 ,

5 = 2 ,

6 = 2 0 .

Thus if 1
i , then 3
i , 5
2 i . The permutations with this property
are generated by = (123456), = (246) in S6 ; these form what is called the
semidirect product C6 o C3 , and so G(K/F ) 6 C6 o C3 .
Now f is irreducible over F by Eisensteins criterion
using p = 2 which is prime

by Exercise 12.5.9(b), hence [F () : F ] = 6. Also, 2 F (), hence 0 has degree 3

or 1 over F (). Thus, [K : F ] = 6 or 18.
We claim [K : F ] = 18. Consider 2 = (135)(246); it is in all subgroups of C6 oC3
of order 6, hence extends to an F -automorphism of K. Let N be
of
q the subgroup

3
2
N
2 0
order 3 generated by . The fixed field K contains = 2(2 + 2); let L
be the field generated by this element over F . The chain F L K N K has
[K : K N ] = 3 by the fixed field theorem (Thm. 16.5.4), and [L : F ] 3, hence
[K : F ] = 18, and so G(K/F ) = C6 o C3 .
93

Solution for (b). Let = 2 + 3 2, with splitting field K/F . satisfies the polynomial f (x) = (x2 2)3 2 = x6 6x4 + 12x2 10. The roots of f (x) are
q
q

3
3
1 = , 2 = 2 + 2, 2 = 2 + 2 2, 4 = 1 , 5 = 2 , 6 = 3 .
Thus if i
j , then i+3
j+3 , where we treat subscripts mod 6. The group
G of permutations satisfying these is generated by the subgroup of S6 isomorphic to
S3 permuting {{1, 4}, {2, 5}, {3, 6}} isomorphic to S3 and C2 h(14)(25)(36)i 6 S6 .
Now S3 C2 = {1}, and if S3 , C2 , = , hence S3 , C2 are normal in G,
G S3 C2 by Prop. 2.11.4(d), and G(K/F ) 6 G.
Now f is irreducible over F
by Eisensteins criterion, again using that 2 is prime,
j 3
hence [F () : F ] = 6. Also, 2 F () for j {0, 1, 2}, hence 2 , 3 have degree
2 or 1 over F (). Thus, [K : F ] {6, 12, 24}. But |G| = 12, hence [K : F ] = 24 is
impossible.
We claim [K : F ] = 12. Consider = ({1, 4}{2, 5}{3, 6}) G; it is contained in
every subgroup of G of order 6, hence extends to an F -automorphism of K. Let N
be
N
the subgroup of order 3 generated by . The fixed field K contains 1 2 3 = 10;
let L be the field generated by this element over F . The chain F L K N K
has [K : K N ] = 3 by the fixed field theorem (Thm. 16.5.4), and [L : F ] = 2.
But [K N : L] > 1 since 1 + 2 + 3 K N \ L, hence [K : F ] = 12, and so
G(K/F ) = S3 C2 .

16.10

Roots of Unity

Exercise 16.10.3. Let = 7 . Determine the degree of the following elements over
Q.
(a) + 5 , (b) 3 + 4 , (c) 3 + 5 + 6 .
Remark. Suppose we want to find the degree of Q(). By Prop. 16.10.2,
G(Q()/Q) = C6 consisting of i given by i () = i for 1 i 6. If H 6 C6
is the subgroup fixing , then by the main theorem (Thm. 16.7.1) Q() = Q()H .
Thus, the multiplicative property of degree (Thm. 15.3.5) gives us [Q() : Q] =
[Q() : Q]/[Q() : Q()H ] = 6/|H| by the fixed field theorem (Thm. 16.5.4).
Solution for (a). {1 } fixes + 5 , hence + 5 has degree 6.
Solution for (b). {1 , 6 } fixes 3 + 4 , hence 3 + 4 has degree 3.
Solution for (c). {1 , 2 , 4 } fixes 3 + 5 + 6 , hence 3 + 5 + 6 has degree 2.

94

16.11

Kummer Extensions

Exercise 16.11.5.
(a) How does Cardanos formula (16.11.5) express the roots of the polynomials
x3 + 3x, x3 + 2 and x3 3x + 2?
(b) What are the correct choices of roots in Cardanos formula?
p
p

3
3
3
Solution for (a). For xp
+ 3x, we getp 0 + 1 + 0 1.

3
3
For x3 + 2 we get 1p
+ 1 + 1p
1.

3
3
For x3 3x + 2 we get 1 + 0 + 1 0 = 3 1 + 3 1.

Solution for (b). For x3 + 3x, the solutions are 0, i 3. To get0, we choose 1 to
3
2ik/3
have
the same sign to be 1 in both
and
terms, and then
choose 1 = e

3
2ik/3
1 = p
e
for kp {1, 2}. For i 3, we choose 1 to have different signs 1, 1

3
3
so that 0 + 1 + 0 1 = 2 3 1 = 2 3 1, and then choose 3 1= e2ik/3 for
k = 1 if we chose to be +, and k = 2 if we chose to be . For i 3 we would
switch our choice for k.
p
p

3
3
3
For
x
+
2,
we
choose
the
same
square
roots,
giving
1
+
1
+
1

1=

3
2, and each choice of cube root gives us a solution.
For x3 3x + 2, x3 3x + 2 = (x 1)2 (x + 2), so 1, 2 are the solutions. 2 is
obtained by choosing 1 for both. 1 is obtained by choosing a primitive cube root
of unity for one root, and for the other.

16.12

Quintic Equations

Exercise 16.12.7. Find a polynomial of degree 7 over Q whose Galois group is S7 .

Solution. We first claim Sp is generated by a p-cycle and a transposition for p prime.
Let (ab cd), (ef ) be our p-cycle and transposition. By renaming e = 1, we can assume they are (ab 1 cd) = (1 cdab ), (1f ). Now (1 cdab )k = (1f )
for some 1 k p 1 since p is prime, hence we can assume our generators are
(1f ), (1f ); by renaming f = 2 and the rest of the elements in (1f ) accordingly,
we can assume our generators are = (12 p), = (12). Now
1 = (1p), 1 (1p) = ((p 1)p),

1 ((p 1)p) = ((p 2)(p 1)),

so we can generate all permutations of the form ((k 1)k). These generate Sp .
Now let f (x) = (x3 2)(x2 4)(x2 32)+2 = x7 36x5 2x4 +128x3 +72x2 254.
This is irreducible by the Eisenstein criterion; also it has 5 real roots and 2 complex
roots by looking at its graph. The only permutations of its roots that fix the real
95

roots is conjugation, which corresponds to a transposition in G; moreover, G operates

transitively on the roots, hence contains a 7-cycle, and the Galois group is therefore
S7 by the above.

16.M

Miscellaneous Problems

Exercise 16.M.4.
(a) The non-negative real numbers are those having a real square root. Use this
fact to prove that the field R has no automorphism except the identity.
(b) Prove that C has no continuous automorphisms other than complex conjugation and the identity.
Proof of (a). Any automorphism is clearly the identity on the integers and rationals, since (n) = (1+ +1) = (1)+ +(1) = n, and then q(p/q) = (p) = p.
Let a be such that (a) = b 6= 0. Then b < a after possibly multiplying by 1.
Subtracting a suitable rational from each, we get b < 0 < a. But then a = 2 , so
()2 = (2 ) = (a) = b, contradicting b < 0.
Proof of (b). By (a), any automorphism is the identity on Q. Now letting i be
such that i2 = 1, we see (i)2 = 1, but since only i square to get 1 in C, on
Q[i] we have that is either the identity or complex conjugation.
Finally, Q[i] is dense in C, hence any automorphism of C must also be either the
identity or complex conjugation by continuity.
Exercise 16.M.7. A polynomial f in F [u1 , . . . , un ] is 12 -symmetric if f (u1 , . . . , un )
= f (u1 , . . . , un ) for every even permutation , and skew-symmetric if f (u1 , . . . , un )
= (sign )f (u1 , . . . , un ) for every permutation .
Q
(a) Prove that the square root of the discriminant := i<j (xi xj ) is skewsymmetric.
(b) Prove that every 12 -symmetric polynomial has the form f + g, where f , g are
symmetric polynomials.
Proof of (a). It suffices to show that for any permutation of two elements contributes
a negative sign, for any permutation is generated by permutations of two elements,
and the number of permutation of two elements needed to generate a given permutation is equal to its sign.
So suppose we are interchanging ui , uj ; assume without loss of generality that
i < j. Then the terms in involving ui , uj have the product
(ui uj )

i1
Y

(uk ui )

k=1

j1
Y

(uk uj )

k=1

j1
Y

(uk uj )

k=i+1

j1
Y

(ui uk )

k=i+1

96

n
Y

(ui uk )

k=j+1

n
Y

(uj uk )

k=j+1

Now interchanging ui , uj causes a sign change in each factor; the sign change in
ui uj is the only one that remains since each two adjacent factors in the rest of the
product have canceling sign changes. Hence also changes sign when interchanging
ui and uj , i.e., is skew-symmetric.
Proof of (b). Let h be our 12 -symmetric polynomial. Assume that char F 6= 2. If h is
symmetric, we are done by letting f = h, g = 0 so suppose not. The action of S = Sn
on h has orbit {h, h0 } for some other polynomial h0 , since by the orbit-stabilizer
theorem |Sh ||Sh| = |S|, but Sh = An so |Sh| = 2. This implies f = 12 (h + h0 ) is
symmetric, for h, h0 will just be interchanged. g = h f = 12 (h h0 ) is antisymmetric
for the same reason.
It now suffices to show that any antisymmetric polynomial g is divisible by ,
i.e., any binomial ui uj divides it. For, if is the substitution map letting uj = ui ,
then (
g ) = (
g ) implies (
g ) = 0. So letting g = g/ suffices, since g cannot be
anti-symmetric otherwise g would be symmetric by (a).
Exercise 16.M.10. Let K be a finite extension of a field F , and let f (x) be in K[x].
Prove that there is a nonzero g(x) in K[x] such that the product f (x)g(x) is in F [x].
Proof. We can assume f (x) is irreducible by working with irreducible factors individually; suppose moreover that it is monic. Any root of f (x) is algebraic over K
hence algebraic over F by Exercise 15.10.1. Thus we have h(x) F [x] the minimal
polynomial for over F . Then f | h since f is defined over K; thus h = f g for some
g K[x].

97

List of Solved Exercises

2

Groups
2.1 Laws of Composition . . . . .
Exercise 2.1.2 . . . . . . . . .
Exercise 2.1.3 . . . . . . . . .
2.2 Groups and Subgroups . . . .
Exercise 2.2.3 . . . . . . . . .
Exercise 2.2.4 . . . . . . . . .
2.4 Cyclic Groups . . . . . . . . .
Exercise 2.4.1 . . . . . . . . .
Exercise 2.4.3 . . . . . . . . .
Exercise 2.4.6 . . . . . . . . .
Exercise 2.4.9 . . . . . . . . .
Exercise 2.4.10 . . . . . . . .
2.6 Isomorphisms . . . . . . . . .
Exercise 2.6.2 . . . . . . . . .
Exercise 2.6.3 . . . . . . . . .
Exercise 2.6.6 . . . . . . . . .
2.8 Cosets . . . . . . . . . . . . .
Exercise 2.8.4 . . . . . . . . .
Exercise 2.8.8 . . . . . . . . .
Exercise 2.8.10 . . . . . . . .
2.10 The Correspondence Theorem
Exercise 2.10.3 . . . . . . . .
2.11 Product Groups . . . . . . . .
Exercise 2.11.1 . . . . . . . .
Exercise 2.11.3 . . . . . . . .
2.12 Quotient Groups . . . . . . .
Exercise 2.12.2 . . . . . . . .
Exercise 2.12.4 . . . . . . . .
Exercise 2.12.5 . . . . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

Symmetry
6.3 Isometries of the Plane . . . . .
Exercise 6.3.2 . . . . . . . . . .
Exercise 6.3.6 . . . . . . . . . .
6.4 Finite Groups of Orthogonal
Operators on the Plane . . . . .
Exercise 6.4.2 . . . . . . . . . .
Exercise 6.4.3 . . . . . . . . . .
6.5 Discrete Groups of Isometries .
Exercise 6.5.5 . . . . . . . . . .
Exercise 6.5.9 . . . . . . . . . .
6.6 Plane Crystallographic Groups
Exercise 6.6.2 . . . . . . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.

4
6.7 Abstract Symmetry: Group Operations . . . . . . . . . . . . .
4
Exercise 6.7.1 . . . . . . . . . .
4
Exercise 6.7.2 . . . . . . . . . .
4
Exercise 6.7.8 . . . . . . . . . .
4
Exercise 6.7.11 . . . . . . . . .
4
6.8 The Operation on Cosets . . . .
5
Exercise 6.8.4 . . . . . . . . . .
5
6.9 The Counting Formula . . . . .
5
Exercise 6.9.4 . . . . . . . . . .
6
6.10 Operations on Subsets . . . . .
6
Exercise 6.10.1 . . . . . . . . .
6
6.11 Permutation Representations .
6
Exercise 6.11.1 . . . . . . . . .
7
Exercise 6.11.5 . . . . . . . . .
7
Exercise 6.11.6 . . . . . . . . .
7
6.12 Finite Subgroups of the Rota8
tion Group . . . . . . . . . . . .
8
Exercise 6.12.3 . . . . . . . . .
8
Exercise 6.12.7 . . . . . . . . .
9
6.M
Miscellaneous Problems . . . .
9
Exercise
6.M.7 . . . . . . . . . .
9
9
9 11 Rings
11.1 Definition of a Ring . . . . . . .
9
Exercise 11.1.1 . . . . . . . . .
10
Exercise 11.1.2 . . . . . . . . .
10
Exercise 11.1.3 . . . . . . . . .
10
11.2 Polynomial Rings . . . . . . . .
11
Exercise 11.2.1 . . . . . . . . .
11
Exercise 11.2.2 . . . . . . . . .
11.3 Homomorphisms and Ideals . .
13
Exercise 11.3.3 . . . . . . . . .
13
Exercise 11.3.5 . . . . . . . . .
13
Exercise 11.3.7 . . . . . . . . .
13
Exercise 11.3.8 . . . . . . . . .
Exercise 11.3.9 . . . . . . . . .
14
Exercise 11.3.10 . . . . . . . . .
14
Exercise 11.3.11 . . . . . . . . .
15
Exercise 11.3.12 . . . . . . . . .
16
Exercise 11.3.13 . . . . . . . . .
16
11.4 Quotient Rings . . . . . . . . .
16
Exercise 11.4.2 . . . . . . . . .
17
17
Exercise 11.4.3 . . . . . . . . .

98

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

17
17
17
17
18
18
18
19
19
19
19
20
20
20
21

.
.
.
.
.

21
21
22
23
23

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

24
24
24
24
25
25
25
26
27
27
29
29
30
30
31
31
31
31
32
32
32

Exercise 11.4.4 . . . . .
11.5 Adjoining Elements . . .
Exercise 11.5.1 . . . . .
Exercise 11.5.3 . . . . .
Exercise 11.5.4 . . . . .
Exercise 11.5.6 . . . . .
11.6 Product Rings . . . . . .
Exercise 11.6.1 . . . . .
Exercise 11.6.2 . . . . .
Exercise 11.6.3 . . . . .
Exercise 11.6.4 . . . . .
Exercise 11.6.5 . . . . .
Exercise 11.6.6 . . . . .
Exercise 11.6.7 . . . . .
Exercise 11.6.8 . . . . .
11.7 Fractions . . . . . . . . .
Exercise 11.7.1 . . . . .
Exercise 11.7.2 . . . . .
Exercise 11.7.3 . . . . .
Exercise 11.7.4 . . . . .
11.8 Maximal Ideals . . . . .
Exercise 11.8.1 . . . . .
Exercise 11.8.2 . . . . .
Exercise 11.8.3 . . . . .
Exercise 11.8.4 . . . . .
11.9 Algebraic Geometry . .
Exercise 11.9.4 . . . . .
Exercise 11.9.5 . . . . .
Exercise 11.9.6 . . . . .
Exercise 11.9.11 . . . . .
Exercise 11.9.12 . . . . .
Exercise 11.9.13 . . . . .
11.M Miscellaneous Problems
Exercise 11.M.3 . . . . .
Exercise 11.M.4 . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

33
33
33
33
34
34
35
35
35
35
35
36
36
36
37
37
37
38
38
38
38
38
39
39
39
40
40
40
40
41
41
42
42
42
43

12 Factoring
12.1 Factoring Integers . . . . . . .
Exercise 12.1.4 . . . . . . . .
Exercise 12.1.5 . . . . . . . .
12.2 Unique Factorization Domains
Exercise 12.2.1 . . . . . . . .
Exercise 12.2.2 . . . . . . . .
Exercise 12.2.5 . . . . . . . .
Exercise 12.2.6 . . . . . . . .
Exercise 12.2.9 . . . . . . . .

.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.

45
45
45
45
46
46
46
46
48
49

12.3 Gausss Lemma . . . . . . . .

Exercise 12.3.1 . . . . . . . .
Exercise 12.3.2 . . . . . . . .
Exercise 12.3.4 . . . . . . . .
Exercise 12.3.6 . . . . . . . .
12.4 Factoring Integer Polynomials
Exercise 12.4.4 . . . . . . . .
Exercise 12.4.6 . . . . . . . .
Exercise 12.4.7 . . . . . . . .
Exercise 12.4.12 . . . . . . . .
Exercise 12.4.13 . . . . . . . .
Exercise 12.4.15 . . . . . . . .
Exercise 12.4.19 . . . . . . . .
12.5 Gauss Primes . . . . . . . . .
Exercise 12.5.2 . . . . . . . .
Exercise 12.5.3 . . . . . . . .
Exercise 12.5.5 . . . . . . . .
Exercise 12.5.6 . . . . . . . .
Exercise 12.5.7 . . . . . . . .
Exercise 12.5.9 . . . . . . . .
Exercise 12.5.10 . . . . . . . .
12.M Miscellaneous Problems . . .
Exercise 12.M.5 . . . . . . . .
Exercise 12.M.6 . . . . . . . .
Exercise 12.M.7 . . . . . . . .
Exercise 12.M.8 . . . . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

50
50
50
50
51
51
51
52
52
52
54
55
55
56
56
56
56
57
57
58
58
59
59
59
60
61

13 Quadratic Number Fields

13.1 Algebraic Integers . . . . . .
Exercise 13.1.4 . . . . . . .
13.2 Factoring Algebraic Integers
Exercise 13.2.2
. . . . . . .

13.3 Ideals in Z[ 5] . . . . . .
Exercise 13.3.2 . . . . . . .
Exercise 13.3.3 . . . . . . .
13.4 Ideal Multiplication . . . . .
Exercise 13.4.3 . . . . . . .
13.5 Factoring Ideals . . . . . . .
Exercise 13.5.2 . . . . . . .

.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.

61
61
61
62
62
62
62
63
63
63
63
63

14 Linear Algebra in a
14.1 Modules . . . .
Exercise 14.1.3
Exercise 14.1.4
14.2 Free Modules .
Exercise 14.2.3

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

64
64
64
64
65
65

99

Ring
. . . .
. . . .
. . . .
. . . .
. . . .

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

14.4 Diagonalizing Integer Matrices . .

Exercise 14.4.6 . . . . . . . . . .
14.5 Generators and Relations . . . .
Exercise 14.5.1 . . . . . . . . . .
14.7 Structure of Abelian Groups . . .
Exercise 14.7.7 . . . . . . . . . .
14.8 Applications to Linear Operators
Exercise 14.8.2 . . . . . . . . . .
Exercise 14.8.4 . . . . . . . . . .
14.M Miscellaneous Problems . . . . .
Exercise 14.M.10 . . . . . . . . .

66
66
66
66
67
67
67
67
68
69
69

15 Fields
15.2 Algebraic and Transcendental
Elements . . . . . . . . . . . . . .
Exercise 15.2.1 . . . . . . . . . .
Exercise 15.2.3 . . . . . . . . . .
15.3 The Degree of a Field Extension
Exercise 15.3.2 . . . . . . . . . .
Exercise 15.3.5 . . . . . . . . . .
Exercise 15.3.7 . . . . . . . . . .
Exercise 15.3.9 . . . . . . . . . .
Exercise 15.3.10 . . . . . . . . . .
15.4 Finding the Irreducible Polynomial . . . . . . . . . . . . . . . .
Exercise 15.4.1 . . . . . . . . . .
Exercise 15.4.2 . . . . . . . . . .
15.6 Adjoining Roots . . . . . . . . . .
Exercise 15.6.1 . . . . . . . . . .
15.7 Finite Fields . . . . . . . . . . . .
Exercise 15.7.4 . . . . . . . . . .
Exercise 15.7.6 . . . . . . . . . .
Exercise 15.7.7 . . . . . . . . . .
Exercise 15.7.8 . . . . . . . . . .
Exercise 15.7.10 . . . . . . . . . .
Exercise 15.7.11 . . . . . . . . . .
Exercise 15.7.13 . . . . . . . . . .
15.8 Primitive Elements . . . . . . . .
Exercise 15.8.2 . . . . . . . . . .
15.9 Function Fields . . . . . . . . . .
Exercise 15.9.1 . . . . . . . . . .
15.10 The Fundamental Theorem of
Algebra . . . . . . . . . . . . . .
Exercise 15.10.1 . . . . . . . . . .
Exercise 15.10.2 . . . . . . . . . .

70
70
70
70
71
71
71
71
72
72
72
72
72
73
73
74
74
74
75
75
75
76
76
76
76
77
77
77
77
78

15.M Miscellaneous Problems

Exercise 15.M.1 . . . . .
Exercise 15.M.2 . . . . .
Exercise 15.M.3 . . . . .
Exercise 15.M.4 . . . . .
Exercise 15.M.6 . . . . .
Exercise 15.M.7 . . . . .

.
.
.
.
.
.
.

78
78
78
78
79
80
81

16 Galois Theory
16.1 Symmetric Functions . . . . . . .
Exercise 16.1.1 . . . . . . . . . .
Exercise 16.1.3 . . . . . . . . . .
16.2 The Discriminant . . . . . . . . .
Exercise 16.2.2 . . . . . . . . . .
Exercise 16.2.4 . . . . . . . . . .
Exercise 16.2.7 . . . . . . . . . .
16.3 Splitting Fields . . . . . . . . . .
Exercise 16.3.1 . . . . . . . . . .
16.4 Isomorphisms of Field Extensions
Exercise 16.4.1 . . . . . . . . . .
16.5 Fixed Fields . . . . . . . . . . . .
Exercise 16.5.2 . . . . . . . . . .
16.6 Galois Extensions . . . . . . . . .
Exercise 16.6.1 . . . . . . . . . .
16.7 The Main Theorem . . . . . . . .
Exercise 16.7.4 . . . . . . . . . .
Exercise 16.7.6 . . . . . . . . . .
Exercise 16.7.10 . . . . . . . . . .
Exercise 16.7.11 . . . . . . . . . .
16.8 Cubic Equations . . . . . . . . .
Exercise 16.8.4 . . . . . . . . . .
16.9 Quartic Equations . . . . . . . .
Exercise 16.9.6 . . . . . . . . . .
Exercise 16.9.13 . . . . . . . . . .
Exercise 16.9.14 . . . . . . . . . .
16.10 Roots of Unity . . . . . . . . . .
Exercise 16.10.3 . . . . . . . . . .
16.11 Kummer Extensions . . . . . . .
Exercise 16.11.5 . . . . . . . . . .
16.12 Quintic Equations . . . . . . . . .
Exercise 16.12.7 . . . . . . . . . .
16.M Miscellaneous Problems . . . . .
Exercise 16.M.4 . . . . . . . . . .
Exercise 16.M.7 . . . . . . . . . .
Exercise 16.M.10 . . . . . . . . .

81
81
81
82
83
83
84
85
86
86
86
86
87
87
88
88
88
88
89
90
90
91
91
92
92
92
93
94
94
95
95
95
95
96
96
96
97

100

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.

.
.
.
.
.
.
.