How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Truncated singular values give the best Frobenius rank-k approximation
Statement
Let have singular values , padded by zeros to . For an integer let be the truncation to the first singular terms of an SVD of . Then , and for every matrix with ,
Facts & Assumptions
Given: The finite real matrix and integer in the Statement.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: the full SVD supplies orthonormal bases of and of , with and for zero singular values; in particular, the right singular vectors for positive singular values are orthogonal to and can be completed within .
The Frobenius norm on real or complex matrices: the Frobenius norm is the Euclidean norm of the full entry list.
The orthogonal projection is the -component in : every finite-dimensional subspace has an orthogonal projection onto it.
Proof
By [F1], write for its positive singular values, and set . Its image lies in the span of at most left singular vectors, so its rank is at most . The residual is the sum of the positive singular terms with index greater than ; padding the singular-value list by zeros, [F2]–[F3] give .
Let be the orthogonal projection onto the row space of , which exists by [F4]. Its rank is at most , every row of lies in , and hence . Rowwise, , where the first summand has each row in and the second has each row in . These subspaces are orthogonal, so summing the rowwise Pythagorean identities gives .
Let be the right singular vectors for the positive singular values, and complete them to an orthonormal basis of using vectors in ; set for . The SVD gives , so orthonormality of and [F2] give , where . If is an orthonormal basis of , then Parseval in the basis gives . For , every . For , put and use for and for to obtain Thus in either case.
Substitute the bound from step 1.3 into step 1.2 and use from [F3]. This gives , proving the claim.
Depends on
- The Frobenius norm $\lVert A\rVert_F=(\sum_{i,j}|a_{ij}|^2)^{1/2}$ on real or complex matrices
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Spectral and Frobenius norms are unitarily invariant, are given by singular values, and satisfy the sharp rank comparison
Used by
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.