Homework 7
Problem 1
Let
- Suppose that
has rank and is a maximal linearly independent set of elements in . Let be the submodule generated by . Prove that and is a torsion -module. - Conversely, prove that if
contains a submodule that is free of rank such that the quotient is a torsion -module, then has rank .
- Show that for any
there is a nonzero such that for some . - Let
be a set of elements of . Find some nonzero so that can be written using a basis for . Then show the (and hence ) are linearly dependent.
-
Let
be a fixed set with elements and define an -module morphism by . The image of is exactly the submodule and the kernel of is the set of all formal sums such that . Since the set is -linearly independent, it follows that and so by the First Isomorphism Theorem for modules . This proves .We next prove
is torsion. Take any element in . The set of elements must then be linearly dependent, so there are some (not all zero) such thatWe cannot have
, since the above relation would then yield a nontrivial relation on the set . So we must have . But now notice that , soThus, the element
is torsion in . -
First notice that since
contains a submodule of rank , the rank of must be at least . (Any independent set of elements in is also an independent set of elements in .) So we only need to prove does not have an independent subsets consisting of more than elements. To that end, suppose is any set of elements of . Since is torsion, for each the coset is torsion in . This implies there is some nonzero with ; i.e., . But then we have a set of elements in the module (which has rank ), so this set must be -linearly dependent. This implies there are (not all zero) such thatSince
, the above equality gives the relationEvery
is nonzero and at least one is nonzero, so (since is a domain) the elements are not all zero. Thus, the above relation implies the set is -linearly dependent. We've proven that does not contain any linearly independent sets with more than elements, and hence the rank of is no more than . By our earlier remarks, this proves the rank of is exactly .
Problem 2
Let
Let
Let
The above equation is equivalent to the equality
By the definition of
This is last equality is equivalent to the pair of equalities
Since the sets
Let
Since the sets
and so
By our work above, we can now conclude that the rank of
Problem 3
Let
(You may assume
For part (2), let
Let
To see this, note that if
Let