0% found this document useful (0 votes)
606 views13 pages

Field Theory Notes

This document provides an introduction to field theory. It begins by defining field extensions and discussing examples such as Q(√3) and Q(ω) where ω is a cube root of unity. It then covers topics such as finite field extensions, algebraic elements, and simple extensions. It proves results like the dimension formula [L:F] = [L:K][K:F] for composite field extensions. The document also introduces finite fields and proves properties such as every element in a finite field of order pm satisfying ap=a. Overall, the document lays the groundwork for key concepts in field theory through definitions, examples, and proofs.

Uploaded by

Ashutosh Jaiswal
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
0% found this document useful (0 votes)
606 views13 pages

Field Theory Notes

This document provides an introduction to field theory. It begins by defining field extensions and discussing examples such as Q(√3) and Q(ω) where ω is a cube root of unity. It then covers topics such as finite field extensions, algebraic elements, and simple extensions. It proves results like the dimension formula [L:F] = [L:K][K:F] for composite field extensions. The document also introduces finite fields and proves properties such as every element in a finite field of order pm satisfying ap=a. Overall, the document lays the groundwork for key concepts in field theory through definitions, examples, and proofs.

Uploaded by

Ashutosh Jaiswal
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/ 13

Field Theory

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

by

Prof Shiv Datt Kumar


Department of Mathematics

Motilal Nehru National Institute of

Technology Allahabad (UP), India,

Pin-211004
E-mail: sdt@mnnit.ac.in
Shiv Datt Kumar Field Theory

2
Chapter 1

Field Theory

1.1 Field Extension

Definition 1.1.1. (Field Extension) If K is a subfield of a field L. Then we


say that L is a field extension of K, denoted by L/K. Note that L is a vector
space over K. If the dimension of L over K is finite, then this dimension is
called the degree of extension of L over K and is denoted by [L : K].

Note: (i) If K is a field of characteristic 0, then Q ⊆ K.


(ii) If K is a field of characteristic p, then Zp ⊆ K.
√ √
Example 1.1.2. 1. Q( 3) = {a + b 3|a, b ∈ Q} is a field extension of
√ √ √
Q and [Q( 3) : Q] = 2. Basis of Q( 3) over Q = {1, 3}.

2. Q(ω) = {a + b ω|a, b ∈ Q}is field extension of Q, where ω is a cube


root of unity and [Q(ω) : Q] = 2. Basis of Q(ω) = {1, ω} over Q, for
ω 3 = 1 ⇒ ω 2 + ω + 1 = 0 ⇒ ω 2 = −ω − 1.

3
Shiv Datt Kumar Field Theory

√ √ √
3. Q( 3 2) = {a + b 3 2 + c( 3 2)2 |a, b, c ∈ Q} is field extension of Q and
√ √ √ √
[Q( 3 2 : Q] = 3. Basis of Q( 3) = {1, 3 2, ( 3 2)2 } over Q.

4. If K1 and K2 are field extensions of F and [K1 : F ] and [K2 : F ] are



coprime, then K1 ∩ K2 = F . For e.g. let K1 = Q( 3 2), K2 = Q(ω),
then K1 ∩ K2 = Q and ω ∈ / K1 so [K1 (ω) : K1 ] = 2 and [K1 (ω) : Q] = 6
√ √ √ √
i.e. [Q( 3 2, ω) : Q] = 6. Thus Q( 3 2, ω) = {a1 + a2 3 2 + a3 ( 3 2)2 +
√ √
a4 ω + a5 ω 3 2 + a6 ω( 3 2)2 |ai ∈ Q} is extension of Q of degree 6.

Proposition 1.1.1. Let K be a finite field of characteristic p and [K : Zp ] = n.


Then the number of elements in K are pn , where p is a prime number.

Proof. Since K is a finite field of characteristic p. Note that p|o(K). Define


injective homomorphism Zp → K by x → x.1. Then Zp is a subfield of
K. Thus K is a finite dimensional vector space Zp . Since [K : Zp ] = n,
let B = {x1 , x2 , . . . , xn } is a basis of K over Zp . Let x ∈ K. Then x =
a1 x1 + a2 x2 + . . . + an xn , where ai ∈ Zp . Since each ai has p choices, then
o(K) = pn and K ∼
= Zp n .

Proposition 1.1.2. Let L|K and K|F be finite field extensions. Then L|F is
also a finite field extension and [L : F ] = [L : K][K : F ].

Proof. Suppose [L : K] = n, & [K : F ] = m. Let {x1 , x2 . . . xn } be a basis of


L over K and {y1 , y2 , . . . , ym } be a basis of K over F . Then S = {xi yj |1 ≤
i ≤ n, 1 ≤ j ≤ m} is a basis of L over F . Let x ∈ L. Then x = a1 x1 +
. . . + an xn , ai ∈ K and ai = m
P Pn Pm
j=1 αij yj . Thus x = i=1 ( j=1 αij yj )xi . This
P
implies L = [S]. To show S is linearly independent. Suppose αij xi yj =

4
Shiv Datt Kumar Field Theory

Pn Pm
0⇒ i=1 ( j=1 αij yj )xi = 0. Since {x1 , x2 . . . xn } is linearly independent,
Pm
j=1 αij yj = 0. Again since {y1 , y2 , . . . , ym } is linearly independent, αij = 0.

Corollary 1.1.3. Let L be a finite field extension of K and field F be a subfield


of K. Then [L : K] divides [L : F ] and also [F : K] divides [L : K].

Corollary 1.1.4. Let L be a field containing pn elements and let K be a


subfield of L. Then K contains pm elements, where m|n.

Proof. Since K is a subfield of L. Char K = char L = p. Then |K| = pm ,


for some m. Suppose [L : K] = r. Therefore L is a vector space over K i.e.
L∼
= K r . This implies pn = |L| = (pm )r ⇒ n = mr ⇒ m|n.

Definition 1.1.3. (Algebraic element) Let L be a field extension of K and


α ∈ L. If α is a root of a non-zero polynomial in K[X], then α is called
algebraic element over K.

In other words, an element a ∈ L is said to be algebraic over K if there


exist elements α0 , α1 . . . αn ∈ K such that α0 an + α1 an−1 + . . . + αn = 0.

K(α) is a subfield of L generated by K & α i.e K(α) = intersection of


all subfields of L containing K & α.

Theorem 1.1.5. Let L be a field extension of K and α ∈ L. Then α is


algebraic over K iff K[α] = K(α).

Proof. Define η : K[X] −→ K[α] by η(f (x)) = f (α). Then η is a surjective


ring homomorphism. Therefore K[X]/ker(η) ∼
= K[α]. If ker(η) = {0}, then
α is called transcendental element over K.

5
Shiv Datt Kumar Field Theory

Suppose ker(η) 6= 0. Since K[X] is PID, ker(η) is a nontrivial principle


ideal. Suppose ker(η) = hf (X)i and K[X]/hf (X)i = K[α], which is an
integral domain. Then f (X) is an irreducible element. Since ideal generated
by an irreducible element in PID is a maximal ideal. Therefore K[α] is a
field. Therefore K[α] = K(α).

Theorem 1.1.6. The element a ∈ K is algebraic element over F iff F (a) is a


finite extension of F and [F (a) : F ] = deg (minF (a)(X)).

Proof. Suppose F (a) is finite extension and [F (a) : F ] = m. Consider m + 1


elements 1, a, . . . am ∈ F (a). These elements are linearly dependent. There-
fore ∃ α0 , α1 , . . . , αm such that α0 +α1 a+. . .+αm am = 0 ⇒ a is algebraic over
F . Conversely, suppose a ∈ K is algebraic over F . Let p(x) be a polynomial
in F [x] of the smallest positive degree such that p(a) = 0. Therefore p(x) is
irreducible in F [x], for if p(x) = f (x)g(x), then 0 = p(a) = f (a)g(a). thus
f (a) = 0 or g(a) = 0 & deg(f (x)) < deg(p(x)) and deg(g(x)) < deg(p(x)).
Contradiction. Now define a map ψ : F [x] → F [a] by ψ(f (x)) = f (a).
Then ψ is a ring homomorphism. Ker(ψ) = {f (x)|f (a) = 0}. Note that
p(x) is of the smallest degree polynomial in ker(ψ). Also ψ(α) = α and
ψ(x) = a. ⇒ Image(ψ) = F [a] ⇒ F [x]/(ker(ψ)) ∼
= F [a]. Vector space dim
F [x]
( ker(ψ) ) = degree p(x) ⇒ [F (a) : F ] = degree p(x). Therefore [F (a) : F ] is
finite and [F (a) : F ] = deg(minF (a)(X)).

Definition 1.1.4. An element a ∈ K is said to algebraic of degree n over F if


it satisfies a nonzero polynomial f (x) of degree n but no non zero polynomial
of lower degree.

Theorem 1.1.7. If a ∈ K is algebraic of degree n over F , then [F (a) : F ] = n.

6
Shiv Datt Kumar Field Theory

Theorem 1.1.8. If a, b ∈ K are algebraic over F , then a+b, ab, a/b (b 6= 0) are
all algebraic over F i.e the elements in K which are algebraic over F form a
subfield of K.

Proof. Let a be algebraic of degree m over F and b is algebraic element of


degree n over F . Then subfield T = F (a) of K is of degree m over F . Now
b is algebraic of degree n over F , it is algebraic of degree at most n over T ,
which contains F . The subfield W = T (b) of K is of degree atmost n over T .
But [W : F ] = [W : T ][T : F ]. This implies W is a finite extension of F and
if a, b ∈ W , then a + b, ab, ab ∈ W . Since [W : F ] is finite, then the elements
a+b, ab, a/b are algebraic over F .

Corollary 1.1.9. If a, b in K are algebraic over F of degrees m and n respec-


tively, then a+b, ab and a/b, b 6= 0 are algebraic over F of degree atmost
mn.

Definition 1.1.5. The extension K is called an algebraic extension of F if


every element in K is algebraic over F .

Theorem 1.1.10. If L is an algebraic extension of K and K is an algebraic


extension of F , then L is an algebraic extension of F .

Proof. Let u ∈ L be an arbitrary element. Then u satisfies some polynomial


xn + δ1 xn−1 + . . . + δn , where δi ∈ K. But K is algebraic over F . Then
M = F (δ1 , δ2 . . . δn ) is a finite extension of F . Since u satisfies the polynomial
xn + δ1 xn−1 + . . . + δn , whose coefficients are algebraic over M . Therefore
M (u) is a finite extension of M . Then [M (u) : F ] = [M (u) : M ][M : F ].

7
Shiv Datt Kumar Field Theory

Hence M (u) is a finite extension of F . But this implies u is algebraic over


F.

Definition 1.1.6. An extension K of F is called simple extension if there


is an element α ∈ K such that K = F (α). Such an element α is called a
primitive element of the extension.

Example 1.1.7. (i) i is algebraic over R and [C : R] = 2. Also C is a simple


extension of R.
√ √
(ii) Q( 2) is algebraic extension of Q. Also 2 is algebraic element and

[Q( 2) : Q] = 2. Let ω be a cube root of unity i.e ω is a root of x2 +x+1 = 0.
Then [Q[ω] : Q] = 2 and ω 2 + ω + 1 = 0.

1.2 Finite Fields

Lemma 1.2.1. Let F be a finite field with q elements and suppose K is a


finite extension of the field F . Then K has q n elements, where n = [K : F ].

Corollary 1.2.2. If a finite field F has pm elements, then every a ∈ F satisfies


m
ap = a.

Proof. If a = 0, then it is trivially true. The non zero elements of F form a


m −1
group under multiplication of order pm − 1, this implies ap = 1, ∀a ∈ F ,
m
a 6= 0. Then by multiplying a both sides, we obtain ap = a.

m
Lemma 1.2.3. If a finite field F has pm elements, then the polynomial xp −x
m
in F [x] factors as xp − x = Πλ∈F (x − λ).

8
Shiv Datt Kumar Field Theory

m
Proof. The polynomial xp − x has atmost pm roots in F . Since
0 m −1
f (x) = pm xp − 1 = −1, all the roots are distinct and we conclude that
m m
xp − x = Πλ∈F (x − λ). Thus xp − x can not split in any smaller field
for that field would have to have at least pm elements. Therefore F is the
m
splitting field of xp − x.

Lemma 1.2.4. Any two finite fields having same number of elements are
isomorphic.

Proof. Let F1 and F2 be two finite fields of order pn . By previous lemma


n
xp − x = Πλ∈F1 (x − λ) = Πλ∈F2 (x − λ) splits in both fields. Also roots are
n
distinct. Thus F1 and F2 are the splitting fields of xp − x. Hence these fields
are isomorphic.

Theorem 1.2.5. For every prime number p and for every integer n, there is a
unique field having pn elements.
n
Proof. Consider the polynomial xp − x ∈ Zp [x], where Zp is a field of char p.
m
Let K be the splitting field of this polynomial. Consider F = {a ∈ K|ap =
m d n
a}. Elements of F are roots of xp − x. Since dx
(xp − x) = −1, all the roots
n
of xp − x are distinct and the field F containing all the roots is the splitting
n
field. It is sufficient to show that the set of all roots of xp − x from a field.
n n
Let a, b ∈ F be roots of this polynomial. Then ap = a & bp = b. Then
n n n n n n n
(a + b)p = ap + bp = a + b and (ab)p = ap bp = ab. If a 6= 0, (a−1 )p =
n
(ap )−1 = a−1
n
This shows that a + b, ab, a−1 are all roots of xp − x. This completes the
proof of existence of a field of order pn .

9
Shiv Datt Kumar Field Theory

Proof. Uniqueness: Let F1 and F2 be two fields of order pn . Then both are
n
splitting fields of the polynomial xp − x. Since any two finite fields having
the same number of elements are isomorphic and for every prime p. Therefore
such a field is unique up to isomorphism. Since prime fields are isomorphic
to Zp , F1 ∼
= F2 .

Lemma 1.2.6. Let G be a finite abelian group with the property that the
relation xn = e is satisfied by atmost n elements of G for every integer n.
Then G is a cyclic group.

Proof. We first suppose o(G) = pn , for some prime number p. Let a ∈ G be


such that o(a) is as large as possible. Therefore o(a) = pr , for some r. The
r −1 r
elements e, a, a2 , . . . ap give us pr distinct solution of the equation xp = e
by hypothesis these are all the solutions of this equation in G. Now if b ∈ G,
r s r−s
and o(b) = ps , where s ≤ r. Hence bp = (bp )p = e. This implies b = ai ,
for some i. Hence G is cyclic.

The general finite abelian group G is isomorphic to the direct sum of finite
cyclic groups. Then G = Sp1 Sp2 . . . Spk , where pi are distinct prime divisor
of o(G), and Spi are Sylow subgroups of G. Moreover ∀g ∈ G can be written
as g = s1 s2 . . . sk , uniquely, where si ∈ Spi . Any solution of xn = e in Spi is
one of the solution of xn = e in G so that each Spi inherits the hypothesis we
have imposed on G. Since each Spi is cyclic. Suppose Spi = hai i, for some
ai ∈ Spi .

Proof. Claim: a = a1 a2 . . . ak generates G.

10
Shiv Datt Kumar Field Theory

Let o(a) = m. To show o(G)|o(a). Since am = e = a1 m a2 m . . . am


k = e.

By the uniqueness of the representation of an element of G, as an element


of Spi , we conclude that each ai m = e. Thus o(Spi )|m, ∀i. Hence o(G) =
o(Sp1 ) . . . o(Spk )|m. Since m divides o(G), we have o(G) = m. Therefore G
is a cyclic.

Lemma 1.2.7. Let K be a finite field and K ∗ be the multiplicative group of


nonzero elements of K. Then K ∗ is a cyclic group.

Proof. Since K is a field, any polynomial of degree n in K[X] has atmost n


roots in K. Thus in particular for any integer n, the polynomial xn − 1 has
atmost n roots in G. Then by previous lemma G is cyclic.

Theorem 1.2.8. The multiplicative group of non-zero elements of a finite field


is cyclic.

1.3 Exercises

1. Consider the ring C[0, 1] with the operations of pointwise addition and-
pointwise multiplication. Give an example of an ideal in this ring which
is not a maximal ideal.

2. Compute the (multiplicative) inverse of 4x + 3 in the field Z11 [x]/(x2 +


1).

3. Prove that φ : F [x] → F [a] defined by φ(f (x)) = f (a) is a ring homo-
morphism.

11
Shiv Datt Kumar Field Theory

√ √
4. Show that 2 and 3 are algebraic over Q.

√ √
5. Find polynomial of least degree satisfied by 2+ 3.

√ √ √ √
6. What is degree of (a) 2+ 3 (ii) (b) 2 3. over Q ?

7. Describe the elements of the following fields


• K = Q( 3)

• K = Q( 5 7)

• K = Q(ω), where ω is a primitive cube root of unity.

In each of the above cases, write K = Q[x]/f (x) for an appropriate


polynomial f . What is the vector space dimension of K over Q ?.

Z
1. Show that Fp∗n ∼
=
(pn − 1)Z

2. Give an example of an algebraic extension, which is not a finite exten-


sion.

3. Let Q be the algebraic closure of Q. Then show that [Q : Q] an infinite


extension.

√ √
4. Show that (Q[ 4 5, 7]) is finite extensions of Q and find its degree of
extension.

5. Show that sin mo is an algebraic, for all rational numbers m.

Z[i]
6. Show that is a field How many elements does it have.
(2 + i)

7. Let p be an odd prime. Find the number of non-zero squares in Fp .

12
Shiv Datt Kumar Field Theory

8. Find a generator of Z∗7 , the multiplicative group of non-zero elements


of Z7 .

9. Find the number of non-zero elements in the field Zp , where p is an odd


prime number, which are squares, i.e. of the form m2 , m ∈ Zp , m 6= 0.

10. Let R = C[0, 1] be considered as a ring with the usual operations of


point wise addition and point wise multiplication. Let

I = {f : [0, 1] −→ R| f (1/2) = 0}. Then show that I is a maximal


ideal.

13

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy