Math 2.0

Category theory; homological algebra Definition

Monoidal functor

Builds on Monoidal categoryFunctorNatural transformation

Definition

Let (𝒞,⊗,I,α,λ,ρ)(\mathcal{C}, \otimes, I, \alpha, \lambda, \rho) and (𝒟,⊗′,I′,α′,λ′,ρ′)(\mathcal{D}, \otimes', I', \alpha', \lambda', \rho') be monoidal categories. A (lax) monoidal functor from 𝒞\mathcal{C} to 𝒟\mathcal{D} is a functor F ⁣:𝒞→𝒟F \colon \mathcal{C} \to \mathcal{D} together with:

  1. a morphism ε ⁣:I′→F(I)\varepsilon \colon I' \to F(I);
  2. a natural transformation μ\mu with components μA,B ⁣:F(A)⊗′F(B)→F(A⊗B)\mu_{A,B} \colon F(A) \otimes' F(B) \to F(A \otimes B);

such that for all objects A,B,CA, B, C of 𝒞\mathcal{C}:

  1. associativity: F(αA,B,C)∘μA⊗B,C∘(μA,B⊗′id⁡F(C))=μA,B⊗C∘(id⁡F(A)⊗′μB,C)∘αF(A),F(B),F(C)′F(\alpha_{A,B,C}) \circ \mu_{A \otimes B, C} \circ (\mu_{A,B} \otimes' \id_{F(C)}) = \mu_{A, B \otimes C} \circ (\id_{F(A)} \otimes' \mu_{B,C}) \circ \alpha'_{F(A),F(B),F(C)};
  2. left unitality: F(λA)∘μI,A∘(ε⊗′id⁡F(A))=λF(A)′F(\lambda_A) \circ \mu_{I,A} \circ (\varepsilon \otimes' \id_{F(A)}) = \lambda'_{F(A)};
  3. right unitality: F(ρA)∘μA,I∘(id⁡F(A)⊗′ε)=ρF(A)′F(\rho_A) \circ \mu_{A,I} \circ (\id_{F(A)} \otimes' \varepsilon) = \rho'_{F(A)}.

The functor is strong monoidal if ε\varepsilon and all μA,B\mu_{A,B} are isomorphisms, and strict monoidal if they are identities.

Remarks

Example: the forgetful functor U ⁣:(𝐀𝐛,⊗,ℤ)→(𝐒𝐞𝐭,×,{∗})U \colon (\mathbf{Ab}, \otimes, \Z) \to (\mathbf{Set}, \times, \set{*}) with μA,B(a,b)=a⊗b\mu_{A,B}(a, b) = a \otimes b and ε(∗)=1\varepsilon(*) = 1. Both sides of the associativity axiom send ((a,b),c)((a, b), c) to a⊗(b⊗c)a \otimes (b \otimes c), and the left unit axiom reads 1⊗a↦a1 \otimes a \mapsto a. It is lax but not strong, since A×B→A⊗BA \times B \to A \otimes B is not a bijection in general. Non-example: the forgetful functor from ℝ\R-vector spaces with ⊗\otimes to (𝐒𝐞𝐭,×)(\mathbf{Set}, \times), with μ(u,v)=u⊗v\mu(u, v) = u \otimes v but with ε(∗)=0\varepsilon(*) = 0. The left unit axiom fails: it would send (∗,v)(*, v) to 0⊗v=00 \otimes v = 0, while λ′\lambda' sends it to vv. Some authors say "monoidal functor" for strong monoidal functors only; the lax version is then called lax monoidal.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Functor concept
  2. Monoidal category concept
  3. Natural transformation concept
  4. Monoidal functor definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Monoidal_functor
About this page
TagQGG9GJN73C
URIm2://QGG9GJN73C
Kinddefinition
WritingW0 stub
MSC18M05, 18A22
DefinesMonoidal functor
UsesMonoidal category, Functor, Natural transformation
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.