gcd domain (original) (raw)

For example, 0 is a gcd of 0 and 0 in any D. In fact, if d is a gcd of 0 and 0, then d∣0. But 0∣0, so that 0∣d, which means that, for some x∈D, d=0⁢x=0. As a result, 0 is the unique gcd of 0 and 0.

In general, however, a gcd of two elements is not unique. For example, in the ring of integersMathworldPlanetmath, 1 and -1 are both gcd’s of two relatively prime elementsMathworldPlanetmath. By definition, any two gcd’s of a pair of elements in D are associatesMathworldPlanetmath of each other. Since the binary relationMathworldPlanetmath “being associates” of one anther is an equivalence relationMathworldPlanetmath (not a congruence relationPlanetmathPlanetmath!), we may define the gcd of a and b as the set

GCD⁡(a,b):={c∈D∣c⁢ is a gcd of ⁢a⁢ and ⁢b},

For example, as we have seen, GCD⁡(0,0)={0}. Also, for any a∈D, GCD⁡(a,1)=U⁡(D), the group of units of D.

If there is no confusion, let us denote gcd⁡(a,b) to be any element of GCD⁡(a,b).

If GCD⁡(a,b) contains a unit, then a and b are said to be relatively prime. If a is irreduciblePlanetmathPlanetmath, then for any b∈D, a,b are either relatively prime, or a∣b.

An integral domainMathworldPlanetmath D is called a gcd domain if any two elements of D, not both zero, have a gcd. In other words, D is a gcd domain if for any a,b∈D, GCD⁡(a,b)≠∅.

Remarks

The following diagram indicates how the different domains are related:

References

Title gcd domain
Canonical name GcdDomain
Date of creation 2013-03-22 14:19:51
Last modified on 2013-03-22 14:19:51
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 26
Author CWoo (3771)
Entry type Definition
Classification msc 13G05
Related topic GreatestCommonDivisor
Related topic BezoutDomain
Related topic DivisibilityInRings
Defines gcd
Defines greatest common divisor
Defines relatively prime
Defines lcm domain