Normal matrix

Uses your system voice; voice and rate in settings.

Snapshot

≈ 6 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a complex square matrix is normal if it commutes with its conjugate transpose : : A \text{ normal} \iff A^*A = AA^* . The concept of normal matrices can be extended to normal operators on infinite-dimensional normed spaces and to normal elements in C*-algebras. As in the matrix case, normality means commutativity is preserved, to the extent possible, in the noncommutative setting. This makes normal operators, and normal elements of C*-algebras, more amenable to analysis. The spectral theorem states that a matrix is normal if and only if it is unitarily similar to a diagonal matrix; implying in particular that any matrix satisfying the equation is diagonalizable. (The converse does not hold because diagonalizable matrices may have non-orthogonal eigenspaces.) Thus A = U D U^* and A^* = U D^* U^* where D is a diagonal matrix whose diagonal values are in general complex and U is a unitary matrix. The left and right singular vectors in the singular value decomposition of a normal matrix A = U D V^* differ only in complex phase from each other and from the corresponding eigenvectors, since the phase must be factored out of the eigenvalues to form singular values.

In mathematics, a complex square matrix is normal if it commutes with its conjugate transpose : A \text{ normal} \iff A^*A = AA^* . The concept of normal matrices can be extended to normal operators on infinite-dimensional normed spaces and to normal elements in C*-algebras. As in the matrix case, normality means commutativity is preserved, to the extent possible, in the noncommutative setting. This makes normal operators, and normal elements of C*-algebras, more amenable to analysis. The spectral theorem states that a matrix is normal if and only if it is unitarily similar to a diagonal matrix; implying in particular that any matrix satisfying the equation is diagonalizable. (The converse does not hold because diagonalizable matrices may have non-orthogonal eigenspaces.) Thus A = U D U^* and A^* = U D^* U^* where D is a diagonal matrix whose diagonal values are in general complex and U is a unitary matrix. The left and right singular vectors in the singular value decomposition of a normal matrix A = U D V^* differ only in complex phase from each other and from the corresponding eigenvectors, since the phase must be factored out of the eigenvalues to form singular values.

Special cases

Among complex matrices, all unitary, Hermitian, and skew-Hermitian matrices are normal, with all eigenvalues being unit modulus, real, and imaginary, respectively. Likewise, among real matrices, all orthogonal, symmetric, and skew-symmetric matrices are normal, with all eigenvalues being complex conjugate pairs on the unit circle, real, and imaginary, respectively. However, it is not the case that all normal matrices are either unitary or (skew-)Hermitian, as their eigenvalues can be any complex number, in general. For example, A = \begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 1 \end{bmatrix} is neither unitary, Hermitian, nor skew-Hermitian, because its eigenvalues are 2, (1\pm i\sqrt{3})/2 ; yet it is normal because AA^* = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{bmatrix} = A^*A. \left\| A \mathbf{x} \right\| = \left\| A^* \mathbf{x} \right\| for every . The Frobenius norm of can be computed by the eigenvalues of : \operatorname{tr} \left(A^* A\right) = \sum_j \left| \lambda_j \right|^2 . The Hermitian part and skew-Hermitian part of commute. is a polynomial (of degree ) in . for some unitary matrix . and commute, where we have the polar decomposition with a unitary matrix and some positive semidefinite matrix . commutes with some normal matrix with distinct eigenvalues. for all where has singular values and has eigenvalues that are indexed with ordering . Some but not all of the above generalize to normal operators on infinite-dimensional Hilbert spaces. For example, a bounded operator satisfying (9) is only quasinormal.

Normal matrix analogy

It is occasionally useful (but sometimes misleading) to think of the relationships of special kinds of normal matrices as analogous to the relationships of the corresponding type of complex numbers of which their eigenvalues are composed. This is because any function (that can be expressed as a power series) of a non-defective matrix acts directly on each of its eigenvalues, and the conjugate transpose of its spectral decomposition VD V^* is VD^*V^* , where D is the diagonal matrix of eigenvalues. Likewise, if two normal matrices commute and are therefore simultaneously diagonalizable, any operation between these matrices also acts on each corresponding pair of eigenvalues. The conjugate transpose is analogous to the complex conjugate. Unitary matrices are analogous to complex numbers on the unit circle. Hermitian matrices are analogous to real numbers. Hermitian positive definite matrices are analogous to positive real numbers. Skew Hermitian matrices are analogous to purely imaginary numbers. Invertible matrices are analogous to non-zero complex numbers. The inverse of a matrix has each eigenvalue inverted. A uniform scaling matrix is analogous to a constant number. In particular, the zero matrix is analogous to 0, and the identity matrix is analogous to 1. An idempotent matrix is an orthogonal projection with each eigenvalue either 0 or 1. A normal involution has eigenvalues \pm 1 . As a special case, the complex numbers may be embedded in the normal 2×2 real matrices by the mapping a + bi \mapsto \begin{bmatrix} a & b \\ -b & a \end{bmatrix} = a\, \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} + b\, \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}\,. which preserves addition and multiplication. It is easy to check that this embedding respects all of the above analogies.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1361899654 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.