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.
Exponential averaged spectral projectors for a finite cq ensemble
Statement
For every fixed finite ensemble and fixed , there are constants (depending on this ensemble and , not ) and projectors such that, writing and , and The second pair of algebraic bounds holds for every word, including words with zero sampling probability; no per-word high-acceptance assertion is required.
Facts & Assumptions
Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.
Finite-dimensional von Neumann entropy: Finite-dimensional von Neumann entropy.
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.
Finite classical-quantum states and Holevo information: Finite classical-quantum states and Holevo information.
Taylor's Schlömilch–Roche remainder formula: Taylor's Schlömilch–Roche remainder formula.
The exponential function is smooth and : The exponential function is smooth and .
Markov's inequality for random variables: Markov's inequality for random variables.
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm product law converts product eigenvalues into sums of self-information.
Proof
For , retain product eigenvectors of whose positive eigenvalue has negative logarithm in . For , use product eigenvectors of whose eigenvalue has negative logarithm in . The upper eigenvalue bounds are immediate. The lower retained eigenvalue and trace at most one imply each rank bound. Under the joint law , with zero-probability eigenvalues omitted, the random variable has finite support and mean . By [F7], the negative logarithm of each product eigenvalue is the sum of the coordinate self-information variables, so its IID sum controls the second failure probability exactly. The first failure is the same argument for the spectral law of ; averaging inputs gives .
For completeness, a finite supported centered variable with obeys , by the Taylor remainder and . For small fixed , . Markov's inequality and independence then bound ; the logarithm product law [F7] gives the factor when taking the log of the product moment generating function. Apply the same argument to and add. A constant spectral variable has zero failure probability and needs no division by a range. All logarithms are evaluated only on positive-probability eigenvalues.
Depends on
- Finite-dimensional von Neumann entropy
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Finite classical-quantum states and Holevo information
- Taylor's Schlömilch–Roche remainder formula
- The exponential function is smooth and $(\exp)'=\exp$
- Markov's inequality for random variables
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
Dependency tree · two levels
41 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)