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.
Strong subadditivity of finite-dimensional quantum entropy
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be a density operator on their ordered tensor product. Write for its marginals using the partial traces in Partial trace over a finite tensor factor. Then where with as in Finite-dimensional von Neumann entropy.
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces and a density operator on .
Finite-dimensional quantum relative entropy: is finite on support inclusion and equals there; otherwise it is .
Joint state support is contained in the tensor product of its marginal supports: for any bipartite state, the joint support is contained in the tensor product of its marginal supports, so its relative entropy to the product of its marginals is finite.
Finite quantum mutual information identities and the Holevo identity: for a finite bipartite state , .
Partial-trace data processing for finite quantum relative entropy: for positive semidefinite on a finite tensor product, , including extended values.
Density operator: a state is positive semidefinite and has trace one.
Partial trace over a finite tensor factor: tracing out the last factor sums the diagonal blocks indexed by that factor.
Ordered tensor registers, their inner product, and wire permutations: the product basis has the displayed factor order and tensor products act factorwise.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: positive operators have finite spectral decompositions in orthonormal eigenbases.
Partial traces of a finite bipartite state are states: partial traces of a finite bipartite density operator are density operators.
Proof
View first across the grouped bipartition : [F9] makes and states. Applying [F9] across also makes a state. Applying it once more to across makes a state. This is also : in the ordered product basis [F6]–[F7], both have coefficient , since the finite sums may be reordered. The operator is also a state: spectral decompositions of the two positive factors give nonnegative product eigenvalues, and their sum is . Applying [F2] to the bipartite states and gives support inclusion for both relative entropies and ; [F1] then makes both finite.
Set and . By [F6] and the ordered product basis [F7], and : the latter equality follows entrywise by summing the C-diagonal block of while the A-factor matrix coefficient remains fixed. Apply [F4] to this pair to obtain
Both sides in step 2.1 are finite by step 1.1, so [F3] identifies them as and , respectively. Cancel the common finite term and rearrange the inequality to obtain .
Depends on
- Finite-dimensional von Neumann entropy
- Finite-dimensional quantum relative entropy
- Joint state support is contained in the tensor product of its marginal supports
- Finite quantum mutual information identities and the Holevo identity
- Partial-trace data processing for finite quantum relative entropy
- Density operator
- Partial traces of a finite bipartite state are states
- Partial trace over a finite tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
- Strong subadditivity for a pure GHZ tripartite state Example
- Additivity of optimized entanglement-assisted information Lemma
- Flat-input coherent information is achievable by subspace codes Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Data processing for finite quantum mutual information Theorem
- Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels Theorem
- Nonnegativity of finite-dimensional quantum conditional mutual information Theorem
- Regularized private-information formula for quantum channel capacity Theorem
Dependency tree · two levels
46 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 (2018), Chapter 5 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8 (2019) (standard reference, not scraped)