A Euclidean domain is an integral domain with a function such that for each and there are with and either or . Some conventions add a multiplicative monotonicity condition; it is unnecessary for this implication.
Let be a nonzero ideal. Choose minimizing , possible because the values lie in the nonnegative integers. For , division by gives , with . A nonzero remainder would contradict minimality, so and . Since , the reverse inclusion also holds. The zero ideal is . Thus
Reducing coefficients modulo gives the ring isomorphismIf , its monic leading coefficient remains one modulo , so . Polynomial division gives a unique representative of degree less than : existence follows by division, and the difference of two such representatives cannot be a nonzero multiple of a degree- monic polynomial. There are choices for each of the coefficients, provingIrreducibility of is not needed for finiteness; without it the quotient ring need not be a field.
Write the Gaussian integer , with , and set . Complex conjugation preserves , because . Choose a nonzero . Then is a positive integer in . It cannot be one because is a proper prime ideal. Factoring into rational primes and applying primality repeatedly gives a prime .
The element satisfies the monic polynomial . Evaluation induces a ring homomorphism that is a surjectionThe source has elements by part (b), soIf , use instead and get at most elements. Moreover is an integral domain, so its finiteness makes it a field. This proves the finite residue-field theorem for Gaussian integer orders without incorrectly assuming that every Gaussian integer order is a principal ideal domain.
Articles by others on the same topic
There are currently no matching articles.