Is it possible to decompose an n by n unitary matrix U, such that $U=O_1DO_2 $ with D being diagonal(obviously just has complex phase factors) and $O_1,O_2$ being real orthogonal matrices.
2026-04-01 18:52:59.1775069579
unitary matrix decomposition using orthogonal matrices
870 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in MATRIX-DECOMPOSITION
- Real eigenvalues of a non-symmetric matrix $A$ ?.
- Swapping row $n$ with row $m$ by using permutation matrix
- Block diagonalizing a Hermitian matrix
- $A \in M_n$ is reducible if and only if there is a permutation $i_1, ... , i_n$ of $1,... , n$
- Simplify $x^TA(AA^T+I)^{-1}A^Tx$
- Diagonalize real symmetric matrix
- How to solve for $L$ in $X = LL^T$?
- Q of the QR decomposition is an upper Hessenberg matrix
- Question involving orthogonal matrix and congruent matrices $P^{t}AP=I$
- Singular values by QR decomposition
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Hint: Let $M$ a complex $n\times n$ matrix. Is it always possible to decompose it as $$M = O_1 D O_2$$ ? Dimension considerations say no. Indeed, the space of complex matrices has $2n^2$ degrees of freedom, while on the RHS we get $\binom{n}{2} + 2n + \binom{n}{2} = n^2 + n$. There must be some extra conditions required for $n>1$.
Note that from $M= O_1 D O_2$ we get $$\bar M = O_1 \bar D O_2$$
So we see that $M$ and $\bar M$ (or, if you want, $\mathcal{Re}M$ and $\mathcal{Im}M$) have "real singular value decomposition with the same $O_1$, $O_2$. When is this possible. If we go through the proof of the singular value decomposition theorem we notice that the matrices $M^t M$ are used. So we get
$$M = O_1 D O_2\\ M^t = O_2^t D O_1^{t}\\ M^t M = O_2^t D^2 O_2$$
while
$$\bar M = O_1 \bar D O_2\\ \bar M^t = O_2^t \bar D O_1^{t}\\ \bar M^t \bar M = O_2^t \bar D^2 O_2$$
The last lines are the key
$$M^t M = O_2^{-1} D^2 O_2\\ \bar M^t \bar M = O_2^{-1} \bar D^2 O_2$$
The matrices $M^t M$ and $\bar M^t \bar M$ can be conjugated by the same orthogonal map to diagonal matrices. This implies that these matrices commute
$$M^t M \bar M^t \bar M= \bar M^t \bar M M^t M$$
It is not very hard (using the simultaneous reduction of commuting symmetric matrices to diagonal form by the same orthogonal) that this condition is also sufficient.
Now we ask: does this hold for every unitary matrix? I will leave this for you to check.