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

Additive Categories and Direct Sums

Research Depth 85 in the knowledge graph ☐ I know this ☆ Set as goal
28topics build on this
398prerequisites beneath it
See this on the map →
Monomorphisms and EpimorphismsZero Objects and Zero Morphisms+1 more→→Biproducts and Biproduct DecompositionExact Sequences in Categories+3 more
algebraic-structure limits homological-algebra

Core Idea

An additive category is an Ab-enriched category where Hom-sets are abelian groups and composition is bilinear. Finite products and coproducts coincide (both are direct sums). Additive categories provide the minimal algebraic structure to define exact sequences and chain complexes, forming the foundation of homological algebra.

Explainer

From your work on products and coproducts, you know these are dual constructions: a product A × B comes with projections to each factor, while a coproduct A ⊔ B comes with injections from each factor. In a general category these can be very different objects — the product of two sets is their Cartesian product, while the coproduct is their disjoint union. An additive category is one where this distinction collapses: every finite product is also a coproduct, and the shared object is called the direct sum A ⊕ B. The key extra ingredient that forces this collapse is the enrichment: every Hom-set carries the structure of an abelian group, and composition distributes over this group structure (bilinearity).

The abelian group structure on Hom(A, B) means you can add morphisms: given f, g: A → B, you have a sum f + g: A → B, and a zero morphism 0: A → B. This is not available in a general category — in the category of sets, there is no natural way to add two functions. The requirement that composition is bilinear means h ∘ (f + g) = h ∘ f + h ∘ g and (f + g) ∘ k = f ∘ k + g ∘ k. This bilinearity condition, combined with the existence of a zero object (the prerequisite you studied), is exactly what makes products and coproducts coincide. You can construct the direct sum A ⊕ B explicitly with both the injection maps (i_A: A → A ⊕ B, i_B: B → A ⊕ B) and the projection maps (π_A: A ⊕ B → A, π_B: A ⊕ B → B) satisfying π_A ∘ i_A = id_A, π_B ∘ i_B = id_B, π_A ∘ i_B = 0, π_B ∘ i_A = 0, and i_A ∘ π_A + i_B ∘ π_B = id_{A⊕B}.

The canonical examples are the category of abelian groups Ab, the category of modules over a ring, and the category of vector spaces over a field. In each case, Hom(A, B) is the group of homomorphisms (or linear maps), which forms an abelian group under pointwise addition. The zero morphism sends everything to the zero element of B. The direct sum A ⊕ B is the usual direct sum of abelian groups or modules, with coordinate-wise operations. Categories of sets, topological spaces, or groups (without abelian assumption) are not additive: in the category of groups, for instance, the pointwise sum of two homomorphisms is generally not a homomorphism.

Additive categories are the setting where homological algebra begins. To define exact sequences — the sequences 0 → A → B → C → 0 where the image of each map equals the kernel of the next — you need to talk about kernels and cokernels as morphisms, not just as sets. This requires the additional structure of an abelian category (which adds the requirement that every monomorphism is a kernel and every epimorphism is a cokernel), but additive categories are the necessary first step: without the ability to add morphisms and form direct sums, neither chain complexes nor the long exact sequences of homology would be well-defined.

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

Longest path: 86 steps · 398 total prerequisite topics

Prerequisites (3)

Leads To (5)