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.
Associative and graded bimodule tensor–Hom adjunction
Statement
Let and be graded -algebras, let be a graded -bimodule, a graded left -module and a graded left -module. Then currying
is a natural bijection in and , where is the graded left -module of finite sums of homogeneous -linear maps with the associative action . Its inverse sends to the map on elementary tensors.
Separately, the same formulas give a natural bijection between ungraded module maps. Here is the direct sum of its homogeneous parts and can be properly contained in , so the graded statement cannot be replaced by one with all ungraded maps on the right.
Facts & Assumptions
Given: Graded -algebras , a graded -bimodule , a graded left -module and a graded left -module .
consists of the finite sums of homogeneous -linear maps, carries the graded left -module structure , and is a graded left -module with the grading by total degree and action ; the inclusion can be proper (Graded balanced tensor product and homogeneous Hom).
The outer actions on a balanced tensor product are the unique ones with and (A commuting outer scalar action descends to a tensor product).
A balanced pairing into an abelian group induces a unique additive map out of the tensor product, and elementary tensors generate the tensor product (Universal property of the tensor product for balanced maps into abelian groups).
Proof
Let be a degree-zero -linear map and define by . For fixed the map is additive and -linear, because is additive and is mapped to by [L1]; it is homogeneous of degree when , since makes of degree and degree-zero, so , and a general has finitely many nonzero components. Moreover is -linear and degree-zero: for , so , and shows that preserves degrees. Hence .
Conversely, let be a degree-zero -linear map and define on elementary tensors. The pairing is additive in each variable and balanced: for the -linearity of and the action of [L1] give , so the two images of and agree. By [L3] there is a unique additive map with that value on elementary tensors; it is -linear because each is, and degree-zero because is homogeneous of degree for homogeneous of degree , so gives . Hence .
The two constructions are inverse. For as in step 1.1, the map sends to , so it agrees with on elementary tensors and hence, by [L3], everywhere. For as in step 2.1, for all , so . Thus is a bijection with inverse .
The bijection is natural in and : for degree-zero -linear and degree-zero -linear , and , both and the map induced by and on the right-hand side are -linear and -linear and both send a pair to , since ; because these values agree for all and , the two curried maps are equal.
Dropping every degree condition, the formulas of steps 1.1 to 3.1 define mutually inverse bijections between and : well-definedness, -linearity and -linearity were the only properties used, and they do not require homogeneous elements. Consequently is exactly the set of ungraded -linear maps whose values are finite sums of homogeneous maps and that preserve degrees, and by [L1] this set can be strictly smaller than .
Steps 3.1 and 4.1 give the natural bijection with the displayed formulas and the associative left action , and step 4.2 gives the separate ungraded bijection while recording that need not contain all ungraded -linear maps. ∎
Depends on
Used by
Dependency tree · two levels
11 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
- Stacks Project, Algebra, §10.12, tag 00CV (standard reference, not scraped)
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras (2009), §2.2, printed pp. 6-7 (standard reference, not scraped)