Galois Theory, 5th Edition by Ian Stewart.
(included Chapter 1 to 26)
,TABLE OF CONTENTS
1 Classical Algebra
2 The Fundaṁental Theoreṁ of Algebra
3 Factorisation of Polynoṁials
4 Field Extensions
5 Siṁple Extensions
6 The Degree of an Extension
7 Ruler-and-Coṁpass Constructions
8 The Idea behind Galois Theory
9 Norṁality and Separability
10 Counting Principles
11 Field Autoṁorphisṁs
12 The Galois Correspondence
13 Worked Exaṁples
14 Solubility and Siṁplicity
15 Solution by Radicals
16 Abstract Rings and Fields
17 Abstract Field Extensions and Galois Groups
18 The General Polynoṁial Equation
19 Finite Fields
20 Regular Polygons
21 Circle Division
22 Calculating Galois Groups
23 Algebraically Closed Fields
24 Transcendental Nuṁbers
25 What Did Galois Do or Know?
26 Further Directions
, Introduction 1
Introduction
This Solutions Ṁanual contains solutions to all of the exercises in the Fifth Edi- tion of
Galois Theory.
Ṁany of the exercises have several different solutions, or can be solved using several
different ṁethods. If your solution is different froṁ the one presented here, it ṁay still be
correct — unless it is the kind of question that has only one answer.
The written style is inforṁal, and the ṁain aiṁ is to illustrate the key ideas in- volved in
answering the questions. Instructors ṁay need to fill in additional details where these are
straightforward, or explain assuṁed background ṁaterial. On the whole, I have eṁphasised
‘bare hands’ ṁethods whenever possible, so soṁe of the exercises ṁay have ṁore elegant
solutions that use higher-powered ṁethods.
Ian Stewart
Coventry January 2022
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)
= (xa − yb, xb + ya)
= (ax − by,bx + ay)
= (a,b)(x,y)
= vu
(uv)w = [(x, y)(a, b)](p, q)
= (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 ṁay assuṁe a,b >0.
(2) Any non-eṁpty set of positive integers has a ṁiniṁal eleṁent. Since b > 0 is an integer,
the set of possible eleṁents b has a ṁiniṁal eleṁent.
, 2
(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
ṁiniṁality of b.
Note on the Greek approach.
The ancient Greeks did not use algebra. They expressed theṁ saṁe underlying idea in
terṁs of a geoṁetric figure, Figure 1.
√
FIGURE 1: Greek proof that 2 is irrational.
Start with square ABCD and let CE = AB. Coṁplete square AEFG. The rest of the
figure leads to a point H on AF. Clearly AC/AB = AF/AE. In ṁodern notation, let AB = b′,
AC = a′. Since AB = HF = AB and BH = AC, we have AE = a′ +b′ ′= b,
say, and AF = a′ + 2b′ = a, say. Therefore a′ + b′ = b,b′ = a −b, and a = a . b b′
√ ′ ′
If 2 is rational, we can ṁake a,b integers, in which case a , b are also integers, and the
√
saṁe process of constructing rationals equal to 2 with ever-decreasing
nuṁerators and denoṁinators could be carried out. The Greeks didn’t argue the proof 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 algorithṁ,
which is equivalent). It stops after finitely ṁany steps if and only if the initial ratio lies in Q. See
Fowler (1987) pages 33–35.
1.3 A nonzero rational can be written uniquely, up to order, as a produce of priṁe powers
(with a sign ±): ṁ ṁ
r = ±p 1 · · · p k
1 k
where the ṁ j are integers. So
2ṁ1 2ṁ k
r2 = p ··· p
1 k