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 ith row and jth column then for all indices i and j. Every square diagonal matrix is symmetric, since all off-diagonal elements are zero. Similarly in characteristic different from 2, 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.

Example

The following 3 \times 3 matrix is symmetric: Since.

Properties

Basic properties

Decomposition into symmetric and skew-symmetric

Any square matrix can uniquely be written as sum of a symmetric and a skew-symmetric matrix. This decomposition is known as the Toeplitz decomposition. Let denote the space of n \times n matrices. If denotes the space of n \times n symmetric matrices and the space of n \times n skew-symmetric matrices then and, i.e. where \oplus denotes the direct sum. Let then Notice that and. This is true for every square matrix X with entries from any field whose characteristic is different from 2. A symmetric n \times n matrix is determined by scalars (the number of entries on or above the main diagonal). Similarly, a skew-symmetric matrix is determined by scalars (the number of entries above the main diagonal).

Matrix congruent to a symmetric matrix

Any matrix congruent to a symmetric matrix is again symmetric: if X is a symmetric matrix, then so is for any matrix A.

Symmetry implies normality

A (real-valued) symmetric matrix is necessarily a normal matrix.

Real symmetric matrices

Denote by the standard inner product on. The real n \times n matrix A is symmetric if and only if Since this definition is independent of the choice of basis, symmetry is a property that depends only on the linear operator A and a choice of 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 in 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 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 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 real matrices corresponds to the property of being Hermitian for complex matrices.

Complex symmetric matrices

A complex symmetric matrix can be 'diagonalized' using a unitary matrix: thus if A is a complex symmetric matrix, there is a unitary matrix U such that is a real diagonal matrix with non-negative entries. This result is referred to as the Autonne–Takagi factorization. It was originally proved by Léon Autonne (1915) and Teiji Takagi (1925) and rediscovered with different proofs by several other mathematicians. In fact, the matrix is Hermitian and positive semi-definite, so there is a unitary matrix V such that is diagonal with non-negative real entries. Thus is complex symmetric with real. Writing C=X+iY with X and Y real symmetric matrices,. Thus XY=YX. Since X and Y commute, there is a real orthogonal matrix W such that both and are diagonal. Setting (a unitary matrix), the matrix is complex diagonal. Pre-multiplying U by a suitable diagonal unitary matrix (which preserves unitarity of U), the diagonal entries of can be made to be real and non-negative as desired. To construct this matrix, we express the diagonal matrix as. The matrix we seek is simply given by. Clearly as desired, so we make the modification U' = DU. Since their squares are the eigenvalues of, 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.)

Decomposition

Using the Jordan normal form, one can prove that every square real matrix can be written as a product of two real symmetric matrices, and every square complex matrix can be written as a product of two complex symmetric matrices. Every real non-singular matrix can be uniquely factored as the product of an orthogonal matrix and a symmetric positive definite matrix, which is called a polar decomposition. Singular matrices can also be factored, but not uniquely. Cholesky decomposition states that every real positive-definite symmetric matrix A is a product of a lower-triangular matrix L and its transpose, If the matrix is symmetric indefinite, it may be still decomposed as 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 where Q is an orthogonal matrix, 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 Since \lambda_1 and \lambda_2 are distinct, we have.

Hessian

Symmetric n \times n matrices of real functions appear as the Hessians of twice differentiable functions of n real variables (the continuity of the second derivative is not needed, despite common belief to the opposite ). Every quadratic form q on can be uniquely written in the form 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" with real numbers \lambda_i. This considerably simplifies the study of quadratic forms, as well as the study of the level sets 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.

Symmetrizable matrix

An n \times n matrix A is said to be symmetrizable if there exists an invertible diagonal matrix D and symmetric matrix S such that A = DS. The transpose of a symmetrizable matrix is symmetrizable, since and DSD is symmetric. A matrix A=(a_{ij}) is symmetrizable if and only if the following conditions are met: