Alphabeta Math
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.

14 results · all verified · 10 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Strictification and Mac Lanes Coherence Theorem

1 · Prerequisites

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Canonical morphisms between parenthesised tensor words

Definition

Let u and v be parenthesised tensor words on the same ordered letters x1,,xn (Parenthesised tensor words and their evaluation functors) and let Eu,Ev:CnC be their evaluation functors in a monoidal category C (Monoidal category).

A canonical morphism from u to v is a natural transformation EuEv (Natural transformation and its components) belonging to the smallest class closed under:

  • identities 1Eu;
  • the associator, left unitor, and right unitor of C, 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 C is canonical merely because its source and target happen to be tensor products of the same objects.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The category of binary words

Definition

The binary words are generated recursively from:

  • the empty word e0;
  • the one-letter word ();
  • if v and w are binary words, a new word (vw).

Their length is defined recursively by e0=0,()=1,vw=v+w.

The category of binary words W has these words as objects. For objects v,w, W(v,w)={{v,w},v=w,,vw.

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 W is a category in the sense of Category, object, morphism, domain, codomain, identity, composition, and hom-collection.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The category of binary words is monoidal

Statement

The category W of The category of binary words is monoidal with tensor product vw:=vw, unit object e0, and structural isomorphisms given by the unique arrows between binary words of the same length.

Facts & Assumptions

Given: The category W of binary words.

[L1]

In W, there is exactly one morphism vw when v=w, and none otherwise (The category of binary words).

[L2]

A monoidal category needs a bifunctor, a unit object, natural isomorphisms α,λ,ρ, and the pentagon and triangle identities (Monoidal category).

Proof

technique · direct
1.1

If f:vv and g:ww exist in W, then v=v and w=w, so vw=vw. Define fg to be the unique morphism vwvw. Because all such morphisms are unique when they exist, this tensor preserves identities and composition automatically.

givenL1L2
1.2

For words u,v,w, the source and target of ((uv)w)u(vw),e0uu,ue0u have the same lengths, so [L1] gives unique arrows αu,v,w, λu, and ρu. Their reverse arrows also exist uniquely, so these are isomorphisms.

L1construct
2.1

The two sides of the pentagon are morphisms in W from one fourfold word to another of length u+v+w+z. By [L1] there is only one such morphism, so the pentagon commutes. The same uniqueness argument gives the triangle identity.

step 1.2L1
3.1

Steps 1.1-2.1 supply exactly the data required in [L2], so W is monoidal.

L2step 1.1step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The category of right-module endofunctors

Definition

Let (C,,1,α,λ,ρ) be a monoidal category (Monoidal category).

The category of right-module endofunctors C has:

  • objects given by pairs (F,c) where F:CC is a functor (Covariant functor, identity functor, composite functor, and contravariant functor) and cX,Y:F(X)YF(XY) is a natural isomorphism (Natural isomorphism) in X and Y such that F(αX,Y,Z)cXY,Z(cX,Y1Z)=cX,YZαF(X),Y,Z and F(ρX)cX,1=ρF(X);
  • morphisms (F,c)(G,d) given by natural transformations θ:FG (Natural transformation and its components) satisfying θXYcX,Y=dX,Y(θX1Y) for all objects X,Y.

Identities and composition are inherited from natural transformations: the identity transformation satisfies the compatibility equation immediately, and if θ:(F,c)(G,d) and η:(G,d)(H,e) 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 C is an endofunctor equipped with a coherent way to slide a tensor factor on the right through the functor.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The right-module endofunctor category is strict monoidal

Statement

For every monoidal category C, the category C of The category of right-module endofunctors is a strict monoidal category under composition of endofunctors.

Facts & Assumptions

Given: The category C of right-module endofunctors on a monoidal category C.

[L1]

An object of C is a pair (F,c) with a coherent natural isomorphism cX,Y:F(X)YF(XY), and a morphism is a natural transformation compatible with those structure maps (The category of right-module endofunctors).

[L2]

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

technique · direct
1.1

For objects (F,c) and (G,d) of C, define (F,c)(G,d):=(FG,e) with eX,Y:=F(dX,Y)cG(X),Y. The axioms from [L1] for c and d imply the same associativity and unit equations for e, so (FG,e) is again an object of C. For morphisms θ:(F,c)(F,c) and η:(G,d)(G,d), define (θη)X:=θG(X)F(ηX)=F(ηX)θG(X). The equality is naturality, and the module-compatibility equation follows from the corresponding equations for θ and η.

givenL1construct
1.2

Let I be the identity functor on C with structure map iX,Y=1XY. Then (I,i) is an object of C and acts as a two-sided unit for the tensor just defined.

L1construct
2.1

Composition of endofunctors is literally associative and unital, so ((FG)H)=FGH=F(GH) and IF=F=FI 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 1.1step 1.2algebra
3.1

Step 2.1 verifies the strictness clause of [L2], so C is strict monoidal under composition.

L2step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

Mac Lane strictification

Statement

Let C be a monoidal category. Then the assignment L(X)=(X,αX,,) defines a strong monoidal functor L:CC from C to the strict monoidal category C of The category of right-module endofunctors, and L is a monoidal equivalence. Consequently every monoidal category is monoidally equivalent to a strict monoidal category.

Facts & Assumptions

Given: A monoidal category C and its right-module endofunctor category C.

[L1]

An object of C is a functor F together with coherent isomorphisms cX,Y:F(X)YF(XY), and a morphism in C is a natural transformation compatible with those structure maps (The category of right-module endofunctors).

[L2]

The category C is strict monoidal under composition (The right-module endofunctor category is strict monoidal).

[L3]

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).

[L4]

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).

[L5]

Every equivalence can be equipped with adjoint-equivalence data (Every equivalence of categories can be equipped as an adjoint equivalence).

[L6]

A fully faithful functor reflects isomorphisms (Every fully faithful functor reflects isomorphisms).

Proof

technique · direct
1.1

For each object X of C, put L(X)=(X,αX,,). The pentagon and triangle axioms of C are exactly the coherence and unit equations required in [L1], so L(X) is an object of C. For a morphism f:XY, define L(f)Z=f1Z. Naturality of the associator shows that L(f) is a morphism in C.

givenL1construct
1.2

The functor L is split essentially surjective. For an object (F,c) of C, let X:=F(1) and define ϕY:=F(λY)c1,Y:XYF(Y). Each ϕY is an isomorphism because both factors are, and naturality of c together with its coherence equations makes ϕ:L(X)(F,c) a morphism in C.

L1chooseconstruct
2.1

The unit comparison for L is the natural isomorphism (L0)Z=λZ1:Z1Z, and the binary comparison L2(X,Y):L(X)L(Y)L(XY) has component αX,Y,Z1:X(YZ)(XY)Z. The same pentagon and triangle identities show these are morphisms in C, so L is strong monoidal into the strict monoidal target of [L2].

step 1.1L2construct
2.2

The functor L is faithful. If L(f)=L(g), then their components at the unit object agree, and composing with the right unitors gives f=ρYL(f)1ρX1=ρYL(g)1ρX1=g.

step 1.1algebra
3.1

The functor L is full. Given a morphism θ:L(X)L(Y) in C, define f=ρYθ1ρX1:XY. The compatibility equation from [L1], evaluated at (1,Z), identifies θZ with f1Z after the unitors are inserted, so θ=L(f).

L1step 2.2construct
4.1

By steps 2.2-3.1 and [L4], the underlying functor of L is an equivalence of categories. By [L5], choose an adjoint-equivalence quasi-inverse G:CC with natural isomorphisms η:1CGL and ε:LG1C.

L4L5step 1.2step 2.2step 3.1choose
5.1

Use full faithfulness of L to define the binary comparison G2(A,B):G(A)G(B)G(AB) as the unique morphism whose image under L is εAB1(εAεB)L2(GA,GB)1. Define G0:1CG(1C) uniquely by L(G0)=ε1C1L01. Naturality of ε and L2 makes the displayed images natural in A,B, so faithfulness of L makes G2 natural. Both comparisons are isomorphisms by [L6].

L2L4L6step 2.1step 4.1construct
6.1

Apply the faithful functor L to the associativity and unit diagrams for G2,G0. By their defining formulas, the images reduce to the coherence diagrams for the strong monoidal functor L together with naturality of ε, so they commute. Thus G is strong monoidal, and the defining equations in step 5.1 say exactly that ε is monoidal. The triangle identity εLLη=1L gives Lη=(εL)1; since the inverse of a monoidal natural isomorphism is monoidal, faithfulness of L then verifies the binary and unit equations for η. Hence η is monoidal. The data (L,G,η,ε) therefore satisfy [L3], so L is a monoidal equivalence to the strict monoidal category C.

L3step 2.1step 4.1step 5.1algebra
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

A monoidal category equivalent to a strict one satisfies coherence

Statement

Let C be a monoidal category and let F:CD be a monoidal equivalence to a strict monoidal category D. Then any two canonical morphisms in C with the same source and target are equal.

Facts & Assumptions

Given: A monoidal equivalence F:CD with D strict monoidal.

[L1]

Canonical morphisms are the natural transformations built from identities, associators, unitors, their inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).

[L2]

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).

[L4]

In a strict monoidal category, the associator and both unitors are identity morphisms (Strict monoidal category).

Proof

technique · direct
1.1

Because F is strong monoidal, applying F to any generator listed in [L1] and then using the structure isomorphisms of F again yields a canonical morphism in D between the corresponding parenthesised tensor words in the images of the objects. Therefore F sends canonical composites in C to canonical composites in D.

givenL1L2
2.1

In the strict target D, [L4] makes every canonical morphism between the same source and target the identity of the common tensor object. Hence the images under F of any two canonical morphisms in C with the same source and target are equal.

step 1.1L4
3.1

By [L2] and [L3], the underlying functor of F is faithful. So equality after applying F implies equality before applying F. Therefore any two canonical morphisms in C with the same source and target are equal.

L2L3step 2.1
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Strictification itself costs no Choice; choosing a skeleton can

Remark

The construction in Mac Lane strictification chooses nothing: from a given monoidal category C it builds the right-module endofunctor category C and the functor L:CC 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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Mac Lane coherence in canonical-map form

Statement

Let u and v be parenthesised tensor words on the same ordered letters x1,,xn. Then there exists a unique canonical natural isomorphism EuEv. Equivalently, any two canonical morphisms from u to v are equal.

Facts & Assumptions

Given: Parenthesised tensor words u and v on the same ordered letters.

[L1]

Canonical morphisms are built from identities, associators, unitors, inverses, tensoring with identities, and composition (Canonical morphisms between parenthesised tensor words).

[L2]

Every monoidal category is monoidally equivalent to a strict one (Mac Lane strictification).

[L3]

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

technique · direct
1.1

For a consecutive block xi,,xi+m1, let ri,0:=1, ri,1:=xi, and, for m1, let ri,m+1:=(ri,mxi+m). We claim that every parenthesised tensor word w whose ordered letters are exactly this block admits a canonical natural isomorphism κw:EwEri,m.

givenconstruct
2.1

The claim is proved recursively. For a word containing no letters, repeated unitors give a canonical map to ri,0=1; for a one-letter word, repeated unitors give a canonical map to that actual letter ri,1=xi. For w=(ab), suppose a contains the first p letters xi,,xi+p1 and b contains the next q letters xi+p,,xi+p+q1. Recursion gives κa:EaEri,p and κb:EbEri+p,q. Their tensor is canonical, and repeated associators and unitors give a canonical isomorphism Eri,pri+p,qEri,p+q. The composite is κw, and every step uses only the generators allowed in [L1].

L1step 1.1construct
3.1

For the given words u and v, define θu,v:=κv1κu:EuEv. This is a canonical natural isomorphism.

step 2.1L1
4.1

By [L2], the ambient monoidal category is equivalent to a strict one, so [L3] applies. Hence any two canonical morphisms from u to v are equal. Since step 3.1 produced one such morphism, it is the unique canonical natural isomorphism EuEv.

L2L3step 3.1
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-08-31Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Unbracketed tensor strings are well defined after coherence

Statement

Let C be a monoidal category and let A1,,An be objects of C. After coherence, the unbracketed tensor string A1An is a well-defined expression: for n2, any two parenthesisations of that string are canonically and uniquely identified.

Facts & Assumptions

Given: A monoidal category C and objects A1,,An of it.

[L1]

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).

[L2]

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

technique · direct
1.1

For n=0, interpret the empty tensor string as the unit object; for n=1, as A1; and for n2, choose any parenthesised tensor word w on the letters x1,,xn and evaluate it at (A1,,An).

givenchoose
2.1

If w is another such parenthesisation, [L2] gives a unique canonical natural isomorphism ww, and evaluating at (A1,,An) yields a unique canonical isomorphism between the two resulting objects of C.

L2step 1.1
3.1

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 A1An is well defined.

L1step 2.1
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The monoid-object axioms may be written without associators

Statement

Let (M,μ,η) be a monoid object in a monoidal category. Then, after the coherence identification of unbracketed tensor strings, its axioms may be written as μ(μ1M)=μ(1Mμ), μ(η1M)=1M,μ(1Mη)=1M, without displaying associators or unitors.

Facts & Assumptions

Given: A monoid object (M,μ,η) in a monoidal category C.

[L1]

A monoid object is defined by the associativity equation μ(μ1M)=μ(1Mμ)αM,M,M and the two unit equations with λM and ρM (Monoid objects and comonoid objects in a monoidal category).

[L2]

The category C is monoidally equivalent to a strict monoidal category (Mac Lane strictification).

[L3]

Unbracketed tensor strings are well defined after coherence (Unbracketed tensor strings are well defined after coherence).

Proof

technique · direct
1.1

Choose a strictification of C as in [L2]. Applying the strong monoidal functor of that equivalence to the diagrams from [L1] transports the monoid-object structure of M to a monoid-object structure on its image in a strict monoidal category.

L1L2choose
2.1

In the strict target, the associator and unitors are identities, so the transported axioms become exactly the displayed unbracketed equalities.

L2step 1.1
3.1

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.

L3step 2.1
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The word category is the free monoidal category on one generator

Statement

Let W be the binary-word category and let b be an object of a monoidal category B. Recursive evaluation of binary words at b defines a strong monoidal functor Tb:WB with Tb(())=b and Tb(e0)=1B; for the unique arrow between two words of the same length, Tb uses the canonical comparison isomorphism between the corresponding parenthesised tensor powers of b. If S:WB is any other strong monoidal functor with S(())=b, then there is a unique monoidal natural isomorphism STb whose component at () is 1b.

Facts & Assumptions

Given: A monoidal category B, an object bB, and the monoidal category W of binary words.

[L1]

The objects of W are binary words, and there is exactly one morphism between two words of the same length (The category of binary words).

[L2]

The category W is monoidal under binary concatenation with unit e0 (The category of binary words is monoidal).

[L3]

A strong monoidal functor is a functor equipped with invertible tensor and unit structure maps (Lax, strong, and strict monoidal functors).

[L4]

Coherence supplies a unique canonical isomorphism between any two parenthesisations of the same ordered tensor word (Mac Lane coherence in canonical-map form).

Proof

technique · direct
1.1

Define Tb recursively on objects by Tb(e0)=1B, Tb(())=b, and Tb(vw)=Tb(v)Tb(w). If u:vw is the unique morphism of W, then v and w have the same length, so [L4] gives a unique canonical isomorphism Tb(v)Tb(w); define Tb(u) to be that morphism. Because identities and composites in W are themselves the unique arrows between equal-length words, uniqueness in [L4] makes Tb a functor.

givenL1L4construct
2.1

The recursive object formula already matches the tensor and unit of W, and the same canonical comparison maps from [L4] provide the invertible structural maps required by [L3]. Thus Tb is a strong monoidal functor.

L2L3L4step 1.1
2.2

Let S:WB be another strong monoidal functor with S(())=b. Build isomorphisms σv:S(v)Tb(v) recursively: for e0, use the inverse of the unit map of S; for (), use 1b; and for vw, use the inverse of the binary structure isomorphism of S followed by σvσw.

L3step 1.1construct
3.1

Since every morphism in W is unique when it exists, the family σv is automatically natural, and the same recursion forces compatibility with the monoidal structure maps. Uniqueness of the recursion makes σ:STb the unique monoidal natural isomorphism fixing the generator.

L1L4step 2.2
CorollaryStatement: AI-generatedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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 W 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 v,w of the same length and an object b of a monoidal category.

[L1]

In the binary-word category W, there is exactly one morphism between two words of the same length (The category of binary words).

[L2]

Recursive evaluation at b defines a strong monoidal functor Tb:WB, and on the unique arrow between equal-length words it uses the canonical comparison isomorphism between the corresponding parenthesised tensor powers of b (The word category is the free monoidal category on one generator).

Proof

technique · direct
1.1

Because v and w have the same length, [L1] gives a unique arrow uv,w:vw in W.

givenL1
2.1

By [L2], the image Tb(uv,w) is exactly the canonical comparison isomorphism between the two parenthesised tensor powers represented by v and w.

L2step 1.1
3.1

Therefore the unique formal arrow of W between v and w is carried by evaluation to the canonical comparison map between the corresponding tensor powers of b. This is precisely the canonical-map formulation in the one-generator setting.

step 1.1step 2.1
4.1

Thus the free-word presentation recovers the canonical-map presentation of coherence for tensor powers of one chosen object.

step 3.1
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-08-31Open item page →

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

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

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.

[L1]

Coherence only covers formal diagrams of canonical morphisms between parenthesised tensor words (Why 'every diagram commutes' is false as stated).

[L2]

A category with finite products is monoidal under its cartesian product (A category with finite products is monoidal).

Refutation

technique · direct
1.1

Let A={0,1} in the cartesian monoidal category of sets supplied by [L2], and let c:AA be the constant-zero map. Consider the square with all four vertices A, top edge c, and the other three edges 1A.

givenL2construct
2.1

The composite along the top and right edges is c, while the composite along the left and bottom edges is 1A. These maps differ because c(1)=01=1A(1), so the square does not commute.

step 1.1algebra
3.1

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.

L1step 2.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

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.

[L1]

Every monoidal category is monoidally equivalent to a strict monoidal category (Mac Lane strictification).

[L2]

Strictification does not turn a category into a strict one by merely identifying isomorphic objects (Strictification gives equivalence, not on-the-nose identification).

[L3]

The category of sets is monoidal under cartesian product (A category with finite products is monoidal).

Refutation

technique · direct
1.1

Suppose a strict monoidal isomorphism F:SetD existed with D strict. Strict preservation and strict associativity in D would give F((A×B)×C)=(F(A)F(B))F(C)=F(A)(F(B)F(C))=F(A×(B×C)). Since F is injective on objects, this would force (A×B)×C=A×(B×C) as literal sets for all A,B,C.

L2L3assume-contraalgebra
2.1

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.

step 1.1contradiction
3.1

Thus cartesian Set is not strictly monoidally isomorphic to a strict monoidal category, even though [L1] supplies a monoidal equivalence to one. Therefore the claim is false.

L1L3step 2.1discharge-contradiction
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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.

[L1]

A skeletal category is one in which isomorphic objects are equal (Skeletal category and skeleton).

[L2]

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

technique · direct
1.1

By [L1], adding the word "skeletal" strengthens the strictification target by requiring equality of all isomorphic objects there.

L1
1.2

But [L2] states that this stronger simultaneous requirement can fail even though ordinary strictification succeeds.

L2
2.1

Hence the claim is false.

step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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.

[L1]

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

technique · direct
1.1

If the claim were true, the theorem would identify every parallel pair in the category, with no restriction on how those morphisms were built.

given
1.2

That contradicts [L1], which records the theorem's actual quantifiers and restricts it to canonical structural morphisms.

L1
2.1

Therefore the claim is false.

step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

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.

[L1]

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

technique · direct
1.1

If strictification itself required choice, then the theorem's own construction would already depend on selecting representatives.

given
1.2

But [L1] states that the selection occurs only in the stronger skeletal refinement, not in strictification itself.

L1
2.1

Therefore the claim is false.

step 1.1step 1.2

Sources