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.
Finite ensemble barycenters are density operators
Statement
For a finite ensemble of density operators on a nonzero finite-dimensional complex-inner-product space , its barycenter is a density operator. Regrouping the finite outcomes into blocks and assigning each block its normalized barycenter when its total weight is positive preserves the overall barycenter; zero-total-weight blocks contribute zero.
Facts & Assumptions
Given: , real weights with , and density operators on .
Ensemble and purification: an ensemble has finite probability weights and density-operator components; its barycenter is their weighted sum.
Density operator: a density operator is non-negative with trace one.
Non-negative and positive operators: a non-negative operator is self-adjoint and has nonnegative quadratic form.
Trace is a linear functional on : matrix trace preserves finite sums and scalar multiples; with The basis-independent trace of an endomorphism of a finite-dimensional vector space, this applies to endomorphism trace in a fixed basis.
Every nonzero finite-dimensional complex inner-product space admits a density operator: every nonzero finite-dimensional complex-inner-product space has at least one density operator.
Proof
Set , the barycenter in [F1]. It is self-adjoint because it is a finite real linear combination of self-adjoint operators. For every , by [F2]–[F3], so is non-negative.
By trace linearity [F4], . Thus is a density operator by [F2].
Let partition the outcome indices and put . If , the weights within block sum to one, so the argument in steps 1.1–2.1, applied to this finite normalized subensemble, shows that is a density operator and .
If , nonnegativity of the weights forces every in . Choose any density operator using [F5]; then . Summing the block identities gives , so regrouping preserves the barycenter, including zero-weight blocks.
Depends on
Used by
- Every finite state ensemble is obtainable from a purification Theorem
- The set of density operators is convex Theorem
Cited to discharge well-definedness by Ensemble and purification.
Dependency tree · two levels
20 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, §2.1.2 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §15.1 (standard reference, not scraped)