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, an≠0, and g(x)=b0+…+bmxm, bm≠0. 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,g∈F[x], g≠0}

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 F≤E be fields. Evaluating a polynomial f∈F[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+x−6)=22+2−4=0, and therefore x2+x−6 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 F≤E be fields, α∈E, and f(x)=a0+a1x+…+anxn∈F[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 F≤E, 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+an−1xn−1+…+a0 and g(x)=bmxm+bm−1xm−1+…+b0 be elements of F[x] with an,bm≠0 and m≥0 (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 0∈S, 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+ct−1xt−1+…+c0ct≠0 with cj∈F

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 t≥m, 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))≤t−1<r(x).

Let s′(x)=s(x)+ctbmxt−m, 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

q1≠q2

. 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,g∈ℤ5[x] where f(x)=x4−3x3+2x2+4x−1g(x)=x2−2x+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.