injectivity and bijectivity of linear maps












0












$begingroup$


I have got in trouble with one of the problems I'm solving for my university studies. This is the Problem:




Let $A in Bbb R^{n times n}$ and $Uin Bbb R^{n times n}$ such that $ker U = {0}$.
Define $B := UAU^{-1}$. Show that $f_A$ is injective if and only if $f_B$ is injective. What about surjectivity?




This is how far I have come:



$ f_U $ is injective and surjective and therefor bijective since $ ker A = {0} land operatorname{ran} U = Bbb R^{n} $.
And I have got to show that $ ker A = {0}$ iff $ker B = {0}$. That means I have to show that $ker A = {o} Rightarrow ker B = {o} land ker B = {o} Rightarrow ker A = {o}$.



Some help of you guys would come in handy.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I have got in trouble with one of the problems I'm solving for my university studies. This is the Problem:




    Let $A in Bbb R^{n times n}$ and $Uin Bbb R^{n times n}$ such that $ker U = {0}$.
    Define $B := UAU^{-1}$. Show that $f_A$ is injective if and only if $f_B$ is injective. What about surjectivity?




    This is how far I have come:



    $ f_U $ is injective and surjective and therefor bijective since $ ker A = {0} land operatorname{ran} U = Bbb R^{n} $.
    And I have got to show that $ ker A = {0}$ iff $ker B = {0}$. That means I have to show that $ker A = {o} Rightarrow ker B = {o} land ker B = {o} Rightarrow ker A = {o}$.



    Some help of you guys would come in handy.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I have got in trouble with one of the problems I'm solving for my university studies. This is the Problem:




      Let $A in Bbb R^{n times n}$ and $Uin Bbb R^{n times n}$ such that $ker U = {0}$.
      Define $B := UAU^{-1}$. Show that $f_A$ is injective if and only if $f_B$ is injective. What about surjectivity?




      This is how far I have come:



      $ f_U $ is injective and surjective and therefor bijective since $ ker A = {0} land operatorname{ran} U = Bbb R^{n} $.
      And I have got to show that $ ker A = {0}$ iff $ker B = {0}$. That means I have to show that $ker A = {o} Rightarrow ker B = {o} land ker B = {o} Rightarrow ker A = {o}$.



      Some help of you guys would come in handy.










      share|cite|improve this question









      $endgroup$




      I have got in trouble with one of the problems I'm solving for my university studies. This is the Problem:




      Let $A in Bbb R^{n times n}$ and $Uin Bbb R^{n times n}$ such that $ker U = {0}$.
      Define $B := UAU^{-1}$. Show that $f_A$ is injective if and only if $f_B$ is injective. What about surjectivity?




      This is how far I have come:



      $ f_U $ is injective and surjective and therefor bijective since $ ker A = {0} land operatorname{ran} U = Bbb R^{n} $.
      And I have got to show that $ ker A = {0}$ iff $ker B = {0}$. That means I have to show that $ker A = {o} Rightarrow ker B = {o} land ker B = {o} Rightarrow ker A = {o}$.



      Some help of you guys would come in handy.







      linear-algebra proof-writing






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 2 '18 at 15:28









      MathmeeeeenMathmeeeeen

      133




      133






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          More generally let $f:Xto X$ and $g:Yto Y$ be functions, and let
          $h:Yto X$ be an invertible function with $g=hcirc fcirc h^{-1}$.



          Then $h$ and $h^{-1}$ are both bijective.



          So if $f$ is injective then $g$ is a composition of injective functions
          and if $f$ is surjective then $g$ is a composition of surjective
          functions.





          So we can apply the following lemma's:



          1) If $u:Ato B$ and $v:Bto C$ are injective then so is $vcirc u:Ato C$



          Proof: $vcirc uleft(aright)=vcirc uleft(a'right)stackrel{vtext{ injective}}{implies}uleft(aright)=uleft(a'right)stackrel{utext{ injective}}{implies}a=a'$



          2) If $u:Ato B$ and $v:Bto C$ are surjective then so is $vcirc u:Ato C$



          Proof: Let $cin C$. Then $c=vleft(bright)$ for some $bin B$
          and $b=uleft(aright)$ for some $ain A$. So $c=ucirc vleft(aright)$.





          Also we have $f=h^{-1}circ gcirc h$ so in both cases also the converse is true. That means that we end up with:$$ftext{ is injective }iff gtext{ is injective }$$and:$$ftext{ is surjective }iff gtext{ is surjective }$$






          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%2f3022763%2finjectivity-and-bijectivity-of-linear-maps%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$

            More generally let $f:Xto X$ and $g:Yto Y$ be functions, and let
            $h:Yto X$ be an invertible function with $g=hcirc fcirc h^{-1}$.



            Then $h$ and $h^{-1}$ are both bijective.



            So if $f$ is injective then $g$ is a composition of injective functions
            and if $f$ is surjective then $g$ is a composition of surjective
            functions.





            So we can apply the following lemma's:



            1) If $u:Ato B$ and $v:Bto C$ are injective then so is $vcirc u:Ato C$



            Proof: $vcirc uleft(aright)=vcirc uleft(a'right)stackrel{vtext{ injective}}{implies}uleft(aright)=uleft(a'right)stackrel{utext{ injective}}{implies}a=a'$



            2) If $u:Ato B$ and $v:Bto C$ are surjective then so is $vcirc u:Ato C$



            Proof: Let $cin C$. Then $c=vleft(bright)$ for some $bin B$
            and $b=uleft(aright)$ for some $ain A$. So $c=ucirc vleft(aright)$.





            Also we have $f=h^{-1}circ gcirc h$ so in both cases also the converse is true. That means that we end up with:$$ftext{ is injective }iff gtext{ is injective }$$and:$$ftext{ is surjective }iff gtext{ is surjective }$$






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              More generally let $f:Xto X$ and $g:Yto Y$ be functions, and let
              $h:Yto X$ be an invertible function with $g=hcirc fcirc h^{-1}$.



              Then $h$ and $h^{-1}$ are both bijective.



              So if $f$ is injective then $g$ is a composition of injective functions
              and if $f$ is surjective then $g$ is a composition of surjective
              functions.





              So we can apply the following lemma's:



              1) If $u:Ato B$ and $v:Bto C$ are injective then so is $vcirc u:Ato C$



              Proof: $vcirc uleft(aright)=vcirc uleft(a'right)stackrel{vtext{ injective}}{implies}uleft(aright)=uleft(a'right)stackrel{utext{ injective}}{implies}a=a'$



              2) If $u:Ato B$ and $v:Bto C$ are surjective then so is $vcirc u:Ato C$



              Proof: Let $cin C$. Then $c=vleft(bright)$ for some $bin B$
              and $b=uleft(aright)$ for some $ain A$. So $c=ucirc vleft(aright)$.





              Also we have $f=h^{-1}circ gcirc h$ so in both cases also the converse is true. That means that we end up with:$$ftext{ is injective }iff gtext{ is injective }$$and:$$ftext{ is surjective }iff gtext{ is surjective }$$






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                More generally let $f:Xto X$ and $g:Yto Y$ be functions, and let
                $h:Yto X$ be an invertible function with $g=hcirc fcirc h^{-1}$.



                Then $h$ and $h^{-1}$ are both bijective.



                So if $f$ is injective then $g$ is a composition of injective functions
                and if $f$ is surjective then $g$ is a composition of surjective
                functions.





                So we can apply the following lemma's:



                1) If $u:Ato B$ and $v:Bto C$ are injective then so is $vcirc u:Ato C$



                Proof: $vcirc uleft(aright)=vcirc uleft(a'right)stackrel{vtext{ injective}}{implies}uleft(aright)=uleft(a'right)stackrel{utext{ injective}}{implies}a=a'$



                2) If $u:Ato B$ and $v:Bto C$ are surjective then so is $vcirc u:Ato C$



                Proof: Let $cin C$. Then $c=vleft(bright)$ for some $bin B$
                and $b=uleft(aright)$ for some $ain A$. So $c=ucirc vleft(aright)$.





                Also we have $f=h^{-1}circ gcirc h$ so in both cases also the converse is true. That means that we end up with:$$ftext{ is injective }iff gtext{ is injective }$$and:$$ftext{ is surjective }iff gtext{ is surjective }$$






                share|cite|improve this answer









                $endgroup$



                More generally let $f:Xto X$ and $g:Yto Y$ be functions, and let
                $h:Yto X$ be an invertible function with $g=hcirc fcirc h^{-1}$.



                Then $h$ and $h^{-1}$ are both bijective.



                So if $f$ is injective then $g$ is a composition of injective functions
                and if $f$ is surjective then $g$ is a composition of surjective
                functions.





                So we can apply the following lemma's:



                1) If $u:Ato B$ and $v:Bto C$ are injective then so is $vcirc u:Ato C$



                Proof: $vcirc uleft(aright)=vcirc uleft(a'right)stackrel{vtext{ injective}}{implies}uleft(aright)=uleft(a'right)stackrel{utext{ injective}}{implies}a=a'$



                2) If $u:Ato B$ and $v:Bto C$ are surjective then so is $vcirc u:Ato C$



                Proof: Let $cin C$. Then $c=vleft(bright)$ for some $bin B$
                and $b=uleft(aright)$ for some $ain A$. So $c=ucirc vleft(aright)$.





                Also we have $f=h^{-1}circ gcirc h$ so in both cases also the converse is true. That means that we end up with:$$ftext{ is injective }iff gtext{ is injective }$$and:$$ftext{ is surjective }iff gtext{ is surjective }$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 2 '18 at 15:36









                drhabdrhab

                98.9k544129




                98.9k544129






























                    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%2f3022763%2finjectivity-and-bijectivity-of-linear-maps%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

                    Mont Emei

                    Province de Neuquén

                    Journaliste