Premonoidal category explained

In category theory, a premonoidal category^[1] is a generalisation of a monoidal category where the monoidal product need not be a bifunctor, but only to be functorial in its two arguments separately. This is in analogy with the concept of separate continuity in topology.

Premonoidal categories naturally arise in theoretical computer science as the Kleisli categories of strong monads.^[2] They also have a graphical language given by string diagrams with an extra wire going through each box so that they cannot be reordered.^{[3] [4] [5]}

Funny tensor product

Cat is a closed monoidal category in exactly two ways: with the usual categorical product and with the funny tensor product.^[6] Given two categories C and D , let C ⇒ D be the category with functors F, G : C \to D as objects and unnatural transformations \alpha : F ⇒ G as arrows, i.e. families of morphisms \{ \alpha _{X} : F(X) \to G(X) \} _{X} which do not necessarily satisfy the condition for a natural transformation.Cat (C \Box D, D') \simeq Cat (C, D ⇒ D' ) for currying. It can be defined explicitly as the pushout of the span (C _{0} x D) \to (C x D) \leftarrow (C x D _{0)} where C _{0,} D _{0} are the discrete categories of objects of C, D and the two functors are inclusions. In the case of groups seen as one-object categories, this is called the free product.

Sesquicategories

The same way we can define a monoidal category as a one-object 2-category, i.e. an enriched category over

( Cat , x ) with the Cartesian product as monoidal structure, we can define a premonoidal category as a one-object sesquicategory,^[7] i.e. a category enriched over ( Cat , \Box) with the funny tensor product as monoidal structure. This is called a sesquicategory (literally, "one-and-a-half category") because it is like a 2-category without the interchange law (\alpha\circ _{0\beta)\circ} _{1(\gamma\circ} _{0\delta)} = (\alpha\circ _{1\gamma)\circ} _{0(\beta\circ} _{1\delta)} .

References

1. Anderson . S.O. . Power . A.J. . April 1997 . A representable approach to finite nondeterminism . Theoretical Computer Science . 177 . 1 . 3–25 . 10.1016/s0304-3975(96)00232-0 . 0304-3975.
2. Power . John . Robinson . Edmund . October 1997 . Premonoidal categories and notions of computation . Mathematical Structures in Computer Science . en . 7 . 5 . 453–468 . 10.1017/S0960129597002375 . 0960-1295.
3. Jeffrey . Alan . 1998 . Premonoidal categories and flow graphs . Electronic Notes in Theoretical Computer Science . 10 . 51 . 10.1016/s1571-0661(05)80688-7 . 1571-0661. free .
4. Web site: Jeffrey . Alan . 1997 . Premonoidal categories and a graphical view of programs .
5. Román . Mario . 2023-08-07 . Promonads and String Diagrams for Effectful Categories . Electronic Proceedings in Theoretical Computer Science . 380 . 344–361 . 10.4204/EPTCS.380.20 . 2205.07664 . 2075-2180.
6. Foltz . F. . Lair . C. . Kelly . G. M. . 1980-05-01 . Algebraic categories with few monoidal biclosed structures or none . Journal of Pure and Applied Algebra . 17 . 2 . 171–177 . 10.1016/0022-4049(80)90082-1 . 0022-4049.
7. Stell . John . 1994 . Modelling Term Rewriting Systems by Sesqui-Categories . Proc. Categories, Algebres, Esquisses et Neo-Esquisses.

External links

• Premonoidal category, funny tensor product and sesquicategory at the nLab