Does $A \preccurlyeq B$ imply that $\|Ax\| \leq \|Bx\|$ for all $x$?
I assume that $A,B$ are symmetric matrices and $A \preccurlyeq B$ denotes that $B-A$ is positive semi-definite. I can see that $A \preccurlyeq B$ implies several related properties, like
- $\|A\|\leq \|B\|$, if $A,B$ are positive semidefinite,
- $\|A^{\frac 1 2} x\| \leq \|B^{\frac 1 2} x\|$.
But does it also imply $\|Ax\| \leq \|Bx\|$ for all $x$? What if we assume both $A,B$ to be positive semidefinite?