A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Abelian Categories

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
24topics build on this
443prerequisites beneath it
See this on the map →
Biproducts and Biproduct DecompositionCategories and Morphisms+7 more→→Abelian Categories and Homological AlgebraChain Complexes and Exact Sequences+5 more
abelian category additive category kernel cokernel exact sequence Ab-enriched

Core Idea

An abelian category is an additive category (enriched over abelian groups, with biproducts) in which every morphism has a kernel and cokernel, every monomorphism is the kernel of its cokernel, and every epimorphism is the cokernel of its kernel. This axiom system, formalized by Grothendieck and Buchsbaum, captures the essential properties of categories like Ab (abelian groups), R-Mod (modules over a ring), and sheaves of abelian groups, enabling homological algebra to be developed in a purely categorical setting. The Freyd-Mitchell embedding theorem shows every small abelian category embeds exactly into some R-Mod, justifying diagram-chasing arguments.

How It's Best Learned

Verify the abelian category axioms for R-Mod: check that hom-sets are abelian groups, biproducts exist (direct sums), every morphism has a kernel and cokernel, and the canonical factorization image(f) → coimage(f) is an isomorphism. Then try to find a non-example: the category of free abelian groups is additive but not abelian (cokernels may not be free).

Common Misconceptions

Explainer

If you have worked through categories and morphisms and understand equalizers, you already know what kernels are in familiar settings: the kernel of a group homomorphism f: G → H is the subgroup of elements mapped to the identity. Abelian categories take that idea and axiomatize it purely in terms of morphisms, with no reference to elements.

The starting point is an *additive* category: one where every hom-set carries an abelian group structure that is compatible with composition, and where finite products and coproducts coincide (these coinciding objects are called biproducts, or direct sums). In Ab or R-Mod, the biproduct of M and N is just M ⊕ N, and hom-sets inherit pointwise addition. Once you have additivity, you can define the kernel of f: A → B as the equalizer of f and the zero morphism — a construction you have already seen. The cokernel is the dual notion: it is the coequalizer of f and 0.

An abelian category adds two exactness axioms on top of additivity. First, every morphism must have both a kernel and a cokernel. Second, the canonical factorization of any morphism f as A ↠ coimage(f) → image(f) ↣ B must have the middle map be an isomorphism. In R-Mod this is automatic — the coimage is A/ker(f) and the image is the set-theoretic image, and the first isomorphism theorem says they are isomorphic. The axiom demands this holds *categorically* without assuming elements.

The Freyd-Mitchell embedding theorem tells you that this axiomatic framework is, in a precise sense, equivalent to working in some module category. Any small abelian category embeds exactly into R-Mod for some ring R. "Exactly" means exact sequences are preserved and reflected — so a sequence that is exact in the abstract category maps to an exact sequence of modules, and vice versa. This justifies the widespread practice of proving lemmas (snake lemma, five lemma, horseshoe lemma) by element-chasing: even in an abstract abelian category, there is always an underlying module category where the proof goes through, and the embedding carries it back.

The boundary of the abelian world is worth knowing. Free abelian groups form an additive category that is not abelian, because cokernels of maps between free modules can have torsion (like Z/2Z), which fails to be free. Topological abelian groups and Banach spaces form categories where some abelian axioms fail. Recognizing these non-examples sharpens the intuition for what the exactness axioms are actually buying you.

Practice Questions 3 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Universal Properties → Initial and Terminal Objects → Zero Objects and Zero Morphisms → Additive Categories and Direct Sums → Biproducts and Biproduct Decomposition → Abelian Categories

Longest path: 88 steps · 443 total prerequisite topics

Prerequisites (9)

Leads To (7)