Premonoidal category
An editor has performed a search and found that sufficient sources exist to establish the subject's notability. (October 2024) |
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
[edit]The category of small categories is a closed monoidal category in exactly two ways: with the usual categorical product and with the funny tensor product.[6] Given two categories and , let be the category with functors as objects and unnatural transformations as arrows, i.e. families of morphisms which do not necessarily satisfy the condition for a natural transformation.
The funny tensor product is the left adjoint of unnatural transformations, i.e. there is a natural isomorphism for currying. It can be defined explicitly as the pushout of the span where are the discrete categories of objects of and the two functors are inclusions. In the case of groups seen as one-object categories, this is called the free product.
Sesquicategories
[edit]The same way we can define a monoidal category as a one-object 2-category, i.e. an enriched category over 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 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 .
References
[edit]- ^ Anderson, S.O.; Power, A.J. (April 1997). "A representable approach to finite nondeterminism". Theoretical Computer Science. 177 (1): 3–25. doi:10.1016/s0304-3975(96)00232-0. ISSN 0304-3975.
- ^ Power, John; Robinson, Edmund (October 1997). "Premonoidal categories and notions of computation". Mathematical Structures in Computer Science. 7 (5): 453–468. doi:10.1017/S0960129597002375. ISSN 0960-1295.
- ^ Jeffrey, Alan (1998). "Premonoidal categories and flow graphs". Electronic Notes in Theoretical Computer Science. 10: 51. doi:10.1016/s1571-0661(05)80688-7. ISSN 1571-0661.
- ^ Jeffrey, Alan (1997). "Premonoidal categories and a graphical view of programs".
- ^ Román, Mario (2023-08-07). "Promonads and String Diagrams for Effectful Categories". Electronic Proceedings in Theoretical Computer Science. 380: 344–361. arXiv:2205.07664. doi:10.4204/EPTCS.380.20. ISSN 2075-2180.
- ^ 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. doi:10.1016/0022-4049(80)90082-1. ISSN 0022-4049.
- ^ Stell, John (1994). "Modelling Term Rewriting Systems by Sesqui-Categories" (PDF). Proc. Categories, Algebres, Esquisses et Neo-Esquisses.
External links
[edit]- Premonoidal category, funny tensor product and sesquicategory at the nLab