Does $X_{2n}=langle x,y|x^n=y^2=1,xy=yx^2rangle$ really have order $6$?












1














Here is the entire question:




Let $X_{2n}=langle x,ymid x^n=y^2=1,xy=yx^2rangle $ and $n=3k$ then show that $X_{2n}$ has order $6$.




Here is my question:




How do we know that $X_{2n}$ has order $6$ and not order $2$?






While tackling this question I assumed that the statement




$x^n=1$




would mean that




$x^kneq 1$ for $1leq kleq n-1$




But as you go through this problem you can prove that $x^3=1$.



Well this lead to a deeper question about the uniqueness presentations.




Sure we could have the group $G={1,x,x^2,y,yx,yx^2}$ satisfy the relation, but why doesn't $G={1,y}$ not also satify the relation?











share|cite|improve this question
























  • Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
    – lulu
    Jun 17 '17 at 19:44










  • @lulu So presentations aren't unique?
    – user160110
    Jun 17 '17 at 19:49












  • Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
    – lulu
    Jun 17 '17 at 19:51










  • @lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
    – user160110
    Jun 17 '17 at 19:52










  • Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
    – lulu
    Jun 17 '17 at 19:53
















1














Here is the entire question:




Let $X_{2n}=langle x,ymid x^n=y^2=1,xy=yx^2rangle $ and $n=3k$ then show that $X_{2n}$ has order $6$.




Here is my question:




How do we know that $X_{2n}$ has order $6$ and not order $2$?






While tackling this question I assumed that the statement




$x^n=1$




would mean that




$x^kneq 1$ for $1leq kleq n-1$




But as you go through this problem you can prove that $x^3=1$.



Well this lead to a deeper question about the uniqueness presentations.




Sure we could have the group $G={1,x,x^2,y,yx,yx^2}$ satisfy the relation, but why doesn't $G={1,y}$ not also satify the relation?











share|cite|improve this question
























  • Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
    – lulu
    Jun 17 '17 at 19:44










  • @lulu So presentations aren't unique?
    – user160110
    Jun 17 '17 at 19:49












  • Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
    – lulu
    Jun 17 '17 at 19:51










  • @lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
    – user160110
    Jun 17 '17 at 19:52










  • Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
    – lulu
    Jun 17 '17 at 19:53














1












1








1







Here is the entire question:




Let $X_{2n}=langle x,ymid x^n=y^2=1,xy=yx^2rangle $ and $n=3k$ then show that $X_{2n}$ has order $6$.




Here is my question:




How do we know that $X_{2n}$ has order $6$ and not order $2$?






While tackling this question I assumed that the statement




$x^n=1$




would mean that




$x^kneq 1$ for $1leq kleq n-1$




But as you go through this problem you can prove that $x^3=1$.



Well this lead to a deeper question about the uniqueness presentations.




Sure we could have the group $G={1,x,x^2,y,yx,yx^2}$ satisfy the relation, but why doesn't $G={1,y}$ not also satify the relation?











share|cite|improve this question















Here is the entire question:




Let $X_{2n}=langle x,ymid x^n=y^2=1,xy=yx^2rangle $ and $n=3k$ then show that $X_{2n}$ has order $6$.




Here is my question:




How do we know that $X_{2n}$ has order $6$ and not order $2$?






While tackling this question I assumed that the statement




$x^n=1$




would mean that




$x^kneq 1$ for $1leq kleq n-1$




But as you go through this problem you can prove that $x^3=1$.



Well this lead to a deeper question about the uniqueness presentations.




Sure we could have the group $G={1,x,x^2,y,yx,yx^2}$ satisfy the relation, but why doesn't $G={1,y}$ not also satify the relation?








group-theory finite-groups group-presentation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 '18 at 1:58









Shaun

8,750113680




8,750113680










asked Jun 17 '17 at 19:43









user160110

1,314716




1,314716












  • Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
    – lulu
    Jun 17 '17 at 19:44










  • @lulu So presentations aren't unique?
    – user160110
    Jun 17 '17 at 19:49












  • Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
    – lulu
    Jun 17 '17 at 19:51










  • @lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
    – user160110
    Jun 17 '17 at 19:52










  • Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
    – lulu
    Jun 17 '17 at 19:53


















  • Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
    – lulu
    Jun 17 '17 at 19:44










  • @lulu So presentations aren't unique?
    – user160110
    Jun 17 '17 at 19:49












  • Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
    – lulu
    Jun 17 '17 at 19:51










  • @lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
    – user160110
    Jun 17 '17 at 19:52










  • Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
    – lulu
    Jun 17 '17 at 19:53
















Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
– lulu
Jun 17 '17 at 19:44




Adding the relation $x=e$ changes the group. The trivial group also satisfies the relations.
– lulu
Jun 17 '17 at 19:44












@lulu So presentations aren't unique?
– user160110
Jun 17 '17 at 19:49






@lulu So presentations aren't unique?
– user160110
Jun 17 '17 at 19:49














Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
– lulu
Jun 17 '17 at 19:51




Not following. Are you asking if one group can have more than one presentation? If so, the answer is "of course". The Word Problem famously tells you that there is no algorithm for deciding if a given presentation leads to the trivial group, for example.
– lulu
Jun 17 '17 at 19:51












@lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
– user160110
Jun 17 '17 at 19:52




@lulu I am asking if a presentation can be satisfied by nonisomorpic groups.
– user160110
Jun 17 '17 at 19:52












Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
– lulu
Jun 17 '17 at 19:53




Then the answer is "of course not". In your case you added a new relation (namely $x=e$) so the presentations are not the same.
– lulu
Jun 17 '17 at 19:53















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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2326583%2fdoes-x-2n-langle-x-yxn-y2-1-xy-yx2-rangle-really-have-order-6%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




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2326583%2fdoes-x-2n-langle-x-yxn-y2-1-xy-yx2-rangle-really-have-order-6%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

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...

Berounka

I want to find a topological embedding $f : X rightarrow Y$ and $g: Y rightarrow X$, yet $X$ is not...