Solution
ID: past-exam-of-the-mathematics-course-of-the-year-2-of-the-natural-sciences-course-of-the-university-of-cambridge/2002/paper-1/4/solution
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2002 Paper 1 4 Solution by
Codex 0 Created 2026-10-18 Updated 2026-10-20
Nilpotence and eigenvalues. If with , then . Thus forces for every eigenvalue. Conversely, if all complex eigenvalues, counted with algebraic multiplicity, vanish, the monic characteristic polynomial is . The Cayley-Hamilton theorem then gives . HenceThis is the criterion for a nilpotent matrix.
Symmetric case. Here a symmetric matrix is understood to be real. The spectral theorem gives with orthogonal and real diagonal. The previous result makes every diagonal entry zero, so . Alternatively, choose , so . For every real vector ,It follows that . Repeat until . This uses positivity of the quadratic form . The restriction to real symmetric, or complex Hermitian matrices, matters: a complex matrix satisfying only need not have this positivity.
The parameters and powers. The first two columns of coincide, so for all . The sum of its principal two-by-two determinants, each a minor of a matrix, isTogether with , this givesFor every eigenvalue to vanish both remaining coefficients must be zero. ThereforeDirect multiplication at these values givesIndeed the first row of multiplied by is , and the second row is its negative.
Geometry of repeated application. For any parameters the image of a linear map lies in the span of and , since . Thus it lies in a fixed plane through the origin, independently of the input. When are independent its normal is ; if they coincide, the image is a line and is still contained in a plane.
New to topics? Read the docs here!