nLab cocartesian multicategory

Contents

Context

Monoidal categories

monoidal categories

With braiding

With duals for objects

With duals for morphisms

With traces

Closed structure

Special sorts of products

Semisimplicity

Morphisms

Internal monoids

Examples

Theorems

In higher category theory

Category theory

Contents

Idea

The 2-category Cat Cat of categories embeds fully faithfully into the 2-category MulticatMulticat of multicategories in two ways:

  1. As the unary multicategories (i.e. in which every multimorphism has unary domain).
  2. Via the “discrete cocones” construction, in which we define the multimorphisms of the multicategory C C_\blacktriangleright induced by a category CC by
    C (X 1,,X n;Y):=C(X 1,Y)××C(X n,Y) C_\blacktriangleright(X_1, \ldots, X_n; Y) := C(X_1, Y) \times \cdots \times C(X_n, Y)

A multicategory is isomorphic to one induced by the discrete cocones construction exactly when it is a generalized multicategory relative to the monad on Prof whose algebras are categories with (strict) finite coproducts, i.e. a “virtual cocartesian category”. Thus, such a multicategory is called a cocartesian multicategory.

An older name for a cocartesian multicategory is a sequential multicategory, since its multimorphisms are sequences of unary morphisms.

Equivalence of definitions

Theorem

For a symmetric multicategory EE the following are equivalent.

  1. EC E \cong C_\blacktriangleright for some category CC (which then must be the category of unary morphisms in EE).

  2. Every object of EE is a monoid object, in a way that commutes with all the multimorphisms of EE.

  3. Every object of EE is a unital magma object, in a way that commutes with all the multimorphisms of EE.

  4. EE is equipped with

    • “expansion” operations (the dual of contraction)
      E(,x,)E(,x,x,)E(\dots, x, \dots) \to E(\dots, x,x,\dots)
    • “strengthening” operations (the dual of weakening)
      E(,x,)E(,)E(\dots, x,\dots) \to E(\dots, \dots)

    satisfying certain evident axioms.

  5. EE has the structure of a virtual TT-algebra, where TT is the monad on Prof whose algebras are cocartesian strict monoidal categories.

The equivalence of (1)–(3) is Proposition 3.6 (3.7 in the arXiv version v1) of Pisani 14.

Proof

In (5), the additional structure in a virtual cocartesian category beyond that of a virtual symmetric monoidal category (that is, a symmetric multicategory) consists of generalized nn-ary expansion/strengthening operations. These are generated by the binary and nullary operations displayed in (4), and the “evident axioms” in (4) are chosen precisely so as to make it equivalent to (5).

It is easy to check that (1) implies all the other conditions, and of course (2) implies (3).

Now assuming (3), the free symmetric monoidal category FEF E generated by EE, whose objects are finite lists of objects of EE, also inherits the property stated in (3), along with compatibility with its monoidal structure. Therefore, by the dual of Arkor’s version of Fox's theorem, FEF E is cocartesian monoidal. Since EE embeds fully in the underlying multicategory of FEF E, it follows that E(x 1,,x n;y)E(x 1;y)××E(x n;y)E(x_1,\dots, x_n; y) \cong E(x_1;y) \times \cdots \times E(x_n;y), which is to say (1) holds.

It therefore suffices to show that (5) implies (3). The magma structure maps mult xE(x,x;x)mult_x \in E(x,x;x) and unit xE(;x)unit_x \in E(;x) are obtained by expansion and strengthening from 1 xE(x;x)1_x\in E(x;x). To prove the unitality axioms and naturality, we describe a bit more of the structure of TT.

Write n={1,,n}n = \{1,\dots ,n\}. For a category AA, the category TAT A has as objects finite lists of objects of AA, and morphisms (a 1,,a m)(a 1,,a n)(a_1,\dots, a_m) \to (a'_1,\dots ,a'_n) given by a function ϕ:mn\phi:m\to n and morphisms a ia ϕ(i)a_{i} \to a'_{\phi(i)} for all imi\in m. Similarly, for a profunctor M:AM:ABB, the profunctor TM:TAT M : T ATBT B has heteromorphisms (b 1,,b m)(b_1,\dots, b_m) (a 1,,a n) (a_1,\dots, a_n) given by a function ϕ:mn\phi:m\to n and heteromorphisms b ib_i a ϕ(i) a_{\phi(i)} for all imi\in m.

Now a virtual TT-algebra consists, in particular, of a category AA and a profunctor M:AM : ATAT A. By Cruttwell-Shulman 2010, Theorem 8.6, since TT preserves bijective-on-objects functors, we may assume AA is a discrete category, so MM contains all the morphisms and multimorphisms. The generalized expansion/strengthening operations are then given by the profunctorial action of TAT A on MM.

We also have TM:TAT M : T ATTAT T A, so we have a covariant action of TAT A on TMT M. For instance, if fM(a 1,,a m;c)f\in M(a_1,\dots,a_m; c) and gM(b 1,,b n;c)g\in M(b_1,\dots ,b_n; c), we have

(f,g)TM((a 1,,a m),(b 1,,b n);(c,c)),(f,g) \in T M ( (a_1,\dots ,a_m), (b_1,\dots,b_n); (c,c)),

and we can act on this by the codiagonal δ c:(c,c)(c)\delta_c : (c,c) \to (c) in TAT A to obtain a morphism (δ c) *(f,g)TM((a 1,,a m),(b 1,,b n);(c))(\delta_c)_*(f,g) \in T M((a_1,\dots ,a_m), (b_1,\dots,b_n); (c)). Since the magma operation mult c:(c,c)cmult_c : (c,c) \to c is by definition the contravariant action 1 c(δ c) *1_c (\delta_c)^*, by the equivariance of the composition map we have

mult c(f,g)=μ(1 c(δ c) *,(f,g))=μ(1 c,(δ c) *(f,g)). \mult_c \circ (f,g) = \mu (1_c (\delta_c)^*, (f,g)) = \mu(1_c, (\delta_c)_*(f,g)).

Here (δ c) *(f,g)TM((a 1,,a m),(b 1,,b n);(c))(\delta_c)_*(f,g) \in T M ((a_1,\dots ,a_m), (b_1,\dots,b_n); (c)) is determined by the unique function ϕ:21\phi : 2\to 1 along with ff and gg.

Now suppose f=gf=g. Then we have (f)(δ a) *TM((a 1,,a m),(a 1,,a m);(c)(f)(\delta_a)^* \in T M((a_1,\dots ,a_m),(a_1,\dots ,a_m); (c), which is also determined by the unique function ϕ:21\phi : 2\to 1 along with ff and ff, and therefore is equal to (δ c) *(f,f)(\delta_c)_*(f,f). So we have

mult c(f,f)=μ(1 c,(δ c) *(f,f))=μ(1 c,(f)(δ a) *)=μ(1 c,(f))(δ a) *=f(δ a) *.\mult_c \circ (f,f) = \mu(1_c, (\delta_c)_*(f,f)) = \mu(1_c, (f) (\delta_a)^*) = \mu(1_c, (f))(\delta_a')^* = f (\delta'_a)^*.

Here δ aTA((a 1,,a m,a 1,,a m);(a 1,,a m)\delta_a' \in T A( (a_1,\dots,a_m,a_1,\dots,a_m);(a_1,\dots, a_m) (as opposed to δ aTTA((a 1,,a m),(a 1,,a m)),((a 1,,a m)))\delta_a \in T T A ((a_1,\dots,a_m),(a_1,\dots,a_m)), ((a_1,\dots,a_m)))), and the equation relating the actions by the two is because mult T(δ a)=δ a\mathrm{mult}_T(\delta_a) = \delta'_a. But we also have

f(δ a) *=μ(f,(1 a 1,1 a m))(δ a) *=μ(f,(1 a 1δ a 1 *,1 a mδ a m *)σ *=μ(f,(mult a 1,,mult a m)σ *f (\delta'_a)^* = \mu(f, (1_{a_1},\dots 1_{a_m}))(\delta_a')^* = \mu(f, (1_{a_1}\delta_{a_1}^*,\dots 1_{a_m}\delta_{a_m}^*)\sigma^* = \mu(f, (mult_{a_1},\dots ,mult_{a_m})\sigma^*

where σ\sigma is an appropriate permutation. This shows that the magma multiplications are natural with respect to ff. A similar argument applies to the units.

The proof of the unitality laws is less complicated. If ϵ c:()c\epsilon_c : () \to c in TAT A, so that unit c=1 c(ϵ c) *\unit_c = 1_c (\epsilon_c)^*, then

mult c(unit c,1 c)=μ(1 c(δ c) *,(1 c(ϵ c) *,1 c))=μ(1 c(δ c) *,(1 c,1 c))(ϵ c) *=1 c(δ c) *(ϵ c) *=1 c. \mult_c \circ (\unit_c, 1_c) = \mu(1_c (\delta_c)^*, (1_c (\epsilon_c)^*, 1_c)) = \mu(1_c (\delta_c)^*, (1_c,1_c))(\epsilon'_c)^* = 1_c (\delta_c)^* (\epsilon'_c)^* = 1_c.

Here ϵ c:(c)(c,c)\epsilon'_c : (c) \to (c,c) in TAT A inserts into the right-side cc, and the final equation is by functoriality.

Properties

  • Being cocartesian is a property of a multicategory, in contrast to being a cartesian multicategory, which is structure.

  • Every cocartesian multicategory has the structure of a symmetric multicategory.

  • A cocartesian multicategory C C_\blacktriangleright is representable if and only if CC has coproducts (Example 8.8(2) of Hermida 2000). This is another motivation for the terminology.

  • A category CC is preadditive if and only if its corresponding cocartesian multicategory C C_\blacktriangleright is cartesian (see Pisani 2013 and Pisani 2014); and is hence additive if and only if its corresponding multicategory is cartesian and representable.

  • The discrete cocones construction () :CatMulticat(-)_\blacktriangleright : Cat \to Multicat is left adjoint to the category of monoids construction Mon:MulticatCatMon : Multicat \to Cat, and this restricts to cartesian multicategories. In fact, this is a consequence of the more general fact that MulticatMulticat is copowered over CatCat: see Pisani 2013 and Pisani 2014.

References

The discrete cocones construction was introduced in Example 2.2(2) of:

  • Claudio Hermida, Representable multicategories, Adv. Math. 151 (2000), no. 2, 164-225 (pdf)

and studied extensively in the following papers, where the terminology sequential multicategory is introduced:

It is further studied, under the name cocartesian multicategory in:

  • Claudio Pisani, Unbiased multicategory theory, Theory and Applications of Categories, Vol. 44, 2025, No. 28, pp 826-868. web

The discrete cocones construction is also discussed in Example 2.1.6 of Higher Operads, Higher Categories.

An analogue of sequential multicategories for (infinity, 1)-categories is contained in §2.4.3 of Higher Algebra.

The sequential multicategory structure was rediscovered in the one-object setting as the “T construction” of:

  • Samuele Giraudo, Combinatorial operads from monoids, Journal of Algebraic Combinatorics 41 (2015): 493-538.

A generalisation of the concept to generalised multicategories is given in:

  • Alex Cebrian, Plethysms and operads, Collectanea Mathematica 75.1 (2024): 247-303.

References for generalized multicategories:

Last revised on September 19, 2025 at 08:02:36. See the history of this page for a list of all contributions to it.