Alphabeta Math
RemarkRemark: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Schatten p classes

Remark

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H and K be real or complex Hilbert spaces and let TB(H,K) be compact (Compact linear operator) with zero-padded singular-value sequence (sn(T))n1 (Absolute value and singular values of a compact operator). For a real 1p<+ the Schatten p-class Sp(H,K) is defined to be the set of compact operators with Tp:=(n1sn(T)p)1/p<+. This is an orientation remark only. It records the scale of ideals without developing any of its theory.

The two endpoints that this page does develop are recognised as follows. S1(H,K) is exactly the trace-class ideal and 1 is the trace norm, by definition of the latter (Trace class operator), including the zero padding and the finite-rank case. S2(H,K) is exactly the class of operators that are Hilbert–Schmidt relative to a supplied Hilbert basis E of H: for such a basis, let (ej)jJH and (fj)jJK be the right and left singular families supplied by the SVD. Its expansion gives Te=jJsje,ejfj, so orthonormality of the fj, Parseval for the supplied basis E, and the interchange of the nonnegative finite-subset suprema give eETe2=n1sn(T)2, since eETe2=jJsj2eEe,ej2=jJsj2, and the last sum is the zero-padded singular-value sum (Singular value decomposition for compact operators, Hilbert–Schmidt operator and Hilbert–Schmidt norm, Parseval equivalences for an orthonormal family, Square-summable families on an arbitrary index set and the space 2(I), Orthonormal families, complete orthonormal systems and Hilbert bases), so that, when the common sum is finite, T2=THS,E. For clarity, the interchange uses only finite rectangles: every finite subset of E×J lies in the product of its two finite projections, and finitely many finite sets of indices have finite union. Thus both iterated nonnegative suprema equal the supremum over finite rectangles, even when they are infinite. The norm identity for each Te follows first for finite orthogonal sums and then by norm convergence of its SVD expansion. Parseval is applied in H to ej, with e,ej=ej,e. Conversely, every bounded operator Hilbert–Schmidt relative to E is compact by Hilbert–Schmidt operators are compact, so the same calculation applies to it and puts it in S2(H,K). No basis of K is required, and the norm retains the notation THS,E of its definition. The formula proves the same value for every supplied basis of H in this compact-operator setting; it does not assert existence of such a basis. Empty singular families and an empty domain basis contribute zero. For p=+ one writes S(H,K) for the compact operators with the operator norm TS:=T=s1(T) (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Deliberate boundaries. Nothing here asserts completeness of p, Hölder or Young inequalities, duality, interpolation, or the identification of Sp with a space of sequences; no monotonicity of the norms beyond TT1 from the trace-class page is claimed. Later items must not use this remark as a supplier: it is recorded for orientation, exactly as the functional-analysis plan's FA-16 boundary requires, and the general theory of Schatten classes belongs to a later, separate development.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

81 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