Symmetric Matrices and Their Properties
What you'll learn: You'll discover what makes a matrix symmetric and why these matrices possess remarkably special properties that simplify many linear algebra problems.
What Is a Symmetric Matrix?
A matrix A is symmetric if it equals its own transpose: A = Aᵀ. In practice, this means the matrix is "mirrored" across its main diagonal—the entry in row i, column j equals the entry in row j, column i.
For example:
A = [2 1 3]
[1 4 0]
[3 0 5]
Notice how A[0,1] = A[1,0] = 1 and A[0,2] = A[2,0] = 3. The matrix looks the same if you "flip" it across the diagonal.
Why Symmetric Matrices Are Special
Symmetric matrices arise naturally in many applications—covariance matrices in statistics, moment of inertia tensors in physics, and adjacency matrices of undirected graphs all share this property. But what makes them truly remarkable are two fundamental theorems:
Property 1: All Eigenvalues Are Real
Unlike general matrices (which can have complex eigenvalues), every symmetric matrix with real entries has only real eigenvalues. This makes analysis much simpler and ensures physical interpretations remain meaningful.
Property 2: Orthogonal Eigenvectors
Even more powerful: eigenvectors corresponding to distinct eigenvalues are orthogonal to each other. This means you can always find an orthonormal basis of eigenvectors for a symmetric matrix—they naturally form a perpendicular coordinate system.
This property connects directly to the concepts you've learned: orthonormal bases make calculations clean, and it guarantees every symmetric matrix can be diagonalized using orthogonal matrices (something we'll explore further in spectral theory).
Key Takeaway: Symmetric matrices (A = Aᵀ) always have real eigenvalues and orthogonal eigenvectors, making them exceptionally well-behaved and ideal for theoretical analysis and practical computation.