Decide how many elements who commutate with this symmetric group?












-1














Let $S_3$ be the symmetric group on $lbrace 1,2,3rbrace.$ Decide how many elements who commutate with $(23)$





Permutation naturally commutes itself, with it's inverse and with the identity permutation. So that's 3.



And then I'm insecure. What shall I do next?










share|cite|improve this question





























    -1














    Let $S_3$ be the symmetric group on $lbrace 1,2,3rbrace.$ Decide how many elements who commutate with $(23)$





    Permutation naturally commutes itself, with it's inverse and with the identity permutation. So that's 3.



    And then I'm insecure. What shall I do next?










    share|cite|improve this question



























      -1












      -1








      -1







      Let $S_3$ be the symmetric group on $lbrace 1,2,3rbrace.$ Decide how many elements who commutate with $(23)$





      Permutation naturally commutes itself, with it's inverse and with the identity permutation. So that's 3.



      And then I'm insecure. What shall I do next?










      share|cite|improve this question















      Let $S_3$ be the symmetric group on $lbrace 1,2,3rbrace.$ Decide how many elements who commutate with $(23)$





      Permutation naturally commutes itself, with it's inverse and with the identity permutation. So that's 3.



      And then I'm insecure. What shall I do next?







      permutations






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 25 at 20:11









      amWhy

      191k28224439




      191k28224439










      asked Nov 25 at 19:58









      soetirl13

      114




      114






















          1 Answer
          1






          active

          oldest

          votes


















          0














          First of all, the permutation $(23)$ is the inverse of itself so you actually found only $2$ permutations that commute with it so far, not $3$. Next, $S_3$ is a very small group, it has only $6$ elements. So you can just check every element in a direct way.






          share|cite|improve this answer





















          • How is it a inverse of itself? the inverse is (32) ?
            – soetirl13
            Nov 25 at 20:08










          • $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
            – Mark
            Nov 25 at 20:09










          • Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
            – soetirl13
            Nov 25 at 20:13










          • It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
            – Mark
            Nov 25 at 20:23










          • Ahh 2. :))))) thank you
            – soetirl13
            Nov 25 at 21:06











          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%2f3013314%2fdecide-how-many-elements-who-commutate-with-this-symmetric-group%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









          0














          First of all, the permutation $(23)$ is the inverse of itself so you actually found only $2$ permutations that commute with it so far, not $3$. Next, $S_3$ is a very small group, it has only $6$ elements. So you can just check every element in a direct way.






          share|cite|improve this answer





















          • How is it a inverse of itself? the inverse is (32) ?
            – soetirl13
            Nov 25 at 20:08










          • $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
            – Mark
            Nov 25 at 20:09










          • Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
            – soetirl13
            Nov 25 at 20:13










          • It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
            – Mark
            Nov 25 at 20:23










          • Ahh 2. :))))) thank you
            – soetirl13
            Nov 25 at 21:06
















          0














          First of all, the permutation $(23)$ is the inverse of itself so you actually found only $2$ permutations that commute with it so far, not $3$. Next, $S_3$ is a very small group, it has only $6$ elements. So you can just check every element in a direct way.






          share|cite|improve this answer





















          • How is it a inverse of itself? the inverse is (32) ?
            – soetirl13
            Nov 25 at 20:08










          • $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
            – Mark
            Nov 25 at 20:09










          • Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
            – soetirl13
            Nov 25 at 20:13










          • It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
            – Mark
            Nov 25 at 20:23










          • Ahh 2. :))))) thank you
            – soetirl13
            Nov 25 at 21:06














          0












          0








          0






          First of all, the permutation $(23)$ is the inverse of itself so you actually found only $2$ permutations that commute with it so far, not $3$. Next, $S_3$ is a very small group, it has only $6$ elements. So you can just check every element in a direct way.






          share|cite|improve this answer












          First of all, the permutation $(23)$ is the inverse of itself so you actually found only $2$ permutations that commute with it so far, not $3$. Next, $S_3$ is a very small group, it has only $6$ elements. So you can just check every element in a direct way.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 25 at 20:04









          Mark

          5,955415




          5,955415












          • How is it a inverse of itself? the inverse is (32) ?
            – soetirl13
            Nov 25 at 20:08










          • $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
            – Mark
            Nov 25 at 20:09










          • Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
            – soetirl13
            Nov 25 at 20:13










          • It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
            – Mark
            Nov 25 at 20:23










          • Ahh 2. :))))) thank you
            – soetirl13
            Nov 25 at 21:06


















          • How is it a inverse of itself? the inverse is (32) ?
            – soetirl13
            Nov 25 at 20:08










          • $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
            – Mark
            Nov 25 at 20:09










          • Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
            – soetirl13
            Nov 25 at 20:13










          • It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
            – Mark
            Nov 25 at 20:23










          • Ahh 2. :))))) thank you
            – soetirl13
            Nov 25 at 21:06
















          How is it a inverse of itself? the inverse is (32) ?
          – soetirl13
          Nov 25 at 20:08




          How is it a inverse of itself? the inverse is (32) ?
          – soetirl13
          Nov 25 at 20:08












          $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
          – Mark
          Nov 25 at 20:09




          $(23)$ and $(32)$ is the same permutation. It maps $2$ to $3$, $3$ to $2$, and $1$ to itself. It's just two different ways to write the same permutation.
          – Mark
          Nov 25 at 20:09












          Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
          – soetirl13
          Nov 25 at 20:13




          Cool. Ok, so far we have 2. And then I look at {1,2,3} and therefore get, (12)(21)(23) that is 3.. So 5?
          – soetirl13
          Nov 25 at 20:13












          It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
          – Mark
          Nov 25 at 20:23




          It depends what is your knowledge in group theory. The set of permutations that commute with $(23)$ is actually a subgroup of $S_3$, so its number of elements must divide the order of $S_3$ by Lagrange's theorem. So it can't be $5$ elements. Just check all the permutations and find what the answer will be.
          – Mark
          Nov 25 at 20:23












          Ahh 2. :))))) thank you
          – soetirl13
          Nov 25 at 21:06




          Ahh 2. :))))) thank you
          – soetirl13
          Nov 25 at 21:06


















          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%2f3013314%2fdecide-how-many-elements-who-commutate-with-this-symmetric-group%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

          Ellipse (mathématiques)

          Quarter-circle Tiles

          Mont Emei