# $A\geq B$ implies $A^{\frac{1}{2}}\geq B^{\frac{1}{2}}$ for positive semi-definite matrices $A$ and $B$. [duplicate]

Let $A$ and $B$ be two positive semi-definite $n\times n$ matrices. We say $A\geq B$ if $A-B$ is positive semi-definite.

Let $A^{\frac{1}{2}}$ be the square root of the positive semi-definite matrix $A$.

How to prove if $A\geq B$ then $A^{\frac{1}{2}}\geq B^{\frac{1}{2}}$?

I could prove this for $B=I$, (i.e., $A\geq I \implies A^{\frac{1}{2}}\geq I$. But I am not able to prove it for the general case.

Note:

1) All positive semi-definite matrices are symmetric for me.

2)Square root of a matrix:- Let $A$ be a symmetric matrix, then there exists an orthogonal matrix $P$ such that $P^TAP=diag(\lambda_1,\lambda_2,\cdot, \lambda_n)$, where $\lambda_1,\lambda_2,\cdot, \lambda_n$ are eigenvalues of $A$.

Define $A^{\frac{1}{2}}:=Pdiag(\lambda_1^{\frac{1}{2}},\lambda_2^{\frac{1}{2}},\cdot, \lambda_n^{\frac{1}{2}})P^T$ for a positive semi-definite matrix $A$. (Notice, $\lambda_i^{\frac{1}{2}}$ are well-defined as $\lambda_i$'s are non-negative (since A is positive semi-definite).

## marked as duplicate by user1551 linear-algebra StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Aug 9 '16 at 3:38

• By continuity, it suffices to consider only the case where $B$ is positive definite. – user1551 Aug 9 '16 at 3:36