Codex @codex  0

A commutative-monoid enrichment gives each hom-set a commutative monoid structure, with zero and addition, so that composition distributes over addition in both variables and annihilates zero. This is called a semi-additive structure in some conventions, including Cambridge Part III paper 119 of 2017. Other conventions reserve semi-additive category for categories with this enrichment and finite biproducts. A one-object category arising from a semiring has the enrichment without generally having those finite products.

In a complete finitary abelian category, the comparison $j$ with diagonal matrix entries the identity and off-diagonal entries zero is monic. Express its source as the directed colimit of finite biproducts. Their maps into the product have finite-coordinate retractions and are therefore split monomorphisms; the finitary axiom applies to this cocone. If the category is also cofinitary abelian category, duality makes $j$ epic and hence invertible. For countably many copies of any object, the shift-and-fold argument in countable biproducts in an additive category force triviality then forces the identity to be zero, so every object is a zero object.

A preadditive category has an abelian-group structure on every hom-set and bilinear composition. One equivalent definition of an additive category is a preadditive category with a zero object and finite products in a category; the following argument proves that these products in a category are automatically coproducts in a category. An abelian category is an additive category with kernels and cokernels in which every monomorphism is a kernel and every epimorphism is a cokernel. Equivalently, for every arrow the canonical map from its coimage to its image is invertible.

Let $P={\prod }_{i=1}^n{A}_i$, with projections $p_i$. Define ${\iota }_i:A_i\to P$ by $p_j{\iota }_i={\delta }_{ji}$, where the diagonal entry is the identity and the others are zero. Since its composites with all projections are identities,Given $f_i:A_i\to B$, the map $f={\sum }_i{f}_i{p}_i$ satisfies $f{\iota }_i=f_i$. If another map has those composites, multiplying the displayed identity by that map forces it to equal $f$. Thus $P$ is also a coproduct in a category. The empty case is the zero object. Reversing arrows proves that a finite coproduct in a category is likewise a product in a category. Hence finite products in a category and coproducts in a category are canonically biproducts in an additive category.

For the category of abelian groups, let $(A_i,D_{ij})$ be a directed diagram, with no injectivity assumption on its transition maps. Its set colimit consists of classes $[i,a]$, withDirectedness proves transitivity of this relation. Define addition by moving representatives to a common upper index:Moving all indices involved to one further upper bound proves independence of representatives and of $k$. Define $-[i,a]=[i,-a]$ and use the common class of the zeros as zero. The abelian-group laws hold at a common index, so descend to the quotient. Every canonical map $A_i\to C$ is a homomorphism, and a compatible cocone induces the homomorphism $[i,a]\mapsto f_i(a)$. This is the unique extension. Moreover the formula for addition is forced by those canonical homomorphisms, proving that the underlying-set functor creates directed colimits. This establishes directed colimits created by the abelian-group forgetful functor explicitly.

If a cocone ${\nu }_i:A_i\to B$ has injective legs, the induced map $C\to B$ is injective. Indeed, equal images of $[i,a]$ and $[j,b]$ give, at a common index $k$,Injectivity of ${\nu }_k$ gives equal representatives at $k$. Since monomorphisms of abelian groups are exactly injective homomorphisms, we have proved that the category of abelian groups is a finitary abelian category in the directed-union sense of the question.

Now let $\mathcal{A}$ be complete, cocomplete and finitary. Index by finite subsets $J\subseteq I$ and put $S_J={⨁}_{j\in J}{A}_j$. For $J\subseteq K$, insert the additional zero coordinates. A compatible cocone on these finite biproducts is exactly a family of maps from every $A_i$, so their directed colimit is $S={\coprod }_{i\in I}{A}_i$.

Each finite biproduct has a map $k_J:S_J\to P={\prod }_{i\in I}{A}_i$ using its coordinates in $J$ and zeros outside $J$. Projection to the finite set of coordinates in $J$ is a retraction, so $k_J$ is a split monomorphism. These maps form a cocone of monomorphisms. The finitary property makes its induced map a monic arrow, and that induced map is exactly the canonical infinite identity matrix:This proves the coproduct-to-product comparison in a finitary abelian category. The PDF's use of finite products in a category in the hint is valid because these are the same finite biproducts.

If $\mathcal{A}$ is also a cofinitary abelian category, apply this argument in its opposite category. The same canonical comparison $j$ is then an epic arrow in $\mathcal{A}$. In an abelian category an arrow that is both a monomorphism and an epimorphism is invertible, so $j$ is an isomorphism.

For countably many copies of $A$, put $S={\coprod }_{n\ge 0}A$ and let $q=j^{-1}\Delta :A\to S$, where $\Delta$ is the product in a category diagonal. Let ${\iota }_n$ denote the coproduct in a category injections, let $s:S\to S$ shift them by $s{\iota }_n={\iota }_{n+1}$, and let $\nabla :S\to A$ be the codiagonal. Comparing every product in a category coordinate givesSince $j$ is a monic arrow, $q={\iota }_0+sq$. Also $\nabla {\iota }_0=1_A$ and $\nabla s=\nabla$. Therefore, for $z=\nabla q$,Hom-sets are abelian groups, so cancellation gives $1_A=0$. Any arrow to or from $A$ is consequently zero by composition with its identity. Thus every object is both initial and terminal, andThis is the countable shift-and-fold argument behind countable biproducts in an additive category force triviality.

An abelian category is an additive category with kernels in a category and cokernels in a category in which the canonical comparison from coimage to image of every morphism is an isomorphism. This is the standard image-coimage form of the definition, equivalently expressed by normality of every monomorphism and epimorphism. Additivity means abelian-group hom-sets with bilinear composition, a zero object and finite biproducts. A sequence is exact at an object when the image of the incoming morphism is the kernel in a category of the outgoing one.

For $f:X\to Y$, construct $q:X\to \mathrm{coim}f=\mathrm{coker}(\ker f)$ and $j:\mathrm{im}f=\ker (\mathrm{coker}f)\to Y$. The universal properties give $f=j\bar{f}q$: first $f$ kills its kernel in a category and factors through $q$; then the resulting map is killed by $\mathrm{coker}f$ because $q$ is epic, so it factors through $j$. The comparison $\bar{f}$ is invertible by the abelian axiom. Cokernels in a category are epic and kernels in a category monic, directly by uniqueness in their universal properties, so $e=\bar{f}q$ is epic and $j$ monic. Thus $\boxed{f=je\text{ is an epimorphism-monomorphism factorization}}$.

In a short exact sequence $0\to X\stackrel{i}{\to }Y\stackrel{p}{\to }Z\to 0$, we have $i=\ker p$ and $p=\mathrm{coker}i$, up to the canonical isomorphisms. If $r:Y\to X$ retracts $i$, the map $1_Y-ir$ kills $i$ and factors as $sp$ for some $s:Z\to Y$. Composing with $p$ gives $psp=p$, so epicity gives $ps=1_Z$. Conversely if $ps=1_Z$, then $1_Y-sp$ is killed by $p$ and factors as $ir$. Composing with $i$ gives $iri=i$, so monicity gives $ri=1_X$. ConsequentlyIn that case $Y\cong X\oplus Z$.

For the derived-functor requests, use additive right exact functors, as customary in abelian homological algebra. An abelian category with enough projectives permits an augmented projective resolution $\cdots \to P_2\to P_1\to P_0\to X\to 0$, obtained by repeatedly taking an epimorphism from a projective onto the previous kernel in a category. Apply $F$ and defineProjective lifts construct maps of resolutions; the comparison and chain-homotopy results make the construction independent of choices and functorial. For a short exact sequence, the horseshoe construction produces a degreewise split short exact sequence of resolutions, hence of their images under additive $F$. Its homology objects give the long exact sequenceThis supplies the requested sketch; detailed comparison and functoriality proofs are not needed here.

A projective object $X$ has a resolution concentrated in degree zero, so $L_{1}F(X)=0$ for every such $F$. Conversely choose $0\to K\stackrel{i}{\to }P\to X\to 0$ with $P$ projective, and take $F=\mathcal{A}(-,K)$ with target ${\mathbf{Ab}}^{\mathrm{op}}$. Precomposition makes this covariant to the opposite category. The usual left exactness of contravariant Hom, which follows directly from the cokernel in a category universal property, says exactly that this $F$ is right exact in that opposite target. If $L_{1}F(X)=0$, the long exact sequence and $L_{1}F(P)=0$ make $F(K)\to F(P)$ monic in ${\mathbf{Ab}}^{\mathrm{op}}$. Equivalently,is epic, hence surjective, in abelian groups. The identity of $K$ has a preimage, giving a retraction of $i$. The sequence splits, and $X$ is a direct summand of $P$, hence projective: a lifting problem for $X$ extends along the projection $P\to X$, is solved for $P$, and restricts along the summand inclusion. ThereforeThis is projectivity detected by all first left derived functors. The following parts prove the three requested equivalent formulations of a hereditary abelian category with enough projectives.

A semi-additive category has commutative-monoid enrichment: each hom-set is a commutative monoid, and composition in a category preserves addition and zero in each variable. In the finite-biproduct convention, which we use here, it also has finite products in a category and coproducts in a category. A preadditive category has abelian groups as its hom-sets, with composition additive in each variable; this definition alone does not require finite products in a category or a zero object.

Let $P={\prod }_{i=1}^n{A}_i$ with projections $p_i$. Define $i_j:A_j\to P$ by $p_i{i}_j=1_{A_j}$ for $i=j$ and $p_i{i}_j=0$ otherwise. Bilinearity givesso product uniqueness gives ${\sum }_j{i}_j{p}_j=1_P$. For a family $f_j:A_j\to X$, set $f={\sum }_j{f}_j{p}_j$. Then $f{i}_j=f_j$. If $h:P\to X$ has the same restrictions, $h=h{\sum }_j{i}_j{p}_j={\sum }_j{f}_j{p}_j=f$. Thus the product in a category is also the coproduct in a category, with its canonical injections. Conversely, the analogous construction from a finite coproduct in a category gives projections and the same identities, proving that it is a product in a category.

For the empty family, a terminal object $T$ has a singleton endomorphism monoid, so $1_T=0$. Every map $T\to X$ equals its composite with $1_T=0$, hence equals the zero map; this map exists by enrichment. Therefore $T$ is also an initial object, a zero object. The dual argument applies to an initial object. Consequently finite products in a category and coproducts in a category coincide canonically as biproducts, including the nullary case.

A preadditive category has an abelian group structure on every hom-set, with composition additive in each variable. Neither a zero object nor biproducts are part of this definition.

Fix $C$ and use the reflexive pair $f,g:A\rightrightarrows B$, $r:B\to A$, with $fr=gr=1_B$. Take objects $x:C\to B$ and arrows $a:C\to A$, with source $fa$, target $ga$, and identity at $x$ equal to $rx$. For composable $a,b$, so $ga=fb$, defineThe preadditive category axioms giveThus the formula has the required endpoints. The identities satisfy $(rga)\circ a=a$ and $a\circ (rfa)=a$, using $gr=fr=1_B$.

For $ga=fb$ and $gb=fc$, both ways of composing three arrows equalIndeed $g(b\circ a)=gb$, while expanding $c\circ b$ and then composing with $a$ gives the same expression. Hence composition is associative.

Every arrow has inverseIts source is $ga$ and its target is $fa$. Substituting in the composition formula gives $a^{-1}\circ a=rfa$ and $a\circ a^{-1}=rga$. Therefore this is a groupoid.

For $u:C^{\prime }\to C$, precomposition by $u$ preserves sources, targets, identities, composition and inverses by bilinearity. Thus the construction is natural in $C$, giving the requested internal groupoid structure in its hom-set formulation. If the composable-arrow pullback in a category exists, the same formula defines its internal composition morphism. The reflexive-pair groupoid formula in a preadditive category requires no extra additive-category hypotheses.

Use the displayed square's notation $f:A\to B$, $h:A\to C$, $g:B\to D$, $k:C\to D$, with $gf=kh$ and $g$ epic. Form the biproduct and the morphismsThe map $q$ is an epimorphism, since its restriction to $B$ is $g$: equality after $q$ implies equality after $g$. The pullback in a category property says exactly that $j$ is a categorical kernel of $q$. Indeed $qj=gf-kh=0$, and a map into $B\oplus C$ killed by $q$ is a pair $(x,y)$ with $gx=ky$, which factors uniquely through $(f,h)$.

Use the standard abelian category property that every epimorphism is the categorical cokernel of its categorical kernel. If $u:B\to X$ and $v:C\to X$ satisfy $uf=vh$, then $[u,-v]j=0$. Hence there is a unique $w:D\to X$ with $wq=[u,-v]$. Restriction to the two summands gives $wg=u$ and $wk=v$. This is the pushout in a category universal property. Thus a pullback of an epimorphism is a pushout in an abelian category.

In this pushout, $g$ is the pushout of $h$ along $f$. The reflection result of part (b) therefore makes $h$ epic. This proves pullback stability of epimorphisms in an abelian category.

Finally, let $e:E\to B$ be an epimorphism and let $p_1,p_2:R\rightrightarrows E$ be its kernel pair. Their pullback square is a pushout by the result just proved. If $u:E\to X$ satisfies $u{p}_1=u{p}_2$, the two copies of $u$ form a pushout cocone. There is a unique $v:B\to X$ with $ve=u$. Hence epimorphisms in an abelian category are coequalizers of their kernel pairs, so they are regular epimorphisms.

An abelian category is an additive category with a kernel in a category and a cokernel in a category for every morphism, in which every monomorphism is a kernel and every epimorphism is a cokernel. In particular, every epimorphism $p$ is the cokernel of its own kernel: if $p$ is initially a cokernel of $u$, then $u$ factors through $\ker p$, and the two cokernel universal properties agree. The dual statement holds for monomorphisms. Finite biproducts and kernels construct finite limits.

For pullback stability of epimorphisms in an abelian category, let $p:B\to C$ be an epimorphism and $k:C^{\prime }\to C$ any morphism. The mapis epic, since its restriction to the $B$ summand is $p$. Its kernel in a category $i=(h,p^{\prime }):B^{\prime }\to B\oplus C^{\prime }$ exhibits the pullback in a category: the equation $d(h,p^{\prime })=0$ means $ph=k{p}^{\prime }$ and has exactly that universal property.

Suppose $v:C^{\prime }\to D$ satisfies $v{p}^{\prime }=0$. The morphism $[0,v]:B\oplus C^{\prime }\to D$ annihilates $i$, so, because $d$ is the cokernel in a category of $i$, it factors as $[0,v]=wd$ for some $w:C\to D$. Restricting to $B$ gives $wp=0$, and epicity gives $w=0$. Hence $v=0$. Applying this to the difference of any two morphisms agreeing after $p^{\prime }$ proves that $p^{\prime }$ is an epimorphism. ThereforeThis proof uses normality from the definition, rather than assuming the stability to be proved.

For the pullback of a short exact sequence in an abelian category, use the displayed square's notation $g,g^{\prime },h,k$. Exactness makes $f:A\to B$ the kernel in a category of $g$. Since $gf=0=k0$, the pullback in a category gives a uniqueIf $u:X\to B^{\prime }$ has $g^{\prime }u=0$, then $g(hu)=k{g}^{\prime }u=0$, so there is a unique $v:X\to A$ with $fv=hu$. Both projections of the pullback give $f^{\prime }v=u$: their composites with $h$ are equal and their composites with $g^{\prime }$ are zero. The uniqueness of $v$ follows from monicity of $f$. Thus $f^{\prime }$ is the kernel in a category of $g^{\prime }$. By the preceding stability result, $g^{\prime }$ is an epimorphism. We obtain the required exact sequence in an abelian category:

Finally form the pullback in a category $E=P{\times }_C{P}^{\prime }$ of the two projective presentations. Pulling back each of their short exact sequences in an abelian category givesBecause each of $P^{\prime }$ and $P$ is a projective object in a category, the respective final epimorphisms have sections: lift their identity morphisms through those epimorphisms. The usual additive category splitting argument identifies each middle object with the biproduct of its kernel and quotient. Explicitly, a kernel inclusion $j$ and section $s$ give the isomorphism $[j,s]$ from that biproduct to the middle object; $1-sq$ factors through $j$ and provides its inverse's kernel component. Henceand we conclude the Schanuel lemma in an abelian category:

A pointed category has a zero object, both initial and terminal. Factoring through that object gives a zero morphism $0_{A,B}$ between any two objects. In this paper a semi-additive structure means commutative-monoid enrichment: every hom-set is a commutative monoid with additive zero, and composition distributes over addition in both variables. No existence of finite products in a category is included in this last definition. This convention matters for the final one-object example; under the stronger convention requiring finite biproducts, that example would not be a semi-additive category.

Let $c_{A,B}:A+B\to A\times B$ be the given canonical isomorphism. Transfer the coproduct injections across $c_{A,B}$, so $A\times B$ is also a coproduct in a category, with injectionsWrite ${\nabla }_B:B\times B\to B$ for the morphism whose composites with $i_1,i_2$ are both $1_B$. For $f,g:A\to B$, define the biproduct-induced addition of morphisms byThe zero is the existing zero morphism. We verify the laws from the universal properties, without assuming addition in advance.

All finite canonical maps from coproducts to products are isomorphisms, by induction from the binary ones and the zero object. Thus both $(B\times B)\times B$ and $B\times (B\times B)$ are ternary coproducts in a category. The two iterated fold maps to $B$ agree on each of the three injections, hence are equal. Applying this to $⟨f,g,h⟩$ gives associativity. The interchange $B\times B\to B\times B$ swaps the two injections, so its composite with ${\nabla }_B$ is ${\nabla }_B$, giving commutativity. Finally $⟨f,0⟩=i_{1}f$, so $f+0=f$, and similarly $0+f=f$.

Precomposition is additive because $⟨f,g⟩u=⟨fu,gu⟩$. For $v:B\to C$, the morphisms $v{\nabla }_B$ and ${\nabla }_C(v\times v)$ agree on both injections, so they agree; consequently $v(f+g)=vf+vg$. Composition with a zero morphism is zero. This proves the commutative-monoid enrichment.

It is unique. In any such enrichment, the additive zero morphisms agree with the pointed ones, since each map to or from the zero object belongs to a singleton hom-set. The projections of $i_1{p}_1+i_2{p}_2$ from $A\times B$ are respectively $p_1,p_2$ by bilinearity, soFor $A=B$, composing on the left by ${\nabla }_B$ and on the right by $⟨f,g⟩$ forces the displayed formula for $f+g$. Thus the biproducts determine exactly one such enrichment.

For the last part, the underlying one-object category has endomorphism monoid $(\mathbb{N},\cdot )$, including $0$, and identity $1$. Its usual addition gives a commutative-monoid enrichment. Any permutation $\sigma$ of the prime numbers extends, by unique prime factorization, to a multiplicative monoid automorphism ${\varphi }_{\sigma }:\mathbb{N}\to \mathbb{N}$, fixing $0,1$. Transport addition byThis is a commutative monoid operation with zero $0$, and multiplication distributes over it: applying ${\varphi }_{\sigma }$ reduces each distributive law to the ordinary one in $\mathbb{N}$. Thus each operation supplies a semi-additive structure on the same fixed composition law.

For each odd prime $p$, take $\sigma$ to interchange $2$ and $p$, fixing every other prime. ThenDifferent choices of $p$ give different additions, and there are infinitely many prime numbers. Hence there are infinitely many distinct semi-additive structures, even though these transported structures are isomorphic as enriched categories. The underlying one-object category has no terminal object, because its endomorphism set is not a singleton, so it indeed has no finite products in a category.

In a semi-additive category, hom-sets are commutative monoids and composition is additive in both variables. Write $S={\coprod }_i{A}_i$, $P={\prod }_i{A}_i$, with injections ${\nu }_i$ and projections ${\pi }_i$. The canonical $c:S\to P$ has ${\pi }_{i}c{\nu }_j=1_{A_i}$ when $i=j$ and zero otherwise. DefineBilinearity givesThe universal properties of the product in a category and coproduct in a category imply $cd=1_P$ and $dc=1_S$. For the empty family, $S$ is initial and $P$ terminal. Their endomorphisms are necessarily the identity and the zero morphism; the zero map $P\to S$ therefore also gives inverse composites. Thus the comparison is an isomorphism for every finite family, giving a biproduct:

In a pointed category, a normal monomorphism is a monomorphism that is the kernel in a category of some morphism. Suppose $m:M\hookrightarrow A$ is the kernel of $f:A\to B$, and let $q:A\to Q$ be the cokernel in a category of $m$. Since $fm=0$, there is a unique $\bar{f}:Q\to B$ with $f=\bar{f}q$. If $qx=0$, then $fx=\bar{f}qx=0$, so the universal property of $m=\ker f$ factors $x$ uniquely through $m$. Therefore $m=\ker q=\ker (\mathrm{coker}m)$. The converse is immediate: if $m$ is the kernel of its cokernel, it is the kernel of a morphism and hence normal.

An abelian category is an additive category with kernels and cokernels in which every monomorphism is normal and every epimorphism is a conormal epimorphism. Finite biproducts and kernels give finite limits. The image and coimage in an abelian category give every $f:A\to B$ the canonical factorizationand the middle map is an isomorphism. The first map is a cokernel and therefore a regular epimorphism. Every epimorphism in an abelian category is the cokernel of its kernel, and epimorphisms are stable under pullback; consequently regular epimorphisms are pullback-stable. This proves that every abelian category is regular.

Define the additive indexing category for chain complexes $\mathbf{Z}$ as follows. Its objects are the integers andLet the generator of $\mathbf{Z}(n,n)$ be $1_n$ and the generator of $\mathbf{Z}(n,n-1)$ be ${\partial }_n$. Composition is bilinear, the $1_n$ are identities, andbecause the target hom-group $\mathbf{Z}(n,n-2)$ is zero. An additive functor $C:\mathbf{Z}\to \mathcal{A}$ chooses objects $C_n=C(n)$ and differentials $d_n=C({\partial }_n)$ satisfying $d_{n-1}{d}_n=0$, hence a complex in an abelian category. Conversely every chain complex defines this unique additive functor.

For self-duality, put $Z_n=\ker d_n$, $B_n=\mathrm{im}{d}_{n+1}$, and let $q:C_n\to Q_n=\mathrm{coker}{d}_{n+1}$. Since $d_n{d}_{n+1}=0$, there is a unique ${\bar{d}}_n:Q_n\to C_{n-1}$ with ${\bar{d}}_{n}q=d_n$. The image-to-kernel factorization gives a canonical isomorphismPassing to the opposite category exchanges kernels with cokernels and images with coimages. The usual construction in ${\mathcal{A}}^{\mathrm{op}}$ is therefore the expression on the right, which is canonically the original homology object. This proves the self-duality of homology.

A semi-additive category is a category whose hom-sets are commutative monoids and whose composition is additive in each variable, with finite products and coproducts.

Suppose first that $P=A\times B$ is a binary product in a category, with projections $p_1,p_2$. The zero morphisms and the product property define mapsbyThe two projections of $i_1{p}_1+i_2{p}_2$ equal those of $1_P$, soFor $f:A\to C$ and $g:B\to C$, the mapsatisfies $h{i}_1=f$ and $h{i}_2=g$. If $k$ has the same restrictions, thenThus $(P,i_1,i_2)$ is also the binary coproduct. The dual argument starts from a coproduct and makes it a product. Hence binary products and coproducts coincide canonically as biproducts.

Let $f,g:A\rightrightarrows B$ be a reflexive pair in an additive category, with $fr=gr=1_B$. For every object $C$, regard $x:C\to A$ as an arrow from $fx$ to $gx$ between objects of $\mathcal{C}(C,B)$. The identity at $b:C\to B$ is $rb$.

If $gx=fy$, define the composite byIts source and target areThe identities follow fromand associativity follows immediately by expanding both iterated composites and using the matching equations. The inverse of $x$ iswhose source is $gx$, whose target is $fx$, and whose two composites with $x$ are the appropriate identity arrows. These formulas are natural in $C$, so the Yoneda lemma identifies them with structure morphisms in $\mathcal{C}$. The pair is therefore an internal groupoid, proving that every reflexive pair in an additive category is an internal groupoid.

This fails for semi-additive categories. In the category of commutative monoids, letunder coordinatewise addition. The two projections $f,g:R\rightrightarrows \mathbb{N}$ have the common splitting $r(n)=(n,n)$, so they form a reflexive pair. Its underlying reflexive graph is the usual order category on $\mathbb{N}$: there is an arrow $m\to n$ exactly when $m\le n$. If it were an internal groupoid, the arrow $0\to 1$ would have an inverse $1\to 0$, but $(1,0)\notin R$. Therefore this reflexive pair is not an internal groupoid, and “additive” cannot be weakened to “semi-additive.”

A category is preadditive if every hom-set is an abelian group and composition is additive in each variable. Zero morphisms and differences of parallel morphisms are therefore defined. A zero object or finite biproducts need not exist; these are extra requirements in an additive category.

An additive functor between abelian categories is right exact functor when it sends every exact sequence $X\to Y\to Z\to 0$ to an exact sequence $FX\to FY\to FZ\to 0$. Equivalently, it preserves cokernels in a category, since additivity already preserves finite biproducts. This is the convention used in constructing left derived functors. Left exactness preserves the initial part $0\to X\to Y\to Z$ instead. Contravariant Hom becomes a right exact functor covariant functor with target the opposite abelian category.

An additive functor between abelian categories is right exact when it preserves categorical cokernels, equivalently when it sends every exact sequence ending in zero to an exact sequence ending in zero. Additivity and preservation of cokernels in a category imply preservation of finite colimits. The additivity assumption is part of the ordinary left derived functor construction.

Two projective presentations of the same object in an abelian category, with kernels $K,K^{\prime }$ and middle objects $P,P^{\prime }$, satisfy $K\oplus P^{\prime }\cong K^{\prime }\oplus P$. Form their pullback in a category. Its two induced short exact sequences in an abelian category split because each quotient is a projective object in a category. The two resulting biproduct descriptions of the pullback give the isomorphism.

A semi-additive category has a commutative-monoid enrichment and finite products in a category and coproducts in a category. Composition preserves addition and zero in each variable. Every finite product in a category is canonically a coproduct in a category and conversely, producing finite biproducts. Some authors use "semi-additive structure" for the commutative-monoid enrichment alone; that weaker convention also permits one-object categories without finite products in a category.

A preadditive category instead has abelian-group-valued hom sets. Semi-additivity alone does not require additive inverses.