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 homomorphism of monoidal categories.
A functor $F : C \to D$ between strict monoidal categories $(C,\otimes)$ and $(D,\otimes)$ is called lax monoidal if it is equipped with a morphism
and a natural transformation
satisfying the following conditions
associativity For all $x,y,z \in C$ we have a commuting diagram
unitality For all $x \in C$ we have
and
Lax monoidal functors are the lax morphism for an appropriate 2-monad.
If $\epsilon$ and $\mu_{x,y}$ are isomorphisms then $F$ 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 $C^{op}$ to $D^{op}$.
A monoidal transformation between monoidal functors is a natural transformation that respects the extra structure in an obvious way.
If the monoidal categories are not strict one obtains correspondingly more coherence diagrams. One way to summarize these is to note that a monoidal category $C$ is equivalently its pointed delooping 2-category/bicategory $\mathbf{B}C$ (with a single object and $C$ as its hom-object), then a monoidal functor $C \to D$ is equivalently a 2-functor/pseudofunctor $\mathbf{B}C \to \mathbf{B}D$. Using this one can infer the coherence diagrams as special cases from those discussed at pseudofunctor.
Lax monoidal functors send monoids to monoids.
If $F : (C,\otimes) \to (D,\otimes)$ is a lax monoidal functor and
is a monoid in $C$, then the object $F(A)$ is naturally equipped with the structure of a monoid in $D$ by setting
and
This construction defines a functor
between the categories of monoids.
Similarly, an oplax monoidal functor sends comonoids to comonoids.
For $(C,\otimes)$ a monoidal category write $\mathbf{B}C$ for the correspinding delooping 2-category.
Lax monoidal functor $f : C \to D$ correspond to lax 2-functor
If $F$ 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
strong monoidal functor
lax monoidal functor