1

Today I found a problem concerning positive semidefinite matrix:

Suppose $A$ is a positive semidefinite matrix, with eigenvalues: $\lambda_1\geq\dots\geq\lambda_n$, and diagonal elements: $a_{11}\geq\dots\geq a_{nn}$. Now prove that, for any $k\leq n$, $\sum_{i=1}^k\lambda_i\geq\sum_{i=1}^ka_{ii}$.

Now for $k=1,n-1,n$, the problem is trivial. But what about the other $k$?

This proposition is very likely to be true as I've run some simulation on MATLAB, without finding any exception.

However this seems hard to prove. I think maybe some transformation needs to be done. Anyone has any clue? Thanks~

Besides there are some background in PCA. I shall provide some supplement if necessary later.

cmk
  • 12,303

1 Answers1

0

By Sylvester's criterion, a symmetric matrix is positive semi-definite if and only if all its principal minors are non-negative. This in particular means that all the principal submatrices are also positive semi-definite themselves. You checked the result for $k=1$, so it is true in general by induction.

Ivo Terek
  • 77,665
  • I was about to post a similar answer, but I struggled to clarify the relationship between the eigenvalues of the principle minors and the eigenvalues of the full matrix. Could you elaborate on this point? – Theo Bendit Jul 25 '19 at 23:21
  • 1
    You're right, that's actually a non-trivial step and the eigenvalues of the principal submatrices do not need to be the same as the eigenvalues of the original matrix, I was a bit hasty. It seems that we can bound the eigenvalues of the submatrix between the eigenvalues of the original matrix, according to this answer. – Ivo Terek Jul 25 '19 at 23:36
  • yeah it's true, only considering the minors seems not strong enough – DiaryofNewton Jul 26 '19 at 00:22
  • 1
    Ok I think Ivo Terek got the key. Using those bounds I can indeed solve the problem. Thanks A Lot !!!!!!!!!!!!!!! This problem bothers me for a whole day lol. – DiaryofNewton Jul 26 '19 at 02:56