Credit: Magda Ehlers from Pexels
A polar decomposition says that an matrix can be factorized into where and denotes the conjugate transpose of .
Definition 2.1 (Unitary matrix). A complex matrix is unitary if and only if . In other words,
Definition 2.3 (Positive semi-definite matrix). An Hermitian complex matrix is called positive semidefinite, denoted by , if for every .
Lemma 2.5. Let be an Hermitian matrix. is positive semidefinite if and only if it can be decomposed as a product .
Proof. :
If , then
so
is
positive definite.
: Suppose
is positive
semidefinite, then
must be a Hermitian matrix and can be expressed in the form
where
is unitary and
is diagonal (it is a theorem but
we omit it for now). Moreover,
is positive semidefinite, the eigenvalues are nonnegative, we can therefore construct
by square rooting
each elements of , so
is also a diagonal
matrix and .
Then
Proof. : Let be an unitary matrix, by definition of unitary matrix,
then , the Kronecker
delta, for all . Hence
the column vectors of
are orthogonal.
: Since the column
vectors of
are orthogonal, then
Now we proof the polar decomposition.
Proof. Case 1: If , where
Note that is a
Hermitian matrix since .
Since is Hermitian matrix,
is positive semidefinite
by lemma 2.5, then
for all .
Suppose that ,
, and
for all
.
Without loss of generality, let
Extend it to orthonormal basis in ,
that is, .
Let , by
lemma 2.6,
is unitary and
Case 2: For any complex matrix , is a Hermitian matrix, then
So
Since
By Case 1, we have , where is unitary, hence
Note that if are unitary, then is unitary since .
Copyright© 2022 - AAMathNote
Powered by w3.css