Injective functions implies injective composition proof












0












$begingroup$


So I want to show that given sets $A$ and $B$ and the mappings:



$f: A to B$ and $g:Bto C$



$f$ and $g$ both injective $implies$ $gcirc f$ is injective



My attempt at a proof:



$f$ is injective $implies forall a_1,a_2 in A$



$f(a_1) = f(a_2) implies a_1 = a_2$



$g$ is injective also so



$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$



Thus $gcirc f$ is injective $blacksquare$



Is this a valid proof?



Thanks for reading.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Seems fine if you ask me.
    $endgroup$
    – Wuestenfux
    Dec 24 '18 at 14:46
















0












$begingroup$


So I want to show that given sets $A$ and $B$ and the mappings:



$f: A to B$ and $g:Bto C$



$f$ and $g$ both injective $implies$ $gcirc f$ is injective



My attempt at a proof:



$f$ is injective $implies forall a_1,a_2 in A$



$f(a_1) = f(a_2) implies a_1 = a_2$



$g$ is injective also so



$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$



Thus $gcirc f$ is injective $blacksquare$



Is this a valid proof?



Thanks for reading.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Seems fine if you ask me.
    $endgroup$
    – Wuestenfux
    Dec 24 '18 at 14:46














0












0








0





$begingroup$


So I want to show that given sets $A$ and $B$ and the mappings:



$f: A to B$ and $g:Bto C$



$f$ and $g$ both injective $implies$ $gcirc f$ is injective



My attempt at a proof:



$f$ is injective $implies forall a_1,a_2 in A$



$f(a_1) = f(a_2) implies a_1 = a_2$



$g$ is injective also so



$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$



Thus $gcirc f$ is injective $blacksquare$



Is this a valid proof?



Thanks for reading.










share|cite|improve this question











$endgroup$




So I want to show that given sets $A$ and $B$ and the mappings:



$f: A to B$ and $g:Bto C$



$f$ and $g$ both injective $implies$ $gcirc f$ is injective



My attempt at a proof:



$f$ is injective $implies forall a_1,a_2 in A$



$f(a_1) = f(a_2) implies a_1 = a_2$



$g$ is injective also so



$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$



Thus $gcirc f$ is injective $blacksquare$



Is this a valid proof?



Thanks for reading.







functions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 24 '18 at 16:08







PolynomialC

















asked Dec 24 '18 at 14:43









PolynomialCPolynomialC

967




967








  • 1




    $begingroup$
    Seems fine if you ask me.
    $endgroup$
    – Wuestenfux
    Dec 24 '18 at 14:46














  • 1




    $begingroup$
    Seems fine if you ask me.
    $endgroup$
    – Wuestenfux
    Dec 24 '18 at 14:46








1




1




$begingroup$
Seems fine if you ask me.
$endgroup$
– Wuestenfux
Dec 24 '18 at 14:46




$begingroup$
Seems fine if you ask me.
$endgroup$
– Wuestenfux
Dec 24 '18 at 14:46










1 Answer
1






active

oldest

votes


















1












$begingroup$

Yes, the proof is valid.



$$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$$



the first implication is due to $g$ is injective and the second implication is due to $f$ is injective.



Injective function gives us the ability to "remove" it since they must share the same pre-image.






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%2f3051310%2finjective-functions-implies-injective-composition-proof%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$

    Yes, the proof is valid.



    $$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$$



    the first implication is due to $g$ is injective and the second implication is due to $f$ is injective.



    Injective function gives us the ability to "remove" it since they must share the same pre-image.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Yes, the proof is valid.



      $$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$$



      the first implication is due to $g$ is injective and the second implication is due to $f$ is injective.



      Injective function gives us the ability to "remove" it since they must share the same pre-image.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Yes, the proof is valid.



        $$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$$



        the first implication is due to $g$ is injective and the second implication is due to $f$ is injective.



        Injective function gives us the ability to "remove" it since they must share the same pre-image.






        share|cite|improve this answer









        $endgroup$



        Yes, the proof is valid.



        $$g(f(a_1)) = g(f(a_2)) implies f(a_1) = f(a_2) implies a_1 = a_2$$



        the first implication is due to $g$ is injective and the second implication is due to $f$ is injective.



        Injective function gives us the ability to "remove" it since they must share the same pre-image.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 24 '18 at 14:46









        Siong Thye GohSiong Thye Goh

        103k1468120




        103k1468120






























            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%2f3051310%2finjective-functions-implies-injective-composition-proof%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

            Bundesstraße 106

            Verónica Boquete

            Ida-Boy-Ed-Garten