Diagrammatics for lax and Frobenius monoidal functors and weak morphism classifiers

Diagrammatic Constructions and Morphism Classifiers in Monoidal Categories

Motivation and Context

The paper "Diagrammatics for lax and Frobenius monoidal functors and weak morphism classifiers" (2604.24166) presents a comprehensive treatment of diagrammatic calculus for monoidal functors with various flavors of "weakness"—specifically, lax, oplax, and Frobenius monoidal functors. These generalized homomorphisms have recently gained prominence in applications spanning Hopf monads, tensor categories, Drinfeld centers, infinitesimal braidings, virtual tangles, higher TQFTs, and modular fusion category condensation. The paper addresses the existence and explicit description of universal classifiers for such weak morphisms, situating its results in the landscape of $2$-monads, but focusing on a direct, elementary and diagrammatic approach.

Construction of Morphism Classifiers

Lax Monoidal Functor Classifier

Let $\mathsf{C}$ be a strict monoidal category. The paper constructs a new strict monoidal category $(\mathsf{C})$, defined via generators and relations, whose objects are finite lists of $\underline{x}$ for $x\in\mathrm{Obj}(\mathsf{C})$, forming the free monoid. Morphisms include, for each $f\in\mathrm{Hom}_{\mathsf{C}}(x,y)$, a corresponding $\underline{f}:\underline{x}\to\underline{y}$, as well as generators $\ell_{x,z}$ (encoding monoidal structure) and $\mathscr{j}$ (unit). The relations enforce functoriality, monoidal compatibility, associativity, and unitality.

The main structural result is the explicit categorical isomorphism:

$$\mathbf{Lax}(\mathsf{C},\mathsf{D}) \cong \mathbf{Strict}((\mathsf{C}),\mathsf{D})$$

This provides an elementary classifier—strict monoidal functors out of $\mathsf{C}$0 correspond precisely to lax monoidal functors out of $\mathsf{C}$1.

Oplax and Frobenius Envelopes

This construction generalizes to oplax monoidal functors, using opposites and appropriately modifying generators and relations (e.g. $\mathsf{C}$2 replaces $\mathsf{C}$3). For the Frobenius case, both lax and oplax generators and relations are introduced, together with Frobenius compatibility axioms (captured via additional diagrammatic identities). The explicit isomorphism:

$\mathsf{C}$4

classifies Frobenius monoidal functors via strict functors from a diagrammatically presented envelope.

Diagrammatic Calculus

The paper interprets the generators, morphisms, and relations of these classifiers via a diagrammatic calculus embedding the string diagrams of $\mathsf{C}$5 into an "envelope." This approach generalizes and systematizes previous graphical formalisms (e.g. those developed by McCurdy, Ponto-Schulman, Mulevičius), including the diagrammatics for Frobenius algebras/TQFTs.

Generators are represented as basic diagrams (e.g., identity morphism as vertical strands; $\mathsf{C}$6 as merging strands), and relations become graphical identities such as the commutativity of crossing diagrams or the compatibility of cups and caps for duals. The Frobenius relations correspond to the essential graphical equations that unify lax and oplax structure in the presence of compatible monoidal data.

A key technical result is that the "enveloping" process preserves structures such as rigidity: if $\mathsf{C}$7 is a rigid object (with dual $\mathsf{C}$8) in $\mathsf{C}$9, then $(\mathsf{C})$0 remains rigid in the envelope $(\mathsf{C})$1.

Numerical and Structural Results

• The categorical isomorphisms between categories of weak monoidal functors and categories of strict monoidal functors from explicitly constructed envelopes provide concrete classifiers, addressing previously posed questions (e.g., those by Baez on universal properties for lax/oplax functors).
• The paper proves that Frobenius monoidal functors preserve dual pairs.
• A remarkable structural result is that any lax and oplax monoidal transformation between Frobenius monoidal functors (when the source is rigid) is invertible, which has implications for the uniqueness of natural transformations in modular settings.

Implications and Future Directions

The explicit, diagrammatic construction of classifiers for weak monoidal functors clarifies and systematizes the role of graphical calculus in category theory and mathematical physics, particularly in tensor categories and TQFTs. The existence of these classifiers enables more transparent treatments of monoidal structures in computational frameworks, as well as in higher categorical settings.

From a theoretical standpoint, these constructions bridge $(\mathsf{C})$2-monad abstract existence results with combinatorially, diagrammatically accessible presentations. In practice, this foundation supports applications in quantization, topological field theory, and tensor category theory where weak morphisms play a central role. The invertibility result for natural transformations between Frobenius monoidal functors suggests broader rigidity phenomena in diagrammatic categories, warranting further investigation.

Anticipated future work includes extending the diagrammatic envelope formalism to braided, ribbon, and more general monoidal structures, exploring computational implementations, and leveraging the explicit classifiers in the study of generalized TQFTs and categorical invariants.

Conclusion

This paper provides a detailed diagrammatic construction of classifiers for lax, oplax, and Frobenius monoidal functors, giving explicit presentations and graphical calculus that bridge abstract $(\mathsf{C})$3-monad theory and hands-on category-theoretic practice. The structural isomorphisms, duality preservation, and invertibility results for transformations among Frobenius monoidal functors together constitute a solid foundation for both theoretical exploration and practical applications in monoidal category theory and its mathematical physics manifestations.