[!Fact]
Let be a field. Then, is a UFD. This follows from the fact that any regular local ring is a UFD. A Local ring is one which has a unique maximal ideal . If a ring is regular local, then is a vector space over .

[!Exercise]
.

It follows that .

is a Euclidean domain. Define the degree of a power series to be the degree of the smallest non-zero term.

[!Definition]
Let be a ring and be a subset of . An element is a gcd of if

  1. for all , and
  2. If for all , then .

[!Theorem]
Let . Let . Then,

[!Proof]-

Let such that . Since , we have . Also, since for all , for all , and the reverse inclusion holds.

Conversely, suppose . and immediately follow. show property . Show that if there exists another gcd , and are associates.

[!Example]
Let be a ring. Suppose is the gcd of . It is possible that may not be expressible as a linear combination of the elements of . For example, is the gcd of in , but .

.

Show that is not a prime ideal.


[!Definition]
Let not be an integer. Let satisfy a monic irreducible polynomial , where . We define the norm and trace of as , .

For example, every element in is of the form ; , .


[!Remark]
Every ideal in a ring is a module over . Look up nakayama’s lemma Singh (2011, p. 16).

[!Remark]
Let be a homomorphism and be a -module is an -module. If is an -module, then for any ideal , is module.

.


[!Theorem]
Every PID is a UFD.

[!Proof]-
factorization exists: Suppose is a PID. We prove by contradiction. Suppose there exists nonzero nonunit which cannot be factors as a finite product of irreducible elements. Let be the set of all such elements. Let . Then where is a maximal ideal and where is irreducible. So , . can’t be a unit, since that would mean . For the same reason, can’t be written as the product of a unit and finitely many irreducibles. Thus, is forced to be in . So, , and the inclusion is proper. Continue this process to get an infinite chain; this is a contradiction.

Uniqueness of factorization:jjj


[!Proposition]
Let be a UFD. Then a non-zero element if prime iff it is irreducible.

[!Proof]-
Prime implies irreducible in any ID. Have to show irreducible implies prime. Let be an irreducible element and let . We need to show that or .

for some . By hypothesis, we can write , , where are units and and are irreducibles. We now have

Thus, is an associate of at least one of . If is an associate of some , then . If is an associate of some , .

[!Proposition]
If is a UFD and , then gcd of and exists.

[!Proof]-
Let and . Consider where is an associate of some …


In , If and is the gcd of the generators of , then .


References

Singh, B. (2011). Basic Commutative Algebra. World Scientific.