nLab dualizable object (Rev #13, changes)

Showing changes from revision #12 to #13: Added | Removed | Changed

Context

Monoidal categories

monoidal categories

With braiding

With duals for objects

With duals for morphisms

With traces

Closed structure

Special sorts of products

Semisimplicity

Morphisms

Internal monoids

Examples

Theorems

In higher category theory

Duality

Contents

Idea

Being dualizable is often thought of as a category-theoretic notion of finiteness for objects in a monoidal category. For instance, a vector space is dualizable in Vect with its tensor product just when it is finite-dimensional, and a spectrum is dualizable in the stable homotopy category with its smash product just when it is a finite cell spectrum.

A more precise intuition is that an object is dualizable if its “size” is no larger than the “additivity” of the monoidal category. Since Vect and the stable homotopy category are finitely additive, but not infinitely so, dualizability there is a notion of finiteness. This is the case for many monoidal categories in which one considers dualizability. However, in a monoidal category which is not additive at all, such as Set (or any cartesian monoidal category), only the terminal object is dualizable—whereas in an “infinitely additive” monoidal category such as Rel or Sup, many “infinite” objects are dualizable. (In RelRel, all objects are dualizable.)

Warning

There are other notions of “dual object”, distinct from this one. See for example dual object in a closed category, and also the discussion at category with duals.

In a monoidal category

Definition

Definition

An object AA in a monoidal category CC is dualizable if it has an adjoint when regarded as a morphism in the one-object delooping bicategory BC\mathbf{B}C corresponding to CC. Its adjoint in BC\mathbf{B}C is called its dual in CC and often written as A *A^*.

If CC is braided then left and right adjoints in BC\mathbf{B}C are equivalent; otherwise one speaks of AA being left dualizable or right dualizable.

Remark

Unfortunately, conventions on left and right vary and sometimes contradict their use for adjoints. But if we define right duals to be the same as right adjoints in BC\mathbf{B}C , then (where a right dual ofA A \otimes is an interpreted object as composition, with the traditional Leibnizian order of composition as opposed to diagrammatic order), then a right dual ofA *A A^* A is an object A *A^* equipped with a unit (or coevaluation)

i:IA *Ai: I \to A^* \otimes A

and counit (or evaluation)

e:AA *Ie : A \otimes A^* \to I

satisfying the ‘triangle identities’ familiar from the concept of adjunction. Of course, in a symmetric monoidal category, there is no difference between left and right duals.

Definition

If every object of CC has a left and right dual, then CC is called a rigid monoidal category or an autonomous monoidal category. If it is additionally symmetric, it is called a compact closed category.

See category with duals for more discussion.

Examples

  • Let VV be a finite-dimensional vector space over a field kk, and let V *=Hom(V,k)V^* = Hom(V,k) be its usual dual vector space. We can define ε:V *Vk\varepsilon\colon V^* \otimes V \to k to be the obvious pairing. If we also choose a finite basis {v i}\{v_i\} of VV, and let {v i *}\{v_i^*\} be the dual basis of V *V^*, then we can define η:kVV *\eta\colon k \to V\otimes V^* by sending 11 to iv iv i *\sum_i v_i \otimes v_i^*. It is easy to check the triangle identities, so V *V^* is a dual of VV in Vect kVect_k.

  • Let MM be a finite-dimensional manifold, choose an embedding M nM\hookrightarrow \mathbb{R}^n for some nn, and let Th(NX)Th(N X) be the Thom spectrum of the normal bundle of this embedding. Then the Thom collapse map defines an η\eta which exhibits Th(NX)Th(N X) as a dual of Σ + M\Sigma_+^\infty M in the stable homotopy category. This is a version of Spanier-Whitehead duality.

Properties

Dualizable objects support a good abstract notion of trace.

In a symmetric monoidal (,n)(\infty,n)-category

Definition

An object in a symmetric monoidal (∞,n)-category CC is called dualizable if it is so as an object in the ordinary symmetric monoidal homotopy category Ho(C)Ho(C).

This appears as (Lurie, def. 2.3.5).

Remark

This means that an object in CC is dualizable if there exists unit and counit 1-morphism that satisfy the triangle identity up to homotopy. The definition does not demand that this homotopy is coherent (that it satisfies itself higher order relations up to higher order k-morphisms).

If the structure morphisms of the adjunction of a dualizable object have themselves all adjoints, then the object is called a fully dualizable object.

Remark

As before, we may equivalently state this after delooping the monoidal structure and passing to the (,n+1)(\infty,n+1)-category BC\mathbf{B}C. Then CC has duals for objects precisely if BC\mathbf{B}C has all adjoints.

References

Duals in a monoidal category are a very classical notion. A large number of examples can be found in

The notion of duals in a symmetric monoidal (,n)(\infty,n)-category is due to section 2.3 of

Revision on September 15, 2012 at 19:36:22 by Todd Trimble See the history of this page for a list of all contributions to it.