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

Monomorphisms and Epimorphisms

Graduate Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
29topics build on this
377prerequisites beneath it
See this on the map →
Categories and Morphisms→→Additive Categories and Direct Sums
morphisms universal-properties categorical-structure

Core Idea

Monomorphisms generalize injective functions to arbitrary categories: a morphism f: A → B is monic if whenever gf = hf, then g = h. Epimorphisms are the dual concept, generalizing surjections. In categories without a notion of elements, these abstract properties capture injectivity and surjectivity without requiring explicit set-theoretic membership.

How It's Best Learned

Start in Set and Ring where monomorphisms are exactly injections and epimorphisms are exactly surjections. Then explore categories where these concepts diverge—for example, in rings the natural homomorphism R → R[x] is epic but not surjective.

Common Misconceptions

Assuming monomorphisms are always injective (false in general). Thinking epimorphisms must be surjective (counterexample: R → R[x] in Ring). Assuming every morphism is either monic or epic.

Explainer

From your study of categories and morphisms, you know that category theory abstracts mathematical structures away from their internal elements, describing objects only through their relationships — the morphisms between them. Most concepts that feel element-dependent in familiar settings (like injectivity: "no two inputs give the same output") must be reformulated in terms of morphisms to make sense in an arbitrary category. Monomorphisms and epimorphisms are the categorical versions of injective and surjective maps, and the reformulation reveals what those concepts truly mean structurally.

A morphism f: A → B is a monomorphism (or *monic*) if it is left-cancellable: for any two morphisms g, h: C → A, if f ∘ g = f ∘ h then g = h. In Set, this coincides exactly with injectivity. Here's the intuition: if f is injective, then knowing f(g(x)) = f(h(x)) for all x forces g(x) = h(x), since different inputs can't produce the same output under an injective map. The categorical definition extracts this "information-preserving" property without ever mentioning elements. A monomorphism is a morphism through which you can distinguish the domain — you cannot "compress" information passing through it. Dually, f: A → B is an epimorphism (or *epic*) if it is right-cancellable: for any g, h: B → C, if g ∘ f = h ∘ f then g = h. In Set, surjectivity ensures this: if f hits every element of B, then any two functions that agree on all outputs of f must agree everywhere on B.

The surprise is that these concepts diverge from injectivity/surjectivity outside of Set. In the category Ring (with ring homomorphisms), the inclusion ι: ℤ → ℚ is an epimorphism even though it is far from surjective. The reason: any ring homomorphism f: ℚ → R is entirely determined by f(1) (since f(p/q) = f(p)/f(q) by homomorphism axioms, and f(p) is determined by f(1)). So if g ∘ ι = h ∘ ι — meaning g and h agree on all integers — they must agree on all rationals. Right-cancellability holds, so ι is epic. Yet ℚ has elements (non-integer rationals) that ι never reaches. This shows that epimorphism is *not* about surjectivity; it's about whether morphisms out of the codomain are uniquely determined by composition with f.

Understanding where mono/epic do and don't coincide with injective/surjective is important for each category you work in. In Ab (abelian groups) and more generally in any abelian category, the coincidence is restored: monomorphisms are exactly injections (kernel = 0) and epimorphisms are exactly surjections (cokernel = 0), with the natural notion of image and coimage defined via universal properties. This is part of why abelian categories are so well-behaved for homological algebra. In topological spaces, monomorphisms are again injections, but epimorphisms are *dense* continuous maps (not necessarily surjective). The categorical definitions thus serve as diagnostic tools: when mono ≠ injective or epic ≠ surjective in a given category, it reveals something structural about that category's morphisms — and understanding this divergence is the first step toward the richer theory of abelian and additive categories you'll study next.

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 → Monomorphisms and Epimorphisms

Longest path: 76 steps · 377 total prerequisite topics

Prerequisites (1)

Leads To (1)