proving that a group of order 60 is simple using homomorphisms.











up vote
0
down vote

favorite












I want to show that the group G, where $|G|=60$ and has 20 elements of order 3 is simple.



Here's what I did:



Suppose that G is not simple this implies that $n_3>1, n_2>1, n_5>1$ where these n's denote the number of sylow p-subgroups in G.



Consider $n_5=(1+5k)|12 Rightarrow n_5=6$ (as we've said it cant be one)



But then $|G:N_G(P)|=6$ ( P denoting the sylow 5 subgroups here).



This implies there is a homomorphism induced by G acting on the left cosets of G/P by left multiplication. $|G/P|>1$ and operation is transitive so the kernel is not the whole group. since g is not simple the map is not injective and also since the groups are finite not surjective. which implies $|G|>|S_n|$ a contradiction .....so G is simple.



Is this correct ?



If not what specifically is wrong with it ?










share|cite|improve this question
























  • "since $G$ is not simple the map is not injective..." - How does that follow?
    – Bungo
    Nov 14 at 2:51










  • Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
    – Shubham
    Nov 14 at 2:55










  • @Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
    – exodius
    Nov 14 at 2:58






  • 1




    Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
    – Bungo
    Nov 14 at 2:59

















up vote
0
down vote

favorite












I want to show that the group G, where $|G|=60$ and has 20 elements of order 3 is simple.



Here's what I did:



Suppose that G is not simple this implies that $n_3>1, n_2>1, n_5>1$ where these n's denote the number of sylow p-subgroups in G.



Consider $n_5=(1+5k)|12 Rightarrow n_5=6$ (as we've said it cant be one)



But then $|G:N_G(P)|=6$ ( P denoting the sylow 5 subgroups here).



This implies there is a homomorphism induced by G acting on the left cosets of G/P by left multiplication. $|G/P|>1$ and operation is transitive so the kernel is not the whole group. since g is not simple the map is not injective and also since the groups are finite not surjective. which implies $|G|>|S_n|$ a contradiction .....so G is simple.



Is this correct ?



If not what specifically is wrong with it ?










share|cite|improve this question
























  • "since $G$ is not simple the map is not injective..." - How does that follow?
    – Bungo
    Nov 14 at 2:51










  • Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
    – Shubham
    Nov 14 at 2:55










  • @Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
    – exodius
    Nov 14 at 2:58






  • 1




    Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
    – Bungo
    Nov 14 at 2:59















up vote
0
down vote

favorite









up vote
0
down vote

favorite











I want to show that the group G, where $|G|=60$ and has 20 elements of order 3 is simple.



Here's what I did:



Suppose that G is not simple this implies that $n_3>1, n_2>1, n_5>1$ where these n's denote the number of sylow p-subgroups in G.



Consider $n_5=(1+5k)|12 Rightarrow n_5=6$ (as we've said it cant be one)



But then $|G:N_G(P)|=6$ ( P denoting the sylow 5 subgroups here).



This implies there is a homomorphism induced by G acting on the left cosets of G/P by left multiplication. $|G/P|>1$ and operation is transitive so the kernel is not the whole group. since g is not simple the map is not injective and also since the groups are finite not surjective. which implies $|G|>|S_n|$ a contradiction .....so G is simple.



Is this correct ?



If not what specifically is wrong with it ?










share|cite|improve this question















I want to show that the group G, where $|G|=60$ and has 20 elements of order 3 is simple.



Here's what I did:



Suppose that G is not simple this implies that $n_3>1, n_2>1, n_5>1$ where these n's denote the number of sylow p-subgroups in G.



Consider $n_5=(1+5k)|12 Rightarrow n_5=6$ (as we've said it cant be one)



But then $|G:N_G(P)|=6$ ( P denoting the sylow 5 subgroups here).



This implies there is a homomorphism induced by G acting on the left cosets of G/P by left multiplication. $|G/P|>1$ and operation is transitive so the kernel is not the whole group. since g is not simple the map is not injective and also since the groups are finite not surjective. which implies $|G|>|S_n|$ a contradiction .....so G is simple.



Is this correct ?



If not what specifically is wrong with it ?







group-theory proof-verification proof-writing finite-groups sylow-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 14 at 2:27

























asked Nov 14 at 1:51









exodius

924417




924417












  • "since $G$ is not simple the map is not injective..." - How does that follow?
    – Bungo
    Nov 14 at 2:51










  • Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
    – Shubham
    Nov 14 at 2:55










  • @Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
    – exodius
    Nov 14 at 2:58






  • 1




    Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
    – Bungo
    Nov 14 at 2:59




















  • "since $G$ is not simple the map is not injective..." - How does that follow?
    – Bungo
    Nov 14 at 2:51










  • Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
    – Shubham
    Nov 14 at 2:55










  • @Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
    – exodius
    Nov 14 at 2:58






  • 1




    Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
    – Bungo
    Nov 14 at 2:59


















"since $G$ is not simple the map is not injective..." - How does that follow?
– Bungo
Nov 14 at 2:51




"since $G$ is not simple the map is not injective..." - How does that follow?
– Bungo
Nov 14 at 2:51












Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
– Shubham
Nov 14 at 2:55




Actually you are assuming not simple, that means there is some normal subgroup either of order 4 or 5
– Shubham
Nov 14 at 2:55












@Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
– exodius
Nov 14 at 2:58




@Bungo I know that If G were simple then it would be an injective map. maybe what is the true statement is the map may not be injective ?
– exodius
Nov 14 at 2:58




1




1




Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
– Bungo
Nov 14 at 2:59






Simple $implies$ injective, but that doesn't mean that (not simple) $implies$ (not injective), or equivalently, that injective $implies$ simple.
– Bungo
Nov 14 at 2:59

















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
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997646%2fproving-that-a-group-of-order-60-is-simple-using-homomorphisms%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997646%2fproving-that-a-group-of-order-60-is-simple-using-homomorphisms%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Plaza Victoria

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...