category with duals (list of them)
dualizable object (what they have)
ribbon category, a.k.a. tortile category
monoidal dagger-category?
A monoidal functor is a functor between monoidal categories that preserves the monoidal structure.
A functor between monoidal categories and is called lax monoidal if it is equipped with a morphism
and a natural transformation
satisfying the following conditions
associativity For all we have a commuting diagram
unitality For all we have
and
Lax monoidal functors are the lax morphism for an appropriate 2-monad.
If and are isomorphisms then is called a strong monoidal functor. If they are even identities it is called a strict monoidal functor.
In contrast to this, a strong monoidal functor may also be called a weak monoidal functor. Sometimes the plain term “monoidal functor” is used to mean a strong monoidal functor, in which case the general situation is called a lax monoidal functor.
An oplax monoidal functor (with various alternative names including comonoidal), is a monoidal functor from the opposite categories to .
A monoidal transformation between monoidal functors is a natural transformation that respects the extra structure in an obvious way (…).
Lax monoidal functors send monoids to monoids.
If is a lax monoidal functor and
is a monoid in , then the object is naturally equipped with the structure of a monoid in by setting
and
This construction defines a functor
between the categories of monoids.
Similarly, an oplax monoidal functor sends comonoids to comonoids.
For a monoidal category write for the correspinding delooping 2-category.
Lax monoidal functor correspond to lax 2-functor
If is strong monoidal then this is an ordinary 2-functor. If it is strict monoidal, then this is a strict 2-functor.
Just like monoidal categories, monoidal functors have a string diagram calculus; see these slides for some examples.
monoidal functor