Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Алгебра_1 / Gilbert - Modern algebra with applications.pdf
Скачиваний:
43
Добавлен:
23.02.2015
Размер:
3 Мб
Скачать
☆

9

POLYNOMIAL AND

EUCLIDEAN RINGS

Polynomial functions and the solution of polynomial equations are a basic part of mathematics. One of the important uses of ring and field theory is to extend a field to a larger field so that a given polynomial has a root. For example, the complex number field can be obtained by enlarging the real field so that all quadratic equations will have solutions.

Before we are able to extend fields, we need to investigate the ring of polynomials, F [x], with coefficients in a field F . This polynomial ring has many properties in common with the ring of integers; both F [x] and Z are integral domains, but not fields. Moreover, both rings have division and euclidean algorithms. These algorithms are extremely useful, and rings with such algorithms are called euclidean rings.

EUCLIDEAN RINGS

Long division of integers gives a method for dividing one integer by another to obtain a quotient and a remainder. The fact that this is always possible is stated formally in the division algorithm.

Theorem 9.1. Division Algorithm for Integers. is nonzero, then there exist unique integers q and

If a and b are integers and b r such that

 

a = qb + r

and 0 r < |b|.

 

 

 

Proof. If b > 0, then |b| = b, so this restates Theorem 7 in Appendix 1. If b <

0,

then −b > 0, so the same

theorem gives

a = q(−b) + r,

where

0

r < (−b). Since |b| = −b in this case, this gives

a = (−q)b + r,

where

0

r < |b|.

 

 

 

Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc.

EUCLIDEAN RINGS

181

The integer r is called the remainder in the division of a by b, and q is called the quotient.

What other rings, besides the integers, have a division algorithm? In a field, we can always divide any element exactly by a nonzero element. If a ring contains zero divisors, the cancellation property does not hold, and we cannot expect to obtain a unique quotient. This leaves integral domains, and the following kinds contain a useful generalization of the division algorithm.

An integral domain R is called a euclidean ring if for each nonzero element a R, there exists a nonnegative integer δ(a) such that:

(i)

If a and b are nonzero elements of R, then δ(a) δ(ab).

(ii)

For every pair of elements

a, b R with b = 0,

there exist elements

 

q, r R such that

 

 

 

a = qb + r where r = 0

or δ(r) < δ(b).

(division algorithm)

Theorem 9.1 shows that the ring Z of integers is a euclidean ring if we take δ(b) = |b|, the absolute value of b, for all b Z. A field is trivially a euclidean ring when δ(a) = 1 for all nonzero elements a of the field. We now show that the ring of polynomials, with coefficients in a field, is a euclidean ring when we take δ(g(x)) to be the degree of the polynomial g(x).

Theorem 9.2. Division Algorithm for Polynomials. Let f (x), g(x) be elements of the polynomial ring F [x], with coefficients in the field F. If g(x) is not the zero polynomial, there exist unique polynomials q(x), r(x) F [x] such that

f (x) = q(x) · g(x) + r(x)

where either r(x) is the zero polynomial or deg r(x) < deg g(x).

Proof. If f (x) is

the zero polynomial or deg f (x) < deg g(x), then writing

f (x) = 0 · g(x) + f

(x), we see that the requirements of the algorithm are ful-

filled.

If deg f (x) = deg g(x) = 0, then f (x) and g(x) are nonzero constant polynomials a0 and b0, respectively. Now f (x) = (a0b0−1)g(x), and the algorithm holds.

We prove the other cases by induction on the degree of f (x). Suppose that, when we divide by a fixed polynomial g(x), the division algorithm holds for

polynomials of degree less than n. Let f (x)

=

a

0 + · · · +

a xn

and

g(x)

=

b

+

· · · + bmx

m

 

 

n

 

0

 

where an = 0, bm = 0. If n < m, we have already shown that the

algorithm holds.

Suppose that n m and put

f1(x) = f (x) − anbm−1xn−mg(x)

f (x) = anbm−1xn−m
+ q1(x)} · g(x) + r(x),
g(x) + f1(x) = {anbm−1xn−m

182

9 POLYNOMIAL AND EUCLIDEAN RINGS

so that deg f1(x) < n. By the induction hypothesis

f1(x) = q1(x) · g(x) + r(x)

where either r(x) = 0 or deg r(x) < deg g(x).

Hence

which is a representation of the required form. The algorithm now follows by induction, starting with n = m − 1 if m = 0, or with n = 0 if m = 0.

The uniqueness of the quotient, g(x), and of the remainder, r(x), follows in a similar way to the uniqueness of the quotient and remainder in the division algorithm for integers (Theorem 7, Appendix 2).

The quotient and remainder polynomials can be calculated by long division of polynomials.

Example 9.3. Divide x3 + 2x2 + x + 2 by x2 + 2 in Z3[x].

Solution. Write Z3 = {0, 1, 2} for convenience.

x+ 2

x2 + 2 x3+2x2+ x+2

x3+ +2x

2x2+2x+2

2x2 +1

2x+1

Hence x3 + 2x2 + x + 2 = (x + 2)(x2 + 2) + (2x + 1).

 

If we divide by a polynomial of degree 1, the remainder must be a constant. This constant can be found as follows.

Theorem 9.4. Remainder Theorem. The remainder when the polynomial f (x) is divided by (x − α) in F [x] is f (α).

Proof. By the division algorithm, there exist q(x), r(x) F [x] with f (x) = q(x)(x − α) + r(x), where r(x) = 0 or deg r(x) < 1. The remainder is therefore a constant r0 F and f (x) = q(x)(x − α) + r0. Substituting α for x, we obtain the result f (α) = r0.

Theorem 9.5. Factor Theorem. The polynomial (x − α) is a factor of f (x) in F [x] if and only if f (α) = 0.

Proof. We can write f (x) = q(x)(x − α) for some q(x) F [x] if and only if f (x) has remainder 0 when divided by (x − α). By the remainder theorem, this happens if and only if f (α) = 0.

EUCLIDEAN RINGS

183

An element α is called a root of a polynomial f (x) if f (α) = 0. The factor theorem shows that (x − α) is a factor of f (x) if and only if α is a root of f (x).

Theorem 9.6. A polynomial of degree n over a field F has at most n roots in F .

Proof. We prove the theorem by induction on the degree n. A polynomial of degree 0 consists of only a nonzero constant and therefore has no roots.

Assume that the theorem is true for polynomials of degree n − 1 and let f (x) F [x] be a polynomial of degree n. If f (x) has no roots, the theorem holds. If f (x) does have roots, let α be one such root. By the factor theorem, we can write

f (x) = (x − α)g(x),

and by Proposition 8.22, deg g(x) = n − 1.

Since the field F has no zero divisors, f (β) = 0 if and only if (β − α) = 0 or g(β) = 0. Therefore, any root of f (x) is either equal to α or is a root of g(x). By the induction hypothesis, g(x) has, at most, n − 1 roots, so f (x) has, at most, n roots.

Example 9.7. Show that the ring of gaussian integers, Z[i] = {a + ib|a, b Z}, is a euclidean ring with δ(a + ib) = a2 + b2.

Solution. Z[i] is a subring of the complex numbers, C, and therefore is an integral domain.

If z Z[i], then δ(z) = zz, where z is the conjugate of z in the complex numbers. For any nonzero complex number z, δ(z) > 0, and for two nonzero

gaussian integers z and w, δ(z · w) = δ(z) · δ(w).

 

 

 

 

To prove

the

division algorithm

in

Z[i],

let

z and

w be

gaus-

sian

integers where

w = 0.

Then

z/w

is

a

complex

number,

c +

id,

where

c, d

 

Q

Choose

integers,

a,

b

as

in Figure 9.1 so

that

 

1

and

.

1

Then z/w

= a + ib + [(c − a) + i(d − b)] so

|c − a| 2

 

|d − b| 2 .

z = (a + ib)w + [(c − a) + i(d − b)]w.

 

Now

δ([(c − a) + i(d − b)]w) =

 

 

 

z = c + id

−1 + i

i

 

w

a + ib

 

 

 

 

−1

0

1

2

Figure 9.1. Complex numbers with the elements of Z[i] circled.