The Nicest Matrices in Mathematics
A symmetric matrix () is as good as it gets: all eigenvalues real, eigenvectors of distinct eigenvalues automatically orthogonal, and a full orthonormal eigenbasis always exists — with a rotation.
Geometrically: every symmetric matrix is a pure stretch along some perpendicular set of axes, no shearing, no rotation mixed in. This is the spectral theorem, and it is why symmetric matrices rule applied mathematics: covariance matrices, Hessians, stiffness matrices, and graph Laplacians are all symmetric by construction. For example has eigenvalues and with perpendicular eigenvectors and . It sends the unit circle to an ellipse whose axes point along those two directions, with half-lengths and .
A quadratic form (write with the symmetric matrix — Halve the cross term) is classified by eigenvalue signs: all positive — positive definite, a bowl with a genuine minimum; all negative — a dome; mixed — a saddle. On the unit circle, ranges exactly over , attained along the eigenvectors (the principal axes). The quick test without eigenvalues: positive definite iff and . Recognize this as the honest form of the second-derivative -test from multivariable calculus — the Hessian is a symmetric matrix, and is exactly the definiteness test.
Why eigenvalue signs decide: rotate coordinates to the orthonormal eigenbasis, . Because the are perpendicular unit vectors, the cross term disappears and . Two positive coefficients make a bowl, two negative a dome, and opposite signs a saddle whose level curves are hyperbolas. For , matrix , the eigenvalues are (along ) and (along ), so : indefinite.
The level curve of a positive-definite form is an ellipse whose axes point along the eigenvectors with half-lengths . Rotate to the eigenbasis and the cross term vanishes: . Every tilted ellipse you have ever completed the square on was a symmetric matrix asking to be diagonalized.
Find the largest and smallest values of on the unit circle , and where they occur.
Show the answerHide the answer
The matrix is (half the cross term off the diagonal). Trace , determinant , so . On the unit circle ranges over , attained along the eigenvectors. For : gives ; for : . So the maximum is at and the minimum is at . Check: ✓. This is exactly what Lagrange multipliers give: reads .
Classifying Quadratic Forms
For a symmetric and :
- positive definite ( for all ) all eigenvalues all leading principal minors ;
- positive semidefinite () all eigenvalues ;
- indefinite ( takes both signs) eigenvalues of both signs.
For : means indefinite, and means definite, with the sign of .
The eigenvalue test is the principal-axes formula . The determinant test follows because : a negative product means opposite signs, a positive one means equal signs, and then reveals which. The leading-minor test is the same fact seen through elimination: the pivots of are ratios of consecutive leading minors, and is a weighted sum of squares with the pivots as weights.
Classify . Halve the cross term: , with . So the eigenvalues have opposite signs and is indefinite.
The eigenvalues are (along ) and (along ): trace ✓, product ✓. Concrete witnesses: and . As a surface is a saddle, rising along and falling along ; the critical point at the origin is neither a maximum nor a minimum.
Classify . has , so one eigenvalue is ; the trace gives the other.
The eigenvalues are (along ) and (along ), both : positive semidefinite, not definite. Indeed is never negative but vanishes on the whole line , not just at the origin. Its level curves are pairs of parallel lines — a trough, not a bowl.
Is positive definite? Halving the cross terms, . The leading minors are , then .
The third minor is . All three leading minors are positive, so is positive definite — no cubic equation for eigenvalues needed. (The eigenvalues are and , all positive, with product ✓.)
For the correct matrix is , with determinant : positive definite. Putting the whole off the diagonal, , gives determinant and the false verdict "indefinite." The check is at : , while the wrong matrix gives — the cross term counted twice.
Classify and find its largest and smallest values on the unit circle.
Show the answerHide the answer
has trace and determinant with , so is positive definite. The eigenvalues solve . For : gives ; for : . So on the unit circle the maximum is at and the minimum is at . Check: ✓.
Principal Axes and Constrained Extremes
If is positive definite with eigenvalues and unit eigenvectors , the level curve is an ellipse with half-axes
On the circle , ranges from to . The larger eigenvalue gives the shorter axis.
In principal coordinates the curve is ; setting gives . A large eigenvalue means climbs fast in that direction, so the level is reached sooner — the ellipse is narrow there. Scaling by scales by , which moves the unit-circle extremes to any circle.
Describe the curve . has eigenvalues (along ) and (along ), both positive, so the curve is an ellipse: , that is, .
Half-axes: along and along . Check an endpoint: , and ✓; the other is , where ✓. So the points of the ellipse closest to the origin are , at distance , and the farthest are , at distance — no calculus needed.
Find the maximum and minimum of on the circle . On the unit circle runs from to ; on the circle of radius , every value is multiplied by .
So the maximum is , at , and the minimum is , at . Check the maximum: at , , so ✓. Lagrange multipliers would produce the same two directions after a page of algebra; the eigenvectors give them at once.
For it is tempting to read "half-axes and " straight from the eigenvalues. Test the claimed endpoint : there , not . The half-axis is — it depends on the level , shrinks as grows, and involves a square root.
Find the half-axes and their directions for the ellipse .
Show the answerHide the answer
: trace , determinant , so . For : gives ; for : . In principal coordinates , so the half-axes are along and along . Check: the endpoint has and , so ✓.
Proofs & Why It Matters
Let and with . Compute , using symmetry in the middle.
So , and since : . Significance: orthogonal eigenvectors mean the world decomposes into independent, non-interacting directions — normal modes of vibration, principal components of data, energy levels in quantum mechanics. The proof is three lines; the consequences fill physics departments.
Expand in the orthonormal eigenbasis: with on the unit circle. Then — a weighted average of the eigenvalues with weights .
An average lies between the extremes, hitting and when all weight sits on one eigenvector. This one-line argument (the Rayleigh quotient) is how Google-scale eigenvalue problems are actually solved: maximize the quotient numerically.
Going Deeper: Worked Problems
Identify the conic by diagonalizing its quadratic form.
Step 1 — the symmetric matrix is (half the cross term).
Step 2 — eigenvalues: trace , det : .
Step 3 — in the eigenbasis the equation becomes , i.e. : an ellipse with semi-axes and .
Step 4 — the axes' directions are the eigenvectors: for , gives — the long axis points along . Both eigenvalues positive confirmed the ellipse before any drawing; a negative one would have meant a hyperbola.
Classify the critical point of at .
Step 1 — confirm it is critical: and at ✓.
Step 2 — the Hessian is the constant symmetric matrix .
Step 3 — leading minors: and : positive definite, so the quadratic form near the point is a bowl and is a local (in fact global) minimum, with .
Step 4 — connect: the calculus ", " test is literally the leading-minor test for positive definiteness. Two courses, one criterion.