group homomorphism with quotient group











up vote
-1
down vote

favorite












Exercise:
Be $n, min mathbb{N}$ natural numbers. We assume that $m$ is a divisor of $n$
,that means $n = m * k$ with a natural number $k$. Give an injective
Group homomorphism $f: (mathbb{Z} / mmathbb{Z}, +) rightarrow (mathbb{Z} / nmathbb{Z}, +)$. Conclude that
Isomorphic to a subset of $mathbb{Z} / nmathbb{Z}$ (i.e., there is a bijective)
Group homomorphism from $mathbb{Z} / mmathbb{Z}$ to a subgroup of $mathbb{Z} / nmathbb{Z}$.



Let $n, m$ as before. Give a surjective group homomorphism
$f: (mathbb{Z} / nmathbb{Z}, +) rightarrow (mathbb{Z} / mmathbb{Z}, +)$ and describe its core! How many
Elements has it?



Can i use $(mathbb{Z} / 3mathbb{Z},+) rightarrow (mathbb{Z} / 6mathbb{Z},+)$ and $a rightarrow a$ ?



i dont know how to continue










share|cite|improve this question




























    up vote
    -1
    down vote

    favorite












    Exercise:
    Be $n, min mathbb{N}$ natural numbers. We assume that $m$ is a divisor of $n$
    ,that means $n = m * k$ with a natural number $k$. Give an injective
    Group homomorphism $f: (mathbb{Z} / mmathbb{Z}, +) rightarrow (mathbb{Z} / nmathbb{Z}, +)$. Conclude that
    Isomorphic to a subset of $mathbb{Z} / nmathbb{Z}$ (i.e., there is a bijective)
    Group homomorphism from $mathbb{Z} / mmathbb{Z}$ to a subgroup of $mathbb{Z} / nmathbb{Z}$.



    Let $n, m$ as before. Give a surjective group homomorphism
    $f: (mathbb{Z} / nmathbb{Z}, +) rightarrow (mathbb{Z} / mmathbb{Z}, +)$ and describe its core! How many
    Elements has it?



    Can i use $(mathbb{Z} / 3mathbb{Z},+) rightarrow (mathbb{Z} / 6mathbb{Z},+)$ and $a rightarrow a$ ?



    i dont know how to continue










    share|cite|improve this question


























      up vote
      -1
      down vote

      favorite









      up vote
      -1
      down vote

      favorite











      Exercise:
      Be $n, min mathbb{N}$ natural numbers. We assume that $m$ is a divisor of $n$
      ,that means $n = m * k$ with a natural number $k$. Give an injective
      Group homomorphism $f: (mathbb{Z} / mmathbb{Z}, +) rightarrow (mathbb{Z} / nmathbb{Z}, +)$. Conclude that
      Isomorphic to a subset of $mathbb{Z} / nmathbb{Z}$ (i.e., there is a bijective)
      Group homomorphism from $mathbb{Z} / mmathbb{Z}$ to a subgroup of $mathbb{Z} / nmathbb{Z}$.



      Let $n, m$ as before. Give a surjective group homomorphism
      $f: (mathbb{Z} / nmathbb{Z}, +) rightarrow (mathbb{Z} / mmathbb{Z}, +)$ and describe its core! How many
      Elements has it?



      Can i use $(mathbb{Z} / 3mathbb{Z},+) rightarrow (mathbb{Z} / 6mathbb{Z},+)$ and $a rightarrow a$ ?



      i dont know how to continue










      share|cite|improve this question















      Exercise:
      Be $n, min mathbb{N}$ natural numbers. We assume that $m$ is a divisor of $n$
      ,that means $n = m * k$ with a natural number $k$. Give an injective
      Group homomorphism $f: (mathbb{Z} / mmathbb{Z}, +) rightarrow (mathbb{Z} / nmathbb{Z}, +)$. Conclude that
      Isomorphic to a subset of $mathbb{Z} / nmathbb{Z}$ (i.e., there is a bijective)
      Group homomorphism from $mathbb{Z} / mmathbb{Z}$ to a subgroup of $mathbb{Z} / nmathbb{Z}$.



      Let $n, m$ as before. Give a surjective group homomorphism
      $f: (mathbb{Z} / nmathbb{Z}, +) rightarrow (mathbb{Z} / mmathbb{Z}, +)$ and describe its core! How many
      Elements has it?



      Can i use $(mathbb{Z} / 3mathbb{Z},+) rightarrow (mathbb{Z} / 6mathbb{Z},+)$ and $a rightarrow a$ ?



      i dont know how to continue







      linear-algebra






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 17 at 22:10









      mathnoob

      1,137115




      1,137115










      asked Nov 17 at 21:08









      mimon67

      11




      11






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          0
          down vote













          Let us denote $;Bbb Z_n:=Bbb Z/nBbb Z:=left{,0,1,2,...,n-1,right};$ , when "the numbers" here are in fact the corresponding equivalence classes of residues modulo $;n;$ (maybe you're used to write them as $;overline 0,,overline1,ldots$ etc.)



          Define



          $$phi:Bbb Z_mtoBbb Z_n;,;;phi(1):= kpmod n$$



          and extend the definition naturally, meaning: for any



          $$;rinBbb Z_m;,;;r=overbrace{1+1+ldots+1}^{r;text{times}}implies phi(r)=rcdotphi(1)mod n=rkpmod n;$$



          (1) Prove the above is a homomorphism of groups



          (2) Prove that $;kerphi=0pmod m;$



          Now, you try the other direction...






          share|cite|improve this answer




























            up vote
            0
            down vote













            Suppose $n=mk$. We can define a homomorphism
            $$
            fcolonmathbb{Z}tomathbb{Z}/nmathbb{Z},qquad
            f(x)=k[x]_n
            $$

            where $[x]_n$ denotes the residue class of $x$ modulo $n$. What's the kernel of $f$? We have $xinker f$ if and only if $k[x]_n=[0]_n$, that is, $nmid kx$. This is equivalent to $mmid x$, so the kernel is $mmathbb{Z}$.



            Then, by the homomorphism theorem, $f$ induces an injective homomorphism
            $$
            bar{f}colonmathbb{Z}/mmathbb{Z}tomathbb{Z}/nmathbb{Z}
            $$

            where $bar{f}([x]_m)=k[x]_n$.



            Consider instead the surjective homomorphism $gcolonmathbb{Z}tomathbb{Z}/mmathbb{Z}$ defined by $g(x)=[x]_m$. Then, as $mmid n$, it is clear that $nmathbb{Z}subseteqker g=mmathbb{Z}$. Then, by the homomorphism theorem, $g$ induces a surjective homomorphism
            $$
            bar{g}colonmathbb{Z}/nmathbb{Z}tomathbb{Z}/mmathbb{Z},
            qquad
            bar{g}([x]_n)=[x]_m
            $$

            The kernel of $bar{g}$ is $mmathbb{Z}/nmathbb{Z}$. You can count the number of elements with Lagrange's theorem.






            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%2f3002806%2fgroup-homomorphism-with-quotient-group%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes








              up vote
              0
              down vote













              Let us denote $;Bbb Z_n:=Bbb Z/nBbb Z:=left{,0,1,2,...,n-1,right};$ , when "the numbers" here are in fact the corresponding equivalence classes of residues modulo $;n;$ (maybe you're used to write them as $;overline 0,,overline1,ldots$ etc.)



              Define



              $$phi:Bbb Z_mtoBbb Z_n;,;;phi(1):= kpmod n$$



              and extend the definition naturally, meaning: for any



              $$;rinBbb Z_m;,;;r=overbrace{1+1+ldots+1}^{r;text{times}}implies phi(r)=rcdotphi(1)mod n=rkpmod n;$$



              (1) Prove the above is a homomorphism of groups



              (2) Prove that $;kerphi=0pmod m;$



              Now, you try the other direction...






              share|cite|improve this answer

























                up vote
                0
                down vote













                Let us denote $;Bbb Z_n:=Bbb Z/nBbb Z:=left{,0,1,2,...,n-1,right};$ , when "the numbers" here are in fact the corresponding equivalence classes of residues modulo $;n;$ (maybe you're used to write them as $;overline 0,,overline1,ldots$ etc.)



                Define



                $$phi:Bbb Z_mtoBbb Z_n;,;;phi(1):= kpmod n$$



                and extend the definition naturally, meaning: for any



                $$;rinBbb Z_m;,;;r=overbrace{1+1+ldots+1}^{r;text{times}}implies phi(r)=rcdotphi(1)mod n=rkpmod n;$$



                (1) Prove the above is a homomorphism of groups



                (2) Prove that $;kerphi=0pmod m;$



                Now, you try the other direction...






                share|cite|improve this answer























                  up vote
                  0
                  down vote










                  up vote
                  0
                  down vote









                  Let us denote $;Bbb Z_n:=Bbb Z/nBbb Z:=left{,0,1,2,...,n-1,right};$ , when "the numbers" here are in fact the corresponding equivalence classes of residues modulo $;n;$ (maybe you're used to write them as $;overline 0,,overline1,ldots$ etc.)



                  Define



                  $$phi:Bbb Z_mtoBbb Z_n;,;;phi(1):= kpmod n$$



                  and extend the definition naturally, meaning: for any



                  $$;rinBbb Z_m;,;;r=overbrace{1+1+ldots+1}^{r;text{times}}implies phi(r)=rcdotphi(1)mod n=rkpmod n;$$



                  (1) Prove the above is a homomorphism of groups



                  (2) Prove that $;kerphi=0pmod m;$



                  Now, you try the other direction...






                  share|cite|improve this answer












                  Let us denote $;Bbb Z_n:=Bbb Z/nBbb Z:=left{,0,1,2,...,n-1,right};$ , when "the numbers" here are in fact the corresponding equivalence classes of residues modulo $;n;$ (maybe you're used to write them as $;overline 0,,overline1,ldots$ etc.)



                  Define



                  $$phi:Bbb Z_mtoBbb Z_n;,;;phi(1):= kpmod n$$



                  and extend the definition naturally, meaning: for any



                  $$;rinBbb Z_m;,;;r=overbrace{1+1+ldots+1}^{r;text{times}}implies phi(r)=rcdotphi(1)mod n=rkpmod n;$$



                  (1) Prove the above is a homomorphism of groups



                  (2) Prove that $;kerphi=0pmod m;$



                  Now, you try the other direction...







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 17 at 21:40









                  DonAntonio

                  176k1491224




                  176k1491224






















                      up vote
                      0
                      down vote













                      Suppose $n=mk$. We can define a homomorphism
                      $$
                      fcolonmathbb{Z}tomathbb{Z}/nmathbb{Z},qquad
                      f(x)=k[x]_n
                      $$

                      where $[x]_n$ denotes the residue class of $x$ modulo $n$. What's the kernel of $f$? We have $xinker f$ if and only if $k[x]_n=[0]_n$, that is, $nmid kx$. This is equivalent to $mmid x$, so the kernel is $mmathbb{Z}$.



                      Then, by the homomorphism theorem, $f$ induces an injective homomorphism
                      $$
                      bar{f}colonmathbb{Z}/mmathbb{Z}tomathbb{Z}/nmathbb{Z}
                      $$

                      where $bar{f}([x]_m)=k[x]_n$.



                      Consider instead the surjective homomorphism $gcolonmathbb{Z}tomathbb{Z}/mmathbb{Z}$ defined by $g(x)=[x]_m$. Then, as $mmid n$, it is clear that $nmathbb{Z}subseteqker g=mmathbb{Z}$. Then, by the homomorphism theorem, $g$ induces a surjective homomorphism
                      $$
                      bar{g}colonmathbb{Z}/nmathbb{Z}tomathbb{Z}/mmathbb{Z},
                      qquad
                      bar{g}([x]_n)=[x]_m
                      $$

                      The kernel of $bar{g}$ is $mmathbb{Z}/nmathbb{Z}$. You can count the number of elements with Lagrange's theorem.






                      share|cite|improve this answer

























                        up vote
                        0
                        down vote













                        Suppose $n=mk$. We can define a homomorphism
                        $$
                        fcolonmathbb{Z}tomathbb{Z}/nmathbb{Z},qquad
                        f(x)=k[x]_n
                        $$

                        where $[x]_n$ denotes the residue class of $x$ modulo $n$. What's the kernel of $f$? We have $xinker f$ if and only if $k[x]_n=[0]_n$, that is, $nmid kx$. This is equivalent to $mmid x$, so the kernel is $mmathbb{Z}$.



                        Then, by the homomorphism theorem, $f$ induces an injective homomorphism
                        $$
                        bar{f}colonmathbb{Z}/mmathbb{Z}tomathbb{Z}/nmathbb{Z}
                        $$

                        where $bar{f}([x]_m)=k[x]_n$.



                        Consider instead the surjective homomorphism $gcolonmathbb{Z}tomathbb{Z}/mmathbb{Z}$ defined by $g(x)=[x]_m$. Then, as $mmid n$, it is clear that $nmathbb{Z}subseteqker g=mmathbb{Z}$. Then, by the homomorphism theorem, $g$ induces a surjective homomorphism
                        $$
                        bar{g}colonmathbb{Z}/nmathbb{Z}tomathbb{Z}/mmathbb{Z},
                        qquad
                        bar{g}([x]_n)=[x]_m
                        $$

                        The kernel of $bar{g}$ is $mmathbb{Z}/nmathbb{Z}$. You can count the number of elements with Lagrange's theorem.






                        share|cite|improve this answer























                          up vote
                          0
                          down vote










                          up vote
                          0
                          down vote









                          Suppose $n=mk$. We can define a homomorphism
                          $$
                          fcolonmathbb{Z}tomathbb{Z}/nmathbb{Z},qquad
                          f(x)=k[x]_n
                          $$

                          where $[x]_n$ denotes the residue class of $x$ modulo $n$. What's the kernel of $f$? We have $xinker f$ if and only if $k[x]_n=[0]_n$, that is, $nmid kx$. This is equivalent to $mmid x$, so the kernel is $mmathbb{Z}$.



                          Then, by the homomorphism theorem, $f$ induces an injective homomorphism
                          $$
                          bar{f}colonmathbb{Z}/mmathbb{Z}tomathbb{Z}/nmathbb{Z}
                          $$

                          where $bar{f}([x]_m)=k[x]_n$.



                          Consider instead the surjective homomorphism $gcolonmathbb{Z}tomathbb{Z}/mmathbb{Z}$ defined by $g(x)=[x]_m$. Then, as $mmid n$, it is clear that $nmathbb{Z}subseteqker g=mmathbb{Z}$. Then, by the homomorphism theorem, $g$ induces a surjective homomorphism
                          $$
                          bar{g}colonmathbb{Z}/nmathbb{Z}tomathbb{Z}/mmathbb{Z},
                          qquad
                          bar{g}([x]_n)=[x]_m
                          $$

                          The kernel of $bar{g}$ is $mmathbb{Z}/nmathbb{Z}$. You can count the number of elements with Lagrange's theorem.






                          share|cite|improve this answer












                          Suppose $n=mk$. We can define a homomorphism
                          $$
                          fcolonmathbb{Z}tomathbb{Z}/nmathbb{Z},qquad
                          f(x)=k[x]_n
                          $$

                          where $[x]_n$ denotes the residue class of $x$ modulo $n$. What's the kernel of $f$? We have $xinker f$ if and only if $k[x]_n=[0]_n$, that is, $nmid kx$. This is equivalent to $mmid x$, so the kernel is $mmathbb{Z}$.



                          Then, by the homomorphism theorem, $f$ induces an injective homomorphism
                          $$
                          bar{f}colonmathbb{Z}/mmathbb{Z}tomathbb{Z}/nmathbb{Z}
                          $$

                          where $bar{f}([x]_m)=k[x]_n$.



                          Consider instead the surjective homomorphism $gcolonmathbb{Z}tomathbb{Z}/mmathbb{Z}$ defined by $g(x)=[x]_m$. Then, as $mmid n$, it is clear that $nmathbb{Z}subseteqker g=mmathbb{Z}$. Then, by the homomorphism theorem, $g$ induces a surjective homomorphism
                          $$
                          bar{g}colonmathbb{Z}/nmathbb{Z}tomathbb{Z}/mmathbb{Z},
                          qquad
                          bar{g}([x]_n)=[x]_m
                          $$

                          The kernel of $bar{g}$ is $mmathbb{Z}/nmathbb{Z}$. You can count the number of elements with Lagrange's theorem.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Nov 17 at 23:35









                          egreg

                          175k1383198




                          175k1383198






























                              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%2f3002806%2fgroup-homomorphism-with-quotient-group%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

                              AnyDesk - Fatal Program Failure

                              How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

                              QoS: MAC-Priority for clients behind a repeater