A complex square matrix is a unitary matrix when , equivalently . Here denotes the adjoint matrix, the conjugate transpose. Such a matrix preserves the standard complex inner product and its Euclidean norm.
A real symmetric matrix is a Hermitian matrix, so . For arbitrary complex ,
The imaginary cross terms cancel because is Hermitian. Reversing the signs gives the same identity:
In particular, implies , so has zero kernel of a linear map. It is a square matrix, and the rank-nullity theorem therefore makes it invertible. The same argument proves invertibility of .
The proposed matrix
is consequently well-defined. For any , put . The two norm identities show directly that
To verify the unitary matrix identity explicitly, take adjoints:
The two shifts commute, because both are polynomials in . Hence
Thus
The imaginary shifts are invertible, and their equal norm changes cancel in the quotient. This is the Cayley transform of a Hermitian matrix in the convention.
A complex square matrix is a normal matrix if it commutes with its conjugate transpose:
By unitary diagonalization of a normal matrix, there are a unitary matrix and a diagonal matrix such that
The matrix 2-norm is invariant under multiplication by unitary matrices, so
For a diagonal matrix,
with equality on a coordinate vector belonging to an eigenvalue of greatest modulus. Hence
the matrix 2-norm of a normal matrix.
A matrix is non-normal when it does not commute with its adjoint matrix:
Nonorthogonal decaying eigenmodes can interfere constructively and produce transient growth. For example,
has two negative eigenvalues but is non-normal. Starting from gives
At , its squared Euclidean norm is . The energy grows transiently even though both eigenmodes eventually decay.