Decomposition in unitary matrices
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 matrix could be diagonalized with n unitary matrix. Indeed, you just have to choose the good coefficient and use the set of matrix {
} where
is a diagonal with -1 everywhere, except at position i where there is a +1:

The matrices in this set are unitary, and they are a basis of diagonal matrices.
Result for a sum of only two terms :
For n=2 we see that the previous matrices (Ei) works, and there are only two of them.
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 :

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.














July 8th, 2009 at 11:27
Hi J.C. Certainly the matrix 10I (I being the identity matrix) is not a sum of two unitaries.
July 8th, 2009 at 18:19
Do you mean the following matrix :