<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Blog de Jean-Christophe Lavocat &#187; Maths</title>
	<atom:link href="http://jice.lavocat.name/blog/category/sciences/maths/feed/" rel="self" type="application/rss+xml" />
	<link>http://jice.lavocat.name/blog</link>
	<description>Mon Bioblog (humeurs, tendances et aventures en tout genres)</description>
	<lastBuildDate>Mon, 05 Dec 2011 20:51:40 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>Tout sur Hadamard</title>
		<link>http://jice.lavocat.name/blog/2009/07/tout-sur-hadamard/</link>
		<comments>http://jice.lavocat.name/blog/2009/07/tout-sur-hadamard/#comments</comments>
		<pubDate>Mon, 20 Jul 2009 01:37:33 +0000</pubDate>
		<dc:creator>Jice</dc:creator>
				<category><![CDATA[Maths]]></category>
		<category><![CDATA[Quantum Information]]></category>
		<category><![CDATA[Hadamard]]></category>
		<category><![CDATA[Histoire des Sciences]]></category>
		<category><![CDATA[Matrices]]></category>

		<guid isPermaLink="false">http://jice.lavocat.name/blog/?p=712</guid>
		<description><![CDATA[Qui est donc ce fameux Hadamard dont tout le monde parle en informatique quantique? Jacques Hadamard est un mathématicien français (1865-1963) à qui l'on doit les célèbres matrices (encore un normalien). Je vous conseille la biographie suivante sur Jacques Hadamard : Jacques Hadamard un mathématicien universel Ainsi que ce site regroupant les propriétés des-dites matrices [...]]]></description>
			<content:encoded><![CDATA[<p>Qui est donc ce fameux Hadamard dont tout le monde parle en informatique quantique? <a title="Jacques Hadamard" href="http://fr.wikipedia.org/wiki/Jacques_Hadamard" target="_blank">Jacques Hadamard</a> est un mathématicien français (1865-1963) à qui l'on doit les célèbres matrices (encore un normalien).</p>
<p>Je vous conseille la biographie suivante sur Jacques Hadamard : <a title="Jacques Hadamard" href="http://books.google.fr/books?id=NhK6LIApE8UC&amp;printsec=frontcover" target="_blank">Jacques Hadamard un mathématicien universel</a></p>
<p>Ainsi que ce site regroupant les propriétés des-dites matrices : <a title="Propriétés des matrices de Hadamard" href="http://chaos.if.uj.edu.pl/~karol/hadamard/index.php" target="_blank">http://chaos.if.uj.edu.pl/~karol/hadamard/index.php</a></p>
]]></content:encoded>
			<wfw:commentRss>http://jice.lavocat.name/blog/2009/07/tout-sur-hadamard/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On Matrix decomposition</title>
		<link>http://jice.lavocat.name/blog/2009/07/on-matrix-decomposition/</link>
		<comments>http://jice.lavocat.name/blog/2009/07/on-matrix-decomposition/#comments</comments>
		<pubDate>Wed, 08 Jul 2009 19:52:56 +0000</pubDate>
		<dc:creator>Jice</dc:creator>
				<category><![CDATA[Maths]]></category>
		<category><![CDATA[Matrix]]></category>

		<guid isPermaLink="false">http://jice.lavocat.name/blog/?p=627</guid>
		<description><![CDATA[In order to complete the previous post on unitary matrix decomposition (sum) , I give here two interesting links about other known matrix decomposition : http://en.wikipedia.org/wiki/Matrix_decomposition http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf In quantum physics we love to use unitary operations, so here are the decompositions involving unitary matrices. We have U,V unitary, T,R triangular, Q orthogonal and D diagonal [...]]]></description>
			<content:encoded><![CDATA[<p>In order to complete the previous post on <a href="http://jice.lavocat.name/blog/2009/07/decomposition-in-unitary-matrices/" target="_blank">unitary matrix decomposition</a> (sum) , I give here two interesting links about other known matrix decomposition :</p>
<ul>
<li><a title="Matrix decomposition" href="http://en.wikipedia.org/wiki/Matrix_decomposition" target="_blank">http://en.wikipedia.org/wiki/Matrix_decomposition</a></li>
<li><a title="Matrix Decomposition" href="http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf" target="_blank">http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf</a><span id="more-627"></span></li>
</ul>
<p>In quantum physics we love to use unitary operations, so here are the decompositions involving unitary matrices. We have U,V unitary, T,R triangular, Q orthogonal and D diagonal :</p>
<ul>
<li><a href="http://en.wikipedia.org/wiki/Schur_decomposition" target="_blank">Schur Decomposition</a> : <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_ecddd1bd26de9b47b9b78f780c8507f7.gif' style='vertical-align: middle; border: none; ' class='tex' alt="M=UTU^{\dagger}" /></span><script type='math/tex'>M=UTU^{\dagger}</script></li>
<li><a href="http://en.wikipedia.org/wiki/Singular_value_decomposition" target="_blank">Singular Value Decomposition</a> : <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_5b33b2ff726435368a77b45425bad748.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt=" M=UDV^{*}" /></span><script type='math/tex'> M=UDV^{*}</script></li>
<li><a href="http://en.wikipedia.org/wiki/QZ_decomposition#Generalized_Schur_decomposition" target="_blank">QZ decomposition</a> (generalized Schurr) : <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_b9c42398b24d1fa565f9fca42464f5cf.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="M = UTV^*" /></span><script type='math/tex'>M = UTV^*</script></li>
<li><a href="http://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> : <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_87dc57446415573109eb7b50039bb086.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="M=QR" /></span><script type='math/tex'>M=QR</script></li>
</ul>
<p>Do you use other useful unitary decomposition?</p>
]]></content:encoded>
			<wfw:commentRss>http://jice.lavocat.name/blog/2009/07/on-matrix-decomposition/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Decomposition in unitary matrices</title>
		<link>http://jice.lavocat.name/blog/2009/07/decomposition-in-unitary-matrices/</link>
		<comments>http://jice.lavocat.name/blog/2009/07/decomposition-in-unitary-matrices/#comments</comments>
		<pubDate>Tue, 07 Jul 2009 21:34:27 +0000</pubDate>
		<dc:creator>Jice</dc:creator>
				<category><![CDATA[Maths]]></category>
		<category><![CDATA[Linear Algebra]]></category>

		<guid isPermaLink="false">http://jice.lavocat.name/blog/?p=615</guid>
		<description><![CDATA[Conjecture : Any complex or real matrix is the sum of two unitary matrices. Proof (ideas) : We know that every complex matrix A could be diagonalized using two unitary matrices U and V : . The matrix D has positive elements : D=diag(d1,...d2) with  . A basic result is the following : every diagonal [...]]]></description>
			<content:encoded><![CDATA[<p><strong>Conjecture </strong>: Any complex or real matrix is the sum of two unitary matrices.</p>
<p><strong>Proof </strong>(ideas) :</p>
<p>We know that every complex matrix A could be diagonalized using two unitary matrices U and V : <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_1d9461211d8c385f5a8d94ee9274cfe1.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt=" A = UDV^{*} " /></span><script type='math/tex'> A = UDV^{*} </script> . The matrix D has positive elements : D=diag(d1,...d2) with  <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_563583fb1d5ea221ee243be1949513cc.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_1\geq d_2 \geq ...\geq d_n \geq 0" /></span><script type='math/tex'>d_1\geq d_2 \geq ...\geq d_n \geq 0</script>.</p>
<p><strong>A basic result is the following</strong> : every diagonal matrix could be diagonalized with n unitary matrix. Indeed,  you just have to choose the good coefficient and use the set of matrix {<span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_6341ba6a49941e2b8c6fe519b10aa2b5.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt=" E_i " /></span><script type='math/tex'> E_i </script>} where <span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_202ad7254f4d72227e10deb23f3b4f3d.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="E_i" /></span><script type='math/tex'>E_i</script> is a diagonal with -1 everywhere, except at position i  where there is a +1:</p>
<p style="text-align: center;"><span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_c6cda4c6f3eeb7308be9611b92684a8a.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\begin{pmatrix} -1 &  &  &  &  &  &  &  & \\ &  & \ddots  &  &  &  & 0 &  & \\ &  &    & -1 &  &  &  &  & \\ &  & &   & 1 &  &  &  & \\ &  & 0        &   &  & -1 &  &  & \\ &  &  &  &  &  & \ddots &  & \\ &  &  &  &  &  &  & 1 & \end{pmatrix}" /></span><script type='math/tex'>\begin{pmatrix} -1 &  &  &  &  &  &  &  & \\ &  & \ddots  &  &  &  & 0 &  & \\ &  &    & -1 &  &  &  &  & \\ &  & &   & 1 &  &  &  & \\ &  & 0        &   &  & -1 &  &  & \\ &  &  &  &  &  & \ddots &  & \\ &  &  &  &  &  &  & 1 & \end{pmatrix}</script></p>
<p>The matrices in this set are unitary, and they are a basis of diagonal matrices.</p>
<p><strong>Result for a sum of only two terms :</strong></p>
<p>For n=2 we see that the previous matrices (Ei)  works, and there are only two of them.</p>
<p>For any n, I think that we could prove the hypothesis : Every diagonal matrix could be a sum of two block matrix as the following :</p>
<p style="text-align: center;"><span class='MathJax_Preview'><img src='http://jice.lavocat.name/blog/wp-content/plugins/latex/cache/tex_e4bfb2f303ab09f72b108265884f703e.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\begin{pmatrix}<br />
(U) &  & 0\\<br />
&  & \\<br />
0&  & 1<br />
\end{pmatrix}<br />
,<br />
\begin{pmatrix}<br />
1&  & 0  \\<br />
&  &   \\<br />
0 &  & (V)<br />
\end{pmatrix}" /></span><script type='math/tex'>\begin{pmatrix}<br />
(U) &  & 0\\<br />
&  & \\<br />
0&  & 1<br />
\end{pmatrix}<br />
,<br />
\begin{pmatrix}<br />
1&  & 0  \\<br />
&  &   \\<br />
0 &  & (V)<br />
\end{pmatrix}</script></p>
<p style="text-align: justify;">I have not the end of the proof, but I was thinking of writing D as the sum or product of matrix of the form diag(1,d2,...dn+1) and diag(d1,d2,...dm,1). And applying a recurrence hypothesis, but I did not suceed.</p>
]]></content:encoded>
			<wfw:commentRss>http://jice.lavocat.name/blog/2009/07/decomposition-in-unitary-matrices/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

