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












1















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
























  • 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?
    – Andrés E. Caicedo
    2 days ago










  • 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.
    – Andrés E. Caicedo
    2 days ago










  • 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$
    – John Cataldo
    2 days ago


















1















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
























  • 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?
    – Andrés E. Caicedo
    2 days ago










  • 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.
    – Andrés E. Caicedo
    2 days ago










  • 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$
    – John Cataldo
    2 days ago
















1












1








1








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
















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 2 days ago









the_fox

2,50511431




2,50511431










asked 2 days ago









John CataldoJohn Cataldo

1,0961216




1,0961216












  • 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?
    – Andrés E. Caicedo
    2 days ago










  • 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.
    – Andrés E. Caicedo
    2 days ago










  • 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$
    – John Cataldo
    2 days ago




















  • 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?
    – Andrés E. Caicedo
    2 days ago










  • 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.
    – Andrés E. Caicedo
    2 days ago










  • 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$
    – John Cataldo
    2 days ago


















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?
– Andrés E. Caicedo
2 days ago




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?
– Andrés E. Caicedo
2 days ago












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.
– Andrés E. Caicedo
2 days ago




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.
– Andrés E. Caicedo
2 days ago












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$
– John Cataldo
2 days ago






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$
– John Cataldo
2 days ago












1 Answer
1






active

oldest

votes


















0














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























    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














    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




























      0














      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


























        0












        0








        0






        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














        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 2 days ago









        the_fox

        2,50511431




        2,50511431










        answered 2 days ago









        John CataldoJohn Cataldo

        1,0961216




        1,0961216






























            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%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

            Mario Kart Wii

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
            Read more

            The Binding of Isaac: Rebirth/Afterbirth

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
            Read more

            What does “Dominus providebit” mean?

            Image
            5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
            Read more