Abelian Categories

Executive summary

The minimum structure in which exact sequences make sense

An abelian category has a zero object, biproducts, kernels and cokernels, and satisfies the condition that every monomorphism is a kernel and every epimorphism a cokernel. Those axioms are exactly what is needed to define exactness, and everything in homological algebra up to derived functors goes through unchanged. The Freyd–Mitchell theorem then shows that any small abelian category embeds exactly into a module category, so element-based diagram chases remain legitimate.

Learning objectives

State the axioms of an additive and an abelian category.
Define exactness without reference to elements.
List the standard examples beyond modules.
State the Freyd–Mitchell theorem and what it licenses.
Identify the Grothendieck axioms and when they are needed.

Section 01The axioms

Stage 01AdditiveHom sets are abelian groups, composition is bilinear, there is a zero object and finite biproducts exist.
Stage 02Kernels and cokernelsEvery morphism has a kernel and a cokernel.
Stage 03NormalityEvery monomorphism is the kernel of its cokernel; every epimorphism is the cokernel of its kernel.
Stage 04ConsequenceEvery morphism factors as an epi followed by a mono, and the factorisation is unique. Exactness can now be defined.

With the factorisation available, a sequence is exact at B when the image of the incoming morphism equals the kernel of the outgoing one — where image means the mono part of the factorisation.

Normality is the substantive axiom

Additive categories with kernels and cokernels are common; the requirement that monos and epis are normal is what rules out pathologies. In the category of topological abelian groups, for instance, a continuous injection with dense image is mono and epi but not iso, and normality fails.

Section 02Examples

Abelian categories that matter here
Category	Note
Modules over a ring	The motivating example; has enough projectives and injectives
Abelian groups	Modules over ℤ
Sheaves of modules on a space	Enough injectives but generally NOT enough projectives — the reason sheaf cohomology uses injective resolutions
Chain complexes in an abelian category	Abelian; the starting point for derived categories
Functors from a small category into an abelian category	Abelian pointwise
Finitely generated modules over a Noetherian ring	Abelian; not enough projectives in general
Grp	NOT abelian — not even additive

Enough projectives is a separate hypothesis

Being abelian does not guarantee enough projectives or enough injectives. Sheaf categories are the standard case with injectives but no projectives, which is precisely why sheaf cohomology is defined by right derived functors of the global sections functor and has no left-derived counterpart.

Section 03The embedding theorem

Freyd–Mitchell: every small abelian category admits a full, faithful and exact embedding into a category of modules over some ring.

What it licenses and what it does not

Licenses: proving a statement about finitely many objects and morphisms — any diagram lemma — by chasing elements in modules. The embedding is exact and faithful, so the conclusion transfers back. Does not license: assuming the category is a module category, using arbitrary products or colimits, or invoking projectives that exist in the target but not the source.

The Grothendieck axioms, when more is needed
Axiom	Requires
AB3	Arbitrary coproducts exist
AB4	Coproducts are exact
AB5	Filtered colimits are exact
AB3, AB4, AB5*	The dual statements for products
Grothendieck category	AB5 plus a generator — guarantees enough injectives

Why AB5 plus a generator is the useful package

It is exactly the hypothesis under which injective resolutions can be constructed in general, which is what makes right derived functors available for sheaves. Module categories and sheaf categories both satisfy it.

ReferenceFrequently asked questions

Is the opposite of an abelian category abelian?

Yes — the axioms are self-dual. This is what makes the duality principle so powerful here: every theorem about abelian categories immediately yields its dual.

Can homological algebra be done without abelian categories?

Yes, and it is: exact categories, triangulated categories and higher-categorical frameworks all extend the reach. The abelian setting remains the natural home for Ext, Tor and derived functors in their classical form.

Do I need the embedding theorem to trust diagram lemmas?

Strictly, for element-based proofs, yes — or an intrinsic proof using generalised elements. In practice most texts prove the diagram lemmas by elements and cite the embedding once, which is legitimate provided the statement involves only a finite diagram.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Abelian Categories. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Abelian Categories as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—abelian, categories, category, section, additive—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Abelian Categories?