$ operatorname{Ker}TR = {0}$ but $ operatorname{Ker}T not= {0}$ where $R$ is an isomorphism?












1












$begingroup$


Let $V$ be a finite-dimensional vector space, and let $R: V rightarrow V$ be an invertible linear transformation.



Is there a linear transformation $T: V rightarrow V$ such that $ operatorname{Ker}TR = {0}$ but $ operatorname{Ker}T not= {0}$?



What I'd like you to help me with:




  1. As I understand it (and my understanding is probably wrong), $R$ defines an isomorphism between $V$ to $V$ itself; But any vector space is isomorphic with itself, so it seems like a trivial thing...

  2. I need some clues on how to approach the proof. I guess it should involve using dimensions, but I don't know how to start applying the relevant dimensions theorems










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    Let $V$ be a finite-dimensional vector space, and let $R: V rightarrow V$ be an invertible linear transformation.



    Is there a linear transformation $T: V rightarrow V$ such that $ operatorname{Ker}TR = {0}$ but $ operatorname{Ker}T not= {0}$?



    What I'd like you to help me with:




    1. As I understand it (and my understanding is probably wrong), $R$ defines an isomorphism between $V$ to $V$ itself; But any vector space is isomorphic with itself, so it seems like a trivial thing...

    2. I need some clues on how to approach the proof. I guess it should involve using dimensions, but I don't know how to start applying the relevant dimensions theorems










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      Let $V$ be a finite-dimensional vector space, and let $R: V rightarrow V$ be an invertible linear transformation.



      Is there a linear transformation $T: V rightarrow V$ such that $ operatorname{Ker}TR = {0}$ but $ operatorname{Ker}T not= {0}$?



      What I'd like you to help me with:




      1. As I understand it (and my understanding is probably wrong), $R$ defines an isomorphism between $V$ to $V$ itself; But any vector space is isomorphic with itself, so it seems like a trivial thing...

      2. I need some clues on how to approach the proof. I guess it should involve using dimensions, but I don't know how to start applying the relevant dimensions theorems










      share|cite|improve this question











      $endgroup$




      Let $V$ be a finite-dimensional vector space, and let $R: V rightarrow V$ be an invertible linear transformation.



      Is there a linear transformation $T: V rightarrow V$ such that $ operatorname{Ker}TR = {0}$ but $ operatorname{Ker}T not= {0}$?



      What I'd like you to help me with:




      1. As I understand it (and my understanding is probably wrong), $R$ defines an isomorphism between $V$ to $V$ itself; But any vector space is isomorphic with itself, so it seems like a trivial thing...

      2. I need some clues on how to approach the proof. I guess it should involve using dimensions, but I don't know how to start applying the relevant dimensions theorems







      linear-algebra linear-transformations vector-space-isomorphism






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 13 at 23:55









      Bernard

      121k740116




      121k740116










      asked Jan 13 at 23:47









      HeyJudeHeyJude

      1687




      1687






















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          It is impossible to find such $T$, suppose that $T(x)=0$, there exists $y$ such that $R(y)=x$, $TR(y)=T(x)=0$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
            $endgroup$
            – aidangallagher4
            Jan 14 at 0:07










          • $begingroup$
            Can you please explain how do we use the kernels here to finish the proof?
            $endgroup$
            – HeyJude
            Jan 14 at 0:58










          • $begingroup$
            Can we just say that $KerT$ must be equal to $KerTR$?
            $endgroup$
            – HeyJude
            Jan 14 at 1:56













          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%2f3072684%2foperatornamekertr-0-but-operatornamekert-not-0-where-r%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









          3












          $begingroup$

          It is impossible to find such $T$, suppose that $T(x)=0$, there exists $y$ such that $R(y)=x$, $TR(y)=T(x)=0$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
            $endgroup$
            – aidangallagher4
            Jan 14 at 0:07










          • $begingroup$
            Can you please explain how do we use the kernels here to finish the proof?
            $endgroup$
            – HeyJude
            Jan 14 at 0:58










          • $begingroup$
            Can we just say that $KerT$ must be equal to $KerTR$?
            $endgroup$
            – HeyJude
            Jan 14 at 1:56


















          3












          $begingroup$

          It is impossible to find such $T$, suppose that $T(x)=0$, there exists $y$ such that $R(y)=x$, $TR(y)=T(x)=0$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
            $endgroup$
            – aidangallagher4
            Jan 14 at 0:07










          • $begingroup$
            Can you please explain how do we use the kernels here to finish the proof?
            $endgroup$
            – HeyJude
            Jan 14 at 0:58










          • $begingroup$
            Can we just say that $KerT$ must be equal to $KerTR$?
            $endgroup$
            – HeyJude
            Jan 14 at 1:56
















          3












          3








          3





          $begingroup$

          It is impossible to find such $T$, suppose that $T(x)=0$, there exists $y$ such that $R(y)=x$, $TR(y)=T(x)=0$






          share|cite|improve this answer









          $endgroup$



          It is impossible to find such $T$, suppose that $T(x)=0$, there exists $y$ such that $R(y)=x$, $TR(y)=T(x)=0$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 13 at 23:51









          Tsemo AristideTsemo Aristide

          58.1k11445




          58.1k11445












          • $begingroup$
            Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
            $endgroup$
            – aidangallagher4
            Jan 14 at 0:07










          • $begingroup$
            Can you please explain how do we use the kernels here to finish the proof?
            $endgroup$
            – HeyJude
            Jan 14 at 0:58










          • $begingroup$
            Can we just say that $KerT$ must be equal to $KerTR$?
            $endgroup$
            – HeyJude
            Jan 14 at 1:56




















          • $begingroup$
            Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
            $endgroup$
            – aidangallagher4
            Jan 14 at 0:07










          • $begingroup$
            Can you please explain how do we use the kernels here to finish the proof?
            $endgroup$
            – HeyJude
            Jan 14 at 0:58










          • $begingroup$
            Can we just say that $KerT$ must be equal to $KerTR$?
            $endgroup$
            – HeyJude
            Jan 14 at 1:56


















          $begingroup$
          Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
          $endgroup$
          – aidangallagher4
          Jan 14 at 0:07




          $begingroup$
          Worth noting this uses the invertibility of $R$ (specifically that it is surjective); were it not surjective this would not be true
          $endgroup$
          – aidangallagher4
          Jan 14 at 0:07












          $begingroup$
          Can you please explain how do we use the kernels here to finish the proof?
          $endgroup$
          – HeyJude
          Jan 14 at 0:58




          $begingroup$
          Can you please explain how do we use the kernels here to finish the proof?
          $endgroup$
          – HeyJude
          Jan 14 at 0:58












          $begingroup$
          Can we just say that $KerT$ must be equal to $KerTR$?
          $endgroup$
          – HeyJude
          Jan 14 at 1:56






          $begingroup$
          Can we just say that $KerT$ must be equal to $KerTR$?
          $endgroup$
          – HeyJude
          Jan 14 at 1:56




















          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%2f3072684%2foperatornamekertr-0-but-operatornamekert-not-0-where-r%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

          MongoDB - Not Authorized To Execute Command

          How to fix TextFormField cause rebuild widget in Flutter

          in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith