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 measurement projectors and total probability
Statement
Let be a nonzero finite-dimensional complex inner-product space, let be a density operator on , and let be a Hermitian Pauli observable on with . For set
Then are complementary orthogonal projections and , with .
Facts & Assumptions
Given: A Hermitian Pauli observable with and a density operator on the same finite-dimensional register.
The setup defines and .
Density operator: is positive semidefinite and .
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: matrix products have entries , and has entries .
For and , : for compatible finite matrices, , including square matrices of the same size.
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: a nonnegative endomorphism has an orthonormal eigenbasis with nonnegative real eigenvalues.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is basis-independent and equals the matrix trace in any ordered basis.
Proof
Given: The data in the Statement.
For , because is real and . In any ordered basis write . By [F2], . Since , this equals . Thus both are self-adjoint idempotents.
Direct multiplication gives and . Hence their ranges are orthogonal and sum to the full register.
Put . Self-adjointness of and gives , so is self-adjoint. For every vector , , using the root-linear-first inner-product convention. Therefore is positive semidefinite.
By cyclicity [F3] and , . In the orthonormal eigenbasis supplied by [F4], the diagonal entries of are nonnegative; [F3] and [F5] therefore give . Linearity of the finite diagonal sum and give .
Sources
The two projectors and the two-outcome probabilities are treated in de Wolf, §20.2, PDF pp. 186–188, and Watrous, Lesson 14 §14.1, printed pp. 405–407 (PDF pp. 411–413). The finite-dimensional trace manipulations above are proved locally from the cited matrix trace suppliers.
Depends on
- Pauli measurement branch semantics
- Density operator
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The vector space $M_{m \times n}(F) := F^{\,m \times n}$ of $m$ by $n$ matrices over a field, with entrywise operations
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
Used by
- Finite adaptive Pauli-measurement circuit tree Definition
- An anticommuting stabilizer measurement is fair Lemma
- Pauli projectors define a finite measurement instrument Lemma
- Positive-probability Pauli branches are density operators Lemma
- Zero-probability Pauli measurement branch Lemma
- Phase-aware tableau measurement agrees with the projective instrument Theorem
Cited to discharge well-definedness by Pauli measurement branch semantics.
Dependency tree · two levels
33 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
- Ronald de Wolf, Quantum Computing: Lecture Notes, §20.2 (standard reference, not scraped)
- John Watrous, Understanding Quantum Information and Computation, Lesson 14 (standard reference, not scraped)