The Stacks project

12.7 Additive functors

First a completely silly lemma characterizing additive functors between additive categories.

Lemma 12.7.1. Let $\mathcal{A}$ and $\mathcal{B}$ be additive categories. Let $F : \mathcal{A} \to \mathcal{B}$ be a functor. The following are equivalent

  1. $F$ is additive,

  2. $F(A) \oplus F(B) \to F(A \oplus B)$ is an isomorphism for all $A, B \in \mathcal{A}$, and

  3. $F(A \oplus B) \to F(A) \oplus F(B)$ is an isomorphism for all $A, B \in \mathcal{A}$.

Proof. Additive functors commute with direct sums by Lemma 12.3.7 hence (1) implies (2) and (3). On the other hand (2) and (3) are equivalent because the composition $F(A) \oplus F(B) \to F(A \oplus B) \to F(A) \oplus F(B)$ is the identity map. Assume (2) and (3) hold. Let $f, g : A \to B$ be maps. Then $f + g$ is equal to the composition

\[ A \to A \oplus A \xrightarrow {\text{diag}(f, g)} B \oplus B \to B \]

Apply the functor $F$ and consider the following diagram

\[ \xymatrix{ F(A) \ar[r] \ar[rd] & F(A \oplus A) \ar[rr]_{F(\text{diag}(f, g))} & & F(B \oplus B) \ar[r] \ar[d] & F(B) \\ & F(A) \oplus F(A) \ar[u] \ar[rr]^{\text{diag}(F(f), F(g))} & & F(B) \oplus F(B) \ar[ru] } \]

We claim this is commutative. For the middle square we can verify it separately for each of the four induced maps $F(A) \to F(B)$ where it follows from the fact that $F$ is a functor (in other words this square commutes even if $F$ does not satisfy any properties beyond being a functor). For the triangle on the left, we use that $F(A \oplus A) \to F(A) \oplus F(A)$ is an isomorphism to see that it suffice to check after composition with this map and this check is trivial. Dually for the other triangle. Thus going around the bottom is equal to $F(f + g)$ and we conclude. $\square$

Recall that we defined, in Categories, Definition 4.23.1 the notion of a “right exact”, “left exact” and “exact” functor in the setting of a functor between categories that have finite (co)limits. Thus this applies in particular to functors between abelian categories.

Lemma 12.7.2. Let $\mathcal{A}$ and $\mathcal{B}$ be abelian categories. Let $F : \mathcal{A} \to \mathcal{B}$ be a functor.

  1. If $F$ is either left or right exact, then it is additive.

  2. $F$ is left exact if and only if for every short exact sequence $0 \to A \to B \to C \to 0$ the sequence $0 \to F(A) \to F(B) \to F(C)$ is exact.

  3. $F$ is right exact if and only if for every short exact sequence $0 \to A \to B \to C \to 0$ the sequence $F(A) \to F(B) \to F(C) \to 0$ is exact.

  4. $F$ is exact if and only if for every short exact sequence $0 \to A \to B \to C \to 0$ the sequence $0 \to F(A) \to F(B) \to F(C) \to 0$ is exact.

Proof. If $F$ is left exact, i.e., $F$ commutes with finite limits, then $F$ sends products to products, hence $F$ preserved direct sums, hence $F$ is additive by Lemma 12.7.1. On the other hand, suppose that for every short exact sequence $0 \to A \to B \to C \to 0$ the sequence $0 \to F(A) \to F(B) \to F(C)$ is exact. Let $A, B$ be two objects. Then we have a short exact sequence

\[ 0 \to A \to A \oplus B \to B \to 0 \]

see for example Lemma 12.3.10. By assumption, the lower row in the commutative diagram

\[ \xymatrix{ 0 \ar[r] & F(A) \ar[d] \ar[r] & F(A) \oplus F(B) \ar[r] \ar[d] & F(B) \ar[d] \ar[r] & 0 \\ 0 \ar[r] & F(A) \ar[r] & F(A \oplus B) \ar[r] & F(B) } \]

is exact. Hence by the snake lemma (Lemma 12.5.17) we conclude that $F(A) \oplus F(B) \to F(A \oplus B)$ is an isomorphism. Hence $F$ is additive in this case as well. Thus for the rest of the proof we may assume $F$ is additive.

Denote $f : B \to C$ a map from $B$ to $C$. Exactness of $0 \to A \to B \to C$ just means that $A = \mathop{\mathrm{Ker}}(f)$. Clearly the kernel of $f$ is the equalizer of the two maps $f$ and $0$ from $B$ to $C$. Hence if $F$ commutes with limits, then $F(\mathop{\mathrm{Ker}}(f)) = \mathop{\mathrm{Ker}}(F(f))$ which exactly means that $0 \to F(A) \to F(B) \to F(C)$ is exact.

Conversely, suppose that $F$ is additive and transforms any short exact sequence $0 \to A \to B \to C \to 0$ into an exact sequence $0 \to F(A) \to F(B) \to F(C)$. Because it is additive it commutes with direct sums and hence finite products in $\mathcal{A}$. To show it commutes with finite limits it therefore suffices to show that it commutes with equalizers. But equalizers in an abelian category are the same as the kernel of the difference map, hence it suffices to show that $F$ commutes with taking kernels. Let $f : A \to B$ be a morphism. Factor $f$ as $A \to I \to B$ with $f' : A \to I$ surjective and $i : I \to B$ injective. (This is possible by the definition of an abelian category.) Then it is clear that $\mathop{\mathrm{Ker}}(f) = \mathop{\mathrm{Ker}}(f')$. Also $0 \to \mathop{\mathrm{Ker}}(f') \to A \to I \to 0$ and $0 \to I \to B \to B/I \to 0$ are short exact. By the condition imposed on $F$ we see that $0 \to F(\mathop{\mathrm{Ker}}(f')) \to F(A) \to F(I)$ and $0 \to F(I) \to F(B) \to F(B/I)$ are exact. Hence it is also the case that $F(\mathop{\mathrm{Ker}}(f'))$ is the kernel of the map $F(A) \to F(B)$, and we win.

The proof of (3) is similar to the proof of (2). Statement (4) is a combination of (2) and (3). $\square$

Lemma 12.7.3. Let $\mathcal{A}$ and $\mathcal{B}$ be abelian categories. Let $F : \mathcal{A} \to \mathcal{B}$ be an exact functor. For every pair of objects $A, B$ of $\mathcal{A}$ the functor $F$ induces an abelian group homomorphism

\[ \mathop{\mathrm{Ext}}\nolimits _\mathcal {A}(B, A) \longrightarrow \mathop{\mathrm{Ext}}\nolimits _\mathcal {B}(F(B), F(A)) \]

which maps the extension $E$ to $F(E)$.

Proof. Omitted. $\square$

The following lemma is used in the proof that the category of abelian sheaves on a site is abelian, where the functor $b$ is sheafification.

Lemma 12.7.4. Let $a : \mathcal{A} \to \mathcal{B}$ and $b : \mathcal{B} \to \mathcal{A}$ be functors. Assume that

  1. $\mathcal{A}$, $\mathcal{B}$ are additive categories, $a$, $b$ are additive functors, and $a$ is right adjoint to $b$,

  2. $\mathcal{B}$ is abelian and $b$ is left exact, and

  3. $ba \cong \text{id}_\mathcal {A}$.

Then $\mathcal{A}$ is abelian.

Proof. As $\mathcal{B}$ is abelian we see that all finite limits and colimits exist in $\mathcal{B}$ by Lemma 12.5.5. Since $b$ is a left adjoint we see that $b$ is also right exact and hence exact, see Categories, Lemma 4.24.6. Let $\varphi : B_1 \to B_2$ be a morphism of $\mathcal{B}$. In particular, if $K = \mathop{\mathrm{Ker}}(B_1 \to B_2)$, then $K$ is the equalizer of $0$ and $\varphi $ and hence $bK$ is the equalizer of $0$ and $b\varphi $, hence $bK$ is the kernel of $b\varphi $. Similarly, if $Q = \mathop{\mathrm{Coker}}(B_1 \to B_2)$, then $Q$ is the coequalizer of $0$ and $\varphi $ and hence $bQ$ is the coequalizer of $0$ and $b\varphi $, hence $bQ$ is the cokernel of $b\varphi $. Thus we see that every morphism of the form $b\varphi $ in $\mathcal{A}$ has a kernel and a cokernel. However, since $ba \cong \text{id}$ we see that every morphism of $\mathcal{A}$ is of this form, and we conclude that kernels and cokernels exist in $\mathcal{A}$. In fact, the argument shows that if $\psi : A_1 \to A_2$ is a morphism then

\[ \mathop{\mathrm{Ker}}(\psi ) = b\mathop{\mathrm{Ker}}(a\psi ), \quad \text{and}\quad \mathop{\mathrm{Coker}}(\psi ) = b\mathop{\mathrm{Coker}}(a\psi ). \]

Now we still have to show that $\mathop{\mathrm{Coim}}(\psi )= \mathop{\mathrm{Im}}(\psi )$. We do this as follows. First note that since $\mathcal{A}$ has kernels and cokernels it has all finite limits and colimits (see proof of Lemma 12.5.5). Hence we see by Categories, Lemma 4.24.6 that $a$ is left exact and hence transforms kernels (=equalizers) into kernels.

\begin{align*} \mathop{\mathrm{Coim}}(\psi ) & = \mathop{\mathrm{Coker}}(\mathop{\mathrm{Ker}}(\psi ) \to A_1) & \text{by definition} \\ & = b\mathop{\mathrm{Coker}}(a(\mathop{\mathrm{Ker}}(\psi ) \to A_1)) & \text{by formula above} \\ & = b\mathop{\mathrm{Coker}}(\mathop{\mathrm{Ker}}(a\psi ) \to aA_1)) & a\text{ preserves kernels} \\ & = b\mathop{\mathrm{Coim}}(a\psi ) & \text{by definition} \\ & = b\mathop{\mathrm{Im}}(a\psi ) & \mathcal{B}\text{ is abelian} \\ & = b\mathop{\mathrm{Ker}}(aA_2 \to \mathop{\mathrm{Coker}}(a\psi )) & \text{by definition} \\ & = \mathop{\mathrm{Ker}}(baA_2 \to b\mathop{\mathrm{Coker}}(a\psi )) & b\text{ preserves kernels} \\ & = \mathop{\mathrm{Ker}}(A_2 \to b\mathop{\mathrm{Coker}}(a\psi )) & ba = \text{id}_\mathcal {A} \\ & = \mathop{\mathrm{Ker}}(A_2 \to \mathop{\mathrm{Coker}}(\psi )) & \text{by formula above} \\ & = \mathop{\mathrm{Im}}(\psi ) & \text{by definition} \end{align*}

Thus the lemma holds. $\square$

Comments (3)

Comment #3057 by Herman Rohrbach on

There is a minor typo in the statement of lemma 12.7.2: statements (2), (3) and (4) should not start with "If is ...", but with " is ...".

Comment #3064 by Joel Bellaiche on

In 12.7.2 (2) and (3) the first word, "if", should be removed. The structure of the sentence is currently "If x if and only if y".

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