The previous section constructed cocartesian monoidal structures, and we now do the same for cartesian ones. Existence comes for free by duality: an \(\infty \)-category with finite products carries a symmetric monoidal structure whose tensor product is the product and whose unit is the terminal object, obtained from the same unfurling construction by extending along right adjoints rather than left ones. The characterization of cartesian monoidal structures and their uniqueness dualize as well. The description of the algebras does not, and proving it is what most of this section is for.

Let \(C\) be an \(\infty \)-category with finite products. The functor \(C^{(-)}\colon \Fin \catop \to \Cat _{\infty }\) is now right adjointable: restriction along \(f\colon I\to J\) admits a right adjoint \(f_*\), computed by taking products over the fibers of \(f\). The Beck–Chevalley isomorphisms again follow by reindexing fiberwise products along pullback squares.

Proposition 15.3.1. Let \(C\) be an \(\infty \)-category with finite products. Right-adjoint unfurling extends \(C^{(-)}\) to a finite-product-preserving functor \[ (C,\times ):=\Unf ^{\mathrm {R}}(C^{(-)})\colon \Span (\Fin )\longrightarrow \Cat _{\infty } \] which sends a span \(I\xleftarrow {f}K\xrightarrow {g}J\) to \(g_*f^*\). It defines a symmetric monoidal structure on \(C\) whose unit is the terminal object and whose tensor product is the cartesian product.

Proof. Apply Corollary 15.1.5 to \(C^{(-)}\). The resulting transport sends an \(I\)-indexed family to \[ (x_i)_{i\in I}\longmapsto \left (\prod _{k\in g^{-1}(j)}x_{f(k)}\right )_{j\in J}. \] The argument of Proposition 15.2.1 applies verbatim to show that the construction preserves finite products: the inclusion \(\Fin \catop \hookrightarrow \Span (\Fin )\) preserves finite products and is the identity on objects, so product preservation may be tested on the original functor \(C^{(-)}\). The empty product gives the terminal object as unit, and transport along \(\lra {2}\xleftarrow {=}\lra {2}\xrightarrow {\nabla }\lra {1}\) gives the binary product. The inert projections in \(C^{\times }\) induce in the fiber \(C\) the two projection maps from this product. □

Definition 15.3.2 (Cartesian monoidal structure). The symmetric monoidal \(\infty \)-category \((C,\times )\) from Proposition 15.3.1 is called the cartesian monoidal structure on \(C\). We write \(\OpCart _C:=\Mm _{(C,\times )}\) for its underlying \(\infty \)-operad and \(C^{\times }:=(\OpCart _C)^{\otimes }\) for its total category.

We first use duality to characterize cartesian monoidal structures and prove their uniqueness. Afterwards we construct a concrete model for \(C^{\times }\). That model is not needed for existence, but it gives the explicit control required to prove the universal property of the cartesian operad.

15.3.1 Cartesian monoidal categories

The preceding construction gives a distinguished symmetric monoidal structure on every \(\infty \)-category with finite products. We next compare this construction with the intrinsic notion of a cartesian monoidal \(\infty \)-category.

Definition 15.3.3. A symmetric monoidal \(\infty \)-category \((D,\otimes )\) is called cartesian monoidal if the opposite symmetric monoidal \(\infty \)-category \((D,\otimes )\catop \) is cocartesian monoidal. We denote by \[ \Cat _{\infty }^{\otimes ,\cart }\subseteq \Cat _{\infty }^{\otimes } \] the full subcategory spanned by the cartesian monoidal \(\infty \)-categories.

Lemma 15.3.4. A symmetric monoidal \(\infty \)-category \((D,\otimes )\) is cartesian monoidal if and only if the following two conditions are satisfied:

(1)

The monoidal unit \(\unit \in D\) is a terminal object;

(2)

For any two objects \(X\) and \(Y\) of \(D\), the two maps \(X \otimes Y \to X \otimes \unit \simeq X\) and \(X \otimes Y \to \unit \otimes Y \simeq Y\) induced by the maps \(X \to \unit \) and \(Y \to \unit \) from the first condition exhibit the tensor product \(X \otimes Y\) as a product of \(X\) and \(Y\).

Proof. This is an instance of Lemma 15.2.22 applied to the opposite symmetric monoidal \(\infty \)-category. □

The characterization shows that the underlying \(\infty \)-category of a cartesian monoidal \(\infty \)-category admits finite products. Moreover, every symmetric monoidal functor between cartesian monoidal \(\infty \)-categories preserves these finite products. Hence there is a forgetful functor \[ U\colon \Cat _{\infty }^{\otimes ,\cart }\to \Cat _{\infty }^{\mathrm {prod}}. \]

Proposition 15.3.5. Let \(C\) be an \(\infty \)-category with finite products. Then the cartesian monoidal structure \((C,\times )\) is cartesian monoidal.

Proof. The transport formula in Proposition 15.3.1 shows that the monoidal unit is the terminal object of \(C\) and the binary tensor product is the product in \(C\). Under the identification of the fiber over \(\lra {1}\) with \(C\), the two inert projections are the two maps from this product induced by the terminal maps of its factors, hence are precisely the product projections. Thus \((C,\times )\) satisfies the two conditions of Lemma 15.3.4. □

Proposition 15.3.6. The forgetful functor \[ U\colon \Cat _{\infty }^{\otimes ,\cart }\to \Cat _{\infty }^{\mathrm {prod}} \] is an equivalence, with inverse given by the assignment \(C\mapsto (C,\times )\).

Proof. Passing to opposites identifies \(\Cat _{\infty }^{\otimes ,\cart }\) with \(\Cat _{\infty }^{\otimes ,\cocart }\), and identifies the forgetful functor \(U\) with the corresponding forgetful functor \[ \Cat _{\infty }^{\otimes ,\cocart }\to \Cat _{\infty }^{\mathrm {coprod}}. \] The latter is an equivalence by Corollary 15.2.21: the functor \(C\mapsto (C,\amalg )\) is an equivalence whose composite with the forgetful functor is the identity on \(\Cat _{\infty }^{\mathrm {coprod}}\). Hence \(U\) is an equivalence as well.

By Proposition 15.3.5, the assignment \(C\mapsto (C,\times )\) lands in \(\Cat _{\infty }^{\otimes ,\cart }\). Full faithfulness of \(U\) uniquely lifts every finite-product-preserving functor \(C\to D\) to a symmetric monoidal functor \((C,\times )\to (D,\times )\). These lifts define a functor whose composite with \(U\) is the identity, and hence an inverse to \(U\). □

15.3.2 A concrete model for the cartesian operad

The unfurling construction gives the cartesian monoidal structure directly from the functor \(I\mapsto C^I\). To prove its universal property, it is useful to replace an \(I\)-indexed family by a functor that also records all products of its subfamilies coherently. This leads to the following model based on the span-functoriality of \(I\mapsto \Fin _{/I}\).

Construction 15.3.7. The target projection \(\ev _1\colon \Ar (\Fin )\to \Fin \) is a cartesian fibration whose cartesian straightening sends \(I\) to \(\Fin _{/I}\). Thus pullback defines a functor \(\Fin \catop \to \Cat _{\infty }\) with value \(\Fin _{/I}\) at \(I\). Each pullback functor \(f^*\colon \Fin _{/J}\to \Fin _{/I}\) has a left adjoint \(f_!\), given by postcomposition with \(f\). The Beck–Chevalley isomorphisms follow from the pasting law for pullback squares. Its unfurling therefore sends a span \(I\xleftarrow {f}K\xrightarrow {g}J\) to \(g_!f^*\colon \Fin _{/I}\to \Fin _{/J}\).

Precomposing this unfurling with the leg-swap equivalence \(\Span (\Fin )\simeq \Span (\Fin )\catop \) from Lemma 13.1.15 and then passing to opposites gives a functor \(\Span (\Fin )\catop \to \Cat _{\infty }\). Let \[ r\colon A\to \Span (\Fin ) \] be its cartesian unstraightening. Its fiber over \(I\) is \((\Fin _{/I})\catop \), and its cartesian transport along a span \(I\xleftarrow {f}K\xrightarrow {g}J\) is \((f_!g^*)\catop \).

Applying \(B\mapsto \Fun (B,C)\) to the straightening of \(r\) gives a functor \(\Span (\Fin )\to \Cat _{\infty }\). It sends \(I\) to \(\Fun ((\Fin _{/I})\catop ,C)\) and a span \(I\xleftarrow {f}K\xrightarrow {g}J\) to restriction along \[ (f_!g^*)\catop \colon (\Fin _{/J})\catop \longrightarrow (\Fin _{/I})\catop . \] Let \(\widetilde C^{\times }\to \Span (\Fin )\) be its cocartesian unstraightening, and let \(C^{\times }_{\mathrm {con}}\subseteq \widetilde C^{\times }\) be the fiberwise full subcategory whose fiber over \(I\) consists of the finite-product-preserving functors \((\Fin _{/I})\catop \to C\). The subscript \(\mathrm {con}\) indicates that this is the concrete model.

Lemma 15.3.8. The subcategory \(C^{\times }_{\mathrm {con}}\subseteq \widetilde C^{\times }\) is closed under cocartesian transport. In particular, \(C^{\times }_{\mathrm {con}}\to \Span (\Fin )\) is a cocartesian fibration.

Proof. For a span \(I\xleftarrow {f}K\xrightarrow {g}J\), the functor \(f_!g^*\colon \Fin _{/J}\to \Fin _{/I}\) preserves finite coproducts: pullback along \(g\) does so because \(\Fin \) is extensive, while postcomposition along \(f\) plainly does so. Hence \((f_!g^*)\catop \) preserves finite products, and restriction along it preserves finite-product-preserving functors. □

Lemma 15.3.9. For every finite set \(I\), restriction along the functor \(I\hookrightarrow (\Fin _{/I})\catop \) given by \(i\mapsto (\{i\}\hookrightarrow I)\) induces an equivalence \[ \Fun ^{\times }((\Fin _{/I})\catop ,C)\iso C^I. \]

Proof. Regarding \(I\) as a discrete \(\infty \)-category, the description of finite families in Construction 14.1.16 gives a finite-coproduct-preserving equivalence \[ \Fin (I)\iso \Fin _{/I} \] which sends a finite family of elements of \(I\) to its indexing map to \(I\). The dual of Lemma 14.1.17 therefore identifies restriction to the singleton families with an equivalence \[ \Fun ^{\times }((\Fin _{/I})\catop ,C) \simeq \Fun (I,C) = C^I. \] Under this equivalence, a functor \(F\) corresponds to its values on the singleton inclusions, and one has \[ F(U\to I)\simeq \prod _{u\in U}F(\{u\}\to I).\qedhere \] □

Proposition 15.3.10. There is a canonical equivalence over \(\Span (\Fin )\) between the concrete model \(C^{\times }_{\mathrm {con}}\) and the total category \(C^{\times }\) of the cartesian monoidal structure.

Proof. By the uniqueness of cartesian monoidal structures from Proposition 15.3.6, it suffices to show that \(C^{\times }_{\mathrm {con}}\) defines a cartesian monoidal structure on \(C\).

By Lemma 15.3.8, the projection \(C^{\times }_{\mathrm {con}}\to \Span (\Fin )\) is a cocartesian fibration. Under the fiber equivalences of Lemma 15.3.9, the product-comparison maps of its straightening are the canonical equivalences \[ C^{I\sqcup J}\simeq C^I\times C^J, \] and its value at \(\emptyset \) is the terminal category. Thus the straightening preserves finite products, so Lemma 14.2.4 makes \(C^{\times }_{\mathrm {con}}\) into a symmetric monoidal \(\infty \)-category with underlying \(\infty \)-category \(C\).

Transport along a span \(I\xleftarrow {f}K\xrightarrow {g}J\) sends an \(I\)-indexed family to \[ (x_i)_{i\in I}\longmapsto \left (\prod _{k\in g^{-1}(j)}x_{f(k)}\right )_{j\in J}. \] Hence its unit is terminal, its binary tensor product is the product in \(C\), and its inert structure maps are the product projections. By Lemma 15.3.4, it is therefore cartesian monoidal. □

15.3.3 Algebras in cartesian monoidal structures

The classification of cartesian monoidal structures followed from the cocartesian classification by passing to opposite symmetric monoidal \(\infty \)-categories. The corresponding statement about algebras does not follow by the same argument: passing to the opposite of the total category does not define an involution of \(\Op _{\infty }\) that turns maps out of a cocartesian operad into maps into a cartesian operad. We therefore prove the cartesian universal property directly.

Let \(C\) be an \(\infty \)-category with finite products, and let \(\Oo \) be an \(\infty \)-operad. We have previously introduced two a priori different algebraic structures associated to \(\Oo \):

  • We may consider \(\Oo \)-monoids in \(C\): finite-product-preserving functors \(M\colon \Oo ^{\otimes } \to C\);
  • We may also consider \(\Oo \)-algebras in \(C\) with respect to the cartesian monoidal structure \((C,\times )\): operad maps \(M\colon \Oo \to \Mm _{(C,\times )}\).

At an informal level, these two notions encode precisely the same structure: an object \(M_x\) for every color \(x \in \Oo ^{\simeq }\) and a multimorphism \[ P_M\colon M_{x_1} \times M_{x_2} \times \dots \times M_{x_n} \to M_y \] for every multimorphism \(P\in \Oo ((x_1, \dots , x_n);y)\). This makes it plausible that \(\Oo \)-monoids and \(\Oo \)-algebras define equivalent \(\infty \)-categories. We will first prove this equivalence directly; the product functor \(C^{\times }\to C\) will then be recovered from it by naturality.

Theorem 15.3.11 (Universal property of cartesian monoidal structures). Let \(C\) be an \(\infty \)-category with finite products. For every \(\infty \)-operad \(\Oo \), there is a natural equivalence of \(\infty \)-categories \[ \Alg _{\Oo }(C,\times ) = \Fun _{\Op _{\infty }}(\Oo ,\OpCart _C) \iso \Fun ^{\times }(\Oo ^{\otimes },C) = \Mon _{\Oo }(C). \] In particular, the functor \(\Op _{\infty } \to \Cat _{\infty }^{\mathrm {prod}}, \Oo \mapsto \Oo ^{\otimes }\) is left adjoint to the cartesian operad functor \(\OpCart \colon \Cat ^{\mathrm {prod}}_{\infty } \to \Op _{\infty }\).

Proof. We use the concrete model of the cartesian operad. Evaluation at the identity maps \(\id _I\) will send an operad map \(\Oo \to \OpCart _C\) to an \(\Oo \)-monoid, and restriction along inert morphisms will provide the inverse construction.

Let \(r\colon A\to \Span (\Fin )\) be the cartesian fibration from Construction 15.3.7. For an \(\infty \)-operad \(\Oo \), put \[ D_{\Oo }:=\Oo ^{\otimes }\times _{\Span (\Fin )}A. \] The fiber of the projection \(D_{\Oo }\to \Oo ^{\otimes }\) over \(X\in \Oo ^{\otimes }_I\) is \((\Fin _{/I})\catop \), whose initial object is \(\id _I\). By Proposition 23.3.4, these initial objects determine a unique left-adjoint section \[ s\colon \Oo ^{\otimes }\to D_{\Oo }, \qquad X\longmapsto (X,\id _I). \]

The cocartesian fibration \(\widetilde C^{\times }\to \Span (\Fin )\) of Construction 15.3.7 is the parametrized functor category associated to \(r\). Hence Theorem 23.8.3 gives an equivalence \begin {equation} \label {eq:Currying_Cartesian_Operad} \Fun _{/\Span (\Fin )}(\Oo ^{\otimes },\widetilde C^{\times }) \iso \Fun (D_{\Oo },C). \end {equation} It sends \(\Phi \) to the evaluation functor \[ G_{\Phi }(X,u\colon U\to I):=\Phi (X)(u). \]

By construction of \(r\), an object \(u\colon U\to I\) of its fiber over \(I\) indexes the backwards span \[ I\xleftarrow {u}U\xrightarrow {=}U. \] The functoriality of partial cocartesian lifts from Proposition 23.1.4 therefore gives, naturally in \(\Oo \), a functor \[ \theta _{\Oo }\colon D_{\Oo }\to \Oo ^{\otimes }, \qquad (X,u\colon U\to I)\longmapsto X_U, \] and a natural transformation \[ \delta \colon \id _{D_{\Oo }}\longrightarrow s\theta _{\Oo } \] whose component at \((X,u)\) has \(\Oo ^{\otimes }\)-component the inert lift \(X\to X_U\) of the backwards span above and \(A\)-component the cartesian lift from \(u\) to \(\id _U\) over the same span. Restriction along identity maps gives a natural isomorphism \(\theta _{\Oo }s\simeq \id _{\Oo ^{\otimes }}\).

Let \(\Phi \colon \Oo \to \OpCart _C\) be a morphism of \(\infty \)-operads. Regarding its total functor as a functor to the concrete model and applying Equation 15.2, define \[ R(\Phi ):=G_{\Phi }s, \qquad R(\Phi )(X)=\Phi (X)(\id _I) \] for \(X\in \Oo ^{\otimes }_I\). This functor preserves finite products. Indeed, for a finite collection of objects \(X_a\in \Oo ^{\otimes }_{I_a}\), product preservation of \(\Phi \) and Lemma 15.3.9 give \[ R(\Phi )\left (\prod _aX_a\right ) \simeq \left (\prod _a\Phi (X_a)\right )\left (\id _{\bigsqcup _aI_a}\right ) \simeq \prod _a\Phi (X_a)(\id _{I_a}) = \prod _aR(\Phi )(X_a). \] The same formula includes the empty product. We have therefore obtained a functor \[ R\colon \Fun _{\Op _{\infty }}(\Oo ,\OpCart _C) \longrightarrow \Fun ^{\times }(\Oo ^{\otimes },C). \]

Conversely, let \(M\colon \Oo ^{\otimes }\to C\) preserve finite products. The functor \[ M\theta _{\Oo }\colon D_{\Oo }\to C \] corresponds under Equation 15.2 to a functor \[ \widehat M\colon \Oo ^{\otimes }\to \widetilde C^{\times }. \] This functor factors through \(C^{\times }_{\mathrm {con}}\). Indeed, fix \(X\in \Oo ^{\otimes }_I\). A finite product in \((\Fin _{/I})\catop \) is represented by a disjoint union \(\bigsqcup _aU_a\to I\) in \(\Fin _{/I}\), and operadic inert restriction gives a natural isomorphism \[ X_{\bigsqcup _aU_a}\simeq \prod _aX_{U_a}. \] Consequently, \[ \widehat M(X)\left (\bigsqcup _aU_a\to I\right ) = M\left (X_{\bigsqcup _aU_a}\right ) \simeq \prod _aM(X_{U_a}), \] including the empty product. Thus \(\widehat M(X)\colon (\Fin _{/I})\catop \to C\) preserves finite products.

We identify \(C^{\times }_{\mathrm {con}}\) with \(C^{\times }\) using Proposition 15.3.10. The resulting total functor \(\widehat M\colon \Oo ^{\otimes }\to C^{\times }\) preserves finite products. Indeed, let \(\{X_a\}_{a\in S}\) lie over finite sets \(\{I_a\}_{a\in S}\), and let \(u\colon U\to \bigsqcup _aI_a\). Writing \(U_a:=U\times _{\bigsqcup _aI_a}I_a\), compatibility of inert restriction with products gives \[ \left (\prod _aX_a\right )_U\simeq \prod _a(X_a)_{U_a}. \] After applying \(M\), these isomorphisms identify, at every \(u\), the product-comparison map for \(\widehat M\) with an isomorphism. They are natural in \(u\) by the coherence of \(\theta _{\Oo }\), and isomorphisms in a functor category are detected pointwise. Thus the comparison is an isomorphism in the relevant functor category. Hence \(\widehat M\) is a morphism of \(\infty \)-operads. We have constructed a functor \[ \widehat {(-)}\colon \Fun ^{\times }(\Oo ^{\otimes },C) \longrightarrow \Fun _{\Op _{\infty }}(\Oo ,\OpCart _C). \]

The natural isomorphism \(\theta _{\Oo }s\simeq \id _{\Oo ^{\otimes }}\) gives, naturally in \(M\), \[ R(\widehat M)=M\theta _{\Oo }s\simeq M. \] In the other direction, apply \(G_{\Phi }\) to \(\delta \). This gives a natural transformation \[ G_{\Phi } \longrightarrow G_{\Phi }s\theta _{\Oo } = R(\Phi )\theta _{\Oo }. \] Its component at \((X,u\colon U\to I)\) is the canonical map \[ \Phi (X)(u)\longrightarrow \Phi (X_U)(\id _U). \] It is an isomorphism: the \(\Oo ^{\otimes }\)-component of \(\delta \) is inert, so \(\Phi \) carries it to an inert, hence cocartesian, morphism in \(C^{\times }\) by Corollary 14.1.11; the concrete transport formula then identifies its target, evaluated at \(\id _U\), with its source, evaluated at \(u\). Currying therefore gives a natural isomorphism \[ \Phi \simeq \widehat {R(\Phi )}. \] Thus \(R\) and \(\widehat {(-)}\) are inverse equivalences.

The construction is natural in \(\Oo \) by pullback and the naturality of \(\theta \) and \(\delta \). It is natural in \(C\) because postcomposition with a finite-product-preserving functor commutes with currying and preserves the concrete subcategories \(C^{\times }_{\mathrm {con}}\). Under Proposition 15.3.10, the resulting map between the concrete models is the morphism of cartesian operads supplied by Proposition 15.3.6. Hence we obtain a natural equivalence of functors \[ \Op _{\infty }\catop \times \Cat _{\infty }^{\mathrm {prod}} \longrightarrow \Cat _{\infty }. \] Passing to groupoid cores gives the natural equivalence of hom animae which exhibits \(\Oo \mapsto \Oo ^{\otimes }\) as left adjoint to \(\OpCart \). □

Corollary 15.3.12. There is a finite-product-preserving functor \[ \Pi _C\colon C^{\times }\to C \] such that the equivalence of Theorem 15.3.11 is given by postcomposition with \(\Pi _C\).

Proof. Apply Theorem 15.3.11 to \(\Oo =\OpCart _C\). The identity of \(\OpCart _C\) corresponds to a finite-product-preserving functor \(\Pi _C\colon C^{\times }\to C\). By the naturality in \(\Oo \), the equivalence for a general \(\Oo \) is given by postcomposition with this functor.

Unwinding the construction of the equivalence, if \(F\colon (\Fin _{/I})\catop \to C\) is an object of \(C^{\times }\) over \(I\), then \[ \Pi _C(F)\simeq F(\id _I). \] Under the equivalence of Lemma 15.3.9, this sends the family \(\{x_i\}_{i\in I}\) to \(\prod _{i\in I}x_i\). □

Corollary 15.3.13. Let \(C\) be an \(\infty \)-category with finite products. Then associative algebras in the cartesian monoidal structure agree with associative operadic monoids in \(C\): \[ \Alg (C,\times ) \iso \Mon _{\Assoc }(C). \] Similarly, commutative algebras agree with commutative monoids: \[ \CAlg (C,\times ) \iso \Mon _{\Comm }(C)=\CMon (C). \]

Proof. This is the special case of Theorem 15.3.11 where \(\Oo =\Assoc \) and \(\Oo =\Comm \), respectively. □

The first equivalence uses the operadic notation \(\Mon _{\Assoc }(C)=\Fun ^{\times }(\Assoc ^{\otimes },C)\) from Definition 14.4.1. Its comparison with the simplicial \(\infty \)-category \(\Mon (C)\) of Chapter 5 follows from the simplicial model for associative algebras discussed in Section 19.3.

Exercises

Exercise 15.1 (Transport along spans). Let \(C\) admit finite products and finite coproducts, and consider a span of finite sets \[ I\xleftarrow {f}K\xrightarrow {g}J. \]

(1)

Show that transport along this span in the cocartesian monoidal unfurling is \(g_!f^*\colon C^I\to C^J\), given by \[ (X_i)_{i\in I}\longmapsto \left (\coprod _{k\in g^{-1}(j)}X_{f(k)}\right )_{j\in J}. \]

(2)

Show that transport in the cartesian monoidal unfurling is \(g_*f^*\colon C^I\to C^J\), obtained by replacing the coproducts in the preceding formula by products.

(3)

Recover the binary tensor products and tensor units of the cocartesian and cartesian monoidal structures from these formulas.

Exercise 15.2 (A cocartesian monoidal functor). Show that the free-abelian-group functor preserves finite coproducts and hence refines to a symmetric monoidal functor \[ (\Set ,\amalg )\longrightarrow (\Ab ,\oplus ). \] Identify its unit and binary structure maps explicitly.

Generated from the authoritative LaTeX source.