Monoidal functor

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In category theory, monoidal functors are functors between monoidal categories which preserve the monoidal structure. More specifically, a monoidal functor between two monoidal categories consists of a functor between the categories, along with two coherence maps—a natural transformation and a morphism that preserve monoidal multiplication and unit, respectively. Mathematicians require these coherence maps to satisfy additional properties depending on how strictly they want to preserve the monoidal structure; each of these properties gives rise to a slightly different definition of monoidal functors:

The coherence maps of lax monoidal functors satisfy no additional properties; they are not necessarily invertible.
The coherence maps of strong monoidal functors are invertible.
The coherence maps of strict monoidal functors are identity maps.

Although we distinguish between these different definitions here, authors may call any one of these simply monoidal functors.

[edit] Definition

Let $(\mathcal$ and $(\mathcal$ be monoidal categories. A monoidal functor from $\mathcal$ to $\mathcal$ consists of a functor $F:\mathcal$ together with a natural transformation

$\phi_{A,B}:FA\bullet$

and a morphism

$\phi:I_D\to$ ,

called the coherence maps or structure morphisms, which are such that for every three objects $A$ , $B$ and $C$ of $\mathcal$ the diagrams

,

and

commute in the category $\mathcal$ . Above, the various natural transformations denoted using $α,ρ,λ$ are parts of the monoidal structure on $\mathcal$ and $\mathcal$ .

[edit] Variants

The dual of a monoidal functor is a comonoidal functor; it is a monoidal functor whose coherence maps are reversed. Comonoidal functors may also be called opmonoidal, colax monoidal, or oplax monoidal functors.

A strong monoidal functor is a monoidal functor whose coherence maps $ϕ A, B,ϕ$ are invertible.
A strict monoidal functor is a monoidal functor whose coherence maps are identities.
A braided monoidal functor is a monoidal functor between braided monoidal categories such that the following diagram commutes for every pair of objects A, B in $\mathcal$ :

A symmetric monoidal functor is a braided monoidal functor whose domain and codomain are symmetric monoidal categories.

[edit] Properties

[edit] Example

The underlying functor $U:(\mathbf{Ab},\otimes_\mathbf{Z},\mathbf{Z})$ from the category of abelian groups to the category of sets. In this case, the map $\phi_{A,B}\colon$ is a surjection induced by the bilinearity relation, i.e. $ϕ A, B (n a, b) = ϕ A, B (a, n b)$ for $n\in\mathbb$ ; the map $\phi\colon$ sends * to 1.

[edit] Monoidal functors and adjunctions

Suppose that a functor $F:\mathcal$ is left adjoint to a monoidal $(G,n):(\mathcal$ . Then $F$ has a comonoidal structure $(F, m)$ induced by $(G, n)$ , defined by

$m_{A,B}=\varepsilon_{FA\bullet$

and

$m=\varepsilon_{I_{\mathcal$ .

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

Monoidal natural transformation

[edit] References

Kelly, G. Max (1974), Doctrinal adjunction, Lecture Notes in Mathematics, 420, 257–280