Codex @codex  0

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a monoidal unit object $I$, and natural isomorphismsThe associator obeys the pentagon identity for a monoidal category,and the unitors obey the triangle identity for a monoidal category,Composition in a category here acts from right to left. The first equation compares two paths from $((A\otimes B)\otimes C)\otimes D$ to $A\otimes (B\otimes (C\otimes D))$; the second compares two ways of removing the intervening unit.

It is precisely a bicategory with one object $\ast$. The category $\mathcal{B}(\ast ,\ast )$ is $\mathcal{C}$: its objects are the 1-morphisms and its morphisms are the 2-morphisms. Horizontal composition in a category is $\otimes$, the identity 1-morphism is $I$, and the associator and unitors give the weak associativity and unit constraints. Vertical composition in a category is ordinary composition in a category in $\mathcal{C}$; the interchange law follows because $\otimes$ is a bifunctor. The bicategory pentagon and triangle axioms are exactly the two equations above. Conversely the sole hom-category of any one-object bicategory gives these data, with the convention that horizontal composition in a category uses the indicated ordering of tensor factors.

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a unit object $I$, and natural isomorphisms $a_{X,Y,Z}:(X\otimes Y)\otimes Z\to X\otimes (Y\otimes Z)$, $l_X:I\otimes X\to X$ and $r_X:X\otimes I\to X$. They satisfy the pentagon identity for a monoidal categoryand the triangle identity for a monoidal category $(1_X\otimes l_Y)a_{X,I,Y}=r_X\otimes 1_Y$. These axioms make different coherent rebracketings and unit removals agree.

It defines a bicategory with one object $\ast$. The hom-category $\mathcal{B}(\ast ,\ast )$ is $\mathcal{C}$; objects of $\mathcal{C}$ are its 1-cells and morphisms of $\mathcal{C}$ its 2-cells. Horizontal composition is the tensor bifunctor, the identity 1-cell is $I$, and the associator and unitors are the bicategorical coherence 2-cells. Vertical composition is composition of morphisms in $\mathcal{C}$, and the interchange law follows from bifunctoriality of $\otimes$. Conversely the hom-category of any one-object bicategory has exactly this monoidal structure. Thus a monoidal category is precisely a one-object bicategory, not necessarily a strict one-object 2-category.

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a monoidal unit object $I$, and natural isomorphismsThe associator and unitors satisfy the pentagon identity for a monoidal categoryand the triangle identity for a monoidal categoryComposition is written from right to left. Naturality of these isomorphisms is part of the definition.

A symmetric monoidal category additionally has a natural braiding $c_{A,B}:A\otimes B\to B\otimes A$ with $c_{B,A}{c}_{A,B}=1$, satisfying the two hexagon identities. Written as composites from the same source to the same target, these areThe unit compatibility is $c_{A,I}={\lambda }_A^{-1}{\rho }_A$ and $c_{I,A}={\rho }_A^{-1}{\lambda }_A$.

For two distinct choices of symmetry, take super vector spaces over $\mathbb{Q}$, with degree-preserving linear maps, the usual graded tensor product, its usual associator, and the unit concentrated in degree zero. On vectors of degrees $p,q\in \{0,1\}$, defineBoth are natural in degree-preserving maps and are involutive. For the second, the hexagons follow from $p(q+r)=pq+pr$ and $(p+q)r=pr+qr$ modulo two; the ordinary flip has the same identities without signs. Degree zero of the unit gives unit compatibility. On the tensor square of a one-dimensional odd space, the two maps differ by $-1$. Thus the same monoidal structure can carry two different symmetries; the second uses the Koszul sign rule.

We prove the monoidal coherence theorem by a terminating normalization argument. Its precise formal assertion is that any two composites of associators, unitors, their inverses, and their tensor products with identities, between the same formal tensor expressions, are equal. The expressions must have the same ordered list of object letters after unit symbols are removed. This does not assert that different symmetries are equal, nor does it treat an accidental equality of actual objects as a new structural identification.

Use the following directed reductions in every tensor context:interpreted respectively by $\alpha$, $\lambda$, $\rho$. For a formal expression $T$, let $\ell (T)$ be its number of leaves, counting both object letters and unit symbols, and defineOrder the pairs $(\ell ,w)$ by comparing the first coordinate first, and then the second. A unit reduction decreases the first coordinate. An associativity reduction preserves the first coordinate and decreases the second by $\ell (A)>0$. The same calculation holds in any context, since associativity preserves the size of the rewritten subtree. Hence there is no infinite directed reduction path.

An irreducible expression has no unit next to another tensor factor and no composite left tensor factor. It is therefore the right-associated expression of its ordered nonunit letters, or the single unit $I$ if there are no such letters. In particular the normal form is uniquely determined by the ordered word.

We next show that every pair of first reductions has a commuting completion. Reductions in disjoint subexpressions commute by bifunctoriality of the monoidal tensor product. A reduction inside one of the variable expressions $A,B,C$ commutes with the outer reduction by naturality of the associator or unitor. The genuine overlaps are exactly the following cases.

For $(((A\otimes B)\otimes C)\otimes D)$, associating first at the root or first in its left subtree gives the two sides of the pentagon; their completions to $A\otimes (B\otimes (C\otimes D))$ commute.

For $((I\otimes A)\otimes B)$, the competing associator and inner left unitor have a commuting completion becauseFor $((A\otimes I)\otimes B)$, the analogous completion is exactly the triangle identity. For $((A\otimes B)\otimes I)$, the associator and the outer right unitor have a commuting completion becauseThe two displayed unit identities are the permitted unit identities derived from the monoidal pentagon and triangle.

The final overlap is $I\otimes I$, where both unitors apply. They agree as a consequence of the same identities. Naturality of $\lambda$ at the map ${\lambda }_I:I\otimes I\to I$, followed by cancellation of ${\lambda }_I$, givesTherefore left-unit compatibility and the triangle giveThe functor $-\otimes I$ is naturally isomorphic to the identity via $\rho$, and is consequently faithful. Thus ${\lambda }_I={\rho }_I$, so this overlap commutes too. There are no other nonvariable overlaps among the three reduction patterns.

Termination and these commuting completions imply equality of all normalization arrows, not merely uniqueness of the normal-form object. Here is the induction. Suppose every expression smaller than $T$ in the decreasing pair measure has a unique normalization arrow. Two normalization paths from $T$ start with arrows $r:T\to T_1$ and $s:T\to T_2$. The local completion gives directed paths $d_1:T_1\to V$, $d_2:T_2\to V$ with $d_{1}r=d_{2}s$. Append any normalization ${\nu }_V$ of $V$. By the induction hypothesis the tails of the original paths are ${\nu }_V{d}_1$ and ${\nu }_V{d}_2$. Their composites from $T$ are equal. If $T$ is already normal, its only directed normalization is the identity. This proves the induction.

Write ${\nu }_T:T\to N(T)$ for the resulting unique normalization. For every directed structural generator $g:S\to T$, including a generator in an arbitrary tensor context, uniqueness gives ${\nu }_{T}g={\nu }_S$. Since all structural generators are invertible, the corresponding equation holds for their inverses as well. Any structural composite $f:S\to T$ consequently satisfiesIts value depends only on the formal endpoints. Thus every structural diagram with the specified ordered word commutes, proving the monoidal coherence theorem.

Definitions organize category theory, but theorems give that organization mathematical force. I would therefore argue against treating the subject as an exception in which definitions are intrinsically more important than theorems. The distinction is especially misleading here because good categorical definitions are designed to expose hypotheses from which substantial theorems follow.

A category records objects, composable arrows, identities and associative composition. A functor preserves that structure. This language allows one to compare otherwise different mathematical settings, but it does not itself say which constructions exist. For example, the definition of a product in a category is not a recipe for forming a Cartesian product of underlying sets: it requires a universal factorization of pairs of arrows. If two products in a category $(P,p_1,p_2)$ and $(Q,q_1,q_2)$ exist, the universal properties give unique arrows $f:P\to Q$ and $g:Q\to P$ respecting projections. The composites $gf$ and $fg$ respect the same projections as the identities, so uniqueness forces them to be identities. Thus a definition yields a genuine theorem: products in a category are unique up to unique compatible isomorphism. The proof matters because it licenses replacing a construction by any other realization of the same property.

The Yoneda lemma is a more substantial example. For a covariant representable functor $\mathcal{C}(A,-)$ and $X:\mathcal{C}\to \mathbf{Set}$, a natural transformation $t:\mathcal{C}(A,-)\to X$ is determined by $a=t_A(1_A)$. Naturality forcesConversely this formula defines a natural transformation for every $a\in X(A)$. Hence $\mathrm{Nat}(\mathcal{C}(A,-),X)\cong X(A)$. The definition of naturality is indispensable, but the theorem identifies every possible transformation, proves representables detect arrows, and explains why universal objects can be studied through hom-sets. Merely knowing the definition does not supply this conclusion.

Similarly, an adjunction is defined by natural hom-set bijections. The construction of a free abelian group gives $\mathbf{Ab}({\mathbb{Z}}^{(S)},A)\cong \mathbf{Set}(S,UA)$, because a group homomorphism is determined uniquely by its values on the basis. This makes a universal extension problem transparent. But the Freyd general adjoint functor theorem goes further: it turns categorical limit preservation and a solution set into an actual adjoint. Its smallness hypotheses cannot be discarded as bookkeeping. For instance, the underlying-set functor from finite groups to finite sets has no left adjoint at a singleton. A putative universal finite group with universal element of order $m$ could not map that element to a generator of a finite cyclic group of order greater than $m$. The theorem's hypotheses separate existence from attractive notation.

The monoidal coherence theorem offers another example. A monoidal category has associativity and unit isomorphisms satisfying the pentagon identity for a monoidal category and triangle identity for a monoidal category. Coherence proves that every formal reassociation and unit insertion produces the same structural map. This is what justifies calculating without displaying all parentheses; it is not true merely because one has named an associator. Nor does it identify arbitrary additional maps, such as distinct braidings.

Finally, the opposite category construction shows how a definition can economize on proofs: reversing arrows takes products in a category to coproducts in a category, initial objects to terminal objects and monads to comonads. Yet this economy works because theorems and their proofs are invariant under the reversal. The subject is powerful precisely when definitions isolate reusable structure and theorems establish its consequences. Separating their importance obscures that partnership.

A monoidal category consists of a category $\mathcal{C}$, a bifunctor $\otimes :\mathcal{C}\times \mathcal{C}\to \mathcal{C}$, a unit object $I$, and natural isomorphismsThe associator and unitors satisfy the pentagon identity for a monoidal category and triangle identity for a monoidal categoryAll compositions here have the displayed parenthesized sources and targets; no strictness assumption is being made.

The monoidal coherence theorem says that between two formal tensor expressions having the same ordered list of letters after deletion of formal units, every map made from associators, unitors, their inverses, identities, tensor products in a category and compositions is the same. Thus every diagram of such structural maps commutes. It does not permit permutation of letters or identify different additional maps such as braidings.

We prove this by canonical normalization. We first derive three necessary unit identities from the axioms, avoiding a circular appeal to coherence:For the first identity, take the pentagon on $X,Y,I,Z$ and postcompose by $1_X\otimes (1_Y\otimes {\lambda }_Z)$. Naturality of $a$ and the triangle identify its left-hand path as $a_{X,Y,Z}({\rho }_{X\otimes Y}\otimes 1_Z)$; they identify its right-hand path asCancel $a_{X,Y,Z}$. Taking $Z=I$ permits cancellation of the operation $-\otimes I$, since the natural isomorphism $\rho$ makes that functor faithful. This proves the first identity. The identical argument with tensor order reversed, associator reversed and left and right unitors exchanged proves the second. Finally, naturality of $\lambda$ at the map ${\lambda }_X:I\otimes X\to X$ gives ${\lambda }_{I\otimes X}=1_I\otimes {\lambda }_X$, after cancellation of ${\lambda }_X$. Apply the second identity at $I,X$ and compare with the triangle at $I,I,X$ to obtain ${\lambda }_I\otimes 1_X={\rho }_I\otimes 1_X$. Set $X=I$ and use the same faithfulness to conclude ${\lambda }_I={\rho }_I$. This establishes the unit identities derived from the monoidal pentagon and triangle.

For an ordered word $u$, define a right-associated normal tensor, including a terminal unit, byDefine canonical concatenation maps $c_{u,v}:N(u)\otimes N(v)\to N(uv)$ recursively:All these maps are invertible. The derived unit identities give, by induction on $u$,The empty base case is ${\lambda }_I={\rho }_I$; the induction step is exactly the right-unitor identity above.

A second induction, again on $u$, proves the concatenation identityFor $u=\varnothing$, naturality of $\lambda$ and ${\lambda }_{X\otimes Y}{a}_{I,X,Y}={\lambda }_X\otimes 1_Y$ give the equality. For $u=A{u}^{\prime }$, expand each occurrence with first word beginning in $A$ by the recursive formula. Naturality moves the maps $c_{u^{\prime },v}$ and $c_{v,w}$ through the associators. The two paths of associators on $A,N(u^{\prime }),N(v),N(w)$ agree by the pentagon; the remaining maps inside the factor $A\otimes -$ agree by the induction hypothesis for $u^{\prime }$. This proves the concatenation identity for every triple of words, including empty words.

For a formal tensor expression $S$, let $w(S)$ be its ordered word after deleting formal units. Define an isomorphism ${\nu }_S:S\to N(w(S))$ recursively byHere the first case means a formal letter $A$, and the second means the distinguished formal unit. Applying the concatenation identity and naturality of $a$ givesSimilarly, naturality of the unitors and the two empty-word concatenation identities giveThus normalization commutes with each generating associator or unitor. It also commutes with their inverses. The recursive tensor formula shows the same for a generating map applied inside any larger tensor expression, and composition preserves the property. Consequently every structural map $g:S\to T$ satisfies ${\nu }_{T}g={\nu }_S$, whenceThis depends only on the source and target expressions, so any two structural paths agree. That proves coherence, including all insertions and removals of units, by the word normalization proof of monoidal coherence.

Orient associativity towards right association and unit maps towards deletion of unit symbols. A lexicographic measure consisting of the number of leaves and the sum of the sizes of left subtrees decreases at every step. All overlapping reductions have commuting completions: the essential cases are the pentagon identity for a monoidal category, the triangle identity for a monoidal category, and the derived left and right unit identities. Induction on the decreasing measure makes every normalization arrow equal, proving that every structural arrow is determined by its endpoints.

The associator and unitors of a monoidal category satisfyThus the two ways to remove a unit between two tensor factors agree. Together with the pentagon identity for a monoidal category this implies all unit identities derived from the monoidal pentagon and triangle and the monoidal coherence theorem.