- (1)
Definition 3.3. An object of a stable -category is said to be compact if commutes with all coproducts (equivalently, with all colimits).
- (2)
An object of a stable symmetric monoidal -category is said to be (strongly) dualizable if there is an object and unit and trace maps
such that the composite map
is the identity.
3.1.1. Finite objects
We review here the three common notions of finite objects and their interrelations (See [L3, 17] and [L4, 4.7] for more details, as well asย [BV, HPS, Ke, LMS] among many other sources). We remind the reader that we are working in the context of -categories, so constructions such as colimits correspond to homotopy colimits in the context of model categories.
Suppose is a stable presentable -category (such as ). Then an object is compact if and only if maps from to any small coproduct factor through a finite coproduct. Furthermore, a functor between stable presentable -categories that preserves finite colimits preserves small colimits if and only if it preserves small coproducts. (Seeย [L3, Proposition 17.1].)
In a closed symmetric monoidal -category (such as ), an object is dualizable if and only if there exists a coevaluation map
satisfying the appropriate conditions (since one already has an evaluation map). If an object is dualizable, then we can turn internal Hom from into tensor product with in the sense that there is a canonical equivalence
In particular, this implies that preserves colimits and preserves limits:
It is enlightening to note the following characterization of dualizable objects, which parallels the definition of compact objects (but will not be used in this paper).
Lemma 3.4. Let be a symmetric monoidal presentable stable -category, whose monoidal structure distributes over colimits. An object of is then dualizable if and only if tensoring with preserves all limits.
Proof. The necessity of preserving limits is noted above ( is closed by virtue of being presentable with monoidal structure distributing over colimits, see [L4, Proposition 2.1.12]). To demonstrate sufficiency, assume that preserves limits, and then consider the endofunctor of defined by tensoring with . By assumption on and , this functor preserves all limits and colimits. We may now apply the adjoint functor theorem of [L2] to deduce the existence of a left adjoint to . Denote by the value of applied to the unit of . The existence of unit and trace maps is now a particular instance of the unit and counit maps for this adjunction, which implies that and are in duality. Hence is dualizable.
โ
In a general stable presentable symmetric monoidal -category , the classes of compact and dualizable objects do not coincide. In particular, the monoidal unit is always dualizable but not necessarily compact.
In the case of a derived stack , the unit is compact if and only if the global sections functor preserves colimits. (This fails if the global sections are too big such as in the following examples: ind-schemes such as the formal disk ; the classifying space of a topological group such as ; the classifying space of finite groups in modular characteristics.) However, if the unit is itself compact then all dualizable objects are compact, since Hom from a dualizable object is the composition of the colimit preserving functors internal Hom and global sections .
Proof. First, note that the free module , which is the monoidal unit, is clearly compact. Hence all dualizable objects are compact. Moreover, we can write any object as a colimit of free modules. For compact, the identity map has to factor through a finite colimit, showing that is perfect. Finally, perfect modules are dualizable since we can explicitly exhibit their dual as a finite limit of free modules. โ
It is useful to note that the notion of dualizable is local. On the one hand, pullback for any map of stacks (for example, restriction to an affine) preserves dualizable objects. On the other hand, a dual object with its unit and trace maps is functorially characterized, thus if it exists locally, it will glue together to a global object. This observation leads to the identification of perfect and dualizable objects in for any :
Proposition 3.6. For a derived stack , an object of is dualizable if and only if it is perfect.
Proof. Let be dualizable with dual . Then for any map , the pullback is dualizable with dual . Dualizable objects of are perfect, hence is perfect and so by definition, is perfect.
Now suppose is perfect. Recall that by definition, we have
Since is perfect, for any map , the pullback is perfect, hence dualizable. We take the value of the dual along a map to be the dual of the pullback . Note that is well-defined, since for any composite , there is a natural equivalence .
To exhibit and as dual to one another, we must construct the requisite unit and counit maps and . Again using the definition of as a limit, to produce one of these maps, it suffices to define analogous maps for the pullbacks under each which themselves are compatible under pullbacks. But the existence of such maps are an immediate consequence of the definition . Finally, to verify that the usual composititions and are equivalences, it suffices to check under pullbacks to affines. But this is a direct consequence of our definition of and the fact that pullbacks preserve tensor products. โ
Original source: arXiv:0805.0157v5