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 (,1)-category is the analog of a symmetric monoidal (∞,1)-category for (∞,n)-category theory.

Properties

Dualizable objects

Definition

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

Claim

Let C be a symmetric monoidal (,n)-category. Then there exists another symmetric monoidal (,n)-category C fd and a symmetric monoidal functor

C fdCC^{fd} \to C

such that C fd has duals and is universal with these properties:

for any symmetric monoidal (,n)-category with duals D and any symmetric monoidal functor F:DC there exists a symmetric monoidal functor f:DC 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 fd is obtained from C by discarding all objects that do not have duals and all k-morphisms that do not admit right and left adjoints.

Definition

An object XC is called fully dualizable if it is in the essential image of C fdC.

Examples

References

A discussion of dualizable objects is in section 2.3 of

Revised on February 5, 2013 02:17:04 by Urs Schreiber (89.204.154.134)