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 partial trace is characterized by the trace pairing and is basis-independent
Statement
For finite-dimensional complex inner-product spaces , the partial trace is the unique linear map satisfying
Here is the identity map on ; is the notation defined in Partial trace over a finite tensor factor.
Its coordinate formula is independent of the chosen ordered orthonormal basis of . The assertion includes zero-dimensional factors.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an operator , and the partial trace from Partial trace over a finite tensor factor.
In ordered orthonormal bases, , with an empty sum equal to (Partial trace over a finite tensor factor).
The tensor map sends each elementary tensor to (Tensor products of finitely many linear maps).
The product basis is an orthonormal basis and spans the tensor space, including the empty-basis cases (The product basis is orthonormal and tensor dimensions multiply).
The trace of a finite-dimensional endomorphism is the sum of its diagonal matrix entries in any ordered basis, including the zero-dimensional case (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace as the sum of the diagonal entries).
If for every endomorphism of a finite-dimensional complex vector space, then (The trace pairing on a finite endomorphism space is nondegenerate).
Matrix products are row-by-column finite sums and trace is the sum of diagonal entries (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes, The trace as the sum of the diagonal entries).
Every finite-dimensional real or complex inner-product space has an orthonormal basis, with the empty basis in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis).
Identity maps and compatible composites of linear maps are linear (Identity maps and composites of linear maps are linear).
Proof
By [F8], choose ordered orthonormal bases of and of , and set . For any , [F1], [F6] and [F7] give .
The identity is linear by [F9], so [F2] defines the linear map ; its composite with is linear by [F9]. In the product basis, [F2] gives the matrix entry of . By [F6] and [F7], , which is the same finite sum as in step 1.1. Thus satisfies the displayed trace identity.
If is any other map value at satisfying the identity for every , then for every . Apply [F5] on to obtain . Since this holds for every , the trace identity characterizes the partial-trace map uniquely.
Repeat steps 1.1 and 2.1 with any other ordered orthonormal basis of . The right-hand side is the trace of the same endomorphism , and [F4] makes that trace basis-independent. Step 3.1 then forces the resulting partial-trace operator to equal .
If , the product space and are zero, [F1] is the empty sum, and both sides of the trace identity are . If , the input and output endomorphism spaces contain only the zero map, so the same identity and uniqueness hold.
Depends on
- Identity maps and composites of linear maps are linear
- Partial trace over a finite tensor factor
- Tensor products of finitely many linear maps
- The product basis is orthonormal and tensor dimensions multiply
- Linear map between vector spaces over the same field
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- $[S\circ T]_{\mathcal B}^{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}$
- The trace pairing on a finite endomorphism space is nondegenerate
- Every finite-dimensional real or complex inner product space has an orthonormal basis
Used by
- Partial trace over the first tensor factor Definition
- Qubit dephasing channel in Kraus and Choi forms Example
- Register endianness and a two-qubit partial trace Example
- A finite verifier induces an effect on its witness Lemma
- Compression dimension bounds entanglement fidelity Lemma
- Fidelity classical measurement minimum Lemma
- Optimal Cloner Attains Bound Lemma
- Partial trace contracts the trace norm on Hermitian operators Lemma
- Partial trace contracts trace distance Lemma
- Positive Marginals Imply Joint Support Lemma
- An isometry followed by partial trace is a channel Theorem
- Every finite state ensemble is obtainable from a purification Theorem
- Every finite-dimensional channel has a finite isometric dilation Theorem
- Fidelity Data Processing Theorem
- Fidelity Purification Characterization Theorem
- Finite quantum mutual information identities and the Holevo identity Theorem
- Full Rank Pair No Broadcasting Theorem
- Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels Theorem
- Purifications exist and are unitarily equivalent after padding Theorem
- State Family No Broadcasting Iff Commuting Theorem
- The Choi partial trace characterizes trace preservation Theorem
- The least purification environment dimension is the density rank Theorem
- The partial trace preserves non-negativity and total trace Theorem
- The partial-output acceptance law is a finite probability law Theorem
Cited to discharge well-definedness by Partial trace over a finite tensor factor.
Dependency tree · two levels
32 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 (standard reference, not scraped)