Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Singular value decomposition for compact operators

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H and K be real or complex Hilbert spaces (Hilbert space), let T∈B(H,K) be a compact operator (Compact linear operator), let ∣T∣ and the singular values sn(T) be as in the absolute-value definition (Absolute value and singular values of a compact operator). Let J={1,2,3,…} when ran⁡T is infinite-dimensional. When ran⁡T is finite-dimensional, put r:=dim⁡ran⁡T∈N (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) and let J={1,…,r}, interpreted as ∅ when r=0. Thus J indexes exactly the positive singular values counted with multiplicity, which we write as (sj)j∈J in nonincreasing order. Then:

  1. there are orthonormal families (ej)j∈J in (ker⁡T)⊥ and (fj)j∈J in ran⁡T‾, indexed by exactly J, with ∣T∣ej=sjej and fj=sj−1Tej for every j∈J;
  2. for every x∈H the series converges in norm and Tx=∑j∈Jsj⟨x,ej⟩fj, and its finite partial sums Tn:=∑j≤nsj⟨⋅,ej⟩fj satisfy ∥T−Tn∥≤sn+1 for every n with n+1∈J (and Tn=T for n≥r when r<+∞);
  3. the linear map U defined on the span of {ej:j∈J} by Uej:=fj, extended by continuity to (ker⁡T)⊥ and by zero on ker⁡T, is a partial isometry with T=U∣T∣,U∗U=P(ker⁡T)⊥,U∗U is the orthogonal projection onto (ker⁡T)⊥, and UU∗ the orthogonal projection onto ran⁡T‾;
  4. the zero-padded sequence (sn(T))n≥1 is not used to index the orthonormal systems: the systems carry exactly the index set J of the positive singular values, and the terms sn(T)=0 beyond the rank in the finite-rank case are numerical padding only.

Facts & Assumptions

Given: Countable Choice, compact T:H→K, its absolute value ∣T∣, the index set J of the positive singular values with multiplicity, the finite dimension r=dim⁡ran⁡T when the range is finite-dimensional, and the zero-padded sequence (sn(T)).

[A1]

Absolute value and finite rank. ∣T∣ is compact, self-adjoint and positive with ∣T∣2=T∗T, ∥∣T∣x∥=∥Tx∥ and ker⁡∣T∣=ker⁡T; the positive singular values with multiplicity are the positive eigenvalues of ∣T∣ with multiplicity. They are finite in number exactly when ran⁡T is finite-dimensional, and otherwise form a countably infinite list. In the finite-dimensional case the isometric linear bijection Φ:ran⁡∣T∣→ran⁡T, Φ(∣T∣x)=Tx, gives dim⁡ran⁡∣T∣=dim⁡ran⁡T=r (Absolute value and singular values of a compact operator, Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis). No value dim⁡V=∞ is used.

[A2]

Spectral theorem for ∣T∣. The nonzero eigenvalues of ∣T∣ are positive, have finite-dimensional eigenspaces Eλ, are mutually orthogonal across distinct λ, and their closed span is (ker⁡∣T∣)⊥=ran⁡∣T∣‾; moreover ker⁡∣T∣=ker⁡T and H=(ker⁡T)⊥⊕ker⁡T, so the closed span of the eigenspaces is (ker⁡T)⊥ (Spectral theorem for compact self adjoint operators, Eigenspaces of a self adjoint operator are orthogonal, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism, Orthogonality and the orthogonal complement, Orthogonal decomposition by a closed subspace).

[A3]

Bases and expansion. Every finite-dimensional eigenspace Eλ has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis); an orthonormal family is complete in a closed subspace in the case, and only in the case, that the finite-subset net of Fourier sums converges there, with Parseval and Bessel inequalities available (Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family, The finite Bessel inequality and best approximation by a finite orthonormal family, Orthonormal families, complete orthonormal systems and Hilbert bases).

[A5]

Countable Choice supplies, for the at most countable eigenvalue list, one orthonormal basis of each finite-dimensional eigenspace (The Axiom of Countable Choice (ACω), Finite, countably infinite, countable, uncountable).

Proof

technique · direct

Given: Countable Choice, the compact T, its absolute value ∣T∣, the index set J and the singular values sj, the finite integer r when ran⁡T is finite-dimensional, and the eigenspaces Eλ of ∣T∣ for positive eigenvalues λ.

1.1A1A2A3A5

Choosing the left system. By [A2] the positive eigenvalues of ∣T∣ are precisely the positive singular values with multiplicity, and their eigenspaces are finite-dimensional with closed span (ker⁡T)⊥; listing those eigenvalues with multiplicity as (sj)j∈J and choosing by [A5] an orthonormal basis of each Eλ gives an orthonormal family (ej)j∈J with ∣T∣ej=sjej for every j, whose closed linear span is (ker⁡T)⊥, and the terms sj>0 are in nonincreasing order.

2.1step 1.1A1

The right system is orthonormal. For j∈J put fj:=sj−1Tej, which lies in ran⁡T⊆ran⁡T‾ and is well defined because sj>0. For i,j∈J, using ∣T∣2=T∗T and the eigenvector property of [step 1.1], ⟨fi,fj⟩=1sisj⟨Tei,Tej⟩=1sisj⟨T∗Tei,ej⟩=1sisj⟨∣T∣2ei,ej⟩=si2sisj⟨ei,ej⟩=δij, so (fj)j∈J is orthonormal.

3.1step 1.1step 2.1A1A3A4

The expansion. Let x∈H. By [A2] write x=m+n with m∈(ker⁡T)⊥ and n∈ker⁡T. Since (ej) is complete in (ker⁡T)⊥ [step 1.1], the Fourier expansion [A3] gives m=∑j∈J⟨m,ej⟩ej=∑j∈J⟨x,ej⟩ej as a norm limit of finite-subset partial sums, and then continuity of T [A4] gives Tx=Tm=∑j∈J⟨x,ej⟩Tej=∑j∈Jsj⟨x,ej⟩fj, because Tn=0 and the image net of the finite partial sums converges. Moreover for finite F⊆J the remainder is ∥(T−∑j∈Fsj⟨⋅,ej⟩fj)x∥2=∑j∉Fsj2∣⟨x,ej⟩∣2≤sn+12∥x∥2 whenever F⊇{1,…,n}, by orthonormality [step 2.1] and Bessel [A3], so the partial sums Tn of the statement satisfy ∥T−Tn∥≤sn+1 for n+1∈J, and Tn=T for n≥r in the finite-rank case because then sj=0 for j>r and every index in J is ≤r.

4.1step 2.1step 3.1

The right system spans the range closure. Each fj=sj−1Tej lies in ran⁡T by [step 2.1], so the closed linear span N:=span⁡‾{fj:j∈J} is contained in ran⁡T‾; conversely [step 3.1] exhibits every Tx as the norm limit of finite linear combinations of the fj, so ran⁡T⊆N and hence ran⁡T‾=N.

5.1step 1.1step 2.1step 4.1A1A2A4

The partial isometry and T=U∣T∣. Define U first on the linear span V of {ej:j∈J} by U(∑j∈Fcjej):=∑j∈Fcjfj for finite F. This is well defined because (ej) is linearly independent as an orthonormal family, and it is isometric, since by [step 2.1] ∥∑cjfj∥2=∑∣cj∣2=∥∑cjej∥2; by [step 1.1] the closure of V is (ker⁡T)⊥, so U extends uniquely to a bounded linear operator, still denoted U, on (ker⁡T)⊥ with ∥Um∥=∥m∥ for all m∈(ker⁡T)⊥ and U((ker⁡T)⊥)=span⁡‾{fj}=ran⁡T‾ by [step 4.1]. Extend U to H=(ker⁡T)⊥⊕ker⁡T by U=0 on ker⁡T; then U is bounded and, because ∣T∣ is self-adjoint with ∣T∣ej=sjej, U∣T∣ej=Usjej=sjfj=Tej for every j and U∣T∣=0=T on ker⁡T=∣T∣−1(0) [A1], so U∣T∣=T by continuity on the closed span of ker⁡T and the ej, which is H by [A2]. Finally U∗U and UU∗: for x,y∈H one has ⟨Ux,Uy⟩=⟨Px,Py⟩ where P is the orthogonal projection onto (ker⁡T)⊥, because U is isometric on (ker⁡T)⊥ and vanishes on ker⁡T, so ⟨U∗Ux,y⟩=⟨Px,y⟩ and U∗U=P; dually, for y∈K the vector U∗y∈(ker⁡T)⊥ is characterised by ⟨U∗y,z⟩=⟨y,Uz⟩ for all z∈(ker⁡T)⊥, so UU∗y=y for y∈ran⁡T‾ and UU∗y=0 for y⊥ran⁡T‾, that is UU∗ is the orthogonal projection onto ran⁡T‾.

6.1step 1.1step 2.1step 3.1step 4.1step 5.1A1∎

Conclusion. Claim 1 is [step 1.1] and [step 2.1]; claim 2 is [step 3.1], whose index set is J by construction; claim 3 is [step 5.1] together with [step 4.1]. Claim 4 is the indexing discipline used throughout: J indexes the positive singular values with multiplicity and is ∅ only for T=0, when the finite dimension is r=0; it is finite exactly when the range is finite-dimensional. In that case the vanishing terms sn(T)=0 with n>r are numerical padding and index no vector.

Depends on

Dependency tree · 2 levels

Sources