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.

The Hilbert–Schmidt norm is basis independent

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) and 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), with Hilbert adjoint TB(K,H) (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities). Let E be a Hilbert basis of H and F a Hilbert basis of K (Orthonormal families, complete orthonormal systems and Hilbert bases), and let sE(T)=eETe2 and sF(T)=fFTf2 be the finite-subset-supremum sums of Hilbert–Schmidt operator and Hilbert–Schmidt norm and Square-summable families on an arbitrary index set and the space 2(I). Then:

  1. (matrix-coefficient form) the finite-subset supremum sup{eAfBTe,f2  :  AE, BF finite} equals sE(T), and it also equals sF(T);
  2. (basis independence) sE(T)=sE(T) for every Hilbert basis E of H, and sE(T)=sF(T) for every Hilbert basis F of K;
  3. (membership and norms) T is Hilbert–Schmidt relative to E if and only if it is Hilbert–Schmidt relative to every other Hilbert basis of H, and then THS,E=THS,E=THS,F for all such bases E,E and every Hilbert basis F of K; when the common defining sum is +, none of these Hilbert–Schmidt norms is defined, and T is Hilbert–Schmidt relative to none of the bases.

Facts & Assumptions

Given: Countable Choice, bounded T:HK, a Hilbert basis E of H and a Hilbert basis F of K.

[F1]

Since F is a complete orthonormal family in the Hilbert space K, every yK satisfies y2=fFy,f2, the sum being the finite-subset supremum; similarly for E in H (Parseval equivalences for an orthonormal family, Orthonormal families, complete orthonormal systems and Hilbert bases).

[F2]

The Hilbert adjoint satisfies Tx,y=x,Ty for all xH, yK, it is the unique such bounded operator, and TfH for every fK (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

[F3]

For a fixed finite set A, fix one bijection q:nA with a von Neumann natural n (The cardinality A of a finite set). Given nonempty sets Ce for eA, apply Every natural-number-indexed list of nonempty sets has a choice function on its family of values to the function kCq(k) on n. Its choice function c on the set of values yields be=c(Ce)Ce. This transports finite choice to this fixed A; no enumeration of the entire basis or simultaneous choice of enumerations is asserted.

[F4]

For a nonnegative family (ce)eE the sum is the supremum of the finite subsums, is monotone in the family, and satisfies eEce=eFce+eEFce for finite FE (Square-summable families on an arbitrary index set and the space 2(I)).

[F5]

Countable Choice is the hypothesis under which Parseval and the adjoint interface are available (The Axiom of Countable Choice (ACω)).

[F6]

The operator T is Hilbert–Schmidt relative to E exactly when sE(T)<+, and then THS,E=(sE(T))1/2; the same definitions apply to E and to T with respect to F (Hilbert–Schmidt operator and Hilbert–Schmidt norm).

Proof

technique · direct

Given: Countable Choice, bounded T:HK, Hilbert bases E of H and F of K, and the nonnegative numbers ae,f:=Te,f2.

1.1

For every eE the vector Te lies in K, so [F1] applied in K to the Hilbert basis F gives Te2=fFae,f, a supremum over finite BF.

F1F5
1.2

For every fF the vector Tf lies in H by [F2], so [F1] applied in H to the Hilbert basis E gives Tf2=eETf,e2; since Tf,e=e,Tf and Te,f=e,Tf by [F2], the moduli agree: Tf,e=Te,f=ae,f1/2.

F1F2
2.1

The iterated suprema agree with the rectangle supremum. For every finite AE the identity sup{eAfBae,f:BF finite}=eAfFae,f holds. If A=, both sides are zero; hence assume A. Each row sum is the finite number Te2 by step 1.1. The left side is at most the right side because each B gives a subsum, while for the reverse inequality fix a real η>0 and, using [F3], choose for each eA a finite BeF with fBeae,f>fFae,fη; then B:=eABe is finite and eAfBae,feAfBeae,f>eAfFae,fAη. Hence the supremum over all finite rectangles A×B equals supAeAfFae,f=supAeATe2=sE(T) by [step 1.1] and [F4]; and since every finite SE×F is contained in a rectangle while subsums are monotone, this rectangle supremum is also the supremum over all finite subsets of E×F.

step 1.1F3F4algebra
2.2

The same computation with the adjoint. By [step 1.2] and the same argument with E and F interchanged, sF(T)=supBfBeETf,e2=supA,BeAfBTf,e2=supA,BeAfBae,f, the last equality by the modulus identity of [step 1.2]; the middle supremum is over finite rectangles, and it is the finite-subset supremum of E×F because finite subsets of a product lie in rectangles.

step 1.2F3F4
3.1

Conclusion of the matrix-coefficient form. Steps 2.1 and 2.2 identify the rectangle supremum of claim 1 with sE(T) and with sF(T) respectively, so that supremum equals both sums; this proves claim 1.

step 2.1step 2.2
4.1

Basis independence. Let E be any Hilbert basis of H. Applying [step 3.1] to the pair (E,F) gives sE(T)=sF(T), and applying it to (E,F) gives sE(T)=sF(T) for the same basis F of K; hence sE(T)=sE(T), and also sE(T)=sF(T) for every Hilbert basis F of K, both equalities holding in [0,+].

step 3.1
5.1

Membership and the norms. By [step 4.1] the sums sE(T), sE(T) and sF(T) all equal one extended real number, so they are finite simultaneously; when the common value is finite, taking nonnegative square roots gives THS,E=THS,E=THS,F by [F6], and when it is + none of the three norms is defined and T is Hilbert–Schmidt relative to no Hilbert basis of H. This is claim 3.

step 4.1F6

Depends on

Used by

Dependency tree · two levels

62 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