Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28
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.

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition

Statement

Let T:V→W be a linear map between finite-dimensional real or complex inner product spaces, and let r be the number of positive singular values of T. Then there exist orthonormal bases (e1,…,en) of V and (f1,…,fm) of W, together with singular values

s1≥⋯≥sr>0,

such that

Tv=∑j=1rsj⟨v,ej⟩fj

for every v∈V.

Facts & Assumptions

Given: A linear map T:V→W between finite-dimensional real or complex inner product spaces.

[L3]

Every finite-dimensional real or complex inner product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).

Proof

technique · direct
1.1L1L2algebra

By [L1] and [L2], the non-negative operator ∣T∣ on V has an orthonormal eigenbasis (e1,…,en) with ∣T∣ej=sjej and s1≥⋯≥sr>0=sr+1=⋯=sn. Because ∣T∣2=T∗T, one has ⟨T∗Tej,ej⟩=sj2 and therefore ∥Tej∥=sj.

2.1step 1.1algebra

For each j≤r, define fj:=sj−1Tej. Then ∥fj∥=1, and for i≠j one has ⟨fi,fj⟩=(sisj)−1⟨T∗Tei,ej⟩=(sisj)−1si2⟨ei,ej⟩=0. For j>r, step 1.1 gives ∥Tej∥=sj=0, so Tej=0.

3.1L3step 2.1algebra∎

The orthonormal set (f1,…,fr), which may be empty when r=0, extends to an orthonormal basis (f1,…,fm) of W by [L3]. If v=∑j=1n⟨v,ej⟩ej, then step 2.1 gives Tv=∑j=1n⟨v,ej⟩Tej=∑j=1rsj⟨v,ej⟩fj, and when r=0 this is the empty sum 0.

Depends on

Used by

Dependency tree · two levels

13 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