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 - Examples
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
- Strictification and Mac Lanes Coherence Theorem
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These examples make the coherence theorem concrete. They write out canonical comparison maps, display the free word category at small length, and compute the strictification functor in a familiar cartesian case.
The counterexample on this page is the page's guardrail: formal vertices can collapse to one object in a specific monoidal category, and once that happens a noncanonical endomorphism can spoil commutativity.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The two routes around the pentagon are equal
Example
For objects in a monoidal category, the pentagon compares two canonical composites from to .
Facts & Assumptions
Given: Four objects in a monoidal category.
Between any two parenthesisations of the same ordered tensor word, there is a unique canonical natural isomorphism (Mac Lane coherence in canonical-map form).
Verification
One route around the pentagon is the composite .
The other route is the composite .
Both composites are canonical morphisms with the same source and target, so [L1] makes them equal.
A canonical map between two bracketings of a five-fold product
Example
Take the two parenthesisations A canonical map is obtained by associators alone.
Facts & Assumptions
Given: Objects of a monoidal category.
Between any two parenthesisations of one ordered tensor word there is a unique canonical natural isomorphism (Mac Lane coherence in canonical-map form).
Verification
Apply the outer associator to obtain .
Apply to the result of step 1.1 and get .
The composite of steps 1.1 and 2.1 is therefore a canonical map . Any other chain of associators with the same endpoints is equal to it by [L1].
The word category on words of length three
Example
Among the unit-free binary words of length three, there are exactly two objects:
Facts & Assumptions
Given: The binary-word category .
Binary words are built recursively from , , and , with length determined additively (The category of binary words).
The category is monoidal and therefore has the unique structural arrows between equal-length bracketings (The category of binary words is monoidal).
Verification
A unit-free length-three word must be obtained by combining exactly three copies of with two binary operations. Up to the placement of brackets, the only possibilities are and . Words of length three containing one or more copies of also exist, but are outside this unit-free subcollection.
These two words have the same length, so there is exactly one morphism between them in each direction. In the monoidal structure of [L2], those are the associator and its inverse at the generator.
Thus the unit-free part of the length-three slice of is the basic coherence picture: two bracketings and one canonical comparison each way.
Strictification of a cartesian monoidal category computed
Example
Let be a category with finite products, so that is monoidal under by A category with finite products is monoidal. Its strictification sends an object to the endofunctor .
Facts & Assumptions
Given: A category with finite products.
Finite products make into a monoidal category with tensor (A category with finite products is monoidal).
Strictification sends to the right-module endofunctor and is monoidally equivalent to a strict monoidal category (Mac Lane strictification).
Verification
By [L1], the tensor product is , so the strictification formula from [L2] becomes . Its right-module structure map at is the cartesian associator .
The binary comparison therefore has component the inverse reassociation , and the unit comparison is .
So in the cartesian case the abstract strictification is completely explicit: it packages ordinary reassociation maps of products into a strict monoidal category of endofunctors.
Two formally distinct words can become the same object
Counterexample
Let be the one-object category with object and endomorphism monoid , where and . Define the tensor on objects by and on morphisms by the same monoid multiplication. Then is a strict monoidal category in which the formal words and evaluate to the same object .
Facts & Assumptions
Given: The one-object strict monoidal category just described.
In a strict monoidal category, the associator and unitors are identities, so and evaluate to the same object on the nose (Strict monoidal category).
The slogan "every diagram commutes" fails because formally different vertices can coincide and then a noncanonical endomorphism may be inserted (Why 'every diagram commutes' is false as stated).
Verification
By [L1], the two formal vertices and both evaluate to the single object of .
Consider the square all of whose vertices are , whose top edge is , and whose other three edges are . The clockwise composite is , while the counterclockwise composite is , so the square does not commute because .
This realizes the mechanism described in [L2]: formally distinct words can collapse to one object, and a noncanonical endomorphism then breaks the blanket slogan. Hence the slogan is false.
A monoid object written with and without associators
Example
Let be a monoid object in a monoidal category. Its associativity axiom can be displayed either with explicit bracket-changing data or with the unbracketed shorthand licensed by coherence.
Facts & Assumptions
Given: A monoid object .
The definition of monoid object writes the associativity and unit diagrams with explicit associator and unitor morphisms (Monoid objects and comonoid objects in a monoidal category).
After coherence, those axioms may be written without explicit associators (The monoid-object axioms may be written without associators).
Verification
The explicit associativity axiom is , and the unit axioms are and .
By [L2], the same relations may be written as and , with the bracket suppressions understood canonically.
Thus the two notations express the same monoid-object structure; the second is shorter only because coherence has already absorbed the bracket changes.
Sources
- S. Mac Lane, Natural Associativity and Commutativity, equation (3.5)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 2.9
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.2
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.3
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 2.8
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.3