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.
Partial trace over the first tensor factor
Definition
Let be finite-dimensional complex inner-product spaces, and fix the factor order . For ordered orthonormal bases and , define where under the linear-first convention. Equivalently, this is the partial trace over the second factor after swapping the two wires. The partial-trace characterization and wire-permutation unitarity in The partial trace is characterized by the trace pairing and is basis-independent and Finite wire permutations are unitary basis permutations show that the map is independent of the chosen orthonormal bases. In particular, the same definition applies when , with that residual factor order left unchanged. For an operator on , use the canonical associator of the ordered tensor-register construction to view it on before taking this partial trace.
Depends on
- Finite iterated tensor products represent multilinear maps independently of parenthesization
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- Real and complex inner product spaces, with the inner product linear in the first argument
- Partial trace over a finite tensor factor
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- The partial trace is characterized by the trace pairing and is basis-independent
- Tensor maps preserve composition, identities, and adjoints
- Finite wire permutations are unitary basis permutations
Used by
- Complementary channels and coherent information Definition
- Exact correction of a protected subsystem Definition
- Finite classical-quantum states and Holevo information Definition
- Finite quantum mutual, conditional, and conditional mutual information Definition
- A Bell pair has negative quantum conditional entropy Example
- Strong subadditivity for a pure GHZ tripartite state Example
- Coherent information equals output entropy minus environment entropy Lemma
- Joint state support is contained in the tensor product of its marginal supports Lemma
- Partial traces of a finite bipartite state are states Lemma
- Preserving the logical marginal forces a gauge-only channel Lemma
- Finite quantum mutual information identities and the Holevo identity Theorem
Dependency tree · two levels
37 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 Preskill, Quantum Information, Chapter 7: Quantum Error Correction (working draft, March 2026) (standard reference, not scraped)
- David W. Kribs, Raymond Laflamme, David Poulin, and Maia Lesosky, Operator Quantum Error Correction (standard reference, not scraped)