Proof of center of symmetric group












2














Can you help me finish this proof? This is what I have so far, I don't know if it's correct. Any tips on my writing or others are welcome.



"Prove that, for $n geq 3 $, the center of $S_n$ only contains $I_n$ (the identity)".



Suppose we have $sigma in S_n$ such that $sigma = (a_1,...,a_k)$.
Let $varphi in Z(S_n)$ be such that $varphi neq sigma$. We can do that because $(a_1,...,a_k)(a_1,a_2) neq (a_1,a_2)(a_1,...,a_k)$, and $(a_1,...,a_k) notin Z(S_n)$.



Then, we can write $varphi sigma = sigma varphi$. Multiplying by $varphi^{-1}$ the both terms we obtain:



$varphi sigma varphi^{-1} = sigma varphi varphi^{-1}$.



We also know that:



$varphi (a_1,...,a_k) varphi^{-1} = (varphi (a_1),...,varphi (a_k))$.



Then,



$(varphi (a_1),...,varphi (a_k)) = sigma = (a_1,...,a_k)$.



Which means that $varphi = I_n$.



New proof: (I hope this works now)



Suppose $varphi in Z(S_n)$ such that $varphi neq I_n$. We can assume that $exists i: varphi (i) neq i$ and $exists j neq i: varphi (j) = i$.



Now consider $sigma in S_n$ such that $sigma = (j,k), k in { 1,...,n } setminus { i,j }$.



Then, we have the equality $varphi sigma = sigma varphi$. Computing at $j$:





  • $sigma(varphi(j)) = sigma(i) = i$.


  • $varphi(sigma(j)) = varphi(k) neq i$, as $varphi$ is injective and $kneq j$.


Then, $varphi$ must be the identity.










share|cite|improve this question





























    2














    Can you help me finish this proof? This is what I have so far, I don't know if it's correct. Any tips on my writing or others are welcome.



    "Prove that, for $n geq 3 $, the center of $S_n$ only contains $I_n$ (the identity)".



    Suppose we have $sigma in S_n$ such that $sigma = (a_1,...,a_k)$.
    Let $varphi in Z(S_n)$ be such that $varphi neq sigma$. We can do that because $(a_1,...,a_k)(a_1,a_2) neq (a_1,a_2)(a_1,...,a_k)$, and $(a_1,...,a_k) notin Z(S_n)$.



    Then, we can write $varphi sigma = sigma varphi$. Multiplying by $varphi^{-1}$ the both terms we obtain:



    $varphi sigma varphi^{-1} = sigma varphi varphi^{-1}$.



    We also know that:



    $varphi (a_1,...,a_k) varphi^{-1} = (varphi (a_1),...,varphi (a_k))$.



    Then,



    $(varphi (a_1),...,varphi (a_k)) = sigma = (a_1,...,a_k)$.



    Which means that $varphi = I_n$.



    New proof: (I hope this works now)



    Suppose $varphi in Z(S_n)$ such that $varphi neq I_n$. We can assume that $exists i: varphi (i) neq i$ and $exists j neq i: varphi (j) = i$.



    Now consider $sigma in S_n$ such that $sigma = (j,k), k in { 1,...,n } setminus { i,j }$.



    Then, we have the equality $varphi sigma = sigma varphi$. Computing at $j$:





    • $sigma(varphi(j)) = sigma(i) = i$.


    • $varphi(sigma(j)) = varphi(k) neq i$, as $varphi$ is injective and $kneq j$.


    Then, $varphi$ must be the identity.










    share|cite|improve this question



























      2












      2








      2







      Can you help me finish this proof? This is what I have so far, I don't know if it's correct. Any tips on my writing or others are welcome.



      "Prove that, for $n geq 3 $, the center of $S_n$ only contains $I_n$ (the identity)".



      Suppose we have $sigma in S_n$ such that $sigma = (a_1,...,a_k)$.
      Let $varphi in Z(S_n)$ be such that $varphi neq sigma$. We can do that because $(a_1,...,a_k)(a_1,a_2) neq (a_1,a_2)(a_1,...,a_k)$, and $(a_1,...,a_k) notin Z(S_n)$.



      Then, we can write $varphi sigma = sigma varphi$. Multiplying by $varphi^{-1}$ the both terms we obtain:



      $varphi sigma varphi^{-1} = sigma varphi varphi^{-1}$.



      We also know that:



      $varphi (a_1,...,a_k) varphi^{-1} = (varphi (a_1),...,varphi (a_k))$.



      Then,



      $(varphi (a_1),...,varphi (a_k)) = sigma = (a_1,...,a_k)$.



      Which means that $varphi = I_n$.



      New proof: (I hope this works now)



      Suppose $varphi in Z(S_n)$ such that $varphi neq I_n$. We can assume that $exists i: varphi (i) neq i$ and $exists j neq i: varphi (j) = i$.



      Now consider $sigma in S_n$ such that $sigma = (j,k), k in { 1,...,n } setminus { i,j }$.



      Then, we have the equality $varphi sigma = sigma varphi$. Computing at $j$:





      • $sigma(varphi(j)) = sigma(i) = i$.


      • $varphi(sigma(j)) = varphi(k) neq i$, as $varphi$ is injective and $kneq j$.


      Then, $varphi$ must be the identity.










      share|cite|improve this question















      Can you help me finish this proof? This is what I have so far, I don't know if it's correct. Any tips on my writing or others are welcome.



      "Prove that, for $n geq 3 $, the center of $S_n$ only contains $I_n$ (the identity)".



      Suppose we have $sigma in S_n$ such that $sigma = (a_1,...,a_k)$.
      Let $varphi in Z(S_n)$ be such that $varphi neq sigma$. We can do that because $(a_1,...,a_k)(a_1,a_2) neq (a_1,a_2)(a_1,...,a_k)$, and $(a_1,...,a_k) notin Z(S_n)$.



      Then, we can write $varphi sigma = sigma varphi$. Multiplying by $varphi^{-1}$ the both terms we obtain:



      $varphi sigma varphi^{-1} = sigma varphi varphi^{-1}$.



      We also know that:



      $varphi (a_1,...,a_k) varphi^{-1} = (varphi (a_1),...,varphi (a_k))$.



      Then,



      $(varphi (a_1),...,varphi (a_k)) = sigma = (a_1,...,a_k)$.



      Which means that $varphi = I_n$.



      New proof: (I hope this works now)



      Suppose $varphi in Z(S_n)$ such that $varphi neq I_n$. We can assume that $exists i: varphi (i) neq i$ and $exists j neq i: varphi (j) = i$.



      Now consider $sigma in S_n$ such that $sigma = (j,k), k in { 1,...,n } setminus { i,j }$.



      Then, we have the equality $varphi sigma = sigma varphi$. Computing at $j$:





      • $sigma(varphi(j)) = sigma(i) = i$.


      • $varphi(sigma(j)) = varphi(k) neq i$, as $varphi$ is injective and $kneq j$.


      Then, $varphi$ must be the identity.







      abstract-algebra group-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 28 '18 at 17:48

























      asked Nov 28 '18 at 12:13









      Albelaski

      737




      737






















          1 Answer
          1






          active

          oldest

          votes


















          1














          Your proof is flawed. Just because $(varphi(a_1),ldots,varphi(a_k)) = (a_1, ldots, a_k)$, that does not mean that $varphi$ didn't touch the $a_i$'s; it may have cyclically permuted them.



          In addition to cyclically permute the $a_i$ (or actually not doing anything to them), $varphi$ may permute all the other elements of $S_n$ however it likes, and it will still commute with $sigma$. As an example illustrating both of these flaws, take $n = 5$ with $sigma = (123)$. Then $varphi = (123)(45)$ commutes with $sigma$, and we do have $varphisigmavarphi^{-1} = sigma$ as you (correctly) claim, but $varphi$ is not the identity permutation.



          Instead of starting with a $sigmain S_n$, I would start with a $varphiin Z(S_n)$, and if it's not the identity, construct (or find) a $sigmain S_n$ which doesn't commute with it.






          share|cite|improve this answer





















            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%2f3017075%2fproof-of-center-of-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









            1














            Your proof is flawed. Just because $(varphi(a_1),ldots,varphi(a_k)) = (a_1, ldots, a_k)$, that does not mean that $varphi$ didn't touch the $a_i$'s; it may have cyclically permuted them.



            In addition to cyclically permute the $a_i$ (or actually not doing anything to them), $varphi$ may permute all the other elements of $S_n$ however it likes, and it will still commute with $sigma$. As an example illustrating both of these flaws, take $n = 5$ with $sigma = (123)$. Then $varphi = (123)(45)$ commutes with $sigma$, and we do have $varphisigmavarphi^{-1} = sigma$ as you (correctly) claim, but $varphi$ is not the identity permutation.



            Instead of starting with a $sigmain S_n$, I would start with a $varphiin Z(S_n)$, and if it's not the identity, construct (or find) a $sigmain S_n$ which doesn't commute with it.






            share|cite|improve this answer


























              1














              Your proof is flawed. Just because $(varphi(a_1),ldots,varphi(a_k)) = (a_1, ldots, a_k)$, that does not mean that $varphi$ didn't touch the $a_i$'s; it may have cyclically permuted them.



              In addition to cyclically permute the $a_i$ (or actually not doing anything to them), $varphi$ may permute all the other elements of $S_n$ however it likes, and it will still commute with $sigma$. As an example illustrating both of these flaws, take $n = 5$ with $sigma = (123)$. Then $varphi = (123)(45)$ commutes with $sigma$, and we do have $varphisigmavarphi^{-1} = sigma$ as you (correctly) claim, but $varphi$ is not the identity permutation.



              Instead of starting with a $sigmain S_n$, I would start with a $varphiin Z(S_n)$, and if it's not the identity, construct (or find) a $sigmain S_n$ which doesn't commute with it.






              share|cite|improve this answer
























                1












                1








                1






                Your proof is flawed. Just because $(varphi(a_1),ldots,varphi(a_k)) = (a_1, ldots, a_k)$, that does not mean that $varphi$ didn't touch the $a_i$'s; it may have cyclically permuted them.



                In addition to cyclically permute the $a_i$ (or actually not doing anything to them), $varphi$ may permute all the other elements of $S_n$ however it likes, and it will still commute with $sigma$. As an example illustrating both of these flaws, take $n = 5$ with $sigma = (123)$. Then $varphi = (123)(45)$ commutes with $sigma$, and we do have $varphisigmavarphi^{-1} = sigma$ as you (correctly) claim, but $varphi$ is not the identity permutation.



                Instead of starting with a $sigmain S_n$, I would start with a $varphiin Z(S_n)$, and if it's not the identity, construct (or find) a $sigmain S_n$ which doesn't commute with it.






                share|cite|improve this answer












                Your proof is flawed. Just because $(varphi(a_1),ldots,varphi(a_k)) = (a_1, ldots, a_k)$, that does not mean that $varphi$ didn't touch the $a_i$'s; it may have cyclically permuted them.



                In addition to cyclically permute the $a_i$ (or actually not doing anything to them), $varphi$ may permute all the other elements of $S_n$ however it likes, and it will still commute with $sigma$. As an example illustrating both of these flaws, take $n = 5$ with $sigma = (123)$. Then $varphi = (123)(45)$ commutes with $sigma$, and we do have $varphisigmavarphi^{-1} = sigma$ as you (correctly) claim, but $varphi$ is not the identity permutation.



                Instead of starting with a $sigmain S_n$, I would start with a $varphiin Z(S_n)$, and if it's not the identity, construct (or find) a $sigmain S_n$ which doesn't commute with it.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 28 '18 at 12:19









                Arthur

                111k7105186




                111k7105186






























                    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%2f3017075%2fproof-of-center-of-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