Proof.
Additive functors commute with direct sums by Lemma 12.3.7 hence (1) implies (2) and (3). If (2) holds and $0$ denotes the zero object of $\mathcal{A}$, then the map $F(0) \oplus F(0) \to F(0 \oplus 0) \cong F(0)$ being an isomorphism implies that the diagonal map $\mathop{\mathrm{Hom}}\nolimits (F(0), C) \to \mathop{\mathrm{Hom}}\nolimits (F(0), C) \oplus \mathop{\mathrm{Hom}}\nolimits (F(0), C)$ is bijective for all $C$ in $\mathcal{B}$. Thus $F(0)$ is the zero object of $\mathcal{B}$ and $F$ maps the zero morphism between any two objects to the zero morphism. Similarly holds if (3) holds. It follows that (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 given by the matrix
\[ \left( \begin{matrix} F(1)
& F(0)
\\ F(0)
& F(1)
\end{matrix} \right) \]
and therefore 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 and transforms zero morphisms into zero morphisms. 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$
Comments (7)
Comment #2514 by Jo on
Comment #2515 by Andrea on
Comment #2557 by Johan on
Comment #5937 by Gabriel Ribeiro on
Comment #6126 by Johan on
Comment #11417 by Hirokazu Maruhashi on
Comment #11530 by Stacks Project on
There are also: