Background
Basic concepts
equivalences in/of -categories
Universal constructions
Local presentation
Theorems
Extra stuff, structure, properties
Models
With braiding
With duals for objects
category with duals (list of them)
dualizable object (what they have)
ribbon category, a.k.a. tortile category
With duals for morphisms
monoidal dagger-category?
With traces
Closed structure
Special sorts of products
Semisimplicity
Morphisms
Internal monoids
Examples
Theorems
In higher category theory
A cartesian symmetric monoidal (∞,1)-category is a symmetric monoidal (∞,1)-category whose tensor product is given by the categorical product. This is dual to the notion of cocartesian symmetric monoidal (∞,1)-category.
In the special case that the underlying (∞,1)-category is equivalent to just a 1-category, then this is equivalently a cartesian symmetric monoidal category?.
A symmetric monoidal ∞-category is Cartesian if the following conditions are satisfied:
The unit object is final, and
For every pair of objects , the canonical maps
exhibit as the product .
Equivalently, for , we stipulate that the -ary tensor product is right adjoint to the -ary diagonal map .
HA 2.4.1.5 constructs a Cartesian symmetric monoidal ∞-category structure on whenever has all finite products, and by unwinding definitions, has all finite products if it attains a Cartesian symmetric monoidal structure.
Additionally, HA 2.4.1.7 characterizes functors from Cartesian symmetric monoidal -categories to histhe particular construction of HA 2.4.1.5, including constructing a canonical equivalence. We may summarize these results as the following, wherein denotes the subcategory of whose objects are -categories possessing finite products and whose morphisms are product-preserving functors.
Lurie’s construction yields a fully faithful functor whose image is spanned by the Cartesian symmetric monoidal -categories.
Given an ∞-operad and an ∞-category, we say that a functor is an -monoid if, given an object the canonical maps
induced by cocartesian transport in exhibit as a product .The following is HA 2.4.2.5.
If has finite products, then the forgetful functor is fully faithful with image spanned by the -monoids.
Every object in a Cartesian monoidal -category is canonically a comonoid object via the diagonal map (just as in the 1-categorical case here).
See also at (infinity,n)-category of correspondences the section Via coalgebras.]
Section 2.4 of
Last revised on August 9, 2024 at 12:27:59. See the history of this page for a list of all contributions to it.