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.
Positive-probability Pauli branches are density operators
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 put and . If , then the normalized branch
is a density operator.
Facts & Assumptions
Given: The data in the Statement.
The setup defines , , and when .
Pauli measurement projectors and total probability: is nonnegative and .
Trace is a linear functional on : trace respects multiplication by a scalar.
Density operator: a density operator is a nonnegative endomorphism of trace one on a nonzero finite-dimensional complex-inner-product space.
Proof
Given: The data in the Statement.
Set . By [F2], is nonnegative and has trace . Since , the scalar is positive. Hence, for every , .
By [F3] and [F2], . Thus is a density operator by [F4].
The conditional state in [F1] is exactly , so it is the density operator established in step 2.1.
Sources
Watrous Lesson 14 §14.1, printed pp. 405–407 (PDF pp. 411–413), defines the projective conditional state; de Wolf §20.2, PDF pp. 186–188, gives the Pauli branch update. The positivity and trace-one check is proved locally.
Depends on
Used by
Cited to discharge well-definedness by Pauli measurement branch semantics.
Dependency tree · two levels
22 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)