Monoidal functor
From Wikipedia, the free encyclopedia
In category theory, monoidal functors are the "natural" notion of functor between two monoidal categories.
A monoidal functor F between two monoidal categories
and
consists of a functor
together with a natural transformation
and a morphism
,
called the structure morphisms, which are such that for every three objects A, B and C of
the diagrams
commute in the category
.
Suppose that the monoidal categories
and
are braided. The monoidal functor F is braided when the diagram
commutes for every objects A and B of
.
A braided monoidal functor between symmetric monoidal categories is called a symmetric monoidal functor.
Comonoidal (or opmonoidal) functors are defined similarly, with the direction of the structure maps reversed.
A strong monoidal functor is a monoidal functor whose coherence maps are invertible, and a strict monoidal functor is one whose coherence maps are identities.
An example of a monoidal functor is the underlying functor
from the category of abelian groups to the category of sets.
Contents |
[edit] Properties
[edit] Monoidal functors and adjunctions
Suppose that a functor
is left adjoint to a monoidal
. Then F has a comonoidal structure (F,m) induced by (G,n), defined by
and
.
If the induced structure on F is strong, then the unit and counit of the adjunction are monoidal natural transformations, and the adjunction is said to be a monoidal adjunction; conversely, the left adjoint of a monoidal adjunction is always a strong monoidal functor.
Similarly, a right adjoint to a comonoidal functor is monoidal, and the right adjoint of a comonoidal adjunction is a strong monoidal functor.
[edit] See also
[edit] References
- Kelly, G. Max (1974), "Doctrinal adjunction", Lecture Notes in Mathematics, 420, 257–280







