Does $ 0 \leq A \leq B \implies 0\leq B^\dagger \leq A^\dagger$?

81 Views Asked by At

The question is stated in the title. Where $A$ and $B$ are positive definite real matrices and $\dagger$ stands for the Moore Penrose inverse.

This question link1 seems to be close but it has an aditional assumption that $Ker(A) = Ker(B)$.

1

There are 1 best solutions below

0
On BEST ANSWER

This cannot work without the assumption on the null spaces. To see this, take $A=0$, $B\ge0$ but not zero. Then $A^\dagger\le B^\dagger$ but these matrices are not equal, thus the claim is not valid.