|
|
| Line 1: |
Line 1: |
| {{hatnote|Not to be confused with [[Positive matrix]] and [[Totally positive matrix]].}}
| | 32 үear-olɗ Education Reviewer Ventimіglia from Wilcox, has hobbies and interests which іncludes snowmobile riding, title loɑns and ϲake decorating. In the last year has made a trіƿ to W Nаtional Park of Niger.<br><br>Feel free to surf to my web-site ... [http://revieww.net/tag/gsa-ser-vps/ gsa ser vps] |
| | |
| In [[linear algebra]], a [[symmetric matrix|symmetric]] {{nowrap|''n'' × ''n''}} [[real number|real]] [[matrix (mathematics)|matrix]] ''M'' is said to be '''positive definite''' if ''z''<sup>T</sup>''Mz'' is positive for every non-zero column [[vector (mathematics)|vector]] ''z'' of ''n'' real numbers. Here ''z''<sup>T</sup> denotes the [[transpose]] of ''z''.
| |
| | |
| More generally, an {{nowrap|''n'' × ''n''}} [[Hermitian matrix]] ''M'' is said to be '''positive definite''' if ''z*Mz'' is real and positive for all non-zero complex vectors ''z''. Here ''z*'' denotes the [[conjugate transpose]] of ''z''.
| |
| | |
| The '''negative definite''', '''positive semi-definite''', and '''negative semi-definite''' matrices are defined in the same way, except that the expression ''z''<sup>T</sup>''Mz'' or ''z*Mz'' is required to be always negative, non-negative, and non-positive, respectively.
| |
| | |
| Positive definite matrices are closely related to [[definite bilinear form|positive-definite]] symmetric [[bilinear form]]s (or [[sesquilinear form]]s in the complex case), and to [[inner product]]s of vector spaces.<ref>[http://projecteuclid.org/DPubS?verb=Display&version=1.0&service=UI&handle=euclid.rmjm/1250130219&page=record Stewart, J. (1976). Positive definite functions and generalizations, an historical survey. Rocky Mountain J. Math, 6(3).]</ref>
| |
| | |
| Some authors use more general definitions of "positive definite" that include some non-symmetric real matrices, or non-Hermitian complex ones.
| |
| | |
| == Examples ==
| |
| | |
| *The [[identity matrix]] <math> I = \begin{bmatrix} 1 & 0 \\ 0 & 1\end{bmatrix} </math> is positive definite. Seen as a real matrix, it is symmetric, and, for any column vector ''z'' with real entries ''a'' and ''b'', one has <math> z^{\mathrm{T}}I z = \begin{bmatrix} a & b\end{bmatrix} \begin{bmatrix} a \\ b\end{bmatrix}= a^2 + b^2</math>. Seen as complex matrix, for any column vector ''z'' with complex entries ''a'' and ''b'' one has <math> z^*I z = \begin{bmatrix} a^* & b^*\end{bmatrix} \begin{bmatrix} a \\ b\end{bmatrix}=a^*a +b^*b = |a|^2 + |b|^2</math>. Either way, the result is positive as long as ''z'' is not the zero vector (that is, at least one of ''a'' and ''b'' is not zero).
| |
| | |
| * The real symmetric matrix
| |
| | |
| ::<math> M = \begin{bmatrix} 2&-1&0\\-1&2&-1\\0&-1&2 \end{bmatrix} </math>
| |
| :is positive definite since for any non-zero column vector ''z'' with entries ''a'', ''b'' and ''c'', we have
| |
| ::<math>\begin{align}
| |
| z^{\mathrm{T}}M z &= \begin{bmatrix} (2a-b)&(-a+2b-c)&(-b+2c) \end{bmatrix} \begin{bmatrix} a\\b\\c \end{bmatrix} \\
| |
| &= 2{a}^2 - 2ab + 2{b}^2 - 2bc + 2{c}^2 \\
| |
| &= {a}^2+(a - b)^{2} + (b - c)^{2}+{c}^2
| |
| \end{align} </math>
| |
| :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.
| |
| | |
| *The real symmetric matrix
| |
| | |
| ::<math>N = \begin{bmatrix} 1 & 2 \\ 2 & 1\end{bmatrix} </math>
| |
| :is not positive definite. If ''z'' is the vector <math>\begin{bmatrix} 1\\ -1\end{bmatrix}</math>, one has <math> z^{\mathrm{T}}N z = \begin{bmatrix} 1 & -1\end{bmatrix} \begin{bmatrix} 1 & 2 \\ 2 & 1\end{bmatrix} \begin{bmatrix} 1 \\ -1\end{bmatrix}=\begin{bmatrix} -1 & 1\end{bmatrix} \begin{bmatrix} 1 \\ -1\end{bmatrix}=-2 \not > 0.</math>
| |
| | |
| *For any real non-singular matrix <math>A</math>, the product <math> A^T A </math> is a positive definite matrix. A simple proof is that for any non-zero vector <math> z </math>, the condition <math> z^T A^T A z = \| A z \|_2^2 > 0, </math> since the non-singularity of matrix <math>A</math> means that <math>Az \neq 0.</math>
| |
| | |
| The examples ''M'' and ''N'' above show that a matrix in which some elements are negative may still be positive-definite, and conversely a matrix whose entries are all positive may not be positive definite.
| |
| | |
| ==Connections==
| |
| The general purely [[quadratic form|quadratic real function]] ''f''(''z'') on ''n'' real variables ''z''<sub>1</sub>, ..., ''z<sub>n</sub>'' can always be written as ''z''<sup>T</sup>''Mz'' where ''z'' 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 ''z'' is zero, and is strictly positive for any other ''z''.
| |
| | |
| More generally, a twice-differentiable real function ''f'' on ''n'' real variables has an isolated local minimum at arguments ''z''<sub>1</sub>, ..., ''z<sub>n</sub>'' if its [[gradient]] is zero and its [[Hessian matrix|Hessian]] (the matrix of all second derivatives) is positive 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 combination of the others. Conversely, every positive semi-definite matrix is the covariance matrix of some multivariate distribution.
| |
| | |
| == Characterizations ==
| |
| Let ''M'' be an ''n'' × ''n'' [[Hermitian matrix]]. The following properties are equivalent to ''M'' being positive definite:
| |
| #'''All its [[eigenvalues]] are positive.''' Let ''P''<sup>−1</sup>''DP'' be an [[eigendecomposition of a matrix|eigendecomposition]] of ''M'', where ''P'' is a [[unitary matrix|unitary complex matrix]] whose rows comprise an [[orthonormal basis]] of [[eigenvector]]s of ''M'', and ''D'' is a ''real'' [[diagonal matrix]] whose [[main diagonal]] contains the corresponding [[eigenvalue]]s. 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 signs|Descartes' rule of alternating signs]] when the [[characteristic polynomial]] of a real, symmetric matrix ''M'' is available.
| |
| #'''The associated sesquilinear form is an inner product.''' The [[sesquilinear form]] defined by ''M'' is the function <math>\langle \cdot,\cdot\rangle</math> from '''C'''<sup>''n''</sup> × '''C'''<sup>''n''</sup> to '''C''' such that <math>\langle x,y\rangle := y^*M x</math> for all ''x'' and ''y'' in '''C'''<sup>''n''</sup>, where ''y<sup>*</sup>'' is the complex conjugate of ''y''. For any complex matrix ''M'', this form is linear in each argument separately. Therefore the form is an [[inner product]] on '''C'''<sup>''n''</sup> if and only if <math>\langle z,z\rangle</math> is real and positive for all nonzero ''z''; that is if and only if ''M'' is positive definite. (In fact, every inner product on '''C'''<sup>''n''</sup> arises in this fashion from a Hermitian positive definite matrix.)
| |
| # '''It is the Gram matrix of linearly independent vectors.''' Let <math>x_1,\ldots,x_n</math> be a list of ''n'' [[linearly independent]] vectors of some [[complex vector space]] with an inner product <math>\langle \cdot,\cdot\rangle</math>. It can be verified that the [[Gram matrix]] ''M'' of those vectors, defined by <math>M_{ij} = \langle x_i, x_j\rangle</math>, is always positive definite. Conversely, if ''M'' is positive definite, it has an eigendecomposition ''P''<sup>−1</sup>''DP'' where ''P'' is unitary, ''D'' diagonal, and all diagonal elements D<sub>''ii''</sub> = λ<sub>''i''</sub> of ''D'' are real and positive. Let <math>x_1,\ldots,x_n</math> be the columns of ''P'', each multiplied by the (real) square root of the corresponding eigenvalue λ<sub>''i''</sub>. These vectors are linearly independent, and ''M'' is their Gram matrix, under the standard inner product of '''C'''<sup>''n''</sup>, namely <math>\langle x_i, x_j\rangle = x_i^* x_j</math>
| |
| # '''Its leading principal minors are all positive.''' The ''k''th [[principal minor|leading principal minor]] of a matrix ''M'' is the [[determinant]] of its upper-left ''k'' by ''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 [[pivot element|pivoting]] process. Since the ''k''th 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.
| |
| #'''It has a unique Cholesky decomposition.''' 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*''. This factorization is called the [[Cholesky decomposition]] of ''M''.
| |
| | |
| ==Quadratic forms==
| |
| The (purely) [[quadratic form]] associated with a real matrix ''M'' is the function ''Q'' : '''R'''<sup>''n''</sup> → '''R''' such that ''Q''(''x'') = ''x''<sup>T</sup>''Mx'' for all ''x''. It turns out that the matrix ''M'' is positive definite if and only if it is symmetric and its quadratic form is a [[strictly convex function]].
| |
| | |
| More generally, any [[quadratic function]] from '''R'''<sup>''n''</sup> to '''R''' can be written as ''x''<sup>T</sup>''Mx'' + ''x''<sup>T</sup>''b'' + ''c'' where ''M'' is a symmetric ''n'' × ''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 (mathematics)|optimization]] problems.
| |
| | |
| == Simultaneous diagonalization ==
| |
| | |
| A symmetric, and a symmetric and positive-definite matrix can be simultaneously diagonalized, although not necessarily via a [[Matrix similarity|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''−λ''N'')''x'' = 0 where we impose that ''x'' be normalized, i.e. ''x''<sup>T</sup>''Nx'' = 1. Now we use [[Cholesky decomposition]] to write the inverse of ''N'' as ''Q''<sup>T</sup>''Q''. Multiplying by ''Q'' and ''Q''<sup>T</sup>, we get ''Q''(''M''−λ''N'')''Q''<sup>T</sup>''x'' = 0, which can be rewritten as (''QMQ''<sup>T</sup>)''y'' = λ''y'' where ''y''<sup>T</sup>''y'' = 1. Manipulation now yields ''MX'' = ''NX''Λ where ''X'' is a matrix having as columns the generalized eigenvectors and Λ is a diagonal matrix with the generalized eigenvalues. Now premultiplication with ''X''<sup>T</sup> gives the final result: ''X''<sup>T</sup>''MX'' = Λ and ''X''<sup>T</sup>''NX'' = ''I'', but note that this is no longer an orthogonal diagonalization.
| |
| | |
| Note that this result does not contradict what is said on simultaneous diagonalization in the article [[Diagonalizable matrix#Simultaneous diagonalization|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. For this result see Horn&Johnson, 1985, page 218 and following.
| |
| | |
| == Negative-definite, semidefinite and indefinite matrices ==<!-- [[Positive-semidefinite matrix]] and [[Positive semi-definite matrix]] redirect here -->
| |
| A [[Hermitian matrix]] is negative-definite, negative-semidefinite, or positive-semidefinite if and only if all of its [[eigenvalues]] are negative, non-positive, or non-negative, respectively.
| |
| | |
| === Negative-definite ===
| |
| | |
| The {{nowrap|''n'' × ''n''}} Hermitian matrix ''M'' is said to be ''negative-definite'' if
| |
| | |
| :<math>x^{*} M x < 0\,</math><!-- The \, is to keep the formula rendered as PNG instead of HTML. Please don't remove it.-->
| |
| | |
| for all non-zero ''x'' in '''C'''<sup>''n''</sup> (or, all non-zero ''x'' in '''R'''<sup>''n''</sup> for the real matrix), where ''x*'' is the [[conjugate transpose]] of ''x''.
| |
| | |
| A matrix is negative definite if all ''k''th order leading principal minors are negative when ''k'' is odd, and positive when ''k'' is even.
| |
| | |
| === Positive-semidefinite ===
| |
| M is called ''positive-semidefinite'' (or sometimes ''nonnegative-definite'') if
| |
| | |
| :<math>x^{*} M x \geq 0</math>
| |
| | |
| for all ''x'' in '''C'''<sup>''n''</sup> (or, all ''x'' in '''R'''<sup>''n''</sup> for the real matrix).
| |
| | |
| 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.
| |
| | |
| For any matrix ''A'', the matrix ''A*A'' is positive semidefinite, and rank(''A'') = rank(''A*A'').
| |
| Conversely, any Hermitian positive definite matrix ''M'' can be written as ''M'' = ''LL*''; this is the [[Cholesky decomposition]].
| |
| | |
| 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 principle minors only, as is checked on the diagonal matrix with entries 0 and -1.
| |
| | |
| === Negative-semidefinite ===
| |
| It is called ''negative-semidefinite'' if
| |
| | |
| :<math>x^{*} M x \leq 0</math>
| |
| | |
| for all ''x'' in '''C'''<sup>''n''</sup> (or, all ''x'' in '''R'''<sup>''n''</sup> for the real matrix).
| |
| | |
| === Indefinite ===
| |
| A Hermitian matrix which is neither positive definite, negative definite, positive-semidefinite, nor negative-semidefinite is called ''indefinite''. Indefinite matrices are also characterized by having both positive and negative eigenvalues.
| |
| | |
| == Further properties ==
| |
| If ''M'' is an Hermitian positive-semidefinite matrix, one sometimes writes ''M'' ≥ 0 and if ''M'' is positive-definite one writes ''M'' > 0.<ref>This may be confusing, as sometimes [[nonnegative matrix|nonnegative matrices]] are also denoted in this way. A common alternative notation is <math>M \succeq 0</math> and <math> M \succ 0</math> for positive semidefinite and positive definite matrices, respectively.</ref> The notion comes from [[functional analysis]] where positive-semidefinite matrices define [[positive operator]]s.
| |
| | |
| For arbitrary square matrices ''M'', ''N'' we write ''M'' ≥ ''N'' if ''M'' − ''N'' ≥ 0; i.e., ''M'' − ''N'' is positive semi-definite. This defines a [[partially ordered set|partial ordering]] on the set of all square matrices. One can similarly define a strict partial ordering ''M'' > ''N''.
| |
| | |
| <ol>
| |
| <li>Every positive definite matrix is [[invertible matrix|invertible]] and its inverse is also positive definite.<ref>{{harvtxt|Horn|Johnson|1985}}, p. 397</ref> If ''M'' ≥ ''N'' > 0 then ''N''<sup>−1</sup> ≥ ''M''<sup>−1</sup> > 0.<ref>{{harvtxt|Horn|Johnson|1985}}, Corollary 7.7.4(a)</ref>
| |
| <li>If ''M'' is positive definite and ''r'' > 0 is a real number, then ''rM'' is positive definite.<ref name="HJobs713">{{harvtxt|Horn|Johnson|1985}}, Observation 7.1.3</ref>
| |
| | |
| If ''M'' and ''N'' are positive definite, then the sum ''M'' + ''N''<ref name="HJobs713"/> and the products ''MNM'' and ''NMN'' are also positive definite. If ''MN'' = ''NM'', then ''MN'' is also positive definite.
| |
| | |
| <li>Every principal submatrix of a positive definite matrix is positive definite.
| |
| | |
| <li>''Q<sup>T</sup> M Q'' is non-negative definite. If ''Q'' is invertible, then ''Q<sup>-1</sup> M Q'' and ''Q<sup>T</sup> M Q'' are positive definite.
| |
| | |
| <li>The determinant of ''M'' is bounded by the product of its diagonal elements.
| |
| | |
| <li>The diagonal entries ''m<sub>ii</sub>'' are real and non-negative. As a consequence the [[trace (linear algebra)|trace]], tr(''M'') ≥ 0. Furthermore<ref>{{harvtxt|Horn|Johnson|1985}}, p. 398</ref>
| |
| :<math>|m_{ij}| \leq \sqrt{m_{ii}m_{jj}} \leq \frac{m_{ii}+m_{jj}}{2}</math>
| |
| and thus
| |
| :<math> \max |m_{ij}| \leq \max|m_{ii}|</math>
| |
| | |
| <li>A matrix ''M'' is positive semi-definite if and only if there is a positive semi-definite matrix ''B'' with ''B''<sup>2</sup> = ''M''. This matrix ''B'' is unique,<ref>{{harvtxt|Horn|Johnson|1985}}, Theorem 7.2.6 with ''k'' = 2</ref> is called the [[square root of a matrix|square root]] of ''M'', and is denoted with ''B'' = ''M''<sup>1/2</sup> (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''<sup>1/2</sup> > ''N''<sup>1/2</sup> > 0.
| |
| | |
| <li>If ''M'' is a symmetric matrix of the form ''m<sub>ij</sub>'' = ''m''(''i''−''j''), and the ''strict'' inequality holds
| |
| :<math>\sum\nolimits_{j\neq 0}|m(j)|< m(0)</math>
| |
| then ''M'' is ''strictly'' positive definite.
| |
| | |
| <li>Let ''M'' > 0 and ''N'' Hermitian. If ''MN'' + ''NM'' ≥ 0 (resp., ''MN'' + ''NM'' > 0) then ''N'' ≥ 0 (resp., ''N'' > 0).{{citation needed|date=November 2010}}
| |
| | |
| <li>If ''M'' > 0 is real, then there is a δ > 0 such that ''M'' > δI, where ''I'' is the [[identity matrix]].
| |
| | |
| <li> If ''M<sub>k</sub>'' denotes the leading ''k'' by ''k'' minor, <math> \det(M_k)/\det(M_{k-1}) </math> is the ''k''th pivot during [[LU decomposition]]
| |
| | |
| <li> The set of positive semidefinite symmetric matrices is [[convex set|convex]]. That is, if ''M'' and ''N'' are positive semidefinite, then for any α between 0 and 1, α''M'' + (1−α)''N'' is also positive semidefinite. For any vector ''x'':
| |
| : <math> x^\top (\alpha M + (1-\alpha) N ) x = \alpha x^\top M x + (1-\alpha) x^\top N x \geq 0. </math>
| |
| This property guarantees that [[semidefinite programming]] problems converge to a globally optimal solution.
| |
| | |
| <li>If ''M,N'' ≥ 0, although ''MN'' is not necessary positive-semidefinite, the [[Kronecker product]] ''M'' ⊗ ''N'' ≥ 0, the [[Hadamard product (matrices)|Hadamard product]] ''M'' ○ ''N'' ≥ 0 (this result is often called the [[Schur product theorem]]).,<ref>{{harvtxt|Horn|Johnson|1985}}, Theorem 7.5.3</ref> and the [[Matrix multiplication#Frobenius product|Frobenius product]] ''M'' : ''N'' ≥ 0 (Lancaster-Tismenetsky, The Theory of Matrices, p. 218).
| |
| | |
| <li>Regarding the Hadamard product of two positive-semidefinite matrices ''M'' = (''m<sub>ij</sub>'') ≥ 0, ''N'' ≥ 0, there are two notable inequalities:
| |
| *Oppenheim's inequality: <math>\det(M \circ N) \geq \det (N) \prod\nolimits_{i} m_{ii}.</math><ref>{{harvtxt|Horn|Johnson|1985}}, Theorem 7.8.6</ref>
| |
| *det(''M'' ○ ''N'') ≥ det(''M'') det(''N'').<ref name=styan1973>{{Harvard citations | last=Styan | year=1973}}</ref>
| |
| </ol>
| |
| | |
| == Block matrices ==
| |
| A positive 2''n'' × 2''n'' matrix may also be defined by [[block matrix|blocks]]:
| |
| | |
| :<math> M = \begin{bmatrix} A & B \\ C & D \end{bmatrix} </math>
| |
| | |
| where each block is ''n'' × ''n''. By applying the positivity condition, it immediately follows that ''A'' and ''D'' are hermitian, and ''C'' = ''B*''.
| |
| | |
| We have that ''z*Mz'' ≥ 0 for all complex ''z'', and in particular for ''z'' = ( ''v'', 0)<sup>T</sup>. Then
| |
| | |
| :<math> \begin{bmatrix} v^* & 0 \end{bmatrix} \begin{bmatrix} A & B \\ B^* & D \end{bmatrix} \begin{bmatrix} v \\ 0 \end{bmatrix} = v^* A v \ge 0. </math>
| |
| | |
| 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#Schur_complement_condition_for positive_definiteness|Schur complement]].
| |
| | |
| == On the definition ==
| |
| | |
| ===Consistency between real and complex definitions===
| |
| Since every real matrix is also a complex matrix, the definitions of "positive definite" 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, that is, its transpose is equal to its conjugate. To see this, consider the matrices ''A'' = (''M''+''M*'')/2 and ''B'' = (''M''−''M*'')/(2''i''), 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''<sup>T</sup>''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
| |
| | |
| :<math>M = \begin{bmatrix} 1 & 1 \\ -1 & 1 \end{bmatrix},</math>
| |
| | |
| then for any real vector ''z'' with entries ''a'' and ''b'' we have ''z''<sup>T</sup>''Mz'' = (''a''−''b'')''a'' + (''a''+''b'')''b'' = ''a''<sup>2</sup> + ''b''<sup>2</sup>, 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'']<sup>T</sup> = [1+''i'', 1−''i''][1, ''i'']<sup>T</sup> = 2 + 2''i'',
| |
| | |
| which is not real. Therefore, ''M'' is not positive definite.
| |
| | |
| On the other hand, for a ''symmetric'' real matrix ''M'', the condition "''z''<sup>T</sup>''Mz'' > 0 for all nonzero real vectors ''z''" ''does'' imply that ''M'' is positive definite in the complex sense.
| |
| | |
| ===Extension for non symmetric 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''.<ref name="mathw">Weisstein, Eric W. ''[http://mathworld.wolfram.com/PositiveDefiniteMatrix.html Positive Definite Matrix.]'' From ''MathWorld--A Wolfram Web Resource''. Accessed on 2012-07-26</ref> This weaker definition encompasses some non-Hermitian complex matrices, including some non-symmetric real ones, such as <math> \bigl[ \begin{smallmatrix} 1 & 1 \\ -1 & 1 \end{smallmatrix} \bigr] </math>.
| |
| | |
| Indeed, with this definition, a real matrix is positive definite if and only if ''z''<sup>T</sup>''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 (''M'' + ''M*'')/2 of ''M'' is positive definite in the narrower sense. Similarly, we have ''x''<sup>T</sup>''Mx'' > 0 for all real nonzero vectors ''x'' if and only if the symmetric part (''M'' + ''M''<sup>T</sup>)/2 of ''M'' is positive definite in the narrower sense.
| |
| | |
| In summary, the distinguishing feature between the real and complex case is that, a [[Bounded operator|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]]
| |
| | |
| == Notes ==
| |
| {{Reflist}}
| |
| | |
| == References ==
| |
| * {{Citation | last1=Horn | first1=Roger A. | last2=Johnson | first2=Charles R. | title=Matrix Analysis | publisher=[[Cambridge University Press]] | isbn=978-0-521-38632-6 | year=1990}}.
| |
| * [[Rajendra Bhatia]]. ''Positive definite matrices''. Princeton Series in Applied Mathematics, 2007. ISBN 978-0-691-12918-1.
| |
| | |
| == External links ==
| |
| * {{springer|title=Positive-definite form|id=p/p073880}}
| |
| * [http://mathworld.wolfram.com/PositiveDefiniteMatrix.html Wolfram MathWorld: Positive Definite Matrix]
| |
| | |
| {{DEFAULTSORT:Positive-Definite Matrix}}
| |
| [[Category:Matrices]]
| |
| | |
| [[de:Definitheit#Definitheit von Matrizen]]
| |