arxiv: 2604.24166 · v1 · submitted 2026-04-27 · 🧮 math.CT

Recognition: unknown

Diagrammatics for lax and Frobenius monoidal functors and weak morphism classifiers

Alexis Langlois-R\'emillard, Mateusz Stroi\'nski

Pith reviewed 2026-05-07 17:28 UTC · model grok-4.3

classification 🧮 math.CT

keywords lax monoidal functorsweak morphism classifiersdiagrammaticsFrobenius monoidal functorsoplax monoidal functorsstrict monoidal categoriescoherence conditions2-categories

0 comments

The pith

A diagrammatic construction produces the strict monoidal category L(C) whose strict monoidal functors are exactly the lax monoidal functors from any given strict monoidal category C.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper supplies an elementary diagrammatic recipe for building L(C) directly from C. Strict monoidal functors out of this L(C) recover all lax monoidal functors out of C, and the same recipe produces classifiers for oplax monoidal functors and for Frobenius lax monoidal functors. The diagrams are built so that their composition rules enforce the required coherence axioms. This approach stays within ordinary category theory and parallels the graphical calculus McCurdy used for lax monoidal functors themselves.

Core claim

The authors construct L(C) by equipping the underlying category of C with additional morphisms represented by diagrams that encode the lax monoidal structure. Strict monoidal functors from L(C) to any other strict monoidal category D then correspond bijectively to lax monoidal functors from C to D. Parallel diagrammatic constructions are given for the oplax and Frobenius cases, each yielding its own weak morphism classifier whose strict monoidal functors classify the corresponding weaker monoidal functors.

What carries the argument

The weak morphism classifier L(C), built from diagrams whose horizontal and vertical composition rules enforce exactly the coherence conditions for lax, oplax, or Frobenius monoidal functors.

If this is right

Lax monoidal functors from C can be studied by instead working with strict monoidal functors out of the diagrammatically defined L(C).
The same diagrammatic technique supplies classifiers for oplax monoidal functors and for Frobenius lax monoidal functors.
Coherence conditions for these functors become visible as diagrammatic rewrites rather than abstract 2-categorical data.
The construction gives a direct, elementary route to the universal property that the 2-monad theory guarantees abstractly.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The diagrammatics may allow direct graphical proofs of statements about monoidal functors that previously required 2-categorical language.
Similar diagram systems could be developed for other classes of weak functors between monoidal categories or higher structures.
The approach might simplify calculations when composing or transforming lax monoidal functors in concrete examples such as categories of modules or topological spaces.

Load-bearing premise

The chosen diagrams and the rules for composing them capture exactly the coherence conditions for lax, oplax, and Frobenius monoidal functors without missing any required relations or adding extraneous ones.

What would settle it

A concrete lax monoidal functor C to D that fails to arise from any strict monoidal functor L(C) to D, or a strict monoidal functor L(C) to D whose composite with the inclusion of C fails to satisfy the lax monoidal axioms.

read the original abstract

The theory of 2-monads entails that, for a strict monoidal category C, there is a strict monoidal category L(C) such that strict monoidal functors from L(C) are precisely the lax monoidal functors from C. We give an elementary, diagrammatic, construction of L(C) and of its variants for oplax and Frobenius lax functors. The diagrams used are analogous to the diagrammatics for lax monoidal functors studied by McCurdy.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives an explicit generators-and-relations string-diagram construction of the free strict monoidal category L(C) whose strict monoidal functors recover exactly the lax monoidal functors out of C, with parallel versions for oplax and Frobenius cases.

read the letter

The main point is that they build L(C) directly from diagrams rather than deriving it from 2-monad theory. Objects and morphisms in L(C) are generated by the data of C plus new generators for the lax structure maps, and the relations are written as string-diagram rewrites that enforce the usual coherence axioms for lax functors. The same pattern is adapted for the oplax and Frobenius variants by changing which diagrams are allowed and which relations hold. This extends McCurdy's earlier diagrammatic calculus in a straightforward way and makes the universal property visible: any lax monoidal functor F from C factors uniquely through a strict monoidal functor out of L(C) because the diagrams in L(C) literally encode the lax data that F must supply. The construction stays elementary and equational, which is the real contribution here. It avoids heavy abstract machinery while still delivering the classifier that the 2-monad story predicts. The diagrams look standard and the relations appear to match the coherence conditions one would expect, so the central claim holds up on the terms the paper sets. One minor soft spot is that the completeness argument (no extraneous relations are imposed) rests on verifying that every diagram equality forced by the relations corresponds to a valid equality of lax functors; the paper supplies the full list of generators and rules, but that verification is the part a referee will check most closely. This is for category theorists who already work with monoidal categories and string diagrams and want a concrete model for lax structures. A reader who knows McCurdy's diagrams will see the extension immediately and can use the construction as a reference or computational tool. It is not aimed at outsiders. The work is solid enough and the claim is concrete enough that it deserves a serious referee rather than a desk rejection.

Referee Report

2 major / 3 minor

Summary. The paper claims to provide an elementary, diagrammatic construction of the strict monoidal category L(C) on a strict monoidal category C such that strict monoidal functors L(C) → D are in bijection with lax monoidal functors C → D. Analogous constructions are given for the oplax and Frobenius lax cases using string diagrams in the style of McCurdy's calculus, with the goal of avoiding direct appeal to 2-monad theory in the definitions.

Significance. If the diagrammatic generators, relations, and universal property hold as stated, the work supplies a concrete visual calculus for lax monoidal functors that could simplify explicit computations, coherence checks, and pedagogical presentations in monoidal category theory. The approach builds directly on existing string-diagram techniques and offers a parameter-free, equational alternative to abstract free-object constructions.

major comments (2)

[Main construction and universal property theorem] The central verification that the chosen diagrammatic relations are both sound and complete for the lax monoidal coherence axioms (without omissions or extraneous identifications) is load-bearing for the universal property. This needs to be stated explicitly as a theorem with a clear equational argument showing that every lax structure factors uniquely through a strict monoidal functor out of L(C).
[Frobenius lax case] For the Frobenius variant, the additional relations imposed on the diagrams must be shown not to collapse the underlying strict monoidal structure or alter the correspondence with Frobenius lax functors; a concrete check against the standard Frobenius coherence diagrams would confirm this.

minor comments (3)

[Diagrammatic calculus section] Notation for the string diagrams and their composition rules should be introduced with a small table or glossary to avoid ambiguity when multiple variants (lax, oplax, Frobenius) are discussed in parallel.
[Introduction] A brief comparison paragraph relating the new construction to McCurdy's original calculus would help readers see precisely which aspects are reused versus modified.
[Figures] Ensure all coherence diagrams are rendered at a scale that preserves readability of the string crossings and labels.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading, positive assessment, and constructive suggestions. We address the major comments point by point below and will revise the manuscript to make the universal properties and verifications more explicit as requested.

read point-by-point responses

Referee: [Main construction and universal property theorem] The central verification that the chosen diagrammatic relations are both sound and complete for the lax monoidal coherence axioms (without omissions or extraneous identifications) is load-bearing for the universal property. This needs to be stated explicitly as a theorem with a clear equational argument showing that every lax structure factors uniquely through a strict monoidal functor out of L(C).

Authors: We agree that an explicit theorem statement, together with a clear equational argument establishing soundness, completeness, and unique factorization, is essential for the universal property. The manuscript constructs L(C) via generators and relations in the style of McCurdy and indicates the correspondence, but we will add a dedicated theorem (new Theorem 2.15) that states the bijection formally and supplies the required equational argument showing that every lax monoidal structure factors uniquely through a strict monoidal functor out of L(C). revision: yes
Referee: [Frobenius lax case] For the Frobenius variant, the additional relations imposed on the diagrams must be shown not to collapse the underlying strict monoidal structure or alter the correspondence with Frobenius lax functors; a concrete check against the standard Frobenius coherence diagrams would confirm this.

Authors: We will incorporate an explicit verification for the Frobenius case. In the revised manuscript we will add a proposition that directly compares the additional diagrammatic relations to the standard Frobenius coherence axioms, confirming that they introduce no extraneous collapses to the strict monoidal structure and that the correspondence with Frobenius lax functors is preserved. The check will be carried out by equational rewriting against the usual coherence diagrams. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper supplies an explicit generators-and-relations presentation of L(C) via string diagrams, listing all generators, composition rules, and coherence diagrams directly in the text. The central claim—that strict monoidal functors out of this L(C) recover exactly the lax monoidal functors out of C—is verified by equational reasoning internal to the construction rather than by reduction to a prior fit, self-citation, or imported uniqueness theorem. The reference to 2-monad theory appears only as background motivation; the diagrammatic definitions and completeness argument stand on their own without circular dependence on that theory or on any result whose authors overlap with the present paper.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the standard axioms of strict monoidal categories and the background result from 2-monad theory that such an L(C) exists; the paper supplies an elementary model rather than new axioms or entities.

axioms (1)

standard math Axioms of strict monoidal categories and the 2-monad classifier theorem
Invoked in the abstract to guarantee existence of L(C) before the diagrammatic construction is given.

pith-pipeline@v0.9.0 · 5383 in / 1287 out tokens · 62139 ms · 2026-05-07T17:28:12.426234+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

[1]

Blackwell , G

[Bae+18] J. Baez et al.Laxification. Blog post. 2018.url: https : / / golem . ph . utexas . edu / category / 2018 / 05 / laxification.html. [BKP89] R.Blackwell,G.Kelly,andA.Power.“Two-dimensionalmonadtheory”.J.PureAppl.Algebra59.1(1989),pp.1–41. doi:10.1016/0022-4049(89)90160-6. [BLV11] A. Bruguieres, S. Lack, and A. Virelizier. “Hopf monads on monoidal c...

work page doi:10.1016/0022-4049(89)90160-6 2018
[2]

Linearly distributive functors

doi:10.1142/S0218216519500445. arXiv:1602.03080. [CS99] J. R. B. Cockett and R. A. Seely. “Linearly distributive functors”.J. Pure Appl. Algebra143.1-3 (1999), pp. 155–203. doi:10.1016/S0022-4049(98)00110-8. [DP08] B. Day and C. Pastro. “Note on Frobenius monoidal functors”.New York J. Math14 (2008), pp. 733–742.url: https://nyjm.albany.edu/j/2008/14-31.h...

work page doi:10.1142/s0218216519500445 1999
[3]

Frobenius monoidal functors from ambiadjunctions and their lifts to Drinfeld centers

arXiv:2402.10094 [math.CT]. [FLP25] J. Flake, R. Laugwitz, and S. Posur. “Frobenius monoidal functors from ambiadjunctions and their lifts to Drinfeld centers”.Adv. Math.475 (2025), p. 110344.doi:10.1016/j.aim.2025.110344 . arXiv: 2410.08702 [math.CT]. [IKO25] M. S. Im, M. Khovanov, and V. Ostrik. “Universal construction in monoidal and non-monoidal setti...

work page doi:10.1016/j.aim.2025.110344 2025
[4]

Graphical methods for Tannaka duality of weak bialgebras and weak Hopf algebras

[McC12] M. B. McCurdy. “Graphical methods for Tannaka duality of weak bialgebras and weak Hopf algebras”.Theory Appl. Categ26.9 (2012), pp. 233–280.url:http://www.tac.mta.ca/tac/volumes/26/9/26-09. [Mel06] P.-A. Melliès. “Functorial boxes in string diagrams”.International Workshop on Computer Science Logic. Springer. 2006, pp. 1–30.doi:10.1007/11874683. [...

work page doi:10.1007/11874683 2012