Projection Matrixes, $A,B$ such that $text{Id} - (A+B)$ is invertible












3












$begingroup$


This question was on an old qual exam and I have been stuck on it:



Let $A,B$ be two real $5x5$ matrices such that $A^2=A , B^2 = B$ and $text{Id} - (A+B)$ is invertible. Show Rank($A$)=Rank($B$).



My biggest question is why is $A,B$ being $5x5$ needed? I don't see why this wouldn't generalize to any square matrix with the above properties.



I have tried to use that $mathbb{R}^5 = text{Im}(A)bigoplustext{Ker}(A)$ and similarly for $B$ and tried to show nullity(A) = nullity(B) to no avail. I believe the strongest assumption given is that $text{Id} - (A+B)$ is invertible, but I am unsure how to use this to prove Rank($A$) = Rank($B$).










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    see the possible Jordan's form for $A$ and $B$
    $endgroup$
    – Martín Vacas Vignolo
    Dec 23 '18 at 5:30
















3












$begingroup$


This question was on an old qual exam and I have been stuck on it:



Let $A,B$ be two real $5x5$ matrices such that $A^2=A , B^2 = B$ and $text{Id} - (A+B)$ is invertible. Show Rank($A$)=Rank($B$).



My biggest question is why is $A,B$ being $5x5$ needed? I don't see why this wouldn't generalize to any square matrix with the above properties.



I have tried to use that $mathbb{R}^5 = text{Im}(A)bigoplustext{Ker}(A)$ and similarly for $B$ and tried to show nullity(A) = nullity(B) to no avail. I believe the strongest assumption given is that $text{Id} - (A+B)$ is invertible, but I am unsure how to use this to prove Rank($A$) = Rank($B$).










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    see the possible Jordan's form for $A$ and $B$
    $endgroup$
    – Martín Vacas Vignolo
    Dec 23 '18 at 5:30














3












3








3





$begingroup$


This question was on an old qual exam and I have been stuck on it:



Let $A,B$ be two real $5x5$ matrices such that $A^2=A , B^2 = B$ and $text{Id} - (A+B)$ is invertible. Show Rank($A$)=Rank($B$).



My biggest question is why is $A,B$ being $5x5$ needed? I don't see why this wouldn't generalize to any square matrix with the above properties.



I have tried to use that $mathbb{R}^5 = text{Im}(A)bigoplustext{Ker}(A)$ and similarly for $B$ and tried to show nullity(A) = nullity(B) to no avail. I believe the strongest assumption given is that $text{Id} - (A+B)$ is invertible, but I am unsure how to use this to prove Rank($A$) = Rank($B$).










share|cite|improve this question









$endgroup$




This question was on an old qual exam and I have been stuck on it:



Let $A,B$ be two real $5x5$ matrices such that $A^2=A , B^2 = B$ and $text{Id} - (A+B)$ is invertible. Show Rank($A$)=Rank($B$).



My biggest question is why is $A,B$ being $5x5$ needed? I don't see why this wouldn't generalize to any square matrix with the above properties.



I have tried to use that $mathbb{R}^5 = text{Im}(A)bigoplustext{Ker}(A)$ and similarly for $B$ and tried to show nullity(A) = nullity(B) to no avail. I believe the strongest assumption given is that $text{Id} - (A+B)$ is invertible, but I am unsure how to use this to prove Rank($A$) = Rank($B$).







linear-algebra matrix-rank projection-matrices






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 23 '18 at 5:27









Story123Story123

18519




18519








  • 1




    $begingroup$
    see the possible Jordan's form for $A$ and $B$
    $endgroup$
    – Martín Vacas Vignolo
    Dec 23 '18 at 5:30














  • 1




    $begingroup$
    see the possible Jordan's form for $A$ and $B$
    $endgroup$
    – Martín Vacas Vignolo
    Dec 23 '18 at 5:30








1




1




$begingroup$
see the possible Jordan's form for $A$ and $B$
$endgroup$
– Martín Vacas Vignolo
Dec 23 '18 at 5:30




$begingroup$
see the possible Jordan's form for $A$ and $B$
$endgroup$
– Martín Vacas Vignolo
Dec 23 '18 at 5:30










2 Answers
2






active

oldest

votes


















4












$begingroup$

The $5times 5$ assumption is indeed irrelevant. As a hint, try writing $Id-(A+B)$ as $(Id-A)-B$.



A full proof is hidden below.




Let's say our matrices are $ntimes n$, and $A$ has rank $a$ and $B$ has rank $b$. Note then that $Id-A$ is a projection of rank $n-a$, and so $(Id-A)-B$ has rank at most $n-a+b$ (its image is contained in the sum of the image of $Id-A$ and the image of $B$). Since $(Id-A)-B$ is invertible, we have $nleq n-a+b$ and so $aleq b$. But swapping the roles of $A$ and $B$, we also get $bleq a$, and so $a=b$.







share|cite|improve this answer









$endgroup$





















    5












    $begingroup$

    You don't need $5times 5$, $ntimes n$ works.



    You also don't need $Bbb R$, any field will work.



    As you say, consider $Bbb R^n=text{im},A+ker A$.
    On $text{im}, A$, $I-A$ vanishes, so for $I-A-B$ to be invertible,
    $B$ must be injective on $text{im}, A$. Therefore $text{rank},Bgedim
    text{im},A=text{rank},A$
    .






    share|cite|improve this answer









    $endgroup$














      Your Answer








      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%2f3050088%2fprojection-matrixes-a-b-such-that-textid-ab-is-invertible%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      4












      $begingroup$

      The $5times 5$ assumption is indeed irrelevant. As a hint, try writing $Id-(A+B)$ as $(Id-A)-B$.



      A full proof is hidden below.




      Let's say our matrices are $ntimes n$, and $A$ has rank $a$ and $B$ has rank $b$. Note then that $Id-A$ is a projection of rank $n-a$, and so $(Id-A)-B$ has rank at most $n-a+b$ (its image is contained in the sum of the image of $Id-A$ and the image of $B$). Since $(Id-A)-B$ is invertible, we have $nleq n-a+b$ and so $aleq b$. But swapping the roles of $A$ and $B$, we also get $bleq a$, and so $a=b$.







      share|cite|improve this answer









      $endgroup$


















        4












        $begingroup$

        The $5times 5$ assumption is indeed irrelevant. As a hint, try writing $Id-(A+B)$ as $(Id-A)-B$.



        A full proof is hidden below.




        Let's say our matrices are $ntimes n$, and $A$ has rank $a$ and $B$ has rank $b$. Note then that $Id-A$ is a projection of rank $n-a$, and so $(Id-A)-B$ has rank at most $n-a+b$ (its image is contained in the sum of the image of $Id-A$ and the image of $B$). Since $(Id-A)-B$ is invertible, we have $nleq n-a+b$ and so $aleq b$. But swapping the roles of $A$ and $B$, we also get $bleq a$, and so $a=b$.







        share|cite|improve this answer









        $endgroup$
















          4












          4








          4





          $begingroup$

          The $5times 5$ assumption is indeed irrelevant. As a hint, try writing $Id-(A+B)$ as $(Id-A)-B$.



          A full proof is hidden below.




          Let's say our matrices are $ntimes n$, and $A$ has rank $a$ and $B$ has rank $b$. Note then that $Id-A$ is a projection of rank $n-a$, and so $(Id-A)-B$ has rank at most $n-a+b$ (its image is contained in the sum of the image of $Id-A$ and the image of $B$). Since $(Id-A)-B$ is invertible, we have $nleq n-a+b$ and so $aleq b$. But swapping the roles of $A$ and $B$, we also get $bleq a$, and so $a=b$.







          share|cite|improve this answer









          $endgroup$



          The $5times 5$ assumption is indeed irrelevant. As a hint, try writing $Id-(A+B)$ as $(Id-A)-B$.



          A full proof is hidden below.




          Let's say our matrices are $ntimes n$, and $A$ has rank $a$ and $B$ has rank $b$. Note then that $Id-A$ is a projection of rank $n-a$, and so $(Id-A)-B$ has rank at most $n-a+b$ (its image is contained in the sum of the image of $Id-A$ and the image of $B$). Since $(Id-A)-B$ is invertible, we have $nleq n-a+b$ and so $aleq b$. But swapping the roles of $A$ and $B$, we also get $bleq a$, and so $a=b$.








          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 23 '18 at 5:42









          Eric WofseyEric Wofsey

          193k14221352




          193k14221352























              5












              $begingroup$

              You don't need $5times 5$, $ntimes n$ works.



              You also don't need $Bbb R$, any field will work.



              As you say, consider $Bbb R^n=text{im},A+ker A$.
              On $text{im}, A$, $I-A$ vanishes, so for $I-A-B$ to be invertible,
              $B$ must be injective on $text{im}, A$. Therefore $text{rank},Bgedim
              text{im},A=text{rank},A$
              .






              share|cite|improve this answer









              $endgroup$


















                5












                $begingroup$

                You don't need $5times 5$, $ntimes n$ works.



                You also don't need $Bbb R$, any field will work.



                As you say, consider $Bbb R^n=text{im},A+ker A$.
                On $text{im}, A$, $I-A$ vanishes, so for $I-A-B$ to be invertible,
                $B$ must be injective on $text{im}, A$. Therefore $text{rank},Bgedim
                text{im},A=text{rank},A$
                .






                share|cite|improve this answer









                $endgroup$
















                  5












                  5








                  5





                  $begingroup$

                  You don't need $5times 5$, $ntimes n$ works.



                  You also don't need $Bbb R$, any field will work.



                  As you say, consider $Bbb R^n=text{im},A+ker A$.
                  On $text{im}, A$, $I-A$ vanishes, so for $I-A-B$ to be invertible,
                  $B$ must be injective on $text{im}, A$. Therefore $text{rank},Bgedim
                  text{im},A=text{rank},A$
                  .






                  share|cite|improve this answer









                  $endgroup$



                  You don't need $5times 5$, $ntimes n$ works.



                  You also don't need $Bbb R$, any field will work.



                  As you say, consider $Bbb R^n=text{im},A+ker A$.
                  On $text{im}, A$, $I-A$ vanishes, so for $I-A-B$ to be invertible,
                  $B$ must be injective on $text{im}, A$. Therefore $text{rank},Bgedim
                  text{im},A=text{rank},A$
                  .







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 23 '18 at 5:42









                  Lord Shark the UnknownLord Shark the Unknown

                  109k1163136




                  109k1163136






























                      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%2f3050088%2fprojection-matrixes-a-b-such-that-textid-ab-is-invertible%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

                      Plaza Victoria

                      Puebla de Zaragoza

                      Musa