Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Absolute value and singular values of a compact operator

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H and K be real or complex Hilbert spaces (Hilbert space) and let T∈B(H,K) be a compact operator (Compact linear operator, A bounded linear operator between normed spaces), with Hilbert adjoint T∗∈B(K,H) (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

The absolute value. The operator T∗T∈B(H) is compact, since it is the composite of the compact T with the bounded T∗ (Compositions with a compact operator are compact); it is self-adjoint, because (T∗T)∗=T∗T∗∗=T∗T (Hilbert-adjoint identities); and it is positive, because ⟨T∗Tx,x⟩=⟨Tx,Tx⟩=∥Tx∥2≥0 for every x∈H (Self-adjoint, positive, unitary and normal operators). The absolute value of T is the unique compact self-adjoint positive operator ∣T∣:=(T∗T)1/2 with ∣T∣2=T∗T, whose existence and uniqueness are the preceding square-root lemma (Positive square root of a compact positive operator). It satisfies ∥∣T∣x∥2=⟨∣T∣2x,x⟩=⟨T∗Tx,x⟩=∥Tx∥2(x∈H), so in particular ∥∣T∣∥=∥T∥ (The operator norm as the least bound and as the unit-sphere or unit-ball supremum) and ker⁡∣T∣=ker⁡T, since ∥∣T∣x∥=∥Tx∥ for every x.

The singular values. By the spectral theorem for ∣T∣ (Spectral theorem for compact self adjoint operators) the nonzero eigenvalues of ∣T∣ form a finite or countably infinite set of positive reals, each with finite multiplicity, and for every real ε>0 only finitely many of them exceed ε; positivity rules out negative eigenvalues and 0 already corresponds to the kernel. The multiset of positive singular values of T is the multiset of positive eigenvalues of ∣T∣, counted with multiplicity (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

The ordered singular-value sequence. The distinct positive singular values are listed with positive labels in decreasing order μ1>μ2>⋯ as follows: if the multiset of positive eigenvalues is empty (equivalently ∣T∣=0, equivalently T=0), the list is empty; otherwise μ1:=max⁡{λ>0:λ is an eigenvalue of ∣T∣}, a maximum and not merely a supremum, because a supremum value not attained would be an accumulation point different from 0; having chosen μ1,…,μk, put μk+1:=max⁡{λ>0:λ is an eigenvalue of ∣T∣ and λ<μk} whenever that set is nonempty, and stop otherwise. Each step is legitimate by the finiteness-above-thresholds property above, and an infinite list satisfies μk→0 (otherwise its decreasing limit would be a nonzero accumulation point). Writing dk for the multiplicity of μk (a positive integer), the zero-padded singular-value sequence is s1≥s2≥s3≥⋯ where s1=⋯=sd1=μ1, sd1+1=⋯=sd1+d2=μ2, and so on; if the multiset is finite with total multiplicity r=d1+⋯+dm, one sets sn:=0 for every n>r, and if T=0 one sets sn:=0 for every n≥1. The number sn is written sn(T) and called the n-th singular value of T.

Zero-based domain and positive labels. Set s0(T):=∥T∥=s1(T). Thus the numerical sequence is the function n↦sn(T) on all of N, including zero. The positive-labelled tail (sm+1(T))m∈N is the multiplicity-counting list constructed above. The auxiliary initial value s0 is not an additional entry of the eigenvalue multiset, does not index a singular vector, and is excluded from multiplicity counts and singular-value sums, which use n≥1. The full sequence satisfies s0≥s1≥s2≥⋯ and tends to zero. This preserves the page's positive rank labels while giving convergence statements a zero-based domain.

Rank and the finiteness of the list. The map Φ:ran⁡∣T∣→ran⁡T given by Φ(∣T∣x):=Tx is well defined and linear, because ∣T∣x=∣T∣x′ forces x−x′∈ker⁡∣T∣=ker⁡T and hence Tx=Tx′; it is injective, because Tx=0 gives x∈ker⁡T=ker⁡∣T∣ and ∣T∣x=0; it is surjective onto ran⁡T because T=Φ∘∣T∣; and it is isometric, ∥Tx∥=∥∣T∣x∥. Hence ran⁡T is finite-dimensional if and only if ran⁡∣T∣ is finite-dimensional; in that case the linear bijection Φ gives dim⁡ran⁡T=dim⁡ran⁡∣T∣ (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis). Consequently, whenever T has finite rank, the positive singular values with multiplicity number exactly dim⁡ran⁡T, the rank of T, and all later sn vanish, so the sequence is zero-padded. If T does not have finite rank, the multiset of positive singular values is infinite and countable (Finite, countably infinite, countable, uncountable) and sn>0 for every n, with sn↓0; in particular finite rank of T is characterised by the eventual vanishing sn=0 for all sufficiently large n, and conversely such eventual vanishing forces finite rank. The sequence (sn) is numerical data only: no orthonormal system is selected here, and the zero padding is not an indexing of any family of vectors. The unordered multiset determines (sn) uniquely, so (sn) is well defined, and s1(T)=∥∣T∣∥=∥T∥.

Depends on

Dependency tree · 2 levels

Sources