Definition 3.1. Let be a derived commutative ring. An -module is perfect if lies in the smallest -subcategory of containing and closed under finite colimits and retracts. For a derived stack , -category is the full -subcategory of consisting of those sheaves whose restriction to any affine over is a perfect module.
3.1. Definition of perfect stacks
Our main objects of study are -categories of quasi-coherent sheaves on derived stacks. For the foundations of derived stacks and quasi-coherent sheaves on them, we refer the reader to [ToVe1, ToVe2, To2]. (Note that a theory of descent for sheaves on higher stacks was developed previously by Hirschowitz and Simpson [HS].)
Given a derived stack , we have the stable symmetric monoidal -category of quasi-coherent sheaves on . To recall its construction, consider first a derived commutative -algebra , and the representable affine derived scheme . In this case, one defines to be the -category of -modules (i.e., module objects over in -modules). Its homotopy category is the unbounded derived category of .
In general, any derived stack can be written as a colimit of a diagram of affine derived schemes . Then one defines to be the limit (in the -category of -categories) of the corresponding diagram of -categories
One can think of an object as collections of quasi-coherent sheaves on the terms together with compatible identifications between their pullbacks under the diagram maps.
When is quasi-compact and has affine diagonal, by choosing an affine cover with induced C̆ech simplicial affine derived scheme , we can realize by a smaller limit, the totalization of the cosimplicial diagram .
An important feature of the -category is that it is cocomplete, that is, closed under all small colimits (or equivalently, since is stable, all small coproducts). Nevertheless, it can be difficult to control algebraically via reasonable generators. In general, it is convenient (and sometimes indispensable) to work with -categories that are “generated by finite objects” in a suitable sense. Let us summarize well known approaches to this idea. In a moment, we will provide a more detailed discussion.
There are two common notions of when a small -subcategory generates an -category . On the one hand, we could ask that be the inductive limit . On the other hand, we could ask that in the right orthogonal of vanishes.
There are three common notions of when an object should be considered finite: perfect objects, dualizable objects, and compact objects, which refer respectively to the geometry, monoidal structure, and categorical structure of .
We now introduce the class of perfect stacks. We will check below that for perfect stacks, the above notions of generators and finite objects all coincide.
Definition 3.2. A derived stack is said to be perfect if it has affine diagonal and the -category is the inductive limit
of the full -subcategory of perfect complexes.
A morphism is said to be perfect if its fibers over affines are perfect.
See [L2, 5.3.5] for the construction of Ind-categories of -categories, and [L3, 8] where it is shown that Ind-categories of stable -categories are stable. Let us mention that in the Ind-category of an -category , morphisms between Ind-objects can be calculated via the expected formula
For the reader unaccustomed to Ind-categories, we will momentarily give an alternative formulation of perfect stack in the more familiar language of compactly generated categories.
We next proceed with a review of the various notions of generators and finite objects. In Section 3.2, we show that perfect morphisms satisfy base change and the projection formula. In Section 3.3, we show that the class of perfect stacks includes many common examples of interest, and check that any morphism between perfect stacks is itself perfect.
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.
- (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.
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. ∎
3.1.2. Generators
Now we review notions of what it means for compact objects to generate a stable -category. (See [L3, 17] for more details, and [L2, 5.5.7] for the general setting of presentable -categories.)
Definition 3.7. A stable category is said to be compactly generated if there is a small -category of compact objects whose right orthogonal vanishes: if satisfies , for all , then .
As explained in [L3, Remark 17.3], whether a stable -category is compactly generated can be studied completely in the underlying homotopy category. In particular, the notion for stable -categories is compatible with that for triangulated categories.
Example 3.8. For a commutative derived ring , the stable -category of -modules is compactly generated. In fact, it is generated by the free module itself.
On the one hand, for a stable small -category , the inductive limit is a compactly generated stable presentable -category. Furthermore (see [L2, 5.3.4]), if is closed under finite colimits and idempotent complete, then it can be recovered as the compact objects of . In particular, we have that is the Ind-category of its compact objects .
On the other hand, given a stable -category with a small full -subcategory of compact generators, one can recover all compact objects of by a result of Neeman [N1] (see also [L2, Proposition 5.3.4.17]): the compact objects are precisely direct summands of the objects of the smallest stable -subcategory containing (that is, they are direct summands of finite iterated extensions of objects of ). In particular, if is stable and idempotent complete, then it consists precisely of the compact objects of .
If we further assume that is a presentable stable -category with a small full -subcategory of compact generators, then a theorem of Schwede and Shipley [SSh] guarantees that we can recover as the cocompletion of (see [L4, 4.4] for the -categorical version, and [Ke] for the differential graded version). In other words, we recover by passing to the category of colimit preserving -linear functors to -modules
In particular, we now can check that our notion of perfect stack is equivalent to more familiar assumptions on a symmetric monoidal -category.
Proposition 3.9. For a derived stack with affine diagonal, the following are equivalent:
- (1)
is perfect.
- (2)
is compactly generated, and its compact and dualizable objects coincide.
Proof. If is perfect, so that , we claim that compact and dualizable objects agree, and hence compact objects generate, so that (1) implies (2).
To see the claim, it suffices to show that the full -subcategory of dualizable objects of is idempotent complete (since it is also stable). Since is idempotent complete, this is equivalent to showing that dualizable objects are closed under retracts. However, for a retract of a dualizable object one can explicitly write down the unit and trace maps for and confirm the necessary conditions. We leave this to the reader.
Conversely, if is compactly generated, then is the Ind-category of its compact objects, and hence by assumption also the Ind-category of its dualizable objects, so that (2) implies (1). ∎
Original source: arXiv:0805.0157v5