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.
Instrument branch Kraus families satisfy total normalization
Statement
Let be a finite instrument from a nonzero finite-dimensional complex inner-product space to a finite-dimensional complex inner-product space . Suppose that for every a finite Kraus family represents . Then
Facts & Assumptions
Given: The finite instrument and, for each observed outcome , a finite Kraus representation of its branch map.
Finite instruments and conditional states: for every .
Finite Kraus representation: for every input operator .
Trace is a linear functional on and For and , : trace is linear and for compatible rectangular maps , .
The trace pairing on a finite endomorphism space is nondegenerate: if and for every , then .
Proof
Put . For every , [F1]–[F3] give .
Cyclicity in [F3] gives for every . Apply [F4] to to obtain , which is the stated normalization. This proof uses the exact trace-pairing lemma The trace pairing on a finite endomorphism space is nondegenerate and does not use a channel characterization.
Remarks
The result is specific to the sum of the branches of an instrument. Its proof uses the instrument trace identity directly and does not depend on the separate QC05 trace-preserving Kraus theorem.
Depends on
- Finite instruments and conditional states
- Finite Kraus representation
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- Trace is a linear functional on $M_n(F)$
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- The trace pairing on a finite endomorphism space is nondegenerate
Used by
Dependency tree · two levels
25 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 Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information (2018 author-hosted draft), §§2.2.2 and 2.3.2 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution (standard reference, not scraped)