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.
Pauli projectors define a finite measurement instrument
Statement
Let be a nonzero finite-dimensional complex inner-product space and let be a Hermitian Pauli observable on with . Put and define for . Then the maps form a finite instrument from to . For every density operator on , the outcome weight of branch is .
Facts & Assumptions
Given: The data in the Statement.
The setup gives and the projectors .
Pauli measurement projectors and total probability: , , , and .
Completely positive maps: complete positivity means that for every finite ancilla dimension , the block amplification preserves nonnegative operators.
Finite ancilla amplification is a well-defined block map: if is the block matrix of an operator on , then .
Ordered tensor registers, their inner product, and wire permutations: the ordered product inner product on makes its ancilla basis orthonormal.
Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.
For and , : trace is cyclic for compatible finite-dimensional endomorphisms.
Finite instruments and conditional states: a finite family of completely positive branch maps is an instrument when the sum of their output traces equals the input trace for every operator; its branch weight on a density operator is .
Proof
Given: The data in the Statement.
Each is complex-linear because matrix multiplication distributes over finite sums and scalars: .
Fix , take an orthonormal basis of the ancilla, and write for a nonnegative operator on . Self-adjointness of by [F6] gives : for , by the product pairing [F5]. Consequently the blocks satisfy the same adjoint relation, so is self-adjoint.
For every operator , cyclicity [F7] and idempotence [F2] give . For a density operator , the same calculation gives , the branch trace.
Write and . By [F4] and the product pairing [F5], . Thus the ampliation preserves nonnegative operators. Since was arbitrary, is completely positive by [F3].
The two maps are completely positive by step 2.1 and their total output trace equals the input trace by step 1.3. They therefore form a finite instrument by [F8].
By the branch-weight clause of [F8], the outcome weight on is . Step 1.3 identifies this with .
Sources
Watrous Lesson 14 §14.1, PDF pp. 405–407, treats the two Pauli branches as a projective measurement; de Wolf §20.2, PDF pp. 186–188, gives their branch maps and probabilities. Complete positivity and trace preservation are verified locally from the block definition and the two projector identities.
Depends on
- Pauli measurement branch semantics
- Pauli measurement projectors and total probability
- Finite instruments and conditional states
- Completely positive maps
- Finite ancilla amplification is a well-defined block map
- Ordered tensor registers, their inner product, and wire permutations
- Non-negative and positive operators
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by Pauli measurement branch semantics.
Dependency tree · two levels
39 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, Understanding Quantum Information and Computation, Lesson 14 §14.1 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §20.2 (standard reference, not scraped)