The ascending chain condition supplies existence of factorizations into irreducible elements. The Bezout identity makes every irreducible element prime, which supplies uniqueness up to order and multiplication by units.
Every submodule of a finite-rank free module over a principal ideal domain is free. Induction on rank splits off a generator of the image under one coordinate projection and applies the result to the kernel.
A Euclidean function on an integral domain assigns a nonnegative integer to every nonzero element so that, for with , there are satisfying and either or .
If is a Gaussian integer and is a nonzero prime ideal of , then is a finite field. Complex conjugation preserves , so a nonzero gives the positive integer . Primality supplies a rational prime . Since satisfies the monic polynomial , the ring is a quotient of and has at most elements. It is a finite integral domain, hence a field. The proof does not require to be a principal ideal domain.
For a primitive cube root of unity , the Eisenstein integers form the triangular latticeTheir multiplicative norm is .
Every complex number is within squared distance at most of an Eisenstein integer: write it as and round and to integers. Therefore, for nonzero and arbitrary , a nearest lattice point to givesThe norm makes the Eisenstein integers a Euclidean domain.
Articles by others on the same topic
A **Principal Ideal Domain (PID)** is a special type of integral domain in the field of abstract algebra. Here are some key characteristics of a PID: 1. **Integral Domain**: A PID is an integral domain, which means it is a commutative ring with no zero divisors and has a multiplicative identity (usually denoted as 1). 2. **Principal Ideals**: In a PID, every ideal is a principal ideal.