9
$\begingroup$

Supposing $V$ is a finite dimensional vector space (over $\mathbb{R}$) of dimension $n$, and $A,B$ are symmetric positive definite linear mappings from $V$ to $V$, how can I show that in any orthonormal basis $\mathrm{tr}(AB) \geq 0$?

I noticed that since they are symmetric we have that $\mathrm{tr}(AB) = \sum_{i=1}^n\sum_{j=1}^nA_{ij}B_{ji} = \sum_{i=1}^n\sum_{j=1}^nA_{ij}B_{ij}$ which is the sum of the elements of the element-wise product of $A,B$. I don't know if this is helpful.

  • 0
    Yes we may assume $V=\mathbb{R}^n$ and yes you may use the spectral theorem. But remember the result must hold for all orthonormal bases, not just the one where $A$ is diagonal.\2012-02-25

3 Answers 3

8

Since this may be homework, I will only give hints.

  1. Without loss of generality you may assume that $V=R^n$.

  2. Trace is independent of the basis you use. Thus it suffices to show this in the basis where $A$ is diagonal.

  3. A positive semi-definite matrix has nonnegative diagonal. Why?

  4. Putting 1-3 together, one needs to show that the $tr(AB)\geq 0$ where $A$ is a nonnegative diagonal matrix and $B$ has nonnegative diagonal.

13

As others have remarked, you might as well suppose that $A$ and $B$ are positive semidefinite matrices. We may write $A = X^{t}X$ and $B = Y^{t}Y$ where $X$ and $Y$ are $n \times n$ real matrices. Then ${\rm tr}(AB) = {\rm tr}(X^{t}X Y^{t}Y)$ = ${\rm tr}((YX^{t})(XY^{t})).$ The latter matrix has the form ${\rm tr}(UU^{t})$ for a real $n \times n$ matrix $U$, and such a trace is always non-negative.