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.
Mac Lane strictification
Statement
Let be a monoidal category. Then the assignment defines a strong monoidal functor from to the strict monoidal category of The category of right-module endofunctors, and is a monoidal equivalence. Consequently every monoidal category is monoidally equivalent to a strict monoidal category.
Facts & Assumptions
Given: A monoidal category and its right-module endofunctor category .
An object of is a functor together with coherent isomorphisms , and a morphism in is a natural transformation compatible with those structure maps (The category of right-module endofunctors).
The category is strict monoidal under composition (The right-module endofunctor category is strict monoidal).
A monoidal equivalence is a strong monoidal functor whose underlying functor is an equivalence of categories with monoidal quasi-inverse data (Monoidal equivalence and monoidal quasi-inverse data).
A functor is an equivalence exactly when it is fully faithful and split essentially surjective (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).
Every equivalence can be equipped with adjoint-equivalence data (Every equivalence of categories can be equipped as an adjoint equivalence).
A fully faithful functor reflects isomorphisms (Every fully faithful functor reflects isomorphisms).
Proof
For each object of , put . The pentagon and triangle axioms of are exactly the coherence and unit equations required in [L1], so is an object of . For a morphism , define . Naturality of the associator shows that is a morphism in .
The functor is split essentially surjective. For an object of , let and define . Each is an isomorphism because both factors are, and naturality of together with its coherence equations makes a morphism in .
The unit comparison for is the natural isomorphism , and the binary comparison has component . The same pentagon and triangle identities show these are morphisms in , so is strong monoidal into the strict monoidal target of [L2].
The functor is faithful. If , then their components at the unit object agree, and composing with the right unitors gives .
The functor is full. Given a morphism in , define . The compatibility equation from [L1], evaluated at , identifies with after the unitors are inserted, so .
By steps 2.2-3.1 and [L4], the underlying functor of is an equivalence of categories. By [L5], choose an adjoint-equivalence quasi-inverse with natural isomorphisms and .
Use full faithfulness of to define the binary comparison as the unique morphism whose image under is Define uniquely by Naturality of and makes the displayed images natural in , so faithfulness of makes natural. Both comparisons are isomorphisms by [L6].
Apply the faithful functor to the associativity and unit diagrams for . By their defining formulas, the images reduce to the coherence diagrams for the strong monoidal functor together with naturality of , so they commute. Thus is strong monoidal, and the defining equations in step 5.1 say exactly that is monoidal. The triangle identity gives ; since the inverse of a monoidal natural isomorphism is monoidal, faithfulness of then verifies the binary and unit equations for . Hence is monoidal. The data therefore satisfy [L3], so is a monoidal equivalence to the strict monoidal category .
Depends on
- The category of right-module endofunctors
- The right-module endofunctor category is strict monoidal
- Monoidal equivalence and monoidal quasi-inverse data
- A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice
- Every equivalence of categories can be equipped as an adjoint equivalence
- Every fully faithful functor reflects isomorphisms
Used by
- Strictification of a cartesian monoidal category computed Example
- Every monoidal category is strictly monoidally isomorphic to a strict one False statement
- Strictification gives equivalence, not on-the-nose identification Remark
- Strictification itself costs no Choice; choosing a skeleton can Remark
- The historical route to coherence and the route authored here Remark
- Mac Lane coherence in canonical-map form Theorem
- The monoid-object axioms may be written without associators Theorem
Dependency tree · two levels
18 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
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.3, Theorem 1 (standard reference, not scraped)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Theorem 2.8.5 (standard reference, not scraped)