Stackification Existence
The stackification theorem guarantees that every category fibered in groupoids over a site can be turned into a stack in a universal way. This is the 2-categorical analogue of the sheafification theorem for presheaves.
Main Theorem
Let be a site and let be a category fibered in groupoids over . There exists a stack over and a morphism of CFGs
satisfying the following universal property: for every stack over and every morphism of CFGs, there exists a morphism of stacks , unique up to unique 2-isomorphism, such that .
Moreover, the pair is unique up to equivalence: if is another such pair, there exists an equivalence compatible with and .
Properties of the Stackification Morphism
The stackification morphism satisfies:
(i) Locally essentially surjective: For every and every object , there exists a covering such that is in the essential image of for each .
(ii) Locally fully faithful: For every and objects , the morphism induces an isomorphism of sheaves: where denotes the sheafification of the presheaf .
(iii) Characterization: A morphism of CFGs with a stack is a stackification if and only if it satisfies both (i) and (ii).
Properties (i) and (ii) are direct analogues of the properties of sheafification for presheaves:
- (i) is the analogue of " has the same local sections as ."
- (ii) is the analogue of " has the same stalks as ."
In the presheaf case, is an isomorphism on stalks. In the stack case, induces isomorphisms on sheafified Isom (the "stacky stalks").
Uniqueness
Let and be two stackifications of (both satisfying the universal property). Then there exists an equivalence of stacks and a 2-isomorphism . Moreover, the pair is unique up to unique 2-isomorphism.
By the universal property of , there exists with . By the universal property of , there exists with . The composition satisfies . By uniqueness (up to unique 2-isomorphism) in the universal property of , . Similarly . So is an equivalence.
Examples
If is already a stack, then is a stackification. By uniqueness, .
Let be a presheaf, viewed as a CFG with discrete fibers. The stackification is equivalent (as a CFG with discrete fibers) to the sheafification . This is because:
- For discrete groupoids, "equivalence of categories" reduces to "bijection of sets."
- The descent data category for a discrete CFG is a set (discrete groupoid).
- The stackification universal property reduces to the sheafification universal property.
Let be a presheaf of groupoids (strict functor, giving a split fibered category). The stackification produces a stack that may be non-split.
For example, let be the presheaf sending every to the groupoid with one object and automorphism group . This is not a stack in general (descent fails). The stackification is the classifying stack (torsors, not just trivial torsors).
Let act on . The orbit presheaf with (as a set, viewed as discrete groupoid) is a CFG. Its stackification is not the quotient stack directly, because we lost the automorphism information.
Instead, consider the CFG with the groupoid whose objects are elements of and where . This is the action groupoid . The stackification of is the quotient stack .
Let be a smooth group scheme over . Define as the CFG classifying Zariski-locally trivial -torsors. This is a stack for the Zariski topology but typically not for the etale topology (there are etale-locally trivial torsors that are not Zariski-locally trivial).
The stackification of on the etale site is (etale-locally trivial torsors). Similarly, the stackification of on the fppf site is .
For : all torsors are Zariski-locally trivial (Hilbert's Theorem 90), so .
For : there exist etale-locally trivial but not Zariski-locally trivial -torsors (these correspond to Brauer-Severi varieties). So .
Let with the etale topology, and let be a Brauer class represented by a Cech 2-cocycle for a covering .
Define a CFG by taking for that does not factor through any , and using the cocycle data on the cover. The stackification of is a -gerbe over representing the class .
The isomorphism class of the gerbe in depends only on the cohomology class of , not the specific cocycle.
The Two-Step Construction
The stackification can be constructed in two steps:
Step 1 (Prestackification): Define with the same objects as but with morphisms sheafified: Then is a prestack with .
Step 2 (Effectivization): Define where objects over are descent data for relative to coverings of , and morphisms are compatible families of isomorphisms on a common refinement. Then is a stack with .
The composition is the stackification.
Step 1: Start with the CFG where has one object (the "trivial torsor") with . The presheaf is already a sheaf (it is the sheaf represented by ), so and Step 1 is trivial.
Step 2: Objects of are descent data: coverings with trivial torsors on each and transition functions satisfying the cocycle condition. This is precisely a -torsor on !
So , as expected.
Consider the presheaf on (with the usual topology) sending to the set of bounded continuous functions , viewed as a CFG with discrete fibers. This is not a separated presheaf (hence not a prestack): the function is bounded on each interval but not globally, so locality fails.
Step 1: Sheafify Isom (which for a presheaf of sets just means sheafify the presheaf). The prestackification is the sheaf of all continuous functions.
Step 2: Since the prestackification is already a sheaf (= stack with discrete fibers), Step 2 is trivial.
Functoriality
The stackification construction is functorial: a morphism of CFGs induces a morphism of stacks, unique up to unique 2-isomorphism, making the diagram 2-commutative.
Moreover, a 2-morphism between morphisms induces a 2-morphism .
In other words, stackification defines a 2-functor that is left 2-adjoint to the inclusion .
Let be a homomorphism of group schemes, and let act on and act on , with a -equivariant morphism . Then induces a morphism of the corresponding action groupoid CFGs, and stackification gives a morphism of quotient stacks:
For instance, the inclusion (identity) and the action map give : the inertia map.
Summary
The stackification theorem is a cornerstone of stack theory:
- Existence: Every CFG has a stackification, constructed in two steps (sheafify Isom, then add descent data).
- Uniqueness: The stackification is unique up to canonical equivalence.
- Universal property: Left 2-adjoint to the inclusion of stacks into CFGs.
- Local nature: The stackification does not change local data -- it only enforces global descent.
- Functoriality: The construction is functorial in the CFG.
The complete proof is given in the proof section, following the two-step approach.