Find a subgroup of $D_{42}$ that is isomorphic to $S_3$.
$begingroup$
Note that $D_{42}$ is generated by $rho, r$ where $ord(rho) = 21$, $ord(r)= 2$. To locate a copy of $S_3$, there must be a subgroup of order $3$, which can be $e, rho^{7}, rho^{14}$. What about order $2$ elements? Inevitably, I have to introduce some reflections which will enlarge the group.
abstract-algebra
$endgroup$
add a comment |
$begingroup$
Note that $D_{42}$ is generated by $rho, r$ where $ord(rho) = 21$, $ord(r)= 2$. To locate a copy of $S_3$, there must be a subgroup of order $3$, which can be $e, rho^{7}, rho^{14}$. What about order $2$ elements? Inevitably, I have to introduce some reflections which will enlarge the group.
abstract-algebra
$endgroup$
$begingroup$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55
add a comment |
$begingroup$
Note that $D_{42}$ is generated by $rho, r$ where $ord(rho) = 21$, $ord(r)= 2$. To locate a copy of $S_3$, there must be a subgroup of order $3$, which can be $e, rho^{7}, rho^{14}$. What about order $2$ elements? Inevitably, I have to introduce some reflections which will enlarge the group.
abstract-algebra
$endgroup$
Note that $D_{42}$ is generated by $rho, r$ where $ord(rho) = 21$, $ord(r)= 2$. To locate a copy of $S_3$, there must be a subgroup of order $3$, which can be $e, rho^{7}, rho^{14}$. What about order $2$ elements? Inevitably, I have to introduce some reflections which will enlarge the group.
abstract-algebra
abstract-algebra
asked Dec 14 '18 at 17:47
kochkoch
18418
18418
$begingroup$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55
add a comment |
$begingroup$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55
$begingroup$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
$S_3$ has $3!=6$ elements and you need three more.
$1,rho^7,rho^{14},r,rrho^7,rrho^{14}$ does the trick nicely.
$endgroup$
add a comment |
$begingroup$
We have a complete classification of all possible subgroups of $D_n$:
Theorem: Every subgroup of $D_n=langle r,s rangle$ is is either cyclic or dihedral, and a complete listing of the subgroups is as follows:
(1) $langle r^drangle$, where $dmid n$, with index $2d$,
(2) $langle r^d, r^is rangle$, where $dmid n$, $0le ile d-1$, with index $d$.
Every subgroup of $D_n$ occurs exactly once in this listing.
For a proof see Theorem 3.1 of Keith Conrad's notes.
For the appropriate $d$ we obtain the subgroup $D_3=S_3$ with $6$ elements in $(2)$.
$endgroup$
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%2f3039698%2ffind-a-subgroup-of-d-42-that-is-isomorphic-to-s-3%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
$S_3$ has $3!=6$ elements and you need three more.
$1,rho^7,rho^{14},r,rrho^7,rrho^{14}$ does the trick nicely.
$endgroup$
add a comment |
$begingroup$
$S_3$ has $3!=6$ elements and you need three more.
$1,rho^7,rho^{14},r,rrho^7,rrho^{14}$ does the trick nicely.
$endgroup$
add a comment |
$begingroup$
$S_3$ has $3!=6$ elements and you need three more.
$1,rho^7,rho^{14},r,rrho^7,rrho^{14}$ does the trick nicely.
$endgroup$
$S_3$ has $3!=6$ elements and you need three more.
$1,rho^7,rho^{14},r,rrho^7,rrho^{14}$ does the trick nicely.
answered Dec 14 '18 at 17:55
Ross MillikanRoss Millikan
297k23198371
297k23198371
add a comment |
add a comment |
$begingroup$
We have a complete classification of all possible subgroups of $D_n$:
Theorem: Every subgroup of $D_n=langle r,s rangle$ is is either cyclic or dihedral, and a complete listing of the subgroups is as follows:
(1) $langle r^drangle$, where $dmid n$, with index $2d$,
(2) $langle r^d, r^is rangle$, where $dmid n$, $0le ile d-1$, with index $d$.
Every subgroup of $D_n$ occurs exactly once in this listing.
For a proof see Theorem 3.1 of Keith Conrad's notes.
For the appropriate $d$ we obtain the subgroup $D_3=S_3$ with $6$ elements in $(2)$.
$endgroup$
add a comment |
$begingroup$
We have a complete classification of all possible subgroups of $D_n$:
Theorem: Every subgroup of $D_n=langle r,s rangle$ is is either cyclic or dihedral, and a complete listing of the subgroups is as follows:
(1) $langle r^drangle$, where $dmid n$, with index $2d$,
(2) $langle r^d, r^is rangle$, where $dmid n$, $0le ile d-1$, with index $d$.
Every subgroup of $D_n$ occurs exactly once in this listing.
For a proof see Theorem 3.1 of Keith Conrad's notes.
For the appropriate $d$ we obtain the subgroup $D_3=S_3$ with $6$ elements in $(2)$.
$endgroup$
add a comment |
$begingroup$
We have a complete classification of all possible subgroups of $D_n$:
Theorem: Every subgroup of $D_n=langle r,s rangle$ is is either cyclic or dihedral, and a complete listing of the subgroups is as follows:
(1) $langle r^drangle$, where $dmid n$, with index $2d$,
(2) $langle r^d, r^is rangle$, where $dmid n$, $0le ile d-1$, with index $d$.
Every subgroup of $D_n$ occurs exactly once in this listing.
For a proof see Theorem 3.1 of Keith Conrad's notes.
For the appropriate $d$ we obtain the subgroup $D_3=S_3$ with $6$ elements in $(2)$.
$endgroup$
We have a complete classification of all possible subgroups of $D_n$:
Theorem: Every subgroup of $D_n=langle r,s rangle$ is is either cyclic or dihedral, and a complete listing of the subgroups is as follows:
(1) $langle r^drangle$, where $dmid n$, with index $2d$,
(2) $langle r^d, r^is rangle$, where $dmid n$, $0le ile d-1$, with index $d$.
Every subgroup of $D_n$ occurs exactly once in this listing.
For a proof see Theorem 3.1 of Keith Conrad's notes.
For the appropriate $d$ we obtain the subgroup $D_3=S_3$ with $6$ elements in $(2)$.
answered Dec 14 '18 at 17:56
Dietrich BurdeDietrich Burde
79.3k647103
79.3k647103
add a comment |
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%2f3039698%2ffind-a-subgroup-of-d-42-that-is-isomorphic-to-s-3%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$
Doesn't $S_3$ have 6 elements ?
$endgroup$
– Digitalis
Dec 14 '18 at 17:49
$begingroup$
Yes, and?@Digitalis
$endgroup$
– koch
Dec 14 '18 at 17:55