MathLabs
TheoremProved

Eckart–Young–Mirsky theorem

Statement

Let A∈Rm×nA \in \mathbb{R}^{m \times n} have singular values σ1≥σ2≥⋯≥σr>0\sigma_1 \ge \sigma_2 \ge \cdots \ge \sigma_r > 0, and for k<rk < r let Ak=∑i=1kσiuivi⊤A_k = \sum_{i=1}^k \sigma_i u_i v_i^\top keep only the top kk singular components. Then for every matrix BB with rank⁡(B)≤k\operatorname{rank}(B) \le k, ∥A−B∥2≥σk+1\|A - B\|_2 \ge \sigma_{k+1}, and this bound is attained: ∥A−Ak∥2=σk+1\|A - A_k\|_2 = \sigma_{k+1}. So AkA_k is a best rank-kk approximation of AA in the operator norm.

Why is it true?

The singular values measure how much AA stretches vectors along each orthogonal direction viv_i; keeping the largest ones and dropping the smallest throws away the directions AA stretches least. Any other rank-kk matrix BB must fail to reconstruct some direction among the top k+1k+1 singular directions (there are too many of them to fit in a kk-dimensional image), and that failure costs at least σk+1\sigma_{k+1}.

Proof sketch

Achievability. Since U,VU, V have orthonormal columns, ∥A−Ak∥2=∥U(Σ−Σk)V⊤∥2=∥Σ−Σk∥2\|A - A_k\|_2 = \|U(\Sigma - \Sigma_k)V^\top\|_2 = \|\Sigma - \Sigma_k\|_2, where Σk\Sigma_k keeps the top kk singular values and zeroes the rest. Σ−Σk\Sigma - \Sigma_k is diagonal with entries 0,…,0,σk+1,…,σr0, \dots, 0, \sigma_{k+1}, \dots, \sigma_r, so its operator norm is its largest entry, σk+1\sigma_{k+1}.

Optimality. Let BB be any matrix with rank⁡(B)≤k\operatorname{rank}(B) \le k; its null space (kernel) has dimension at least n−kn - k. Let S=span⁡(v1,…,vk+1)S = \operatorname{span}(v_1, \dots, v_{k+1}), a (k+1)(k+1)-dimensional subspace. Since dim⁡(ker⁡B)+dim⁡(S)≥(n−k)+(k+1)=n+1>n\dim(\ker B) + \dim(S) \ge (n-k) + (k+1) = n+1 > n, the two subspaces must intersect in more than just the origin: there exists a unit vector z∈Sz \in S with Bz=0Bz = 0.

Write z=∑i=1k+1civiz = \sum_{i=1}^{k+1} c_i v_i with ∑i=1k+1ci2=1\sum_{i=1}^{k+1} c_i^2 = 1 (since zz has unit norm and the viv_i are orthonormal). Because Bz=0Bz = 0, ∥(A−B)z∥=∥Az∥=∥∑i=1k+1ciσiui∥=∑i=1k+1ci2σi2\|(A-B)z\| = \|Az\| = \left\|\sum_{i=1}^{k+1} c_i \sigma_i u_i\right\| = \sqrt{\sum_{i=1}^{k+1} c_i^2 \sigma_i^2}, using orthonormality of the uiu_i.

Since σi≥σk+1\sigma_i \ge \sigma_{k+1} for every i≤k+1i \le k+1, ∑i=1k+1ci2σi2≥σk+12∑i=1k+1ci2=σk+12\sum_{i=1}^{k+1} c_i^2 \sigma_i^2 \ge \sigma_{k+1}^2 \sum_{i=1}^{k+1} c_i^2 = \sigma_{k+1}^2. Hence ∥A−B∥2≥∥(A−B)z∥≥σk+1\|A-B\|_2 \ge \|(A-B)z\| \ge \sigma_{k+1} for every rank-≤k\le k matrix BB, which together with achievability proves the theorem.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Ian Goodfellow, Yoshua Bengio, Aaron Courville (2016). Deep Learning
  2. Christopher M. Bishop (2006). Pattern Recognition and Machine Learning
  3. Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals (2017). Understanding deep learning requires rethinking generalization · arXiv:1611.03530
  4. Arthur Jacot, Franck Gabriel, Clément Hongler (2018). Neural Tangent Kernel: Convergence and Generalization in Neural Networks · arXiv:1806.07572
  5. Mikhail Belkin, Daniel Hsu, Siyuan Ma, Soumik Mandal (2019). Reconciling modern machine learning practice and the classical bias-variance trade-off · arXiv:1812.11118