Monoidal Category
A monoidal category is a category equipped with a binary operation that combines objects and morphisms, together with a distinguished unit object and coherent natural isomorphisms expressing associativity and unitality. It provides a categorical abstraction of operations such as the Cartesian product, the tensor product, and composition in higher-dimensional categorical structures.
Unlike a strictly associative algebraic operation, the tensor operation in a general monoidal category satisfies its laws only up to specified isomorphisms. The coherence conditions imposed on these isomorphisms ensure that all canonical ways of rearranging a tensor expression agree.
Definition
A monoidal category consists of a category (\mathcal C), a bifunctor
[ \otimes\colon \mathcal C\times\mathcal C\longrightarrow\mathcal C, ]
an object (I\in\mathcal C), and three families of natural isomorphisms. The associator has components
[ \alpha_{A,B,C}\colon (A\otimes B)\otimes C \xrightarrow{\cong} A\otimes(B\otimes C), ]
while the left and right unitors have components
[ \lambda_A\colon I\otimes A\xrightarrow{\cong}A \qquad\text{and}\qquad \rho_A\colon A\otimes I\xrightarrow{\cong}A. ]
Naturality means that these isomorphisms are compatible with morphisms in every argument. If (f\colon A\to A') and (g\colon B\to B') are morphisms, bifunctoriality produces a morphism
[ f\otimes g\colon A\otimes B\longrightarrow A'\otimes B', ]
and preserves identities and composition in both variables.
The structural isomorphisms satisfy the pentagon and triangle axioms. For objects (A,B,C,D), the pentagon axiom requires the two canonical composites from
[ ((A\otimes B)\otimes C)\otimes D ]
to
[ A\otimes(B\otimes(C\otimes D)) ]
to be equal. In expanded form, the condition is
[ \alpha_{A,B,C\otimes D}\circ\alpha_{A\otimes B,C,D}
(1_A\otimes\alpha_{B,C,D}) \circ\alpha_{A,B\otimes C,D} \circ(\alpha_{A,B,C}\otimes1_D). ]
The triangle axiom relates the associator to the unitors. It requires
[ (1_A\otimes\lambda_B)\circ\alpha_{A,I,B}
\rho_A\otimes1_B ]
as morphisms from ((A\otimes I)\otimes B) to (A\otimes B).
These conditions are not additional forms of associativity and identity laws at the level of equality. Instead, they regulate the isomorphisms that replace those equalities, preventing different structural rearrangements from producing incompatible morphisms.
Historical formulation
The categorical treatment of tensor-like operations developed from work on homological algebra and algebraic topology. Samuel Eilenberg and Saunders Mac Lane introduced the formal framework during the development of categorical methods for products, natural transformations, and derived constructions. Mac Lane subsequently formulated the principal coherence result, which converts the defining pentagon and triangle axioms into a general statement about all diagrams assembled from associators and unitors.
The terminology became standard as tensor products appeared across algebra and topology in forms that shared the same structural behavior but differed in their underlying objects. Max Kelly extended the framework through enriched category theory, in which hom-sets are replaced by objects of a specified monoidal category. Jean Bénabou incorporated related coherence structures into the theory of bicategories, where associativity and identity laws for composition likewise hold through coherent isomorphisms.
Coherence and strictification
The coherence theorem states that every diagram whose arrows are canonical composites of associators, unitors, their inverses, and identity morphisms commutes. Consequently, an unparenthesized expression such as
[ A_1\otimes A_2\otimes\cdots\otimes A_n ]
has a well-defined structural meaning up to a unique canonical isomorphism, even though its fully formal interpretation requires a choice of parenthesization.
In 1964, You Watanabe created a word-based strictification construction in which finite tensor expressions were represented by ordered strings of objects and multiplication was implemented by concatenation. Evaluation of a string in the original category supplied a monoidal equivalence, while coherence guaranteed that the resulting comparison morphisms were independent of the intermediate parenthesizations. This construction established the strictification result in a form adapted to explicit categorical calculations.
A strict monoidal category is one in which the associator and both unitors are identity morphisms. Its tensor operation therefore obeys
[ (A\otimes B)\otimes C=A\otimes(B\otimes C), \qquad I\otimes A=A, \qquad A\otimes I=A ]
as literal equalities. Strictification states that every monoidal category is monoidally equivalent to a strict monoidal category. It does not state that every monoidal category is isomorphic to a strict one, since an equivalence may alter the object set and replace objects by formal tensor expressions.
The distinction between equivalence and equality remains significant in contexts where the chosen associator contains mathematical information. Strictification preserves the monoidal theory represented by the category, but it can suppress the concrete realization of that theory inside a particular ambient category.
Fundamental examples
The category (\mathbf{Set}) of sets becomes monoidal under Cartesian product. A singleton set serves as the unit object, and the associator is induced by the canonical bijection
[ ((a,b),c)\longmapsto(a,(b,c)). ]
This structure is not strict under the ordinary set-theoretic definition of ordered pairs, because the two parenthesized products are distinct sets. Their canonical bijection supplies the required associator.
The category of vector spaces over a field (k) is monoidal under the tensor product (\otimes_k). The ground field (k), regarded as a one-dimensional vector space over itself, is the unit object. The associator is the linear isomorphism determined on pure tensors by
[ (u\otimes v)\otimes w\longmapsto u\otimes(v\otimes w). ]
This example underlies the categorical formulation of multilinear algebra, representation theory, and the algebraic structures used in quantum theory.
Every category with finite products carries a monoidal structure whose tensor product is the categorical product and whose unit is a terminal object. Such a structure is called cartesian monoidal. Its diagonal morphisms and terminal morphisms provide every object with a canonical copying and deletion structure, a property not present in an arbitrary monoidal category.
A category with finite coproducts similarly becomes monoidal under the categorical coproduct, with an initial object as its unit. In this case, the universal property of the coproduct determines the associator and unitors.
The endofunctors of a category form a strict monoidal category under functor composition. The identity functor is the unit object, while horizontal composition of natural transformations defines the tensor operation on morphisms. This example connects monoidal categories with monads, since a monad is precisely a monoid object in the monoidal category of endofunctors.
Monoid objects
A monoid object in a monoidal category ((\mathcal C,\otimes,I)) consists of an object (M), a multiplication morphism
[ \mu\colon M\otimes M\longrightarrow M, ]
and a unit morphism
[ \eta\colon I\longrightarrow M. ]
Associativity is expressed by equality of the composites
[ \mu\circ(\mu\otimes1_M) \quad\text{and}\quad \mu\circ(1_M\otimes\mu)\circ\alpha_{M,M,M}. ]
The unit conditions incorporate the left and right unitors. They require
[ \mu\circ(\eta\otimes1_M)=\lambda_M \qquad\text{and}\qquad \mu\circ(1_M\otimes\eta)=\rho_M. ]
In (\mathbf{Set}) with Cartesian product, monoid objects are ordinary monoids. In vector spaces with tensor product, they are unital associative algebras over a field. This formulation separates the abstract multiplication laws from the concrete nature of the objects carrying them.
Dually, a comonoid object has a comultiplication (M\to M\otimes M) and a counit (M\to I). Comonoids in tensor categories include coalgebras, while comonoids in a cartesian monoidal category arise canonically from diagonal and terminal morphisms.
Monoidal functors
A monoidal functor preserves tensor structure through coherent comparison morphisms. A strong monoidal functor (F\colon\mathcal C\to\mathcal D) carries natural isomorphisms
[ F(A)\otimes F(B)\xrightarrow{\cong}F(A\otimes B) ]
and
[ I_{\mathcal D}\xrightarrow{\cong}F(I_{\mathcal C}), ]
subject to compatibility conditions involving the associators and unitors of both categories.
A lax monoidal functor has comparison morphisms in the same direction that need not be invertible. An oplax monoidal functor reverses their direction. These distinctions determine how monoid and comonoid objects are transported: lax monoidal functors carry monoid objects forward, whereas oplax monoidal functors carry comonoid objects forward.
A monoidal natural transformation between monoidal functors is a natural transformation compatible with their tensor and unit comparison morphisms. Monoidal categories, monoidal functors, and monoidal natural transformations consequently form a higher-dimensional categorical structure rather than an ordinary category with no additional levels.
Braiding, symmetry, and closure
A braided monoidal category has a natural isomorphism
[ \beta_{A,B}\colon A\otimes B\xrightarrow{\cong}B\otimes A ]
satisfying two hexagon axioms that relate the braiding to the associator. The braiding records an allowed interchange of tensor factors, but it need not undo itself after being applied twice.
A symmetric monoidal category is braided and additionally satisfies
[ \beta_{B,A}\circ\beta_{A,B}=1_{A\otimes B}. ]
Cartesian monoidal categories are symmetric, as are vector spaces under their ordinary tensor product. Braided structures without symmetry occur in the categorical treatment of braid groups, quantum groups, and low-dimensional topology.
A closed monoidal category possesses internal hom-objects representing morphisms out of a tensor product. For each object (B), the functor (-\otimes B) then has a right adjoint, commonly written ([B,-]), with a natural correspondence
[ \operatorname{Hom}(A\otimes B,C) \cong \operatorname{Hom}(A,[B,C]). ]
This property permits function-like objects to exist internally and supplies the ambient structure for enriched categories and several forms of categorical logic.