By dualizing the results of the previous section, every \(\infty \)-category \(C\) with finite products admits a cartesian monoidal structure: the tensor product is the cartesian product, and the unit is the terminal object. The characterization and uniqueness of this structure follow by duality as well. We will also show that \(\Oo \)-algebras in \((C,\times )\) are precisely \(\Oo \)-monoids in \(C\). This identification requires a separate argument, for which we construct an explicit model of the cartesian operad.

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 maps \(X\times Y\to X\times *\cong X\) and \(X\times Y\to *\times Y\cong Y\) induced by the terminal maps of the factors and the unitors are the product projections. □

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 \(\infty \)-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\). The maps \(X\otimes Y\to X\otimes *\cong X\) and \(X\otimes Y\to *\otimes Y\cong Y\) induced by the terminal maps of the factors and the unitors are, by this transport formula, 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.3.1 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.3.2 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 canonical maps \(F(I\sqcup J)\to F(I)\times F(J)\) for its straightening \(F\) are the equivalences \[ C^{I\sqcup J}\simeq C^I\times C^J, \] and its value at \(\emptyset \) is the terminal \(\infty \)-category. Thus the straightening preserves finite products, so Lemma 14.4.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 the maps induced by the terminal maps of the factors and the unitors are the product projections. By Lemma 15.3.4, it is therefore cartesian monoidal. □

15.3.3 Algebras in cartesian monoidal structures

Let \(C\) be an \(\infty \)-category with finite products, and let \(\Oo \) be an \(\infty \)-operad. We have introduced two notions of algebraic structure in \(C\): an \(\Oo \)-monoid is a finite-product-preserving functor \(\Oo ^{\otimes }\to C\), while an \(\Oo \)-algebra for the cartesian monoidal structure is an operad map \(\Oo \to \OpCart (C)\).

Informally, both specify an object \(M_x\) for every color \(x\) and an operation \[ P_M\colon M_{x_1}\times \cdots \times M_{x_n}\longrightarrow M_y \] for every multimorphism \(P\in \Oo ((x_1,\ldots ,x_n);y)\), compatibly with composition, identities, and permutations. The following theorem identifies these two notions. We will then recover the product functor \(C^{\times }\to C\) 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 an equivalence \[ \Alg _{\Oo }(C,\times ) \iso \Mon _{\Oo }(C), \] natural in \(\Oo \) and in finite-product-preserving functors \(C\to C'\).

Proof. We use the concrete model from Construction 15.3.7, identified with \(C^{\times }\) by Proposition 15.3.10. Let \(r\colon A\to \Span (\Fin )\) be the cartesian fibration used in that construction. By Theorem 24.8.3, evaluation gives an equivalence \begin {equation} \label {eq:Currying_Cartesian_Operad} \Fun _{/\Span (\Fin )}(\Oo ^{\otimes },\widetilde C^{\times }) \iso \Fun (\Oo ^{\otimes }\times _{\Span (\Fin )}A,C). \end {equation} The initial objects \(\id _I\) of the fibers \((\Fin _{/I})\catop \) give a section \(s\colon \Oo ^{\otimes }\to \Oo ^{\otimes }\times _{\Span (\Fin )}A\), sending \(X\) over \(I\) to \((X,\id _I)\), by Proposition 24.3.4. Under (15.2), precomposition with \(s\) sends an operad map \(\Phi \colon \Oo \to \OpCart (C)\) to the functor \(X\mapsto \Phi (X)(\id _I)\). This preserves finite products: \(\Phi \) preserves products, and evaluation at the identity sends concatenation of families in \(C^{\times }\) to their product in \(C\), by Lemma 15.3.9.

To construct the inverse, we use inert restriction. By Theorem 15.1.3, Lemma 13.1.15, \(A\) is the span category of \(\Ar (\Fin )\) with arbitrary squares as left legs and pullback squares as right legs, and \(r\) is induced by \(\ev _1\). Both evaluation functors preserve pullbacks, and the tautological transformation \(\ev _0\Rightarrow \ev _1\) has pullback naturality squares along the right legs. Thus Remark 13.2.2 gives a natural transformation \(\Span (\ev _1)\Rightarrow \Span (\ev _0)\) on \(A\), or equivalently a functor \(A\to \Ar (\Span (\Fin ))\) sending \(u\colon U\to I\) to the backwards span \(I\xleftarrow {u}U\xrightarrow {=}U\).

Pulling back along \(\Oo ^{\otimes }\to \Span (\Fin )\), applying Proposition 24.1.4, and taking targets gives a functor \(\theta \colon \Oo ^{\otimes }\times _{\Span (\Fin )}A\to \Oo ^{\otimes }\) sending \((X,u)\) to the inert restriction \(X_U\). Applying the same span construction to the natural squares \(\id _U\to u\) in \(\Ar (\Fin )\) gives the cartesian lifts \(u\to \id _U\) in \(A\), naturally in \(u\). Together with the inert lifts, these give a natural transformation \(\id \to s\theta \) with component \((X,u)\to (X_U,\id _U)\). Restriction along identity maps gives \(\theta s\simeq \id \).

For a finite-product-preserving functor \(M\colon \Oo ^{\otimes }\to C\), currying \(M\theta \) gives a functor \(\widehat M\colon \Oo ^{\otimes }\to \widetilde C^{\times }\) with \[ \widehat M(X)(u\colon U\to I)=M(X_U). \] Inert restriction takes disjoint unions over \(I\) to products in \(\Oo ^{\otimes }\), so \(X_{\bigsqcup _aU_a}\simeq \prod _aX_{U_a}\). Since \(M\) preserves finite products, each \(\widehat M(X)\) preserves finite products. Thus \(\widehat M\) factors through \(C^{\times }_{\mathrm {con}}\).

To check that \(\widehat M\) preserves inert morphisms, let \(V\to U\xrightarrow {u}I\). Transport of \(\widehat M(X)\) along the backwards span given by \(u\) has value \(M(X_V)\) at \(V\to U\), whereas \(\widehat M(X_U)\) has value \(M((X_U)_V)\). The image of the inert lift \(X\to X_U\) has component the canonical isomorphism \(M(X_V)\to M((X_U)_V)\) given by composition of inert lifts. Thus \(\widehat M\) preserves inert morphisms and is a morphism of \(\infty \)-operads by Corollary 14.1.14.

Evaluating \(\widehat M(X)\) at \(\id _I\) recovers \(M(X)\), naturally in \(M\), since \(\theta s\simeq \id \). In the other direction, apply the evaluation functor corresponding to \(\Phi \) under (15.2) to the natural transformation \(\id \to s\theta \). This gives maps \[ \Phi (X)(u)\longrightarrow \Phi (X_U)(\id _U), \] natural in \((X,u)\) and in \(\Phi \). They are isomorphisms because \(\Phi \) preserves inert morphisms and transport along \(I\xleftarrow {u}U\xrightarrow {=}U\) sends a functor \(F\) to the functor \(v\mapsto F(uv)\). Currying gives the required natural isomorphism for the other composite. Thus the two constructions are inverse equivalences.

Naturality in \(\Oo \) follows from pullback and functoriality of inert lifts. Postcomposition with a finite-product-preserving functor \(C\to C'\) commutes with currying and preserves the concrete subcategories. Under Proposition 15.3.10, it induces the corresponding map of cartesian operads, proving naturality in \(C\). □

Corollary 15.3.12. The functor \(\Op _{\infty }\to \Cat _{\infty }^{\mathrm {prod}}\) sending \(\Oo \) to \(\Oo ^{\otimes }\) is left adjoint to the cartesian operad functor \(\OpCart \colon \Cat _{\infty }^{\mathrm {prod}}\to \Op _{\infty }\).

Proof. Pass to groupoid cores in the natural equivalence of Theorem 15.3.11. □

Corollary 15.3.13. 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. Take \(\Pi _C\) to be the counit of Corollary 15.3.12. By naturality in \(\Oo \), the equivalence of the theorem is given by postcomposition with \(\Pi _C\). In the concrete model it sends \(F\colon (\Fin _{/I})\catop \to C\) to \(F(\id _I)\), so it sends a family \(\{x_i\}_{i\in I}\) to \(\prod _{i\in I}x_i\) by Lemma 15.3.9. □

Corollary 15.3.14. 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 notion \(\Mon _{\Assoc }(C)=\Fun ^{\times }(\Assoc ^{\otimes },C)\). We now relate it to the simplicial definition of \(\Mon (C)\) from Chapter 5. The cut functor of Construction 5.3.11 has a refinement \[ \Cut \colon \simp \catop \longrightarrow \Assoc ^{\otimes }: \] equip each fiber of a forward map with the order inherited from its source set of cuts. Composition respects these orders, so this defines a functor. A finite-product-preserving functor \(A\colon \Assoc ^{\otimes }\to C\) restricts along \(\Cut \) to a Segal monoid: its value at \([n]\) is \(A(\lra {1})^n\), and the interval inclusions give the product projections. The following result says that every Segal monoid arises in this way.

Theorem 15.3.15 ([Lurie (2017), Proposition 4.1.3.19]). For every \(\infty \)-category \(C\) with finite products, restriction along \(\Cut \) induces an equivalence \[ \Mon _{\Assoc }(C)\iso \Mon (C). \]

Proof. Apply [Lurie (2017), Proposition 4.1.3.19] to the cartesian monoidal structure on \(C\). Its inert-preserving sections over the cut functor identify with Segal monoids in \(C\), while its associative algebras identify with \(\Mon _{\Assoc }(C)\) by Corollary 15.3.14. □

Together with Corollary 15.3.14, this identifies associative algebras in \((C,\times )\) with the monoids of Chapter 5. Their multiplication and unit are given by the middle face map in degree \(2\) and the degeneracy map from degree \(0\), respectively.

For \(C=\Cat _{\infty }\), this identifies monoidal \(\infty \)-categories with Segal monoids in \(\Cat _{\infty }\). More generally, Theorem 15.3.11 identifies \(\Oo \)-algebras in \((\Cat _{\infty },\times )\) with \(\Oo \)-monoidal \(\infty \)-categories. Taking \(\Oo =\oLMod \), an algebra is a monoidal \(\infty \)-category together with an \(\infty \)-category left-tensored over it, in the terminology of Definition 17.1.1.

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.