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.
Trace Distance Range And Equality
Statement
For finite-dimensional density operators , Moreover, iff , and iff their supports are orthogonal.
Facts & Assumptions
Given: Density operators on a finite-dimensional complex Hilbert space.
Density operators are non-negative with trace one (Density operator). The current QC03 definition is present as a draft; its declared existence supplier is still unresolved.
If is Hermitian with trace zero, then its positive and negative spectral parts have equal trace (Hermitian Trace Norm Positive Negative Parts).
For nonnegative , write . If is an orthogonal projection and , cyclicity gives , a sum of squared coordinate moduli, so . The positive spectral decomposition gives , hence (For and , , A non-negative operator has a unique non-negative square root, 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).
Proof
Let . Since , [L1] gives , proving the lower bound.
If , then and acts as on , as on , and as zero on the orthogonal complement. Hence and .
Let project onto the strictly positive eigenspaces of . Then and . The first inequality uses by [L2], and the last follows from by [L2] and .
If , [F1] gives , so definiteness of the trace norm gives . Conversely equal states have distance zero by [F1].
Conversely, if , then both inequalities in step 2.1 are equalities: and . Thus and . Applying [F3] to each positive operator gives and , so and . These subspaces are orthogonal.
Depends on
- Trace Distance
- Density operator
- 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 non-negative operator has a unique non-negative square root
- Hermitian Trace Norm Positive Negative Parts
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
Used by
Dependency tree · two levels
31 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)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (updated July 2015) (standard reference, not scraped)