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.
Faithful State Dominates Positive Operator
Statement
Let be finite-dimensional, let be a density operator that is positive definite on , and let be a non-negative endomorphism of . Then there is a finite real such that .
Facts & Assumptions
Given: A finite-dimensional complex inner-product space , a faithful density operator , and .
A density operator is non-negative; faithfulness on means its restriction to is positive definite (Density operator). This current draft definition is present, but its declared existence supplier remains unresolved.
A non-negative operator has an orthonormal eigenbasis with nonnegative eigenvalues; positive definiteness makes every eigenvalue strictly positive (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, Non-negative and positive operators).
Non-negativity is characterized by nonnegative quadratic forms, so means for every (Non-negative and positive operators).
Proof
Diagonalize and let be its largest eigenvalue; if , take . Diagonalize and let be its smallest eigenvalue, which is positive by faithfulness and [F2]. For every , these spectral bounds give and .
Set . Then is finite and nonnegative, and for every step 1.1 gives . By [F3], , which is exactly . This also covers with .
Depends on
Used by
- Singular Pair No Broadcasting Theorem
Dependency tree · two levels
14 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 (standard reference, not scraped)