Definiteness of a matrix

Not to be confused with Positive matrix and Totally positive matrix.

In linear algebra, a symmetric $n\times n$ real matrix $M$ is said to be positive definite if the scalar $z^{\textsf {T}}Mz$ is strictly positive for every non-zero column vector $z$ of $n$ real numbers. Here $z^{\textsf {T}}$ denotes the transpose of $z$.

More generally, a complex $n\times n$ Hermitian matrix $M$ is said to be positive definite if the scalar $z^{*}Mz$ is strictly positive for every non-zero column vector $z$ of $n$ complex numbers. Here $z^{*}$ denotes the conjugate transpose of $z$. Note that $z^{*}Mz$ is automatically real since $M$ is Hermitian.

Positive semi-definite matrices are defined similarly, except that the above scalars $z^{\textsf {T}}Mz$ or $z^{*}Mz$ must be positive or zero (i.e. non-negative). Negative definite and negative semi-definite matrices are defined analogously. A matrix that is not positive semi-definite and not negative semi-definite is called indefinite.

The matrix $M$ is positive definite if and only if the bilinear form $\langle z,w\rangle =z^{\textsf {T}}Mw$ is positive definite (and similarly for a positive definite sesquilinear form in the complex case). This is a coordinate realization of an inner product on a vector space.

Some authors use more general definitions of definiteness, including some non-symmetric real matrices, or non-Hermitian complex ones.

Definitions

In the following definitions, $x^{\mathrm {T} }$ is the transpose of $x$, $x^{*}$ is the conjugate transpose of $x$ and $\mathbf {0}$ denotes the n-dimensional zero-vector.

Definitions for real matrices

A $n\times n$ symmetric real matrix $M$ is said to be positive definite if $x^{\mathrm {T} }Mx>0$ for all non-zero $x$ in $\mathbb {R} ^{n}$. Formally,

$M{\text{ positive definite}}\quad \iff \quad x^{\mathrm {T} }Mx>0{\text{ for all }}x\in \mathbb {R} ^{n}\setminus \mathbf {0}$

A $n\times n$ symmetric real matrix $M$ is said to be positive semi-definite or non-negative definite if $x^{\mathrm {T} }Mx\geq 0$ for all non-zero $x$ in $\mathbb {R} ^{n}$. Formally,

$M{\text{ positive semi-definite}}\quad \iff \quad x^{\mathrm {T} }Mx\geq 0{\text{ for all }}x\in \mathbb {R} ^{n}\setminus \mathbf {0}$

A $n\times n$ symmetric real matrix $M$ is said to be negative definite if $x^{\mathrm {T} }Mx<0$ for all non-zero $x$ in $\mathbb {R} ^{n}$. Formally,

$M{\text{ negative definite}}\quad \iff \quad x^{\mathrm {T} }Mx<0{\text{ for all }}x\in \mathbb {R} ^{n}\setminus \mathbf {0}$

A $n\times n$ symmetric real matrix $M$ is said to be negative semi-definite or non-positive definitie if $x^{\mathrm {T} }Mx\leq 0$ for all non-zero $x$ in $\mathbb {R} ^{n}$. Formally,

$M{\text{ negative semi-definite}}\quad \iff \quad x^{\mathrm {T} }Mx\leq 0{\text{ for all }}x\in \mathbb {R} ^{n}\setminus \mathbf {0}$

A $n\times n$ symmetric real matrix which is neither positive semidefinite nor negative semidefinite is called indefinite.

Definitions for complex matrices

The following definitions all involve the term $x^{*}Mx$. Notice that this is always a real number for any Hermitian square matrix $M$.

A $n\times n$ Hermitian complex matrix $M$ is said to be positive definite if $x^{*}Mx>0$ for all non-zero $x$ in $\mathbb {C} ^{n}$. Formally,

$M{\text{ positive definite}}\quad \iff \quad x^{*}Mx>0{\text{ for all }}x\in \mathbb {C} ^{n}\setminus \mathbf {0}$

A $n\times n$ Hermitian complex matrix $M$ is said to be positive semi-definite or non-negative definitie if $x^{*}Mx\geq 0$ for all non-zero $x$ in $\mathbb {C} ^{n}$. Formally,

$M{\text{ positive semi-definite}}\quad \iff \quad x^{*}Mx\geq 0{\text{ for all }}x\in \mathbb {C} ^{n}\setminus \mathbf {0}$

A $n\times n$ Hermitian complex matrix $M$ is said to be negative definite if $x^{*}Mx<0$ for all non-zero $x$ in $\mathbb {C} ^{n}$. Formally,

$M{\text{ negative definite}}\quad \iff \quad x^{*}Mx<0{\text{ for all }}x\in \mathbb {C} ^{n}\setminus \mathbf {0}$

A $n\times n$ Hermitian complex matrix $M$ is said to be negative semi-definite or non-positive definitie if $x^{*}Mx\leq 0$ for all non-zero $x$ in $\mathbb {C} ^{n}$. Formally,

$M{\text{ negative semi-definite}}\quad \iff \quad x^{*}Mx\leq 0{\text{ for all }}x\in \mathbb {C} ^{n}\setminus \mathbf {0}$

A $n\times n$ Hermitian complex matrix which is neither positive semidefinite nor negative semidefinite is called indefinite.

Consistency between real and complex definitions

Since every real matrix is also a complex matrix, the definitions of "definiteness" for the two classes must agree.

For complex matrices, the most common definition says that "$M$ is positive definite if and only if $z^{*}Mz$ is real and positive for all non-zero complex column vectors $z$". This condition implies that $M$ is Hermitian (i.e. its transpose is equal to its conjugate). To see this, consider the matrices $A={\tfrac {1}{2}}(M+M^{*})$ and $B={\tfrac {1}{2i}}(M-M^{*})$, so that $M=A+iB$ and $z^{*}Mz=z^{*}Az+iz^{*}Bz$. The matrices $A$ and $B$ are Hermitian, therefore $z^{*}Az$ and $z^{*}Bz$ are individually real. If $z^{*}Mz$ is real, then $z^{*}Bz$ must be zero for all $z$. Then $B$ is the zero matrix and $M=A$, proving that $M$ is Hermitian.

By this definition, a positive definite real matrix $M$ is Hermitian, hence symmetric; and $z^{\mathrm {T} }Mz$ is positive for all non-zero real column vectors $z$. However the last condition alone is not sufficient for $M$ to be positive definite. For example, if

$M={\begin{bmatrix}1&1\\-1&1\end{bmatrix}},$

then for any real vector $z$ with entries $a$ and $b$ we have $z^{\mathrm {T} }Mz=(a-b)a+(a+b)b=a^{2}+b^{2}$, which is always positive if $z$ is not zero. However, if $z$ is the complex vector with entries $1$ and $i$, one gets

$z^{*}Mz=[1,-i]M[1,i]^{\mathrm {T} }=[1+i,1-i][1,i]^{\mathrm {T} }=2+2i$

which is not real. Therefore, $M$ is not positive definite.

On the other hand, for a symmetric real matrix $M$, the condition "$z^{\mathrm {T} }Mz>0$ for all nonzero real vectors $z$" does imply that $M$ is positive definite in the complex sense.

Notation

If a Hermitian matrix $M$ is positive semi-definite, one sometimes writes $M\succeq 0$ and if $M$ is positive definite one writes $M\succ 0$. To denote that $M$ is negative semi-definite one writes $M\preceq 0$ and to denote that $M$ is negative definite one writes $M\prec 0$.

The notion comes from functional analysis where positive semidefinite matrices define positive operators.

A common alternative notation is $M\geq 0$, $M>0$, $M\leq 0$ and $M<0$ for positive semi-definite and positive definite, negative semi-definite and negative definite matrices, respectively. This may be confusing, as sometimes nonnegative matrices respectively nonpositive matrices are also denoted in this way.

Examples

• The identity matrix $I={\begin{bmatrix}1&0\\0&1\end{bmatrix}}$ is positive definite (and as such also positive semi-definite). It is a real symmetric matrix, and, for any non-zero column vector z with real entries a and b, one has

$z^{\textsf {T}}Iz={\begin{bmatrix}a&b\end{bmatrix}}{\begin{bmatrix}1&0\\0&1\end{bmatrix}}{\begin{bmatrix}a\\b\end{bmatrix}}=a^{2}+b^{2}$.

Seen as a complex matrix, for any non-zero column vector z with complex entries a and b one has

$z^{\mathrm {H} }Iz={\begin{bmatrix}a^{*}&b^{*}\end{bmatrix}}{\begin{bmatrix}1&0\\0&1\end{bmatrix}}{\begin{bmatrix}a\\b\end{bmatrix}}=a^{*}a+b^{*}b=|a|^{2}+|b|^{2}$.

Either way, the result is positive since $z$ is not the zero vector (that is, at least one of $a$ and $b$ is not zero).

• The real symmetric matrix

$M={\begin{bmatrix}2&-1&0\\-1&2&-1\\0&-1&2\end{bmatrix}}$

is positive definite since for any non-zero column vector z with entries a, b and c, we have

${\begin{aligned}z^{\textsf {T}}Mz=\left(z^{\textsf {T}}M\right)z&={\begin{bmatrix}(2a-b)&(-a+2b-c)&(-b+2c)\end{bmatrix}}{\begin{bmatrix}a\\b\\c\end{bmatrix}}\\&=(2a-b)a+(-a+2b-c)b+(-b+2c)c\\&=2a^{2}-ba-ab+2b^{2}-cb-bc+2c^{2}\\&=2a^{2}-2ab+2b^{2}-2bc+2c^{2}\\&=a^{2}+a^{2}-2ab+b^{2}+b^{2}-2bc+c^{2}+c^{2}\\&=a^{2}+(a-b)^{2}+(b-c)^{2}+c^{2}\end{aligned}}$

This result is a sum of squares, and therefore non-negative; and is zero only if $a=b=c=0$, that is, when z is zero.

• For any real invertible matrix $A$, the product $A^{\textsf {T}}A$ is a positive definite matrix. A simple proof is that for any non-zero vector $z$, the condition $z^{\textsf {T}}A^{\textsf {T}}Az=(Az)^{\textsf {T}}(Az)=\|Az\|^{2}>0,$ since the invertibility of matrix $A$ means that $Az\neq 0.$
• The example $M$ above shows that a matrix in which some elements are negative may still be positive definite. Conversely, a matrix whose entries are all positive is not necessarily positive definite, as for example

$N={\begin{bmatrix}1&2\\2&1\end{bmatrix}},$

for which ${\begin{bmatrix}-1&1\end{bmatrix}}N{\begin{bmatrix}-1&1\end{bmatrix}}^{\textsf {T}}=-2<0.$

Eigenvalues

Let $M$ be an $n\times n$ Hermitian matrix.

• The Hermitian matrix $M$ is positive definite if and only if all of its eigenvalues are positive.
• The Hermitian matrix $M$ is positive semi-definite if and only if all of its eigenvalues are non-negative.
• The Hermitian matrix $M$ is negative definite if and only if all of its eigenvalues are negative
• The Hermitian matrix $M$ is negative semi-definite if and only if all of its eigenvalues are non-positive.
• The Hermitian matrix $M$ is indefinite if and only if it has both positive and negative eigenvalues.

Let $P^{-1}DP$ be an eigendecomposition of $M$, where $P$ is a unitary complex matrix whose rows comprise an orthonormal basis of eigenvectors of $M$, and $D$ is a real diagonal matrix whose main diagonal contains the corresponding eigenvalues. The matrix $M$ may be regarded as a diagonal matrix $D$ that has been re-expressed in coordinates of the basis $P$. In particular, the one-to-one change of variable $y=Pz$ shows that $z^{*}Mz$ is real and positive for any complex vector $z$ if and only if $y^{*}Dy$ is real and positive for any $y$; in other words, if $D$ is positive definite. For a diagonal matrix, this is true only if each element of the main diagonal—that is, every eigenvalue of $M$—is positive. Since the spectral theorem guarantees all eigenvalues of a Hermitian matrix to be real, the positivity of eigenvalues can be checked using Descartes' rule of alternating signs when the characteristic polynomial of a real, symmetric matrix $M$ is available.

Connections

A general purely quadratic real function $f(\mathbf {x} )$ on $n$ real variables $x_{1},\ldots ,x_{n}$ can always be written as $\mathbf {x} ^{\mathrm {T} }M\mathbf {x}$ where $\mathbf {x}$ is the column vector with those variables, and $M$ is a symmetric real matrix. Therefore, the matrix being positive definite means that $f$ has a unique minimum (zero) when $\mathbf {x}$ is zero, and is strictly positive for any other $z$.

More generally, a twice-differentiable real function $f$ on $n$ real variables has local minimum at arguments $x_{1},\ldots ,x_{n}$ if its gradient is zero and its Hessian (the matrix of all second derivatives) is positive semi-definite at that point. Similar statements can be made for negative definite and semi-definite matrices.

In statistics, the covariance matrix of a multivariate probability distribution is always positive semi-definite; and it is positive definite unless one variable is an exact linear function of the others. Conversely, every positive semi-definite matrix is the covariance matrix of some multivariate distribution.

Characterizations

Let $M$ be an $n\times n$ Hermitian matrix. The following properties are equivalent to $M$ being positive definite:

1. The associated sesquilinear form is an inner product. The sesquilinear form defined by $M$ is the function $\langle \cdot ,\cdot \rangle$ from $\mathbb {C} ^{n}\times \mathbb {C} ^{n}$ to $\mathbb {C} ^{n}$ such that $\langle x,y\rangle :=y^{*}Mx$ for all $x$ and $y$ in $\mathbb {C} ^{n}$, where $y^{*}$ is the conjugate transpose of $y$. For any complex matrix $M$, this form is linear in each argument separately. Therefore, the form is an inner product on $\mathbb {C} ^{n}$ if and only if $\langle z,z\rangle$ is real and positive for all nonzero $z$; that is if and only if $M$ is positive definite. (In fact, every inner product on $\mathbb {C} ^{n}$ arises in this fashion from a Hermitian positive definite matrix.)
2. It is the Gram matrix of linearly independent vectors. Let $x_{1},\ldots ,x_{n}$ be a list of $n$ linearly independent vectors of some complex vector space with an inner product $\langle \cdot ,\cdot \rangle$. It can be verified that the Gram matrix $M$ of those vectors, defined by $M_{ij}=\langle x_{i},x_{j}\rangle$, is always positive definite. Conversely, if $M$ is positive definite, it has an eigendecomposition $P^{-1}DP$ where $P$ is unitary, $D$ diagonal, and all diagonal elements $D_{ii}=\lambda _{i}$ of $D$ are real and positive. Let $E$ be the real diagonal matrix with entries $E_{ii}={\sqrt {\lambda _{i}}}$ so $E^{2}=D$; then $P^{-1}DP=P^{*}DP=P^{*}EEP=(EP)^{*}EP$. Now we let $x_{1},\ldots ,x_{n}$ be the columns of $EP$. These vectors are linearly independent, and by the above $M$ is their Gram matrix, under the standard inner product of $\mathbb {C} ^{n}$, namely $\langle x_{i},x_{j}\rangle =x_{i}^{\ast }x_{j}$.
3. Its leading principal minors are all positive. The kth leading principal minor of a matrix $M$ is the determinant of its upper-left $k\times k$ sub-matrix. It turns out that a matrix is positive definite if and only if all these determinants are positive. This condition is known as Sylvester's criterion, and provides an efficient test of positive definiteness of a symmetric real matrix. Namely, the matrix is reduced to an upper triangular matrix by using elementary row operations, as in the first part of the Gaussian elimination method, taking care to preserve the sign of its determinant during pivoting process. Since the kth leading principal minor of a triangular matrix is the product of its diagonal elements up to row $k$, Sylvester's criterion is equivalent to checking whether its diagonal elements are all positive. This condition can be checked each time a new row $k$ of the triangular matrix is obtained.

Quadratic forms, convexity, optimization

The (purely) quadratic form associated with a real $n\times n$ matrix $M$ is the function $Q:\mathbb {R} ^{n}\mapsto \mathbb {R}$ such that $Q(x)=x^{T}Mx$ for all $x$. $M$ can be assumed symmetric by replacing it with $1/2(M+M^{T})$.

A symmetric matrix $M$ is positive definite if and only if its quadratic form is a strictly convex function.

More generally, any quadratic function from $\mathbb {R} ^{n}$ to $\mathbb {R}$ can be written as $x^{T}Mx+x^{T}b+c$ where $M$ is a symmetric $n\times n$ matrix, $b$ is a real $n$-vector, and $c$ a real constant. This quadratic function is strictly convex, and hence has a unique finite global minimum, if and only if $M$ is positive definite. For this reason, positive definite matrices play an important role in optimization problems.

Simultaneous diagonalization

A symmetric matrix and another symmetric and positive definite matrix can be simultaneously diagonalized, although not necessarily via a similarity transformation. This result does not extend to the case of three or more matrices. In this section we write for the real case. Extension to the complex case is immediate.

Let $M$ be a symmetric and $N$ a symmetric and positive definite matrix. Write the generalized eigenvalue equation as $(M-\lambda N)x=0$ where we impose that $x$ be normalized, i.e. $x^{T}Nx=1$. Now we use Cholesky decomposition to write the inverse of $N$ as $Q^{T}Q$. Multiplying by $Q$ and letting $x=Q^{T}y$, we get $Q(M-\lambda N)Q^{T}y=0$, which can be rewritten as $(QMQ^{T})y=\lambda y$ where $y^{T}y=1$. Manipulation now yields $MX=NX\Lambda$ where $X$ is a matrix having as columns the generalized eigenvectors and $\Lambda$ is a diagonal matrix of the generalized eigenvalues. Now premultiplication with $X^{T}$ gives the final result: $X^{T}MX=\Lambda$ and $X^{T}NX=I$, but note that this is no longer an orthogonal diagonalization with respect to the inner product where $y^{T}y=1$. In fact, we diagonalized $M$ with respect to the inner product induced by $N$.

Note that this result does not contradict what is said on simultaneous diagonalization in the article Diagonalizable matrix, which refers to simultaneous diagonalization by a similarity transformation. Our result here is more akin to a simultaneous diagonalization of two quadratic forms, and is useful for optimization of one form under conditions on the other.

Properties

Induced partial ordering

For arbitrary square matrices $M$, $N$ we write $M\geq N$ if $M-N\geq 0$ i.e., $M-N$ is positive semi-definite. This defines a partial ordering on the set of all square matrices. One can similarly define a strict partial ordering $M>N$.

Inverse of positive definite matrix

Every positive definite matrix is invertible and its inverse is also positive definite. If $M\geq N>0$ then $N^{-1}\geq M^{-1}>0$. Moreover, by the min-max theorem, the kth largest eigenvalue of $M$ is greater than the kth largest eigenvalue of $N$

Scaling

If $M$ is positive definite and $r>0$ is a real number, then $rM$ is positive definite.

Addition

If $M$ and $N$ are positive definite, then the sum $M+N$ is also positive definite.

Multiplication

• If $M$ and $N$ are positive definite, then the products $MNM$ and $NMN$ are also positive definite. If $MN=NM$, then $MN$ is also positive definite.

• If $M$ is positive semidefinite, then $Q^{\mathrm {T} }MQ$ is positive semidefinite. If $M$ is positive definite and $Q$ has full rank, then $Q^{T}MQ$ is positive definite.

Cholesky decomposition

For any matrix $A$, the matrix $A^{*}A$ is positive semidefinite, and $\operatorname {rank} (A)=\operatorname {rank} (A^{*}A)$. Conversely, any Hermitian positive semi-definite matrix $M$ can be written as $M=LL^{*}$, where $L$ is lower triangular; this is the Cholesky decomposition. If $M$ is not positive definite, then some of the diagonal elements of $L$ may be zero.

A hermitian matrix $M$ is positive definite if and only if it has a unique Cholesky decomposition, i.e. the matrix $M$ is positive definite if and only if there exists a unique lower triangular matrix $L$, with real and strictly positive diagonal elements, such that $M=LL^{*}$.

Square root

A matrix $M$ is positive semi-definite if and only if there is a positive semi-definite matrix $B$ with $B^{2}=M$. This matrix $B$ is unique, is called the square root of $M$, and is denoted with $B=M^{1/2}$ (the square root $B$ is not to be confused with the matrix $L$ in the Cholesky factorization $M=LL^{*}$, which is also sometimes called the square root of $M$).

If $M>N>0$ then $M^{1/2}>N^{1/2}>0$.

Submatrices

Every principal submatrix of a positive definite matrix is positive definite.

Trace

The diagonal entries $m_{ii}$ of a positive definite matrix are real and non-negative. As a consequence the trace, $\operatorname {tr} (M)\geq 0$. Furthermore, since every principal sub-matrix (in particular, 2-by-2) is positive definite,

$|m_{ij}|\leq {\sqrt {m_{ii}m_{jj}}}\leq {\frac {m_{ii}+m_{jj}}{2}}\quad \forall i,j$

and thus

$\max _{i,j}|m_{ij}|\leq \max _{i}|m_{ii}|$

Hadamard product

If $M,N\geq 0$, although $MN$ is not necessary positive semidefinite, the Hadamard product $M\circ N\geq 0$ (this result is often called the Schur product theorem).

Regarding the Hadamard product of two positive semidefinite matrices $M=(m_{ij})\geq 0$, $N\geq 0$, there are two notable inequalities:

• Oppenheim's inequality: $\det(M\circ N)\geq \det(N)\prod \nolimits _{i}m_{ii}.$
• $\det(M\circ N)\geq \det(M)\det(N)$.

Kronecker product

If $M,N\geq 0$, although $MN$ is not necessary positive semidefinite, the Kronecker product $M\otimes N\geq 0$.

Frobenius product

If $M,N\geq 0$, although $MN$ is not necessary positive semidefinite, the Frobenius product $M:N\geq 0$ (Lancaster–Tismenetsky, The Theory of Matrices, p. 218).

Convexity

The set of positive semidefinite symmetric matrices is convex. That is, if $M$ and $N$ are positive semidefinite, then for any $\alpha$ between 0 and 1, $\alpha M+(1-\alpha )N$ is also positive semidefinite. For any vector $x$:

$x^{\textsf {T}}(\alpha M+(1-\alpha )N)x=\alpha x^{\textsf {T}}Mx+(1-\alpha )x^{\textsf {T}}Nx\geq 0.$

This property guarantees that semidefinite programming problems converge to a globally optimal solution.

Further properties

1. If $M$ is a symmetric matrix of the form $m_{ij}=m(i-j)$, and the strict inequality holds

   $\sum \nolimits _{j\neq 0}|m(j)|<m(0)$

   then $M$ is strictly positive definite.

2. Let $M>0$ and $N$ Hermitian. If $MN+NM\geq 0$ (resp., $MN+NM>0$) then $N\geq 0$ (resp., $N>0$).
3. If $M>0$ is real, then there is a $\delta >0$ such that $M>\delta I$, where $I$ is the identity matrix.
4. If $M_{k}$ denotes the leading $k\times k$ minor, $\det \left(M_{k}\right)/\det \left(M_{k-1}\right)$ is the kth pivot during LU decomposition.
5. A matrix is negative definite if its k-th order leading principal minor is negative when $k$ is odd, and positive when $k$ is even.
6. A matrix $M$ is positive semidefinite if and only if it arises as the Gram matrix of some set of vectors. In contrast to the positive definite case, these vectors need not be linearly independent.

A Hermitian matrix is positive semidefinite if and only if all of its principal minors are nonnegative. It is however not enough to consider the leading principal minors only, as is checked on the diagonal matrix with entries 0 and -1.

Block matrices

A positive $2n\times 2n$ matrix may also be defined by blocks:

$M={\begin{bmatrix}A&B\\C&D\end{bmatrix}}$

where each block is $n\times n$. By applying the positivity condition, it immediately follows that $A$ and $D$ are hermitian, and $C=B^{*}$.

We have that $z^{*}Mz\geq 0$ for all complex $z$, and in particular for $z=[v,0]^{\mathrm {T} }$. Then

${\begin{bmatrix}v^{*}&0\end{bmatrix}}{\begin{bmatrix}A&B\\B^{*}&D\end{bmatrix}}{\begin{bmatrix}v\\0\end{bmatrix}}=v^{*}Av\geq 0.$

A similar argument can be applied to $D$, and thus we conclude that both $A$ and $D$ must be positive definite matrices, as well.

Converse results can be proved with stronger conditions on the blocks, for instance using the Schur complement.

Extension for non-symmetric square matrices

Some authors choose to say that a complex matrix $M$ is positive definite if $\Re (z^{*}Mz)>0$ for all non-zero complex vectors $z$, where $\Re (c)$ denotes the real part of a complex number $c$. This weaker definition encompasses some non-Hermitian complex matrices, including some non-symmetric real ones, such as ${\bigl [}{\begin{smallmatrix}1&1\\-1&1\end{smallmatrix}}{\bigr ]}$.

Indeed, with this definition, a real matrix is positive definite if and only if $z^{\mathrm {T} }Mz>0$ for all nonzero real vectors $z$, even if $M$ is not symmetric.

In general, we have $\Re (z^{*}Mz)>0$ for all complex nonzero vectors $z$ if and only if the Hermitian part ${\tfrac {1}{2}}(M+M^{*})$ of $M$ is positive definite in the narrower sense. Similarly, we have $x^{\mathrm {T} }Mx>0$ for all real nonzero vectors $x$ if and only if the symmetric part ${\tfrac {1}{2}}(M+M^{\mathrm {T} })$ of $M$ is positive definite in the narrower sense.

In summary, the distinguishing feature between the real and complex case is that, a bounded positive operator on a complex Hilbert space is necessarily Hermitian, or self adjoint. The general claim can be argued using the polarization identity. That is no longer true in the real case.

See also

• Cholesky decomposition
• Covariance matrix
• M-matrix
• Positive-definite function
• Positive-definite kernel
• Schur complement
• Square root of a matrix
• Sylvester's criterion
• Symmetric matrix
• Numerical range

References

• Horn, Roger A.; Johnson, Charles R. (1990). Matrix Analysis. Cambridge University Press. ISBN 978-0-521-38632-6.
• Bhatia, Rajendra (2007). Positive definite matrices. Princeton Series in Applied Mathematics. ISBN 978-0-691-12918-1.
• Bernstein, B.; Toupin, R.A. (1962). Some Properties of the Hessian Matrix of a Strictly Convex Function, J. fűr die Reine und Angew. Math.210, 67-72.

External links

• Hazewinkel, Michiel, ed. (2001) [1994], "Positive-definite form", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
• Wolfram MathWorld: Positive Definite Matrix