GCDs and LCMs
Since every ideal factors in a Dedekind domain, we may naturally define the greatest common divisor and least common multiple of two ideals . Note "greatest" and "least" take the opposite meaning here. We take "multiple" to mean subideal, and "divisor" means larger ideal, so is the smallest ideal containing both ideals, whilst is the largest ideal contained in both:
Theorem: Let be an ideal of a Dedekind domain and let . Then there exists such that
Proof: We shall find with . Note this implies .
Let be the prime decomposition of . Then is divisible by all the . Let denote the other primes which divide . We shall find such that none of the divide , and is the exact power of dividing for all . In other words
This can be done using the Chinese Remainder Theorem. Fix and solve the congruences:
We need show that the powers of the and are pairwise coprime. But this is true since the sum is the greatest common divisor. Alternatively, for all we have for some . Then for any two positive integers we have by considering the binomial expansion.
In general every PID is a UFD, but the converse is not always true. However, for a Dedekind domain:
Theorem: A Dedekind domain is a UFD if and only if it is a PID
Proof: We need only show the converse. Suppose we have an ideal that is prime but not principal. Consider the set of ideals with principal, which must be nonempty in a Dedekind domain. Take a maximal member and set . Then is an irreducible element since if then either or would be of the form for some , and since is maximal this would imply and hence or is a unit.
Take any , and note contains . That is yet is irreducible, which is impossible in a UFD (since every irreducible should be prime).