MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have $A^{1/2} B A^{1/2} \preceq I$ for two PSD matrices $A$ and $B$, and I'd like to know if that implies $\|AB\|_2 \leq 1.$

The argument I was using to show this is that for any two square matrices $A$ and $B,$ it is always the case that $\|AB\|_2 = \|BA\|_2.$ I thought I read that this equality does hold in a reputable source, but I don't have access to it right now and I was unsuccessful in reproducing a proof.

I know the eigenvalues of $AB$ and $BA$ are the same modulo possibly having different numbers of zeros, so I'm worried that I might have ``remembered'' something that isn't true!

Any references/counterexamples for either question?

share|cite|improve this question
This is false in general. You can find $A, B$ such that $AB = 0$ but $BA \neq 0$ (although the result you cite shows that $BA$ is nilpotent). The spectral norm is defined in terms of singular values, not eigenvalues. – Qiaochu Yuan Feb 22 '13 at 7:27
up vote 11 down vote accepted

I suppose that your norm is either the Schur-Frobenius $\|F\|=({\rm Tr}FF^T)^{1/2}$ or that subordinated to the Euclidan norm $\|F\|=\rho(FF^T)$. In either case, the equality $\|AB\|=\|BA\|$ follows from the equality of the spectra of $ABBA$ and $BAAB$ (mind that $A$ and $B$ are symmetric). This is true because both matrices are similar to $A^2B^2$ (mind that $A$ and $B$ are non-singular).

If you drop your assumption that $A,B$ are PSD, then the equality does not hold in general. A simple counter-example is given by a pair $(A,B)$ such that $AB=0_n$ but $BA\neq 0_n$.

share|cite|improve this answer

Going back to the original motivation, the following observations might still be useful.

  1. Denis already mentioned this: $A^{1/2}BA^{1/2} \sim A^{1/2}A^{1/2}BA^{1/2}A^{-1/2}$ for strictly positive $A$. This implies that $\sigma(A^{1/2}BA^{1/2})=\sigma(AB)$.

  2. If $A$ and $B$ are arbitrary (square) matrices such that their product $AB$ is normal, then one can show that $\sigma(AB) \prec_w \sigma(BA)$ (where $\prec_w$ denotes weak majorization); equivalently, for any unitarily invariant norm, we have $\|AB\| \le \|BA\|$.

  3. If $\|AB\| \le 1$ for positive definite $A$ and $B$, then $\|A^{1/2}B^{1/2}\| \le 1$.

share|cite|improve this answer
In (1), the assumption that $A$ is strictly positive is unnecessary since strictly positive matrices are dense in all positive matrices. – Eric Wofsey Feb 22 '13 at 19:28
@Eric: yes indeed; I just wrote it so that it was ok to write $A^{-1/2}$ instead of $(A+\epsilon I)^{-1/2}$, and then let $\epsilon \to 0$ – Suvrit Feb 22 '13 at 19:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.