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 trace pairing on a finite endomorphism space is nondegenerate
Statement
Let be a finite-dimensional complex vector space. If is linear and for every linear map , then . Equivalently, the trace pairing has the property that its only first input pairing to zero with every second input is . This includes the zero space.
Facts & Assumptions
Given: A finite-dimensional complex vector space and an endomorphism .
A finite-dimensional vector space has a finite ordered basis; dimension zero means the space is the zero space (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
An endomorphism is a linear map , and its matrix records the coordinates of its images on an ordered basis (Linear map between vector spaces over the same field, Coordinate columns and matrices of linear maps relative to ordered bases).
A matrix unit has its only nonzero entry, , at row and column (Matrix units and the Kronecker delta).
Matrix multiplication is row-by-column and the matrix 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).
The trace of an endomorphism is the matrix trace in any ordered basis, including trace on the zero space (The basis-independent trace of an endomorphism of a finite-dimensional vector space).
Every vector has a unique coordinate list in an ordered basis (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
Proof
If , [F1] gives , so its only endomorphism is . Assume henceforth and choose an ordered basis.
If every entry of the matrix of were zero, [F2] would make vanish on every basis vector and hence on every vector. Thus if there are indices with matrix entry . Define using the ordered basis chosen in step 1.1. Unique coordinates [F7] make this well-defined; for scalars and vectors with coordinate lists and , the coordinate list of their linear combination is , so the formula gives . Thus is an endomorphism. Its matrix sends to and every other basis vector to , so that matrix is .
By [F4], the matrix of is . Row-by-column multiplication [F5] gives , so every diagonal entry is except the entry, which is . By [F6], . This contradicts the hypothesis for every . Therefore , including the zero-dimensional case from step 1.1.
Depends on
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear map between vector spaces over the same field
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
- $[S\circ T]_{\mathcal B}^{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}$
- Matrix units $E_{ij}$ and the Kronecker delta
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
Used by
Dependency tree · two levels
38 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)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Appendix A.7 (standard reference, not scraped)