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.
Under , tensor contraction is the trace
Statement
Let be a finite-dimensional vector space over . Under the isomorphism
the contraction map , defined by , corresponds to the trace .
Facts & Assumptions
Given: A finite-dimensional -vector space and the canonical Hom-tensor isomorphism with .
The canonical isomorphism sends to the rank-one endomorphism (For finite-dimensional , the canonical map is an isomorphism).
The trace of an endomorphism is the sum of the diagonal entries of its matrix in any basis, and is zero in dimension zero (The basis-independent trace of an endomorphism of a finite-dimensional vector space).
A bilinear pairing induces a unique linear map from a tensor product (Universal property of the tensor product for balanced maps into abelian groups).
Proof
Evaluation is bilinear, so [L3] induces the linear contraction map with .
Choose a basis of and write . For , the coefficient of in is .
If , the tensor product and endomorphism space are zero and both maps are the zero map by [L2].
By [L2], .
Matrix diagonal sums are linear, so trace is linear by [L2]. Therefore trace after [L1] and contraction are linear maps inducing the same bilinear pairing by step 2.1; uniqueness in [L3] proves that they agree everywhere.
Thus tensor contraction is precisely trace under the canonical isomorphism, including the zero-dimensional case.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 57 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- C. Dennis, Week 1 recap on tensor products (standard reference, not scraped)