Unique factorization implies normal: Difference between revisions

From Commalg
No edit summary
 
m (2 revisions)
 
(One intermediate revision by the same user not shown)
Line 17: Line 17:
then the above statement translates to:
then the above statement translates to:


<math>a^n + p_1a^{n-1}b + \ldost + p_nb^n = 0</math>
<math>a^n + p_1a^{n-1}b + \ldots + p_nb^n = 0</math>


Suppose there exists a prime <math>q</math> dividing <math>b</math>. Then <math>q</math> divides all terms with a <math>b</math> in them, and hence <math>q|a^n</math>. Since <math>q</math> is prime, this forces <math>q|a</math>, contradicting our assumption of <math>a/b</math> being in reduced form.
Suppose there exists a prime <math>q</math> dividing <math>b</math>. Then <math>q</math> divides all terms with a <math>b</math> in them, and hence <math>q|a^n</math>. Since <math>q</math> is prime, this forces <math>q|a</math>, contradicting our assumption of <math>a/b</math> being in reduced form.


Thus, there is no prime dividing <math>b</math>, so <math>b</math> is a unit. Thus <math>a/b \in R</math> and we are done.
Thus, there is no prime dividing <math>b</math>, so <math>b</math> is a unit. Thus <math>a/b \in R</math> and we are done.

Latest revision as of 16:35, 12 May 2008

This article gives the statement and possibly, proof, of an implication relation between two commutative unital ring properties. That is, it states that every commutative unital ring satisfying the first commutative unital ring property must also satisfy the second commutative unital ring property
View all commutative unital ring property implications | View all commutative unital ring property non-implications |Get help on looking up commutative unital ring property implications/non-implications
|

Statement

Verbal statement

Any unique factorization domain is a normal domain.

Proof

Let R be a unique factorization domain. We want to prove that R is inetgrally closed in its field of fractions. In other words, suppose a,bR and a/b satisfies a monic polynomial with coefficients in R. Then we should prove that a/bR.

Since R is a UFD, we can, without loss of generality, assume that a/b is in reduced form, viz gcd(a,b)=1. Now consider a monic polynomial p(x) such that p(a/b)=0. Suppose:

p(x)=xn+p1xn1+p2xn2++pn

then the above statement translates to:

an+p1an1b++pnbn=0

Suppose there exists a prime q dividing b. Then q divides all terms with a b in them, and hence q|an. Since q is prime, this forces q|a, contradicting our assumption of a/b being in reduced form.

Thus, there is no prime dividing b, so b is a unit. Thus a/bR and we are done.