$A_n$ is the only subgroup of $S_n$ of index $2$.











up vote
23
down vote

favorite
16












How to prove that the only subgroup of the symmetric group $S_n$ of order $n!/2$ is $A_n$?



Why isn't there other possibility?



Thanks :)










share|cite|improve this question




















  • 4




    Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
    – Mariano Suárez-Álvarez
    Mar 14 '11 at 21:00










  • I am terribly sorry. But I don't know how to reedit it.
    – ShinyaSakai
    Mar 14 '11 at 21:07






  • 4




    There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
    – Arturo Magidin
    Mar 14 '11 at 21:11















up vote
23
down vote

favorite
16












How to prove that the only subgroup of the symmetric group $S_n$ of order $n!/2$ is $A_n$?



Why isn't there other possibility?



Thanks :)










share|cite|improve this question




















  • 4




    Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
    – Mariano Suárez-Álvarez
    Mar 14 '11 at 21:00










  • I am terribly sorry. But I don't know how to reedit it.
    – ShinyaSakai
    Mar 14 '11 at 21:07






  • 4




    There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
    – Arturo Magidin
    Mar 14 '11 at 21:11













up vote
23
down vote

favorite
16









up vote
23
down vote

favorite
16






16





How to prove that the only subgroup of the symmetric group $S_n$ of order $n!/2$ is $A_n$?



Why isn't there other possibility?



Thanks :)










share|cite|improve this question















How to prove that the only subgroup of the symmetric group $S_n$ of order $n!/2$ is $A_n$?



Why isn't there other possibility?



Thanks :)







group-theory finite-groups permutations symmetric-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 29 '16 at 10:22









mrs

1




1










asked Mar 14 '11 at 20:57









ShinyaSakai

2,96012350




2,96012350








  • 4




    Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
    – Mariano Suárez-Álvarez
    Mar 14 '11 at 21:00










  • I am terribly sorry. But I don't know how to reedit it.
    – ShinyaSakai
    Mar 14 '11 at 21:07






  • 4




    There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
    – Arturo Magidin
    Mar 14 '11 at 21:11














  • 4




    Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
    – Mariano Suárez-Álvarez
    Mar 14 '11 at 21:00










  • I am terribly sorry. But I don't know how to reedit it.
    – ShinyaSakai
    Mar 14 '11 at 21:07






  • 4




    There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
    – Arturo Magidin
    Mar 14 '11 at 21:11








4




4




Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
– Mariano Suárez-Álvarez
Mar 14 '11 at 21:00




Please make the body of your posts self-contained. The title is an indexing feature, and should not be an integral part of the message. Think of it as the title of a book on the spine; it's there to let people know what the post is about, not to impart information without which you cannot understand what is happening.
– Mariano Suárez-Álvarez
Mar 14 '11 at 21:00












I am terribly sorry. But I don't know how to reedit it.
– ShinyaSakai
Mar 14 '11 at 21:07




I am terribly sorry. But I don't know how to reedit it.
– ShinyaSakai
Mar 14 '11 at 21:07




4




4




There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
– Arturo Magidin
Mar 14 '11 at 21:11




There should be a link below the [abstract algebra] tag that says "edit". Click it, and you can edit.
– Arturo Magidin
Mar 14 '11 at 21:11










4 Answers
4






active

oldest

votes

















up vote
30
down vote



accepted










As mentioned by yoyo: if $Hsubset S_n$ is of index 2 then it is normal and $S_n/H$ is isomorphic to $C_2={1,-1}$. We thus have a surjective homomorphism $f:S_nto C_2$ with kernel $H$. All transpositions in $S_n$ are conjugate, hence $f(t)in C_2$ is the same element for every transposition $tin S_n$ (this uses the fact that $C_2$ is commutative). $S_n$ is generated by transpositions, therefore $C_2$ is generated by $f(t)$ (for any transposition $tin S_n$), therefore $f(t)=-1$, therefore ker $f=A_n$.






share|cite|improve this answer























  • Very detailed~ thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:28










  • $S_n$ in the last line, not $S_2$. Very nice solution.
    – ReverseFlow
    Sep 7 '14 at 23:41










  • @Genomeme: thanks, corrected
    – user8268
    Sep 8 '14 at 21:14






  • 1




    @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
    – jstnchng
    Nov 30 '14 at 18:49




















up vote
11
down vote













subgroups of index two are normal (exercise). $A_n$ is simple, $ngeq 5$ (exercise). if there were another subgroup $H$ of index two, then $Hcap A_n$ would be normal in $A_n$, contradiction.






share|cite|improve this answer





















  • It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:30






  • 6




    How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
    – Vladhagen
    Oct 30 '13 at 19:42


















up vote
2
down vote













I realize this question is rather old, but if this comes from Hungerford's book, there is a specific way he wants us to solve this problem, so I am providing this for the benefit of those working through Hungerford. First, one must recall that subgroups of index $2$ are normal. Hungerford's suggestion is to use the following fact:




Let $r,s$ be distinct elements of ${1,2,...,n}$. Then $A_n$ ($n ge 3$) is generated by the $3$-cycles ${(rsk) ~|~ 1 le k le n, k ne r,s}$.




Keeping that in mind, we first prove the two easy facts about subgroups of index $2$




Lemma (1): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains the square of every element in $G$.




Proof: Let $g in G$ be arbitrary. Then by Lagrange's theorem, $(gH)^2 = H$ or $g^2H=H$, happening if and only if $g^2 in H$.




Lemma (2): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains all elements of odd order.




Proof: Suppose that $g in G$ is a element of order $2k+1$ for some $k in mathbb{N}$. Then $H = g^{2k+1}H = gH cdot (g^2)^k H = gH$, where $(g^2)^k H = H$ by lemma (1). This, of course, means $g in H$.



From these two lemmas, I think it is pretty clear how one ought to use the given fact: if $H le S_n$ were a subgroup of index $2$, then it would consist of all $3$-cycles, since they have odd order. But by closure this means that $A_n le H$. Since they have the same index, they must also have the same order, implying that they are equal because we are dealing with finite sets.






share|cite|improve this answer























  • How do 3-cycles have an odd order? Or were you referring to something else?
    – Tomás Palamás
    Oct 30 at 20:14


















up vote
0
down vote













Other Way :



$A_n$ is generated by all 3 cycles in $S_n$



If $Hneq A_n$ and $|S_n:H|=2$ then atleast one 3 cycle not in H.



WLOG assume say $(123)notin H$ so $H,(123)H,(132)H$ are 3 distant cosets which is contradiction to fact that H hads index 2






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',
    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%2f27024%2fa-n-is-the-only-subgroup-of-s-n-of-index-2%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    4 Answers
    4






    active

    oldest

    votes








    4 Answers
    4






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    30
    down vote



    accepted










    As mentioned by yoyo: if $Hsubset S_n$ is of index 2 then it is normal and $S_n/H$ is isomorphic to $C_2={1,-1}$. We thus have a surjective homomorphism $f:S_nto C_2$ with kernel $H$. All transpositions in $S_n$ are conjugate, hence $f(t)in C_2$ is the same element for every transposition $tin S_n$ (this uses the fact that $C_2$ is commutative). $S_n$ is generated by transpositions, therefore $C_2$ is generated by $f(t)$ (for any transposition $tin S_n$), therefore $f(t)=-1$, therefore ker $f=A_n$.






    share|cite|improve this answer























    • Very detailed~ thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:28










    • $S_n$ in the last line, not $S_2$. Very nice solution.
      – ReverseFlow
      Sep 7 '14 at 23:41










    • @Genomeme: thanks, corrected
      – user8268
      Sep 8 '14 at 21:14






    • 1




      @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
      – jstnchng
      Nov 30 '14 at 18:49

















    up vote
    30
    down vote



    accepted










    As mentioned by yoyo: if $Hsubset S_n$ is of index 2 then it is normal and $S_n/H$ is isomorphic to $C_2={1,-1}$. We thus have a surjective homomorphism $f:S_nto C_2$ with kernel $H$. All transpositions in $S_n$ are conjugate, hence $f(t)in C_2$ is the same element for every transposition $tin S_n$ (this uses the fact that $C_2$ is commutative). $S_n$ is generated by transpositions, therefore $C_2$ is generated by $f(t)$ (for any transposition $tin S_n$), therefore $f(t)=-1$, therefore ker $f=A_n$.






    share|cite|improve this answer























    • Very detailed~ thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:28










    • $S_n$ in the last line, not $S_2$. Very nice solution.
      – ReverseFlow
      Sep 7 '14 at 23:41










    • @Genomeme: thanks, corrected
      – user8268
      Sep 8 '14 at 21:14






    • 1




      @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
      – jstnchng
      Nov 30 '14 at 18:49















    up vote
    30
    down vote



    accepted







    up vote
    30
    down vote



    accepted






    As mentioned by yoyo: if $Hsubset S_n$ is of index 2 then it is normal and $S_n/H$ is isomorphic to $C_2={1,-1}$. We thus have a surjective homomorphism $f:S_nto C_2$ with kernel $H$. All transpositions in $S_n$ are conjugate, hence $f(t)in C_2$ is the same element for every transposition $tin S_n$ (this uses the fact that $C_2$ is commutative). $S_n$ is generated by transpositions, therefore $C_2$ is generated by $f(t)$ (for any transposition $tin S_n$), therefore $f(t)=-1$, therefore ker $f=A_n$.






    share|cite|improve this answer














    As mentioned by yoyo: if $Hsubset S_n$ is of index 2 then it is normal and $S_n/H$ is isomorphic to $C_2={1,-1}$. We thus have a surjective homomorphism $f:S_nto C_2$ with kernel $H$. All transpositions in $S_n$ are conjugate, hence $f(t)in C_2$ is the same element for every transposition $tin S_n$ (this uses the fact that $C_2$ is commutative). $S_n$ is generated by transpositions, therefore $C_2$ is generated by $f(t)$ (for any transposition $tin S_n$), therefore $f(t)=-1$, therefore ker $f=A_n$.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Sep 8 '14 at 21:14

























    answered Mar 14 '11 at 23:01









    user8268

    16.7k12746




    16.7k12746












    • Very detailed~ thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:28










    • $S_n$ in the last line, not $S_2$. Very nice solution.
      – ReverseFlow
      Sep 7 '14 at 23:41










    • @Genomeme: thanks, corrected
      – user8268
      Sep 8 '14 at 21:14






    • 1




      @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
      – jstnchng
      Nov 30 '14 at 18:49




















    • Very detailed~ thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:28










    • $S_n$ in the last line, not $S_2$. Very nice solution.
      – ReverseFlow
      Sep 7 '14 at 23:41










    • @Genomeme: thanks, corrected
      – user8268
      Sep 8 '14 at 21:14






    • 1




      @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
      – jstnchng
      Nov 30 '14 at 18:49


















    Very detailed~ thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:28




    Very detailed~ thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:28












    $S_n$ in the last line, not $S_2$. Very nice solution.
    – ReverseFlow
    Sep 7 '14 at 23:41




    $S_n$ in the last line, not $S_2$. Very nice solution.
    – ReverseFlow
    Sep 7 '14 at 23:41












    @Genomeme: thanks, corrected
    – user8268
    Sep 8 '14 at 21:14




    @Genomeme: thanks, corrected
    – user8268
    Sep 8 '14 at 21:14




    1




    1




    @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
    – jstnchng
    Nov 30 '14 at 18:49






    @user8268 Can you explain how $f(t)in C_2$ is the same element for every transposition $tin S_n$, and how $S_n$ is generated by transpositions? Thank you.
    – jstnchng
    Nov 30 '14 at 18:49












    up vote
    11
    down vote













    subgroups of index two are normal (exercise). $A_n$ is simple, $ngeq 5$ (exercise). if there were another subgroup $H$ of index two, then $Hcap A_n$ would be normal in $A_n$, contradiction.






    share|cite|improve this answer





















    • It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:30






    • 6




      How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
      – Vladhagen
      Oct 30 '13 at 19:42















    up vote
    11
    down vote













    subgroups of index two are normal (exercise). $A_n$ is simple, $ngeq 5$ (exercise). if there were another subgroup $H$ of index two, then $Hcap A_n$ would be normal in $A_n$, contradiction.






    share|cite|improve this answer





















    • It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:30






    • 6




      How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
      – Vladhagen
      Oct 30 '13 at 19:42













    up vote
    11
    down vote










    up vote
    11
    down vote









    subgroups of index two are normal (exercise). $A_n$ is simple, $ngeq 5$ (exercise). if there were another subgroup $H$ of index two, then $Hcap A_n$ would be normal in $A_n$, contradiction.






    share|cite|improve this answer












    subgroups of index two are normal (exercise). $A_n$ is simple, $ngeq 5$ (exercise). if there were another subgroup $H$ of index two, then $Hcap A_n$ would be normal in $A_n$, contradiction.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Mar 14 '11 at 21:08









    yoyo

    6,5091626




    6,5091626












    • It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:30






    • 6




      How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
      – Vladhagen
      Oct 30 '13 at 19:42


















    • It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
      – ShinyaSakai
      Mar 15 '11 at 21:30






    • 6




      How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
      – Vladhagen
      Oct 30 '13 at 19:42
















    It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:30




    It is really a smart shortcut for the special case of $n geq 5$~ Thank you very much~
    – ShinyaSakai
    Mar 15 '11 at 21:30




    6




    6




    How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
    – Vladhagen
    Oct 30 '13 at 19:42




    How do you know that the intersection is not trivial? {1} is normal in every group and does not contradict simplicity. There is a way around this using conjugacy in $S_n$......
    – Vladhagen
    Oct 30 '13 at 19:42










    up vote
    2
    down vote













    I realize this question is rather old, but if this comes from Hungerford's book, there is a specific way he wants us to solve this problem, so I am providing this for the benefit of those working through Hungerford. First, one must recall that subgroups of index $2$ are normal. Hungerford's suggestion is to use the following fact:




    Let $r,s$ be distinct elements of ${1,2,...,n}$. Then $A_n$ ($n ge 3$) is generated by the $3$-cycles ${(rsk) ~|~ 1 le k le n, k ne r,s}$.




    Keeping that in mind, we first prove the two easy facts about subgroups of index $2$




    Lemma (1): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains the square of every element in $G$.




    Proof: Let $g in G$ be arbitrary. Then by Lagrange's theorem, $(gH)^2 = H$ or $g^2H=H$, happening if and only if $g^2 in H$.




    Lemma (2): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains all elements of odd order.




    Proof: Suppose that $g in G$ is a element of order $2k+1$ for some $k in mathbb{N}$. Then $H = g^{2k+1}H = gH cdot (g^2)^k H = gH$, where $(g^2)^k H = H$ by lemma (1). This, of course, means $g in H$.



    From these two lemmas, I think it is pretty clear how one ought to use the given fact: if $H le S_n$ were a subgroup of index $2$, then it would consist of all $3$-cycles, since they have odd order. But by closure this means that $A_n le H$. Since they have the same index, they must also have the same order, implying that they are equal because we are dealing with finite sets.






    share|cite|improve this answer























    • How do 3-cycles have an odd order? Or were you referring to something else?
      – Tomás Palamás
      Oct 30 at 20:14















    up vote
    2
    down vote













    I realize this question is rather old, but if this comes from Hungerford's book, there is a specific way he wants us to solve this problem, so I am providing this for the benefit of those working through Hungerford. First, one must recall that subgroups of index $2$ are normal. Hungerford's suggestion is to use the following fact:




    Let $r,s$ be distinct elements of ${1,2,...,n}$. Then $A_n$ ($n ge 3$) is generated by the $3$-cycles ${(rsk) ~|~ 1 le k le n, k ne r,s}$.




    Keeping that in mind, we first prove the two easy facts about subgroups of index $2$




    Lemma (1): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains the square of every element in $G$.




    Proof: Let $g in G$ be arbitrary. Then by Lagrange's theorem, $(gH)^2 = H$ or $g^2H=H$, happening if and only if $g^2 in H$.




    Lemma (2): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains all elements of odd order.




    Proof: Suppose that $g in G$ is a element of order $2k+1$ for some $k in mathbb{N}$. Then $H = g^{2k+1}H = gH cdot (g^2)^k H = gH$, where $(g^2)^k H = H$ by lemma (1). This, of course, means $g in H$.



    From these two lemmas, I think it is pretty clear how one ought to use the given fact: if $H le S_n$ were a subgroup of index $2$, then it would consist of all $3$-cycles, since they have odd order. But by closure this means that $A_n le H$. Since they have the same index, they must also have the same order, implying that they are equal because we are dealing with finite sets.






    share|cite|improve this answer























    • How do 3-cycles have an odd order? Or were you referring to something else?
      – Tomás Palamás
      Oct 30 at 20:14













    up vote
    2
    down vote










    up vote
    2
    down vote









    I realize this question is rather old, but if this comes from Hungerford's book, there is a specific way he wants us to solve this problem, so I am providing this for the benefit of those working through Hungerford. First, one must recall that subgroups of index $2$ are normal. Hungerford's suggestion is to use the following fact:




    Let $r,s$ be distinct elements of ${1,2,...,n}$. Then $A_n$ ($n ge 3$) is generated by the $3$-cycles ${(rsk) ~|~ 1 le k le n, k ne r,s}$.




    Keeping that in mind, we first prove the two easy facts about subgroups of index $2$




    Lemma (1): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains the square of every element in $G$.




    Proof: Let $g in G$ be arbitrary. Then by Lagrange's theorem, $(gH)^2 = H$ or $g^2H=H$, happening if and only if $g^2 in H$.




    Lemma (2): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains all elements of odd order.




    Proof: Suppose that $g in G$ is a element of order $2k+1$ for some $k in mathbb{N}$. Then $H = g^{2k+1}H = gH cdot (g^2)^k H = gH$, where $(g^2)^k H = H$ by lemma (1). This, of course, means $g in H$.



    From these two lemmas, I think it is pretty clear how one ought to use the given fact: if $H le S_n$ were a subgroup of index $2$, then it would consist of all $3$-cycles, since they have odd order. But by closure this means that $A_n le H$. Since they have the same index, they must also have the same order, implying that they are equal because we are dealing with finite sets.






    share|cite|improve this answer














    I realize this question is rather old, but if this comes from Hungerford's book, there is a specific way he wants us to solve this problem, so I am providing this for the benefit of those working through Hungerford. First, one must recall that subgroups of index $2$ are normal. Hungerford's suggestion is to use the following fact:




    Let $r,s$ be distinct elements of ${1,2,...,n}$. Then $A_n$ ($n ge 3$) is generated by the $3$-cycles ${(rsk) ~|~ 1 le k le n, k ne r,s}$.




    Keeping that in mind, we first prove the two easy facts about subgroups of index $2$




    Lemma (1): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains the square of every element in $G$.




    Proof: Let $g in G$ be arbitrary. Then by Lagrange's theorem, $(gH)^2 = H$ or $g^2H=H$, happening if and only if $g^2 in H$.




    Lemma (2): If $H$ is a subgroup of index $2$ in $G$, then $H$ contains all elements of odd order.




    Proof: Suppose that $g in G$ is a element of order $2k+1$ for some $k in mathbb{N}$. Then $H = g^{2k+1}H = gH cdot (g^2)^k H = gH$, where $(g^2)^k H = H$ by lemma (1). This, of course, means $g in H$.



    From these two lemmas, I think it is pretty clear how one ought to use the given fact: if $H le S_n$ were a subgroup of index $2$, then it would consist of all $3$-cycles, since they have odd order. But by closure this means that $A_n le H$. Since they have the same index, they must also have the same order, implying that they are equal because we are dealing with finite sets.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited May 3 '17 at 18:23

























    answered May 3 '17 at 18:09









    user193319

    2,3122923




    2,3122923












    • How do 3-cycles have an odd order? Or were you referring to something else?
      – Tomás Palamás
      Oct 30 at 20:14


















    • How do 3-cycles have an odd order? Or were you referring to something else?
      – Tomás Palamás
      Oct 30 at 20:14
















    How do 3-cycles have an odd order? Or were you referring to something else?
    – Tomás Palamás
    Oct 30 at 20:14




    How do 3-cycles have an odd order? Or were you referring to something else?
    – Tomás Palamás
    Oct 30 at 20:14










    up vote
    0
    down vote













    Other Way :



    $A_n$ is generated by all 3 cycles in $S_n$



    If $Hneq A_n$ and $|S_n:H|=2$ then atleast one 3 cycle not in H.



    WLOG assume say $(123)notin H$ so $H,(123)H,(132)H$ are 3 distant cosets which is contradiction to fact that H hads index 2






    share|cite|improve this answer

























      up vote
      0
      down vote













      Other Way :



      $A_n$ is generated by all 3 cycles in $S_n$



      If $Hneq A_n$ and $|S_n:H|=2$ then atleast one 3 cycle not in H.



      WLOG assume say $(123)notin H$ so $H,(123)H,(132)H$ are 3 distant cosets which is contradiction to fact that H hads index 2






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Other Way :



        $A_n$ is generated by all 3 cycles in $S_n$



        If $Hneq A_n$ and $|S_n:H|=2$ then atleast one 3 cycle not in H.



        WLOG assume say $(123)notin H$ so $H,(123)H,(132)H$ are 3 distant cosets which is contradiction to fact that H hads index 2






        share|cite|improve this answer












        Other Way :



        $A_n$ is generated by all 3 cycles in $S_n$



        If $Hneq A_n$ and $|S_n:H|=2$ then atleast one 3 cycle not in H.



        WLOG assume say $(123)notin H$ so $H,(123)H,(132)H$ are 3 distant cosets which is contradiction to fact that H hads index 2







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 21 at 15:24









        Shubham

        1,5941519




        1,5941519






























            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%2f27024%2fa-n-is-the-only-subgroup-of-s-n-of-index-2%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