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.
Strictification and Mac Lanes Coherence Theorem
1 · Prerequisites
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Limits and Colimits
- Monoidal Categories and Monoidal Functors
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
This page fixes the coherence theorem in its canonical-map form and proves it by the strictification route. The free word category is still recorded, but it is a reformulation after the strictification argument rather than the proof engine.
The scope boundary is sharp. Coherence compares only canonical morphisms built from associators and unitors between parenthesisations of one ordered tensor string. It does not say that arbitrary diagrams commute, it does not identify equivalence with isomorphism, and it does not fold skeletal replacement into strictification.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Canonical morphisms between parenthesised tensor words
Definition
Let and be parenthesised tensor words on the same ordered letters (Parenthesised tensor words and their evaluation functors) and let be their evaluation functors in a monoidal category (Monoidal category).
A canonical morphism from to is a natural transformation (Natural transformation and its components) belonging to the smallest class closed under:
- identities ;
- the associator, left unitor, and right unitor of , together with their inverses, whenever their source and target are evaluation functors of parenthesised words;
- tensoring a canonical morphism with an identity natural transformation on the left or right, whenever the resulting source and target still come from parenthesised words;
- vertical composition of canonical morphisms.
Thus a canonical morphism is built only from the structural isomorphisms , their inverses, identities, tensoring with identities, and composition. No arbitrary morphism of is canonical merely because its source and target happen to be tensor products of the same objects.
Why 'every diagram commutes' is false as stated
Remark
Mac Lane's coherence theorem is not the slogan that every diagram in a monoidal category commutes. The theorem speaks only about diagrams whose arrows are canonical in the sense of Canonical morphisms between parenthesised tensor words and whose vertices are formal parenthesisations of one ordered tensor word.
The warning matters because formally different vertices can evaluate to the same object in a particular monoidal category. Once that happens, one may insert a noncanonical endomorphism of that object, and there is no reason for the resulting square or polygon to commute. So the theorem is about formal structural maps, not arbitrary parallel arrows.
The category of binary words
Definition
The binary words are generated recursively from:
- the empty word ;
- the one-letter word ;
- if and are binary words, a new word .
Their length is defined recursively by
The category of binary words has these words as objects. For objects ,
Composition and identities are forced by this rule: when the hom-collection is nonempty there is exactly one possible composite and exactly one possible identity arrow. Thus is a category in the sense of Category, object, morphism, domain, codomain, identity, composition, and hom-collection.
The category of binary words is monoidal
Statement
The category of The category of binary words is monoidal with tensor product , unit object , and structural isomorphisms given by the unique arrows between binary words of the same length.
Facts & Assumptions
Given: The category of binary words.
In , there is exactly one morphism when , and none otherwise (The category of binary words).
A monoidal category needs a bifunctor, a unit object, natural isomorphisms , and the pentagon and triangle identities (Monoidal category).
Proof
If and exist in , then and , so . Define to be the unique morphism . Because all such morphisms are unique when they exist, this tensor preserves identities and composition automatically.
For words , the source and target of have the same lengths, so [L1] gives unique arrows , , and . Their reverse arrows also exist uniquely, so these are isomorphisms.
The two sides of the pentagon are morphisms in from one fourfold word to another of length . By [L1] there is only one such morphism, so the pentagon commutes. The same uniqueness argument gives the triangle identity.
Steps 1.1-2.1 supply exactly the data required in [L2], so is monoidal.
The category of right-module endofunctors
Definition
Let be a monoidal category (Monoidal category).
The category of right-module endofunctors has:
- objects given by pairs where is a functor (Covariant functor, identity functor, composite functor, and contravariant functor) and is a natural isomorphism (Natural isomorphism) in and such that and
- morphisms given by natural transformations (Natural transformation and its components) satisfying for all objects .
Identities and composition are inherited from natural transformations: the identity transformation satisfies the compatibility equation immediately, and if and are compatible, then substituting their two equations shows that is compatible as well. Associativity and the identity laws are therefore inherited from vertical composition of natural transformations.
Thus an object of is an endofunctor equipped with a coherent way to slide a tensor factor on the right through the functor.
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.
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 .
Strictification gives equivalence, not on-the-nose identification
Remark
Mac Lane strictification proves that every monoidal category is equivalent to a strict one, not that it is already strict after a harmless renaming of objects. This is exactly the distinction highlighted by Isbell's warning that isomorphic objects cannot simply be identified: forcing specified isomorphisms to become identities can change the category.
The same boundary also separates strictness from skeletality. A skeletal category is one in which isomorphic objects are equal; a skeleton of a given category is a full skeletal subcategory obtained by choosing one representative from each isomorphism class. Strictification instead builds an equivalent monoidal category functorially from the original one. Passing to a skeleton and strictifying are different operations, and they need not be achievable simultaneously.
A monoidal category equivalent to a strict one satisfies coherence
Statement
Let be a monoidal category and let be a monoidal equivalence to a strict monoidal category . Then any two canonical morphisms in with the same source and target are equal.
Facts & Assumptions
Given: A monoidal equivalence with strict monoidal.
Canonical morphisms are the natural transformations built from identities, associators, unitors, their inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).
A monoidal equivalence is, in particular, a strong monoidal functor whose underlying functor is an equivalence of categories (Monoidal equivalence and monoidal quasi-inverse data).
An equivalence of categories is fully faithful, hence faithful (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).
In a strict monoidal category, the associator and both unitors are identity morphisms (Strict monoidal category).
Proof
Because is strong monoidal, applying to any generator listed in [L1] and then using the structure isomorphisms of again yields a canonical morphism in between the corresponding parenthesised tensor words in the images of the objects. Therefore sends canonical composites in to canonical composites in .
In the strict target , [L4] makes every canonical morphism between the same source and target the identity of the common tensor object. Hence the images under of any two canonical morphisms in with the same source and target are equal.
By [L2] and [L3], the underlying functor of is faithful. So equality after applying implies equality before applying . Therefore any two canonical morphisms in with the same source and target are equal.
Strictification itself costs no Choice; choosing a skeleton can
Remark
The construction in Mac Lane strictification chooses nothing: from a given monoidal category it builds the right-module endofunctor category and the functor directly. So the strictification theorem itself is a ZF statement.
Choice can enter through a separate operation: passing from an arbitrary category to a skeleton by selecting one representative from each isomorphism class. Being skeletal is a property and does not itself require a selection; it is the construction of a skeleton for a given category that may carry this set-theoretic cost. Consequently any argument that combines strictification with a chosen skeleton must account for that additional choice, while strictification alone does not incur it.
Mac Lane coherence in canonical-map form
Statement
Let and be parenthesised tensor words on the same ordered letters . Then there exists a unique canonical natural isomorphism . Equivalently, any two canonical morphisms from to are equal.
Facts & Assumptions
Given: Parenthesised tensor words and on the same ordered letters.
Canonical morphisms are built from identities, associators, unitors, inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).
Every monoidal category is monoidally equivalent to a strict one (Mac Lane strictification).
A monoidal category equivalent to a strict one satisfies uniqueness of canonical morphisms between fixed source and target (A monoidal category equivalent to a strict one satisfies coherence).
Proof
For a consecutive block , let , , and, for , let . We claim that every parenthesised tensor word whose ordered letters are exactly this block admits a canonical natural isomorphism .
The claim is proved recursively. For a word containing no letters, repeated unitors give a canonical map to ; for a one-letter word, repeated unitors give a canonical map to that actual letter . For , suppose contains the first letters and contains the next letters . Recursion gives and . Their tensor is canonical, and repeated associators and unitors give a canonical isomorphism . The composite is , and every step uses only the generators allowed in [L1].
For the given words and , define . This is a canonical natural isomorphism.
By [L2], the ambient monoidal category is equivalent to a strict one, so [L3] applies. Hence any two canonical morphisms from to are equal. Since step 3.1 produced one such morphism, it is the unique canonical natural isomorphism .
The coherence theorem's exact scope
Remark
Mac Lane coherence in canonical-map form compares only parenthesisations of one ordered list of tensor factors. Its arrows are the canonical morphisms built from and their inverses. The theorem therefore says nothing about arbitrary parallel morphisms of a monoidal category.
It also says nothing about reordering tensor factors. As soon as braidings or symmetries enter, the comparison maps are no longer generated just by associators and unitors, and that is a later page's subject rather than this one's.
Unbracketed tensor strings are well defined after coherence
Statement
Let be a monoidal category and let be objects of . After coherence, the unbracketed tensor string is a well-defined expression: for , any two parenthesisations of that string are canonically and uniquely identified.
Facts & Assumptions
Given: A monoidal category and objects of it.
Before the coherence page, an unbracketed tensor string of length at least three is not yet defined; only parenthesised words are (Unbracketed tensor strings are not yet defined on this page).
For parenthesised tensor words on the same ordered letters, there is a unique canonical natural isomorphism between any two of them (Mac Lane coherence in canonical-map form).
Proof
For , interpret the empty tensor string as the unit object; for , as ; and for , choose any parenthesised tensor word on the letters and evaluate it at .
If is another such parenthesisation, [L2] gives a unique canonical natural isomorphism , and evaluating at yields a unique canonical isomorphism between the two resulting objects of .
Therefore suppressing brackets does not change the resulting tensor object except by a unique canonical identification. This discharges the warning of [L1]: after coherence, the notation is well defined.
The monoid-object axioms may be written without associators
Statement
Let be a monoid object in a monoidal category. Then, after the coherence identification of unbracketed tensor strings, its axioms may be written as without displaying associators or unitors.
Facts & Assumptions
Given: A monoid object in a monoidal category .
A monoid object is defined by the associativity equation and the two unit equations with and (Monoid objects and comonoid objects in a monoidal category).
The category is monoidally equivalent to a strict monoidal category (Mac Lane strictification).
Unbracketed tensor strings are well defined after coherence (Unbracketed tensor strings are well defined after coherence).
Proof
Choose a strictification of as in [L2]. Applying the strong monoidal functor of that equivalence to the diagrams from [L1] transports the monoid-object structure of to a monoid-object structure on its image in a strict monoidal category.
In the strict target, the associator and unitors are identities, so the transported axioms become exactly the displayed unbracketed equalities.
By [L3], those unbracketed composites denote definite maps back in the original category and do not depend on which brackets were suppressed. Hence the monoid-object axioms may be written in the simplified form without changing their content.
The word category is the free monoidal category on one generator
Statement
Let be the binary-word category and let be an object of a monoidal category . Recursive evaluation of binary words at defines a strong monoidal functor with and ; for the unique arrow between two words of the same length, uses the canonical comparison isomorphism between the corresponding parenthesised tensor powers of . If is any other strong monoidal functor with , then there is a unique monoidal natural isomorphism whose component at is .
Facts & Assumptions
Given: A monoidal category , an object , and the monoidal category of binary words.
The objects of are binary words, and there is exactly one morphism between two words of the same length (The category of binary words).
The category is monoidal under binary concatenation with unit (The category of binary words is monoidal).
A strong monoidal functor is a functor equipped with invertible tensor and unit structure maps (Lax, strong, and strict monoidal functors).
Coherence supplies a unique canonical isomorphism between any two parenthesisations of the same ordered tensor word (Mac Lane coherence in canonical-map form).
Proof
Define recursively on objects by , , and . If is the unique morphism of , then and have the same length, so [L4] gives a unique canonical isomorphism ; define to be that morphism. Because identities and composites in are themselves the unique arrows between equal-length words, uniqueness in [L4] makes a functor.
The recursive object formula already matches the tensor and unit of , and the same canonical comparison maps from [L4] provide the invertible structural maps required by [L3]. Thus is a strong monoidal functor.
Let be another strong monoidal functor with . Build isomorphisms recursively: for , use the inverse of the unit map of ; for , use ; and for , use the inverse of the binary structure isomorphism of followed by .
Since every morphism in is unique when it exists, the family is automatically natural, and the same recursion forces compatibility with the monoidal structure maps. Uniqueness of the recursion makes the unique monoidal natural isomorphism fixing the generator.
The free-word formulation implies the canonical-map formulation
Statement
In the one-generator word formalism, the free-word theorem implies the canonical-map form of coherence: the unique arrow of between two binary words of the same length is carried by evaluation to the unique canonical comparison map between the corresponding parenthesised tensor powers of the chosen object.
Facts & Assumptions
Given: Two binary words of the same length and an object of a monoidal category.
In the binary-word category , there is exactly one morphism between two words of the same length (The category of binary words).
Recursive evaluation at defines a strong monoidal functor , and on the unique arrow between equal-length words it uses the canonical comparison isomorphism between the corresponding parenthesised tensor powers of (The word category is the free monoidal category on one generator).
Proof
Because and have the same length, [L1] gives a unique arrow in .
By [L2], the image is exactly the canonical comparison isomorphism between the two parenthesised tensor powers represented by and .
Therefore the unique formal arrow of between and is carried by evaluation to the canonical comparison map between the corresponding tensor powers of . This is precisely the canonical-map formulation in the one-generator setting.
Thus the free-word presentation recovers the canonical-map presentation of coherence for tensor powers of one chosen object.
The historical route to coherence and the route authored here
Remark
Mac Lane's 1963 paper proved coherence by a direct rank-induction analysis of formal associativity and unit laws, and How Mac Lane's original coherence conditions reduce to this page's two axioms records the older five-condition formulation from that period. The theorem itself is therefore historically Mac Lane's.
The route authored on this page is different. Following EGNO's attribution, the proof of Mac Lane strictification is the later Joyal-Street strictification argument, and Mac Lane coherence in canonical-map form is obtained from it by transporting canonical maps to a strict monoidal target. So the page keeps the historical origin visible while deliberately choosing the strictification route as the local proof.
5 · Examples, counterexamples and false statements
Every diagram in a monoidal category commutes
Statement
False claim: every diagram in a monoidal category commutes.
Facts & Assumptions
Given: The scope warning attached to the coherence theorem.
Coherence only covers formal diagrams of canonical morphisms between parenthesised tensor words (Why 'every diagram commutes' is false as stated).
A category with finite products is monoidal under its cartesian product (A category with finite products is monoidal).
Refutation
Let in the cartesian monoidal category of sets supplied by [L2], and let be the constant-zero map. Consider the square with all four vertices , top edge , and the other three edges .
The composite along the top and right edges is , while the composite along the left and bottom edges is . These maps differ because , so the square does not commute.
This noncanonical square lies outside the scope described in [L1] and is a diagram in a monoidal category that does not commute. Therefore the claim is false.
Every monoidal category is strictly monoidally isomorphic to a strict one
Statement
False claim: every monoidal category is strictly monoidally isomorphic to a strict monoidal category.
Facts & Assumptions
Given: The strictification theorem and its scope boundary.
Every monoidal category is monoidally equivalent to a strict monoidal category (Mac Lane strictification).
Strictification does not turn a category into a strict one by merely identifying isomorphic objects (Strictification gives equivalence, not on-the-nose identification).
The category of sets is monoidal under cartesian product (A category with finite products is monoidal).
Refutation
Suppose a strict monoidal isomorphism existed with strict. Strict preservation and strict associativity in would give Since is injective on objects, this would force as literal sets for all .
For nonempty sets under the usual ordered-pair construction, these two nested cartesian products are not literally equal: their elements have different bracketed pair shapes. This contradicts step 1.1.
Thus cartesian is not strictly monoidally isomorphic to a strict monoidal category, even though [L1] supplies a monoidal equivalence to one. Therefore the claim is false.
Every monoidal category is monoidally equivalent to a skeletal strict one
Statement
False claim: every monoidal category is monoidally equivalent to a strict monoidal category that is also skeletal.
Facts & Assumptions
Given: The meaning of skeletal category and the scope warning about strictification.
A skeletal category is one in which isomorphic objects are equal (Skeletal category and skeleton).
The strictification remark records that one cannot in general ask for a model that is both strict and skeletal at once (Strictification gives equivalence, not on-the-nose identification).
Refutation
By [L1], adding the word "skeletal" strengthens the strictification target by requiring equality of all isomorphic objects there.
But [L2] states that this stronger simultaneous requirement can fail even though ordinary strictification succeeds.
Hence the claim is false.
Coherence says that any two parallel morphisms in a monoidal category are equal
Statement
False claim: coherence says that any two parallel morphisms in a monoidal category are equal.
Facts & Assumptions
Given: The scope remark for the coherence theorem.
Coherence compares only canonical morphisms between parenthesisations of one ordered tensor word; arbitrary parallel morphisms lie outside its scope (The coherence theorem's exact scope).
Refutation
If the claim were true, the theorem would identify every parallel pair in the category, with no restriction on how those morphisms were built.
That contradicts [L1], which records the theorem's actual quantifiers and restricts it to canonical structural morphisms.
Therefore the claim is false.
Strictification requires the axiom of choice
Statement
False claim: Mac Lane strictification requires the axiom of choice.
Facts & Assumptions
Given: The choice-cost boundary for strictification.
The strictification theorem itself is a functorial construction and does not use choice; only the stronger skeletal refinement has that cost (Strictification itself costs no Choice; choosing a skeleton can).
Refutation
If strictification itself required choice, then the theorem's own construction would already depend on selecting representatives.
But [L1] states that the selection occurs only in the stronger skeletal refinement, not in strictification itself.
Therefore the claim is false.
Sources
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 2.9
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, displays (2.38) and (2.39)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, display (2.40)
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.3, Theorem 1
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Theorem 2.8.5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remarks 2.8.6 and 2.8.7
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.3, Theorem 2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 2.8.7 and Exercise 2.8.8
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.2, Corollary
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Theorem 2.9.2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 2.9.3
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.3
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 2.7
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.2, Theorem 1
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.3, Exercise 3
- S. Mac Lane, Natural Associativity and Commutativity, sections 3 and 5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, section 2.13
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Theorem 2.8.5 and Remark 2.8.6
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 2.8.7
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 2.8.8