Sylvester's criterion

Summary

In mathematics, Sylvester’s criterion is a necessary and sufficient criterion to determine whether a Hermitian matrix is positive-definite.

Sylvester's criterion states that a n × n Hermitian matrix M is positive-definite if and only if all the following matrices have a positive determinant:

  • the upper left 1-by-1 corner of M,
  • the upper left 2-by-2 corner of M,
  • the upper left 3-by-3 corner of M,
  • M itself.

In other words, all of the leading principal minors must be positive. By using appropriate permutations of rows and columns of M, it can also be shown that the positivity of any nested sequence of n principal minors of M is equivalent to M being positive-definite.[1]

An analogous theorem holds for characterizing positive-semidefinite Hermitian matrices, except that it is no longer sufficient to consider only the leading principal minors as illustrated by the Hermitian matrix

A Hermitian matrix M is positive-semidefinite if and only if all principal minors of M are nonnegative.[2][3]

Proof for the case of positive definite matrices edit

Suppose  is   Hermitian matrix  . Let   be the principal minor matrices, i.e. the   upper left corner matrices. It will be shown that if   is positive definite, then the principal minors are positive; that is,   for all  .

  is positive definite. Indeed, choosing

 

we can notice that   Equivalently, the eigenvalues of   are positive, and this implies that   since the determinant is the product of the eigenvalues.

To prove the reverse implication, we use induction. The general form of an   Hermitian matrix is

 ,

where   is an   Hermitian matrix,   is a vector and   is a real constant.

Suppose the criterion holds for  . Assuming that all the principal minors of   are positive implies that  ,  , and that   is positive definite by the inductive hypothesis. Denote

 

then

 

By completing the squares, this last expression is equal to

 
 

where   (note that   exists because the eigenvalues of   are all positive.) The first term is positive by the inductive hypothesis. We now examine the sign of the second term. By using the block matrix determinant formula

 

on   we obtain

 , which implies  .

Consequently,  

Proof for the case of positive semidefinite matrices edit

Let   be an n x n Hermitian matrix. Suppose   is semidefinite. Essentially the same proof as for the case that   is strictly positive definite shows that all principal minors (not necessarily the leading principal minors) are non-negative.

For the reverse implication, it suffices to show that if   has all non-negative principal minors, then for all t>0, all leading principal minors of the Hermitian matrix   are strictly positive, where   is the nxn identity matrix. Indeed, from the positive definite case, we would know that the matrices   are strictly positive definite. Since the limit of positive definite matrices is always positive semidefinite, we can take   to conclude.

To show this, let   be the kth leading principal submatrix of   We know that   is a polynomial in t, related to the characteristic polynomial   via

 
We use the identity in Characteristic polynomial#Properties to write
 
where   is the trace of the jth exterior power of  

From Minor_(linear_algebra)#Multilinear_algebra_approach, we know that the entries in the matrix expansion of   (for j > 0) are just the minors of   In particular, the diagonal entries are the principal minors of  , which of course are also principal minors of  , and are thus non-negative. Since the trace of a matrix is the sum of the diagonal entries, it follows that

 
Thus the coefficient of   in   is non-negative for all j > 0. For j = 0, it is clear that the coefficient is 1. In particular,   for all t > 0, which is what was required to show.

Notes edit

  1. ^ Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6. See Theorem 7.2.5.
  2. ^ Carl D. Meyer, Matrix Analysis and Applied Linear Algebra. See section 7.6 Positive Definite Matrices, page 566
  3. ^ Prussing, John E. (1986), "The Principal Minor Test for Semidefinite Matrices" (PDF), Journal of Guidance, Control, and Dynamics, 9 (1): 121–122, Bibcode:1986JGCD....9..121P, doi:10.2514/3.20077, archived from the original (PDF) on 2017-01-07, retrieved 2017-09-28

References edit

  • Gilbert, George T. (1991), "Positive definite matrices and Sylvester's criterion", The American Mathematical Monthly, 98 (1), Mathematical Association of America: 44–46, doi:10.2307/2324036, ISSN 0002-9890, JSTOR 2324036.
  • Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6. Theorem 7.2.5.
  • Carl D. Meyer (June 2000), Matrix Analysis and Applied Linear Algebra, SIAM, ISBN 0-89871-454-0.