Chapter-1

Prabal Paul
Department of Mathematics
BITS Goa, Goa
1
st
September 2014
Polynomial ring
Denition
Let R be an arbitrary ring. A polynomial over R is an expression
of the form
f (x) =
n

i =0
a
i
x
i
= a
0
+ a
1
x + a
2
x
2
+ + a
n
x
n
where n is a non-negative integer, the coecient a
i
, 0 i n,
are elements of R and the symbol x does not belong to R, called
an indeterminate over R.
Prabal Paul Rings and elds theory
Polynomial ring
Remark
For two polynomial
f (x) = a
0
+ a
1
x + + a
n
x
n
, g(x) =

m
i =0
b
i
x
i
, without loss of
generality, we can assume that m = n. Then the sum is dened by
f (x) + g(x) = (a
0
+ b
0
) + (a
1
+ b
1
)x + + (a
m
+ b
m
)x
m
.
Prabal Paul Rings and elds theory
Polynomial ring
Remark
For two polynomial
f (x) = a
0
+ a
1
x + + a
n
x
n
, g(x) =

m
i =0
b
i
x
i
, The product is
dened by
f (x)g(x) =
n+m

i =0
c
i
x
i
where c
i
=

k
1
+k
2
=i ,0k
1
n,0k
2
m
a
k
1
b
k
2
.
Please look into the board for some examples.
Prabal Paul Rings and elds theory
Polynomial ring
Denition
The ring formed by the polynomials over R with the above
operations is called the polynomial ring over R and is denoted by
R[x].
Denition
Let R be a ring. Let f (x) = a
0
+ a
1
x + + a
n
x
n
be a polynomial
with a
n
= 0 in R. Then a
n
is called the leading coecient and n
is called the degree of the polynomial. The degree of the zero
polynomials is dened to be .
Denition
Let R be a ring. A polynomial f in R[x] is called monic if the
leading co-ecient of f is 1.
Prabal Paul Rings and elds theory
Polynomial ring
Denition
The ring formed by the polynomials over R with the above
operations is called the polynomial ring over R and is denoted by
R[x].
Denition
Let R be a ring. Let f (x) = a
0
+ a
1
x + + a
n
x
n
be a polynomial
with a
n
= 0 in R. Then a
n
is called the leading coecient and n
is called the degree of the polynomial. The degree of the zero
polynomials is dened to be .
Denition
Let R be a ring. A polynomial f in R[x] is called monic if the
leading co-ecient of f is 1.
Prabal Paul Rings and elds theory
Polynomial ring
Denition
The ring formed by the polynomials over R with the above
operations is called the polynomial ring over R and is denoted by
R[x].
Denition
Let R be a ring. Let f (x) = a
0
+ a
1
x + + a
n
x
n
be a polynomial
with a
n
= 0 in R. Then a
n
is called the leading coecient and n
is called the degree of the polynomial. The degree of the zero
polynomials is dened to be .
Denition
Let R be a ring. A polynomial f in R[x] is called monic if the
leading co-ecient of f is 1.
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (division algorithm, theorem 1.52)
Let g(= 0) R[x] be a polynomial in F (where F is a eld). Then
for any f in F[x], there exists q(x), r (x) F[x] with
deg(r (x)) < deg(g(x)) such that f (x) = q(x)g(x) + r (x).
Please look into the board for some examples.
Self studies: theorem 1.54 (F[x] is a principal ideal domain).
Self studies: theorem 1.55 (Euclidian algorithm for F[x]).
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (division algorithm, theorem 1.52)
Let g(= 0) R[x] be a polynomial in F (where F is a eld). Then
for any f in F[x], there exists q(x), r (x) F[x] with
deg(r (x)) < deg(g(x)) such that f (x) = q(x)g(x) + r (x).
Please look into the board for some examples.
Self studies: theorem 1.54 (F[x] is a principal ideal domain).
Self studies: theorem 1.55 (Euclidian algorithm for F[x]).
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (division algorithm, theorem 1.52)
Let g(= 0) R[x] be a polynomial in F (where F is a eld). Then
for any f in F[x], there exists q(x), r (x) F[x] with
deg(r (x)) < deg(g(x)) such that f (x) = q(x)g(x) + r (x).
Please look into the board for some examples.
Self studies: theorem 1.54 (F[x] is a principal ideal domain).
Self studies: theorem 1.55 (Euclidian algorithm for F[x]).
Prabal Paul Rings and elds theory
Polynomial ring
Denition
A polynomial p F[x] (where F is a eld) is said to be
irreducible over F if p has positive degree and p = bc with
b, c F[x] implies that either b or C is a constant polynomial.
Self studies: lemma 1.58 (irreducible and prime elements are same
in F[x]).
Prabal Paul Rings and elds theory
Polynomial ring
Denition
A polynomial p F[x] (where F is a eld) is said to be
irreducible over F if p has positive degree and p = bc with
b, c F[x] implies that either b or C is a constant polynomial.
Self studies: lemma 1.58 (irreducible and prime elements are same
in F[x]).
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (1.59, Unique factorization)
Any polynomial f F[x] (where F is a eld) of positive degree can
be written in the form
f = ap
e
1
1
p
e
2
2
p
e
k
k
where a F and p
1
, , p
k
are distinct monic irreducible
polynomials in F[x] and e
1
, , e
k
are positive integers. Moreover,
this factorization is unique apart from the order in which the
factors occur.
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (1.61)
For f F[x], the residue class ring F[x]/(f ) is a eld if and only if
f is irreducible over F.
Self studies: Example 1.62.
Please look into the board for some examples.
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (1.61)
For f F[x], the residue class ring F[x]/(f ) is a eld if and only if
f is irreducible over F.
Self studies: Example 1.62.
Please look into the board for some examples.
Prabal Paul Rings and elds theory
Polynomial ring
Theorem (1.61)
For f F[x], the residue class ring F[x]/(f ) is a eld if and only if
f is irreducible over F.
Self studies: Example 1.62.
Please look into the board for some examples.
Prabal Paul Rings and elds theory
Field extensions
Denition
A eld containing no proper subelds is called a prime eld.
Theorem (1.78)
The prime subeld of a eld F is isomorphic to either F
p
or Q
according as the characteristic of F is a prime p or 0.
Self studies: Theorem 1.69.
Prabal Paul Rings and elds theory
Field extensions
Denition
A eld containing no proper subelds is called a prime eld.
Theorem (1.78)
The prime subeld of a eld F is isomorphic to either F
p
or Q
according as the characteristic of F is a prime p or 0.
Self studies: Theorem 1.69.
Prabal Paul Rings and elds theory
Thank you
Prabal Paul Rings and elds theory