Symmetric matrix

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 8 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 linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, Because equal matrices have equal dimensions, only square matrices can be symmetric. The entries of a symmetric matrix are symmetric with respect to the main diagonal.

So if a_{ij} denotes the entry in the i th row and j th column then Every square diagonal matrix is symmetric, since all off-diagonal elements are zero. Similarly in characteristic different from , each diagonal element of a skew-symmetric matrix must be zero, since each is its own negative.

In linear algebra, a real symmetric matrix represents a self-adjoint operator represented in an orthonormal basis over a real inner product space. The corresponding object for a complex inner product space is a Hermitian matrix with complex-valued entries, which is equal to its conjugate transpose.

Therefore, in linear algebra over the complex numbers, it is often assumed that a symmetric matrix refers to one which has real-valued entries. Symmetric matrices appear naturally in a variety of applications, and typical numerical linear algebra software makes special accommodations for them.

A = \begin{bmatrix} 1 & 7 & 3 \\ 7 & 4 & 5 \\ 3 & 5 & 2 \end{bmatrix}; indeed, A = A^\textsf{T} . This is not always true for the product: given symmetric matrices A and B , the product AB is symmetric if and only if A and B commute, i.e., AB = BA . If A is symmetric, then for any integer k \geq 0 , \, A^k is also symmetric.

If A^{-1} exists, it is symmetric if and only if A is symmetric. The rank of a symmetric matrix A is equal to the number of non-zero eigenvalues of A . \mbox{Mat}_n = \mbox{Sym}_n + \mbox{Skew}_n \qquad \mbox{and} \qquad \mbox{Sym}_n \cap \mbox{Skew}_n = \{0\}, i.e. \mbox{Mat}_n = \mbox{Sym}_n \oplus \mbox{Skew}_n, where \oplus denotes the direct sum.

Let M \in \mbox{Mat}_n , then M = \frac{1}{2}\left(M + M^\mathsf{T}\right) + \frac{1}{2}\left(M - M^\mathsf{T}\right). Notice that \frac{1}{2}\left(M + M^\mathsf{T}\right) \in \mbox{Sym}_n and \frac{1}{2} \left(M - M^\mathsf{T}\right) \in \mathrm{Skew}_n . This is true for every square matrix M with entries from any field whose characteristic is different from .

A symmetric n \times n matrix is determined by \tfrac{1}{2}n(n+1) scalars (the number of entries on or above the main diagonal). Similarly, a skew-symmetric matrix is determined by \tfrac{1}{2}n(n-1) scalars (the number of entries above the main diagonal). \langle Ax, y \rangle = \langle x, Ay \rangle \quad \forall x, y \in \R^n. Since this definition is independent of the choice of basis, symmetry is a property that depends only on the linear operator A and the choice of an inner product.

This characterization of symmetry is useful, for example, in differential geometry, for each tangent space to a manifold may be endowed with an inner product, giving rise to what is called a Riemannian manifold. Another area where this formulation is used is that of Hilbert spaces.

The finite-dimensional spectral theorem says that any symmetric matrix whose entries are real can be diagonalized by an orthogonal matrix. More explicitly: For every real symmetric matrix A , there exists a real orthogonal matrix Q such that D = Q^{\mathsf T} A Q is a diagonal matrix. Every real symmetric matrix is thus, up to choice of an orthonormal basis, a diagonal matrix.

If A and B are n \times n real symmetric matrices that commute, then they can be simultaneously diagonalized by an orthogonal matrix: there exists a basis of \R^n such that every element of the basis is an eigenvector for both A and B . Every real symmetric matrix is Hermitian, and therefore all its eigenvalues are real. (In fact, the eigenvalues are the entries in the diagonal matrix D (above), and therefore D is uniquely determined by A up to the order of its entries.)

Essentially, the property of being symmetric for a real matrix corresponds to the property of being Hermitian for a complex matrix. In fact, the matrix B=A^{\dagger} A is Hermitian and positive semi-definite, so there is a unitary matrix V such that V^{\dagger} B V is diagonal with non-negative real entries. Thus C=V^{\mathsf T} A V is complex symmetric with C^{\dagger}C real.

Writing C=X+iY with X and Y real symmetric matrices, C^{\dagger}C=X^2+Y^2+i(XY-YX) . Thus XY=YX . Since X and Y commute, there is a real orthogonal matrix W such that both W X W^{\mathsf T} and W Y W^{\mathsf T} are diagonal.

Setting U=W V^{\mathsf T} (a unitary matrix), the matrix UAU^{\mathsf T} is complex diagonal. Pre-multiplying U by a suitable diagonal unitary matrix (which preserves unitarity of U ), the diagonal entries of UAU^{\mathsf T} can be made to be real and non-negative as desired.

To construct this matrix, we express the diagonal matrix as UAU^\mathsf{T} = \operatorname{diag}(r_1 e^{i\theta_1}, r_2 e^{i\theta_2}, \dots, r_n e^{i\theta_n}) . The matrix we seek is simply given by D = \operatorname{diag}(e^{-i{\theta_1}/2}, e^{-i{\theta_2}/2}, \dots, e^{-i{\theta_n}/2}) .

Clearly DUAU^\mathsf{T}D = \operatorname{diag}(r_1, r_2, \dots, r_n) as desired, so we make the modification U' = DU . Since their squares are the eigenvalues of A^{\dagger} A , they coincide with the singular values of A . (Note, about the eigen-decomposition of a complex symmetric matrix A , the Jordan normal form of A may not be diagonal, therefore A may not be diagonalized by any similarity transformation.)

A = LL^\mathsf{T}. If the matrix is symmetric indefinite, it may be still decomposed as PAP^\mathsf{T} = LDL^\mathsf{T} where P is a permutation matrix (arising from the need to pivot), L a lower unit triangular matrix, and D is a direct sum of symmetric 1 \times 1 and 2 \times 2 blocks, which is called Bunch–Kaufman decomposition A general (complex) symmetric matrix may be defective and thus not be diagonalizable.

If A is diagonalizable it may be decomposed as A = Q \Lambda Q^\mathsf{T} where Q is an orthogonal matrix Q Q^\mathsf{T} = I , and \Lambda is a diagonal matrix of the eigenvalues of A . In the special case that A is real symmetric, then Q and \Lambda are also real. To see orthogonality, suppose \mathbf x and \mathbf y are eigenvectors corresponding to distinct eigenvalues \lambda_1 , \lambda_2 .

Then \lambda_1 \langle \mathbf x, \mathbf y \rangle = \langle A \mathbf x, \mathbf y \rangle = \langle \mathbf x, A \mathbf y \rangle = \lambda_2 \langle \mathbf x, \mathbf y \rangle. Since \lambda_1 and \lambda_2 are distinct, we have \langle \mathbf x, \mathbf y \rangle = 0 .

Every quadratic form q on \mathbb{R}^n can be uniquely written in the form q(\mathbf{x}) = \mathbf{x}^\mathsf{T} A \mathbf{x} with a symmetric n \times n matrix A . Because of the above spectral theorem, one can then say that every quadratic form, up to the choice of an orthonormal basis of \R^n , "looks like" q\left(x_1, \ldots, x_n\right) = \sum_{i=1}^n \lambda_i x_i^2 with real numbers \lambda_i . This considerably simplifies the study of quadratic forms, as well as the study of the level sets \left\{ \mathbf{x} : q(\mathbf{x}) = 1 \right\} which are generalizations of conic sections. This is important partly because the second-order behavior of every smooth multi-variable function is described by the quadratic form belonging to the function's Hessian; this is a consequence of Taylor's theorem.

An n \times n matrix A is said to be symmetrizable if there exist an invertible diagonal matrix D and symmetric matrix S such that A = DS. The transpose of a symmetrizable matrix is symmetrizable, since A^{\mathsf T}=(DS)^{\mathsf T}=SD=D^{-1}(DSD) and DSD is symmetric.

A matrix A=(a_{ij}) is symmetrizable if and only if the following conditions are satisfied: a_{ij} = 0 implies a_{ji} = 0 for all 1 \le i \le j \le n. a_{i_1 i_2} a_{i_2 i_3} \dots a_{i_k i_1} = a_{i_2 i_1} a_{i_3 i_2} \dots a_{i_1 i_k} for any finite sequence \left(i_1, i_2, \dots, i_k\right).

Text derived from https://en.wikipedia.org/w/index.php?oldid=1368618639 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.