Symmetric Matrices
A square matrix is symmetric when it equals its own transpose: . Entry-by-entry, this means — the matrix is a mirror image across its main diagonal. Familiar examples include the identity matrix and any diagonal matrix.
The key insight: every quadratic function has a unique symmetric matrix representation. Given any matrix , you can replace it with without changing the quadratic form at all. This works because for a scalar , we have , so you can average the two representations.
The symmetric version has off-diagonal entry equal to the average of the original and . For example, the non-symmetric matrix defines the same quadratic as . From now on, we always work with symmetric matrices for quadratic forms.
Formal View
Without loss of generality, the matrix of a quadratic form is always assumed to be symmetric.
Interactive Visualization
Transpose Visualizer
Why This Matters
Symmetric matrices arise naturally whenever a relationship between two things is mutual — covariance, stiffness, and Hessians are all symmetric.
- Covariance matrices in statistics: .
- Stiffness matrices in structural engineering: force-displacement relationships are mutual.
- Hessian matrices of second derivatives are symmetric by Clairaut's theorem.
Quiz
Every diagonal matrix is symmetric.
What is the symmetric matrix associated with the quadratic form defined by ?
Common Mistakes
- Thinking symmetry is just about the diagonal entries — it is about all off-diagonal pairs: .
- Forgetting to symmetrize before computing eigenvalues — technically works for any , but spectral theorem requires to be symmetric.