FIELD THEORY

MATH 552

Contents

1. Algebraic Extensions 1
1.1. Finite and Algebraic Extensions 1
1.2. Algebraic Closure 5
1.3. Splitting Fields 7
1.4. Separable Extensions 8
1.5. Inseparable Extensions 10
1.6. Finite Fields 13
2. Galois Theory 14
2.1. Galois Extensions 14
2.2. Examples and Applications 17
2.3. Roots of Unity 20
2.4. Linear Independence of Characters 23
2.5. Norm and Trace 24
2.6. Cyclic Extensions 25
2.7. Solvable and Radical Extensions 26
Index 28

1. Algebraic Extensions

1.1. Finite and Algebraic Extensions.

Definition 1.1.1. Let 1F be the multiplicative unity of the field F .

(1) If ni=1 1F 6= 0 for any positive integer n, we say that F has characteristic 0.
P

(2) Otherwise, if p is the smallest positive integer such that pi=1 1F = 0, then F
P

has characteristic p. (In this case, p is necessarily prime.)

(3) We denote the characteristic of the field by char(F ).
1
2 MATH 552

(4) The prime field of F is the smallest subfield of F . (Thus, if char(F ) = p > 0,
def
then the prime field of F is Fp = Z/pZ (the filed with p elements) and if
char(F ) = 0, then the prime field of F is Q.)
(5) If F and K are fields with F ⊆ K, we say that K is an extension of F and
we write K/F . F is called the base field .
def
(6) The degree of K/F , denoted by [K : F ] = dimF K, i.e., the dimension of K
as a vector space over F . We say that K/F is a finite extension (resp., infinite
extension) if the degree is finite (resp., infinite).
(7) α is algebraic over F if there exists a polynomial f ∈ F [X] − {0} such that
f (α) = 0.

Definition 1.1.2. If F is a field, then

 
def f (α)
F (α) = : f, g ∈ F [X] and g(α) 6= 0 ,
g(α)
is the smallest extension of F containing α. (Hence α is algebraic over F if, and only
if, F [α] = F (α).)
In the same way,
 
def f (α1 , . . . , αn )
F (α1 , . . . , αn ) = : f, g ∈ F [X1 , . . . , Xn ] and g(α1 , . . . , αn ) 6= 0
g(α1 , . . . , αn )
= F (α1 , . . . , αn−1 )(αn )

is the smallest extension of F containing {α1 , . . . , αn }.

Definition 1.1.3. If K/F is a finite extension and K = F [α], then α is called a

primitive element of K/F .

Proposition 1.1.4. For any f ∈ F [X] − {0} there exists an extension K/F such
def
that f has a root in K. (E.g., K = F [X]/(g), where g is an irreducible factor of f .)

def
Theorem 1.1.5. If p(X) ∈ F [X] is irreducible of degree n, K = F [X]/(p(X))
and θ is the class of X in K, then θ is a root of p(X) in K, [K : F ] = n and
{1, θ, θ2 , . . . , θn−1 } is an F -basis of K.
 FIELD THEORY 3

Remark 1.1.6. Observe that F [θ] (polynomials over F evaluated at θ), where θ is
a root of an irreducible polynomial p(X), is then a field. Observe that 1/θ can be
obtained with the extended Euclidean algorithm: if d(X) is the gcd(X, p(X)) and
d(X) = a(X) · X + b(X) · p(X), the 1/θ = a(θ).

Definition 1.1.7. If α is algebraic over F , then there is a unique monic irreducible

over F that has α as a root, called the irreducible polynomial (or minimal polynomial )
of α over F , and we shall denote it minα,F (X). [Note: (minα,F (X)) = ker φ, where
φ : F [X] → F [α] is the evaluation map.]

Corollary 1.1.8. If α is algebraic over F , then F (α) = F [α] ∼

= F [x]/(minα,F ), and
[F [α] : F ] = deg minα,F .

Proposition 1.1.9. If K is a finite extension of F and α is algebraic over K, then

α is algebraic over F and minα,K (X) | minα,F (X).

Definition 1.1.10. Let φ : R → S be a ring homomorphism. If f (X) = an X n +· · ·+

def
a1 X + a0 , then f φ = φ(an )X n + · · · + φ(a1 )X + φ(a0 ) ∈ S[X]. [Note that f 7→ f φ is
a ring homomorphism.]

Theorem 1.1.11. Let φ : F → F 0 be an isomorphism, and f ∈ F [X] be an irreducible

polynomial. If α is a root of f in some extension of F and α0 is a root of f φ in
some extension of F 0 , then there exists an isomorphism Φ : F [α] → F 0 [α0 ] such that
Φ(α) = α0 and Φ|F = φ.

Definition 1.1.12. K/F is an algebraic extension if every α ∈ K is algebraic over

F.

Proposition 1.1.13. If [K : F ] < ∞, then K/F is algebraic.

def
Remark 1.1.14. The converse is false. E.g., Q̄ = {α ∈ C : α is algebraic over Q} is
an infinite algebraic extension of Q.
4 MATH 552

Proposition 1.1.15. If L is a finite extension K and K is a finite extension of F ,

then
[L : F ] = [L : K] · [K : F ].
Moreover, if {α1 , . . . , αn } is an F -basis of K and {β1 , . . . , βm } is a K-basis of L, then
{αi · βj : i ∈ {1, . . . , n} and j ∈ {1, . . . , m}} is an F -basis of L.

Definition 1.1.16. {α1 , . . . , αn } generates K/F if K = F (α1 , . . . , αn ) and K/F is

finitely generated . (Not necessarily algebraic!)

Proposition 1.1.17. [K : F ] < ∞ if, and only if, K is finitely generated over F by
algebraic elements.

Corollary 1.1.18. Let K/F be an arbitrary extension, then

def
E = {α ∈ K : α is a algebraic over F } ,

is a subfield of K containing F .

Definition 1.1.19. If F and K are fields contained in the field F, then the composite
(or compositum) of F and K is the smallest subfield of F containing F and K, and
is denoted by F K.

Proposition 1.1.20. (1) In general, we have:

 
α1 β1 + · · · + αm βm
FK= : αi , γi ∈ F ; βj , δj ∈ K; γ1 δ1 + · · · + γn δn 6= 0
γ1 δ1 + · · · + γn δn
(2) If K1 /F and K2 /F are finite extensions, with K1 = F [α1 , . . . , αm ] and K2 =
F [β1 , . . . , βn ], then K1 K2 = F [α1 , . . . , αm , β1 , . . . , βn ], and [K1 K2 : F ] ≤
[K1 : F ] · [K2 : F ].

Definition 1.1.21. Let C be a class of field extensions. We say that C is distinguished

if the following three conditions are satisfied:
(1) Let F ⊆ K ⊆ L. Then, L/F is in C if, and only if, L/K and K/F are in C.
 FIELD THEORY 5

(2) If K1 and K2 are extensions of F , both contained in F, then if K1 /F is in C,

then K1 K2 /K2 is also in C.
(3) If K1 and K2 are extensions of F , both contained in F, then if K1 /F and
K2 /F are in C, then K1 K2 /F is also in C. [Note that this follows from the
previous two.]

Definition 1.1.22. Let C be a class of field extensions. We say that C is quasi-

distinguished if the following three conditions are satisfied:
(10 ) Let F ⊆ K ⊆ L. Then, if L/F is in C then L/K in C.
(2) Same as (2) of distinguished.
(3) Same as (3) of distinguished.

Remark 1.1.23. The above definition is not standard.

Proposition 1.1.24. The classes of algebraic extensions and finite extensions are
distinguished.

1.2. Algebraic Closure.

Definition 1.2.1. Let K and L be extensions of F .

(1) An embedding (i.e., an injective homomorphism) φ : K → L is over F if
φ|F = idF .
(2) If E/K and ψ : E → L is also an embedding, we say that ψ is over φ, or is
an extension of φ, if ψ|K = φ.

Remark 1.2.2. Remember that if φ : F → F 0 is field homomorphism, then φ is either

injective or φ ≡ 0.

Definition 1.2.3. An algebraic closure of F is an algebraic extension K in which

any polynomial in F [X] splits [i.e., can be written as a product of linear factors] in
K[X]. We say that F is algebraically closed if it is an algebraic closure of itself.
6 MATH 552

Lemma 1.2.4. Let K/F be algebraic. If φ : K → K is an embedding over F , then

φ is an automorphism.

Lemma 1.2.5. Let F and K be subfields of F and φ : F → L be an embedding into

some field L. Then φ(F K) = φ(F ) φ(K).

Theorem 1.2.6. (1) For any field F , there exists an algebraic closure of F .
(2) An algebraic closure of F is algebraically closed.

Definition 1.2.7. If n
X
f (X) = ai X i ∈ F [X],
i=0
then the formal derivative of f is
n
X
0
f (X) = i ai X i−1 .
i=0

Remark 1.2.8. The same formulas from calculus still hold (product rule, chain rule,
etc.).

Lemma 1.2.9. Let f ∈ F [X] and α a root of f . Then α is a multiple root if, and
only if, f 0 (α) = 0.

def
Lemma 1.2.10. Let φ : F → F 0 be an embedding, c, a1 , . . . , ak ∈ F , and f =
c(X − a1 ) · · · (X − ak ) ∈ F [X]. Then, f φ (X) = φ(c)(X − φ(a1 )) · · · (X − φ(ak )).

Theorem 1.2.11. Let f ∈ F [X] be an irreducible polynomial. If f splits in K as

f = c(X − α1 )n1 · · · (X − αk )nk , with the αi ’s distinct, then n1 = · · · = nk . [So, f
is a n1 -th power of a polynomial with simple roots.] Moreover, if K 0 is any other
field where f splits, and n is the common exponent above [e.g, n = n1 ], we must have
f = c(X − α10 )n · · · (X − αk0 )n in K 0 [X]. [I.e., the number of distinct roots k and the
exponent n are the same.]
 FIELD THEORY 7

Corollary 1.2.12. If f ∈ F [x] is irreducible and char(F ) = 0 [or f 0 6= 0], then f has
only simple roots [in any extension of F ].

Theorem 1.2.13. (1) If φ : F → K is an embedding of F , K is algebraically

closed and α is algebraic over F , then the number of extensions of φ to F [α]
is equal to the number of distinct roots of minα,F (X).
(2) If K/F is an algebraic extension, φ : F → L, with L algebraically closed,
then there exists an extension ψ : K → L of φ. Moreover, if K is also alge-
braically closed and L/φ(F ) is algebraic, then ψ is an isomorphism. [Hence
the algebraic closure of a field is unique up to isomorphism, and we denote the
algebraic closure of F by F̄ .]
(3) If K/F is an algebraic extension and K̄ is an algebraic closure of K, then it
is also an algebraic closure of F . Conversely, if F̄ is an algebraic closure of
F and K 0 is the image of the embedding of K into F̄ , then F̄ is an algebraic
closure of K 0 .

1.3. Splitting Fields.

Definition 1.3.1. K is a splitting field of f ∈ F [X] if f (X) splits in K, but not

in any proper subfield of K. In particular if f splits in an extension of F as f =
c(X − α1 ) · · · (X − αn ), then F [α1 , . . . , αn ] is a splitting field of f .

Theorem 1.3.2. If K1 /F and K2 /F are two splitting fields of f ∈ F [X] [or of

the same families of polynomials] in different algebraic closure [so that they are dis-
tinct], then there exists an isomorphism between K1 and K2 over F [induced by the
isomorphism of the algebraic closures].

Remark 1.3.3. If F̄ is an algebraic closure of F and α1 , . . . , αn ∈ F̄ are all the roots

of f (X), then the splitting field of F is F [α1 , . . . , αn ].

Definition 1.3.4. K is normal extension of F is it is algebraic over F and any

embedding φ : K → K̄ = F̄ over F is an automorphism of K.
8 MATH 552

Theorem 1.3.5. Let F ⊆ K ⊆ F̄ . The following are equivalent:

(1) K is normal.
(2) K is a splitting field of a family of polynomials.
(3) Every polynomials in F [X] that has a root in K, splits in K[X].

Theorem 1.3.6. The class of normal extensions is quasi-distinguished [but not dis-
tinguished]. Also, if K1 /F and K2 /F are normal, then so is K1 ∩ K2 /F .

Proposition 1.3.7. If [K : F ] = 2, then K/F is normal.

√ √ √ √
Remark 1.3.8. (1) Q( 2)/Q and Q( 4 2)/Q( 2) are normal extensions, but Q( 4 2)/Q
is not normal.
√ √ √
(2) Q(ζ3 , 3 2)/Q, where ζ3 = e2πi/3 , is normal, and Q ⊆ Q( 3 2) ⊆ Q(ζ3 , 3 2), but
√
Q( 3 2)/Q is not normal.

1.4. Separable Extensions.

Lemma 1.4.1. Let σ : F → L and τ : F → L0 be embeddings of F into algebraically

closed fields, and let K/F be an algebraic extension. Then, the number [or cardinality]
of extensions of σ to K is the same as the number of extensions of τ to K.

Definition 1.4.2. (1) Let K/F be a finite extension and F̄ be an algebraic clo-
sure of F . Then, the separable degree of K/F is
def
[K : F ]s = number of embeddings φ : K → F̄ over F.

(2) A polynomial f ∈ F [X] is a separable polynomial if it has no multiple roots.

(3) Let α be algebraic over F . Then α is separable over F if minα,F (X) is sepa-
rable.
(4) K/F is a separable extension if every element of K is separable over F .

Remark 1.4.3. If φ : F → L is embedding of F and L is algebraic closed, then

[K : F ]s = number of extensions ψ : K → L of φ.
 FIELD THEORY 9

Theorem 1.4.4. If L/K and K/F are algebraic extensions, then

[L : F ]s = [L : K]s · [K : F ]s .

Moreover, if [L : F ] < ∞, then

[L : F ]s ≤ [L : F ],

and K/F is separable if, and only if, [L : F ]s = [L : F ].

Theorem 1.4.5. If K = F [{αi : i ∈ I}], where I is a set of indices and αi is

separable over F for all i ∈ I, then K/F is separable.

Theorem 1.4.6. The class of separable extensions is distinguished.

Proposition 1.4.7. Let K be a finite extension of F inside F̄ . Then the smallest

def
extension of K which is normal over F is L = φ1 (K) . . . φn (K), where {φ1 , . . . , φn }
are all the embeddings of K into F̄ over F . (The φi (K)’s are called the conjugates
of K.) Moreover, if K/F is separable, then L is also separable over F .

Definition 1.4.8. (1) The field L in the proposition above is called the normal
closure of K/F .
(2) Let
def
F s = compositum of all separable extensions of F.
F s is called the separable closure of all F .
(3) If K = F [α], then K is said to be a simple extension of F .

Theorem 1.4.9 (Primitive Element Theorem). If [F : F ] < ∞, then K/F has a

primitive element if, and only if, there are finitely many intermediate fields (i.e.,
fields L such that F ⊆ L ⊆ K). Moreover, if K/F is (finite and) separable, then
K/F has a primitive element.

Lemma 1.4.10. If f ∈ F [X] is irreducible, then f has distinct roots if, and only if,
f 0 (X) is a non-zero polynomial.
10 MATH 552

Proposition 1.4.11. (1) α is separable over F if, and only if, (minα,F )0 6≡ 0.
(2) If char(F ) = 0, then any extension of F is separable.
(3) Let char(F ) = p > 0. Then α is inseparable over F if, and only if, minα,F ∈
F [X p ]. (And thus, minα,F is a p-power in F̄ [X].)

1.5. Inseparable Extensions.

Definition 1.5.1. An algebraic extension K/F is inseparable if it is not separable.

(Note that if K/F is inseparable, then char(F ) = p > 0.)

k
Proposition 1.5.2. If F [α]/F is finite and inseparable, then minα,F (X) = f (X p ),
where p = char(F ) [necessarily positive], for some positive integer k and separable
and irreducible polynomial f ∈ F [X]. Moreover, [F [α] : F ]s = deg f , [F [α] : F ] =
k
pk · deg f , and αp is separable over F .

Corollary 1.5.3. If K/F is finite, then [K : F ]s | [K : F ]. If char(F ) = 0, then the

quotient is 1, and if char(F ) = p > 0, then the quotient is a power of p.

Definition 1.5.4. Let K/F be a finite algebraic extension. The inseparable degree
of K/F is
def [K : F ]
[K : F ]i = .
[K : F ]s

Proposition 1.5.5. Let K/F be a finite algebraic extension. Then:

(1) K/F is separable if, and only if, [K : F ]i = 1;
(2) if E is an intermediate field, then [K : F ]i = [K : E]i · [E : F ]i .

Definition 1.5.6. (1) Let α be algebraic over F , with char(F ) = p. We say that
n
α is purely inseparable over F if αp ∈ F for some positive integer n. [Thus,
n n n
minα,F | X p − αp = (X − α)p .]
(2) An algebraic [maybe infinite] extension K/F is a purely inseparable extension
if [K : F ]s = 1.
 FIELD THEORY 11

Proposition 1.5.7. An element α is purely inseparable if, and only if, minα,F (X) =
n n
X p − a for some positive integer n and a ∈ F . [Observe that a = αp .]

Proposition 1.5.8. Let K/F be an algebraic extension. The following are equivalent:
(1) K/F is purely inseparable [i.e., [K : F ]s = 1].
(2) All elements of K are purely inseparable over F .
(3) K = F [αi : i ∈ I], for some set of indices I, with αi purely inseparable over
F.

Proposition 1.5.9. The class of purely inseparable extensions is distinguished.

Definition 1.5.10. (1) Let F be a field and G be a subgroup of Aut(F ). Then:

def
F G = {α ∈ F : φ(α) = α, ∀φ ∈ G},

is the fixed field of G. (Note: it is a field.)

(2) The extension K/F is a Galois extension if it is normal and separable. In
this case, the Galois group of K/F , denoted by Gal(K/F ) is the group of
automorphisms of K over F [i.e., automorphisms of K which fix F ].

Remark 1.5.11. If K/F is Galois, then Gal(K/F ) is equal to the set of embeddings
of K into K̄. Also, if K/F is finite, then K/F is Galois if, and only if, |AutF (K)| =
[K : F ], and so |Gal(K/F )| = [K : F ].

Remark 1.5.12. Note that for any field extension K/F we have a group of automor-
phisms over F , which we denote by AutF (K). But, usually, the notation Gal(K/F )
is reserved for Galois extensions only. [A few authors do use Gal(K/F ) for AutF (K),
though.]

Proposition 1.5.13. Let K/F be an algebraic extension. Then

def
K 0 = {x ∈ K : x is separable over F }

is a field [equal to the compositum of all separable extensions of F that are contained
in K]. [So, it is clearly the maximal separable extension of F contained in K.] Then,
K 0 /F is separable and K/K 0 is purely inseparable.
12 MATH 552

Corollary 1.5.14. (1) K/F is separable and purely inseparable, then K = F .

(2) If α is separable and purely inseparable over F , then α ∈ F .

Corollary 1.5.15. If K/F is normal, then the maximal separable extension of F

contained in K [i.e., the K 0 in the proposition above] is normal over F . [Hence,
K 0 /F is Galois.]

Corollary 1.5.16. If F/E and K/E are finite, with F, K ⊆ F, with F/E separable
and K/E purely inseparable, then

[F K : K] = [F : E] = [F K : E]s ,
[F K : F ] = [K : E] = [F K : E]i .

Definition 1.5.17. Let F be a field [or a ring] of characteristic p, with p prime. The
Frobenius morphism of F is the map
σ:F → F
x 7→ xp .

Corollary 1.5.18. Let K/F be a finite extension in characteristic p > 0 and σ be

the Frobenius.
(1) If K σ F = K, then K/F is separable, where

K σ = σ(K) = {σ(x) : x ∈ K}.

n
(2) If K/F is separable, then K σ F = K for any positive integer n.

n n n
Remark 1.5.19. (1) If K = F [α1 , . . . , αm ], then K σ F = F [α1p , . . . , αm
p
].
(2) Notice that if K/F is an algebraic extension, we can always have an interme-
diate field K 0 such that K 0 /F is separable and K/K 0 is purely inseparable, but
not always we can have a K 00 such that K 00 /F is purely inseparable and K/K 00
is separable. [For example, take F = Fp (s, t), with p > 2, and K = F [α],
where α is a root of X p − β and β is a root of X 2 − s X + t.]
The next proposition states that if K/F is normal, then there is such a K 00 .
 FIELD THEORY 13

def
Proposition 1.5.20. Let K/F be normal and G = AutF (K) [where AutF (K) is the
set of automorphisms of K over F ] and K G be the fixed field of G [as in Definition
1.5.10]. Then K G /F is purely inseparable and K/K G is separable. [Hence, K/K G is
Galois.]
Moreover, if K 0 is the maximal separable extension of F contained in K, then
K = K 0 K G and K 0 ∩ K G = F .

Definition 1.5.21. A field F is a perfect field if either char(F ) = 0 or char(F ) =

p > 0 and the Frobenius σ : F → F is onto [or equivalently, every element of F has a
p-th root]. [Note that σ is always injective, so σ is, in in this case, an automorphism
of F .]

Proposition 1.5.22. Every algebraic extension of a perfect field F is both perfect

and separable over F .

1.6. Finite Fields.

Theorem 1.6.1. If F is a field with q [finite] elements, then:

(1) char(F ) = p > 0 and so Fp ⊆ F ;
(2) q = pn for some positive integer n;
(3) F is the splitting field of X q − X (over Fp );
(4) any other field with q elements is isomorphic to F , and in a fixed algebraic
closure of Fp , there exists only one field with q elements, usually denoted by
Fq ;
(5) there exists ξ ∈ F , such that F × = hξi;
(6) for any positive integer r, there is a unique field with pr elements in a fixed
algebraic closure F̄p of Fp , which is the unique extension of Fp of degree r in
F̄p .

Proposition 1.6.2. Any algebraic extension of a finite field Galois [i.e., it is both
normal and separable].
14 MATH 552

Proposition 1.6.3. The set of automorphisms of Fpr is {id, σ, σ 2 , . . . , σ r−1 }, where

σ is the Frobenius map. [Note that these are all automorphisms, and they are auto-
morphisms over Fp .]

Proposition 1.6.4. Fps is an extension of Fpr if, and only if, r | s. In this case,
the set of embeddings of Fps into F̄p over Fpr [or equivalently, since normal, the set
of automorphisms of Fps over Fpr ] is {id, σ r , σ 2r , . . . , σ s−r }, where σ is the Frobenius
map. [In other words, Gal(Fps /Fpr ) = hσ r i.]

[
Proposition 1.6.5. The algebraic closure F̄p is Fpr . [Note that any finite union
r>0
is contained in a single finite field.]

2. Galois Theory

2.1. Galois Extensions.

Proposition 2.1.1. Galois extensions form a quasi-distinguished class, and if K1 /F

and K2 /F are Galois, then so is K1 ∩ K2 /F .

def
Theorem 2.1.2. Let K/F be a Galois extension and G = Gal(K/F ). Then
(1) K G = F ;
(2) if E is an intermediate field (F ⊆ E ⊆ K), then K/E is also Galois;
(3) the map E 7→ Gal(K/E) is injective.

def
Corollary 2.1.3. Let K/F be a Galois extension and G = Gal(K/F ). If Ei is an
def
intermediate field and Hi = Gal(K/Ei ), for i = 1, 2, then:
(1) H1 ∩ H2 = Gal(K/E1 E2 );
(2) if H = hH1 , H2 i [i.e., H is the smallest subgroup of G containing H1 and H2 ],
then K H = E1 ∩ E2 .

Corollary 2.1.4. Let K/F be separable and finite, and L be the normal closure of
K/F [i.e., the smallest normal extension of F containing K]. Then L/F is finite and
Galois.
 FIELD THEORY 15

Lemma 2.1.5. Let K/F be a separable extension such that for all α ∈ K, [F [α] :
F ] ≤ n, for some fixed n. Then [K : F ] ≤ n.

Theorem 2.1.6 (Artin). Let K be a field, G be a subgroup of Aut(K) with |G| =

def
n < ∞, and F = K G . Then K/F is Galois and G = Gal(K/F ) (and [K : F ] = n).

def
Corollary 2.1.7. Let K/F be Galois and finite and G = Gal(K/F ). Then, for any
subgroup H of G, H = Gal(K/K H ).

Remark 2.1.8. The above corollary is not true if the extension is infinite! The map
H 7→ K H is not injective! For example, F̄p /Fp is Galois, the cyclic group H generated
by the Frobenius is not the Galois group, and yet K H = Fp .

Lemma 2.1.9. Let K1 and K2 be two extensions of F with φ : K1 → K2 an isomor-

phism over F . Then AutF (K2 ) = φ ◦ AutF (K1 ) ◦ φ−1 .

def
Theorem 2.1.10. Let K/F be a Galois extension and G = Gal(K/F ). If E is
an intermediate extension, then E/F is normal [and thus Galois] if, and only if,
def
H = Gal(K/E) is a normal subgroup of G. In this case, φ 7→ φ|E induces an
isomorphism between G/H and Gal(E/F ).

Definition 2.1.11. An extension K/F is an Abelian extension (resp., a cyclic exten-

sion) if it is Galois and Gal(K/F ) is Abelian (resp., cyclic).

Corollary 2.1.12. If K/F is Abelian (resp., cyclic), then for any intermediate field
E, K/E and E/F are Abelian (resp., cyclic).

Theorem 2.1.13 (Fundamental Theorem of Galois Theory). Let K/F be finite and
def
Galois, with G = Gal(K/F ). The results above gives: the map
{subgroups of G} −→ {intermediate fields of K/F }
H 7−→ K H
16 MATH 552

is a bijection with inverse

{intermediate fields of K/F } −→ {subgroups of G}
E 7−→ Gal(K/E).
def
Moreover an intermediate field E is Galois if, and only if, H = Gal(K/E) is normal
in G, and Gal(E/F ) ∼
= G/H, induced by φ 7→ φ| . E

Remark 2.1.14. Note that the maps H 7→ K H and E 7→ Gal(K/E) are inclusion
reversing, i.e., H1 ≤ H2 implies K H1 ⊇ K H2 , and if E1 ⊆ E2 , then Gal(K/E1 ) ≥
Gal(K/E2 ).

Theorem 2.1.15 (Natural Irrationalities). Let K/F be a Galois extension and L/F
be an arbitrary extension, with K, L ⊆ F [so that we can consider the compositum
def
L K]. Then K L is Galois over L and K is Galois over K ∩ L. Moreover, if G =
def
Gal(K/F ) and H = Gal(K L/L), then for any φ ∈ H, φ|K ∈ G and φ 7→ φ|K is an
isomorphism between H and Gal(K/K ∩ L).

Corollary 2.1.16. If K/F is finite and Galois and L/F is an arbitrary extension,
then [K L : L] | [K : F ].

Remark 2.1.17. The above theorem does not hold for if K/F is not Galois. For
def def √ def √
example, F = Q, K = Q( 3 2) and L = Q(ζ3 3 2), where ζ3 = e2πi/3 .

Theorem 2.1.18. Let K1 /F and K2 /F be Galois extensions with K1 , K2 ∈ F. Then

def def def
K1 K2 /F is Galois. Moreover, if G = Gal(K1 K2 /F ), G1 = Gal(K1 /F ), G2 =
Gal(K2 /F ) and
Φ : G → G1 × G2
φ 7→ (φ|K1 , φ|K2 ),

then Φ is injective and if K1 ∩ K2 = F , then Φ is an isomorphism.

def
Corollary 2.1.19. If Ki /F is Galois and Gi = Gal(Ki /F ) for i = 1, . . . , n and
Ki+1 ∩ (K1 . . . Ki ) = F for i = 1, . . . , (n − 1), then Gal(K1 . . . Kn /F ) = G1 × · · · × Gn .
 FIELD THEORY 17

def
Corollary 2.1.20. Let K/F be finite and Galois, with G = Gal(K/F ) = G1 × · · · ×
def def
Gn , Hi = G1 × · · · × Gi−1 × 1 × Gi+1 × · · · × Gn and Ki = K Hi . Then Ki /F is Galois
with Gal(Ki /F ) ∼
= Gi , Ki+1 ∩ (K1 . . . Ki ) = F and K = K1 . . . Kn .

Corollary 2.1.21. Abelian extensions are quasi-distinguished [see Definition 1.1.22].

Moreover, if K is an Abelian extension of F and E is an intermediate field, then E/F
is also Abelian. [Hence, intersections of Abelian extensions are also Abelian.]

Remark 2.1.22. Observe that, as with Galois extensions [and Abelian extensions are
Galois by definition], we do not always have that if K/E and E/F are Abelian, then
√ √ √
K/F is Abelian. For example, Q( 4 2)/Q( 2) and Q( 2)/Q are Abelian (since they
√
are degree two extensions), but Q( 4 2)/Q is not even Galois [since X 4 − 2 does not
√
split in Q( 4 2)].

2.2. Examples and Applications.

Definition 2.2.1. The Galois group of a separable polynomial f ∈ F [X] is the Galois
group of the splitting field of f over F . We will denote it by Gf or Gf,F .

Proposition 2.2.2. (1) Let f ∈ F [X] be a [not necessarily separable or irre-

ducible] polynomial, K be its splitting field, and n be the number of distinct
def
roots of f [in K]. Then, G = AutF (K) is a subgroup of the symmetric group
Sn , seen as permutations of the roots of f . [In particular, any σ ∈ G is deter-
mined by its values on the roots of f , and hence, if σ ∈ G fixes all roots of f ,
then σ = idK .]
(2) If f ∈ F [X] is irreducible [but not necessarily separable] and K, n, and G are
as above, then G is a transitive subgroup of Sn [i.e., for all i, j ∈ {1, . . . , n},
there is σ ∈ G such that σ(i) = j.]
def
(3) Let K/F be Galois [and hence separable] with G = Gal(K/F ), α ∈ K,
def
O = {σ(α) : σ ∈ G}

be the orbit of α by the action of G in K. Then, O is finite, say, O =

{α1 , . . . , αk }, and

minα,F = (x − α1 ) · · · (x − αk ).
18 MATH 552

Note that |O| | [K : F ] = |G|.

def
(4) Let K/F be finite and Galois with G = Gal(K/F ), and let α ∈ K. Then,
K = F [α] if, and only if, the orbit of α by G has exactly [K : F ] elements.

Proposition 2.2.3 (Quadratic Extensions).

(1) If char(F ) 6= 2 and [K : F ] = 2, then there exists an a ∈ F such that
K = F [α], with minα,F = X 2 − a. Also, Gal(K/F ) ∼ = Z/2Z and the non-
identity element is such that φ(α) = −α.
(2) If f ∈ F [X] is a quadratic separable polynomial, then the splitting field of F
has degree two over F , Gf ∼
= Z/2Z and the non-zero element of Gf is takes a
root of f to the other root.

Definition 2.2.4. Let f ∈ F [X], such that

n
Y
f (X) = (X − αi ).
i=1

Then the discriminant of f is defined as

def
Y
∆f = ∆ = (αi − αj )2 .
i<j

Proposition 2.2.5. For any f ∈ F [X], ∆f ∈ F . In particular if f = aX 2 + bX + c,

then ∆f = b2 − 4ac and if f = X 3 + aX + b, then ∆f = −4a3 − 27b2 .

Proposition 2.2.6 (Cubic Extensions and Polynomials).

(1) If [K : F ] = 3, then for any α ∈ K − F , we have K = F [α].
(2) If char(F ) 6= 3 and f ∈ F [X] is irreducible of degree 3, say f (X) = X 3 +
aX 2 + bX + c, then the splitting field of f is the same as the splitting field of
def
the polynomial f˜(X) = f (X − a/3) = X 3 + ãX + b̃. [Hence Gf = Gf˜.]
(3) If the splitting field of a separable f ∈ F [X] is of degree 3, then Gf ∼= Z/3Z
and if α1 , α2 , α3 are the [distinct] roots of f , then Gf = hφi, where φ(α1 ) = α2
and φ(α2 ) = α3 and φ(α3 ) = α1 . Note that in this case, Gf ∼ = A3 , where An
is the alternating subgroup of Sn [i.e., the subgroup of even permutations].
 FIELD THEORY 19

(4) If the splitting field of a separable f ∈ F [X] is not of degree 3, then Gf ∼

= S3
[and hence Gf can permute the roots of f in all possible ways].
(5) Let f = 3i=1 (X − αi ) ∈ F [X] and
Q

def
δ = (α1 − α2 )(α1 − α3 )(α2 − α3 ).

[Thus, δ 2 = ∆f .] If f is irreducible in F [X], ∆f 6= 0 [i.e., f is separable] and

char(F ) 6= 2, then Gf ∼ = S3 if, and only if, δ 6∈ F [or equivalently, ∆f is not
a square in F .] [Note that if δ 6∈ F , then F [δ]/F is a degree two extension
contained in the splitting field of f .]

Examples 2.2.7. From the above, we can deduce:

def
(1) If f = X 3 − X + 1 ∈ Q[X], then ∆f = −23, and hence Gf = S3 .
def
(2) If f = X 3 − 3X + 1 ∈ Q[X], then ∆f = 81, and hence Gf = Z/3Z.

Example 2.2.8. If f = X 4 − 2 ∈ Q[X], then Gf ∼ = D8 , the dihedral group of 8

√ √ √
elements. More precisely, if φ ∈ Gal(Q[ 4 2, i]/Q[i]) such that φ( 4 2) = 4 2 i and
√ √
ψ ∈ Gal(Q[ 4 2, i]/Q[ 4 2]) such that ψ(i) = −i [i.e., ψ is the complex conjugation],
then

Gf = φ, ψ : φ4 = id, ψ 2 = id, ψ ◦ φ = φ3 ◦ ψ



= id, φ, φ2 , φ3 , ψ, φ ◦ ψ, φ2 ◦ ψ, φ3 ◦ ψ .


Proposition 2.2.9. Let E be a field, t1 , . . . , tn be algebraically independent variables

def
over E, s1 , . . . , sn be their elementary symmetric functions, F = E(s1 , . . . , sn ) and
K = E(t1 , . . . , tn ). Then minti ,F = ni=1 (X − ti ) and Gal(K/F ) ∼
def Q
= Sn .

Theorem 2.2.10 (Fundamental Theorem of Algebra). C is the algebraic closure of

R.

Lemma 2.2.11. If G ⊆ Sp , with p prime, and G contains a transposition and a

p-cycle, then G = Sp .
20 MATH 552

Proposition 2.2.12. If f ∈ Q[X] is irreducible, deg f = p, with p prime, and if f

has exactly two complex roots, then Gf ∼
= Sp .

def
Example 2.2.13. As an application of the proposition above, let f = X 5 − 4X + 2 ∈
Q[X]. Then Gf ∼ = S5 . In fact, one can use the above proposition to prove that for
every prime p there is a polynomial fp ∈ Q[X] such that Gfp ,Q = Sp . [One can get all
Sn , in fact, but it is harder.]

Theorem 2.2.14. Let f ∈ Z[X] be a monic separable polynomial, p be a prime that

does not divide the discriminant of f , and f¯ ∈ Z/pZ[X] be the reduction modulo p of
f [i.e., obtained by reducing the coefficients]. Then, there is a bijection between the
roots of f and the roots of f¯, denoted by α 7→ ᾱ, and an injection i : Gf¯ → Gf , such
that, if φ ∈ Gf¯ and ᾱi and ᾱj are roots of f¯, with φ(ᾱi ) = ᾱj , then i(φ)(αi ) = αj .
In particular, if φ ∈ Gf¯, then Gf has an element [namely i(φ)] that has the same
cycle structure [seen as a permutation] as φ itself. [E.g., if φ as a permutation is a
product of a two-cycle, a 4-cycle and a 7-cycle [all disjoint], then i(φ) is also a product
of a two-cycle, a 4-cycle and a 7-cycle [all disjoint] in Gf .]

def
Example 2.2.15. As an application of the theorem above, one can prove that f =
X 5 − X − 1 ∈ Z[X] is such that Gf = S5 , by reducing f modulo 5 and modulo 2.

2.3. Roots of Unity.

Definition 2.3.1.
(1) A n-th root of unity in a field F is a root of X n − 1 in F . A root of unity
[with no n specified] is a root of unit for some n.
(2) The set of all roots of unity form an Abelian group, denoted by µ(F ) or simply
µ.
(3) The set of n-th roots of unity in F is a cyclic group denoted by µn (F ) or
simply µn .
(4) If char(F ) - n, then |µn | = n and a generator of µn is called a primitive n-th
root of unity.
 FIELD THEORY 21

Proposition 2.3.2. (1) If char(F ) = p > 0, n = pr m, and p - m, then µn (F ) =

µm (F ) [and so |µn (F )| = m].
(2) If gcd(n, m) = 1, then µn × µm ∼
= µn · µm = µn m and the isomorphism is
given by (ζ, ζ 0 ) 7→ ζ ζ 0 . [In particular, if ζn and ζm are primitive n-th and
m-th roots of unity, then ζn ζm is a primitive nm-th root of unity.]

Proposition 2.3.3. Let F be a field such that char(F ) - n, and ζn a primitive n-th
i(φ)
root of unity. Then F [ζn ]/F is Galois. If φ ∈ Gal(F [ζn ]/F ), then φ(ζn ) = ζn , for
some i(φ) ∈ (Z/nZ)× and this map i : Gal(F [ζn ]/F ) → (Z/nZ)× is injective. Thus,
Gal(F [ζn ]/F ) is Abelian.

Remark 2.3.4. Note that Gal(F [ζn ]/F ) is not necessarily cyclic. For example, Gal(Q[ζ8 ]/Q) ∼
=
(Z/2Z) × (Z/2Z).

Definition 2.3.5. We say that K/F is a cyclotomic extension if there exists a root
of unity ζ over F such that K = F [ζ]. [Careful : in Lang, an extension is cyclotomic
if there exists a root of unity ζ over F such that K ⊆ F [ζ]!]

Definition 2.3.6. Let ϕ : Z → Z denote the Euler phi-function, which is defined as

def
ϕ(n) = |{m ∈ Z : 0 < m < n and gcd(m, n) = 1}| .

Theorem 2.3.7. If ζn is a primitive n-th root of unity in Q, then [Q[ζn ] : Q] = ϕ(n)

and the map i : Gal(F [ζn ]/F ) → (Z/nZ)× [as in Proposition 2.3.3] is an isomorphism.

Corollary 2.3.8. If ζm and ζn are a primitive m-th root of unity and primitive n-th
root of unity, respectively, with gcd(m, n) = 1,then Q[ζm ] ∩ Q[ζn ] = Q,

Remark 2.3.9. If m = lcm(n1 , . . . , nr ), and ζni is a primitive ni -th root of unity for
i = 1, . . . , r, then Q[ζn1 ] · · · Q[ζnr ] = Q[ζm ].
22 MATH 552

Definition 2.3.10. Let n be a positive integer not divisible by char(F ). The poly-
nomial
def
Y
Φn (X) = (X − ζ)
ζ prim. n-th
root of 1 in F
is called the n-th cyclotomic polynomial [over F ].

Proposition 2.3.11.
(1) deg Φn = ϕ(n).
(2) If ζn is a primitive n-th root of unity, then Φn (X) = minζn ,Q (X).
(3) If ζn is a primitive n-th root of unity, then
Y
Φn (X) = (X − φ(ζn ))
φ∈Gal(Q[ζn ]/Q)
Y
(4) X n − 1 = Φd (X).
d|n

(5) If char(F ) = 0, then Φn ∈ Z[X] for all n. If char(F ) = p > 0, then Φn ∈ Fp [X]
for all n [not divisible by p].

Proposition 2.3.12.
(1) If p is prime, then Φp (X) = X p−1 + X p−2 + · · · + X + 1.
r−1
(2) If p is prime, then Φpr (X) = Φp (X p ).
r1 −1
···prss −1
(3) If n = pr11 · · · prss , with pi ’s distinct primes, then Φn (X) = Φp1 ···ps (X p1 ).
(4) If n > 1 is odd, then Φ2n (X) = Φn (−X).
Φn (X p )
(5) If p - n, with p an odd prime, then Φp n (X) = .
Φn (X)
(6) If p | n, with p prime, then Φp n (X) = Φn (X p ).

Remark 2.3.13. It is not true that for all n, the coefficients of Φn (X) are either 0, 1
or −1. The first n for which this fails is 105 = 3 · 5 · 7.

Theorem 2.3.14 (Dirichlet’s Theorem of Primes in Arithmetic Progression). If

gcd(a, r) = 1, there are infinitely many primes in the arithmetic progression

a, a + r, a + 2r, a + 3r, . . . .
 FIELD THEORY 23

Theorem 2.3.15. Given a finite Abelian group G, there exists an extension F/Q
such that Gal(F/Q) = G.

Theorem 2.3.16 (Kronecker-Weber). If F/Q is finite and Abelian, then there exists
a cyclotomic extension Q[ζ]/Q such that F ⊆ Q[ζ].

2.4. Linear Independence of Characters.

Definition 2.4.1. Let G be a monoid [i.e., a “group” which might not have inverses]
and F be a field. A character of G in F is a homomorphism χ : G → F × . The trivial
character is the map constant equal to 1.
Let fi : G → F for i = 1, . . . , n. We say that the fi ’s are linearly independent if

α1 f1 + . . . αn fn = 0, αi ∈ F,

then αi = 0 for all i.

Remarks 2.4.2. (1) If K/F is a field extension and {φ1 , . . . , φn } are the embedding
of K over F , then we can think of φ|K × as characters of K × in K.
(2) If one says only a character in G (without mention of the field), one usually
means a character from G in C× or even in
def
S 1 = {ζ ∈ C : |α| = 1}.

Theorem 2.4.3 (Artin). If χ1 , . . . , χn distinct characters of G in F , then they are

linearly independent.

Corollary 2.4.4. Let α1 , . . . , αn be distinct elements of a field F × . If a1 , . . . , an ∈ F

such that for all positive integer r we have

a1 α1r + · · · + an αnr = 0,

then ai = 0 for all i.

Corollary 2.4.5. For any extension K/F , the set EmbK/F is linearly independent
over K.
24 MATH 552

2.5. Norm and Trace.

Definition 2.5.1. Let K/F be a finite extension, with [K : F ]s = r and [K : F ]i = pµ .

[So, char(F ) = p or [K : F ]i = 1.] Let EmbK/F = {φ1 , . . . , φn } and α ∈ K:
(1) The norm of α from K to F is
n n
![K:F ]i
def pµ
Y Y
NK/F (α) = φ(α ) = φi (α) .
i=1 i=1

(2) The trace of α from K to F is

n
def
X
TrK/F (α) = [K : F ]i · φi (α).
i=1

Remark 2.5.2. Note that if K/F is inseparable, then TrK/F (α) = 0.

Lemma 2.5.3.
(1) Let K/F be a finite extension, and EmbK/F = {φ1 , . . . , φn } be the set of
embeddings of K over F . If L/K is an algebraic extension and ψ : L → F̄ is
an embedding over F , then

{ψ ◦ φ1 , . . . , ψ ◦ φn } = EmbK/F .

(2) Let F ⊆ K ⊆ L be field extensions. Let

EmbK/F = {φ1 , . . . φr },

and
EmbL/K = {ψ1 , . . . ψs }.
If φ̃i : F̄ → F̄ is an extension of φi to F̄ (which exists since F̄ /F is algebraic),
then

EmbL/F = {φ̃i ◦ ψj : i ∈ {1, . . . , r} and j ∈ {1, . . . , s}}.

(3) Let K/F be a separable extension. If α ∈ K is such that φ(α) = α for all
embeddings φ ∈ EmbK/F , then α ∈ F .

Theorem 2.5.4. Let L/F be a finite extension.

(1) For all α ∈ K, NK/F (α), TrK/F (α) ∈ F .
 FIELD THEORY 25

(2) If [K : F ] = n and α ∈ F , NK/F (α) = αn and TrK/F (α) = n · α.


(3) NK/F K × : K × → F × is a [multiplicative] group homomorphism and TrK/F :
K → F is an [additive] group homomorphism.
(4) If K is an intermediate field, then

NL/F = NK/F ◦ NL/K ,

TrL/F = NK/F ◦ TrL/K .

(5) If L = F (α), where min, α,F (X) = X n + an−1 X n−1 + · · · + a1 X + a0 , then

NL/F (α) = (−1)n a0 , TrL/F (α) = −an−1 .

Corollary 2.5.5. If F ⊆ F (α) ⊆ K, with [K : F ] = n, min, α,F (X) = X d +

ad−1 X d−1 + · · · + a1 X + a0 , and [L : F (α)] = e, then

NL/F (α) = (−1)n ae0 , TrL/F (α) = (−ad−1 )e .

Remark 2.5.6. TrK/F : K → F is an F -linear map.

2.6. Cyclic Extensions.

Theorem 2.6.1 (Hilbert’s Theorem 90 – multiplicative form). Let K/F be a cyclic

extension of degree n and Gal(K/F ) = hσi. Then, β ∈ K is such that NK/F (β) = 1
if, and only if, there exists α ∈ K × such that β = α/σ(α).

Theorem 2.6.2. Let F be a field such that F contains a primitive n-th root of unity
for some fixed n not divisible by char(F ).
(1) If K/F is cyclic of degree n, then K = F [α] where α is a root of X n − a, for
some a ∈ F . [In particular, minα,F = X n − a.]
(2) Conversely, if a ∈ F and α is a root of X n − a, then F [α]/F is cyclic, its
degree, say d, is a divisor of n, and αd ∈ F .

Remark 2.6.3. Note that, by linear independence of characters, if K/F is separable,

then TrK/F is not constant equal to zero.
26 MATH 552

Theorem 2.6.4 (Hilbert’s Theorem 90 – additive form). Let K/F be a cyclic exten-
sion of degree n and Gal(K/F ) = hσi. Then, β ∈ K is such that TrK/F (β) = 0 if,
and only if, there exists α ∈ K × such that β = α − σ(α).

Theorem 2.6.5 (Artin-Schreier). Let F be a field of characteristic p > 0.

(1) If K/F is cyclic of degree p, then K = F [α] where α is a root of X p − X − a,
for some a ∈ F . [In particular, minα,F = X p − X − a.]
def
(2) Conversely, if a ∈ F and f = X p − X − a, then either f splits completely in
F or is irreducible over F . In the latter case, if α is a root of f , then F [α]/F
is cyclic of degree p.

2.7. Solvable and Radical Extensions.

Definition 2.7.1. A finite extension K/F is a solvable extension if it is separable

and the normal closure L of K/F [which is then finite Galois over F ] is such that
Gal(L/F ) is a solvable group.

Remark 2.7.2. Note that for a finite separable extension K/F to be solvable, it suffices
that there exists some finite Galois extension of F containing K with its Galois group
solvable.

Proposition 2.7.3. The class of solvable extensions is distinguished.

Definition 2.7.4. (1) A finite extension K/F is a repeated radical extension if

there is a tower:

F = F0 ⊆ F1 ⊆ F2 ⊆ · · · ⊆ Fr = K,

such that Fi = Fi−1 [αi ], where αi is either a root of a polynomial X n − a,

for some a ∈ Fi−1 and with char(F ) - n, or a root of X p − X − a, for some
a ∈ Fi−1 , where p = char(F ). [Note that αi might then be a root of unity.]
(2) A finite extension K/F is a radical extension if there is L ⊇ K such that L/F
is repeated radical.
 FIELD THEORY 27

Remark 2.7.5. Note that, by definition, if K is the splitting field of a separable

polynomial f ∈ F [X], then the roots of f are given by radicals [i.e., f is solvable by
radicals] if, and only if, K is radical.

Proposition 2.7.6. The class of radical extensions is distinguished.

Theorem 2.7.7. Let K/F be separable. Then, K/F is solvable if, and only if, it is
radical.

Remark 2.7.8. This allows us to determine when a polynomial can be solved by

radicals simply by looking at its Galois group!

Theorem 2.7.9. For n = 2, 3, 4 [and char(F ) 6= 2, 3] there are formulas for solving
[general] polynomial equations of degree n by means of radicals. For n ≥ 5, there
aren’t.

Theorem 2.7.10. Suppose that f ∈ Q[X] is irreducible and splits completely in R.

If any root of f lies in a real repeated radical extension of Q, then deg f = 2r for
some non-negative integer r.

Remark 2.7.11. Note that the above theorem tells us that we cannot replace radical
by repeated radical in trying to express all roots of a polynomials in terms of radicals.
For example, the polynomial f = X 3 − 4X + 2 splits completely in R and is solvable.
So, we can write its roots in terms of radicals [since its radical], but we must have
complex numbers to write them in terms of radicals [since is not repeated radical by
the theorem above]. More precisely, if
s√ √
def 3 111 def 3 1
α= − 1, and ζ3 = i− ,
9 2 2
then the [all real] roots of f are
4 4 4
α+ , α ζ3 + , α ζ32 + .
3α 3α ζ3 3α ζ32
[We cannot rewrite the above roots only using radicals of real numbers!]
 Index
Abelian extension, 15 Galois group of a separable polynomial, 17
algebraic, 2 generates, 4
algebraic closure, 5
algebraic extension, 3 Hilbert’s Theorem 90 – additive form, 26
algebraically closed, 5 Hilbert’s Theorem 90 – multiplicative form,
Artin-Schreier Theorem, 26 25

base field, 2 infinite extension, 2

inseparable, 10
character, 23 intermediate fields, 9
characteristic 0, 1 irreducible polynomial, 3
characteristic p, 1
composite, 4 Kronecker-Weber Theorem, 23

compositum, 4
linearly independent, 23
conjugates, 9
cyclic extension, 15 minimal polynomial, 3
cyclotomic extension, 21 monoid, 23
cyclotomic polynomial, 22
Natural Irrationalities, 16
degree, 2 norm, 24
Dirichlet’s Theorem of Primes in Arithmetic normal closure, 9
Progression, 22 normal extension, 7
discriminant, 18
distinguished, 4 orbit, 17
over, 5
embedding, 5
Euler phi-function, 21 perfect field, 13
extension, 2, 5 prime field, 2
primitive n-th root of unity, 20
finite extension, 2 primitive element, 2
finitely generated, 4 Primitive Element Theorem, 9
fixed field, 11 purely inseparable, 10
formal derivative, 6 purely inseparable extension, 10
Frobenius morphism, 12
Fundamental Theorem of Algebra, 19 quasi-distinguished, 5
Fundamental Theorem of Galois Theory, 15
radical extension, 26
Galois extension, 11 repeated radical extension, 26
Galois group, 11 root of unity, 20
28
 FIELD THEORY 29

separable, 8
separable closure, 9
separable degree, 8
separable extension, 8
separable polynomial, 8
simple extension, 9
solvable by radicals, 27
solvable extension, 26
splits, 5
splitting field, 7

trace, 24
transitive subgroup, 17
trivial character, 23