]> Number Fields - GCDs and LCMs

GCDs and LCMs

Since every ideal factors in a Dedekind domain, we may naturally define the greatest common divisor gcd(I,J) and least common multiple lcm(I,J) of two ideals I,J. Note "greatest" and "least" take the opposite meaning here. We take "multiple" to mean subideal, and "divisor" means larger ideal, so gcd(I,J) is the smallest ideal containing both ideals, whilst lcm(I,J) is the largest ideal contained in both:

gcd(I,J) = I+J lcm(I,J) = IJ

Theorem: Let I be an ideal of a Dedekind domain R and let αI. Then there exists βI such that I=α,β

Proof: We shall find βR with I=gcd(α,β). Note this implies βI.

Let I=P 1 n 1 ...P r n r be the prime decomposition of I. Then α is divisible by all the P i n i. Let Q 1 ,...,Q s denote the other primes which divide α. We shall find β such that none of the Q j divide β, and P i n i is the exact power of P i dividing β for all i. In other words

β i=1 r(P i n iP i n i+1 ) j=1 s(RQ j)

This can be done using the Chinese Remainder Theorem. Fix β iP i n iP i n i+1 and solve the congruences:

β = β i (modP i n i+1 ), i=1 ,...,r β = 1 (modQ j), j=1 ,...,s

We need show that the powers of the P i and Q j are pairwise coprime. But this is true since the sum is the greatest common divisor. Alternatively, for all P i,Q j we have 1 =α+β for some αP i,βQ j. Then for any two positive integers m,n we have 1 m+n1 =(α+β) m+n1 P i m+Q j n 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 P that is prime but not principal. Consider the set of ideals I with PI principal, which must be nonempty in a Dedekind domain. Take a maximal member M and set PM=α. Then α is an irreducible element since if α=βγ then either β or γ would be of the form PJ for some JM, and since M is maximal this would imply J=M and hence β or γ is a unit.

Take any δPα, εMα and note α contains δε. That is αδε yet α is irreducible, which is impossible in a UFD (since every irreducible should be prime).