Abstract Nonsense

Crushing one theorem at a time

Polynomial Rings in Relation to Euclidean Domains, PIDs, and UFDs (Pt. I)


Point of Post:

In this post we discuss how polynomial rings act when their underlying rings are PIDs, Euclidean domains, and UFDs. The high points being the proof that k[x] is a Euclidean domain for fields k and R[x] is a UFD when R is a UFD.

\text{ }

Motivation

We have mentioned several times that polynomial rings occupy a central role in modern mathematics. Consequently, studying them should occupy no small amount of our time. In this post we shall prove some previously made assertions about when polynomial rings are Euclidean domains, PIDs, and UFDs and some of the consequences of thes results.

\text{ }

Polynomial Rings Over Fields are Euclidean Domains

\text{ }

We have mentioned several times now that polynomial rings k[x] where k is a field are Euclidean domains. We now prove this result:

\text{ }

Theorem: Let k be a field, then for every a(x),b(x)\in k[x] there exists unique q(x),r(x)\in k[x] such that b(x)=q(x)a(x)+r(x) and r(x)=0 or \deg(r(x))<\deg(a(x)).

Proof: If b(x)=0 we may take q(x)=r(x)=0 and if \deg(b(x))<\deg(a(x)) then we may take q(x)=0 and r(x)=b(x). So, from now on we assume that b(x)\ne 0 and \deg(b(x))\geqslant \deg(a(x)). We proceed then by induction on \deg(b(x))=n. If n=0 then \deg(a(x))=0 and the rest follows since k is a field. So, assume the result is true for \deg(b(x))<n and let \deg(b(x))=n, say b(x)=b_0+\cdots+b_nx^n. Let us be given a(x)=a_0+\cdots+a_kx^k with, by assumption, n\geqslant k. Consider then the polynomial c(x)=b(x)-b_na_k^{-1}x^{n-k}a(x). We know that c(x) is of degree less than n and so by the induction hypothesis there exists q'(x),r(x) with c(x)=q'(x)a(x)+r(x) with r(x)=0 or \deg(r(x))<\deg(a(x)). Letting then q(x)=q'(x)+b_na_k^{-1}x^{n-k} gives us that b(x)=q(x)a(x)+r(x) with r(x)=0 or \deg(r(x))<\deg(a(x)). This completes the induction. \text{ } To see that this is unique suppose that q(x)a(x)+r(x)=b(x)=q'(x)a(x)+r'(x) we see then that a(x)(q(x)-q'(x))=r'(x)-r(x) and since the degree of the right hand side is strictly less than the degree of a(x) we must have that q(x)-q'(x)=0 and so q(x)=q'(x) from where it easily follows that r(x)=r'(x). \blacksquare

\text{ }

With this we can now state:

\text{ }

Theorem: Let k be a field, then (k[x],\deg) is a Euclidean domain and \deg satisfies the d-inequality.

\text{ }

This gives us the unproven part of:

\text{ }

Theorem: Let R be a ring. Then, R[x] is a PID or a Euclidean domain if and only if R is a field.

\text{ }

Now, the mere existence of this division algorithm allows us to conclude some important things about polynomials over a field:

\text{ }

Theorem: Let k be a field and p(x)\in k[x]. Then, x-a\mid p(x) if and only if p(a)=0.

Proof: Evidently if x-a\mid p(x) then p(a)=0. Conversely, suppose p(a)=0. We know that p(x)=(x-a)q(x)+r where r is a constant. Since r=(a-a)q(a)+r=p(a)=0 we may conclude that r=0 and so p(x)=(x-a)q(x). \blacksquare

\text{ }

From this and the fact that the degree function is additive allows one to conclude the following:

\text{ }

Corollary: Let k be a field and p(x)\in k[x] be non-zero. Then the number of distinct roots in k of p(x) does not exceed \deg(p(x)).

\text{ }

We are now in position to prove a long-discussed theorem. Namely:

\text{ }

Theorem: Let R be an infinite integral domain and \text{Fun}(R) the ring of all functions R\to R with the usual operations. Then the obvious map R[x]\hookrightarrow \text{Fun}(R) is an embedding.

Proof: We have already remarked that this map is a unital homomorphism of rings, and so it suffices to prove that it’s injective. This is equivalent though to showing that if p(x)=a_0+\cdots+a_nx^n satisfies p(a)=0 for all a\in R then a_0=\cdots=a_n=0. To see this we proceed in two steps. \text{ } First, we prove this result for the field of fractions \text{Frac}(R) of R. But, this is obvious, if p(x)\in\text{Frac}(R)[x] is identically zero as a function on \text{Frac}(R) then p(x) has infinitely many roots in \text{Frac}(R) and so by the previous corollary must be zero.

\text{ }

Suppose now that p(x)\in R[x] is identically zero as a function on R we claim that it is identically zero as a function on \text{Frac}(R). But, this is obvious since then p(x) would have infinitely many roots in R\subseteq\text{Frac}(R). Thus, p(x) is the zero polynomial. \blacksquare

\text{ }

So, in an integral domain R viewing a polynomial as a set of coefficients and as a function are the same thing.

\text{ }

\text{ }

References:

[1] Dummit, David Steven., and Richard M. Foote. Abstract Algebra. Hoboken, NJ: Wiley, 2004. Print.

[2] Rotman, Joseph J. Advanced Modern Algebra. Providence, RI: American Mathematical Society, 2010. Print.

[3] Bhattacharya, P. B., S. K. Jain, and S. R. Nagpaul. Basic Abstract Algebra. Cambridge [Cambridgeshire: Cambridge UP, 1986. Print.

Advertisements

October 24, 2011 - Posted by | Algebra, Ring Theory | , , , , , , , , , ,

4 Comments »

  1. […] up until this point we’ve discussed Euclidean Domains, PIDs, and UFDs and (in our last set of posts) showed that certain polynomial rings are also UFDs and Euclidean domains. A central […]

    Pingback by Some Polynomial Irreducibility Criteria « Abstract Nonsense | October 26, 2011 | Reply

  2. […] be a field and let be irreducible. We know then that is a maximal ideal and thus is a field, which can be thought of as an […]

    Pingback by Field Extensions « Abstract Nonsense | March 7, 2012 | Reply

  3. […] we know that the -map with has some non-trivial kernel sitting inside . But, since is a field we know that is a PID and so  for some monic polynomial . Moreover, this polynomial has the property […]

    Pingback by Algebraic Extensions (Pt. I) « Abstract Nonsense | March 25, 2012 | Reply

  4. […] see that spans we merely note that for any the division algorithm in tells us that we can write where . Thus, we see […]

    Pingback by Algebraic Extensions (Pt. II) « Abstract Nonsense | March 25, 2012 | Reply


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: