MATH 415 Lecture 19

From Notes
Jump to navigation Jump to search

« previous | Thursday, October 31, 2013 | next »


Review

Let R be a ring. We construct a ring of polynomials in one indeterminate R[x] with coefficients in R.

Exerise 24

If R is an integral domain, then R[x] is also an integral domain.

Take f(x),g(x)R[x] with f(x)=a0++anxn, an0, and g(x)=b0++bmxm, bm0. Thus f is of degree n and g is of degree m.

The product (fg)(x) is of degree m+n: (fg)(x)=a0b0+(a1b0+a0b1)x++anbmxm+n. The last coefficient anbn cannot be 0 since R is an integral domain (i.e. it has no zero divisors).


Field of Quotients

The field of quotients of F[x], denoted

F(x)={f(x)g(x)f,gF[x], g0}

is a field of rational functions.

Note that in general, although F is a field, F[x] is a ring (In particular, an integral domain)


Evaluation Homomorphism

Let FE be fields. Evaluating a polynomial fF[x] at value αE (denoted ϕα(f)) is a homomorphism from the ring F[x] to field E.

Examples

Let F=, E=, and α=0. Then ϕ0:[x] always has form ϕ0(a0+a1x++anxn)=a0, which must be rational.

Therefore evaluation homomorphism may not be onto.


Now let α=2. Then ϕ2:[x] takes form ϕ2(a0+a1x++anxn)=a0+2a1++2nan.

Note in particular that ϕ2(x2+x6)=22+24=0, and therefore x2+x6 is a member of the kernel of ϕ2.


Now let E= and α=i, so ϕi:[x]. Thus ϕi(a0+a1x++anxn)=a0+a1i++anin. Note that in{±i,±1}. Also note that ϕi(x2+1)=0, so i2+1 is in the kernel of ϕi.


However, ϕπ:[x] is an isomorphism because π is a transendental number (it is not a root of any polynomial with rational coefficients), hence the kernel of ϕπ is just {0}. Therefore ϕπ must be an isomorphism from [x] onto .


How to Plug Values into a Function

Definition 22.10.

Let FE be fields, αE, and f(x)=a0+a1x++anxnF[x]. If we have ϕα:F[x]E, we define

f(α)=ϕα(f(x))=a0+a1α++anαn


Section 23: Factorization of Polynomials over a Field

Let FE, f(x)F[x] such that f(x)=g(x)h(x) for g(x),h(x)F[x]. For αE, we have

f(α)=ϕα(f(x))=ϕα(g(x)h(x))=ϕα(g(x))ϕα(h(x))=g(α)h(α)

Hence f(α)=0 if and only if g(α)=0 or h(α)=0.

This factorization only makes sense when the degree of g(x) and h(x) is greater than 1. Hence we are concerned with nontrivial factorizations.

Theorem 23.1: Division in F[x]

Let F be a field that forms the polynomial ring F[x]. Let f(x)=anxn+an1xn1++a0 and g(x)=bmxm+bm1xm1++b0 be elements of F[x] with an,bm0 and m0 (so g(x) is not constant).

Then there are unique polynomials q(x) and r(x) in F[x] such that f(x)=g(x)q(x)+r(x) where either r(x)=0 or the degree of r(x) is less than the degree m of g(x).

Proof. Consider S={f(x)g(x)s(x)s(x)F[x]}. If 0S, then there exists s(x)F[x] such that f(x)g(x)s(x)=0 Therefore f(x)=g(x)s(x)+0, hence r(x)=0.

Otherwise, let r(x)S be of minimal degree [1]. Then

r(x)=ctxt+ct1xt1++c0ct0 with cjF

If t<m, then we're done: f(x)g(x)s(x)=r(x), so f(x)=g(x)s(x)+r(x) with deg(s(x))<m. In the more interesting case, if tm, then

Failed to parse (unknown function "\begin{align}"): {\displaystyle \begin{align} f(x) - s(x) \, g(x) - \left( \frac{c_t}{b_m} \right) x^{t-m} \, g(x) &= r(x) - \left( \frac{c}{b_m} \right) x^{t-m} \, g(x) \\ &= r(x) - (c_t \, x^t + \mbox{terms of lower degree}) \\ &= \cancel{c_t\,x^t + \dots - \cancel{c_t\,x^t} - \mbox{terms of lower degree}) \\ \end{align}}

Thus deg(r(x))t1<r(x).

Let s(x)=s(x)+ctbmxtm, then f(x)s(x)g(x) is of lesser degree than r(x) — contradiction.

This proves the existence of r(x). All that remains is to prove uniqueness.

Assume

f(x)=g(x)q1(x)+r1(x)=g(x)q2(x)+r2(x)

with

deg(r1),deg(r2)<m

and

q1q2

. Then the product

g(x)(q1(x)q2(x))=r1(x)r2(x)

has LHS degree

m

and RHS degree

<m

— contradiction.

quod erat demonstrandum


Factoring Examples

Let f,g5[x] where f(x)=x43x3+2x2+4x1g(x)=x22x+3

Find the quotient q(x) and remainder r(x):

File:MATH 415 Factoring Example.jpg

Footnotes

  1. There must be a minimum since the degree of any polynomial is a positive integer. Hence r(x) of minimal degree must exist.