If $M$ has a largest proper submodule, then $ M$ is directly indecomposable

Multi tool use
up vote
0
down vote
favorite
Can you prove that
"Every module $M$, which has a largest proper submodule or, in the set of non-zero submodules, a smallest submodule, is directly indecomposable?
direct-sum
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
0
down vote
favorite
Can you prove that
"Every module $M$, which has a largest proper submodule or, in the set of non-zero submodules, a smallest submodule, is directly indecomposable?
direct-sum
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Can you prove that
"Every module $M$, which has a largest proper submodule or, in the set of non-zero submodules, a smallest submodule, is directly indecomposable?
direct-sum
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Can you prove that
"Every module $M$, which has a largest proper submodule or, in the set of non-zero submodules, a smallest submodule, is directly indecomposable?
direct-sum
direct-sum
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 10 hours ago


YukiJ
2,0552828
2,0552828
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 10 hours ago
Fatih
11
11
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Fatih is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago
add a comment |
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Fatih is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Fatih is a new contributor. Be nice, and check out our Code of Conduct.
Fatih is a new contributor. Be nice, and check out our Code of Conduct.
Fatih is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996470%2fif-m-has-a-largest-proper-submodule-then-m-is-directly-indecomposable%23new-answer', 'question_page');
}
);
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
FUcN Go7WiYFJHPLt LA w7n,CijKimMKkjHHt
Yes, I can. Can you?
– Tobias Kildetoft
10 hours ago
I will be pleasure if you write the proof, i couldnt proof it
– Fatih
9 hours ago