Eckart-Young (1936) The Approximation of One Matrix by Another of Lower Rank

low-rank-approximationfactor-modelsingular-value-decompositiondimension-reductionleast-squarespsychometrics

Summary

Eckart and Young solve the problem of approximating a given matrix by another of lower rank in the least-squares sense — the mathematical core of factor theory, where an n×Nn\times N score matrix is postulated to be well approximated by a matrix of rank r<min(n,N)r<\min(n,N). They show the least-squares problem cannot be attacked by naive normal equations (the entries of the approximant are not free), but becomes simple once the matrices are written in a canonic form (the singular value decomposition): the optimal rank-rr approximation keeps the rr largest canonic components and discards the rest. A solution always exists and is usually unique.

Key Claims

Concepts Introduced or Extended

Entities Mentioned

Quotes

"It is a fundamental postulate of factor theory that the resulting n×Nn\times N score matrix … can be adequately approximated by another matrix … whose rank rr is less than the smaller of nn or NN."

My Take

One of those results that quietly underlies half of applied multivariate statistics. The Eckart-Young theorem is the reason principal components, factor models, and reduced-rank regressions all "work": truncating the SVD is not an ad-hoc heuristic but the provably optimal least-squares low-rank fit. For this wiki's concerns it is the mathematical bedrock beneath factor models and dynamic factor models, PCA-based diffusion-index forecasting, and reduced-rank structures like cointegration. The 1936 framing in the language of factor theory (rather than linear algebra) is a nice reminder that the SVD entered statistics through psychometrics; Johnson (1963) later supplied the general proof the theorem had been missing.