Rotman's Remarks on Modules in Context of Chain Conditions

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Joseph J. Rotman's book: Advanced Modern Algebra (AMA) and I am currently focused on Section 7.1 Chain Conditions (for modules) ...

I need some help in order to gain a full understanding of some remarks made in AMA on page 526 on modules in the context of chain conditions and composition series for modules ... ...

The remarks read as follows:
?temp_hash=b80cb4256b3277eca0177962d7865532.png
My questions on this text are as follows:Question 1

In the above text we read:

" ... ... The Correspondence Theorem shows that a submodule N of a left R-module is a maximal submodule if and only if M/N is simple ... ... "

Can someone please explain exactly how the Correspondence Theorem leads to this result ... ?Question 2

In the above text we read:

" ... ... a left R-module is simple if and only if it is isomorphic to R/I for some maximal left ideal I ... ... "

Can someone please demonstrate, formally and rigorously why this is true ...?

Hope someone can help ...

Peter=================================================

The above post refers to the Correspondence Theorem for Modules which in Rotman's Advanced Modern Algebra is Theorem 6.22 ... I am therefore providing the text of Theorem 6.22 as follows:
?temp_hash=b80cb4256b3277eca0177962d7865532.png
 

Attachments

  • Rotman - AMA - Remarks on Modules - page 526    ....png
    Rotman - AMA - Remarks on Modules - page 526 ....png
    25.6 KB · Views: 544
  • Rotman - Theorem 6.22.png
    Rotman - Theorem 6.22.png
    40.1 KB · Views: 289
Physics news on Phys.org
Math Amateur said:
Question 1

In the above text we read:

" ... ... The Correspondence Theorem shows that a submodule N of a left R-module is a maximal submodule if and only if M/N is simple ... ... "

Can someone please explain exactly how the Correspondence Theorem leads to this result ... ?
Say ##M/N## is simple and let ##N'## be a submodule of ##M## such that ##N\subseteq N'\subseteq M##.
Then, from simplicity of ##M/N##, ##N'/N## must equal either ##N/N={0}## or ##M/N##.
So, under the correspondence theorem, ##\phi^{-1}(N'/N)## must equal either ##N## or ##M##. So ##N## must be maximal.

To prove the other direction, assume that ##M/N## is not simple so that we can find ##N\subsetneq N'\subsetneq M## such that
##N/N\subsetneq N'/N\subsetneq M/N##.

The second part of your question looks to be the same as what is in your other thread.
 
  • Like
Likes Math Amateur
Thanks so much for the help, Andrew ...

Just reflecting on the details of your post, now ..

Thanks again ...

Peter
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top