For a real symmetric matrix , completing the square gives, when ,Thus is a positive-definite matrix exactly when and . For necessity, test first, then ; for sufficiency, the displayed two positive squares give the result. These are the first two leading principal minors in Sylvester's criterion. A positive determinant alone is insufficient: has determinant but is a negative-definite matrix.
The eigenvalues provide an equivalent test under the same real-symmetric hypothesis:The spectral theorem for real symmetric matrices supplies coordinates in an orthonormal basis in which . More generally, a complex Hermitian matrix has an orthonormal eigenbasis and , so it is a Hermitian positive-definite matrix exactly when every eigenvalue is positive. This is a short proof outline: test the eigenvectors for necessity, and sum the positive squared absolute values for sufficiency.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. Appendix A.5.2, pp. 646–647: symmetric eigenvalue decomposition and definiteness
For a real positive semidefinite matrix, the condition is instead for all vectors, equivalent here to , , and . If , the same completing the square proves this; if , nonnegativity forces and leaves with . Merely replacing the strict inequalities on the leading principal minors by nonstrict ones fails: has both leading principal minors zero yet gives . An indefinite quadratic form takes both positive and negative values; its real symmetric matrix has eigenvalues of both signs.
Articles by others on the same topic
There are currently no matching articles.