The Stacks project

Theorem 35.4.22. The following conditions are equivalent.

  1. The morphism $f$ is a descent morphism for modules.

  2. The morphism $f$ is an effective descent morphism for modules.

  3. The morphism $f$ is universally injective.

Proof. It is clear that (b) implies (a). We now check that (a) implies (c). If $f$ is not universally injective, we can find $M \in \text{Mod}_ R$ such that the map $1_ M \otimes f: M \to M \otimes _ R S$ has nontrivial kernel $N$. The natural projection $M \to M/N$ is not an isomorphism, but its image in $DD_{S/R}$ is an isomorphism. Hence $f^*$ is not fully faithful.

We finally check that (c) implies (b). By Lemma 35.4.20, for $(M, \theta ) \in DD_{S/R}$, the natural map $f^* f_*(M,\theta ) \to M$ is an isomorphism of $S$-modules. On the other hand, for $M_0 \in \text{Mod}_ R$, we may tensor ( with $M_0$ over $R$ to obtain an equalizer sequence, so $M_0 \to f_* f^* M$ is an isomorphism. Consequently, $f_*$ and $f^*$ are quasi-inverse functors, proving the claim. $\square$

Comments (2)

Comment #8763 by Dongryul Kim on

There seems to be at least a typo in the second-to-last sentence. We want to check that the unit map is an isomorphism. This can be checked after base-changing to thanks to univeral injectivity. By adjunction, the composition is the identity, while we have shown that the second map is an isomorphism. Hence becomes an isomorphism after applying .

Comment #9308 by on

OK, the typo is that a subscript was missing on the in the sentence, right? I fixed that. But I think it immediately follows from that sentence that is is an isomorphism. I did add another reference to the first sentence of the last paragraph to clarify. Changes here.

There are also:

  • 4 comment(s) on Section 35.4: Descent for universally injective morphisms

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).

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.

In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 08XA. Beware of the difference between the letter 'O' and the digit '0'.