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.
A commuting outer scalar action descends to a tensor product
Statement
Let be a right -module and let be an -bimodule. There is a unique right -module structure on satisfying
Dually, if is an -bimodule and is a left -module, there is a unique left -module structure satisfying
If both outer actions are present, they commute, so the tensor product is an -bimodule in the evident handed situation.
Facts & Assumptions
Given: A right -module , an -bimodule , and, for the dual assertion, an -bimodule and a left -module .
In a bimodule the left and right scalar actions commute: (-bimodules and commuting left and right scalar actions).
Every balanced pairing into an abelian group induces a unique homomorphism from the tensor product (Universal property of the tensor product for balanced maps into abelian groups).
An elementary-tensor prescription descends exactly when the corresponding pairing is balanced (A formula on elementary tensors defines a homomorphism exactly when its underlying pairing is balanced).
Proof
For fixed , the pairing is additive in both variables and is balanced because by [L1].
The left-handed construction is identical: for fixed , the pairing is balanced by the commuting actions, and the induced maps satisfy the left module laws on elementary tensors.
By [L2] and [L3], step 1.1 induces an additive endomorphism of with .
On every elementary tensor one has , , and , using the right -module laws of . In each identity the two sides are additive maps that induce the same balanced pairing, so uniqueness in [L2] makes them equal on all . Thus step 2.1 defines a right -module structure.
When a left -action and a right -action are both present, on elementary tensors, so the actions commute.
The formulas determine every action map on generators, so uniqueness follows from [L2].
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 33 results over 9 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)