Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 1 41D b ii Solution Created 2026-09-24 Updated 2026-10-03
The first row of the tridiagonal eigenvalue equation isIn the generic case , the two dominant coefficient vectors are independent, sinceHere , since otherwise the displayed eigenvalue equation and the nonzero would force all eigenvalues to equal . The strict spectral gap below the dominant pair now impliesThis is two-dimensional subspace iteration. If the dominant eigenvalue is repeated, acts as a scalar on ; the same QR argument either captures all of or separates its missing direction from the strictly smaller eigenspaces, and the conclusion below is unchanged.
Power iteration failure cases 2026-10-14
A tied largest modulus can prevent even direction convergence. With and ,The two directions form a cycle; neither is an eigenvector. There is no dominant-modulus spectral gap. A tied modulus is not a universal failure: an initial eigenvector remains on its line, and preserves every direction. Subspace iteration addresses a separated cluster by targeting a dominant invariant subspace instead of one eigenvector.
An orthogonal start can fail despite a strict spectral gap. For and , the dominant component is zero, so and every iterate equals . The Rayleigh quotient is exactly and the eigenpair residual is zero, although the dominant eigenvalue is . Exact arithmetic never creates a missing component.[ref]
The third panel contrasts these failures with , , for whichHere the horizontal eigenvector direction converges with a strict spectral gap, while the normalized vectors alternate signs. This is the successful direction convergence described under sign and phase in power iteration.
For a nonorthogonal eigenbasis, even the word “orthogonal” must be used carefully. The diagonalizable matrix has right eigenvectors , , and dominant left eigenvector . For , the dominant coefficient is . The starting vector is nonorthogonal to but stays at the smaller eigenvalue ; is orthogonal to but has and converges to the dominant direction. The left eigenvector test, not the right-eigenvector inner product, controls the outcome.
A random vector drawn from a continuous probability distribution with a probability density function on the full real or complex vector space has with probability one. This avoids the exact missing-component hyperplane, but does not guarantee a large component or fast convergence. Floating-point arithmetic may seed a missing component, yet a structurally preserved zero can remain zero, so accidental perturbations are not a convergence guarantee.
Two-column dominant-subspace condition Created 2026-09-24 Updated 2026-09-24
Let a real symmetric matrix have an orthonormal eigenbasis , withWrite two starting vectors asFor two-column subspace iteration to recover
, the two projections onto that dominant subspace must be independent. The exact condition isRequiring each of the four coefficients to be nonzero does not imply this determinant condition.
, the two projections onto that dominant subspace must be independent. The exact condition isRequiring each of the four coefficients to be nonzero does not imply this determinant condition.
