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 right-module endofunctor category is strict monoidal
Statement
For every monoidal category , the category of The category of right-module endofunctors is a strict monoidal category under composition of endofunctors.
Facts & Assumptions
Given: The category of right-module endofunctors on a monoidal category .
An object of is a pair with a coherent natural isomorphism , and a morphism is a natural transformation compatible with those structure maps (The category of right-module endofunctors).
A strict monoidal category is a monoidal category whose associator and unitors are identities and whose tensor is literally associative and unital on objects (Strict monoidal category).
Proof
For objects and of , define with . The axioms from [L1] for and imply the same associativity and unit equations for , so is again an object of . For morphisms and , define . The equality is naturality, and the module-compatibility equation follows from the corresponding equations for and .
Let be the identity functor on with structure map . Then is an object of and acts as a two-sided unit for the tensor just defined.
Composition of endofunctors is literally associative and unital, so and as equalities of objects. The induced structure maps agree term by term from the definition in step 1.1, so the associator and unitors are identities.
Step 2.1 verifies the strictness clause of [L2], so is strict monoidal under composition.
Depends on
Used by
- Mac Lane strictification Theorem
Dependency tree · two levels
6 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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, display (2.40) (standard reference, not scraped)