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 be elements of with and (so is not constant).
Then there are unique polynomials and in such that where either or the degree of is less than the degree of .
Proof. Consider . If , then there exists such that Therefore , hence .
Otherwise, 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 r(x) \in S} be of minimal degree [1]. Then
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<m} , then we're done: 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)} , 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 , then
Thus 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(r(x)) \le t-1 < r(x)} .
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 s'(x) = s(x) + \frac{c_t}{b_m} \, x^{t-m}} , then 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) - s'(x) \, g(x)} is of lesser degree than — contradiction.
This proves the existence of . All that remains is to prove uniqueness.
Assume 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_1(x) + r_1(x) = g(x) \, q_2(x) + r_2(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(r_1),\deg(r_2) < m} 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 q_1 \ne q_2} . Then the product 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 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} — 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 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 \begin{align} f(x) &= x^4 - 3x^3 + 2x^2 + 4x - 1 \\ g(x) &= x^2 - 2x + 3 \end{align}}
Find the quotient 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.