MATH 415 Lecture 19
« previous | Thursday, October 31, 2013 | next »
Review
Let be a ring. We construct a ring of polynomials in one indeterminate with coefficients in .
Exerise 24
If is an integral domain, then is also an integral domain.
Take with , , and , . Thus is of degree and is of degree .
The product is of degree : . The last coefficient cannot be 0 since is an integral domain (i.e. it has no zero divisors).
Field of Quotients
The field of quotients of , denoted
is a field of rational functions.
Note that in general, although is a field, is a ring (In particular, an integral domain)
Evaluation Homomorphism
Let be fields. Evaluating a polynomial at value (denoted ) is a homomorphism from the ring to field .
Examples
Let , , and . Then always has form , which must be rational.
Therefore evaluation homomorphism may not be onto.
Now let . Then takes form .
Note in particular that , and therefore is a member of the kernel of .
Now let and , so . Thus . Note that . Also note that , so is in the kernel of .
However, 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 . Therefore must be an isomorphism from onto .
How to Plug Values into a Function
Definition 22.10.
Let be fields, , and . If we have , we define
Section 23: Factorization of Polynomials over a Field
Let , such that for . For , we have
Hence if and only if or .
This factorization only makes sense when the degree of and is greater than 1. Hence we are concerned with nontrivial factorizations.
Theorem 23.1: Division in
Let be a field that forms the polynomial ring . Let and Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle g(x) = b_m \, x^m + b_{m-1} \, x^{m-1} + \dots + b_0} be elements of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F[x]} with and Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle m \ge 0} (so is not constant).
Then there are unique polynomials and in such that Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f(x) = g(x) \, q(x) + r(x)} where either Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle r(x) = 0} or the degree of is less than the degree of .
Proof. Consider Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle S = \left\{ f(x) - g(x) \, s(x) ~\mid~ s(x) \in F[x] \right\}} . If Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 0 \in S} , then there exists Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s(x) \in F[x]} such that Therefore , hence Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle r(x) = 0} .
Otherwise, let be of minimal degree [1]. Then
If , then we're done: , so Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f(x) = g(x) \, s(x) + r(x)} with Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \deg(s(x)) < m} . In the more interesting case, if Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle t \ge m} , then
Thus .
Let , then is of lesser degree than — contradiction.
This proves the existence of . All that remains is to prove uniqueness.
Assume with and . Then the product Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle g(x) \, \left( q_1(x) - q_2(x) \right) = r_1(x) - r_2(x)} has LHS degree Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \ge m} and RHS degree — contradiction.
Factoring Examples
Let Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f,g \in \mathbb{Z}_5[x]} where
Find the quotient Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle q(x)} and remainder Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle r(x)} :
Footnotes
- ↑ There must be a minimum since the degree of any polynomial is a positive integer. Hence Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle r(x)} of minimal degree must exist.