Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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.

Hilbert–Schmidt operators are compact

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 bounded linear operator (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum), let E be a Hilbert basis of H (Orthonormal families, complete orthonormal systems and Hilbert bases), and assume that T is Hilbert–Schmidt relative to E (Hilbert–Schmidt operator and Hilbert–Schmidt norm), that is, sE(T)=∑e∈E∥Te∥2<+∞ in the finite-subset-supremum convention of Square-summable families on an arbitrary index set and the space ℓ2(I). For finite F⊆E let PFx:=∑e∈F⟨x,e⟩e be the coordinate projection (The finite Bessel inequality and best approximation by a finite orthonormal family). Then:

  1. (finite-rank pieces) PF is a bounded linear operator on H with ∥PF∥≤1, its range lies in the finite-dimensional subspace span⁡{e:e∈F}, and TPF is compact (Compact linear operator);
  2. (norm estimate) ∥T−TPF∥≤(∑e∈E∖F∥Te∥2)1/2 for every finite F⊆E, and the right-hand side is arbitrarily small for suitable finite F;
  3. (compactness) T is a compact operator.

Facts & Assumptions

Given: Countable Choice, bounded T:H→K, a Hilbert basis E of H with sE(T)<+∞, and finite sets F⊆G⊆E.

[F1]

T is compact exactly when T(B‾H)‾ is a compact subset of K, where B‾H={x∈H:∥x∥≤1} (Compact linear operator).

[F2]

For finite F⊆E the vector PFx=∑e∈F⟨x,e⟩e lies in the span of {e:e∈F}, ∥PFx∥2=∑e∈F∣⟨x,e⟩∣2, the residual x−PFx is orthogonal to every e∈F, and ∥x−PFx∥2=∥x∥2−∑e∈F∣⟨x,e⟩∣2≤∥x∥2 (The finite Bessel inequality and best approximation by a finite orthonormal family).

[F3]

The finite-subset net (PGx) over the finite subsets G⊆E, directed by inclusion, converges to x for every x∈H (Fourier expansion in a Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases).

[F4]

Since sE(T)<+∞, for every real ε>0 there is a finite F⊆E with ∑e∈E∖F∥Te∥2<ε; for finite F⊆G the finite subsum over G∖F is at most the sum over E∖F (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F8]

A Hilbert space is a Banach space (Hilbert space, Banach space), and under Countable Choice a norm limit of compact operators into a Banach space is compact (Norm limit of compact operators is compact).

[F9]

Countable Choice allows one witness to be selected from each of countably many nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: Countable Choice, bounded T:H→K, a Hilbert basis E of H with sE(T)<+∞, and a finite F⊆E.

1.1F2algebra

For every x∈H, [F2] gives ∥PFx∥2=∑e∈F∣⟨x,e⟩∣2≤∥x∥2 and PFx∈span⁡{e:e∈F}; thus PF is linear by construction, bounded with ∥PF∥≤1, and its range lies in span⁡{e:e∈F}.

1.2F5

Since F is finite, [F5] fixes n∈N and a bijection σ from n onto F; the list eσ(0),…,eσ(n−1) is injective because the family is orthonormal, and its image spans Z:=span⁡{e:e∈F}, so it is an ordered basis of Z of finite length; therefore B‾Z is compact by [F5].

2.1step 1.1step 1.2F1F6F7

The set PF(B‾H) is contained in B‾Z by [step 1.1], since ∥PFx∥≤∥x∥≤1 and PFx∈Z; the restriction of T to Z is continuous by [F7], so T(B‾Z) is compact by [step 1.2] and [F6]; as TPF(B‾H)=T(PF(B‾H))⊆T(B‾Z), its closure is a closed subset of the compact set T(B‾Z), hence compact by [F6], and TPF is compact by [F1].

2.2step 1.1F2F4algebra

For finite F⊆G⊆E and x∈H we have PFPGx=PFx, because ⟨PGx,e⟩=⟨x,e⟩ for e∈G; hence (I−PF)PGx=PGx−PFx=∑e∈G∖F⟨x,e⟩e and, by linearity of T, T(I−PF)PGx=∑e∈G∖F⟨x,e⟩Te; the triangle inequality and the finite Cauchy–Schwarz inequality give ∥T(I−PF)PGx∥≤(∑e∈G∖F∣⟨x,e⟩∣2)1/2(∑e∈G∖F∥Te∥2)1/2≤∥x∥(∑e∈E∖F∥Te∥2)1/2, where the last step uses [F2] for the coefficient factor and [F4] for the tail factor.

3.1step 1.1step 2.2F3F7algebra

As G runs over the finite subsets of E containing F, the net (I−PF)PGx=(PGx−PFx) converges to (I−PF)x, by [F3] and the boundedness of PF from [step 1.1]; the continuous operator T of [F7] therefore carries this net to a net converging to T(I−PF)x=(T−TPF)x, while [step 2.2] bounds every term of that net by ∥x∥(∑e∈E∖F∥Te∥2)1/2; the norm being continuous, the limit obeys the same bound, and taking the supremum over ∥x∥≤1 gives ∥T−TPF∥≤(∑e∈E∖F∥Te∥2)1/2.

4.1step 2.1step 3.1F4

Given a real ε>0, [F4] provides a finite F⊆E with ∑e∈E∖F∥Te∥2<ε2; then ∥T−TPF∥<ε by [step 3.1], and TPF is compact by [step 2.1], so for every positive tolerance there is a compact operator TPF within that tolerance of T.

4.2step 2.1step 3.1F4F9choose

By [F9] applied to the countably many nonempty sets of finite F⊆E satisfying ∑e∈E∖F∥Te∥2<(n+1)−2 for n∈N — each nonempty by [F4] — there is a sequence (Fn) of finite subsets of E with these tails; then ∥T−TPFn∥≤(n+1)−1→0 by [step 3.1], and each TPFn is compact by [step 2.1].

5.1step 2.1step 3.1step 4.2F8∎

The target K is a Banach space by [F8], so the norm limit T of the compact operators TPFn is compact by [F8]; this proves claim 3, while claims 1 and 2 are [step 1.1] with [step 2.1] and [step 3.1] with [step 4.1].

Depends on

Dependency tree · 2 levels

Sources