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.
Trace norm of a tensor product
Statement
For finite-dimensional complex-inner-product spaces and linear maps , , The equality includes zero maps and zero-dimensional factors.
Facts & Assumptions
Given: The finite-dimensional spaces and linear maps in the Statement.
The trace norm is the sum of the positive singular values, with zeros contributing nothing (Trace Norm).
Each finite-dimensional linear map has a singular-value decomposition with orthonormal left and right singular families and positive singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
Tensor maps apply each factor map on elementary tensors, and the product inner product is the product of factor inner products (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations).
Proof
If either or is zero, or a domain or codomain factor is zero-dimensional, then and at least one factor trace norm is zero, so the formula holds. Otherwise choose SVDs and as in [F2], with all .
By [F3], on elementary tensors The families and are orthonormal because their pairings are products of the factor pairings. Since elementary tensors span, this is a singular-value decomposition of with positive singular values exactly . Thus [F1] gives
Depends on
Used by
Dependency tree · two levels
20 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 Watrous, The Theory of Quantum Information (standard reference, not scraped)