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.
The finite-dimensional erasure map is a quantum channel
Statement
For every integer and , the map defined in Finite-dimensional quantum erasure channel is a finite-dimensional quantum channel.
Facts & Assumptions
Given: A -dimensional complex inner-product space , , and .
Finite-dimensional quantum erasure channel: with , and .
An isometry followed by partial trace is a channel: if is a finite-dimensional linear isometry, then is a quantum channel.
Partial trace over a finite tensor factor and Ordered tensor registers, their inner product, and wire permutations: partial trace sums matching diagonal environment coordinates in the ordered product basis.
Proof
Let with a unit vector orthogonal to the data summand, and write for the data inclusions. Define . The summands lie in orthogonal subspaces of , so for all , . Thus is a linear isometry, including at and .
Expanding gives two diagonal terms and two cross terms. The first diagonal term is , whose partial trace over is . The second is , whose partial trace is . Each cross term has a partial-trace coefficient equal to the inner product of the orthogonal erasure flag with the data subspace, hence vanishes. Therefore for every .
By step 1.1, is an isometry; [F2] says its partial-trace map is completely positive and trace-preserving on the full operator space. Step 2.1 identifies that map with , proving the Statement.
Depends on
- Finite-dimensional quantum erasure channel
- An isometry followed by partial trace is a channel
- Isometric Stinespring representation
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Partial trace over a finite tensor factor
- Ordered tensor registers, their inner product, and wire permutations
Used by
- Complement and degradation maps of the erasure channel Lemma
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
Cited to discharge well-definedness by Finite-dimensional quantum erasure channel.
Dependency tree · two levels
36 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, §8.3.2 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §24.7.1 (standard reference, not scraped)