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

Properties of Abelian Categories

Research Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
15topics build on this
444prerequisites beneath it
See this on the map →
Abelian CategoriesAdditive Categories and Direct Sums→→Homological Dimension in Categories
abelian-categories homological-algebra structure

Core Idea

Abelian categories are additive categories satisfying two axioms: every morphism has a kernel and cokernel, and every monomorphism is a kernel and every epimorphism is a cokernel. This ensures rich homological properties: short exact sequences abound, kernels and cokernels coincide with 'categorical' subobjects, and the theory of extensions via Ext is well-defined.

Explainer

You know that an abelian category is an additive category where every morphism has a kernel and cokernel, and where monomorphisms and epimorphisms are the "right" kind of morphism — they are kernels and cokernels respectively. These axioms might seem technical, but they are chosen precisely to guarantee a cluster of structural properties that make homological algebra possible. Understanding which properties follow from which axioms, and why, reveals the architecture behind the definition.

The first major consequence is the first isomorphism theorem in categorical form. In any abelian category, for a morphism f: A → B, the coimage (cokernel of the kernel of f) is canonically isomorphic to the image (kernel of the cokernel of f). In the category of abelian groups, this recovers the classical theorem: A/ker(f) ≅ im(f). The fact that this holds in any abelian category means every result in homological algebra that rests only on the first isomorphism theorem is automatically valid in R-modules, sheaves of abelian groups, and every other abelian category — you prove it once, and it works everywhere.

Short exact sequences (SES) 0 → A → B → C → 0 are the fundamental building blocks of abelian category structure. The sequence is exact at B means the image of A → B equals the kernel of B → C. Exactness encodes "no gaps and no overlaps" at each position. In the category of modules, a SES says that A embeds into B with quotient C — so B is an "extension" of C by A. Not every such extension is trivial (a direct sum A ⊕ C); the Ext groups Ext¹(C, A) classify all extensions up to equivalence, and their vanishing characterizes when all sequences split. This is the entry point to derived functor theory.

The most celebrated structural result in abelian categories is the snake lemma: given a commutative diagram with exact rows, there is a natural connecting homomorphism ∂: ker(γ) → coker(α) making a longer exact sequence. The snake lemma cannot even be stated without the machinery of abelian categories, and its proof is a mechanical but illuminating diagram chase that works in any abelian category once you know that monomorphisms are kernels and epimorphisms are cokernels. The Freyd-Mitchell embedding theorem gives the ultimate license for such arguments: every small abelian category embeds fully and faithfully into a category of R-modules, meaning diagram chases performed in modules automatically transfer back to the abstract setting. This is why you are permitted to do element-level proofs even in abelian categories that have no elements, like sheaves.

Practice Questions 5 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 → Properties of Abelian Categories

Longest path: 89 steps · 444 total prerequisite topics

Prerequisites (2)

Leads To (1)