Coherent Presentations of Monoidal Categories

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations where the objects are considered modulo an equivalence relation, which is described by equational generators. When those form a convergent (abstract) rewriting system on objects, there are three very natural constructions that can be used to define the category which is described by the presentation: one consists in turning equational generators into identities (i.e. considering a quotient category), one consists in formally adding inverses to equational generators (i.e. localizing the category), and one consists in restricting to objects which are normal forms. We show that, under suitable coherence conditions on the presentation, the three constructions coincide, thus generalizing celebrated results on presentations of groups, and we extend those conditions to presentations of monoidal categories.

[1]  A. Power,et al.  A 2-categorical pasting theorem , 1990 .

[2]  Philippe Malbos,et al.  Polygraphs of finite derivation type , 2014, Mathematical Structures in Computer Science.

[3]  Ross Street,et al.  Limits indexed by category-valued 2-functors , 1976 .

[4]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[5]  Michael Barr,et al.  GENERALIZED CONGRUENCES — EPIMORPHISMS IN Cat , 1999 .

[6]  S. Lane Categories for the Working Mathematician , 1971 .

[7]  H. Tietze,et al.  Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten , 1908 .

[8]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[9]  F. Borceux Handbook Of Categorical Algebra 1 Basic Category Theory , 2008 .

[10]  M. Newman On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[11]  Peter Gabriel,et al.  Calculus of Fractions and Homotopy Theory , 1967 .

[12]  Patrick Dehornoy,et al.  On completeness of word reversing , 2000, Discret. Math..

[13]  Brian Day,et al.  Note on monoidal localisation , 1973, Bulletin of the Australian Mathematical Society.

[14]  Samuel Mimram,et al.  Towards 3-Dimensional Rewriting Theory , 2014, Log. Methods Comput. Sci..

[15]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[16]  Yves Lafont,et al.  Towards an algebraic theory of Boolean circuits , 2003 .

[17]  Albert Burroni,et al.  Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[18]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[19]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Samuel Mimram,et al.  Presenting a Category Modulo a Rewriting System , 2015, RTA.

[21]  Samuel Mimram,et al.  A Homotopical Completion Procedure with Applications to Coherence of Monoids , 2013, RTA.

[22]  Patrick Dehornoy,et al.  Foundations of Garside theory (EMS Tracts in Mathematics 22) , 2015 .