How to prove the following rank equality?Equality case in the Frobenius rank inequalityEqualities of rank inequalitiesMatrix rank inequalityRank of a block lower triangular matrixProving a matrix rank equalityLet $A$ and $B$ be two square Hermitian matrices such that $AB = 0 = BA$. Prove that $mboxrank (A + B) = mboxrank(A) + mboxrank (B)$.Rank of a matrix sum: equality caseOn the equality of the rank-sum inequalityRank of projection matrix $P$$a_k = rank(A^k+1) - rank(A^k)$ is increasing

Is expanding the research of a group into machine learning as a PhD student risky?

Why are on-board computers allowed to change controls without notifying the pilots?

Generic lambda vs generic function give different behaviour

Can I use my Chinese passport to enter China after I acquired another citizenship?

At which point does a character regain all their Hit Dice?

What is the intuitive meaning of having a linear relationship between the logs of two variables?

Increase performance creating Mandelbrot set in python

What is difference between behavior and behaviour

The baby cries all morning

How will losing mobility of one hand affect my career as a programmer?

What to do with wrong results in talks?

Failed to fetch jessie backports repository

voltage of sounds of mp3files

I'm in charge of equipment buying but no one's ever happy with what I choose. How to fix this?

Can somebody explain Brexit in a few child-proof sentences?

How can I replace every global instance of "x[2]" with "x_2"

Time travel short story where a man arrives in the late 19th century in a time machine and then sends the machine back into the past

Is there any reason not to eat food that's been dropped on the surface of the moon?

Implement the Thanos sorting algorithm

Is this Spell Mimic feat balanced?

Applicability of Single Responsibility Principle

Print name if parameter passed to function

Products and sum of cubes in Fibonacci

Teaching indefinite integrals that require special-casing



How to prove the following rank equality?


Equality case in the Frobenius rank inequalityEqualities of rank inequalitiesMatrix rank inequalityRank of a block lower triangular matrixProving a matrix rank equalityLet $A$ and $B$ be two square Hermitian matrices such that $AB = 0 = BA$. Prove that $mboxrank (A + B) = mboxrank(A) + mboxrank (B)$.Rank of a matrix sum: equality caseOn the equality of the rank-sum inequalityRank of projection matrix $P$$a_k = rank(A^k+1) - rank(A^k)$ is increasing













1












$begingroup$



Let $A,Bin M_n$. Show that $$mboxrank,(A-ABA)=mboxrank,(A)+mboxrank,(I_n-BA)-n$$




I have showed one part by using Sylvester rank inequality. How to prove the equality case?










share|cite|improve this question











$endgroup$
















    1












    $begingroup$



    Let $A,Bin M_n$. Show that $$mboxrank,(A-ABA)=mboxrank,(A)+mboxrank,(I_n-BA)-n$$




    I have showed one part by using Sylvester rank inequality. How to prove the equality case?










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$



      Let $A,Bin M_n$. Show that $$mboxrank,(A-ABA)=mboxrank,(A)+mboxrank,(I_n-BA)-n$$




      I have showed one part by using Sylvester rank inequality. How to prove the equality case?










      share|cite|improve this question











      $endgroup$





      Let $A,Bin M_n$. Show that $$mboxrank,(A-ABA)=mboxrank,(A)+mboxrank,(I_n-BA)-n$$




      I have showed one part by using Sylvester rank inequality. How to prove the equality case?







      linear-algebra matrices matrix-rank






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 17 at 12:57









      Rodrigo de Azevedo

      13.2k41960




      13.2k41960










      asked Mar 17 at 12:42









      J.DoeJ.Doe

      341




      341




















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Fix a basis of $mathbb F^n$ (where $mathbb F$ is the field of entries of $A$ and $B$) so that $A$ and $B$ can be considered as linear transformations. Now, since $A - ABA = A(I - BA)$, we have
          $requireAMScdDeclareMathOperatorimimDeclareMathOperatorrankrankDeclareMathOperatornullnull$



          beginCD
          mathbb F^n @>I-BA>> im(I - BA) @>A>> im(A - ABA)\
          endCD



          so that by the rank-nullity theorem applied on the second map, $A$,



          $$dim im(I - BA) = dim im(A - ABA) + null A$$



          where $null A$ is the nullity of $A$ in $im(I - BA)$. Thus,



          beginequation
          rank(I - BA) = rank(A - ABA) + null A. tag1labelrk-null
          endequation



          We shall show that the nullity of $A$ in $im(I - BA)$ is the nullity of $A$ in $mathbb F^n$ itself.



          Let $x in ker_mathbb F^N A$. Then $Ax = 0 implies BAx = 0$, so we may write $x = x - BAx = (I - BA)x$, which shows that $ker_mathbb F^n A subseteq im(I - BA)$. Thus, $ker_im(I - BA) A = ker_mathbb F^n cap im(I - BA) = ker_mathbb F^n A$. Thus, $null A = n - rank A$ in $im(I - BA)$.



          Then the result follows from eqrefrk-null.






          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%2f3151498%2fhow-to-prove-the-following-rank-equality%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$

            Fix a basis of $mathbb F^n$ (where $mathbb F$ is the field of entries of $A$ and $B$) so that $A$ and $B$ can be considered as linear transformations. Now, since $A - ABA = A(I - BA)$, we have
            $requireAMScdDeclareMathOperatorimimDeclareMathOperatorrankrankDeclareMathOperatornullnull$



            beginCD
            mathbb F^n @>I-BA>> im(I - BA) @>A>> im(A - ABA)\
            endCD



            so that by the rank-nullity theorem applied on the second map, $A$,



            $$dim im(I - BA) = dim im(A - ABA) + null A$$



            where $null A$ is the nullity of $A$ in $im(I - BA)$. Thus,



            beginequation
            rank(I - BA) = rank(A - ABA) + null A. tag1labelrk-null
            endequation



            We shall show that the nullity of $A$ in $im(I - BA)$ is the nullity of $A$ in $mathbb F^n$ itself.



            Let $x in ker_mathbb F^N A$. Then $Ax = 0 implies BAx = 0$, so we may write $x = x - BAx = (I - BA)x$, which shows that $ker_mathbb F^n A subseteq im(I - BA)$. Thus, $ker_im(I - BA) A = ker_mathbb F^n cap im(I - BA) = ker_mathbb F^n A$. Thus, $null A = n - rank A$ in $im(I - BA)$.



            Then the result follows from eqrefrk-null.






            share|cite|improve this answer









            $endgroup$

















              1












              $begingroup$

              Fix a basis of $mathbb F^n$ (where $mathbb F$ is the field of entries of $A$ and $B$) so that $A$ and $B$ can be considered as linear transformations. Now, since $A - ABA = A(I - BA)$, we have
              $requireAMScdDeclareMathOperatorimimDeclareMathOperatorrankrankDeclareMathOperatornullnull$



              beginCD
              mathbb F^n @>I-BA>> im(I - BA) @>A>> im(A - ABA)\
              endCD



              so that by the rank-nullity theorem applied on the second map, $A$,



              $$dim im(I - BA) = dim im(A - ABA) + null A$$



              where $null A$ is the nullity of $A$ in $im(I - BA)$. Thus,



              beginequation
              rank(I - BA) = rank(A - ABA) + null A. tag1labelrk-null
              endequation



              We shall show that the nullity of $A$ in $im(I - BA)$ is the nullity of $A$ in $mathbb F^n$ itself.



              Let $x in ker_mathbb F^N A$. Then $Ax = 0 implies BAx = 0$, so we may write $x = x - BAx = (I - BA)x$, which shows that $ker_mathbb F^n A subseteq im(I - BA)$. Thus, $ker_im(I - BA) A = ker_mathbb F^n cap im(I - BA) = ker_mathbb F^n A$. Thus, $null A = n - rank A$ in $im(I - BA)$.



              Then the result follows from eqrefrk-null.






              share|cite|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                Fix a basis of $mathbb F^n$ (where $mathbb F$ is the field of entries of $A$ and $B$) so that $A$ and $B$ can be considered as linear transformations. Now, since $A - ABA = A(I - BA)$, we have
                $requireAMScdDeclareMathOperatorimimDeclareMathOperatorrankrankDeclareMathOperatornullnull$



                beginCD
                mathbb F^n @>I-BA>> im(I - BA) @>A>> im(A - ABA)\
                endCD



                so that by the rank-nullity theorem applied on the second map, $A$,



                $$dim im(I - BA) = dim im(A - ABA) + null A$$



                where $null A$ is the nullity of $A$ in $im(I - BA)$. Thus,



                beginequation
                rank(I - BA) = rank(A - ABA) + null A. tag1labelrk-null
                endequation



                We shall show that the nullity of $A$ in $im(I - BA)$ is the nullity of $A$ in $mathbb F^n$ itself.



                Let $x in ker_mathbb F^N A$. Then $Ax = 0 implies BAx = 0$, so we may write $x = x - BAx = (I - BA)x$, which shows that $ker_mathbb F^n A subseteq im(I - BA)$. Thus, $ker_im(I - BA) A = ker_mathbb F^n cap im(I - BA) = ker_mathbb F^n A$. Thus, $null A = n - rank A$ in $im(I - BA)$.



                Then the result follows from eqrefrk-null.






                share|cite|improve this answer









                $endgroup$



                Fix a basis of $mathbb F^n$ (where $mathbb F$ is the field of entries of $A$ and $B$) so that $A$ and $B$ can be considered as linear transformations. Now, since $A - ABA = A(I - BA)$, we have
                $requireAMScdDeclareMathOperatorimimDeclareMathOperatorrankrankDeclareMathOperatornullnull$



                beginCD
                mathbb F^n @>I-BA>> im(I - BA) @>A>> im(A - ABA)\
                endCD



                so that by the rank-nullity theorem applied on the second map, $A$,



                $$dim im(I - BA) = dim im(A - ABA) + null A$$



                where $null A$ is the nullity of $A$ in $im(I - BA)$. Thus,



                beginequation
                rank(I - BA) = rank(A - ABA) + null A. tag1labelrk-null
                endequation



                We shall show that the nullity of $A$ in $im(I - BA)$ is the nullity of $A$ in $mathbb F^n$ itself.



                Let $x in ker_mathbb F^N A$. Then $Ax = 0 implies BAx = 0$, so we may write $x = x - BAx = (I - BA)x$, which shows that $ker_mathbb F^n A subseteq im(I - BA)$. Thus, $ker_im(I - BA) A = ker_mathbb F^n cap im(I - BA) = ker_mathbb F^n A$. Thus, $null A = n - rank A$ in $im(I - BA)$.



                Then the result follows from eqrefrk-null.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 17 at 13:53









                M. VinayM. Vinay

                7,11322135




                7,11322135



























                    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%2f3151498%2fhow-to-prove-the-following-rank-equality%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

                    How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

                    random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

                    Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye