A monoid is a concept in mathematics similar to that of a group (see Groups), except that every element need not have an inverse. Therefore, a monoid is a set, equipped with a law of composition which is associative, and an identity element. An example of a monoid is the natural numbers (including zero) with the law of composition given by addition.
In this post, we will introduce certain concepts in category theory (see Category Theory) that are abstractions of the classical idea of a monoid.
A monoidal category is given by a category , a bifunctor , an object of , and three natural isomorphisms (also known as the associator), (also known as the left unitor), and (also known as the right unitor), with components
satisfying the conditions
for any four objects , , , and of , and
for any two objects and in .
The following “commutative diagrams” courtesy of user IkamusumeFan of Wikipedia may help express these conditions better (the symbol is used here instead of to denote the bifunctor; this is very common notation, but we use following the book Categories for the Working Mathematician by Saunders Mac Lane in order to differentiate it from the tensor product, which is just one specific example of the bifunctor in question; I hope this will not cause any confusion):
If the natural isomorphisms , , and are identities, then we have a strict monoidal category.
A monoid object, or monoid in a monoidal category is an object of together with two morphisms and satisfying the conditions
Again we can use the following commutative diagrams made by User IkamusumeFan of Wikipedia to help express these conditions:
As examples of monoidal categories, we have the following:
( denotes the category of functors from to itself)
The monoids in these monoidal categories are given respectively by the following:
Strict monoidal categories
Monads (see Adjoint Functors and Monads)
Among the important kinds of monoidal categories with extra structure are braided monoidal categories and symmetric monoidal categories. A braided monoidal category is a monoidal category equipped with a natural isomorphism (also known as a commutativity constraint) with components satisfying the following coherence conditions
which can be expressed in the following commutative diagrams (once again credit goes to User IkamusumeFan of Wikipedia):
The category is a symmetric monoidal category if the isomorphisms satisfy the condition . We have already encountered an example of this category in The Theory of Motives in the form of tensor categories, defined as a symmetric monoidal categories whose Hom-sets (the sets of morphisms from a fixed object to another object ) form a vector space (the term “tensor category” is sometimes used to refer to other concepts in mathematics though, including symmetric monoidal categories themselves).
Another important kind of monoidal category is a closed monoidal category. A closed monoidal category is a monoidal category where the functor has a right adjoint (see Adjoint Functors and Monads) also known as the “internal Hom functor”, which is like a Hom functor that takes values in the category itself instead of in sets, and is denoted by . We have already seen an example of a closed monoidal category in Adjoint Functors and Monads, given by the category of -modules for a fixed commutative ring . There was given by (this is the set of -linear transformations from to , which itself is an -module).
We see therefore that the concepts of monoidal categories and monoids can be found everywhere in mathematics. Studying these structures are not only interesting for their own sake, but can also help us find or construct other useful new concepts in mathematics.
Categories for the Working Mathematician by Saunders Mac Lane