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.
Exact flat spectral-type reduction of channel information
Statement
Let be a finite-dimensional channel, let , and let be a state on . Fix a finite Stinespring dilation of and its complementary channel. For each integer there is an exact decomposition into mutually orthogonal flat spectral-type states, with at most positive-weight types and . For the fixed complement and its tensor powers, Thus in each inequality some flat type state attains at least the displayed lower bound.
Facts & Assumptions
Given: The channel , its fixed finite Stinespring dilation and complementary channel, and the state on its input space . The finite type variable has probabilities and natural-log Shannon entropy .
Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.
Complementary channels and coherent information: Complementary channels and coherent information.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.
Coherent information equals output entropy minus environment entropy: for the fixed dilation.
Finite distributions, entropy, divergence, and stochastic matrices and Nonnegativity and equality for finite classical relative entropy: , and for finite probability vectors.
Proof
Write , including zero eigenvalues. For each count vector with , let be the number of product basis words of that type, (zero if any such ), and omit types with . Let project onto the span of the words of type and set . These states are flat, their supports are mutually orthogonal, and There are at most types. If is their number and is the uniform law on them, [F6] gives , so . Since , the logarithm product law [F5] and yield
Let and , with averages and . By [F4], the receiver-minus-environment entropy identity applies to each type. The upper entropy-excess bound [F1] gives , while its lower entropy-excess bound gives . Product spectral decompositions and [F5] give . Hence Adding from step 1.1 gives the second inequality.
Each displayed left side in step 2.1 is an average over the finite positive-probability types, so at least one type attains at least the corresponding average lower bound. These are exact finite- estimates; no replacement of fixed-dimensional continuity by a uniform bound is involved.
Depends on
- Entropy bounds for a finite mixture of states
- Complementary channels and coherent information
- Coherent information equals output entropy minus environment entropy
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- Finite distributions, entropy, divergence, and stochastic matrices
- Nonnegativity and equality for finite classical relative entropy
Used by
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 Watrous, The Theory of Quantum Information (standard reference, not scraped)
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel (standard reference, not scraped)