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











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







share|cite|improve this question









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















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







share|cite|improve this question









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













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







share|cite|improve this question









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






share|cite|improve this question









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.











share|cite|improve this question









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.









share|cite|improve this question




share|cite|improve this question








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


















  • 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















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






Fatih is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















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























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














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






































































-

Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Image
0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
Read more

Aardman Animations

Image
Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
Read more

Are they similar matrix

Image
0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
Read more