Past exam of the mathematics course of the University of Cambridge 2014 ia Paper 1 6A i Solution Created 2026-09-24 Updated 2026-10-06
View a possible complex eigenvector using the Hermitian inner product. For a real symmetric matrix, , so is real. Since and , every eigenvalue is real.
For eigenvectors with distinct eigenvalues , symmetry givesso . In particular, real eigenvectors are orthogonal in the real dot product.
Use the permitted diagonalizability assumption to take bases of the real eigenspaces whose union spans . Apply the Gram-Schmidt process within each eigenspace. Its linear combinations remain eigenvectors of that same eigenvalue; vectors in different eigenspaces are already orthogonal. The resulting union is an orthonormal basis of eigenvectors, giving an orthogonal diagonalization of a real symmetric matrix.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 66 4 a Solution Created 2026-10-03 Updated 2026-10-06
By orthogonal diagonalization of a real symmetric matrix, write , with orthogonal . Its matrix exponential has the same eigenvectors and positive eigenvalues . Orthogonal invariance of the induced Euclidean norm gives the exact identityThis proves the requested inequality with equality. If a real number gave the bound for every , evaluating on a unit eigenvector for at any would give , so . Thus the stated exponent is the smallest possible. For a symmetric matrix the spectral abscissa and Euclidean logarithmic norm coincide, unlike the general nonsymmetric case in Question 1.
The quadratic form isThe symmetric matrix has eigenvalues , with respective orthogonal eigenvectors . Normalize them to obtain the orthonormal basisThe given change of basis meansSubstitution, or orthogonal diagonalization of a real symmetric matrix, givesThus the semi-major and semi-minor axes have lengths and . The eccentricity and enclosed area areThe orthogonal change of basis preserves area, so this is also the area in the original Cartesian coordinates.
Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge 2006 Paper 1 2 a i Solution Created 2026-10-18 Updated 2026-10-20
The characteristic polynomial is . Solving the three eigenvector equations givesEach eigenspace consists of the scalar multiples of its displayed nonzero vector. Their pairwise dot products vanish: and . This also agrees with the orthogonal diagonalization of a real symmetric matrix.
The characteristic polynomial isThus the eigenvalues are 1 and 11. Corresponding eigenvectors are and . Their dot product is zero and each has Euclidean norm . Normalizing givesThe columns are orthonormal, so . The eigenvector equations give and hence , proving the claimed orthogonal diagonalization of a real symmetric matrix.