SOLUTION MANUAL
For
Galois Theory 5th Edition
N
by Ian Stewart
U
R
SE
D
O
C
S
kjhgfdsa
, lkjhgfdsa
Introduction 1
Introduction
This Solutions Manual contains solutions to all of the exercises in the Fifth Edi-
tion of Galois Theory.
N
Many of the exercises have several different solutions, or can be solved using
several different methods. If your solution is different from the one presented here, it
may still be correct — unless it is the kind of question that has only one answer.
U
The written style is informal, and the main aim is to illustrate the key ideas in-
volved in answering the questions. Instructors may need to fill in additional details
where these are straightforward, or explain assumed background material. On the
whole, I have emphasised ‘bare hands’ methods whenever possible, so some of the
R
exercises may have more elegant solutions that use higher-powered methods.
SE
Ian Stewart
Coventry January 2022
D
1 Classical Algebra
1.1 Let u = x + iy ≡ (x, y), v = a + ib ≡ (a, b), w = p + iq ≡ (p, q). Then
uv = (x, y)(a, b)
O
= (xa — yb, xb + ya)
= (ax — by, bx + ay)
= (a, b)(x, y)
C
= vu
(uv)w = [(x, y)(a, b)](p, q)
S
= (xa — yb, xb + ya)(p, q)
= (xap — ybp — xbq — yaq, xaq — ybq + xbp + yap)
= (x, y)(ap — bq, aq + bp)
= (x, y)[(a, b)(p, q)]
= (uv)w
1.2 (1) Changing the signs of a, b does not affect (a/b)2, so we may assume a, b > 0.
(2) Any non-empty set of positive integers has a minimal element. Since b > 0 is
an integer, the set of possible elements b has a minimal element.
, S
C
O
D
SE
R
U
N
, (3) We know that a2 = 2b2. Then
(2b — a)2 — 2(a — b)2 = 4b2 — 4ab + a2 — 2(a2 — 2ab + b2)
= 2b2 — a2 = 0
(4) If 2b ≤ a then 4b2≤ a2 = 2b2, a contradiction. If a≤ b then 2a2≤ 2b2 = a2,
a contradiction.
(5) If a —b ≥ b then a ≥ 2b so a2 ≥ 4b2 = 2a2, a contradiction. Now (3) contra-
dicts the minimality of b.
N
Note on the Greek approach.
The ancient Greeks did not use algebra. They expressed them same underlying
idea in terms of a geometric figure, Figure 1.
U
R
SE
√
FIGURE 1: Greek proof that 2 is irrational.
D
Start with square ABCD and let CE = AB. Complete square AEFG. The rest of
the figure leads to a point H on AF. Clearly AC/AB = AF/AE. In modern notation,
let AB = b′, AC = a′. Since AB = HF = AB and BH = AC, we have AE b=a a′ + ′ b = b,
′
√ AF = a′ + 2b′ = a, say. Therefore a′ + b′ = b, b′ = a — b, and = ab′ .
say, and
O
If 2 is rational, we can make a b integers, in which case a′ b′
, √ , are also integers,
and the same process of constructing rationals equal to 2 with ever-decreasing
numerators and denominators could be carried out. The Greeks didn’t argue the proof
C
quite that way: they observed that the ‘anthyphaeresis’ of AF and AE goes on forever.
This process was their version of what we now call the continued fraction expansion
(or the Euclidean algorithm, which is equivalent). It stops after finitely many steps if
and only if the initial ratio lies in Q. See Fowler (1987) pages 33–35.
S
1.3 A nonzero rational can be written uniquely, up to order, as a produce of prime
powers (with a sign ±):
m m
r = ±p1 1 · · · pk k
where the mj are integers. So
r2 = p21m1 · · · pk2mk
For
Galois Theory 5th Edition
N
by Ian Stewart
U
R
SE
D
O
C
S
kjhgfdsa
, lkjhgfdsa
Introduction 1
Introduction
This Solutions Manual contains solutions to all of the exercises in the Fifth Edi-
tion of Galois Theory.
N
Many of the exercises have several different solutions, or can be solved using
several different methods. If your solution is different from the one presented here, it
may still be correct — unless it is the kind of question that has only one answer.
U
The written style is informal, and the main aim is to illustrate the key ideas in-
volved in answering the questions. Instructors may need to fill in additional details
where these are straightforward, or explain assumed background material. On the
whole, I have emphasised ‘bare hands’ methods whenever possible, so some of the
R
exercises may have more elegant solutions that use higher-powered methods.
SE
Ian Stewart
Coventry January 2022
D
1 Classical Algebra
1.1 Let u = x + iy ≡ (x, y), v = a + ib ≡ (a, b), w = p + iq ≡ (p, q). Then
uv = (x, y)(a, b)
O
= (xa — yb, xb + ya)
= (ax — by, bx + ay)
= (a, b)(x, y)
C
= vu
(uv)w = [(x, y)(a, b)](p, q)
S
= (xa — yb, xb + ya)(p, q)
= (xap — ybp — xbq — yaq, xaq — ybq + xbp + yap)
= (x, y)(ap — bq, aq + bp)
= (x, y)[(a, b)(p, q)]
= (uv)w
1.2 (1) Changing the signs of a, b does not affect (a/b)2, so we may assume a, b > 0.
(2) Any non-empty set of positive integers has a minimal element. Since b > 0 is
an integer, the set of possible elements b has a minimal element.
, S
C
O
D
SE
R
U
N
, (3) We know that a2 = 2b2. Then
(2b — a)2 — 2(a — b)2 = 4b2 — 4ab + a2 — 2(a2 — 2ab + b2)
= 2b2 — a2 = 0
(4) If 2b ≤ a then 4b2≤ a2 = 2b2, a contradiction. If a≤ b then 2a2≤ 2b2 = a2,
a contradiction.
(5) If a —b ≥ b then a ≥ 2b so a2 ≥ 4b2 = 2a2, a contradiction. Now (3) contra-
dicts the minimality of b.
N
Note on the Greek approach.
The ancient Greeks did not use algebra. They expressed them same underlying
idea in terms of a geometric figure, Figure 1.
U
R
SE
√
FIGURE 1: Greek proof that 2 is irrational.
D
Start with square ABCD and let CE = AB. Complete square AEFG. The rest of
the figure leads to a point H on AF. Clearly AC/AB = AF/AE. In modern notation,
let AB = b′, AC = a′. Since AB = HF = AB and BH = AC, we have AE b=a a′ + ′ b = b,
′
√ AF = a′ + 2b′ = a, say. Therefore a′ + b′ = b, b′ = a — b, and = ab′ .
say, and
O
If 2 is rational, we can make a b integers, in which case a′ b′
, √ , are also integers,
and the same process of constructing rationals equal to 2 with ever-decreasing
numerators and denominators could be carried out. The Greeks didn’t argue the proof
C
quite that way: they observed that the ‘anthyphaeresis’ of AF and AE goes on forever.
This process was their version of what we now call the continued fraction expansion
(or the Euclidean algorithm, which is equivalent). It stops after finitely many steps if
and only if the initial ratio lies in Q. See Fowler (1987) pages 33–35.
S
1.3 A nonzero rational can be written uniquely, up to order, as a produce of prime
powers (with a sign ±):
m m
r = ±p1 1 · · · pk k
where the mj are integers. So
r2 = p21m1 · · · pk2mk
