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 ()). Let and be real or complex Hilbert spaces (Hilbert space) and let 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 (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities). Let be a Hilbert basis of and a Hilbert basis of (Orthonormal families, complete orthonormal systems and Hilbert bases), and let and 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 . Then:
- (matrix-coefficient form) the finite-subset supremum equals , and it also equals ;
- (basis independence) for every Hilbert basis of , and for every Hilbert basis of ;
- (membership and norms) is Hilbert–Schmidt relative to if and only if it is Hilbert–Schmidt relative to every other Hilbert basis of , and then for all such bases and every Hilbert basis of ; when the common defining sum is , none of these Hilbert–Schmidt norms is defined, and is Hilbert–Schmidt relative to none of the bases.
Facts & Assumptions
Given: Countable Choice, bounded , a Hilbert basis of and a Hilbert basis of .
Since is a complete orthonormal family in the Hilbert space , every satisfies , the sum being the finite-subset supremum; similarly for in (Parseval equivalences for an orthonormal family, Orthonormal families, complete orthonormal systems and Hilbert bases).
The Hilbert adjoint satisfies for all , , it is the unique such bounded operator, and for every (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).
For a fixed finite set , fix one bijection with a von Neumann natural (The cardinality of a finite set). Given nonempty sets for , apply Every natural-number-indexed list of nonempty sets has a choice function on its family of values to the function on . Its choice function on the set of values yields . This transports finite choice to this fixed ; no enumeration of the entire basis or simultaneous choice of enumerations is asserted.
For a nonnegative family the sum is the supremum of the finite subsums, is monotone in the family, and satisfies for finite (Square-summable families on an arbitrary index set and the space ).
Countable Choice is the hypothesis under which Parseval and the adjoint interface are available (The Axiom of Countable Choice ()).
The operator is Hilbert–Schmidt relative to exactly when , and then ; the same definitions apply to and to with respect to (Hilbert–Schmidt operator and Hilbert–Schmidt norm).
Proof
Given: Countable Choice, bounded , Hilbert bases of and of , and the nonnegative numbers .
For every the vector lies in , so [F1] applied in to the Hilbert basis gives , a supremum over finite .
For every the vector lies in by [F2], so [F1] applied in to the Hilbert basis gives ; since and by [F2], the moduli agree: .
The iterated suprema agree with the rectangle supremum. For every finite the identity holds. If , both sides are zero; hence assume . Each row sum is the finite number by step 1.1. The left side is at most the right side because each gives a subsum, while for the reverse inequality fix a real and, using [F3], choose for each a finite with ; then is finite and . Hence the supremum over all finite rectangles equals by [step 1.1] and [F4]; and since every finite is contained in a rectangle while subsums are monotone, this rectangle supremum is also the supremum over all finite subsets of .
The same computation with the adjoint. By [step 1.2] and the same argument with and interchanged, , 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 because finite subsets of a product lie in rectangles.
Conclusion of the matrix-coefficient form. Steps 2.1 and 2.2 identify the rectangle supremum of claim 1 with and with respectively, so that supremum equals both sums; this proves claim 1.
Basis independence. Let be any Hilbert basis of . Applying [step 3.1] to the pair gives , and applying it to gives for the same basis of ; hence , and also for every Hilbert basis of , both equalities holding in .
Membership and the norms. By [step 4.1] the sums , and all equal one extended real number, so they are finite simultaneously; when the common value is finite, taking nonnegative square roots gives by [F6], and when it is none of the three norms is defined and is Hilbert–Schmidt relative to no Hilbert basis of . This is claim 3.
Depends on
- Hilbert–Schmidt operator and Hilbert–Schmidt norm
- Hilbert space
- Orthonormal families, complete orthonormal systems and Hilbert bases
- Square-summable families on an arbitrary index set and the space $\ell^2(I)$
- Parseval equivalences for an orthonormal family
- The Hilbert-space adjoint of a bounded operator
- Hilbert-adjoint identities
- A bounded linear operator between normed spaces
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The cardinality $\lvert A\rvert$ of a finite set
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
- John Roe, Lectures on Analysis — Lecture 13, Definition 13.1 and the preceding matrix-coefficient calculation, printed p. 67 (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, version November 17, 2017 — §3.6, Lemma 3.23, printed pp. 93–94 (standard reference, not scraped)