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.
Coherent information equals output entropy minus environment entropy
Statement
Let be a finite-dimensional channel, let be a finite Stinespring isometry, let , and let be a density operator on . Then
The right-hand side is independent of the chosen Stinespring dilation, since it equals the purification-defined quantity in Complementary channels and coherent information.
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces , a channel , a Stinespring isometry for , and a density operator on .
Complementary channels and coherent information: for a purification , , with ; the chosen complement is .
Ensemble and purification and Purifications exist and are unitarily equivalent after padding: a purification is a unit vector with , and such a finite purification exists.
Schmidt decomposition: a finite pure bipartite vector has a Schmidt decomposition, so its two reduced density operators have the same positive eigenvalues with multiplicities.
Every finite-dimensional channel has a finite isometric dilation: for every input operator .
Finite-dimensional von Neumann entropy: for the eigenvalues of a finite-dimensional density operator; zero eigenvalues contribute zero.
Partial trace over a finite tensor factor, Partial trace over the first tensor factor, Ordered tensor registers, their inner product, and wire permutations, and Finite wire permutations are unitary basis permutations: ordered partial traces sum equal traced-factor indices; the factors of can be reordered by a unitary wire permutation.
Proof
Choose a finite purification of using [F2], and put . Since is an isometry, is a unit vector. Reorder to using [F6]; tracing gives because [F4] says . Tracing and gives : in the ordered product basis, the two finite partial-trace sums contract the index to and then contract the index.
Regard the reordered as a bipartite vector across . By [F3], the positive eigenvalues of its and marginals coincide. The entropy formula [F5] therefore gives . Substitute this identity into [F1] to obtain the displayed formula. As the left side of the formula is independent of both the purification and the chosen complement, the right side has the same value for every finite dilation.
Remarks
The equality is a consequence of the purity of the joint reference-output-environment state. It does not require a minimal Stinespring environment.
Depends on
- Complementary channels and coherent information
- Every finite-dimensional channel has a finite isometric dilation
- Finite-dimensional von Neumann entropy
- Ensemble and purification
- Purifications exist and are unitarily equivalent after padding
- Schmidt decomposition
- Partial trace over a finite tensor factor
- Partial trace over the first tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Finite wire permutations are unitary basis permutations
Used by
- Additivity of optimized entanglement-assisted information Lemma
- Coherent information of a qudit erasure channel Lemma
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Complement and degradation maps of the erasure channel Lemma
- Exact flat spectral-type reduction of channel information Lemma
- Finite channel information maxima are attained Lemma
- Flat-input coherent information is achievable by subspace codes Lemma
- Flat-input entanglement-assisted achievability by Weyl coding Lemma
- Private information is an average coherent-information difference Lemma
- Product additivity of coherent and private information Lemma
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- Regularized coherent-information formula for quantum capacity Theorem
Dependency tree · two levels
55 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, Proposition 8.17 and §8.2.2 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §13.5 (standard reference, not scraped)