First divide each of the first two equations by two. ThenThe equal-component and opposite-component directions diagonalize the upper block, while the third coordinate is independent. Direct multiplication gives the eigenvalues and unit eigenvectorsThey form an orthonormal eigenbasis because is a real symmetric matrix.
A left eigenvector satisfies . Here is a symmetric matrix, so its left and right eigenspaces have the same components. The characteristic polynomial factors asThe eigenvalues and all corresponding nonzero row eigenvectors areFor example, in the block, equal components give the eigenvalue and opposite components give , while the coordinate is unaffected.
For any real square matrix , the symmetric and antisymmetric parts of a matrix give , whose summands are respectively a symmetric matrix and an antisymmetric matrix. Here it givesTransposing the first summand leaves it unchanged; transposing the second changes its sign. Entrywise addition recovers the original matrix. The decomposition is unique because a matrix that is both symmetric and antisymmetric must be zero.
The two orthogonal directions and are preserved by this symmetric matrix. Direct multiplication, using the hyperbolic function identities , gives the eigenvalue–eigenvector pairsEach eigenvector can be multiplied by any nonzero scalar. For these give the two one-dimensional eigenspaces. When , the matrix is the identity: the only eigenvalue is , with multiplicity two, and every nonzero vector is an eigenvector.
The first coordinate direction is already an eigenvector of with eigenvalue . On the last two coordinates, the matrix is , with characteristic polynomialThus the three eigenvalues are . For , the last two components are equal; for , they are opposite. Normalising by the Euclidean norm gives the complete listEach sign-reversed vector is an equally valid choice. The three displayed eigenvectors are mutually orthogonal, as expected for a real symmetric matrix with distinct eigenvalues.
The symmetric and antisymmetric parts of a matrix areIndeed , while the transpose identities give and . Thus is a symmetric matrix and is an antisymmetric matrix. The decomposition is also unique: a matrix that is both symmetric and antisymmetric must equal its own negative and hence vanish.
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2001 Paper 2 6 Solution Created 2026-10-18 Updated 2026-10-20
Tensor transformation. Under an orthogonal transformation , the magnetic moment and magnetic field intensity have transformed components , for a proper rotation. The physical relation must retain its form, giving , henceThis is precisely the law for a Cartesian second-rank tensor. Both magnetic quantities are axial vectors; under reflections they each acquire the same determinant sign, which cancels from the transformation of the magnetic susceptibility tensor.
Parallel directions. The condition is the eigenvalue equation . For the matrix in the paper, expansion of givesSolving the three resulting homogeneous systems givesThe three directions are mutually orthogonal. For the zero eigenvalue, the induced magnetic moment is zero: the proportionality equation still holds with factor zero, though there is then no nonzero moment direction to assign.
Energy extrema. The stipulated energy is . At fixed , a Lagrange multiplier calculation givesbecause is a real symmetric matrix. Thus all stationary directions are the eigenvectors, for which . Equivalently write ; thenThe Rayleigh quotient immediately givesThe intermediate direction is stationary with but is not an extremum on the sphere. At the minimum , so the precise extremum condition is proportionality, including a vanishing proportionality factor.
Constant-energy surface. In the original field components,For a fixed positive value , is unrestricted and the cross-section satisfies . The surface is therefore an elliptic cylinder, with axis along and transverse semiaxes along and along . This is an example of level sets of a positive semidefinite quadratic form. At the surface degenerates to the axis line; no negative-energy level exists.
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 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.
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2003 Paper 1 4 Solution Created 2026-10-18 Updated 2026-10-20
The spectral theorem gives a real orthonormal eigenbasis for a real symmetric matrix . Distinct eigenspaces are orthogonal; within a repeated eigenspace, choose an orthonormal basis, for example by Gram-Schmidt orthogonalization. Put these eigenvectors in the columns of . Then andFor a change of variables , choose . Since , the quadratic form becomes ; the are precisely the eigenvalues of .
In the numerical case, the off-diagonal entries are half the cross-term coefficients, soA direct eigenvector calculation gives the unit eigenvectors , , , with eigenvalues two, three and minus six. They are pairwise orthogonal. Therefore the required orthogonal diagonalization isand the transformed quadratic form is .
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2003 Paper 1 5 a Solution Created 2026-10-18 Updated 2026-10-20
Since and are real symmetric matrices, . Expanding the unitarity condition givesEquality of the entrywise real and imaginary parts yieldsThese are the identities for the real and imaginary parts of a symmetric unitary matrix.
Since is real, . For every real vector ,Thus is a real symmetric matrix and is negative semidefinite. When is odd, part (i) supplies a nonzero in the kernel of , and then . Hence zero is an eigenvalue of . In fact , as the displayed norm identity shows.
The spectral theorem for a real symmetric matrix gives real eigenvalues and an orthonormal eigenbasis. Compute the roots of , find a basis for each eigenspace, and orthonormalize within any repeated-eigenvalue eigenspace. Eigenvectors belonging to distinct eigenvalues are already orthogonal: if and , symmetry gives .
Putting the normalized basis vectors in the columns of an orthogonal matrix yieldsFor repeated eigenvalues, the choice of axes inside their eigenspace is not unique.
Since , a representation satisfies . Orthogonality gives , while the involution relation gives . Hence is a symmetric matrix, so .
Its entries obeyIf , then ; putting and gives a reflection. If , the diagonal entries are independently : the opposite-sign cases are already included among these reflections, while equal signs give or . Faithfulness excludes , since . Therefore the orthogonal involutions of the plane giveThe first is rotation by . The second is reflection in the line making angle with the first axis: the unit vector along that line is fixed, and its perpendicular is negated. These are all the nonidentity orthogonal transformations of order two in the plane.
The block has characteristic polynomial . A convenient orthonormal eigenbasis for the full real symmetric matrix iswith eigenvalues , , and , respectively. Hence its orthogonal diagonalization isFor repeated eigenvalues, every nonzero combination within the corresponding eigenspace is also an eigenvector; the displayed basis remains valid. Introduce principal axes coordinatesThe quadratic form becomesThe principal-axis reduction of a quadric therefore has three regimes.
For , all coefficients are positive: the surface is an ellipsoid centred at the origin, withFor , the term disappears. The surface is an elliptic cylinder, unbounded along , whose cross-section is :For , there is one negative coefficient, so the surface is a one-sheet hyperboloid:Its waist at is an ellipse with semiaxes and . At other , both waist radii are multiplied by . There is no intercept on its longitudinal axis. Its asymptotic cone is . If positive eigenvalues coincide, the corresponding choice of principal axes is not unique, reflecting a rotational symmetry of the surface.
Every row sums to six, so is an eigenvector with eigenvalue six. Since is a real symmetric matrix, its other two eigenvalues, say , are real. The trace givesAlso, for a real symmetric matrix, is the sum of the squares of all its entries. HereThus . Together with their zero sum, this implies
The entries of are real, and the transpose rule gives . Thus it is a real symmetric matrix, hence also a Hermitian matrix.
For any complex vector ,In particular, if with ,Thus is positive semidefinite. Its zero eigenspace is precisely the kernel of , since is equivalent to . This is the Gram-matrix structure behind the nonnegative eigenvalues.
A real symmetric matrix has a real orthonormal eigenbasis. Put those eigenvectors into an orthogonal matrix , so . With the change of coordinates , or ,Thus the coefficients are the eigenvalues and the new coordinate directions are the eigenvectors. This orthogonal diagonalization preserves Euclidean lengths and angles while removing cross terms from the quadratic form.
A real matrix is a Hermitian matrix exactly when it is a symmetric matrix. Since is orthogonal, this is equivalent to , or . A generic rotation does not satisfy this; for example , gives a nonsymmetric quarter-turn. Thus
The exceptions are the identity and half-turns, as characterized by real rotation matrices that are Hermitian. For this product, a half-turn occurs when either or is an odd multiple of ; the identity occurs when both are even multiples. For example, the half-turn condition follows from .
For the two sine modes, orthogonality givesThe diagonal potential integrals vanish, while the mixed one isThus , giving the two-sine variational bound for a Dirichlet Mathieu equation:Its derivative vanishes when . Hence the two stationary parameters are . To identify the minimum, use the normalized sine basis: the restricted self-adjoint operator has real symmetric matrixIts smaller eigenvalue is the minimum of the Rayleigh quotient, attained at the negative stationary parameter. ThereforeThe estimate improves on the single-sine value . The Rayleigh-Ritz variational principle remains valid here even though changes sign: on this finite interval the Sturm-Liouville operator is self-adjoint and bounded below, which is sufficient for the upper bound.
Since , , so is a real symmetric matrix. Moreover,proving that it is a negative semidefinite matrix.
For odd , determinant invariance under transpose givesso . Hence and have a zero eigenvalue. Finally, if , then , so . Thuswhere equality of these kernels includes the reverse implication, which is immediate.

