The Stacks project

Lemma 15.86.14. Let $(A_ n)$ be an inverse system of abelian groups. The following are equivalent

  1. $(A_ n)$ is zero as a pro-object,

  2. $\mathop{\mathrm{lim}}\nolimits A_ n = 0$ and $R^1\mathop{\mathrm{lim}}\nolimits A_ n = 0$ and the same holds for $\bigoplus _{i \in \mathbf{N}} (A_ n)$.

Proof. It follows from Lemma 15.86.11 that (1) implies (2). Assume (2). Then $(A_ n)$ is ML by Lemma 15.86.12. For $m \geq n$ let $A_{n, m} = \mathop{\mathrm{Im}}(A_ m \to A_ n)$ so that $A_ n = A_{n, n} \supset A_{n, n + 1} \supset \ldots $. Note that $(A_ n)$ is zero as a pro-object if and only if for every $n$ there is an $m \geq n$ such that $A_{n, m} = 0$. Note that $(A_ n)$ is ML if and only if for every $n$ there is an $m_ n \geq n$ such that $A_{n, m} = A_{n, m + 1} = \ldots $. In the ML case it is clear that $\mathop{\mathrm{lim}}\nolimits A_ n = 0$ implies that $A_{n, m_ n} = 0$ because the maps $A_{n + 1, m_{n + 1}} \to A_{n, m}$ are surjective. This finishes the proof. $\square$

Comments (0)

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 091C. Beware of the difference between the letter 'O' and the digit '0'.