Processing math: 100%

The Stacks project

Lemma 18.16.4. Let \mathcal{C} and \mathcal{D} be sites. Let u : \mathcal{C} \to \mathcal{D} be a functor. Assume that

  1. u is cocontinuous,

  2. u is continuous, and

  3. u is fully faithful.

For g_!, g^{-1}, g_* as above the canonical maps \mathcal{F} \to g^{-1}g_!\mathcal{F} and g^{-1}g_*\mathcal{F} \to \mathcal{F} are isomorphisms for all abelian sheaves \mathcal{F} on \mathcal{C}.

Proof. The map g^{-1}g_*\mathcal{F} \to \mathcal{F} is an isomorphism by Sites, Lemma 7.21.7 and the fact that pullback and pushforward of abelian sheaves agrees with pullback and pushforward on the underlying sheaves of sets.

Pick U \in \mathop{\mathrm{Ob}}\nolimits (\mathcal{C}). We will show that g^{-1}g_!\mathcal{F}(U) = \mathcal{F}(U). First, note that g^{-1}g_!\mathcal{F}(U) = g_!\mathcal{F}(u(U)). Hence it suffices to show that g_!\mathcal{F}(u(U)) = \mathcal{F}(U). We know that g_!\mathcal{F} is the (abelian) sheaf associated to the presheaf g_{p!}\mathcal{F} which is defined by the rule

V \longmapsto \mathop{\mathrm{colim}}\nolimits _{V \to u(U')} \mathcal{F}(U')

with colimit taken in \textit{Ab}. If V = u(U), then, as u is fully faithful this colimit is over U \to U'. Hence we conclude that g_{p!}\mathcal{F}(u(U) = \mathcal{F}(U). Since u is cocontinuous and continuous any covering of u(U) in \mathcal{D} can be refined by a covering (!) \{ u(U_ i) \to u(U)\} of \mathcal{D} where \{ U_ i \to U\} is a covering in \mathcal{C}. This implies that (g_{p!}\mathcal{F})^+(u(U)) = \mathcal{F}(U) also, since in the colimit defining the value of (g_{p!}\mathcal{F})^+ on u(U) we may restrict to the cofinal system of coverings \{ u(U_ i) \to u(U)\} as above. Hence we see that (g_{p!}\mathcal{F})^+(u(U)) = \mathcal{F}(U) for all objects U of \mathcal{C} as well. Repeating this argument one more time gives the equality (g_{p!}\mathcal{F})^\# (u(U)) = \mathcal{F}(U) for all objects U of \mathcal{C}. This produces the desired equality g^{-1}g_!\mathcal{F} = \mathcal{F}. \square


Comments (0)

There are also:

  • 2 comment(s) on Section 18.16: Exactness of lower shriek

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.