In this section Hsrc and Hobs are separable and K∈B(Hsrc,Hobs) is compact.
Under Assumption 4.1, K∗K is a positive, self-adjoint, compact operator on Hsrc. By the spectral theorem for compact self-adjoint operators [13, Ch. VI] its nonzero spectrum consists of positive eigenvalues of finite multiplicity, which can accumulate only at 0. Enumerate them, repeated according to multiplicity and in nonincreasing order, as σ12≥σ22≥⋯>0 with σn>0; the index set is {1,…,R} if K has finite rank R, and N otherwise. Let {vn} be a corresponding orthonormal family of eigenvectors of K∗K, so K∗Kvn=σn2vn, and put un:=σn−1Kvn.(4.1)
Lemma 4.2 (Schmidt singular system).
The families {vn} and {un} are orthonormal, {vn} is an orthonormal basis of (kerK)⊥=RanK∗, {un} is an orthonormal basis of RanK, and Kvn=σnun,K∗un=σnvn,(4.2)KΨ=n≥1∑σn⟨vn,Ψ⟩un(Ψ∈Hsrc),(4.3) the series converging in the norm of Hobs. If the index set is infinite then σn→0.
Proof. Orthonormality of {un}: ⟨um,un⟩=(σmσn)−1⟨Kvm,Kvn⟩=(σmσn)−1⟨vm,K∗Kvn⟩=(σn/σm)⟨vm,vn⟩=δmn. From (4.1), Kvn=σnun; and K∗un=σn−1K∗Kvn=σnvn, which is (4.2).
Since kerK=kerK∗K (indeed KΨ=0 iff ⟨Ψ,K∗KΨ⟩=∥KΨ∥2=0), the spectral theorem gives the orthogonal decomposition Hsrc=kerK⊕span{vn}, and by Corollary 3.3 the second summand is (kerK)⊥=RanK∗. Thus every Ψ decomposes as Ψ=Ψ0+∑n⟨vn,Ψ⟩vn with Ψ0∈kerK, the series converging in Hsrc. Applying the bounded operator K term by term and using (4.2) yields (4.3) with convergence in Hobs. In particular RanK⊆span{un} and each un=σn−1Kvn∈RanK, so {un} is an orthonormal basis of RanK.
Finally, if infinitely many σn>0 existed with σn≥ε>0 along a subsequence, then {Kvn}={σnun} would satisfy ∥Kvn−Kvm∥2=σn2+σm2≥2ε2, so the bounded sequence {vn} would have image with no convergent subsequence, contradicting compactness. Hence σn→0. ◻
Definition 4.3 (Rank-r truncation).
For r≥0 set Kr:=n=1∑rσnun⟨vn,⋅⟩,(4.4) that is, KrΨ=∑n=1rσn⟨vn,Ψ⟩un. If K has finite rank R≤r, the sum runs only over the available indices and Kr=K. We adopt the convention σr+1:=0 whenever the index r+1 exceeds the number of positive singular values.
Let K be compact and r≥0. Then for every B∈B(Hsrc,Hobs) with rankB≤r, ∥K−B∥op≥σr+1,(4.5) and equality is attained at B=Kr. Consequently ∥K−Kr∥op=σr+1=min{∥K−B∥op:rankB≤r}.(4.6)
Proof.Upper bound. By (4.3) and (4.4), (K−Kr)Ψ=∑n>rσn⟨vn,Ψ⟩un. By orthonormality of {un} and Bessel’s inequality for {vn}, ∥(K−Kr)Ψ∥2=n>r∑σn2∣⟨vn,Ψ⟩∣2≤σr+12n>r∑∣⟨vn,Ψ⟩∣2≤σr+12∥Ψ∥2, using σn≤σr+1 for n>r. Hence ∥K−Kr∥op≤σr+1. Testing on Ψ=vr+1 (when σr+1>0) gives ∥(K−Kr)vr+1∥=σr+1, so equality holds.
Lower bound. We may assume σr+1>0, else (4.5) is vacuous. Let rankB≤r and put W:=span{v1,…,vr+1}, of dimension r+1. The restriction B∣W:W→Hobs has rank at most r<dimW, so by rank–nullity there exists v∈W with ∥v∥=1 and Bv=0. Write v=∑n=1r+1cnvn with ∑n=1r+1∣cn∣2=1. Then by (4.3), ∥(K−B)v∥2=∥Kv∥2=n=1∑r+1cnσnun2=n=1∑r+1σn2∣cn∣2≥σr+12n=1∑r+1∣cn∣2=σr+12, since σn≥σr+1 for n≤r+1. Therefore ∥K−B∥op≥∥(K−B)v∥≥σr+1. ◻
Theorem 4.4 is the operator-norm form of the Eckart–Young–Mirsky theorem [14, 2, 9]. It quantifies (D3) and nothing else: it is an approximation statement about how well a finite-rank operator can imitate K. It says nothing about kerK and nothing about invertibility.
Example 4.5 (Compact, injective, unstably invertible).
On Hsrc=Hobs=ℓ2(N) define K(x1,x2,x3,…):=(x1,2x2,3x3,…),i.e.(Kx)n=nxn.(4.7) Let {en} be the standard basis. Then:
K is compact. Let Kr be as in Definition 4.3, which here is (Krx)n=xn/n for n≤r and 0 for n>r; this has rank r. For any x with ∥x∥≤1, ∥(K−Kr)x∥2=∑n>r∣xn∣2/n2≤(r+1)−2, so ∥K−Kr∥op≤1/(r+1)→0. A norm limit of finite-rank operators is compact [13, Thm. VI.12]. (This also exhibits the singular system explicitly: vn=un=en, σn=1/n, and Theorem 4.4 gives the exact value ∥K−Kr∥op=σr+1=1/(r+1).)
K is injective. If Kx=0 then xn/n=0 for every n, so x=0. Hence kerK={0} and, by Corollary 2.5, no exact source distinction is lost: the observational equivalence relation ∼K is equality.
The inverse on the range is unbounded, and RanK is not closed. On RanK the inverse is (K−1y)n=nyn. Then K−1en=nen has norm n while ∥en∥=1, so K−1 is unbounded. By Theorem 2.3, RanK is therefore not closed. Concretely, y=(1/n)n≥1∈ℓ2 is the limit of K((1,…,1,0,0,…)) but is not in RanK, since K−1y=(1,1,1,…)∈/ℓ2.
Example 4.5 decouples the three static phenomena completely. K is compact, so it admits arbitrarily good, quantitatively controlled finite-rank approximations (D3), and, more sharply, Theorem 4.4 gives the exact approximation error. K is injective, so (D1) fails: nothing is exactly identified, and the quotient HK is Hsrc itself. Yet K−1 is unbounded, so (D2) holds in full force: the source is determined by the readout, but not continuously, and no stability estimate as in Theorem 2.3(3) is available. Compactness does not imply a nontrivial kernel, what it does imply is the controlled finite-rank approximation of Theorem 4.4, and a trivial kernel does not imply stable inversion. Note also that for this K, (D4) cannot occur under any source semigroup whatever: kerK={0} is invariant trivially, so by (1.1) the dynamics always descend, however violently the inversion is ill-conditioned. Instability of the inverse and failure of dynamical descent are different diseases. Any argument that slides between “the observation is compact”, “information is lost”, and “the source is nonidentifiable” has already conflated three different theorems.