Showing $S_{n}$ is not solvable for $ngeq 5$












1












$begingroup$


I'm going through a physicist viewpoint of Galois theory and a found a lecture by Takeuchi here. In the slide 47 he showed that $S_{n}$ is not solvable for $ngeq 5$. This is the proof



Let $G$ be a group of permutations of five objects or more that
include all cyclic permutations of three elements.



$(124)(142)=e$



$(135)(153)=e$



$(123)=(124)(135)(142)(153)$



Let $H$ be an invariant normal subgroup of $G$ such that $G/H$ is cyclic. And consider the homomorphism $f:Grightarrow G/H$



$f[(124)]=x$



$f[(135)]=y$



$f[(123)]=f[(124)(135)(142)(153)]=xyx^{-1}y^{-1}=e$



Therefore $(123)in H$. This is true for any cyclic permutation of three
elements. Therefore, $G$ is not solvable.



I don't understand particularly why the fact that $(123)$ is mapped to the identity implies $(123)in H$. I would appreciate some help.






abstract-algebra group-theory galois-theory symmetric-groups







share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    I'm going through a physicist viewpoint of Galois theory and a found a lecture by Takeuchi here. In the slide 47 he showed that $S_{n}$ is not solvable for $ngeq 5$. This is the proof



    Let $G$ be a group of permutations of five objects or more that
    include all cyclic permutations of three elements.



    $(124)(142)=e$



    $(135)(153)=e$



    $(123)=(124)(135)(142)(153)$



    Let $H$ be an invariant normal subgroup of $G$ such that $G/H$ is cyclic. And consider the homomorphism $f:Grightarrow G/H$



    $f[(124)]=x$



    $f[(135)]=y$



    $f[(123)]=f[(124)(135)(142)(153)]=xyx^{-1}y^{-1}=e$



    Therefore $(123)in H$. This is true for any cyclic permutation of three
    elements. Therefore, $G$ is not solvable.



    I don't understand particularly why the fact that $(123)$ is mapped to the identity implies $(123)in H$. I would appreciate some help.






    abstract-algebra group-theory galois-theory symmetric-groups







    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      I'm going through a physicist viewpoint of Galois theory and a found a lecture by Takeuchi here. In the slide 47 he showed that $S_{n}$ is not solvable for $ngeq 5$. This is the proof



      Let $G$ be a group of permutations of five objects or more that
      include all cyclic permutations of three elements.



      $(124)(142)=e$



      $(135)(153)=e$



      $(123)=(124)(135)(142)(153)$



      Let $H$ be an invariant normal subgroup of $G$ such that $G/H$ is cyclic. And consider the homomorphism $f:Grightarrow G/H$



      $f[(124)]=x$



      $f[(135)]=y$



      $f[(123)]=f[(124)(135)(142)(153)]=xyx^{-1}y^{-1}=e$



      Therefore $(123)in H$. This is true for any cyclic permutation of three
      elements. Therefore, $G$ is not solvable.



      I don't understand particularly why the fact that $(123)$ is mapped to the identity implies $(123)in H$. I would appreciate some help.






      abstract-algebra group-theory galois-theory symmetric-groups







      share|cite|improve this question











      $endgroup$




      I'm going through a physicist viewpoint of Galois theory and a found a lecture by Takeuchi here. In the slide 47 he showed that $S_{n}$ is not solvable for $ngeq 5$. This is the proof



      Let $G$ be a group of permutations of five objects or more that
      include all cyclic permutations of three elements.



      $(124)(142)=e$



      $(135)(153)=e$



      $(123)=(124)(135)(142)(153)$



      Let $H$ be an invariant normal subgroup of $G$ such that $G/H$ is cyclic. And consider the homomorphism $f:Grightarrow G/H$



      $f[(124)]=x$



      $f[(135)]=y$



      $f[(123)]=f[(124)(135)(142)(153)]=xyx^{-1}y^{-1}=e$



      Therefore $(123)in H$. This is true for any cyclic permutation of three
      elements. Therefore, $G$ is not solvable.



      I don't understand particularly why the fact that $(123)$ is mapped to the identity implies $(123)in H$. I would appreciate some help.






      abstract-algebra group-theory galois-theory symmetric-groups




      abstract-algebra group-theory galois-theory symmetric-groups






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 25 '18 at 19:58







      Alberto Navarro

















      asked Dec 25 '18 at 19:52









      Alberto NavarroAlberto Navarro

      306




      306






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          That map from $G$ onto $G/H$ is the map $gmapsto gH$ and the identity element of $G/H$ is $H(=eH)$. So, $g(in G)$ is maped into $eH$ if and only if $gH=eH$, which means that $gin H$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Got it, thanks!
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 1:28










          • $begingroup$
            By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 6:34












          • $begingroup$
            Yes, that's it.
            $endgroup$
            – José Carlos Santos
            Dec 26 '18 at 10:54











          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%2f3052384%2fshowing-s-n-is-not-solvable-for-n-geq-5%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









          2












          $begingroup$

          That map from $G$ onto $G/H$ is the map $gmapsto gH$ and the identity element of $G/H$ is $H(=eH)$. So, $g(in G)$ is maped into $eH$ if and only if $gH=eH$, which means that $gin H$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Got it, thanks!
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 1:28










          • $begingroup$
            By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 6:34












          • $begingroup$
            Yes, that's it.
            $endgroup$
            – José Carlos Santos
            Dec 26 '18 at 10:54
















          2












          $begingroup$

          That map from $G$ onto $G/H$ is the map $gmapsto gH$ and the identity element of $G/H$ is $H(=eH)$. So, $g(in G)$ is maped into $eH$ if and only if $gH=eH$, which means that $gin H$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Got it, thanks!
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 1:28










          • $begingroup$
            By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 6:34












          • $begingroup$
            Yes, that's it.
            $endgroup$
            – José Carlos Santos
            Dec 26 '18 at 10:54














          2












          2








          2





          $begingroup$

          That map from $G$ onto $G/H$ is the map $gmapsto gH$ and the identity element of $G/H$ is $H(=eH)$. So, $g(in G)$ is maped into $eH$ if and only if $gH=eH$, which means that $gin H$.






          share|cite|improve this answer









          $endgroup$



          That map from $G$ onto $G/H$ is the map $gmapsto gH$ and the identity element of $G/H$ is $H(=eH)$. So, $g(in G)$ is maped into $eH$ if and only if $gH=eH$, which means that $gin H$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 25 '18 at 19:59









          José Carlos SantosJosé Carlos Santos

          167k22132235




          167k22132235












          • $begingroup$
            Got it, thanks!
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 1:28










          • $begingroup$
            By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 6:34












          • $begingroup$
            Yes, that's it.
            $endgroup$
            – José Carlos Santos
            Dec 26 '18 at 10:54


















          • $begingroup$
            Got it, thanks!
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 1:28










          • $begingroup$
            By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
            $endgroup$
            – Alberto Navarro
            Dec 26 '18 at 6:34












          • $begingroup$
            Yes, that's it.
            $endgroup$
            – José Carlos Santos
            Dec 26 '18 at 10:54
















          $begingroup$
          Got it, thanks!
          $endgroup$
          – Alberto Navarro
          Dec 26 '18 at 1:28




          $begingroup$
          Got it, thanks!
          $endgroup$
          – Alberto Navarro
          Dec 26 '18 at 1:28












          $begingroup$
          By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
          $endgroup$
          – Alberto Navarro
          Dec 26 '18 at 6:34






          $begingroup$
          By the way, when he says "This is true for any cyclic permutation of three elements " I'm assuming it is because for $ngeq 5$ every $3-$cycle is conjugate to $(123)$ in $A_{n}$, Is this ok?
          $endgroup$
          – Alberto Navarro
          Dec 26 '18 at 6:34














          $begingroup$
          Yes, that's it.
          $endgroup$
          – José Carlos Santos
          Dec 26 '18 at 10:54




          $begingroup$
          Yes, that's it.
          $endgroup$
          – José Carlos Santos
          Dec 26 '18 at 10:54


















          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.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3052384%2fshowing-s-n-is-not-solvable-for-n-geq-5%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

          Probability when a professor distributes a quiz and homework assignment to a class of n students.

          Image
          0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
          Read more

          Aardman Animations

          Image
          Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
          Read more

          Are they similar matrix

          Image
          0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
          Read more