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.
Finite iterated tensor products represent multilinear maps independently of parenthesization
Statement
Let be a commutative ring and let be a finite list of -modules. Any parenthesized tensor product
represents -multilinear maps from : for every -module , composition with is a bijection from to the set of multilinear maps into . Different parenthesizations are connected by the unique isomorphism preserving pure tensors.
For , take and identify zero-variable multilinear maps with chosen elements of . For , take .
Facts & Assumptions
Given: A commutative ring , a finite list of -modules, and an -module .
The binary tensor product represents balanced, hence over a commutative ring bilinear, maps (Universal property of the tensor product for balanced maps into abelian groups).
Tensor products over a commutative ring have canonical symmetry and associativity isomorphisms preserving elementary tensors (Symmetry and associativity isomorphisms for tensor products over a commutative ring).
The regular module is a tensor unit (The regular module is a tensor unit: and ).
Proof
For , an -linear map is uniquely determined by the image of , and every defines such a map by ; this is the required representation of maps from the one-point empty product.
For , the identity represents linear maps from by composition.
Assume a parenthesized product represents -linear maps. A -linear map is equivalently a bilinear map : first use the induction bijection with the last variable fixed, and then use multilinearity to see that the resulting dependence on the last variable is linear.
By [L1], the bilinear maps in step 1.3 correspond uniquely to linear maps , proving the representing property for .
By [L2], any two parenthesizations are joined by composites of elementary associativity isomorphisms preserving pure tensors. Any two such comparison maps agree on every pure tensor, so the representing uniqueness proved in step 2.1 makes them equal.
The base cases and induction step establish the representation for every finite , including the empty and singleton cases, and step 3.1 proves independence of parenthesization.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 11 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
- Stacks Project, Section 10.12: Tensor products (standard reference, not scraped)