Lower bounds on the smallest eigenvalue of a sample covariance matrix
Pavel Yaskov
Introduction
Lower bounds on the smallest eigenvalue of a sample covariance matrix (or a Gram matrix) play a crucial role in the least squares problems in high-dimensional statistics (see, for example, ). These problems motivate the present work.
In this paper we derive sharp lower bounds for , where is the smallest eigenvalue of a matrix . We try to impose as few restrictions on the components of as possible. In proofs we use the same strategy as in .
Main results
whenever and as above.
Useful bounds for and in terms of and are given in the following proposition.
In addition, for all and each , is bounded from above by
Applications
We now describe different corollaries of Theorem 2.1 and Theorem 2.2. The next corollary extends Theorem 1.3 in and Theorem 3.1 in (for ).
One may further weaken assumptions in Corollary 3.1. Namely, one may assume that for some The conclusion of Corollary 3.1 will still hold with some that depends only on and . In the case , one would have a lower bound of the form with depending only on
Theorems 2.1 and 2.2 improve Theorem 2.1 in as the next corollary shows.
The same conclusion holds if and .
Let us formulate the final corollary that improves Theorem 3.1 in for small .
The range of applicability of Corollary 3.4 is very wide. Namely, there exist some universal constant such that for a very large class of isotropic random vectors . By Corollary 3.4, this means that is separated from zero by an universal constant.
The existence of follows from results related to Kashin’s decomposition theorem. The infinite dimensional version of this theorem is given in Kashin (for a proof, see ). It states the following.
There is an universal constant such that for some linear subspaces of such that for all where is the standard norm in , .
Proofs.
In proofs of Theorem 2.1 and Theorem 2.2, we follow the strategy of Srivastava and Vershynin . The key step is the following lemma.
The proof of Lemma 4.1 is given in Appendix.
The strategy itself consists in the following. Let be a zero matrix and
Put for , where
Let and be non-negative random variables. Then, for all ,
Proof of Theorem 2.1. Take in Lemma 4.3
hereinafter all inequalities with conditional mathematical expectations hold almost surely. By (2), the latter implies that
Assume first that and for some . Define and in the same way as in (3). Then, by Lemma 4.3 (with ),
Taking in (2), we get and
Finally, consider the case with ( the case with is trivial). By Lemma 4.3 with and ,
Taking in (2), we get
Taking , we get the desired inequality.
Consider the case By Theorem 2.2 with and ,
Proof of Corollary 3.3. Set for given . By Proposition 2.3,
Similarly, taking for in Theorem 2.2, we get that
Proof of Corollary 3.4. Let be such that the second bound in Theorem 2.2 holds. Then, for
Putting and , we finish the proof.
Appendix
Proof of Lemma 4.1. By Lemma 2.2 in Srivastava and Vershynin , if and , then
since by construction.
By Bernoulli’s inequality, whenever . Hence,
where the last equality holds by the definition of Proof of Lemma 4.2. We have
for all By the Cauchy-Schwartz inequality,
This gives the first inequality. Tending to infinity, we get the second inequality.
The last inequality also follows from the Cauchy-Schwartz inequality. Namely,
Fix and By Lemma 4.2,
We have for all . This yields that
Hence, Combining all estimates together yields
Consider the function , . Its derivative
Now consider the case with . By Lemma 4.2,
To finish the proof, we only need to note that
Proof of Lemma 4.4. Since for all we have