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

Ext Functors as Derived Hom

Research Depth 93 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
558prerequisites beneath it
See this on the map →
Exact Sequences in CategoriesInjective Objects and Injective Envelopes+1 more→→Derived FunctorsTor Functors as Derived Tensor Product
derived-functors homological-algebra extensions

Core Idea

The Ext functor Ext^n(A, B) is the n-th right derived functor of Hom(A, −), computed via an injective resolution of B. Ext^1(A, B) classifies extensions of A by B, while higher Ext groups measure obstructions to splitting. Ext is fundamental to extension theory and provides invariants for classifying objects in abelian categories.

Explainer

From your study of exact sequences, you know that a short exact sequence 0 → B → E → A → 0 encodes the idea that E is built from B and A — but not necessarily as a direct sum B ⊕ A. The question of whether such a sequence splits (whether E ≅ A ⊕ B) is a central one, and you've seen that it depends on properties of the morphisms involved. From injective objects, you know that having enough injectives in an abelian category allows you to resolve any object in a canonical way. The Ext functor is where these ideas converge: it measures, systematically, the obstruction to splitting.

The construction begins by choosing an injective resolution of B: an exact sequence 0 → B → I0 → I1 → I2 → ⋯ where each Ik is injective. Such resolutions exist in any abelian category with enough injectives (like modules over a ring). Now apply the functor Hom(A, −) to the resolution (dropping B): you get a cochain complex 0 → Hom(A, I0) → Hom(A, I1) → Hom(A, I2) → ⋯. This complex is generally not exact — Hom(A, −) is left exact but not right exact, so exactness can fail at each step. The n-th cohomology of this complex is defined to be Ext^n(A, B). Ext^0(A, B) recovers Hom(A, B) itself (the original left-exact piece that did survive). The higher Ext groups measure the failure of the resolution to remain exact after applying Hom.

The deepest result is the classification theorem for Ext1: elements of Ext^1(A, B) are in natural bijection with equivalence classes of short exact sequences 0 → B → E → A → 0, where two extensions are equivalent if there is an isomorphism between them that fixes both B and A. The zero element of Ext^1(A, B) corresponds to the split extension B ⊕ A; a nonzero element corresponds to a genuinely non-split extension. This makes Ext1 a computable algebraic invariant that encodes whether and how A and B can be "glued together" non-trivially. For example, Ext1_ℤ(ℤ/2, ℤ) ≅ ℤ/2, which corresponds to the fact that there are exactly two extensions of ℤ/2 by ℤ: the split one (ℤ ⊕ ℤ/2) and the non-split one (ℤ itself, via the sequence 0 → ℤ →×2 ℤ → ℤ/2 → 0).

Higher Ext groups Ext^n(A, B) for n ≥ 2 have a similar interpretation in terms of longer exact sequences and appear naturally in cohomology theories. In group cohomology, Extn over the group ring ℤ[G] computes H^n(G, M); in sheaf theory, Extn encodes derived global sections. The power of the derived functor framework is that it is universal: regardless of which injective resolution of B you choose, the Ext groups are well-defined up to canonical isomorphism, so they are genuine invariants of the pair (A, B), not artifacts of the resolution.

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 → Products and Coproducts → Equalizers and Coequalizers → Limits and Colimits → Pullbacks and Pushouts → Adjoint Functors → Free Objects → Projective Objects and Projective Covers → Homological Dimension in Categories → Exact Sequences in Categories → Ext Functors as Derived Hom

Longest path: 94 steps · 558 total prerequisite topics

Prerequisites (3)

Leads To (2)