Let $G,H$ groups, $H$ abelian, prove $defHom{operatorname{Hom}}Hom(G,H)$, with the entrywise sum...












2












$begingroup$


I'm working on a proof to show that for a group $G$ and an abelian group $H$, the set of all homomorphisms $defHom{operatorname{Hom}}Hom(G,H)$ from $G$ to $H$ is an abelian group. I just want to verify that my proof is valid. I proceed by trying to show this group satisfies 4 conditions.



First, I defined the operation on $Hom(G,H)$ as $(f+g)(u)$, $u in G$, $f(u) + g(u)$. Is this a valid first move?



Then, associativity is easy to show. $((f+g)+h)(u) = (f+g)(u) + h(u) = f(u) + g(u) + h(u) = (f+(g+h))(u)$.



It is similarly easy to verify that this group is abelian: $(f+g)(u) = f(u) + g(u) = g(u) + f(u)$ since $H$ is abelian, so $(f+g)(u) = (g+f)(u)$.



Is it necessary to show closure, i.e. the product of homomorphisms into an abelian group is a homomorphism? This also follows since $H$ is abelian.



The trivial (zero) homomorphism is the homomorphism that maps every element of G to the identity element of $H$. Since $Hom(G,H)$ includes all homomorphisms, the identity homomorphism is also in $Hom(G,H)$.



I'm having trouble finding the inverse homomorphism. Let's say $f$ is in $Hom(G,H)$. If we take $g$ to be $-f$, $(f+g)(u) = f(u) - f(u) = 1$? What does it mean for a homomorphism to be an inverse of another?



Thanks for your help.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
    $endgroup$
    – James
    Oct 28 '14 at 20:00










  • $begingroup$
    Oops sorry, I meant 0.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:03






  • 1




    $begingroup$
    Is $G$ abelian too?
    $endgroup$
    – brick
    Oct 28 '14 at 20:06






  • 1




    $begingroup$
    @brick it doesn't matter.
    $endgroup$
    – Adam Hughes
    Oct 28 '14 at 20:10












  • $begingroup$
    Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:11
















2












$begingroup$


I'm working on a proof to show that for a group $G$ and an abelian group $H$, the set of all homomorphisms $defHom{operatorname{Hom}}Hom(G,H)$ from $G$ to $H$ is an abelian group. I just want to verify that my proof is valid. I proceed by trying to show this group satisfies 4 conditions.



First, I defined the operation on $Hom(G,H)$ as $(f+g)(u)$, $u in G$, $f(u) + g(u)$. Is this a valid first move?



Then, associativity is easy to show. $((f+g)+h)(u) = (f+g)(u) + h(u) = f(u) + g(u) + h(u) = (f+(g+h))(u)$.



It is similarly easy to verify that this group is abelian: $(f+g)(u) = f(u) + g(u) = g(u) + f(u)$ since $H$ is abelian, so $(f+g)(u) = (g+f)(u)$.



Is it necessary to show closure, i.e. the product of homomorphisms into an abelian group is a homomorphism? This also follows since $H$ is abelian.



The trivial (zero) homomorphism is the homomorphism that maps every element of G to the identity element of $H$. Since $Hom(G,H)$ includes all homomorphisms, the identity homomorphism is also in $Hom(G,H)$.



I'm having trouble finding the inverse homomorphism. Let's say $f$ is in $Hom(G,H)$. If we take $g$ to be $-f$, $(f+g)(u) = f(u) - f(u) = 1$? What does it mean for a homomorphism to be an inverse of another?



Thanks for your help.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
    $endgroup$
    – James
    Oct 28 '14 at 20:00










  • $begingroup$
    Oops sorry, I meant 0.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:03






  • 1




    $begingroup$
    Is $G$ abelian too?
    $endgroup$
    – brick
    Oct 28 '14 at 20:06






  • 1




    $begingroup$
    @brick it doesn't matter.
    $endgroup$
    – Adam Hughes
    Oct 28 '14 at 20:10












  • $begingroup$
    Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:11














2












2








2


1



$begingroup$


I'm working on a proof to show that for a group $G$ and an abelian group $H$, the set of all homomorphisms $defHom{operatorname{Hom}}Hom(G,H)$ from $G$ to $H$ is an abelian group. I just want to verify that my proof is valid. I proceed by trying to show this group satisfies 4 conditions.



First, I defined the operation on $Hom(G,H)$ as $(f+g)(u)$, $u in G$, $f(u) + g(u)$. Is this a valid first move?



Then, associativity is easy to show. $((f+g)+h)(u) = (f+g)(u) + h(u) = f(u) + g(u) + h(u) = (f+(g+h))(u)$.



It is similarly easy to verify that this group is abelian: $(f+g)(u) = f(u) + g(u) = g(u) + f(u)$ since $H$ is abelian, so $(f+g)(u) = (g+f)(u)$.



Is it necessary to show closure, i.e. the product of homomorphisms into an abelian group is a homomorphism? This also follows since $H$ is abelian.



The trivial (zero) homomorphism is the homomorphism that maps every element of G to the identity element of $H$. Since $Hom(G,H)$ includes all homomorphisms, the identity homomorphism is also in $Hom(G,H)$.



I'm having trouble finding the inverse homomorphism. Let's say $f$ is in $Hom(G,H)$. If we take $g$ to be $-f$, $(f+g)(u) = f(u) - f(u) = 1$? What does it mean for a homomorphism to be an inverse of another?



Thanks for your help.










share|cite|improve this question











$endgroup$




I'm working on a proof to show that for a group $G$ and an abelian group $H$, the set of all homomorphisms $defHom{operatorname{Hom}}Hom(G,H)$ from $G$ to $H$ is an abelian group. I just want to verify that my proof is valid. I proceed by trying to show this group satisfies 4 conditions.



First, I defined the operation on $Hom(G,H)$ as $(f+g)(u)$, $u in G$, $f(u) + g(u)$. Is this a valid first move?



Then, associativity is easy to show. $((f+g)+h)(u) = (f+g)(u) + h(u) = f(u) + g(u) + h(u) = (f+(g+h))(u)$.



It is similarly easy to verify that this group is abelian: $(f+g)(u) = f(u) + g(u) = g(u) + f(u)$ since $H$ is abelian, so $(f+g)(u) = (g+f)(u)$.



Is it necessary to show closure, i.e. the product of homomorphisms into an abelian group is a homomorphism? This also follows since $H$ is abelian.



The trivial (zero) homomorphism is the homomorphism that maps every element of G to the identity element of $H$. Since $Hom(G,H)$ includes all homomorphisms, the identity homomorphism is also in $Hom(G,H)$.



I'm having trouble finding the inverse homomorphism. Let's say $f$ is in $Hom(G,H)$. If we take $g$ to be $-f$, $(f+g)(u) = f(u) - f(u) = 1$? What does it mean for a homomorphism to be an inverse of another?



Thanks for your help.







abelian-groups abstract-algebra






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 12 '17 at 2:03









Santropedro

3101316




3101316










asked Oct 28 '14 at 19:58









jstnchngjstnchng

524214




524214








  • 2




    $begingroup$
    Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
    $endgroup$
    – James
    Oct 28 '14 at 20:00










  • $begingroup$
    Oops sorry, I meant 0.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:03






  • 1




    $begingroup$
    Is $G$ abelian too?
    $endgroup$
    – brick
    Oct 28 '14 at 20:06






  • 1




    $begingroup$
    @brick it doesn't matter.
    $endgroup$
    – Adam Hughes
    Oct 28 '14 at 20:10












  • $begingroup$
    Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:11














  • 2




    $begingroup$
    Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
    $endgroup$
    – James
    Oct 28 '14 at 20:00










  • $begingroup$
    Oops sorry, I meant 0.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:03






  • 1




    $begingroup$
    Is $G$ abelian too?
    $endgroup$
    – brick
    Oct 28 '14 at 20:06






  • 1




    $begingroup$
    @brick it doesn't matter.
    $endgroup$
    – Adam Hughes
    Oct 28 '14 at 20:10












  • $begingroup$
    Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
    $endgroup$
    – jstnchng
    Oct 28 '14 at 20:11








2




2




$begingroup$
Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
$endgroup$
– James
Oct 28 '14 at 20:00




$begingroup$
Yes, you need to show closure. If you are writing your group $H$ additively, why do you get $f(u)-f(u)=1$ rather than $0$?
$endgroup$
– James
Oct 28 '14 at 20:00












$begingroup$
Oops sorry, I meant 0.
$endgroup$
– jstnchng
Oct 28 '14 at 20:03




$begingroup$
Oops sorry, I meant 0.
$endgroup$
– jstnchng
Oct 28 '14 at 20:03




1




1




$begingroup$
Is $G$ abelian too?
$endgroup$
– brick
Oct 28 '14 at 20:06




$begingroup$
Is $G$ abelian too?
$endgroup$
– brick
Oct 28 '14 at 20:06




1




1




$begingroup$
@brick it doesn't matter.
$endgroup$
– Adam Hughes
Oct 28 '14 at 20:10






$begingroup$
@brick it doesn't matter.
$endgroup$
– Adam Hughes
Oct 28 '14 at 20:10














$begingroup$
Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
$endgroup$
– jstnchng
Oct 28 '14 at 20:11




$begingroup$
Yeah we need H is abelian to show that Hom(G,H) is abelian, and also when demonstrating closure.
$endgroup$
– jstnchng
Oct 28 '14 at 20:11










1 Answer
1






active

oldest

votes


















0












$begingroup$

Note: I'm using additive notation for both groups G and H, however, I assume ONLY $H$ abelian, I will not use abelian for $G$, tell me if I mistake that. but it totally can be done without using $G$ abelian.



Proof: Let $A=Hom(G,H)$, with the sum $(f+g)(x)=f(x)+g(x)$. Let's prove $A$ it's a abelian group:



Closed: $(f+g)(x+y)=f(x+y)+g(x+y)=f(x)+f(y)+g(x)+g(y)$



Now IMPORTANT, we use "$H$ is abelian" hypothesis, if not, we can't do this step, it's simply false.



$=f(x)+g(x)+f(y)+g(y)=(f+g)(x)+(f+g)(y)$ that proves the sum of homomorphism is homomorphism, so it's closed.



Associative: I copy and improve your proof $((f+g)+h)(u)=(f+g)(u)+h(u)=f(u)+g(u)+h(u)=(f+(g+h))(u)$



Abelian: $(f+g)(u)=f(u)+g(u)=g(u)+f(u)$ IMPORTANT: This uses $H$ abelian.



Inverses: Let $f in Hom(G,H)$ then the only candidate to be inverse that could work, is the entrywise inverse $-f$ defined by $-f(x)=f(-x)$ . So let's check it does the job first:
$(f+(-f))(x)=f(x)+(-f)(x)=f(x)+f(-x)=f(x-x)=f(0)=0$ And the sum in the other direction has the same proof (or you remember this group $A$ is abelian).



And $-f$ is a homomorphism: $-f(x+y)=f(-(x+y))=f(-y-x)=f(-y)+f(-x)=f(-x)+f(-y)
=-f(x)+-f(y)$ Note this also uses $H$ to be abelian.






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%2f995523%2flet-g-h-groups-h-abelian-prove-def-hom-operatornamehom-homg-h-wi%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












    $begingroup$

    Note: I'm using additive notation for both groups G and H, however, I assume ONLY $H$ abelian, I will not use abelian for $G$, tell me if I mistake that. but it totally can be done without using $G$ abelian.



    Proof: Let $A=Hom(G,H)$, with the sum $(f+g)(x)=f(x)+g(x)$. Let's prove $A$ it's a abelian group:



    Closed: $(f+g)(x+y)=f(x+y)+g(x+y)=f(x)+f(y)+g(x)+g(y)$



    Now IMPORTANT, we use "$H$ is abelian" hypothesis, if not, we can't do this step, it's simply false.



    $=f(x)+g(x)+f(y)+g(y)=(f+g)(x)+(f+g)(y)$ that proves the sum of homomorphism is homomorphism, so it's closed.



    Associative: I copy and improve your proof $((f+g)+h)(u)=(f+g)(u)+h(u)=f(u)+g(u)+h(u)=(f+(g+h))(u)$



    Abelian: $(f+g)(u)=f(u)+g(u)=g(u)+f(u)$ IMPORTANT: This uses $H$ abelian.



    Inverses: Let $f in Hom(G,H)$ then the only candidate to be inverse that could work, is the entrywise inverse $-f$ defined by $-f(x)=f(-x)$ . So let's check it does the job first:
    $(f+(-f))(x)=f(x)+(-f)(x)=f(x)+f(-x)=f(x-x)=f(0)=0$ And the sum in the other direction has the same proof (or you remember this group $A$ is abelian).



    And $-f$ is a homomorphism: $-f(x+y)=f(-(x+y))=f(-y-x)=f(-y)+f(-x)=f(-x)+f(-y)
    =-f(x)+-f(y)$ Note this also uses $H$ to be abelian.






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      Note: I'm using additive notation for both groups G and H, however, I assume ONLY $H$ abelian, I will not use abelian for $G$, tell me if I mistake that. but it totally can be done without using $G$ abelian.



      Proof: Let $A=Hom(G,H)$, with the sum $(f+g)(x)=f(x)+g(x)$. Let's prove $A$ it's a abelian group:



      Closed: $(f+g)(x+y)=f(x+y)+g(x+y)=f(x)+f(y)+g(x)+g(y)$



      Now IMPORTANT, we use "$H$ is abelian" hypothesis, if not, we can't do this step, it's simply false.



      $=f(x)+g(x)+f(y)+g(y)=(f+g)(x)+(f+g)(y)$ that proves the sum of homomorphism is homomorphism, so it's closed.



      Associative: I copy and improve your proof $((f+g)+h)(u)=(f+g)(u)+h(u)=f(u)+g(u)+h(u)=(f+(g+h))(u)$



      Abelian: $(f+g)(u)=f(u)+g(u)=g(u)+f(u)$ IMPORTANT: This uses $H$ abelian.



      Inverses: Let $f in Hom(G,H)$ then the only candidate to be inverse that could work, is the entrywise inverse $-f$ defined by $-f(x)=f(-x)$ . So let's check it does the job first:
      $(f+(-f))(x)=f(x)+(-f)(x)=f(x)+f(-x)=f(x-x)=f(0)=0$ And the sum in the other direction has the same proof (or you remember this group $A$ is abelian).



      And $-f$ is a homomorphism: $-f(x+y)=f(-(x+y))=f(-y-x)=f(-y)+f(-x)=f(-x)+f(-y)
      =-f(x)+-f(y)$ Note this also uses $H$ to be abelian.






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        Note: I'm using additive notation for both groups G and H, however, I assume ONLY $H$ abelian, I will not use abelian for $G$, tell me if I mistake that. but it totally can be done without using $G$ abelian.



        Proof: Let $A=Hom(G,H)$, with the sum $(f+g)(x)=f(x)+g(x)$. Let's prove $A$ it's a abelian group:



        Closed: $(f+g)(x+y)=f(x+y)+g(x+y)=f(x)+f(y)+g(x)+g(y)$



        Now IMPORTANT, we use "$H$ is abelian" hypothesis, if not, we can't do this step, it's simply false.



        $=f(x)+g(x)+f(y)+g(y)=(f+g)(x)+(f+g)(y)$ that proves the sum of homomorphism is homomorphism, so it's closed.



        Associative: I copy and improve your proof $((f+g)+h)(u)=(f+g)(u)+h(u)=f(u)+g(u)+h(u)=(f+(g+h))(u)$



        Abelian: $(f+g)(u)=f(u)+g(u)=g(u)+f(u)$ IMPORTANT: This uses $H$ abelian.



        Inverses: Let $f in Hom(G,H)$ then the only candidate to be inverse that could work, is the entrywise inverse $-f$ defined by $-f(x)=f(-x)$ . So let's check it does the job first:
        $(f+(-f))(x)=f(x)+(-f)(x)=f(x)+f(-x)=f(x-x)=f(0)=0$ And the sum in the other direction has the same proof (or you remember this group $A$ is abelian).



        And $-f$ is a homomorphism: $-f(x+y)=f(-(x+y))=f(-y-x)=f(-y)+f(-x)=f(-x)+f(-y)
        =-f(x)+-f(y)$ Note this also uses $H$ to be abelian.






        share|cite|improve this answer











        $endgroup$



        Note: I'm using additive notation for both groups G and H, however, I assume ONLY $H$ abelian, I will not use abelian for $G$, tell me if I mistake that. but it totally can be done without using $G$ abelian.



        Proof: Let $A=Hom(G,H)$, with the sum $(f+g)(x)=f(x)+g(x)$. Let's prove $A$ it's a abelian group:



        Closed: $(f+g)(x+y)=f(x+y)+g(x+y)=f(x)+f(y)+g(x)+g(y)$



        Now IMPORTANT, we use "$H$ is abelian" hypothesis, if not, we can't do this step, it's simply false.



        $=f(x)+g(x)+f(y)+g(y)=(f+g)(x)+(f+g)(y)$ that proves the sum of homomorphism is homomorphism, so it's closed.



        Associative: I copy and improve your proof $((f+g)+h)(u)=(f+g)(u)+h(u)=f(u)+g(u)+h(u)=(f+(g+h))(u)$



        Abelian: $(f+g)(u)=f(u)+g(u)=g(u)+f(u)$ IMPORTANT: This uses $H$ abelian.



        Inverses: Let $f in Hom(G,H)$ then the only candidate to be inverse that could work, is the entrywise inverse $-f$ defined by $-f(x)=f(-x)$ . So let's check it does the job first:
        $(f+(-f))(x)=f(x)+(-f)(x)=f(x)+f(-x)=f(x-x)=f(0)=0$ And the sum in the other direction has the same proof (or you remember this group $A$ is abelian).



        And $-f$ is a homomorphism: $-f(x+y)=f(-(x+y))=f(-y-x)=f(-y)+f(-x)=f(-x)+f(-y)
        =-f(x)+-f(y)$ Note this also uses $H$ to be abelian.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Mar 12 '17 at 16:43

























        answered Mar 12 '17 at 2:38









        SantropedroSantropedro

        3101316




        3101316






























            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%2f995523%2flet-g-h-groups-h-abelian-prove-def-hom-operatornamehom-homg-h-wi%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

            Understanding the size os this class of aleatory events

            Partial Derivative Guidance.