Monoidal functor

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.

Definition

Let $(𝒞, \otimes, I_{𝒞})$ and $(𝒟, ∙, I_{𝒟})$ be monoidal categories. A lax monoidal functor from $𝒞$ to $𝒟$ (which may also just be called a monoidal functor) consists of a functor $F : 𝒞 \to 𝒟$ together with a natural transformation

ϕ_{A, B} : F A ∙ F B \to F (A \otimes B)

between functors $𝒞 \times 𝒞 \to 𝒟$ and a morphism

ϕ : I_{𝒟} \to F I_{𝒞}

,

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

,

and

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

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 (with braidings denoted $γ$ ) such that the following diagram commutes for every pair of objects A, B in $𝒞$ :

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

Examples

The underlying functor $U : (𝐀 𝐛, \otimes_{𝐙}, 𝐙) \to (𝐒 𝐞 𝐭, \times, {*})$ from the category of abelian groups to the category of sets. In this case, the map $ϕ_{A, B} : U (A) \times U (B) \to U (A \otimes B)$ sends (a, b) to $a \otimes b$ ; the map $ϕ : {*} \to ℤ$ sends $*$ to 1.
If $R$ is a (commutative) ring, then the free functor $𝖲 𝖾 𝗍, \to R - 𝗆 𝗈 𝖽$ extends to a strongly monoidal functor $(𝖲 𝖾 𝗍, ⊔, ∅︀) \to (R - 𝗆 𝗈 𝖽, \oplus, 0)$ (and also $(𝖲 𝖾 𝗍, \times, {*}) \to (R - 𝗆 𝗈 𝖽, \otimes, R)$ if $R$ is commutative).
If $R \to S$ is a homomorphism of commutative rings, then the restriction functor $(S - 𝗆 𝗈 𝖽, \otimes_{S}, S) \to (R - 𝗆 𝗈 𝖽, \otimes_{R}, R)$ is monoidal and the induction functor $(R - 𝗆 𝗈 𝖽, \otimes_{R}, R) \to (S - 𝗆 𝗈 𝖽, \otimes_{S}, S)$ is strongly monoidal.
An important example of a symmetric monoidal functor is the mathematical model of topological quantum field theory. Let ${𝐁 𝐨 𝐫 𝐝}_{⟨ n - 1, n ⟩}$ be the category of cobordisms of n-1,n-dimensional manifolds with tensor product given by disjoint union, and unit the empty manifold. A topological quantum field theory in dimension n is a symmetric monoidal functor $F : ({𝐁 𝐨 𝐫 𝐝}_{⟨ n - 1, n ⟩}, ⊔, ∅︀) \to (𝐤 𝐕 𝐞 𝐜 𝐭, \otimes_{k}, k) .$
The homology functor is monoidal as $(C h (R - 𝗆 𝗈 𝖽), \otimes, R [0]) \to (g r R - 𝗆 𝗈 𝖽, \otimes, R [0])$ via the map $H_{*} (C_{1}) \otimes H_{*} (C_{2}) \to H_{*} (C_{1} \otimes C_{2}), [x_{1}] \otimes [x_{2}] \mapsto [x_{1} \otimes x_{2}]$ .

Alternate notions

If $(𝒞, \otimes, I_{𝒞})$ and $(𝒟, ∙, I_{𝒟})$ are closed monoidal categories with internal hom-functors $\Rightarrow_{𝒞}, \Rightarrow_{𝒟}$ (we drop the subscripts for readability), there is an alternative formulation

ψ_AB : F(A ⇒ B) → FA ⇒ FB

of φ_AB commonly used in functional programming. The relation between ψ_AB and φ_AB is illustrated in the following commutative diagrams:

Properties

If $(M, μ, ϵ)$ is a monoid object in $C$ , then $(F M, F μ \circ ϕ_{M, M}, F ϵ \circ ϕ)$ is a monoid object in $D$ .