The characteristic polynomial has degree . By the fundamental theorem of algebra, it has a complex root . Hence
so has a nonzero kernel. Any nonzero in that kernel satisfies
Thus is an eigenvalue and is a corresponding eigenvector.
The adjoint matrix of is its conjugate transpose:
A complex matrix is unitary matrix when
If with , unitarity preserves norms, so
Therefore every eigenvalue satisfies
Suppose is diagonalized by a unitary matrix:
where is diagonal. Then
Since the diagonal matrices and commute,
Thus is a normal matrix.
First note that if is normal, then
for every . Hence an eigenvector with also satisfies
Normalize and extend it to an orthonormal basis. Let have these basis vectors as columns. The first column of is . For every ,
so the first row also has no off-diagonal entries. Therefore
Comparing the two block products in the normality identity shows that , so is normal.
The result is trivial in dimension one. Applying the induction hypothesis to and adjoining the eigenvector gives an orthonormal eigenbasis for . This proves the unitary diagonalization of a normal matrix.
The proof is by induction on . Choose a unit eigenvector of , which exists by part (a), and extend it to an orthonormal basis. In that basis,
By induction, a unitary change of basis on the last coordinates makes upper triangular. Extending that change by the identity on the first coordinate leaves the displayed zero block intact. Their product is unitary and makes all of upper triangular. This proves Schur triangularization.
Let
This permutation matrix is unitary. The actions
give
which is upper triangular.

Articles by others on the same topic (0)

There are currently no matching articles.