Jump to content

Schur product theorem: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Lilily (talk | contribs)
link to text at EUDML
m Checkwiki 61 + General Fixes using AWB
Line 1: Line 1:
In [[mathematics]], particularly in [[linear algebra]], the '''Schur product theorem''' states that the [[Hadamard_product_(matrices)|Hadamard product]] of two [[positive definite matrices]] is also a positive definite matrix. The result is named after [[Issai Schur]]<ref name="Sch1911">{{Cite doi|10.1515/crll.1911.140.1}}</ref> (Schur 1911, p. 14, Theorem VII) (note that Schur signed as J. Schur in ''Journal für die reine und angewandte Mathematik''<ref>{{Cite doi|10.1007/b105056}}, page 9, Ch. 0.6 ''Publication under J. Schur''</ref><ref>{{Cite doi|10.1112/blms/15.2.97}}</ref>.)
In [[mathematics]], particularly in [[linear algebra]], the '''Schur product theorem''' states that the [[Hadamard product (matrices)|Hadamard product]] of two [[positive definite matrices]] is also a positive definite matrix. The result is named after [[Issai Schur]]<ref name="Sch1911">{{Cite doi|10.1515/crll.1911.140.1}}</ref> (Schur 1911, p.&nbsp;14, Theorem VII) (note that Schur signed as J. Schur in ''Journal für die reine und angewandte Mathematik''.<ref>{{Cite doi|10.1007/b105056}}, page 9, Ch. 0.6 ''Publication under J. Schur''</ref><ref>{{Cite doi|10.1112/blms/15.2.97}}</ref>)


== Proof ==
== Proof ==
Line 7: Line 7:
It is easy to show that for matrices <math>M</math> and <math>N</math>, the Hadamard product <math>M \circ N</math> considered as a bilinear form acts on vectors <math>a, b</math> as
It is easy to show that for matrices <math>M</math> and <math>N</math>, the Hadamard product <math>M \circ N</math> considered as a bilinear form acts on vectors <math>a, b</math> as
: <math>a^T (M \circ N) b = \operatorname{Tr}(M \operatorname{diag}(a) N \operatorname{diag}(b))</math>
: <math>a^T (M \circ N) b = \operatorname{Tr}(M \operatorname{diag}(a) N \operatorname{diag}(b))</math>
where <math>\operatorname{Tr}</math> is the matrix [[Trace_(linear_algebra)|trace]] and <math>\operatorname{diag}(a)</math> is the [[diagonal matrix]] having as diagonal entries the elements of <math>a</math>.
where <math>\operatorname{Tr}</math> is the matrix [[Trace (linear algebra)|trace]] and <math>\operatorname{diag}(a)</math> is the [[diagonal matrix]] having as diagonal entries the elements of <math>a</math>.


Since <math>M</math> and <math>N</math> are positive definite, we can consider their square-roots <math>M^{1/2}</math> and <math>N^{1/2}</math> and write
Since <math>M</math> and <math>N</math> are positive definite, we can consider their square-roots <math>M^{1/2}</math> and <math>N^{1/2}</math> and write
Line 47: Line 47:
Let <math>M = \sum \mu_i m_i m_i^T</math> and <math>N = \sum \nu_i n_i n_i^T</math>. Then
Let <math>M = \sum \mu_i m_i m_i^T</math> and <math>N = \sum \nu_i n_i n_i^T</math>. Then
: <math>M \circ N = \sum_{ij} \mu_i \nu_i (m_i m_i^T) \circ (n_i n_i^T) = \sum_{ij} \mu_i \nu_j (m_i \circ n_j) (m_i \circ n_j)^T</math>
: <math>M \circ N = \sum_{ij} \mu_i \nu_i (m_i m_i^T) \circ (n_i n_i^T) = \sum_{ij} \mu_i \nu_j (m_i \circ n_j) (m_i \circ n_j)^T</math>
Each <math>(m_i \circ n_j) (m_i \circ n_j)^T</math> is positive (but, except in the 1-dimensional case, not positive definite, since they are [[Rank_(linear_algebra)|rank]] 1 matrices) and <math>\mu_i \nu_j > 0</math>, thus the sum giving <math>M \circ N</math> is also positive.
Each <math>(m_i \circ n_j) (m_i \circ n_j)^T</math> is positive (but, except in the 1-dimensional case, not positive definite, since they are [[Rank (linear algebra)|rank]] 1 matrices) and <math>\mu_i \nu_j > 0</math>, thus the sum giving <math>M \circ N</math> is also positive.


==== Complete proof ====
==== Complete proof ====
Line 62: Line 62:


== External links ==
== External links ==
* [https://eudml.org/doc/149352 Bemerkungen zur Theorie der beschränkten Bilinearformen mit unendlich vielen Veränderlichen] at [https://eudml.org EUDML]

[https://eudml.org/doc/149352 Bemerkungen zur Theorie der beschränkten Bilinearformen mit unendlich vielen Veränderlichen] at [https://eudml.org EUDML]


[[Category:Linear algebra]]
[[Category:Linear algebra]]

Revision as of 01:51, 27 November 2013

In mathematics, particularly in linear algebra, the Schur product theorem states that the Hadamard product of two positive definite matrices is also a positive definite matrix. The result is named after Issai Schur[1] (Schur 1911, p. 14, Theorem VII) (note that Schur signed as J. Schur in Journal für die reine und angewandte Mathematik.[2][3])

Proof

Proof using the trace formula

It is easy to show that for matrices and , the Hadamard product considered as a bilinear form acts on vectors as

where is the matrix trace and is the diagonal matrix having as diagonal entries the elements of .

Since and are positive definite, we can consider their square-roots and and write

Then, for , this is written as for and thus is positive. This shows that is a positive definite matrix.

Proof using Gaussian integration

Case of M = N

Let be an -dimensional centered Gaussian random variable with covariance . Then the covariance matrix of and is

Using Wick's theorem to develop we have

Since a covariance matrix is positive definite, this proves that the matrix with elements is a positive definite matrix.

General case

Let and be -dimensional centered Gaussian random variables with covariances , and independt from each other so that we have

for any

Then the covariance matrix of and is

Using Wick's theorem to develop

and also using the independence of and , we have

Since a covariance matrix is positive definite, this proves that the matrix with elements is a positive definite matrix.

Proof using eigendecomposition

Proof of positivity

Let and . Then

Each is positive (but, except in the 1-dimensional case, not positive definite, since they are rank 1 matrices) and , thus the sum giving is also positive.

Complete proof

To show that the result is positive definite requires further proof. We shall show that for any vector , we have . Continuing as above, each , so it remains to show that there exist and for which the inequality is strict. For this we observe that

Since is positive definite, there is a for which is not 0 for all , and then, since is positive definite, there is an for which is not 0 for all . Then for this and we have . This completes the proof.

References

  1. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1515/crll.1911.140.1, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1515/crll.1911.140.1 instead.
  2. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/b105056, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/b105056 instead., page 9, Ch. 0.6 Publication under J. Schur
  3. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1112/blms/15.2.97, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1112/blms/15.2.97 instead.