If both $A-B$ and $B-A$ are positive semidefinite, then $A = B$$x^TAx=0$ for all $x$ when $A$ is a skew...

How do I extract a value from a time formatted value in excel?

Unreliable Magic - Is it worth it?

What is the opposite of 'gravitas'?

Pre-amplifier input protection

Is exact Kanji stroke length important?

How did Arya survive the stabbing?

Is this apparent Class Action settlement a spam message?

Avoiding estate tax by giving multiple gifts

Hostile work environment after whistle-blowing on coworker and our boss. What do I do?

How easy is it to start Magic from scratch?

Detecting if an element is found inside a container

What is the best translation for "slot" in the context of multiplayer video games?

What happens if you roll doubles 3 times then land on "Go to jail?"

Failed to fetch jessie backports repository

How long to clear the 'suck zone' of a turbofan after start is initiated?

Trouble understanding the speech of overseas colleagues

Type int? vs type int

Roman Numeral Treatment of Suspensions

Large drywall patch supports

Integer addition + constant, is it a group?

How to run a prison with the smallest amount of guards?

Implement the Thanos sorting algorithm

How do scammers retract money, while you can’t?

Is a stroke of luck acceptable after a series of unfavorable events?



If both $A-B$ and $B-A$ are positive semidefinite, then $A = B$


$x^TAx=0$ for all $x$ when $A$ is a skew symmetric matrixIs the product of symmetric positive semidefinite matrices positive definite?Linear system with positive semidefinite matrixIf $A$ and $B$ are positive definite, then is $B^{-1} - A^{-1}$ positive semidefinite?Is a sinc-distance matrix positive semidefinite?On one property of positive semidefinite matricesA symmetric real matrix with all diagonal entries unspecified can be completed to be positive semidefiniteSimultaneous Diagonalization of Symmetric Positive Semidefinite matricesAre these positive semidefinite matrices invertible?Showing a matrix positive semidefiniteIs this matrix product positive semidefinite?













1












$begingroup$



Let $A, B$ be two positive semidefinite matrices. Prove that if both $A-B$ and $B-A$ are positive semidefinite, then $A = B$.




I can show that their diagonal elements are the same but for others I have no idea. Any help will be appreciated.










share|cite|improve this question











$endgroup$

















    1












    $begingroup$



    Let $A, B$ be two positive semidefinite matrices. Prove that if both $A-B$ and $B-A$ are positive semidefinite, then $A = B$.




    I can show that their diagonal elements are the same but for others I have no idea. Any help will be appreciated.










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$



      Let $A, B$ be two positive semidefinite matrices. Prove that if both $A-B$ and $B-A$ are positive semidefinite, then $A = B$.




      I can show that their diagonal elements are the same but for others I have no idea. Any help will be appreciated.










      share|cite|improve this question











      $endgroup$





      Let $A, B$ be two positive semidefinite matrices. Prove that if both $A-B$ and $B-A$ are positive semidefinite, then $A = B$.




      I can show that their diagonal elements are the same but for others I have no idea. Any help will be appreciated.







      linear-algebra matrices symmetric-matrices positive-semidefinite






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 15 at 17:34









      Rodrigo de Azevedo

      13.2k41960




      13.2k41960










      asked Mar 15 at 17:26









      honzaikhonzaik

      286




      286






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          One route is to observe that if $lambda,v$ is an eigenvalue/eigenvector pair of $M$ with , then $(-M)v=-lambda v$, meaning that $-lambda$ is an eigenvalue of $(-M)$. Since $M:=A-B$ is positive semidefinite, conclude that any eigenvalue of $M$ satisfies $0leq lambdaleq 0$, so $lambda=0$, so that $M=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much! Thats a neat proof
            $endgroup$
            – honzaik
            Mar 15 at 18:15



















          1












          $begingroup$

          By assumption $A-B=-(B-A)$ is both positive semidefinite and negative semidefinite. This can only happen if $A-B=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
            $endgroup$
            – honzaik
            Mar 15 at 17:57












          • $begingroup$
            I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
            $endgroup$
            – chhro
            Mar 15 at 18:01










          • $begingroup$
            actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
            $endgroup$
            – chhro
            Mar 15 at 18:05










          • $begingroup$
            well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
            $endgroup$
            – honzaik
            Mar 15 at 18:10













          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%2f3149576%2fif-both-a-b-and-b-a-are-positive-semidefinite-then-a-b%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









          2












          $begingroup$

          One route is to observe that if $lambda,v$ is an eigenvalue/eigenvector pair of $M$ with , then $(-M)v=-lambda v$, meaning that $-lambda$ is an eigenvalue of $(-M)$. Since $M:=A-B$ is positive semidefinite, conclude that any eigenvalue of $M$ satisfies $0leq lambdaleq 0$, so $lambda=0$, so that $M=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much! Thats a neat proof
            $endgroup$
            – honzaik
            Mar 15 at 18:15
















          2












          $begingroup$

          One route is to observe that if $lambda,v$ is an eigenvalue/eigenvector pair of $M$ with , then $(-M)v=-lambda v$, meaning that $-lambda$ is an eigenvalue of $(-M)$. Since $M:=A-B$ is positive semidefinite, conclude that any eigenvalue of $M$ satisfies $0leq lambdaleq 0$, so $lambda=0$, so that $M=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much! Thats a neat proof
            $endgroup$
            – honzaik
            Mar 15 at 18:15














          2












          2








          2





          $begingroup$

          One route is to observe that if $lambda,v$ is an eigenvalue/eigenvector pair of $M$ with , then $(-M)v=-lambda v$, meaning that $-lambda$ is an eigenvalue of $(-M)$. Since $M:=A-B$ is positive semidefinite, conclude that any eigenvalue of $M$ satisfies $0leq lambdaleq 0$, so $lambda=0$, so that $M=0$.






          share|cite|improve this answer









          $endgroup$



          One route is to observe that if $lambda,v$ is an eigenvalue/eigenvector pair of $M$ with , then $(-M)v=-lambda v$, meaning that $-lambda$ is an eigenvalue of $(-M)$. Since $M:=A-B$ is positive semidefinite, conclude that any eigenvalue of $M$ satisfies $0leq lambdaleq 0$, so $lambda=0$, so that $M=0$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 15 at 17:45









          Alex R.Alex R.

          25.1k12452




          25.1k12452












          • $begingroup$
            Thank you very much! Thats a neat proof
            $endgroup$
            – honzaik
            Mar 15 at 18:15


















          • $begingroup$
            Thank you very much! Thats a neat proof
            $endgroup$
            – honzaik
            Mar 15 at 18:15
















          $begingroup$
          Thank you very much! Thats a neat proof
          $endgroup$
          – honzaik
          Mar 15 at 18:15




          $begingroup$
          Thank you very much! Thats a neat proof
          $endgroup$
          – honzaik
          Mar 15 at 18:15











          1












          $begingroup$

          By assumption $A-B=-(B-A)$ is both positive semidefinite and negative semidefinite. This can only happen if $A-B=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
            $endgroup$
            – honzaik
            Mar 15 at 17:57












          • $begingroup$
            I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
            $endgroup$
            – chhro
            Mar 15 at 18:01










          • $begingroup$
            actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
            $endgroup$
            – chhro
            Mar 15 at 18:05










          • $begingroup$
            well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
            $endgroup$
            – honzaik
            Mar 15 at 18:10


















          1












          $begingroup$

          By assumption $A-B=-(B-A)$ is both positive semidefinite and negative semidefinite. This can only happen if $A-B=0$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
            $endgroup$
            – honzaik
            Mar 15 at 17:57












          • $begingroup$
            I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
            $endgroup$
            – chhro
            Mar 15 at 18:01










          • $begingroup$
            actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
            $endgroup$
            – chhro
            Mar 15 at 18:05










          • $begingroup$
            well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
            $endgroup$
            – honzaik
            Mar 15 at 18:10
















          1












          1








          1





          $begingroup$

          By assumption $A-B=-(B-A)$ is both positive semidefinite and negative semidefinite. This can only happen if $A-B=0$.






          share|cite|improve this answer









          $endgroup$



          By assumption $A-B=-(B-A)$ is both positive semidefinite and negative semidefinite. This can only happen if $A-B=0$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 15 at 17:32









          chhrochhro

          1,444311




          1,444311












          • $begingroup$
            its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
            $endgroup$
            – honzaik
            Mar 15 at 17:57












          • $begingroup$
            I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
            $endgroup$
            – chhro
            Mar 15 at 18:01










          • $begingroup$
            actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
            $endgroup$
            – chhro
            Mar 15 at 18:05










          • $begingroup$
            well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
            $endgroup$
            – honzaik
            Mar 15 at 18:10




















          • $begingroup$
            its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
            $endgroup$
            – honzaik
            Mar 15 at 17:57












          • $begingroup$
            I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
            $endgroup$
            – chhro
            Mar 15 at 18:01










          • $begingroup$
            actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
            $endgroup$
            – chhro
            Mar 15 at 18:05










          • $begingroup$
            well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
            $endgroup$
            – honzaik
            Mar 15 at 18:10


















          $begingroup$
          its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
          $endgroup$
          – honzaik
          Mar 15 at 17:57






          $begingroup$
          its this equivalent to saying that $x^TAx=0 forall x implies A = 0$ which is wrong (math.stackexchange.com/questions/358281/…) ?
          $endgroup$
          – honzaik
          Mar 15 at 17:57














          $begingroup$
          I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
          $endgroup$
          – chhro
          Mar 15 at 18:01




          $begingroup$
          I assumed we are working over $mathbb C$ and so we are using $x^*Ax$. So the link is not relevant.
          $endgroup$
          – chhro
          Mar 15 at 18:01












          $begingroup$
          actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
          $endgroup$
          – chhro
          Mar 15 at 18:05




          $begingroup$
          actually, the argument still works since the real positive semidefinite matrices=real symmetric matrices with nonnegative eigenvalues. I don't see the point of mentioning the link. I didn't use that in the argument.
          $endgroup$
          – chhro
          Mar 15 at 18:05












          $begingroup$
          well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
          $endgroup$
          – honzaik
          Mar 15 at 18:10






          $begingroup$
          well i assumed you meant $0 geq -x^T (B-A) x = x^T (A-B) x geq 0$. I guess when I hear positive semidef etc I assume this definition with vectors.
          $endgroup$
          – honzaik
          Mar 15 at 18:10




















          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%2f3149576%2fif-both-a-b-and-b-a-are-positive-semidefinite-then-a-b%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

          Nidaros erkebispedøme

          Birsay

          Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...