Scribd
Upload
8 views17 pages

12 Lecture 8

The document discusses various theorems and lemmas related to finite fields and Galois theory, including properties of roots of polynomials, cyclic groups, and automorphisms of fields. It establishes the relationship between finite fields, their extensions, and irreducible polynomials, as well as the concept of separable extensions. Key results include the characterization of roots, the structure of automorphism groups, and the conditions for separability in field extensions.

Uploaded by

Agus Leonardi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views17 pages

12 Lecture 8

The document discusses various theorems and lemmas related to finite fields and Galois theory, including properties of roots of polynomials, cyclic groups, and automorphisms of fields. It establishes the relationship between finite fields, their extensions, and irreducible polynomials, as well as the concept of separable extensions. Key results include the characterization of roots, the structure of automorphism groups, and the conditions for separability in field extensions.

Uploaded by

Agus Leonardi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Finite Fields

Theorem 3.25 Let F be a finite field of char p.


Then |F | = p n for some positive integer n.
For any f (x) = ni=0 ai x i ∈ F [x], by applying
P
induction argument, we easily obtain the following:
Lemma 3.26 Let f (x) ∈ F [x]. The number of
roots of f in any extension field E of F is at most
degf .
f (x) = ni=0 ai x i ∈ F [x], we define
P
For any P
f 0 (x) = ni=1 iai x i−1 .
Lemma 3.27 Let f (x) ∈ F [x] and E ⊃ F an
extension that contains a root u of f (x). u is a
double root (i.e. (x − u)2 |f (x)) if and only if
f 0 (u) = 0.
Remark Note that for Lemma 3.26 and Lemma
3.27, we don’t assume |F | is finite.
Theorem 3.28 Let F be a finite field. Then
(F ∗ , ×) is a cyclic group.
Theorem 3.29 Let p be a prime number and F̄p an
algebraic closure of Fp . Then every finite subfield of
F̄p has cardinality p n for some positive integer n.
Conversely, for every positive integer n there is
exactly one subfield of F̄p having cardinality p n ; this
subfield consists of the zeros of the polynomial
n
x p − x and it has degree n over Fp .
n
Notation, we define Fpn = {x ∈ F̄p : x p − x = 0}.
Note that Fpn is the unique subfield of F̄p that
contains exactly p n elements.

Corollary 3.30 Let F be a finite field. For every


positive integer n, there is an irreducible polynomial
in F [x] of degree n.

Theorem 3.31 Fpn ⊂ Fpm if and only if n|m.


Chapter 4: Galois Theory

Definition 4.1 Let E be an algebraic extension of a


field F . Two elements u, v ∈ E are conjugate over
F if fFu = fFv .
√ √
Example. (1) 2 and − 2 are conjugates over Q.
(2) For any real numbers a, b, a + ib and a − ib are
conjugates over R.
Theorem 4.2 Let u, v ∈ E be algebraic over F .
Let Ψu,v : F (u) → F (v ) be defined by
X X
Ψu,v ( ai u i ) = ai v i .
Ψu,v is an homomorphism iff Ψu,v is an isomorphism
if and only if u, v are conjugate over F .
Corollary 4.3 Let u be an algebraic over a field F .
Then the number of F -homomorphism from F (u)
to F̄ is equal to the number of conjugates of u. In
fact, for any conjugate v of u in F̄ (an algebraic
closure of F ), there is a F -homomorphisms from
F (u) to F̄ mapping u to v .
Definition 4.4 An isomorphism of a field onto itself
is an automorphism of the field.
Definition 4.5 Let σ be an automorphism of a field
E . An element u ∈ E is said to be fixed under σ if
σ(u) = u.
Theorem 4.6 Let A be a set of automorphisms of
a field E . Then

{u ∈ E : σ(u) = u, ∀σ ∈ A}

is a subfield.
The field fixed by the set of automorphisms A is
called the fixed field√of A in E .
Example. (1) In√Q[ 2], we √ define an automorphism
σ with σ(a + b 2) = a − b 2 for all a, b ∈ Q. The
fixed field of σ is Q.
(2) In Fpr , consider the automorphism
σp : Fpr → Fpr such that σp (x) = x p for all x ∈ Fpr .
The fixed field of σp is Fp and σp is called the
Frobenious automorphism.
Theorem 4.7 Aut(E ), the set of all automorphisms
of a field E is a group under composition.

Notation Suppose F is a subfield of E . An


automorphism σ of E is called an F -automorphism
if σ fixes F , i.e. σ(x) = x for all x ∈ F .
Lemma 4.8 Let AutF (E ) be the set of
F -automorphism of E , then AutF (E ) is a subgroup
of Aut(E ).
Theorem 4.9 Let F ⊂ E be a finite extension.
Suppose σ : F → K is an isomorphism and K is an
algebraic closure of K . There exists a number
{E : F } (i.e. depends only on F and E ) such that
there are exactly {E : F } field homomorphisms from
E to K that extend σ.
In above, if we set K = F , σ = identity and K = F .
Then {E : F } is the number of F -homomorphism
from E to F where F is an algebraic closure of F .
Note that {E : F } does not depend on the choice of
F̄ . So, very often, we may as well assume F ⊃ E .
[If we do not assume [E : F ] is finite, then it still
makes sense to define {E : F } as the number of
F -homomorphisms from E to F̄ . It is possible then
{E : F } be finite or infinite.)
Corollary 4.10 Suppose F ⊂ E ⊂ K and K is a
finite extension. Then {K : F } = {K : E }{E : F }.

Theorem 4.11 Let f (x) be irreducible in F [x].


Then all zeros of f (x) in F have the same
multiplicity. (Here, F is an algebraic closure of F .)
Corollary 4.12 Let f (x) be irreducible in F [x].
There exist u1 , . . . , ur in F̄ and a positive integer f
such that in F̄ [x],
Y
f (x) = a (x − ui )f .
i

Actually, f is 1 or a p-power where p = charF .


Theorem 4.13 Suppose F ⊂ E finite. Then
{E : F } divides [E : F ].
Definition 4.14 A finite extension E of F is a
separable extension if {E : F } = [E : F ]. (From
now on, we write {E : F } = [E : F ]s .) An element
u in E is said to be separable over F if F (u) is
separable over F .

Example 1. F is a separable extension over F . In


particular, every√element in F is separable over F .
Example 2. Q[ 2] is separable over Q.
Theorem 4.15 Suppose u ∈ E ⊃ F and u is
algebraic over F . Then u is separable over F if and
only if all roots of fFu in an algebraic closure of F is
of multiplicity 1.

Definition 4.16 A polynomial f (x) ∈ F [x] is said


to be separable if f (x) does not have multiple roots
(i.e. a root with multiplicity more than 1).

Example. x 3 − 2 is separable over Q but it is not


separable over F3 .
Theorem 4.17 Suppose F ⊂ E ⊂ K is finite. K is
separable over F if and only if K is separable over E
and E is separable over F .

Corollary 4.18 Suppose E is a finite extension over


F . Then the following statements are equivalent:
(i) Every element in E is separable over F .
(ii) There exist u1 , . . . , ur ∈ E that are separable
over F and E = F (u1 , . . . , ur ).
(iii) E is separable over F .
Corollary 4.19 Let K be an algebraic (not
necessary finite) extension of F . Then
Ks = {x ∈ K : x is separable over F } is a subfield.

In above, Ks is called the separable closure of F in


K.

You might also like