Definition. For , if , then we say is irreducible.
If every element in can be uniquely written as product of irreducible elements , then we say is UFD.
Some basic observation.
Prime is irreducible. Since if , suppose , then . Hence .
Let be the poset of principle ideal in , then .
is irreducible iff is a maximal element in .
satisfies ACC. That is, must become stable. Since only have finite many factors.
Conversely, if satiefies ACC, then every can be factor to product of irreducible elements.
Since
If all the irreducible elements are prime, for then if , then it is the unique way.
Since if , then for . But both and are irreducible, ...
Collorary. For an integral domain , is UFD iff satisfies ACC and all the irreducible elements are prime.
Definition.
Definition. A content of a polynomial is . The notation here means equal but up to unit. For example, . If is a unit, then we say that is primitive.
Lemma. Product of two primitive polynomial is primitive as well. Further,
Proof.
Let Suppose is not primitive, then there exists a Since is primitive, does not divide and . Hence does not dived all the and . Let be the smallest number that does not dived and . Then let us consider the coefficient of , i.e. .
Notice that since . Similarly, . By assumption, , hence , hence . But is prime, hence or . That is a contradiction. Hence is also primitive.
For , let . Then will be primitive and Since is unit and , .
Corollary. If is prime, then is prime as well. Hence is primitivr in by induction.
Proof. Since is integral domain, , so is not a unit. Let , .
Lemma. Let and is primitive. Then if , then .
Proof. Let where . Let be the lcm of the denominator of the coefficients of , then .
Hence Since both and are primitive, is primitive. Take the content both side, we get that . Hence .
Corollary. Let be primitive. If is prime in , then is prime in . We will use this to prove that If is UFD, then is UFD as well.
Lemma. Gauss Lemma.
Let be primitive. is irreducible in , if and only if is irreducible in .
Proof. Suppose is reducible in , then . Let , where
We have , hence . Act content both sides we get .
Oberve that is primitive, , hence . , where .
That is a contradiction to is irreducible in . is obviously.
Proposition. is UFD implies is UFD.
Proof. Let , then . Since is UFD, is product of irreducible elements in . Hence product of irreducible elements in . So we only need to deal with primitive polynomial. Let . Here are primitive as well. By induction on the degree, we can factor to primitive irreducible.
Now we need to show uniqueness of factorization. i.e. All the irreducible elements are prime.
Let be irreducible,in hence is irreducible in . Hence is prime in . By the previous corollary, i.e.
Corollary. Let be primitive. If is prime in , then is prime in . We will use this to prove that If is UFD, then is UFD as well.
is prime. Hence is UFD as well.
Eisenstein's criterion.
Let be a commutative ring, . Let be a prime ideal.
If . Then is irreducible.
Proof. Consider , wchich is an integral domian. Suppose , and
Then . Hence . That is a contradiction.
Example. For , define . Easy to see this is a ring isomorphism.
Consider Then
By Eisenstein's criterion, is irreducible. Since is isomorphism, is irreducible.
No comments:
Post a Comment