Finding all the conjugacy classes of $G={(1),(1234),(13)(24),(12)(34),(14)(32),(1432),(13),(24)}le S_4$ (why...












1












$begingroup$



Let $G={(1),(1234),(13)(24),(12)(34),(14)(32),(1432),(13),(24)}le S_4$ It is a subgroup and $Z(G)={(1),(13)(24)}$



Find all the conjugacy classes of $G$.




I was surprised because I didn't use the fact that they give us $Z(G)$.



But here is how I think I did it:



We know that for a transposition $tau$ and a cycle $sigma=(a_1...a_n)$ $$tausigmatau^{-1}=(tau(a_1)...tau(a_n))$$ ands since any permutation can be written as a product of cycles or a product of transpositions and using the fact that if $c_i,~iin{1,...,n}$ are cycles we can rewrite
$$tau (c_1...c_n)tau^{-1}$$ as
$$tau c_1tau^{-1}tau c_2tau^{-1}...tau c_ntau^{-1}$$ we can deduce that the action of conjugation preserves the structure of a permutation.



So the classes of permutations are made of elements that have the same structure (same kind of decomposition into cycles, like $(ab)(cd)$, $(ac)(bd)$ and $(ad)(bc)$ are all in the same class for example).



So we have the following classes:




  • ${(1)}$

  • ${(1234),(1432)}$

  • ${(12)(34),(13)(24),(14)(32)}$

  • ${(13),(24)}$


So they probably gave us $Z(G)$ for a reason, but I don 't know where I should have used it...



Edit: Actually since $(13)(24)in Z$ it should be a separate class. So instead of having the class ${(12)(34),(13)(24),(14)(32)}$ it should be broken into two classes ${(12)(34),(14)(32)}$ , $~{(13)(24)}$. So I guess this is where we have to use that information...



So now would you agree with those classes and the way I justified them?






group-theory permutations







share|cite|improve this question











$endgroup$












  • $begingroup$
    You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:26










  • $begingroup$
    In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:28










  • $begingroup$
    Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
    $endgroup$
    – John Cataldo
    Jan 5 at 15:30


















1












$begingroup$



Let $G={(1),(1234),(13)(24),(12)(34),(14)(32),(1432),(13),(24)}le S_4$ It is a subgroup and $Z(G)={(1),(13)(24)}$



Find all the conjugacy classes of $G$.




I was surprised because I didn't use the fact that they give us $Z(G)$.



But here is how I think I did it:



We know that for a transposition $tau$ and a cycle $sigma=(a_1...a_n)$ $$tausigmatau^{-1}=(tau(a_1)...tau(a_n))$$ ands since any permutation can be written as a product of cycles or a product of transpositions and using the fact that if $c_i,~iin{1,...,n}$ are cycles we can rewrite
$$tau (c_1...c_n)tau^{-1}$$ as
$$tau c_1tau^{-1}tau c_2tau^{-1}...tau c_ntau^{-1}$$ we can deduce that the action of conjugation preserves the structure of a permutation.



So the classes of permutations are made of elements that have the same structure (same kind of decomposition into cycles, like $(ab)(cd)$, $(ac)(bd)$ and $(ad)(bc)$ are all in the same class for example).



So we have the following classes:




  • ${(1)}$

  • ${(1234),(1432)}$

  • ${(12)(34),(13)(24),(14)(32)}$

  • ${(13),(24)}$


So they probably gave us $Z(G)$ for a reason, but I don 't know where I should have used it...



Edit: Actually since $(13)(24)in Z$ it should be a separate class. So instead of having the class ${(12)(34),(13)(24),(14)(32)}$ it should be broken into two classes ${(12)(34),(14)(32)}$ , $~{(13)(24)}$. So I guess this is where we have to use that information...



So now would you agree with those classes and the way I justified them?






group-theory permutations







share|cite|improve this question











$endgroup$












  • $begingroup$
    You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:26










  • $begingroup$
    In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:28










  • $begingroup$
    Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
    $endgroup$
    – John Cataldo
    Jan 5 at 15:30
















1












1








1





$begingroup$



Let $G={(1),(1234),(13)(24),(12)(34),(14)(32),(1432),(13),(24)}le S_4$ It is a subgroup and $Z(G)={(1),(13)(24)}$



Find all the conjugacy classes of $G$.




I was surprised because I didn't use the fact that they give us $Z(G)$.



But here is how I think I did it:



We know that for a transposition $tau$ and a cycle $sigma=(a_1...a_n)$ $$tausigmatau^{-1}=(tau(a_1)...tau(a_n))$$ ands since any permutation can be written as a product of cycles or a product of transpositions and using the fact that if $c_i,~iin{1,...,n}$ are cycles we can rewrite
$$tau (c_1...c_n)tau^{-1}$$ as
$$tau c_1tau^{-1}tau c_2tau^{-1}...tau c_ntau^{-1}$$ we can deduce that the action of conjugation preserves the structure of a permutation.



So the classes of permutations are made of elements that have the same structure (same kind of decomposition into cycles, like $(ab)(cd)$, $(ac)(bd)$ and $(ad)(bc)$ are all in the same class for example).



So we have the following classes:




  • ${(1)}$

  • ${(1234),(1432)}$

  • ${(12)(34),(13)(24),(14)(32)}$

  • ${(13),(24)}$


So they probably gave us $Z(G)$ for a reason, but I don 't know where I should have used it...



Edit: Actually since $(13)(24)in Z$ it should be a separate class. So instead of having the class ${(12)(34),(13)(24),(14)(32)}$ it should be broken into two classes ${(12)(34),(14)(32)}$ , $~{(13)(24)}$. So I guess this is where we have to use that information...



So now would you agree with those classes and the way I justified them?






group-theory permutations







share|cite|improve this question











$endgroup$





Let $G={(1),(1234),(13)(24),(12)(34),(14)(32),(1432),(13),(24)}le S_4$ It is a subgroup and $Z(G)={(1),(13)(24)}$



Find all the conjugacy classes of $G$.




I was surprised because I didn't use the fact that they give us $Z(G)$.



But here is how I think I did it:



We know that for a transposition $tau$ and a cycle $sigma=(a_1...a_n)$ $$tausigmatau^{-1}=(tau(a_1)...tau(a_n))$$ ands since any permutation can be written as a product of cycles or a product of transpositions and using the fact that if $c_i,~iin{1,...,n}$ are cycles we can rewrite
$$tau (c_1...c_n)tau^{-1}$$ as
$$tau c_1tau^{-1}tau c_2tau^{-1}...tau c_ntau^{-1}$$ we can deduce that the action of conjugation preserves the structure of a permutation.



So the classes of permutations are made of elements that have the same structure (same kind of decomposition into cycles, like $(ab)(cd)$, $(ac)(bd)$ and $(ad)(bc)$ are all in the same class for example).



So we have the following classes:




  • ${(1)}$

  • ${(1234),(1432)}$

  • ${(12)(34),(13)(24),(14)(32)}$

  • ${(13),(24)}$


So they probably gave us $Z(G)$ for a reason, but I don 't know where I should have used it...



Edit: Actually since $(13)(24)in Z$ it should be a separate class. So instead of having the class ${(12)(34),(13)(24),(14)(32)}$ it should be broken into two classes ${(12)(34),(14)(32)}$ , $~{(13)(24)}$. So I guess this is where we have to use that information...



So now would you agree with those classes and the way I justified them?






group-theory permutations




group-theory permutations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 5 at 20:38









the_fox

2,90231538




2,90231538










asked Jan 5 at 14:59









John CataldoJohn Cataldo

1,1931316




1,1931316












  • $begingroup$
    You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:26










  • $begingroup$
    In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:28










  • $begingroup$
    Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
    $endgroup$
    – John Cataldo
    Jan 5 at 15:30




















  • $begingroup$
    You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:26










  • $begingroup$
    In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
    $endgroup$
    – Andrés E. Caicedo
    Jan 5 at 15:28










  • $begingroup$
    Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
    $endgroup$
    – John Cataldo
    Jan 5 at 15:30


















$begingroup$
You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
$endgroup$
– Andrés E. Caicedo
Jan 5 at 15:26




$begingroup$
You are in the right track, but you haven't justified the classes you list. First you claimed a class had 3 elements. Now you claim it has 2. You haven't actually shown this to be the case. Maybe instead of a class with two elements it is 2 with one each?
$endgroup$
– Andrés E. Caicedo
Jan 5 at 15:26












$begingroup$
In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
$endgroup$
– Andrés E. Caicedo
Jan 5 at 15:28




$begingroup$
In more detail, the issue is: you need to justify that things you list in the same class actually are conjugate. Maybe having the same cycle structure is not enough. In fact, you know it is not, since you separated one of the classes in your original list into two pieces.
$endgroup$
– Andrés E. Caicedo
Jan 5 at 15:28












$begingroup$
Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
$endgroup$
– John Cataldo
Jan 5 at 15:30






$begingroup$
Yes that's true, at first I looked at sets of the form ${xgx^{-1}~:~xin S_4,~gin G}$ it should have been $xin G$
$endgroup$
– John Cataldo
Jan 5 at 15:30












1 Answer
1






active

oldest

votes


















0












$begingroup$

The list




  • ${(1)}$

  • ${(1234),(1432)}$

  • ${(12)(34),(14)(32)}$

  • ${(13),(24)}$

  • ${(13)(24)}$


Is a good candidate but it could be that some permutations are conjugate to each other by elements not in $G$. And that would prevent them from sharing a class.



So verifying if there are elements $sigma$ in $G$ that send an element of a class to another of the same class doesn't take that long. For example $(1432)(13)(1234)=(24)$ so ${13),(24)}$ is a class of $G$ because $(1432)in G$



We also get $(13)(12)(34)(13)=(14)(32)$ and $(14)(32)(1234)(14)(32)=(1432)$






share|cite|improve this answer











$endgroup$














    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%2f3062793%2ffinding-all-the-conjugacy-classes-of-g-1-1234-1324-1234-1432%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












    $begingroup$

    The list




    • ${(1)}$

    • ${(1234),(1432)}$

    • ${(12)(34),(14)(32)}$

    • ${(13),(24)}$

    • ${(13)(24)}$


    Is a good candidate but it could be that some permutations are conjugate to each other by elements not in $G$. And that would prevent them from sharing a class.



    So verifying if there are elements $sigma$ in $G$ that send an element of a class to another of the same class doesn't take that long. For example $(1432)(13)(1234)=(24)$ so ${13),(24)}$ is a class of $G$ because $(1432)in G$



    We also get $(13)(12)(34)(13)=(14)(32)$ and $(14)(32)(1234)(14)(32)=(1432)$






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      The list




      • ${(1)}$

      • ${(1234),(1432)}$

      • ${(12)(34),(14)(32)}$

      • ${(13),(24)}$

      • ${(13)(24)}$


      Is a good candidate but it could be that some permutations are conjugate to each other by elements not in $G$. And that would prevent them from sharing a class.



      So verifying if there are elements $sigma$ in $G$ that send an element of a class to another of the same class doesn't take that long. For example $(1432)(13)(1234)=(24)$ so ${13),(24)}$ is a class of $G$ because $(1432)in G$



      We also get $(13)(12)(34)(13)=(14)(32)$ and $(14)(32)(1234)(14)(32)=(1432)$






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        The list




        • ${(1)}$

        • ${(1234),(1432)}$

        • ${(12)(34),(14)(32)}$

        • ${(13),(24)}$

        • ${(13)(24)}$


        Is a good candidate but it could be that some permutations are conjugate to each other by elements not in $G$. And that would prevent them from sharing a class.



        So verifying if there are elements $sigma$ in $G$ that send an element of a class to another of the same class doesn't take that long. For example $(1432)(13)(1234)=(24)$ so ${13),(24)}$ is a class of $G$ because $(1432)in G$



        We also get $(13)(12)(34)(13)=(14)(32)$ and $(14)(32)(1234)(14)(32)=(1432)$






        share|cite|improve this answer











        $endgroup$



        The list




        • ${(1)}$

        • ${(1234),(1432)}$

        • ${(12)(34),(14)(32)}$

        • ${(13),(24)}$

        • ${(13)(24)}$


        Is a good candidate but it could be that some permutations are conjugate to each other by elements not in $G$. And that would prevent them from sharing a class.



        So verifying if there are elements $sigma$ in $G$ that send an element of a class to another of the same class doesn't take that long. For example $(1432)(13)(1234)=(24)$ so ${13),(24)}$ is a class of $G$ because $(1432)in G$



        We also get $(13)(12)(34)(13)=(14)(32)$ and $(14)(32)(1234)(14)(32)=(1432)$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 5 at 20:38









        the_fox

        2,90231538




        2,90231538










        answered Jan 5 at 15:44









        John CataldoJohn Cataldo

        1,1931316




        1,1931316






























            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%2f3062793%2ffinding-all-the-conjugacy-classes-of-g-1-1234-1324-1234-1432%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

            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

            “minimization” problem in Euclidean space related to orthonormal basis

            Image
            3 $begingroup$ I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows: Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$ . 1) For any $x in E$ , show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$ . 2) For any $(x,y) in E$ , show that $||x|| = sqrt{n}$ , $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$ The first q
            Read more