nLab
symmetric monoidal (infinity,n)-category

Context

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Monoidal categories

Contents

Idea

A symmetric monoidal (,n)(\infty,n)-category is the analog of a symmetric monoidal (∞,1)-category for (∞,n)-category theory.

Definition

As Jacob Lurie says in Lurie, Mathoverflow quote:

There are many (equivalent) definitions for the notion of symmetric monoidal (,n)(\infty,n)-category. One approach is based on the observation that a monoidal category can be identified with a bicategory having only a single object. You can define a monoidal (,n)(\infty,n)-category to be an (,n+1)(\infty,n+1)-category with a specified object, such that all other objects are isomorphic to it (in the complete Segal space model, this means that the space of objects should be connected). Similarly you can define a braided monoidal (,n)(\infty,n)-category to be an (,n+2)(\infty,n+2)-category equipped with a distinguished object satisfying a simple connectivity condition, and so on and so forth. You get to the symmetric monoidal case by taking the homotopy inverse limit (that is, a symmetric monoidal (,n)(\infty,n)-category is a collection of pointed (,n+k)(\infty,n+k)-categories, each of which is obtained by “looping” the next one). You might find this definition convenient in the context of bordism categories, since they are naturally related in this way (if you “op’‘ the a bordism category of dd-manifolds, you get a bordism category of d+1d+1-manifolds: and this is sensible even when dd is negative).

Alternatively, you can define a symmetric monoidal (,n)(\infty,n)-category to be a commutative monoid in the setting of (,n)(\infty,n)-categories. There are many ways to formalize this. Since you’re asking about specific models, let’s suppose you start with some model category A\mathbf{A} for the homotopy theory of (,n)(\infty,n)-categories (higher-dimensional Segal spaces, for example). If you have a simplicial model category, you can do as Charles suggested and take algebras for some E E_{\infty}-operad in simplicial sets. If you’d prefer not to mention operads, you can just copy Segal’s definition of a Γ\Gamma-space: take the category of functors FF from pointed finite sets into A\mathbf{A}, and equip it with a model structure that enforces the relevant Segal condition.

As Martin mentions in his answer, there is an extensive discussion of the case n=1n=1 in my book, and also of commutative monoids in an arbitrary (,1)(\infty,1)-category (of which this is a special case, since the collection of all (,n)(\infty,n)-categories can be regarded as an (,1)(\infty,1)-category). I don’t know of references that address your question more specifically (though I would not be surprised if there were some).

Properties

Dualizable objects

Definition

An object XX in a symmetric monoidal (,n)(\infty,n)-category is called dualizable if …

Claim

Let CC be a symmetric monoidal (,n)(\infty,n)-category. Then there exists another symmetric monoidal (,n)(\infty,n)-category C fdC^{fd} and a symmetric monoidal functor

C fdC C^{fd} \to C

such that C fdC^{fd} has duals and is universal with these properties:

for any symmetric monoidal (∞,n)-category with duals DD and any symmetric monoidal functor F:DCF : D \to C there exists a symmetric monoidal functor f:DC fdf : D \to C^{fd}, unique up to equivalence, and an equivalence

C fd f D F C. \array{ && C^{fd} \\ & {}^{\mathllap{f}}\nearrow &\Downarrow^{\simeq}& \searrow \\ D &&\stackrel{F}{\to}&& C } \,.

This appears as (Lurie, claim 2.3.19).

Remark

C fdC^{fd} is obtained from CC by discarding all objects that do not have duals and all k-morphisms that do not admit right and left adjoints.

Definition

An object XCX \in C is called a fully dualizable object if it is in the essential image of C fdCC^{fd} \to C.

Examples

References

A discussion of dualizable objects is in section 2.3 of

Revised on October 2, 2014 09:38:44 by David Corfield (129.12.18.34)