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

Exact Sequences in Abelian Categories

Research Depth 91 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
495prerequisites beneath it
See this on the map →
Abelian CategoriesChain Complexes and Exact Sequences+1 more→→Diagram Chasing Methods and LemmasThe Five Lemma and Related Results+1 more
exactness kernels images homology

Core Idea

In an abelian category, a sequence of morphisms is exact at an object if the image of one morphism equals the kernel of the next, generalizing the notion of exactness from module categories. Exactness is the central concept of homological algebra and allows systematic study of how information flows through categorical constructions.

How It's Best Learned

Start with short exact sequences in the category of abelian groups, then extend to modules and general abelian categories. Verify exactness by computing images and kernels. Construct examples of exact and non-exact sequences.

Common Misconceptions

Exactness at an object depends on both the morphism going in and going out, not either alone. Students sometimes forget that exactness is a local condition—it must hold at every object in the sequence.

Explainer

You've studied chain complexes and exact sequences in the concrete settings of abelian groups and modules, where kernels and images are specific subgroups you can compute by hand. Abelian categories abstract precisely the structure needed to make this machinery work — kernels, cokernels, images, and the factorization properties that connect them — without fixing what the objects actually are. The notion of an exact sequence in an abelian category is not a new definition: it is exactly the definition you already know, now valid in any abelian category at once.

Recall the definition: a sequence of morphisms ··· → A → B → C → ··· is exact at B if the image of the incoming morphism (A → B) equals the kernel of the outgoing morphism (B → C). In an abelian category, both kernel and image are defined as subobjects — objects equipped with monomorphisms into B — and "equal" means these subobjects are isomorphic over B. Exactness is a strictly local condition: you check it one object at a time. A long sequence can be exact at some objects and fail at others. When you say a sequence is exact, you mean it is exact at every intermediate object; exact at the endpoints requires specifying what the sequence continues with (typically 0).

The most fundamental case is the short exact sequence 0 → A → B → C → 0. This says four things simultaneously: the map A → B is a monomorphism (A injects into B); the map B → C is an epimorphism (B surjects onto C); the image of A in B equals the kernel of B → C; and every element of C has a preimage in B. Intuitively, C is obtained from B by "quotienting out" the copy of A inside it. In abelian groups: 0 → ℤ →^×2 ℤ → ℤ/2ℤ → 0 says that doubling injects ℤ into itself, and the cokernel of this injection is ℤ/2ℤ. In module theory this is the language of submodules and quotient modules. In topology it describes how spaces are constructed by attaching pieces. The short exact sequence is the single most reusable sentence in homological algebra.

Why extend exactness to a general abelian category rather than working always in modules? Because the same algebraic structure appears in categories of sheaves, cochain complexes, representations of algebras, and many other settings that don't have a clean element-level description. By proving theorems about exact sequences axiomatically — using only the properties of an abelian category — you obtain results that apply simultaneously to all of these. The snake lemma, five lemma, and long exact sequence of a pair all become theorems in any abelian category, proved once and applied everywhere. Exact sequences in abelian categories are the common scaffolding on which all of homological algebra is built, and the exactness condition is the thread that holds that scaffold together.

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 → Chain Complexes and Exact Sequences → Homology and Cohomology → Abelian Categories and Homological Algebra → Exact Sequences in Abelian Categories

Longest path: 92 steps · 495 total prerequisite topics

Prerequisites (3)

Leads To (3)