Lemma 96.3.2. Let $f : \mathcal{X} \to \mathcal{Y}$ and $g : \mathcal{Y} \to \mathcal{Z}$ be $1$-morphisms of categories fibred in groupoids over $(\mathit{Sch}/S)_{fppf}$. Then $(g \circ f)^ p = f^ p \circ g^ p$ and there is a canonical isomorphism ${}_ p(g \circ f) \to {}_ pg \circ {}_ pf$ compatible with adjointness of $(f^ p, {}_ pf)$, $(g^ p, {}_ pg)$, and $((g \circ f)^ p, {}_ p(g \circ f))$.
Proof. Let $\mathcal{H}$ be a presheaf on $\mathcal{Z}$. Then $(g \circ f)^ p\mathcal{H} = f^ p (g^ p\mathcal{H})$ is given by the equalities
We omit the verification that this is compatible with restriction maps.
Next, we define the transformation ${}_ p(g \circ f) \to {}_ pg \circ {}_ pf$. Let $\mathcal{F}$ be a presheaf on $\mathcal{X}$. If $z$ is an object of $\mathcal{Z}$ then we get a category $\mathcal{J}$ of quadruples $(x, f(x) \to y, y, g(y) \to z)$ and a category $\mathcal{I}$ of pairs $(x, g(f(x)) \to z)$. There is a canonical functor $\mathcal{J} \to \mathcal{I}$ sending the object $(x, \alpha : f(x) \to y, y, \beta : g(y) \to z)$ to $(x, \beta \circ f(\alpha ) : g(f(x)) \to z)$. This gives the arrow in
by Categories, Lemma 4.14.9. We omit the verification that this is compatible with restriction maps. An alternative to this direct construction is to define ${}_ p(g \circ f) \cong {}_ pg \circ {}_ pf$ as the unique map compatible with the adjointness properties. This also has the advantage that one does not need to prove the compatibility.
Compatibility with adjointness of $(f^ p, {}_ pf)$, $(g^ p, {}_ pg)$, and $((g \circ f)^ p, {}_ p(g \circ f))$ means that given presheaves $\mathcal{H}$ and $\mathcal{F}$ as above we have a commutative diagram
Proof omitted. $\square$
Post a comment
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).
All contributions are licensed under the GNU Free Documentation License.
Comments (2)
Comment #32 by David Zureick-Brown on
Comment #35 by Johan on