Inline videos. See also:Category: Articles with embedded Videos..

Positive-definite matrix

From Biocrawler, the free encyclopedia.

In linear algebra, the positive-definite matrices are (in several ways) analogous to the positive real numbers. First, define some things:

An n × n Hermitian matrix M is said to be positive definite if it has one (and therefore all) of the following six equivalent properties:

1. For all non-zero vectors z \in \mathbb{C}^n we have
\textbf{z}^{*} M \textbf{z} > 0.

Here we view z as a column vector with n complex entries and z * as the complex conjugate of its transpose. (z * Mz is always real.)

2. For all non-zero vectors x in

\mathbb{R}^n we have

\textbf{x}^{T} M \textbf{x} > 0
3. For all non-zero vectors u \in \mathbb{Z}^n, we have
\textbf{u}^{T} M \textbf{u} > 0.
4. All eigenvalues of M are positive.
\lambda_i(M) > 0 \; \forall i
5. The form
\langle \textbf{x},\textbf{y}\rangle = \textbf{x}^{*} M \textbf{y}

defines an inner product on \mathbb{C}^n. (In fact, every inner product on \mathbb{C}^n arises in this fashion from a Hermitian positive definite matrix.)

6. All the following matrices have 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
Contents

Further properties

Every positive definite matrix is invertible and its inverse is also positive definite. If M is positive definite and r > 0 is a real number, then rM is positive definite. If M and N are positive definite, then M + N is also positive definite, and if MN = NM, then MN is also positive definite. Every positive definite matrix M, has at least one square root matrix N such that N2 = M. In fact, M may have infinitely many square roots, but exactly one positive definite square root.

Negative-definite, semidefinite and indefinite matrices

The Hermitian matrix M is said to be negative-definite if

x * Mx < 0

for all non-zero x \in \mathbb{R}^n (or, equivalently, all non-zero x \in \mathbb{C}^n). It is called positive-semidefinite if

x^{*} M x \geq 0

for all x \in \mathbb{R}^n (or \mathbb{C}^n) and negative-semidefinite if

x^{*} M x \leq 0

for all x \in \mathbb{R}^n (or \mathbb{C}^n).

A Hermitian matrix which is neither positive- nor negative-semidefinite is called indefinite.

Non-Hermitian matrices

A real matrix M may have the property that xTMx > 0 for all nonzero real vectors x without being symmetric. The matrix

\begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}

provides an example. In general, we have xTMx > 0 for all real nonzero vectors x if and only if the symmetric part, (M + MT) / 2, is positive definite.

The situation for complex matrices may be different, depending on how one generalizes the inequality z*Mz > 0. If z*Mz is real for all complex vectors z, then the matrix M is necessarily Hermitian. So, if we require that z*Mz be real and positive, then M is automatically Hermitian. On the other hand, we have that Re(z*Mz) > 0 for all complex nonzero vectors z if and only if the Hermitian part, (M + M*) / 2, is positive definite.

There is no agreement in the literature on the proper definition of positive-definite for non-Hermitian matrices.

Generalizations

Suppose K denotes the field \mathbb{R} or \mathbb{C}, V is a vector space over K, and : V \times V \rightarrow K is a bilinear map which is Hermitian in the sense that B(x,y) is always the complex conjugate of B(y,x). Then B is called positive definite if B(x,x) > 0 for every nonzero x in V.

References

Wikipedia (http://en.wikipedia.org/wiki/Main_Page) Non-negative_definite_matrix (http://en.wikipedia.org/wiki/Non-negative_definite_matrix) version history (http://en.wikipedia.org/w/index.php?title=Non-negative_definite_matrix&action=history) GNU Free Documentation Lizenz (http://en.wikipedia.org/wiki/Wikipedia:Text_of_the_GNU_Free_Documentation_License) CC-by-sa (http://creativecommons.org/licenses/by-sa/2.5/)

Personal tools
Google Search
Google
Web
biocrawler.com