TOPICS
Search

Real Symmetric Matrix


A real symmetric matrix is a real matrix that is also a symmetric matrix. Thus its entries are real numbers and it satisfies

 A^T=A,

where A^T denotes the transpose. Every real symmetric matrix is a Hermitian matrix, since its conjugate transpose equals its transpose.

By the spectral theorem, a real symmetric matrix has only real eigenvalues and an orthonormal basis of eigenvectors. Equivalently, it has a decomposition

 A=QDQ^T,

where Q is a real orthogonal matrix and D is a real diagonal matrix containing the eigenvalues. The columns of Q are the corresponding eigenvectors (Olver 2010, pp. 13-14).

The real-entry condition matters. A complex symmetric matrix need not have real eigenvalues or be a Hermitian matrix. For example, iI is symmetric but has eigenvalue i, where i is the imaginary unit and I is the identity matrix.


See also

Companion Matrix, Harris Matrix, Hermitian Matrix, Orthogonal Matrix, Real Matrix, Real-Rooted Polynomial, Spectral Theorem, Symmetric Matrix

Explore with Wolfram|Alpha

References

Nash, J. C. "Real Symmetric Matrices." Ch. 10 in Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, 2nd ed. Bristol, England: Adam Hilger, pp. 119-134, 1990.Olver, P. J. "Orthogonal Bases and the QR Algorithm." University of Minnesota, pp. 13-14, June 5, 2010. https://math.mit.edu/classes/18.085/summer2016/handouts/qr.pdf.

Cite this as:

Weisstein, Eric W. "Real Symmetric Matrix." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/RealSymmetricMatrix.html

Subject classifications