Math Proof: Surjective/Injctive












0














Q: Let f : R → R be bijective. Define g : R → R as g(x) = |x|. Then g ◦ f is neither surjective nor injective
Pf: Let f: R → R be bijective. g: R1 → R2 as g(x)=|x|. Consider x1=2 and x2=2. g(x1)-g(2)=|2|=2=2=|-2|=g(-2)=g(x2). Since g(x1)=g(x2) then g is not injective. Now consider n=-2. -2 does not exist in R2 since R2>=0 by the definition of absolute value and there does not exist and x in R1 s.t. f(x)=-2. As a result, g is not surjective. So how do we prove that g ◦ f is neither surjective nor injective?










share|cite|improve this question




















  • 1




    In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
    – Joel Pereira
    Nov 29 at 19:34
















0














Q: Let f : R → R be bijective. Define g : R → R as g(x) = |x|. Then g ◦ f is neither surjective nor injective
Pf: Let f: R → R be bijective. g: R1 → R2 as g(x)=|x|. Consider x1=2 and x2=2. g(x1)-g(2)=|2|=2=2=|-2|=g(-2)=g(x2). Since g(x1)=g(x2) then g is not injective. Now consider n=-2. -2 does not exist in R2 since R2>=0 by the definition of absolute value and there does not exist and x in R1 s.t. f(x)=-2. As a result, g is not surjective. So how do we prove that g ◦ f is neither surjective nor injective?










share|cite|improve this question




















  • 1




    In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
    – Joel Pereira
    Nov 29 at 19:34














0












0








0







Q: Let f : R → R be bijective. Define g : R → R as g(x) = |x|. Then g ◦ f is neither surjective nor injective
Pf: Let f: R → R be bijective. g: R1 → R2 as g(x)=|x|. Consider x1=2 and x2=2. g(x1)-g(2)=|2|=2=2=|-2|=g(-2)=g(x2). Since g(x1)=g(x2) then g is not injective. Now consider n=-2. -2 does not exist in R2 since R2>=0 by the definition of absolute value and there does not exist and x in R1 s.t. f(x)=-2. As a result, g is not surjective. So how do we prove that g ◦ f is neither surjective nor injective?










share|cite|improve this question















Q: Let f : R → R be bijective. Define g : R → R as g(x) = |x|. Then g ◦ f is neither surjective nor injective
Pf: Let f: R → R be bijective. g: R1 → R2 as g(x)=|x|. Consider x1=2 and x2=2. g(x1)-g(2)=|2|=2=2=|-2|=g(-2)=g(x2). Since g(x1)=g(x2) then g is not injective. Now consider n=-2. -2 does not exist in R2 since R2>=0 by the definition of absolute value and there does not exist and x in R1 s.t. f(x)=-2. As a result, g is not surjective. So how do we prove that g ◦ f is neither surjective nor injective?







functions proof-verification elementary-set-theory proof-explanation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 at 20:19









Martin Sleziak

44.6k7115270




44.6k7115270










asked Nov 29 at 19:27









Robert Klein

65




65








  • 1




    In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
    – Joel Pereira
    Nov 29 at 19:34














  • 1




    In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
    – Joel Pereira
    Nov 29 at 19:34








1




1




In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
– Joel Pereira
Nov 29 at 19:34




In your proof, x$_1$ = x$_2$. Also what is R$_1$ and R$_2$?
– Joel Pereira
Nov 29 at 19:34










1 Answer
1






active

oldest

votes


















0














hint



for a real $x$, let



$$h(x)=gcirc f(x)=|f(x)|$$



thus



$$h(x_1)=h(x_2)implies |f(x_1)|=|f(x_2)|$$



$$implies f(x_1)=pm f(x_2)$$



If $f$ is positive, then $gcirc f$ is bijective.






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',
    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%2f3019077%2fmath-proof-surjective-injctive%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














    hint



    for a real $x$, let



    $$h(x)=gcirc f(x)=|f(x)|$$



    thus



    $$h(x_1)=h(x_2)implies |f(x_1)|=|f(x_2)|$$



    $$implies f(x_1)=pm f(x_2)$$



    If $f$ is positive, then $gcirc f$ is bijective.






    share|cite|improve this answer


























      0














      hint



      for a real $x$, let



      $$h(x)=gcirc f(x)=|f(x)|$$



      thus



      $$h(x_1)=h(x_2)implies |f(x_1)|=|f(x_2)|$$



      $$implies f(x_1)=pm f(x_2)$$



      If $f$ is positive, then $gcirc f$ is bijective.






      share|cite|improve this answer
























        0












        0








        0






        hint



        for a real $x$, let



        $$h(x)=gcirc f(x)=|f(x)|$$



        thus



        $$h(x_1)=h(x_2)implies |f(x_1)|=|f(x_2)|$$



        $$implies f(x_1)=pm f(x_2)$$



        If $f$ is positive, then $gcirc f$ is bijective.






        share|cite|improve this answer












        hint



        for a real $x$, let



        $$h(x)=gcirc f(x)=|f(x)|$$



        thus



        $$h(x_1)=h(x_2)implies |f(x_1)|=|f(x_2)|$$



        $$implies f(x_1)=pm f(x_2)$$



        If $f$ is positive, then $gcirc f$ is bijective.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 29 at 19:42









        hamam_Abdallah

        37.8k21634




        37.8k21634






























            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%2f3019077%2fmath-proof-surjective-injctive%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

            Berounka

            Sphinx de Gizeh

            Different font size/position of beamer's navigation symbols template's content depending on regular/plain...