Decompose $G$ into product of simple groups











up vote
0
down vote

favorite












prove that If $G=H_1times...times H_m=K_1times....times K_n$, where each $H_i$ and $K_i$ are simple groups then $m=n$ and there is a permutation $sigma in S_n$ such that $H_i cong K_{sigma(i)}$ for all $i=1,2,...,n.$



Here is my attempt:
each $H_i$ is normal in $G$, $G$ has composition series: $G=G_0=H_1times...times H_m triangleright G_1=H_2 times ...times H_m triangleright ...triangleright G_{m-1}=H_m triangleright G_m={1}$.



also:



$G=M_0=K_1times...times K_n triangleright M_1=K_2 times ...times K_n triangleright ...triangleright M_{n-1}=K_n triangleright M_n={1}$.



So by Jordan Holder theorem, $n=m$, and the composition factors of the two composition series are permutations of each others. Also, $H_i$ and $K_i$ can be made into composition factors in a composition serie that ends with $H_i triangleright {1}$ or $K_i triangleright {1}$. so that means we can construct two composition series so that $H_i cong K_{sigma(i)}$. Is this proof correct?










share|cite|improve this question






















  • Yes, it is correct.
    – freakish
    yesterday















up vote
0
down vote

favorite












prove that If $G=H_1times...times H_m=K_1times....times K_n$, where each $H_i$ and $K_i$ are simple groups then $m=n$ and there is a permutation $sigma in S_n$ such that $H_i cong K_{sigma(i)}$ for all $i=1,2,...,n.$



Here is my attempt:
each $H_i$ is normal in $G$, $G$ has composition series: $G=G_0=H_1times...times H_m triangleright G_1=H_2 times ...times H_m triangleright ...triangleright G_{m-1}=H_m triangleright G_m={1}$.



also:



$G=M_0=K_1times...times K_n triangleright M_1=K_2 times ...times K_n triangleright ...triangleright M_{n-1}=K_n triangleright M_n={1}$.



So by Jordan Holder theorem, $n=m$, and the composition factors of the two composition series are permutations of each others. Also, $H_i$ and $K_i$ can be made into composition factors in a composition serie that ends with $H_i triangleright {1}$ or $K_i triangleright {1}$. so that means we can construct two composition series so that $H_i cong K_{sigma(i)}$. Is this proof correct?










share|cite|improve this question






















  • Yes, it is correct.
    – freakish
    yesterday













up vote
0
down vote

favorite









up vote
0
down vote

favorite











prove that If $G=H_1times...times H_m=K_1times....times K_n$, where each $H_i$ and $K_i$ are simple groups then $m=n$ and there is a permutation $sigma in S_n$ such that $H_i cong K_{sigma(i)}$ for all $i=1,2,...,n.$



Here is my attempt:
each $H_i$ is normal in $G$, $G$ has composition series: $G=G_0=H_1times...times H_m triangleright G_1=H_2 times ...times H_m triangleright ...triangleright G_{m-1}=H_m triangleright G_m={1}$.



also:



$G=M_0=K_1times...times K_n triangleright M_1=K_2 times ...times K_n triangleright ...triangleright M_{n-1}=K_n triangleright M_n={1}$.



So by Jordan Holder theorem, $n=m$, and the composition factors of the two composition series are permutations of each others. Also, $H_i$ and $K_i$ can be made into composition factors in a composition serie that ends with $H_i triangleright {1}$ or $K_i triangleright {1}$. so that means we can construct two composition series so that $H_i cong K_{sigma(i)}$. Is this proof correct?










share|cite|improve this question













prove that If $G=H_1times...times H_m=K_1times....times K_n$, where each $H_i$ and $K_i$ are simple groups then $m=n$ and there is a permutation $sigma in S_n$ such that $H_i cong K_{sigma(i)}$ for all $i=1,2,...,n.$



Here is my attempt:
each $H_i$ is normal in $G$, $G$ has composition series: $G=G_0=H_1times...times H_m triangleright G_1=H_2 times ...times H_m triangleright ...triangleright G_{m-1}=H_m triangleright G_m={1}$.



also:



$G=M_0=K_1times...times K_n triangleright M_1=K_2 times ...times K_n triangleright ...triangleright M_{n-1}=K_n triangleright M_n={1}$.



So by Jordan Holder theorem, $n=m$, and the composition factors of the two composition series are permutations of each others. Also, $H_i$ and $K_i$ can be made into composition factors in a composition serie that ends with $H_i triangleright {1}$ or $K_i triangleright {1}$. so that means we can construct two composition series so that $H_i cong K_{sigma(i)}$. Is this proof correct?







group-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked yesterday









mathnoob

62811




62811












  • Yes, it is correct.
    – freakish
    yesterday


















  • Yes, it is correct.
    – freakish
    yesterday
















Yes, it is correct.
– freakish
yesterday




Yes, it is correct.
– freakish
yesterday















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%2f3005199%2fdecompose-g-into-product-of-simple-groups%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%2f3005199%2fdecompose-g-into-product-of-simple-groups%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

'app-layout' is not a known element: how to share Component with different Modules

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

WPF add header to Image with URL pettitions [duplicate]