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 TB(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)=eETe2<+ in the finite-subset-supremum convention of Square-summable families on an arbitrary index set and the space 2(I). For finite FE let PFx:=eFx,ee 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 PF1, its range lies in the finite-dimensional subspace span{e:eF}, and TPF is compact (Compact linear operator);
  2. (norm estimate) TTPF(eEFTe2)1/2 for every finite FE, 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:HK, a Hilbert basis E of H with sE(T)<+, and finite sets FGE.

[F1]

T is compact exactly when T(BH) is a compact subset of K, where BH={xH:x1} (Compact linear operator).

[F2]

For finite FE the vector PFx=eFx,ee lies in the span of {e:eF}, PFx2=eFx,e2, the residual xPFx is orthogonal to every eF, and xPFx2=x2eFx,e2x2 (The finite Bessel inequality and best approximation by a finite orthonormal family).

[F3]

The finite-subset net (PGx) over the finite subsets GE, directed by inclusion, converges to x for every xH (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 FE with eEFTe2<ε; for finite FG the finite subsum over GF is at most the sum over EF (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:HK, a Hilbert basis E of H with sE(T)<+, and a finite FE.

1.1

For every xH, [F2] gives PFx2=eFx,e2x2 and PFxspan{e:eF}; thus PF is linear by construction, bounded with PF1, and its range lies in span{e:eF}.

F2algebra
1.2

Since F is finite, [F5] fixes nN and a bijection σ from n onto F; the list eσ(0),,eσ(n1) is injective because the family is orthonormal, and its image spans Z:=span{e:eF}, so it is an ordered basis of Z of finite length; therefore BZ is compact by [F5].

F5
2.1

The set PF(BH) is contained in BZ by [step 1.1], since PFxx1 and PFxZ; the restriction of T to Z is continuous by [F7], so T(BZ) is compact by [step 1.2] and [F6]; as TPF(BH)=T(PF(BH))T(BZ), its closure is a closed subset of the compact set T(BZ), hence compact by [F6], and TPF is compact by [F1].

step 1.1step 1.2F1F6F7
2.2

For finite FGE and xH we have PFPGx=PFx, because PGx,e=x,e for eG; hence (IPF)PGx=PGxPFx=eGFx,ee and, by linearity of T, T(IPF)PGx=eGFx,eTe; the triangle inequality and the finite Cauchy–Schwarz inequality give T(IPF)PGx(eGFx,e2)1/2(eGFTe2)1/2x(eEFTe2)1/2, where the last step uses [F2] for the coefficient factor and [F4] for the tail factor.

step 1.1F2F4algebra
3.1

As G runs over the finite subsets of E containing F, the net (IPF)PGx=(PGxPFx) converges to (IPF)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(IPF)x=(TTPF)x, while [step 2.2] bounds every term of that net by x(eEFTe2)1/2; the norm being continuous, the limit obeys the same bound, and taking the supremum over x1 gives TTPF(eEFTe2)1/2.

step 1.1step 2.2F3F7algebra
4.1

Given a real ε>0, [F4] provides a finite FE with eEFTe2<ε2; then TTPF<ε 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.

step 2.1step 3.1F4
4.2

By [F9] applied to the countably many nonempty sets of finite FE satisfying eEFTe2<(n+1)2 for nN — each nonempty by [F4] — there is a sequence (Fn) of finite subsets of E with these tails; then TTPFn(n+1)10 by [step 3.1], and each TPFn is compact by [step 2.1].

step 2.1step 3.1F4F9choose
5.1

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].

step 2.1step 3.1step 4.2F8

Depends on

Used by

Dependency tree · two levels

107 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