A Euclidean domain is a principal ideal domain. The structure theorem for finitely generated modules over a principal ideal domain therefore gives, for every finitely generated module over ,
where the are nonzero nonunits and . The factors are unique up to multiplication by units; is uniquely determined.
The rank of a module is this integer . Equivalently, with the field of fractions of ,
The tensor product of modules kills each displayed torsion summand after extending scalars to , while sending to , explaining the equality.
If is a torsion-free module, no summand can occur: its nonzero element is killed by the nonzero scalar . Hence and
This also covers , with .
Let . Choose a positive integer clearing their denominators and write , with . If and are not both zero, then
is a relation with integer coefficients not both zero. If both vanish, use . Thus every pair is linearly dependent over .
A submodule is a torsion-free module: if for a nonzero integer and a rational number , then . If is also a finitely generated module, part (a), applied to the Euclidean domain , makes it a free module. Its rank cannot exceed one, since two different members of a basis of a module would be linearly independent, contradicting the relation just proved. Since , its rank cannot be zero. Therefore
The denominator-and-greatest common divisor construction in part (c) gives an explicit version of this result for a finitely generated subgroup of the rational additive group.
Using the common denominator , the three given generators become
Thus their submodule is contained in . For the reverse inclusion, the following explicit integer linear combination supplies the missing generator:
so
Therefore belongs to the generated submodule, and all its integer multiples belong as well. We have established equality in both directions:
Finally, for an integer forces , so the single generator is linearly independent. Hence the required basis of a module is
Suppose a finite set of rational numbers generated as a module over . A positive common denominator makes every an integer. For every integer linear combination, therefore,
The entire generated submodule is contained in . But is a rational number outside that set: would require the noninteger . This contradicts generation of all of . Consequently
Each finite set of generators imposes a common denominator; the full rational number system has no such bound.

Articles by others on the same topic (0)

There are currently no matching articles.