nLab monoidal functor

Redirected from "strict monoidal functor".
Contents

Context

Monoidal categories

monoidal categories

With braiding

With duals for objects

With duals for morphisms

With traces

Closed structure

Special sorts of products

Semisimplicity

Morphisms

Internal monoids

Examples

Theorems

In higher category theory

Contents

1. Idea

A monoidal functor is a functor between monoidal categories that preserves the monoidal structure: a homomorphism of monoidal categories.

2. Definition

Definition 2.1. Let (๐’ž,โŠ— ๐’ž,1 ๐’ž)(\mathcal{C},\otimes_{\mathcal{C}}, 1_{\mathcal{C}}) and (๐’Ÿ,โŠ— ๐’Ÿ,1 ๐’Ÿ)(\mathcal{D},\otimes_{\mathcal{D}}, 1_{\mathcal{D}} ) be two monoidal categories. A lax monoidal functor between them is a functor:

F:๐’žโŸถ๐’Ÿ, F \;\colon\; \mathcal{C} \longrightarrow \mathcal{D} \,,

together with coherence maps:

  1. a morphism

    ฯต:1 ๐’ŸโŸถF(1 ๐’ž) \epsilon \;\colon\; 1_{\mathcal{D}} \longrightarrow F(1_{\mathcal{C}})
  2. a natural transformation

    ฮผ x,y:F(x)โŠ— ๐’ŸF(y)โŸถF(xโŠ— ๐’žy) \mu_{x,y} \;\colon\; F(x) \otimes_{\mathcal{D}} F(y) \longrightarrow F(x \otimes_{\mathcal{C}} y)

    for all x,yโˆˆ๐’žx,y \in \mathcal{C}

satisfying the following conditions:

  1. (associativity) For all objects x,y,zโˆˆ๐’žx,y,z \in \mathcal{C} the following diagram commutes

    (F(x)โŠ— ๐’ŸF(y))โŠ— ๐’ŸF(z) โŸถโ‰ƒa F(x),F(y),F(z) ๐’Ÿ F(x)โŠ— ๐’Ÿ(F(y)โŠ— ๐’ŸF(z)) ฮผ x,yโŠ—idโ†“ โ†“ idโŠ—ฮผ y,z F(xโŠ— ๐’žy)โŠ— ๐’ŸF(z) F(x)โŠ— ๐’ŸF(yโŠ— ๐’žz) ฮผ xโŠ— ๐’žy,zโ†“ โ†“ ฮผ x,yโŠ— ๐’žz F((xโŠ— ๐’žy)โŠ— ๐’žz) โŸถF(a x,y,z ๐’ž) F(xโŠ— ๐’ž(yโŠ— ๐’žz)) \array{ (F(x) \otimes_{\mathcal{D}} F(y)) \otimes_{\mathcal{D}} F(z) &\underoverset{\simeq}{a^{\mathcal{D}}_{F(x),F(y),F(z)}}{\longrightarrow}& F(x) \otimes_{\mathcal{D}}( F(y)\otimes_{\mathcal{D}} F(z) ) \\ {}^{\mathllap{\mu_{x,y} \otimes id}}\downarrow && \downarrow^{\mathrlap{id\otimes \mu_{y,z}}} \\ F(x \otimes_{\mathcal{C}} y) \otimes_{\mathcal{D}} F(z) && F(x) \otimes_{\mathcal{D}} F(y \otimes_{\mathcal{C}} z) \\ {}^{\mathllap{\mu_{x \otimes_{\mathcal{C}} y , z} } }\downarrow && \downarrow^{\mathrlap{\mu_{ x, y \otimes_{\mathcal{C}} z }}} \\ F( ( x \otimes_{\mathcal{C}} y ) \otimes_{\mathcal{C}} z ) &\underset{F(a^{\mathcal{C}}_{x,y,z})}{\longrightarrow}& F( x \otimes_{\mathcal{C}} ( y \otimes_{\mathcal{C}} z ) ) }

    where a ๐’ža^{\mathcal{C}} and a ๐’Ÿa^{\mathcal{D}} denote the associators of the monoidal categories;

  2. (unitality) For all xโˆˆ๐’žx \in \mathcal{C} the following diagrams commute

    1 ๐’ŸโŠ— ๐’ŸF(x) โŸถฯตโŠ—id F(1 ๐’ž)โŠ— ๐’ŸF(x) โ„“ F(x) ๐’Ÿโ†“ โ†“ ฮผ 1 ๐’ž,x F(x) โŸตF(โ„“ x ๐’ž) F(1โŠ— ๐’žx) \array{ 1_{\mathcal{D}} \otimes_{\mathcal{D}} F(x) &\overset{\epsilon \otimes id}{\longrightarrow}& F(1_{\mathcal{C}}) \otimes_{\mathcal{D}} F(x) \\ {}^{\mathllap{\ell^{\mathcal{D}}_{F(x)}}}\downarrow && \downarrow^{\mathrlap{\mu_{1_{\mathcal{C}}, x }}} \\ F(x) &\overset{F(\ell^{\mathcal{C}}_x )}{\longleftarrow}& F(1 \otimes_{\mathcal{C}} x ) }

    and

    F(x)โŠ— ๐’Ÿ1 ๐’Ÿ โŸถidโŠ—ฯต F(x)โŠ— ๐’ŸF(1 ๐’ž) r F(x) ๐’Ÿโ†“ โ†“ ฮผ x,1 ๐’ž F(x) โŸตF(r x ๐’ž) F(xโŠ— ๐’ž1) \array{ F(x) \otimes_{\mathcal{D}} 1_{\mathcal{D}} &\overset{id \otimes \epsilon }{\longrightarrow}& F(x) \otimes_{\mathcal{D}} F(1_{\mathcal{C}}) \\ {}^{\mathllap{r^{\mathcal{D}}_{F(x)}}}\downarrow && \downarrow^{\mathrlap{\mu_{x, 1_{\mathcal{C}} }}} \\ F(x) &\overset{F(r^{\mathcal{C}}_x )}{\longleftarrow}& F(x \otimes_{\mathcal{C}} 1 ) }

    where โ„“ ๐’ž\ell^{\mathcal{C}}, โ„“ ๐’Ÿ\ell^{\mathcal{D}}, r ๐’žr^{\mathcal{C}}, r ๐’Ÿr^{\mathcal{D}} denote the left and right unitors of the two monoidal categories, respectively.

If ฯต\epsilon and all ฮผ x,y\mu_{x,y} are isomorphisms, then FF is called a strong monoidal functor. (Note that โ€˜strongโ€™ is also sometimes applied to โ€˜monoidal functorโ€™ to indicate possession of a tensorial strength.) If they are even identity morphisms, then FF is called a strict monoidal functor.

Remark 2.2. In the literature often the term โ€œmonoidal functorโ€ refers by default to what in def. 2.1 is called a strong monoidal functor. With that convention then what def. 2.1 calls a lax monoidal functor is called a weak monoidal functor.

Remark 2.3. Lax monoidal functors are the lax morphisms for an appropriate 2-monad.

Definition 2.4. An oplax monoidal functor (with various alternative names including comonoidal), is a monoidal functor from the opposite categories C opC^{op} to D opD^{op}.

Definition 2.5. A monoidal transformation between monoidal functors is a natural transformation that respects the extra structure in an obvious way.

3. Properties

Proposition 3.1. (Lax monoidal functors send monoids to monoids)

If F:(C,โŠ—)โ†’(D,โŠ—)F : (C,\otimes) \to (D,\otimes) is a lax monoidal functor and

(AโˆˆC,ฮผ A:AโŠ—Aโ†’A,i A:Iโ†’A) (A \in C,\;\; \mu_A : A \otimes A \to A, \; i_A : I \to A)

is a monoid object in CC, then the object F(A)F(A) is naturally equipped with the structure of a monoid in DD by setting

i F(A):I Dโ†’F(I C)โ†’F(i A)F(A) i_{F(A)} : I_D \stackrel{}{\to} F(I_C) \stackrel{F(i_A)}{\to} F(A)

and

ฮผ F(A):F(A)โŠ—F(A)โ†’โˆ‡ F(A),F(A)F(AโŠ—A)โ†’F(ฮผ A)F(A). \mu_{F(A)} : F(A) \otimes F(A) \stackrel{\nabla_{F(A), F(A)}}{\to} F(A \otimes A) \stackrel{F(\mu_A)}{\to} F(A) \,.

This construction defines a functor

Mon(f):Mon(C)โ†’Mon(D) Mon(f) : Mon(C) \to Mon(D)

between the categories of monoids in CC and DD, respectively.

More generally, lax functors send enriched categories to enriched categories, an operation known as change of enriching category. See there for more details.

Similarly:

Proposition. (oplax monoidal functors sends comonoids to comonoids)

For (C,โŠ—)(C,\otimes) a monoidal category write BC\mathbf{B}C for the corresponding delooping 2-category.

Lax monoidal functor f:Cโ†’Df : C \to D correspond to lax 2-functor

BF:BCโ†’BD. \mathbf{B}F : \mathbf{B}C \to \mathbf{B}D \,.

If FF is strong monoidal then this is an ordinary 2-functor. If it is strict monoidal, then this is a strict 2-functor.

Relation to multicategories

Remark 3.2. Lax monoidal functors between monoidal categories are in correspondence with morphisms between their underlying (representable) multicategories.

Relation to PROs

Remark 3.3. Strong monoidal functors between monoidal categories are in correspondence with morphisms between their underlying (representable) colored PROs.

Remark 3.4. Strict monoidal functors between monoidal categories are in correspondence with morphisms between their underlying colored PROs that preserve the distinguished isomorphisms ()โ†’โˆผI() \xrightarrow{\sim} I and (A,B)โ†’โˆผ(AโŠ—B)(A, B) \xrightarrow{\sim} (A \otimes B) for all A,BA, B.

Relationships between categories of monoidal categories

Proposition 3.5. The 1-category of strict monoidal categories and strict monoidal functors is not equivalent to the 1-category of monoidal categories and strong monoidal functors.

Proof. The former has an initial object, whereas the latter does not.ย ย โ–ฎ

Proposition 3.6. The inclusion from the 1-category of strict monoidal categories and strong monoidal functors into the 1-category of monoidal categories and strong monoidal functors is not an equivalence.

Proof. As mentioned at monoidal category, not every skeletal monoidal category is monoidally equivalent to a strict skeletal monoidal category. Therefore the inclusion is not essentially surjective.ย ย โ–ฎ

Proposition 3.7. The inclusion from the 2-category of strict monoidal categories and strict monoidal functors into the 2-category of monoidal categories and strong monoidal functors is not an equivalence.

Proof. Not every strong monoidal functor between strict monoidal categories is equivalent to a strict one. See for example this MathOverflow question.ย ย โ–ฎ

Proposition 3.8. The inclusion of the the 2-category of strict monoidal categories and strong monoidal functors into the 2-category of monoidal categories and strong monoidal functors is an equivalence.

Proof. By the coherence theorem for monoidal categories, every monoidal category is strong monoidally equivalent to a strict one.ย ย โ–ฎ

4. String diagrams

Just like monoidal categories, monoidal functors have a string diagram calculus; see these slides for some examples.

6. References

Exposition of basics of monoidal categories and categorical algebra:

Last revised on March 27, 2024 at 05:24:40. See the history of this page for a list of all contributions to it.