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.
Unitary conjugation is a channel
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be a unitary map. Then is a channel. For any nonzero finite-dimensional complex inner-product space and unitary map , ; the inverse channel to is .
Facts & Assumptions
Given: The finite-dimensional spaces and unitary maps specified in the Statement.
Unitary conjugation map: , and a unitary map is a surjective linear isometry satisfying and .
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
Trace preservation is Kraus normalization: a Kraus map is trace-preserving exactly when its adjoint-square sum is the input identity.
Finite-dimensional quantum channel: a channel is completely positive and trace-preserving on all input operators.
Adjoints satisfy , , , and : adjoints reverse compositions.
Proof
The single-operator family is a Kraus representation of by [F1]. Hence the map is completely positive by [F2]; its adjoint-square sum is by [F1], so it is trace-preserving by [F3]. It is a channel by [F4].
The composite is surjective and norm-preserving because both and are; hence is a unitary map by [F1]. For every , [F1] and [F5] give . Thus . Also is a unitary map: for , [F1] gives , so preserves norms, and it is onto because . Applying the composition identity to and in both orders shows that is a two-sided inverse. It is a channel by step 1.1 applied to .
Depends on
- Real and complex inner-product spaces and their induced length
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Finite-dimensional quantum channel
- Unitary conjugation map
- A finite Kraus sum is completely positive
- Trace preservation is Kraus normalization
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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), §2.2.1 (standard reference, not scraped)