Monoidal functor

From Wikipedia, the free encyclopedia
Jump to navigation Jump to 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.

Definition

[edit | edit source]

Let (π’ž,βŠ—,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:π’žβ†’π’Ÿ together with a natural transformation

Ο•A,B:FAβˆ™FBβ†’F(AβŠ—B)

between functors π’žΓ—π’žβ†’π’Ÿ and a morphism

Ο•:Iπ’Ÿβ†’FIπ’ž,

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 π’Ÿ.[1]

Variants

[edit | edit source]
  • 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 π’ž :

Examples

[edit | edit source]
  • The underlying functor U:(𝐀𝐛,βŠ—π™,𝐙)β†’(π’πžπ­,Γ—,{βˆ—}) from the category of abelian groups to the category of sets. In this case, the map Ο•A,B:U(A)Γ—U(B)β†’U(AβŠ—B) sends (a, b) to aβŠ—b; the map Ο•:{*}β†’β„€ sends βˆ— to 1.
  • If R is a (commutative) ring, then the free functor 𝖲𝖾𝗍,β†’Rβˆ’π—†π—ˆπ–½ extends to a strongly monoidal functor (𝖲𝖾𝗍,βŠ”,βˆ…)β†’(Rβˆ’π—†π—ˆπ–½,βŠ•,0) (and also (𝖲𝖾𝗍,Γ—,{βˆ—})β†’(Rβˆ’π—†π—ˆπ–½,βŠ—,R) if R is commutative).
  • If Rβ†’S is a homomorphism of commutative rings, then the restriction functor (Sβˆ’π—†π—ˆπ–½,βŠ—S,S)β†’(Rβˆ’π—†π—ˆπ–½,βŠ—R,R) is monoidal and the induction functor (Rβˆ’π—†π—ˆπ–½,βŠ—R,R)β†’(Sβˆ’π—†π—ˆπ–½,βŠ—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⟩,βŠ”,βˆ…)β†’(π€π•πžπœπ­,βŠ—k,k).
  • The homology functor is monoidal as (Ch(Rβˆ’π—†π—ˆπ–½),βŠ—,R[0])β†’(grRβˆ’π—†π—ˆπ–½,βŠ—,R[0]) via the map Hβˆ—(C1)βŠ—Hβˆ—(C2)β†’Hβˆ—(C1βŠ—C2),[x1]βŠ—[x2]↦[x1βŠ—x2].

Alternate notions

[edit | edit source]

If (π’ž,βŠ—,Iπ’ž) and (π’Ÿ,βˆ™,Iπ’Ÿ) are closed monoidal categories with internal hom-functors β‡’π’ž,β‡’π’Ÿ (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:

Commutative diagram demonstrating how a monoidal coherence map gives rise to its applicative formulation
Commutative diagram demonstrating how a monoidal coherence map can be recovered from its applicative formulation

Properties

[edit | edit source]
  • If (M,ΞΌ,Ο΅) is a monoid object in C, then (FM,FΞΌβˆ˜Ο•M,M,FΟ΅βˆ˜Ο•) is a monoid object in D.[2]

Monoidal functors and adjunctions

[edit | edit source]

Suppose that a functor F:π’žβ†’π’Ÿ is left adjoint to a monoidal (G,n):(π’Ÿ,βˆ™,Iπ’Ÿ)β†’(π’ž,βŠ—,Iπ’ž). Then F has a comonoidal structure (F,m) induced by (G,n), defined by

mA,B=Ξ΅FAβˆ™FB∘FnFA,FB∘F(Ξ·AβŠ—Ξ·B):F(AβŠ—B)β†’FAβˆ™FB

and

m=Ξ΅Iπ’Ÿβˆ˜Fn:FIπ’žβ†’Iπ’Ÿ.

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.

See also

[edit | edit source]

Inline citations

[edit | edit source]
  1. ^ Perrone (2024), pp. 360–364
  2. ^ Perrone (2024), pp. 367–368

References

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).