Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How can I prove that additive functors preserve split exact sequences?

share|cite|improve this question
Prove that a split exact sequence $0 \to A \to B \to C \to 0$ is isomorphic to the obvious direct sum sequence $0 \to A \to A \oplus C \to C \to 0$. – t.b. Apr 18 '12 at 8:41
(Prove also that a functor is additive if and only if it preserves 0 and binary direct sums.) – Zhen Lin Apr 18 '12 at 8:42
@ZhenLin Please consider converting your comment (and the comment by t.b.) into a (hint only) answer, so that this question gets removed from the unanswered tab. If you do so, it is helpful to post it to this chat room to make people aware of it (and attract some upvotes). For further reading upon the issue of too many unanswered questions, see here, here or here. – Julian Kuelshammer Jun 18 '13 at 17:25

I am assuming we are dealing with a functor $F: R\mathrm{Mod} \to S\mathrm{Mod}$ where $R$ and $S$ are commutative rings, although the result may hold in more general settings that I am not sufficiently familiar with.

A split exact sequence $0 \to A \xrightarrow{i} B \xrightarrow{p} C \to 0$ can be characterized by 4 functions and 5 equations: \begin{align} i &: A \to B, \\ q &: B \to A, \\ j &: C \to B, \\ p &: B \to C, \\ q \circ i &= 1_A, \\ p \circ j &= 1_C, \\ p \circ i &= 0, \\ q \circ j &= 0, \\ i \circ q + j \circ p &= 1_B. \end{align} That is, the given sequence is split exact if and only if there are $j$ and $q$ so that $i, j, p, q$ satisfy the above equations. Now any functor preserves composition and identity, and additive functors also preserve addition and the 0 morphism, so the entire characterization of the split exact sequence is preserved, and hence its image is split exact.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.