Does $HK = G$ imply that $KH = G$ when $H,K$ aren't subgroups?
$begingroup$
Let $G$ be a finite group and let $H$ and $K$ be two "subsets" of $G$ such that $HK = G$. Does that imply that $KH = G$?
Since $H$ and $K$ are not subgroups we cannot use the formula $o(HK) = frac{o(H)o(K)}{o(Hcap K)}$.
I believe this is false and I am looking for counterexamples.
Thank you.
group-theory finite-groups
$endgroup$
add a comment |
$begingroup$
Let $G$ be a finite group and let $H$ and $K$ be two "subsets" of $G$ such that $HK = G$. Does that imply that $KH = G$?
Since $H$ and $K$ are not subgroups we cannot use the formula $o(HK) = frac{o(H)o(K)}{o(Hcap K)}$.
I believe this is false and I am looking for counterexamples.
Thank you.
group-theory finite-groups
$endgroup$
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45
add a comment |
$begingroup$
Let $G$ be a finite group and let $H$ and $K$ be two "subsets" of $G$ such that $HK = G$. Does that imply that $KH = G$?
Since $H$ and $K$ are not subgroups we cannot use the formula $o(HK) = frac{o(H)o(K)}{o(Hcap K)}$.
I believe this is false and I am looking for counterexamples.
Thank you.
group-theory finite-groups
$endgroup$
Let $G$ be a finite group and let $H$ and $K$ be two "subsets" of $G$ such that $HK = G$. Does that imply that $KH = G$?
Since $H$ and $K$ are not subgroups we cannot use the formula $o(HK) = frac{o(H)o(K)}{o(Hcap K)}$.
I believe this is false and I am looking for counterexamples.
Thank you.
group-theory finite-groups
group-theory finite-groups
edited Dec 17 '18 at 5:18
the_fox
2,90031538
2,90031538
asked Dec 17 '18 at 3:33
GA316GA316
2,6891232
2,6891232
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45
add a comment |
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hopefully I didn't make any stupid mistake :)
Let $G=S_3$ and
$$H= { e, (1,2) } \
K={ e, (1,3), (1,2,3) }$$
Then
$$HK= S_3$$
but
$$(1,3)(1,2)=(1,2,3)=(1,2,3)e$$
showing that $KH$ can have at most 5 distinct elements.
$endgroup$
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
add a comment |
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',
autoActivateHeartbeat: false,
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
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043499%2fdoes-hk-g-imply-that-kh-g-when-h-k-arent-subgroups%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hopefully I didn't make any stupid mistake :)
Let $G=S_3$ and
$$H= { e, (1,2) } \
K={ e, (1,3), (1,2,3) }$$
Then
$$HK= S_3$$
but
$$(1,3)(1,2)=(1,2,3)=(1,2,3)e$$
showing that $KH$ can have at most 5 distinct elements.
$endgroup$
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
add a comment |
$begingroup$
Hopefully I didn't make any stupid mistake :)
Let $G=S_3$ and
$$H= { e, (1,2) } \
K={ e, (1,3), (1,2,3) }$$
Then
$$HK= S_3$$
but
$$(1,3)(1,2)=(1,2,3)=(1,2,3)e$$
showing that $KH$ can have at most 5 distinct elements.
$endgroup$
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
add a comment |
$begingroup$
Hopefully I didn't make any stupid mistake :)
Let $G=S_3$ and
$$H= { e, (1,2) } \
K={ e, (1,3), (1,2,3) }$$
Then
$$HK= S_3$$
but
$$(1,3)(1,2)=(1,2,3)=(1,2,3)e$$
showing that $KH$ can have at most 5 distinct elements.
$endgroup$
Hopefully I didn't make any stupid mistake :)
Let $G=S_3$ and
$$H= { e, (1,2) } \
K={ e, (1,3), (1,2,3) }$$
Then
$$HK= S_3$$
but
$$(1,3)(1,2)=(1,2,3)=(1,2,3)e$$
showing that $KH$ can have at most 5 distinct elements.
answered Dec 17 '18 at 4:05
N. S.N. S.
104k7114209
104k7114209
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
add a comment |
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
$begingroup$
Thank you N.S. This example is simple and nice.
$endgroup$
– GA316
Dec 17 '18 at 5:35
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043499%2fdoes-hk-g-imply-that-kh-g-when-h-k-arent-subgroups%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
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
$begingroup$
Conjugation perhaps?
$endgroup$
– Robert Wolfe
Dec 17 '18 at 3:44
$begingroup$
If $H$ and $K$ are not subgroups but are closed under inverses, then it's true. So you need one of them to fail to be closed under inverses.
$endgroup$
– Matt Samuel
Dec 17 '18 at 3:45