Sylvester's criterion is a theorem in linear algebra stating that a real symmetric or complex Hermitian matrix is positive definite if and only if all its leading principal minors are positive. It converts a condition on a quadratic form evaluated at every nonzero vector into a finite list of determinant inequalities. The criterion is named after James Joseph Sylvester. Related tests characterize negative definiteness and positive semidefiniteness, but the semidefinite case requires checking all principal minors, not merely the leading ones.
Definitions and statement
Let be an Hermitian matrix, meaning , where denotes its conjugate transpose. For real matrices, this condition reduces to symmetry, .
The associated quadratic form is
Because is Hermitian, is real. Positive definiteness means
A principal submatrix is obtained by selecting the same set of row and column indices. Its determinant is a principal minor. The leading principal submatrix of order uses the first rows and columns:
Write
Sylvester's criterion states:
Only determinants appear in this test. By contrast, there are nonempty principal index sets.
The symmetry or Hermitian assumption is essential. For an arbitrary real matrix,
so positivity of its quadratic form is determined by its symmetric part, not generally by the leading minors of itself.
Examples
A two-dimensional matrix
For a real symmetric matrix
the criterion gives
These conditions also imply . Positive diagonal entries alone are not sufficient: the matrix
has positive diagonal entries but determinant , and its quadratic form takes both positive and negative values.
For the complex Hermitian matrix
the corresponding conditions are
A three-dimensional matrix
Consider
Its leading principal minors are
All are positive, so is positive definite without explicitly computing its eigenvalues.
Why the criterion works
Necessity
Suppose is positive definite. Every leading principal submatrix is also positive definite: for any nonzero , extend to a vector in by appending zeros. Then
By the spectral theorem, a Hermitian positive-definite matrix has strictly positive eigenvalues. Its determinant is their product, so
for every .
Sufficiency
The converse follows by induction and completing the square. The one-dimensional case is immediate. For the induction step, write
where . The leading principal minors of are positive, so the induction hypothesis makes positive definite and invertible.
Define the scalar
The block determinant identity gives
and therefore
For and ,
Both terms are nonnegative. If , the second is positive; if and , the first is positive. Thus is positive definite.
Factorization interpretation
When every leading principal minor is nonzero, a Hermitian matrix admits a factorization
where is unit lower triangular and is real diagonal. Its diagonal entries satisfy
Consequently, positivity of every is equivalent to positivity of every diagonal entry of . Since
and is invertible, this gives another proof of the criterion.
When is positive, its diagonal entries have positive square roots, yielding
This is the Cholesky decomposition. Sylvester's criterion therefore connects determinant inequalities with the existence of a triangular factorization having positive diagonal entries.
Negative definiteness and semidefiniteness
Negative definiteness
A Hermitian matrix is negative definite when
Applying Sylvester's criterion to gives
Thus its leading principal minors alternate in sign:
Positive semidefiniteness
A Hermitian matrix is positive semidefinite when
The correct principal-minor characterization is
Simply replacing by in the leading-minor test is invalid. For example,
has leading principal minors and , yet
Its nonleading principal minor detects the failure.
Necessity follows because every principal submatrix of a positive-semidefinite matrix is positive semidefinite. For sufficiency, if all principal minors are nonnegative, then every leading principal minor of
is strictly positive: expanding its determinant in powers of gives nonnegative coefficients from principal minors and a positive highest-degree term. Sylvester's criterion makes positive definite. Letting tend to zero yields .
Similarly, negative semidefiniteness requires every principal minor of order to satisfy
Applications and computational limitations
In mathematical optimization, the criterion supplies a practical test for the Hessian matrix at a stationary point. For a twice continuously differentiable real-valued function, a positive-definite Hessian there implies a strict local minimum; a negative-definite Hessian implies a strict local maximum. A semidefinite Hessian alone generally does not determine the type of stationary point.
In statistics, covariance matrices are positive semidefinite and are positive definite when no nonzero linear combination of the variables has zero variance. The criterion can establish strict positive definiteness in symbolic calculations. Related uses arise with Gram matrices, quadratic objectives, and finite-element stiffness matrices.
For small matrices or matrices depending on symbolic parameters, determinant inequalities are often convenient. For large numerical problems, explicitly evaluating every leading determinant is usually less suitable than attempting Cholesky factorization. A standard dense Cholesky factorization takes arithmetic operations and avoids separately recomputing determinants.
In floating-point arithmetic, rounding can obscure the signs of very small minors. A nearly singular positive-definite matrix may therefore be difficult to distinguish numerically from a semidefinite or slightly indefinite matrix. The exact criterion remains valid, but numerical conclusions depend on scaling, conditioning, and error tolerances.
Finally, failure of a leading-minor test proves only that the matrix is not positive definite. It does not by itself show whether the matrix is indefinite, negative definite, or singular.