Proof of Theorem 1, Chapter 12: Modules over Principal Ideal Domains

  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Algebra Modules
quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
[SOLVED] Algebra - modules

Homework Statement


I'm reading this proof from D&F and there's something I don't get. It is theorem 1 of chapter 12 on modules over principal ideal domains. The theorem is the following

"Let R be a ring and let M be a left R-module. Then,

(Ever nonempty set of submodules of M contains a maximal element under inclusion) ==> (Every submodule of M is finitely generated)"

The authors prove this assertion by letting N be a submodule of M and denoting S the collection of all finitely generated submodules of N. The hypothesis guarantees the existence of a maximal element N' of S, and we'd be happy if N'=N. So suppose N' is different from N and consider an element x in N\N'. Then the submodule of N generated by {x}uN' is finitely generated, thus violating the maximality of N'.


The Attempt at a Solution



How is this so? Notice that R is not assumed to have a 1. So there is nothing I can see that guarantees that N' is contained, let alone properly contained, in <{x}uN'>.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top