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.
The finite POVM law is a probability kernel
Statement
For a finite POVM on a nonzero finite-dimensional complex inner-product space , the assignment
is a probability kernel from the matrix-coordinate Borel density set to the finite outcome set . For every event , the function is affine on , meaning it preserves every convex combination with .
Facts & Assumptions
Given: A nonzero finite-dimensional complex-inner-product space , a finite nonempty outcome set , and a finite POVM .
Finite POVM outcome kernel: carries the matrix-coordinate subspace Borel -algebra; carries all subsets; .
POVM outcome weights are probabilities: for each density , the weights are nonnegative and sum to one.
Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space is a finite outcome set with nonnegative weights summing to one, and an event's mass is the sum of its outcome weights.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is matrix trace in any basis; in the chosen coordinates it is the sum of diagonal entries.
Trace is a linear functional on : and .
Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.
Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: matrix products are row-by-column finite sums, so in finite coordinates.
Proof
Fix . By [F2], the weights are nonnegative and sum to one, so [F3] gives a finite probability space on . Its probability for an event is , which equals by [F1]. Thus the kernel value at each input is a probability measure on the finite outcome set.
Fix and use the ordered basis defining the matrix coordinates. In those coordinates, each summand is by [F4] and the row-by-column product formula [F8]; it is a finite linear combination of coordinate projections . The projections are continuous in the matrix-coordinate topology, so each summand and the finite sum are continuous.
For every open , continuity in step 1.2 makes open and hence Borel. The collection of subsets for which is Borel is a -algebra, because inverse images preserve complements and countable unions; it contains every open set by the same continuity. It therefore contains the Borel -algebra, proving that is Borel measurable.
Let and . Put . Since and are real and are self-adjoint by [F6]–[F7], for every one has . Thus is self-adjoint; also , so is nonnegative by [F7]. It has trace one by [F6] and [F5], so it lies in . Applying [F5] to the finite sum in [F1] gives . This proves affinity.
Depends on
- Finite POVM outcome kernel
- POVM outcome weights are probabilities
- Finite probability spaces, outcome weights, events, and event probabilities
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- Trace is a linear functional on $M_n(F)$
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Density operator
- Non-negative and positive operators
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by Finite POVM outcome kernel.
Dependency tree · two levels
27 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.3.1 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution, §3.1.2 (standard reference, not scraped)