23

If $A$ is a positive semidefinite matrix ($A\succeq 0)$, does it imply that $\mbox{Tr}(A)\geq 0$, where the $\mbox{Tr}(\cdot)$ denotes the trace.

If not, any counter-example? Thanks.

MIMIGA
  • 1,121
  • 3
  • 9
  • 17

3 Answers3

39

Suppose that $A = [a_{ij}]_{i,j=1}^n$ is such that $a_{ii} < 0$ for some $i$. Let $e_i$ be the $i$th standard basis vector; that is, $$ e_i = (\overbrace{0,\cdots,0}^{i-1},1,0,\dots,0) $$ then $e_i^T Ae_i = a_{ii} < 0$, which means that $A$ is not positive semidefinite.

So, if $A$ is positive semidefinite, then all diagonal elements are non-negative, which means that the trace is non-negative.

Ben Grossmann
  • 234,171
  • 12
  • 184
  • 355
20

Yes. If the matrix is semi-positive definite, all the eigenvalues are non-negative. The trace being equal to the sum of eigenvalues, we conclude that the trace has to be non-negative.

8

We know that positive semi-definite matrices have nonnegative eigenvalues, and the trace of a matrix is equal to the sum of its eigenvalues. Because sum of nonnegative numbers is nonnegative, the trace of a positive semi-definite matrix is nonnegative.

user153012
  • 12,890
  • 5
  • 42
  • 115