Multiphoton intrapulse interference phase scan: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
 
en>Mogism
m Theory: Cleanup/Typo fixing, typo(s) fixed: is consisted → consists using AWB
 
Line 1: Line 1:
Hi there, I am Felicidad Oquendo. Arizona is her beginning location and she will never move. Managing individuals is what I do in my working day job. Bottle tops collecting is the only pastime his spouse doesn't approve of.<br><br>My web-site ... extended car warranty - [http://Srgame.Co.kr/qna/12373 visit the up coming website] -
In [[matrix (mathematics)|matrix]] theory, '''Sylvester's determinant theorem''' is a theorem useful for evaluating certain types of [[determinant]]s. It is named after [[James Joseph Sylvester]], who stated this theorem without proof.<ref>{{cite doi | 10.1016/S0378-4754(96)00035-3}}</ref>
 
The theorem states that if ''A'', ''B'' are matrices of size ''p''&nbsp;×&nbsp;''n'' and ''n''&nbsp;×&nbsp;''p'' respectively, then
 
:<math>\det(I_p + AB) = \det(I_n + BA),\ </math>
 
where ''I''<sub>''a''</sub> is the [[identity matrix]] of order ''a''.<ref>{{cite book |author=Harville, David A. |title=Matrix algebra from a statistician's perspective |publisher=Springer |location=Berlin |year=2008 |pages= |isbn=0-387-78356-3}} page 416</ref><ref>{{cite web | author = Weisstein, Eric W. | title = Sylvester's Determinant Identity | publisher = MathWorld--A Wolfram Web Resource | url = http://mathworld.wolfram.com/SylvestersDeterminantIdentity.html | accessdate = 2012 03 03}}</ref>
 
This can be seen for invertible ''A'', ''B'' by conjugating ''I + AB'' by ''A<sup>-1</sup>'', then extended to arbitrary square matrices by density of invertible matrices, and then to arbitrary
rectangular matrices by adding zero column or row vectors as necessary.
 
It is closely related to the [[Matrix determinant lemma]] and its generalization. It is the determinant analogue of the [[Woodbury matrix identity]] for matrix inverses.
 
==Proof==
The theorem may be proven as follows. Let <math>M</math> be a matrix comprising the four blocks <math>-A</math>, <math>B</math>, <math>I_n</math> and <math>I_p</math>
:<math>M = \begin{pmatrix}I_p & -A \\ B & I_n \end{pmatrix} </math>.
[[Block LU decomposition]] of <math>M</math> yields
:<math>M = \begin{pmatrix}I_p & 0 \\ B & I_n \end{pmatrix} \begin{pmatrix}I_p & -A \\ 0 & I_n + B A \end{pmatrix}</math>
from which 
:<math>\det(M) = \det(I_n + B A)</math>
follows. Decomposing <math>M</math> to an upper and a lower triangular matrix instead,
:<math>M = \begin{pmatrix}I_p + A B & -A \\ 0 & I_n \end{pmatrix} \begin{pmatrix}I_p & 0 \\ B & I_n \end{pmatrix}</math>,
yields
:<math>\det(M) = \det(I_p + A B)</math>.
This proves
:<math>\det(I_n + B A) = \det(I_p + A B)</math>.
 
==Applications==
 
This theorem is useful in developing a [[Bayes estimator]] for [[multivariate Gaussian distribution]]s.
 
The identity also finds applications in [[random matrix theory]] by relating determinants of large matrices to determinants of smaller ones.<ref>http://terrytao.wordpress.com/2010/12/17/the-mesoscopic-structure-of-gue-eigenvalues/</ref>
 
==References==
{{reflist}}
 
{{DEFAULTSORT:Sylvester's Determinant Theorem}}
[[Category:Determinants]]
[[Category:Matrix theory]]
[[Category:Linear algebra]]
[[Category:Theorems in algebra]]

Latest revision as of 23:37, 22 December 2013

In matrix theory, Sylvester's determinant theorem is a theorem useful for evaluating certain types of determinants. It is named after James Joseph Sylvester, who stated this theorem without proof.[1]

The theorem states that if A, B are matrices of size p × n and n × p respectively, then

det(Ip+AB)=det(In+BA),

where Ia is the identity matrix of order a.[2][3]

This can be seen for invertible A, B by conjugating I + AB by A-1, then extended to arbitrary square matrices by density of invertible matrices, and then to arbitrary rectangular matrices by adding zero column or row vectors as necessary.

It is closely related to the Matrix determinant lemma and its generalization. It is the determinant analogue of the Woodbury matrix identity for matrix inverses.

Proof

The theorem may be proven as follows. Let M be a matrix comprising the four blocks A, B, In and Ip

M=(IpABIn).

Block LU decomposition of M yields

M=(Ip0BIn)(IpA0In+BA)

from which

det(M)=det(In+BA)

follows. Decomposing M to an upper and a lower triangular matrix instead,

M=(Ip+ABA0In)(Ip0BIn),

yields

det(M)=det(Ip+AB).

This proves

det(In+BA)=det(Ip+AB).

Applications

This theorem is useful in developing a Bayes estimator for multivariate Gaussian distributions.

The identity also finds applications in random matrix theory by relating determinants of large matrices to determinants of smaller ones.[4]

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. Template:Cite doi
  2. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 page 416
  3. Template:Cite web
  4. http://terrytao.wordpress.com/2010/12/17/the-mesoscopic-structure-of-gue-eigenvalues/