Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 A∈Rm×n have singular values σ1≥σ2≥⋯≥0, padded by zeros to min⁡(m,n). For an integer 0≤k≤min⁡(m,n) let Ak be the truncation to the first k singular terms of an SVD of A. Then rank⁡(Ak)≤k, and for every matrix B with rank⁡(B)≤k, ∥A−Ak∥F2=∑j>kσj2≤∥A−B∥F2.

Facts & Assumptions

Given: The finite real matrix and integer k in the Statement.

[F1]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: the full SVD supplies orthonormal bases v1,…,vn of Rn and u1,…,um of Rm, with Avj=σjuj and Avj=0 for zero singular values; in particular, the right singular vectors for positive singular values are orthogonal to ker⁡A and can be completed within ker⁡A.

[F4]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: every finite-dimensional subspace has an orthogonal projection onto it.

Proof

1.1givenF1F2F3algebra

By [F1], write A=∑j=1rσjujvjT for its r positive singular values, and set Ak=∑j=1min⁡(k,r)σjujvjT. Its image lies in the span of at most k left singular vectors, so its rank is at most k. The residual is the sum of the positive singular terms with index greater than k; padding the singular-value list by zeros, [F2]–[F3] give ∥A−Ak∥F2=∑j>kσj2.

1.2givenF2F4algebra

Let P be the orthogonal projection onto the row space of B, which exists by [F4]. Its rank is at most k, every row of B lies in ran⁡P, and hence B=BP. Rowwise, A−B=A(I−P)+(AP−B), where the first summand has each row in ran⁡(I−P) and the second has each row in ran⁡P. These subspaces are orthogonal, so summing the rowwise Pythagorean identities gives ∥A−B∥F2≥∥A(I−P)∥F2=∥A∥F2−∥AP∥F2.

1.3givenF1F2algebra

Let v1,…,vr be the right singular vectors for the positive singular values, and complete them to an orthonormal basis v1,…,vn of Rn using vectors in ker⁡A; set σj=0 for j>r. The SVD gives AP=∑j=1rσjuj(Pvj)T, so orthonormality of u1,…,ur and [F2] give ∥AP∥F2=∑j=1nσj2bj, where bj=∥Pvj∥22∈[0,1]. If w1,…,ws is an orthonormal basis of ran⁡P, then Parseval in the basis v1,…,vn gives ∑jbj=∑ℓ=1s∑j∣⟨vj,wℓ⟩∣2=s=rank⁡P≤k. For k=0, every bj=0. For k≥1, put λj=σj2 and use λj≥λk for j≤k and λj≤λk for j>k to obtain ∑j=1kλj−∑j=1nλjbj=∑j=1kλj(1−bj)−∑j=k+1nλjbj≥λk(k−∑j=1nbj)≥0. Thus ∥AP∥F2≤∑j≤kσj2 in either case.

2.1step 1.2step 1.3F3algebra∎

Substitute the bound from step 1.3 into step 1.2 and use ∥A∥F2=∑jσj2 from [F3]. This gives ∥A−B∥F2≥∑j>kσj2=∥A−Ak∥F2, proving the claim.

Depends on

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.

Sources