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 Marginals Imply Joint Support
Statement
Let be finite-dimensional, let act on , and let be a subspace. If both partial-trace marginals of are supported on , then ; equivalently, , where is the orthogonal projection onto .
Facts & Assumptions
Given: A finite-dimensional complex Hilbert space , on , a subspace , and .
For any non-negative finite-dimensional operator , define ; equality follows from self-adjointness (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).
The partial trace is characterized by , independently of the auxiliary orthonormal basis (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent). The QC02 definition and characterization theorem are present as draft carriers; the trace-pairing identity gives the displayed marginal trace rule by cyclicity.
is the orthogonal projection onto ; it is idempotent and . It is self-adjoint because the orthogonal decomposition gives for all (The orthogonal projection is the -component in , Orthogonal projection is linear, and an orthonormal basis of gives ). Hence and .
Tensor maps act factorwise and preserve composition, so operators acting on different tensor factors commute and (Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root). If such an operator has trace zero, diagonalize it in an orthonormal eigenbasis with nonnegative eigenvalues; trace is their sum, so every eigenvalue is zero and the operator is zero (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, The basis-independent trace of an endomorphism of a finite-dimensional vector space).
Proof
Let . By [F1], the range of lies in , so and . By [L1], . Cyclicity of trace rewrites this as . Since [L2] gives , the operator inside the trace is for ; [F2] makes it zero, hence because . Thus , and .
Applying the same argument to the second marginal with the projection gives .
The two commuting projections and have product by [L3]. Combining step 1.1 and step 2.1 yields , so the range and hence the support of lies in .
Depends on
- Partial trace over a finite tensor factor
- The partial trace is characterized by the trace pairing and is basis-independent
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- Orthogonal projection is linear, and an orthonormal basis $(e_i)$ of $W$ gives $P_Wv=\sum_i\langle v,e_i\rangle e_i$
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Tensor maps preserve composition, identities, and adjoints
- Non-negative and positive operators
- 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
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
Used by
- Singular Pair No Broadcasting Theorem
Dependency tree · two levels
45 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)