Past exam of the mathematics course of the University of Cambridge 2022 ia Paper 1 7B d Solution Created 2026-09-24 Updated 2026-10-03
Put . This is a nonzero Hermitian matrix. By the finite-dimensional spectral theorem, it has a unit eigenvector with a nonzero real eigenvalue . Define the rank-one orthogonal projection matrixThe cyclic property of the matrix trace givesHence this distinguishes and through the required traces.
Sign rounding bound for a unit eigenvector 2026-10-06
Suppose encodes the true partition and is a unit estimated eigenvector. Every coordinate of the wrong sign contributes at least to . Since this is at most , which is the squared Frobenius distance between the rank-one orthogonal projection matrices, the bound follows. Coordinates estimated as zero may be assigned consistently to either group.
Sum of squares in ANOVA 2026-10-07
For an orthogonal projection matrix , a sum of squares in ANOVA is . Mutually orthogonal projections yield an additive decomposition of total squared response magnitude. Removing the grand mean gives the corrected total.
Unbiased Gaussian projection risk estimate 2026-10-06
For and a fixed orthogonal projection matrix of rank , the displayed expression is an unbiased estimator of the mean-vector prediction risk whenever is an unbiased estimator of . Independence of its two terms is unnecessary. Comparing fixed models yields the Mallows Cp penalty, but minimizing unbiased estimates does not preserve unbiasedness after selection.
For a normal distribution with unrestricted and unknown , an integrable data-only unbiased estimator of the mean-vector prediction risk of a fixed rank- orthogonal projection matrix exists exactly when . To prove necessity, randomize the mean by independent Gaussian variance : conditioning adds to the squared bias term, whereas the marginal variance identity would add . When , the residual sum of squares itself is unbiased.