Positive Definite
Relationships among full-rank, positive definite and non-negative definite are clearlty summarized below.
level 0
Suppose A is a (square) nxn matrix,
non-singular rank( A )=n exist
determinant can be negative.
singular fail to exist
If A is non-negative, then
- A may be singular or non-singular.
For a non-negative definite A
i.e. non-negative + non-singular = positive
level 1
Suppose A is a nxn symmetric matrix, (positive definite matrix is always symmetric)
By the Fundamental Theorem of Algebra, A has n eigenvalues.
rank( A ) is equal to the number of non-zero eigenvalues of A.
A is non-negative definite all eigenvalues of A are non-negative.
A is positive definite all eigenvalues of A are positive.
positive definite full rank
level 2
It is worth noting that for a real non-negative definite square matrix (a covariance matrix), the singular value decomposition is the eigen decomposition, U = V, columns of these matrices are unit eigenvectors, and the SVD singular values are the corresponding eigenvalues.
covariance matrix is non-negative definite.(stat542 P171)
If A is non-negative, there exist symmetrix matrix B such that BB=A. This is important for AITKEN model.
application
- is always semi-positive definite, If is full rank, is positive definite.
is full column rank, is the linear combination of columns of X, it won't be . Thus