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

Homological Dimension in Categories

Research Depth 91 in the knowledge graph ☐ I know this ☆ Set as goal
14topics build on this
554prerequisites beneath it
See this on the map →
Properties of Abelian CategoriesAbelian Categories and Homological Algebra+2 more→→Exact Sequences in Categories
homological-algebra dimension resolutions

Core Idea

Homological dimension measures the 'length' of projective or injective resolutions. The projective dimension of an object is the shortest length of a projective resolution; global dimension is the supremum of projective dimensions of all objects. Low homological dimension implies strong homological properties, making it a fundamental invariant in ring theory and module categories.

Explainer

From your study of abelian categories and projective objects, you know that projective objects are those with the lifting property — morphisms out of them lift through epimorphisms. A projective resolution of an object M is an exact sequence ··· → P₂ → P₁ → P₀ → M → 0 where each Pᵢ is projective. Every object in a sufficiently nice abelian category (like R-modules for a ring R) admits such a resolution: start with a surjection P₀ → M from a projective, take the kernel K₀, surject from a projective P₁ onto K₀, take that kernel, and continue. The resolution exists; what varies is how long it needs to be.

The projective dimension pd(M) is the length of the shortest projective resolution — the smallest n such that you can arrange 0 → Pₙ → ··· → P₀ → M → 0 exactly. If M is itself projective, pd(M) = 0: the trivial resolution 0 → M → M → 0 works. If M is not projective but admits a two-step resolution 0 → P₁ → P₀ → M → 0, then pd(M) = 1. Think of pd(M) as measuring how many "correction steps" are needed to build M from projective building blocks — the higher the dimension, the more non-projective obstruction M carries. This is analogous to measuring the distance from M to the class of projective objects.

The global dimension gl.dim(R) of a ring is the supremum of projective dimensions of all R-modules. It reads as: "how complicated, in the worst case, can a module over R be?" If gl.dim(R) = 0, every R-module is projective — this characterizes semisimple rings (like direct products of matrix algebras). If gl.dim(R) = 1, every submodule of a projective is projective — this characterizes hereditary rings, which include principal ideal domains like ℤ and polynomial rings in one variable over a field. The celebrated Serre–Auslander–Buchsbaum theorem shows that a Noetherian local ring R is regular (geometrically: its spectrum is a smooth variety) if and only if R has finite global dimension. Homological dimension is not bookkeeping — it is an algebraic encoding of geometric smoothness.

The dual concept, injective dimension id(M), measures the length of the shortest injective resolution. A module can have finite projective dimension but infinite injective dimension, or vice versa. Both invariants appear when you compute the derived functors Ext and Tor: Extⁿ(M, N) vanishes for n > pd(M) and for n > id(N). This means homological dimension governs precisely when long exact sequences of Ext groups truncate — a fact that makes it the key organizational principle for the derived functor machinery you will 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 → 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

Longest path: 92 steps · 554 total prerequisite topics

Prerequisites (4)

Leads To (1)