Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Simple module
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Basic properties of simple modules == The simple modules are precisely the modules of [[length of a module|length]] 1; this is a reformulation of the definition. Every simple module is [[indecomposable module|indecomposable]], but the converse is in general not true. Every simple module is [[cyclic module|cyclic]], that is it is generated by one element. Not every module has a simple submodule; consider for instance the '''Z'''-module '''Z''' in light of the first example above. Let ''M'' and ''N'' be (left or right) modules over the same ring, and let {{nowrap|''f'' : ''M'' β ''N''}} be a module homomorphism. If ''M'' is simple, then ''f'' is either the zero homomorphism or [[injective]] because the kernel of ''f'' is a submodule of ''M''. If ''N'' is simple, then ''f'' is either the zero homomorphism or surjective because the [[image (mathematics)|image]] of ''f'' is a submodule of ''N''. If {{nowrap begin}}''M'' = ''N''{{nowrap end}}, then ''f'' is an [[endomorphism]] of ''M'', and if ''M'' is simple, then the prior two statements imply that ''f'' is either the zero homomorphism or an isomorphism. Consequently, the [[endomorphism ring]] of any simple module is a [[division ring]]. This result is known as '''[[Schur's lemma]]'''. The converse of Schur's lemma is not true in general. For example, the '''Z'''-module '''Q''' is not simple, but its endomorphism ring is isomorphic to the field '''Q'''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)