Homomorphism $x^i mapsto y^i$ and the order of $x$ and $y$












1












$begingroup$


I am trying to answer the following question:




Let $G$ and $H$ be two cyclic groups generated by $x$ and $y$
respectively. Determine the condition on the orders $m$ and $n$ of $x$ and
$y$ so that the map $f(x^i)= y^i$ is a homomorphism.




How I attempted to solve the question in the following way:
Let $r$ and $s$ be two arbitrary integers. Then
$$f(x^rx^s) = f(x^{r+s})=y^{r+s}=y^ry^s=f(x^r)f(x^s)$$
Since we made no assumptions about the orders of $x$ and $y$, $f$ is an homomorphism from $G$ to $H$ no matter what the orders of $x$ and $y$ are.



I don't feel confident with my proof and I would love for someone to check it. Finally, I am aware there are some theorems about the order elements of a groups but I am supposed to solve the problem without them.










share|cite|improve this question











$endgroup$












  • $begingroup$
    In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
    $endgroup$
    – Steve Kass
    Jan 20 at 1:23










  • $begingroup$
    But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
    $endgroup$
    – Lazarus
    Jan 20 at 1:31












  • $begingroup$
    It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
    $endgroup$
    – Steve Kass
    Jan 20 at 1:36


















1












$begingroup$


I am trying to answer the following question:




Let $G$ and $H$ be two cyclic groups generated by $x$ and $y$
respectively. Determine the condition on the orders $m$ and $n$ of $x$ and
$y$ so that the map $f(x^i)= y^i$ is a homomorphism.




How I attempted to solve the question in the following way:
Let $r$ and $s$ be two arbitrary integers. Then
$$f(x^rx^s) = f(x^{r+s})=y^{r+s}=y^ry^s=f(x^r)f(x^s)$$
Since we made no assumptions about the orders of $x$ and $y$, $f$ is an homomorphism from $G$ to $H$ no matter what the orders of $x$ and $y$ are.



I don't feel confident with my proof and I would love for someone to check it. Finally, I am aware there are some theorems about the order elements of a groups but I am supposed to solve the problem without them.










share|cite|improve this question











$endgroup$












  • $begingroup$
    In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
    $endgroup$
    – Steve Kass
    Jan 20 at 1:23










  • $begingroup$
    But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
    $endgroup$
    – Lazarus
    Jan 20 at 1:31












  • $begingroup$
    It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
    $endgroup$
    – Steve Kass
    Jan 20 at 1:36
















1












1








1


1



$begingroup$


I am trying to answer the following question:




Let $G$ and $H$ be two cyclic groups generated by $x$ and $y$
respectively. Determine the condition on the orders $m$ and $n$ of $x$ and
$y$ so that the map $f(x^i)= y^i$ is a homomorphism.




How I attempted to solve the question in the following way:
Let $r$ and $s$ be two arbitrary integers. Then
$$f(x^rx^s) = f(x^{r+s})=y^{r+s}=y^ry^s=f(x^r)f(x^s)$$
Since we made no assumptions about the orders of $x$ and $y$, $f$ is an homomorphism from $G$ to $H$ no matter what the orders of $x$ and $y$ are.



I don't feel confident with my proof and I would love for someone to check it. Finally, I am aware there are some theorems about the order elements of a groups but I am supposed to solve the problem without them.










share|cite|improve this question











$endgroup$




I am trying to answer the following question:




Let $G$ and $H$ be two cyclic groups generated by $x$ and $y$
respectively. Determine the condition on the orders $m$ and $n$ of $x$ and
$y$ so that the map $f(x^i)= y^i$ is a homomorphism.




How I attempted to solve the question in the following way:
Let $r$ and $s$ be two arbitrary integers. Then
$$f(x^rx^s) = f(x^{r+s})=y^{r+s}=y^ry^s=f(x^r)f(x^s)$$
Since we made no assumptions about the orders of $x$ and $y$, $f$ is an homomorphism from $G$ to $H$ no matter what the orders of $x$ and $y$ are.



I don't feel confident with my proof and I would love for someone to check it. Finally, I am aware there are some theorems about the order elements of a groups but I am supposed to solve the problem without them.







abstract-algebra group-theory finite-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 20 at 1:21







Lazarus

















asked Jan 20 at 1:06









LazarusLazarus

11217




11217












  • $begingroup$
    In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
    $endgroup$
    – Steve Kass
    Jan 20 at 1:23










  • $begingroup$
    But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
    $endgroup$
    – Lazarus
    Jan 20 at 1:31












  • $begingroup$
    It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
    $endgroup$
    – Steve Kass
    Jan 20 at 1:36




















  • $begingroup$
    In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
    $endgroup$
    – Steve Kass
    Jan 20 at 1:23










  • $begingroup$
    But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
    $endgroup$
    – Lazarus
    Jan 20 at 1:31












  • $begingroup$
    It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
    $endgroup$
    – Steve Kass
    Jan 20 at 1:36


















$begingroup$
In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
$endgroup$
– Steve Kass
Jan 20 at 1:23




$begingroup$
In order to show that $f$ is a homomorphism, you need to show that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1, x_2in G$, not just for $x_1, x_2$ equal to powers or some particular element of $G$.
$endgroup$
– Steve Kass
Jan 20 at 1:23












$begingroup$
But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
$endgroup$
– Lazarus
Jan 20 at 1:31






$begingroup$
But isn't it true that because $G=langle x rangle$ all the elements in $G$ are powers of a particular element of $G$ (namely $x$), and therefore proving $f(x^rx^s) = f(x^r)f(x^s)$ for arbitrary $r$ and $s$ is equivalent to prove it for that $f(x_1x_2)=f(x_1)f(x_2)$ for all $x_1,x_2 in G$?
$endgroup$
– Lazarus
Jan 20 at 1:31














$begingroup$
It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
$endgroup$
– Steve Kass
Jan 20 at 1:36






$begingroup$
It’s not true that $G=langle xrangle$ for every $xin G$. (In my first comment, I misspelled “of” as “or.”)
$endgroup$
– Steve Kass
Jan 20 at 1:36












1 Answer
1






active

oldest

votes


















1












$begingroup$

Let $g_1, g_2 in G$. We then have that $g_1=x^{k_1}$ and $g_2=x^{k_2}$ for $k_1,k_2 in mathbb{Z}$. Let $f$ be a homomorphism. Then
$$f(g_1g_2)=f(x^{k_1}x^{k_2})=f(x^{k_1+k_2})=f(g_1)f(g_2)=f(x^{k_1})(x^{k_2})=y^{k_1}y^{k_2}=y^{k_1+k_2}.$$



Further, recall that for any group homomorphism $varphi: G to H$ that for $g in G$ we have that $|varphi(g)|$ divides $|g|$.



Thus from above we must have that $|y^{k_1+k_2}|$ divides $|x^{k_1+k_2}|$. And since $G=langle x rangle$ and $H=langle y rangle$ with $|x|=m$ and $|y|=n$, it clearly follows that $G cong mathbb{Z}/mmathbb{Z}$ and $H cong mathbb{Z}/nmathbb{Z}$. Therefore
$$|y^{k_1+k_2}|=frac{n}{gcd(k_1+k_2,n)},$$
$$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}.$$
Using that the first expression divides the second, we have for $r in mathbb{Z}$
$$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}=|y^{k_1+k_2}|cdot r = frac{nr}{gcd(k_1+k_2,n)}$$
Providing us with
$$m=frac{gcd(k_1+k_2,m)}{gcd(k_1+k_2,n)} cdot nr$$






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%2f3080043%2fhomomorphism-xi-mapsto-yi-and-the-order-of-x-and-y%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









    1












    $begingroup$

    Let $g_1, g_2 in G$. We then have that $g_1=x^{k_1}$ and $g_2=x^{k_2}$ for $k_1,k_2 in mathbb{Z}$. Let $f$ be a homomorphism. Then
    $$f(g_1g_2)=f(x^{k_1}x^{k_2})=f(x^{k_1+k_2})=f(g_1)f(g_2)=f(x^{k_1})(x^{k_2})=y^{k_1}y^{k_2}=y^{k_1+k_2}.$$



    Further, recall that for any group homomorphism $varphi: G to H$ that for $g in G$ we have that $|varphi(g)|$ divides $|g|$.



    Thus from above we must have that $|y^{k_1+k_2}|$ divides $|x^{k_1+k_2}|$. And since $G=langle x rangle$ and $H=langle y rangle$ with $|x|=m$ and $|y|=n$, it clearly follows that $G cong mathbb{Z}/mmathbb{Z}$ and $H cong mathbb{Z}/nmathbb{Z}$. Therefore
    $$|y^{k_1+k_2}|=frac{n}{gcd(k_1+k_2,n)},$$
    $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}.$$
    Using that the first expression divides the second, we have for $r in mathbb{Z}$
    $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}=|y^{k_1+k_2}|cdot r = frac{nr}{gcd(k_1+k_2,n)}$$
    Providing us with
    $$m=frac{gcd(k_1+k_2,m)}{gcd(k_1+k_2,n)} cdot nr$$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Let $g_1, g_2 in G$. We then have that $g_1=x^{k_1}$ and $g_2=x^{k_2}$ for $k_1,k_2 in mathbb{Z}$. Let $f$ be a homomorphism. Then
      $$f(g_1g_2)=f(x^{k_1}x^{k_2})=f(x^{k_1+k_2})=f(g_1)f(g_2)=f(x^{k_1})(x^{k_2})=y^{k_1}y^{k_2}=y^{k_1+k_2}.$$



      Further, recall that for any group homomorphism $varphi: G to H$ that for $g in G$ we have that $|varphi(g)|$ divides $|g|$.



      Thus from above we must have that $|y^{k_1+k_2}|$ divides $|x^{k_1+k_2}|$. And since $G=langle x rangle$ and $H=langle y rangle$ with $|x|=m$ and $|y|=n$, it clearly follows that $G cong mathbb{Z}/mmathbb{Z}$ and $H cong mathbb{Z}/nmathbb{Z}$. Therefore
      $$|y^{k_1+k_2}|=frac{n}{gcd(k_1+k_2,n)},$$
      $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}.$$
      Using that the first expression divides the second, we have for $r in mathbb{Z}$
      $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}=|y^{k_1+k_2}|cdot r = frac{nr}{gcd(k_1+k_2,n)}$$
      Providing us with
      $$m=frac{gcd(k_1+k_2,m)}{gcd(k_1+k_2,n)} cdot nr$$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Let $g_1, g_2 in G$. We then have that $g_1=x^{k_1}$ and $g_2=x^{k_2}$ for $k_1,k_2 in mathbb{Z}$. Let $f$ be a homomorphism. Then
        $$f(g_1g_2)=f(x^{k_1}x^{k_2})=f(x^{k_1+k_2})=f(g_1)f(g_2)=f(x^{k_1})(x^{k_2})=y^{k_1}y^{k_2}=y^{k_1+k_2}.$$



        Further, recall that for any group homomorphism $varphi: G to H$ that for $g in G$ we have that $|varphi(g)|$ divides $|g|$.



        Thus from above we must have that $|y^{k_1+k_2}|$ divides $|x^{k_1+k_2}|$. And since $G=langle x rangle$ and $H=langle y rangle$ with $|x|=m$ and $|y|=n$, it clearly follows that $G cong mathbb{Z}/mmathbb{Z}$ and $H cong mathbb{Z}/nmathbb{Z}$. Therefore
        $$|y^{k_1+k_2}|=frac{n}{gcd(k_1+k_2,n)},$$
        $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}.$$
        Using that the first expression divides the second, we have for $r in mathbb{Z}$
        $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}=|y^{k_1+k_2}|cdot r = frac{nr}{gcd(k_1+k_2,n)}$$
        Providing us with
        $$m=frac{gcd(k_1+k_2,m)}{gcd(k_1+k_2,n)} cdot nr$$






        share|cite|improve this answer









        $endgroup$



        Let $g_1, g_2 in G$. We then have that $g_1=x^{k_1}$ and $g_2=x^{k_2}$ for $k_1,k_2 in mathbb{Z}$. Let $f$ be a homomorphism. Then
        $$f(g_1g_2)=f(x^{k_1}x^{k_2})=f(x^{k_1+k_2})=f(g_1)f(g_2)=f(x^{k_1})(x^{k_2})=y^{k_1}y^{k_2}=y^{k_1+k_2}.$$



        Further, recall that for any group homomorphism $varphi: G to H$ that for $g in G$ we have that $|varphi(g)|$ divides $|g|$.



        Thus from above we must have that $|y^{k_1+k_2}|$ divides $|x^{k_1+k_2}|$. And since $G=langle x rangle$ and $H=langle y rangle$ with $|x|=m$ and $|y|=n$, it clearly follows that $G cong mathbb{Z}/mmathbb{Z}$ and $H cong mathbb{Z}/nmathbb{Z}$. Therefore
        $$|y^{k_1+k_2}|=frac{n}{gcd(k_1+k_2,n)},$$
        $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}.$$
        Using that the first expression divides the second, we have for $r in mathbb{Z}$
        $$|x^{k_1+k_2}|=frac{m}{gcd(k_1+k_2,m)}=|y^{k_1+k_2}|cdot r = frac{nr}{gcd(k_1+k_2,n)}$$
        Providing us with
        $$m=frac{gcd(k_1+k_2,m)}{gcd(k_1+k_2,n)} cdot nr$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 20 at 3:23









        Andrew TawfeekAndrew Tawfeek

        1,8031722




        1,8031722






























            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%2f3080043%2fhomomorphism-xi-mapsto-yi-and-the-order-of-x-and-y%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

            What does “Dominus providebit” mean?

            Antonio Litta Visconti Arese