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 TB(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 ranT is infinite-dimensional. When ranT is finite-dimensional, put r:=dimranTN (Finite-dimensional vector space, and its dimension dimFV; 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)jJ in nonincreasing order. Then:

  1. there are orthonormal families (ej)jJ in (kerT) and (fj)jJ in ranT, indexed by exactly J, with Tej=sjej and fj=sj1Tej for every jJ;
  2. for every xH the series converges in norm and Tx=jJsjx,ejfj, and its finite partial sums Tn:=jnsj,ejfj satisfy TTnsn+1 for every n with n+1J (and Tn=T for nr when r<+);
  3. the linear map U defined on the span of {ej:jJ} by Uej:=fj, extended by continuity to (kerT) and by zero on kerT, is a partial isometry with T=UT,UU=P(kerT),UU is the orthogonal projection onto (kerT), and UU the orthogonal projection onto ranT;
  4. the zero-padded sequence (sn(T))n1 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:HK, its absolute value T, the index set J of the positive singular values with multiplicity, the finite dimension r=dimranT 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 T2=TT, Tx=Tx and kerT=kerT; the positive singular values with multiplicity are the positive eigenvalues of T with multiplicity. They are finite in number exactly when ranT is finite-dimensional, and otherwise form a countably infinite list. In the finite-dimensional case the isometric linear bijection Φ:ranTranT, Φ(Tx)=Tx, gives dimranT=dimranT=r (Absolute value and singular values of a compact operator, Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis). No value dimV= 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 (kerT)=ranT; moreover kerT=kerT and H=(kerT)kerT, so the closed span of the eigenspaces is (kerT) (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 ranT is finite-dimensional, and the eigenspaces Eλ of T for positive eigenvalues λ.

1.1

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 (kerT); listing those eigenvalues with multiplicity as (sj)jJ and choosing by [A5] an orthonormal basis of each Eλ gives an orthonormal family (ej)jJ with Tej=sjej for every j, whose closed linear span is (kerT), and the terms sj>0 are in nonincreasing order.

A1A2A3A5
2.1

The right system is orthonormal. For jJ put fj:=sj1Tej, which lies in ranTranT and is well defined because sj>0. For i,jJ, using T2=TT and the eigenvector property of [step 1.1], fi,fj=1sisjTei,Tej=1sisjTTei,ej=1sisjT2ei,ej=si2sisjei,ej=δij, so (fj)jJ is orthonormal.

step 1.1A1
3.1

The expansion. Let xH. By [A2] write x=m+n with m(kerT) and nkerT. Since (ej) is complete in (kerT) [step 1.1], the Fourier expansion [A3] gives m=jJm,ejej=jJx,ejej as a norm limit of finite-subset partial sums, and then continuity of T [A4] gives Tx=Tm=jJx,ejTej=jJsjx,ejfj, because Tn=0 and the image net of the finite partial sums converges. Moreover for finite FJ the remainder is (TjFsj,ejfj)x2=jFsj2x,ej2sn+12x2 whenever F{1,,n}, by orthonormality [step 2.1] and Bessel [A3], so the partial sums Tn of the statement satisfy TTnsn+1 for n+1J, and Tn=T for nr in the finite-rank case because then sj=0 for j>r and every index in J is r.

step 1.1step 2.1A1A3A4
4.1

The right system spans the range closure. Each fj=sj1Tej lies in ranT by [step 2.1], so the closed linear span N:=span{fj:jJ} is contained in ranT; conversely [step 3.1] exhibits every Tx as the norm limit of finite linear combinations of the fj, so ranTN and hence ranT=N.

step 2.1step 3.1
5.1

The partial isometry and T=UT. Define U first on the linear span V of {ej:jJ} by U(jFcjej):=jFcjfj 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] cjfj2=cj2=cjej2; by [step 1.1] the closure of V is (kerT), so U extends uniquely to a bounded linear operator, still denoted U, on (kerT) with Um=m for all m(kerT) and U((kerT))=span{fj}=ranT by [step 4.1]. Extend U to H=(kerT)kerT by U=0 on kerT; then U is bounded and, because T is self-adjoint with Tej=sjej, UTej=Usjej=sjfj=Tej for every j and UT=0=T on kerT=T1(0) [A1], so UT=T by continuity on the closed span of kerT and the ej, which is H by [A2]. Finally UU and UU: for x,yH one has Ux,Uy=Px,Py where P is the orthogonal projection onto (kerT), because U is isometric on (kerT) and vanishes on kerT, so UUx,y=Px,y and UU=P; dually, for yK the vector Uy(kerT) is characterised by Uy,z=y,Uz for all z(kerT), so UUy=y for yranT and UUy=0 for yranT, that is UU is the orthogonal projection onto ranT.

step 1.1step 2.1step 4.1A1A2A4
6.1

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.

step 1.1step 2.1step 3.1step 4.1step 5.1A1

Depends on

Used by

Dependency tree · two levels

121 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