TheoremComplete

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

Theorem2.7.1Existence and uniqueness of stackification

Let (C,τ)(\mathcal{C}, \tau) be a site and let F\mathcal{F} be a category fibered in groupoids over C\mathcal{C}. There exists a stack Fst\mathcal{F}^{\mathrm{st}} over (C,τ)(\mathcal{C}, \tau) and a morphism of CFGs

η:FFst\eta : \mathcal{F} \longrightarrow \mathcal{F}^{\mathrm{st}}

satisfying the following universal property: for every stack G\mathcal{G} over (C,τ)(\mathcal{C}, \tau) and every morphism F:FGF : \mathcal{F} \to \mathcal{G} of CFGs, there exists a morphism of stacks F~:FstG\tilde{F} : \mathcal{F}^{\mathrm{st}} \to \mathcal{G}, unique up to unique 2-isomorphism, such that F~ηF\tilde{F} \circ \eta \cong F.

Moreover, the pair (Fst,η)(\mathcal{F}^{\mathrm{st}}, \eta) is unique up to equivalence: if (G,η)(\mathcal{G}, \eta') is another such pair, there exists an equivalence FstG\mathcal{F}^{\mathrm{st}} \simeq \mathcal{G} compatible with η\eta and η\eta'.


Properties of the Stackification Morphism

Theorem2.7.2Properties of eta

The stackification morphism η:FFst\eta : \mathcal{F} \to \mathcal{F}^{\mathrm{st}} satisfies:

(i) Locally essentially surjective: For every UCU \in \mathcal{C} and every object xFst(U)x \in \mathcal{F}^{\mathrm{st}}(U), there exists a covering {UiU}\{U_i \to U\} such that xUix|_{U_i} is in the essential image of η(Ui):F(Ui)Fst(Ui)\eta(U_i) : \mathcal{F}(U_i) \to \mathcal{F}^{\mathrm{st}}(U_i) for each ii.

(ii) Locally fully faithful: For every UCU \in \mathcal{C} and objects x,yF(U)x, y \in \mathcal{F}(U), the morphism η\eta induces an isomorphism of sheaves: IsomF(x,y)+IsomFst(η(x),η(y))\operatorname{Isom}_\mathcal{F}(x, y)^+ \xrightarrow{\sim} \operatorname{Isom}_{\mathcal{F}^{\mathrm{st}}}(\eta(x), \eta(y)) where IsomF(x,y)+\operatorname{Isom}_\mathcal{F}(x, y)^+ denotes the sheafification of the presheaf IsomF(x,y)\operatorname{Isom}_\mathcal{F}(x, y).

(iii) Characterization: A morphism η:FG\eta : \mathcal{F} \to \mathcal{G} of CFGs with G\mathcal{G} a stack is a stackification if and only if it satisfies both (i) and (ii).

RemarkAnalogies with sheafification

Properties (i) and (ii) are direct analogues of the properties of sheafification θ:FF+\theta : F \to F^+ for presheaves:

  • (i) is the analogue of "F+F^+ has the same local sections as FF."
  • (ii) is the analogue of "F+F^+ has the same stalks as FF."

In the presheaf case, θp:FpFp+\theta_p : F_p \to F^+_p is an isomorphism on stalks. In the stack case, η\eta induces isomorphisms on sheafified Isom (the "stacky stalks").


Uniqueness

Theorem2.7.3Uniqueness of stackification

Let η:FFst\eta : \mathcal{F} \to \mathcal{F}^{\mathrm{st}} and η:FG\eta' : \mathcal{F} \to \mathcal{G} be two stackifications of F\mathcal{F} (both satisfying the universal property). Then there exists an equivalence of stacks Ψ:FstG\Psi : \mathcal{F}^{\mathrm{st}} \xrightarrow{\sim} \mathcal{G} and a 2-isomorphism α:Ψηη\alpha : \Psi \circ \eta \xRightarrow{\sim} \eta'. Moreover, the pair (Ψ,α)(\Psi, \alpha) is unique up to unique 2-isomorphism.

Proof

By the universal property of η\eta, there exists η~:FstG\tilde{\eta}' : \mathcal{F}^{\mathrm{st}} \to \mathcal{G} with η~ηη\tilde{\eta}' \circ \eta \cong \eta'. By the universal property of η\eta', there exists η~:GFst\widetilde{\eta} : \mathcal{G} \to \mathcal{F}^{\mathrm{st}} with η~ηη\widetilde{\eta} \circ \eta' \cong \eta. The composition η~η~:FstFst\widetilde{\eta} \circ \tilde{\eta}' : \mathcal{F}^{\mathrm{st}} \to \mathcal{F}^{\mathrm{st}} satisfies (η~η~)ηη(\widetilde{\eta} \circ \tilde{\eta}') \circ \eta \cong \eta. By uniqueness (up to unique 2-isomorphism) in the universal property of η\eta, η~η~idFst\widetilde{\eta} \circ \tilde{\eta}' \cong \operatorname{id}_{\mathcal{F}^{\mathrm{st}}}. Similarly η~η~idG\tilde{\eta}' \circ \widetilde{\eta} \cong \operatorname{id}_{\mathcal{G}}. So η~\tilde{\eta}' is an equivalence.


Examples

ExampleStackification of a stack is itself

If F\mathcal{F} is already a stack, then η=id:FF\eta = \operatorname{id} : \mathcal{F} \to \mathcal{F} is a stackification. By uniqueness, FstF\mathcal{F}^{\mathrm{st}} \simeq \mathcal{F}.

ExampleStackification reduces to sheafification for sets

Let F:CopSetF : \mathcal{C}^{\mathrm{op}} \to \mathbf{Set} be a presheaf, viewed as a CFG with discrete fibers. The stackification FstF^{\mathrm{st}} is equivalent (as a CFG with discrete fibers) to the sheafification F+F^+. 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.
ExampleStackification of a presheaf of groupoids

Let F:CopGrpdF : \mathcal{C}^{\mathrm{op}} \to \mathbf{Grpd} be a presheaf of groupoids (strict functor, giving a split fibered category). The stackification produces a stack FstF^{\mathrm{st}} that may be non-split.

For example, let F(U)=BG(U)F(U) = BG(U) be the presheaf sending every UU to the groupoid with one object and automorphism group G(U)G(U). This is not a stack in general (descent fails). The stackification is the classifying stack BGBG (torsors, not just trivial torsors).

ExampleStackification of orbit presheaf to quotient stack

Let GG act on XX. The orbit presheaf O\mathcal{O} with O(U)=X(U)/G(U)\mathcal{O}(U) = X(U)/G(U) (as a set, viewed as discrete groupoid) is a CFG. Its stackification is not the quotient stack [X/G][X/G] directly, because we lost the automorphism information.

Instead, consider the CFG F\mathcal{F} with F(U)=\mathcal{F}(U) = the groupoid whose objects are elements of X(U)X(U) and where Hom(x,y)={gG(U):gx=y}\operatorname{Hom}(x, y) = \{g \in G(U) : g \cdot x = y\}. This is the action groupoid [X(U)/G(U)][X(U)/G(U)]. The stackification of F\mathcal{F} is the quotient stack [X/G][X/G].

ExampleStackification across topologies

Let GG be a smooth group scheme over SS. Define BGZarBG^{\mathrm{Zar}} as the CFG classifying Zariski-locally trivial GG-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 BGZarBG^{\mathrm{Zar}} on the etale site is BGetBG^{\mathrm{et}} (etale-locally trivial torsors). Similarly, the stackification of BGetBG^{\mathrm{et}} on the fppf site is BGfppfBG^{\mathrm{fppf}}.

For G=GLnG = GL_n: all torsors are Zariski-locally trivial (Hilbert's Theorem 90), so BGLnZar=BGLnet=BGLnfppfBGL_n^{\mathrm{Zar}} = BGL_n^{\mathrm{et}} = BGL_n^{\mathrm{fppf}}.

For G=PGLnG = PGL_n: there exist etale-locally trivial but not Zariski-locally trivial PGLnPGL_n-torsors (these correspond to Brauer-Severi varieties). So BPGLnZarBPGLnetBPGL_n^{\mathrm{Zar}} \subsetneq BPGL_n^{\mathrm{et}}.

ExampleGerbes via stackification

Let C=Sch/S\mathcal{C} = \mathbf{Sch}/S with the etale topology, and let αHˇ2(S,Gm)\alpha \in \check{H}^2(S, \mathbb{G}_m) be a Brauer class represented by a Cech 2-cocycle (αijk)Gm(Uijk)(\alpha_{ijk}) \in \mathbb{G}_m(U_{ijk}) for a covering {UiS}\{U_i \to S\}.

Define a CFG Fα\mathcal{F}_\alpha by taking Fα(T)=\mathcal{F}_\alpha(T) = \emptyset for TST \to S that does not factor through any UiU_i, and using the cocycle data on the cover. The stackification of Fα\mathcal{F}_\alpha is a Gm\mathbb{G}_m-gerbe over SS representing the class α\alpha.

The isomorphism class of the gerbe in H2(S,Gm)H^2(S, \mathbb{G}_m) depends only on the cohomology class of α\alpha, not the specific cocycle.


The Two-Step Construction

Theorem2.7.4Two-step stackification

The stackification can be constructed in two steps:

Step 1 (Prestackification): Define Fps\mathcal{F}^{\mathrm{ps}} with the same objects as F\mathcal{F} but with morphisms sheafified: HomFps(U)(x,y)=IsomF(x,y)+(U)\operatorname{Hom}_{\mathcal{F}^{\mathrm{ps}}(U)}(x, y) = \operatorname{Isom}_\mathcal{F}(x, y)^+(U) Then Fps\mathcal{F}^{\mathrm{ps}} is a prestack with η1:FFps\eta_1 : \mathcal{F} \to \mathcal{F}^{\mathrm{ps}}.

Step 2 (Effectivization): Define Fst=(Fps)eff\mathcal{F}^{\mathrm{st}} = (\mathcal{F}^{\mathrm{ps}})^{\mathrm{eff}} where objects over UU are descent data for Fps\mathcal{F}^{\mathrm{ps}} relative to coverings of UU, and morphisms are compatible families of isomorphisms on a common refinement. Then Fst\mathcal{F}^{\mathrm{st}} is a stack with η2:FpsFst\eta_2 : \mathcal{F}^{\mathrm{ps}} \to \mathcal{F}^{\mathrm{st}}.

The composition η=η2η1:FFst\eta = \eta_2 \circ \eta_1 : \mathcal{F} \to \mathcal{F}^{\mathrm{st}} is the stackification.

ExampleTwo-step construction for BG

Step 1: Start with the CFG F\mathcal{F} where F(S)\mathcal{F}(S) has one object (the "trivial torsor") with Aut=G(S)\operatorname{Aut} = G(S). The presheaf Isom\operatorname{Isom} is already a sheaf (it is the sheaf represented by GG), so Fps=F\mathcal{F}^{\mathrm{ps}} = \mathcal{F} and Step 1 is trivial.

Step 2: Objects of Fst(S)\mathcal{F}^{\mathrm{st}}(S) are descent data: coverings {SiS}\{S_i \to S\} with trivial torsors on each SiS_i and transition functions gijG(Si×SSj)g_{ij} \in G(S_i \times_S S_j) satisfying the cocycle condition. This is precisely a GG-torsor on SS!

So Fst=BG\mathcal{F}^{\mathrm{st}} = BG, as expected.

ExampleStep 1 matters: non-separated prestacks

Consider the presheaf FF on R\mathbb{R} (with the usual topology) sending UU to the set of bounded continuous functions URU \to \mathbb{R}, viewed as a CFG with discrete fibers. This is not a separated presheaf (hence not a prestack): the function f(x)=xf(x) = x is bounded on each interval (n,n)(-n, n) 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

Theorem2.7.5Functoriality of stackification

The stackification construction is functorial: a morphism F:FGF : \mathcal{F} \to \mathcal{G} of CFGs induces a morphism Fst:FstGstF^{\mathrm{st}} : \mathcal{F}^{\mathrm{st}} \to \mathcal{G}^{\mathrm{st}} of stacks, unique up to unique 2-isomorphism, making the diagram FFG\mathcal{F} \xrightarrow{F} \mathcal{G} ηFηG\downarrow \eta_\mathcal{F} \quad\quad \downarrow \eta_\mathcal{G} FstFstGst\mathcal{F}^{\mathrm{st}} \xrightarrow{F^{\mathrm{st}}} \mathcal{G}^{\mathrm{st}} 2-commutative.

Moreover, a 2-morphism α:FG\alpha : F \Rightarrow G between morphisms FG\mathcal{F} \to \mathcal{G} induces a 2-morphism αst:FstGst\alpha^{\mathrm{st}} : F^{\mathrm{st}} \Rightarrow G^{\mathrm{st}}.

In other words, stackification defines a 2-functor CFG(C)Stacks(C)\mathbf{CFG}(\mathcal{C}) \to \mathbf{Stacks}(\mathcal{C}) that is left 2-adjoint to the inclusion Stacks(C)CFG(C)\mathbf{Stacks}(\mathcal{C}) \hookrightarrow \mathbf{CFG}(\mathcal{C}).

ExampleFunctorial application: quotient stacks

Let ϕ:GH\phi : G \to H be a homomorphism of group schemes, and let GG act on XX and HH act on YY, with a ϕ\phi-equivariant morphism f:XYf : X \to Y. Then ff induces a morphism of the corresponding action groupoid CFGs, and stackification gives a morphism of quotient stacks: [X/G][Y/H][X/G] \to [Y/H]

For instance, the inclusion GGG \hookrightarrow G (identity) and the action map GG \to * give [G/G][/G]=BG[G/G] \to [*/G] = BG: the inertia map.


Summary

RemarkSummary of stackification existence

The stackification theorem is a cornerstone of stack theory:

  1. Existence: Every CFG has a stackification, constructed in two steps (sheafify Isom, then add descent data).
  2. Uniqueness: The stackification is unique up to canonical equivalence.
  3. Universal property: Left 2-adjoint to the inclusion of stacks into CFGs.
  4. Local nature: The stackification does not change local data -- it only enforces global descent.
  5. Functoriality: The construction is functorial in the CFG.

The complete proof is given in the proof section, following the two-step approach.