Proofs of coherence in category theory, starting from Mac Lane's original proof of coherence for monoidal categories, are sometimes based on confluence techniques analogous to what one finds in the lambda calculus, or in term-rewriting systems in general. This applies to coherence results that assert that a category is a preorder, i.e. that ``all diagrams commute''. This note is about this analogy, paying particular attention to cases where the category for which coherence is proved is not a groupoid.
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal endofunctors, i.e. endofunctors of a monoidal category that preserve the monoidal structure up to a natural transformation that need not be an isomorphism. These results are proved first in the absence of symmetry in the monoidal structure, and then with this symmetry. In the later parts of the paper the coherence results are extended to monoidal endofunctors in monoidal categories that have diagonal or codiagonal natural transformations, or where the monoidal structure is given by finite produc…
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor (this means that it preserves the monoidal structure up to a natural transformation that need not be an isomorphism). These results are proved first in the absence of symmetry in the monoidal structure, and then with this symmetry. The monoidal structure is also allowed to be given with finite products or finite coproducts. Monoidal comonads with finite pro…
We prove a coherence theorem for braided monoidal bicategories and relate it to the coherence theorem for monoidal bicategories. We show how coherence for these structures can be interpretted topologically using up-to-homotopy operad actions and the algebraic classification of surface braids.
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an asphericity problem for a track category and we use rewriting methods on polygraphs to solve it. The setting is extended to more general coherence problems, seen as 3-dimensional word problems in a track category, including the case of braided monoidal categories.
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established. Namely, we obtain a method to determine if two morphisms are equal up to a certain equivalence.
This paper proves three different coherence theorems for symmetric monoidal bicategories. First, we show that in a free symmetric monoidal bicategory every diagram of 2-cells commutes. Second, we show that this implies that the free symmetric monoidal bicategory on one object is equivalent, as a symmetric monoidal bicategory, to the discrete symmetric monoidal bicategory given by the disjoint union of the symmetric groups. Third, we show that every symmetric monoidal bicategory is equivalent to a strict one. We give two topological applications of these coherence results. First, we show that t…
A symmetric monoidal category is a category equipped with an associative and commutative (binary) product and an object which is the unit for the product. In fact, those properties only hold up to natural isomorphisms which satisfy some coherence conditions. The coherence theorem asserts the commutativity of all linear diagrams involving the left and right unitors, the associator and the braiding. We prove the coherence for symmetric monoidal categories using a homotopical method based on rewriting. For that scope, we detail the con vergence proof of Lafont's string diagram rewriting system wh…
I motivate a variation (due to K. Szlachányi) of monoidal categories called skew-monoidal categories where the unital and associativity laws are not required to be isomorphisms, only natural transformations. Coherence has to be formulated differently than in the well-known monoidal case. In my (to my knowledge new) version, it becomes a statement of uniqueness of normalizing rewrites. I present a proof of this coherence theorem and also formalize it fully in the dependently typed programming language Agda.
It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a definition of weak P-category for any strongly regular (operadic) theory P, and show that every weak P-category is equivalent via P-functors and P-transformations to a strict P-category. This strictification functor is then shown to have an interesting universal property.
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's coherence theorem for symmetric monoidal closed categories. A coherence theorem with respect to these graphs is proved for proof-net categories. Such a coherence theorem is also proved in the presence of arrows corresponding to the mix principle of linear logic. The notion of proof-net category catches the unit free fragment of the notion of star-autonomous categ…
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold only up to coherent isomorphism. This generalizes the theories of monoidal categories and symmetric monoidal categories, and several related notions defined in the literature. Using this definition, we generalize the result that every monoidal category is monoidally equivalent to a strict monoidal category, and show that the "strictification" functor has an i…
Coherence theorems are fundamental to how we think about monoidal categories and their generalizations. In this paper we revisit Mac Lane's original proof of coherence for monoidal categories using the Grothendieck construction. This perspective makes the approach of Mac Lane's proof very amenable to generalization. We use the technique to give efficient proofs of many standard coherence theorems and new coherence results for bicategories with shadow and for their functors.
It is shown that coherence conditions for monoidal categories concerning associativity are analogous to coherence conditions for symmetric or braided strictly monoidal categories, where associativity arrows are identities. Mac Lane's pentagonal coherence condition for associativity is decomposed into conditions concerning commutativity, among which we have a condition analogous to naturality and a degenerate case of Mac Lane's hexagonal condition for commutativity. This decomposition is analogous to the derivation of the Yang-Baxter equation from Mac Lane's hexagon and the naturality of commut…
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in terms of natural transformations equipped with ``graphs'' (g-natural transformations), and corresponding morphism theorems are given as consequences. Using these results, some basic relations between the free categories of these classes are obtained.
This paper studies questions of coherence and strictification related to self-similarity - the identity $S\cong S\otimes S$ in a (semi-)monoidal category. Based on Saavedra's theory of units, we first demonstrate that strict self-similarity cannot simultaneously occur with strict associativity -- i.e. no monoid may have a strictly associative (semi-)monoidal tensor, although many monoids have a semi-monoidal tensor associative up to isomorphism. We then give a simple coherence result for the arrows exhibiting self-similarity and use this to describe a `strictification procedure' that gives a s…
We introduce categorical models of $N_\infty$ spaces, which we call normed symmetric monoidal categories (NSMCs). These are ordinary symmetric monoidal categories equipped with compatible families of norm maps, and when specialized to a particular class of examples, they reveal a connection between the equivariant symmetric monoidal categories of Guillou-May-Merling-Osorno and those of Hill-Hopkins. We also give an operadic interpretation of the Mac Lane coherence theorem and generalize it to include NSMCs. Among other things, this theorem ensures that the classifying space of a NSMC is a $N_\…
A coherence result for symmetric monoidal closed categories with biproducts is shown in this paper. It is explained how to prove, by using the same technique, coherence for compact closed categories with biproducts and for dagger compact closed categories with dagger biproducts.
We introduce a tensor product for symmetric monoidal categories with the following properties. Let SMC denote the 2-category with objects small symmetric monoidal categories, arrows symmetric monoidal functors and 2-cells monoidal natural transformations. Our tensor product together with a suitable unit is part of a structure on SMC that is a 2-categorical version of the symmetric monoidal closed categories. This structure is surprisingly simple. In particular the arrows involved in the associativity and symmetry laws for the tensor and in the unit cancellation laws are 2-natural and satisfy c…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version of coherence that is weaker than the usual notion of monoidal coherence.
We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for stable homotopy groups.
Many monoidal-type objects are known to be classified by maps from the Catalan simplicial set $\mathbb{C}$ to various nerves of categories and higher categories. There are, for example, three different nerves of the 2-category of categories $\mathsf{Cat}$ with the property that maps from $\mathbb{C}$ into them are in one to one correspondence with strict monoidal, monoidal, and skew monoidal categories. In this last case, the classification result can be understood as justifying the definition of skew monoidal categories intrinsically in terms of the structure of $\mathbb{C}$. In this paper, w…
This paper presents the proof of the coherence theorem for Ann-categories whose set of axioms and original basic properties were given in [9]. Let $$\A=(\A,{\Ah},c,(0,g,d),a,(1,l,r),{\Lh},{\Rh})$$ be an Ann-category. The coherence theorem states that in the category $ \A$, any morphism built from the above isomorphisms and the identification by composition and the two operations $\tx$, $\ts$ only depends on its source and its target. The first coherence theorems were built for monoidal and symmetric monoidal categories by Mac Lane [7]. After that, as shown in the References, there are many res…
We consider a theory of centers and homotopy centers of monoids in monoidal categories which themselves are enriched in duoidal categories. Duoidal categories (introduced by Aguillar and Mahajan under the name 2-monoidal categories) are categories with two monoidal structures which are related by some, not necessary invertible, coherence morphisms. Centers of monoids in this sense include many examples which are not `classical.' In particular, the 2-category of categories is an example of a center in our sense. Examples of homotopy center (analogue of the classical Hochschild complex) include …
The skew monoidal categories of Szlachányi are a weakening of monoidal categories where the three structural laws of left and right unitality and associativity are not required to be isomorphisms but merely transformations in a particular direction. In previous work, we showed that the free skew monoidal category on a set of generating objects can be concretely presented as a sequent calculus. This calculus enjoys cut elimination and admits focusing, i.e. a subsystem of canonical derivations, which solves the coherence problem for skew monoidal categories. In this paper, we develop sequent cal…
A concrete model of the free skew-monoidal category Fsk on a single generating object is obtained. The situation is clubbable in the sense of G.M. Kelly, so this allows a description of the free skew-monoidal category on any category. As the objects of Fsk are meaningfully bracketed words in the skew unit I and the generating object X, it is necessary to examine bracketings and to find the appropriate kinds of morphisms between them. This leads us to relationships between triangulations of polygons, the Tamari lattice, left and right bracketing functions, and the orientals. A consequence of ou…
Differential categories are now an established abstract setting for differentiation. However not much attention has been given to the process which is inverse to differentiation: integration. This paper presents the parallel development for integration by axiomatizing an integral transformation, $s_A: !A \to !A \otimes A$, in a symmetric monoidal category with a coalgebra modality. When integration is combined with differentiation, the two fundamental theorems of calculus are expected to hold (in a suitable sense): a differential category with integration which satisfies these two theorem is c…
A relevant category is a symmetric monoidal closed category with a diagonal natural transformation that satisfies some coherence conditions. Every cartesian closed category is a relevant category in this sense. The denomination 'relevant' comes from the connection with relevant logic. It is shown that the category of sets with partial functions, which is isomorphic to the category of pointed sets, is a category that is relevant, but not cartesian closed.
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 identi…
A new, self-contained, proof of a coherence result for categories equipped with two symmetric monoidal structures bridged by a natural transformation is given. It is shown that this coherence result is sufficient for $ω\timesω$-indexed family of iterated reduced bar constructions based on such a category.
In here we define the concept of fibered symmetric bimonoidal categories. These are roughly speaking fibered categories D->C whose fibers are symmetric monoidal categories parametrized by C and such that both D and C have a further structure of a symmetric monoidal category that satisfy certain coherences that we describe. Our goal is to show that we can correspond to a fibered symmetric bimonoidal category an E_{\infty}-ring spectrum in a functorial way.
Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is two-fold: there are many applications---including to automata, databases, circuits, linear relations, graph rewriting, and belief propagation---and yet the standard definition is so involved and ornate as to be difficult to find in the literature. Indeed, a hypergraph category is, roughly speaking, a "symmetric monoidal category in which each object is equipped…
We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,α)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $α: I \tensor I \to I$ is an equivalence in $\CC$. We show that this notion of weak unit has coherence built in: Theorem A: $α$ has a canonical associator 2-cell, which automatically satisfies the pentagon equation. Theorem B: every morphism of weak units is automatically compatible with those associators. Theorem C: the 2-category of weak units is contractible if non-emp…
In this chapter we survey some particular topics in category theory in a somewhat unconventional manner. Our main focus will be on monoidal categories, mostly symmetric ones, for which we propose a physical interpretation. These are particularly relevant for quantum foundations and for quantum informatics. Special attention is given to the category which has finite dimensional Hilbert spaces as objects, linear maps as morphisms, and the tensor product as its monoidal structure (FdHilb). We also provide a detailed discussion of the category which has sets as objects, relations as morphisms, and…
We show that the regular patterns of Getzler (2009) form a 2-category biequivalent to the 2-category of substitudes of Day and Street (2003), and that the Feynman categories of Kaufmann and Ward (2013) form a 2-category biequivalent to the 2-category of coloured operads (with invertible 2-cells). These biequivalences induce equivalences between the corresponding categories of algebras. There are three main ingredients in establishing these biequivalences. The first is a strictification theorem (exploiting Power's General Coherence Result) which allows to reduce to the case where the structure …
In this paper, we develop the proof theory of skew prounital closed categories. These are variants of the skew closed categories of Street where the unit is not represented. Skew closed categories in turn are a weakening of the closed categories of Eilenberg and Kelly where no structural law is required to be invertible. The presence of a monoidal structure in these categories is not required. We construct several equivalent presentations of the free skew prounital closed category on a given set of generating objects: a categorical calculus (Hilbert-style system), a cut-free sequent calculus a…
An operad (this paper deals with non-symmetric operads)may be conceived as a partial algebra with a family of insertion operations, Gerstenhaber's circle-i products, which satisfy two kinds of associativity, one of them involving commutativity. A Cat-operad is an operad enriched over the category Cat of small categories, as a 2-category with small hom-categories is a category enriched over Cat. The notion of weak Cat-operad is to the notion of Cat-operad what the notion of bicategory is to the notion of 2-category. The equations of operads like associativity of insertions are replaced by isomo…
