A group with an infinite cyclic normal subgroup that has a finite cyclic quotient is abelian

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite












Let $G$ be a group with a normal subgroup $N$ such that $N$ is isomorphic to $mathbbZ.$ Also suppose that $G/N$ is isomorphic to $mathbbZ/nmathbbZ$ for some integer $n geq 2.$ I need to show that if $n$ is odd, then $G$ is abelian. The following is my attempt:



Because $N$ is infinite cyclic, we have that $N = langle t rangle$ for some element $t in G.$ As $G/N$ is finite cyclic, we have that $G/N = langle sN rangle$ for some $s in G,$ where $s^n in N.$



Then $G$ is generated by $s,t,$ so to show $G$ is abelian, it suffices to show that the two generators commute.



Consider the element $st in sN.$ As $N$ is normal, $st in Ns,$ so $st = t^is$ for some integer $i$. However, I don't know how to proceed any further. In particular, I'm not sure how I am supposed to use the fact that $n$ is odd. The only difference between odd-order cyclic groups and even-order cyclic groups I can think of is that in an odd-order cyclic group, every nontrivial element has an inverse different from itself (which doesn't seem very useful here).



Any help would be much appreciated!










share|cite|improve this question





















  • i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
    – Kenny Lau
    Aug 13 at 7:51






  • 4




    The important point here is that the automorphism group of $mathbb Z$ has order $2$.
    – Derek Holt
    Aug 13 at 7:54














up vote
5
down vote

favorite












Let $G$ be a group with a normal subgroup $N$ such that $N$ is isomorphic to $mathbbZ.$ Also suppose that $G/N$ is isomorphic to $mathbbZ/nmathbbZ$ for some integer $n geq 2.$ I need to show that if $n$ is odd, then $G$ is abelian. The following is my attempt:



Because $N$ is infinite cyclic, we have that $N = langle t rangle$ for some element $t in G.$ As $G/N$ is finite cyclic, we have that $G/N = langle sN rangle$ for some $s in G,$ where $s^n in N.$



Then $G$ is generated by $s,t,$ so to show $G$ is abelian, it suffices to show that the two generators commute.



Consider the element $st in sN.$ As $N$ is normal, $st in Ns,$ so $st = t^is$ for some integer $i$. However, I don't know how to proceed any further. In particular, I'm not sure how I am supposed to use the fact that $n$ is odd. The only difference between odd-order cyclic groups and even-order cyclic groups I can think of is that in an odd-order cyclic group, every nontrivial element has an inverse different from itself (which doesn't seem very useful here).



Any help would be much appreciated!










share|cite|improve this question





















  • i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
    – Kenny Lau
    Aug 13 at 7:51






  • 4




    The important point here is that the automorphism group of $mathbb Z$ has order $2$.
    – Derek Holt
    Aug 13 at 7:54












up vote
5
down vote

favorite









up vote
5
down vote

favorite











Let $G$ be a group with a normal subgroup $N$ such that $N$ is isomorphic to $mathbbZ.$ Also suppose that $G/N$ is isomorphic to $mathbbZ/nmathbbZ$ for some integer $n geq 2.$ I need to show that if $n$ is odd, then $G$ is abelian. The following is my attempt:



Because $N$ is infinite cyclic, we have that $N = langle t rangle$ for some element $t in G.$ As $G/N$ is finite cyclic, we have that $G/N = langle sN rangle$ for some $s in G,$ where $s^n in N.$



Then $G$ is generated by $s,t,$ so to show $G$ is abelian, it suffices to show that the two generators commute.



Consider the element $st in sN.$ As $N$ is normal, $st in Ns,$ so $st = t^is$ for some integer $i$. However, I don't know how to proceed any further. In particular, I'm not sure how I am supposed to use the fact that $n$ is odd. The only difference between odd-order cyclic groups and even-order cyclic groups I can think of is that in an odd-order cyclic group, every nontrivial element has an inverse different from itself (which doesn't seem very useful here).



Any help would be much appreciated!










share|cite|improve this question













Let $G$ be a group with a normal subgroup $N$ such that $N$ is isomorphic to $mathbbZ.$ Also suppose that $G/N$ is isomorphic to $mathbbZ/nmathbbZ$ for some integer $n geq 2.$ I need to show that if $n$ is odd, then $G$ is abelian. The following is my attempt:



Because $N$ is infinite cyclic, we have that $N = langle t rangle$ for some element $t in G.$ As $G/N$ is finite cyclic, we have that $G/N = langle sN rangle$ for some $s in G,$ where $s^n in N.$



Then $G$ is generated by $s,t,$ so to show $G$ is abelian, it suffices to show that the two generators commute.



Consider the element $st in sN.$ As $N$ is normal, $st in Ns,$ so $st = t^is$ for some integer $i$. However, I don't know how to proceed any further. In particular, I'm not sure how I am supposed to use the fact that $n$ is odd. The only difference between odd-order cyclic groups and even-order cyclic groups I can think of is that in an odd-order cyclic group, every nontrivial element has an inverse different from itself (which doesn't seem very useful here).



Any help would be much appreciated!







group-theory abelian-groups normal-subgroups






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Aug 13 at 7:16









dhk628

1,031513




1,031513











  • i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
    – Kenny Lau
    Aug 13 at 7:51






  • 4




    The important point here is that the automorphism group of $mathbb Z$ has order $2$.
    – Derek Holt
    Aug 13 at 7:54
















  • i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
    – Kenny Lau
    Aug 13 at 7:51






  • 4




    The important point here is that the automorphism group of $mathbb Z$ has order $2$.
    – Derek Holt
    Aug 13 at 7:54















i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
– Kenny Lau
Aug 13 at 7:51




i.e. solving $0 to Bbb Z to G to Bbb Z/nBbb Z to 0$
– Kenny Lau
Aug 13 at 7:51




4




4




The important point here is that the automorphism group of $mathbb Z$ has order $2$.
– Derek Holt
Aug 13 at 7:54




The important point here is that the automorphism group of $mathbb Z$ has order $2$.
– Derek Holt
Aug 13 at 7:54










1 Answer
1






active

oldest

votes

















up vote
5
down vote



accepted










Let $gin G$, and consider the action $phi_g$ on $N$. $N$ is normal, so $phi_g$ is an automorphism. Moreover, $g^nin N$ implies that $phi_g^n=(phi_g)^n=textid_N$, because $N$ was abelian. Finally, because $Ncongmathbb Z$, $phi_g$ depends exactly on where it sent a generator $t$. If $phi_g(t)=t^-1$ for any $g$, then $t^(-1)^n=t$. But $n$ was odd, so that would mean $t^-1=t$, a contradiction. So $phi_g(t)=t$ for each $g$, so in particular $gt=tg$ for each $gin G$. So each $g$ commutes with all the generators of $N$, so $Nsubseteq Z(G)$, so $G/Z(G)hookrightarrow mathbb Z/nmathbb Z$, so it is cyclic. So $G/Z(G)$ is cyclic, so $G$ must be Abelian.






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: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2881090%2fa-group-with-an-infinite-cyclic-normal-subgroup-that-has-a-finite-cyclic-quotien%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    5
    down vote



    accepted










    Let $gin G$, and consider the action $phi_g$ on $N$. $N$ is normal, so $phi_g$ is an automorphism. Moreover, $g^nin N$ implies that $phi_g^n=(phi_g)^n=textid_N$, because $N$ was abelian. Finally, because $Ncongmathbb Z$, $phi_g$ depends exactly on where it sent a generator $t$. If $phi_g(t)=t^-1$ for any $g$, then $t^(-1)^n=t$. But $n$ was odd, so that would mean $t^-1=t$, a contradiction. So $phi_g(t)=t$ for each $g$, so in particular $gt=tg$ for each $gin G$. So each $g$ commutes with all the generators of $N$, so $Nsubseteq Z(G)$, so $G/Z(G)hookrightarrow mathbb Z/nmathbb Z$, so it is cyclic. So $G/Z(G)$ is cyclic, so $G$ must be Abelian.






    share|cite|improve this answer
























      up vote
      5
      down vote



      accepted










      Let $gin G$, and consider the action $phi_g$ on $N$. $N$ is normal, so $phi_g$ is an automorphism. Moreover, $g^nin N$ implies that $phi_g^n=(phi_g)^n=textid_N$, because $N$ was abelian. Finally, because $Ncongmathbb Z$, $phi_g$ depends exactly on where it sent a generator $t$. If $phi_g(t)=t^-1$ for any $g$, then $t^(-1)^n=t$. But $n$ was odd, so that would mean $t^-1=t$, a contradiction. So $phi_g(t)=t$ for each $g$, so in particular $gt=tg$ for each $gin G$. So each $g$ commutes with all the generators of $N$, so $Nsubseteq Z(G)$, so $G/Z(G)hookrightarrow mathbb Z/nmathbb Z$, so it is cyclic. So $G/Z(G)$ is cyclic, so $G$ must be Abelian.






      share|cite|improve this answer






















        up vote
        5
        down vote



        accepted







        up vote
        5
        down vote



        accepted






        Let $gin G$, and consider the action $phi_g$ on $N$. $N$ is normal, so $phi_g$ is an automorphism. Moreover, $g^nin N$ implies that $phi_g^n=(phi_g)^n=textid_N$, because $N$ was abelian. Finally, because $Ncongmathbb Z$, $phi_g$ depends exactly on where it sent a generator $t$. If $phi_g(t)=t^-1$ for any $g$, then $t^(-1)^n=t$. But $n$ was odd, so that would mean $t^-1=t$, a contradiction. So $phi_g(t)=t$ for each $g$, so in particular $gt=tg$ for each $gin G$. So each $g$ commutes with all the generators of $N$, so $Nsubseteq Z(G)$, so $G/Z(G)hookrightarrow mathbb Z/nmathbb Z$, so it is cyclic. So $G/Z(G)$ is cyclic, so $G$ must be Abelian.






        share|cite|improve this answer












        Let $gin G$, and consider the action $phi_g$ on $N$. $N$ is normal, so $phi_g$ is an automorphism. Moreover, $g^nin N$ implies that $phi_g^n=(phi_g)^n=textid_N$, because $N$ was abelian. Finally, because $Ncongmathbb Z$, $phi_g$ depends exactly on where it sent a generator $t$. If $phi_g(t)=t^-1$ for any $g$, then $t^(-1)^n=t$. But $n$ was odd, so that would mean $t^-1=t$, a contradiction. So $phi_g(t)=t$ for each $g$, so in particular $gt=tg$ for each $gin G$. So each $g$ commutes with all the generators of $N$, so $Nsubseteq Z(G)$, so $G/Z(G)hookrightarrow mathbb Z/nmathbb Z$, so it is cyclic. So $G/Z(G)$ is cyclic, so $G$ must be Abelian.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 13 at 7:58









        Ashwin Trisal

        9741515




        9741515



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2881090%2fa-group-with-an-infinite-cyclic-normal-subgroup-that-has-a-finite-cyclic-quotien%23new-answer', 'question_page');

            );

            Post as a guest













































































            Popular posts from this blog

            How to check contact read email or not when send email to Individual?

            Christian Cage

            How to properly install USB display driver for Fresco Logic FL2000DX on Ubuntu?