Positive definite matrix

Topic of Covariance and the multivariate normal, part of Statistical learning

Positive definite matrix

Type Topic
Taught in Covariance and the multivariate normal
Part Statistical learning
Questions using it 10

A symmetric matrix \Sigma with \mathbf{a}^\top\Sigma\mathbf{a}>0 for every non-zero \mathbf{a}; positive semi-definite when \ge0. Every covariance matrix is positive semi-definite, because \mathbf{a}^\top\Sigma\mathbf{a} is the variance of \mathbf{a}^\top\mathbf{X}.

In Covariance and the multivariate normal

Symmetry of a proposed covariance is necessary and is not enough: every linear combination must have a nonnegative variance. Sylvester’s criterion turns the quadratic-form condition into determinants. Strict positive definiteness requires every leading principal minor to be positive. Positive semi-definiteness requires every principal minor, not only the leading ones, to be nonnegative. A matrix can pass a leading-minor check aimed at the wrong one of these two conclusions and still fail to be a covariance.

Used in

See also

Mean vector and covariance matrix · Variance · A finite stationary point is a global maximiser · Cholesky decomposition · Fisher’s direction · Gram matrix · Kernel density estimator · Least-squares decomposition

Glossary and index