Homological Dimension

Research Depth 61 in the knowledge graph I know this Set as goal
projective-dimension injective-dimension global-dimension free-resolution auslander-buchsbaum serre-theorem regular-local-ring

Core Idea

The projective dimension of a module M measures how far M is from being projective, via the minimum length of a projective resolution. The global dimension of a ring R is the supremum of projective dimensions of all modules. Serre's theorem -- that a Noetherian local ring is regular if and only if it has finite global dimension -- was the first major application of homological algebra to commutative algebra, and the Auslander-Buchsbaum formula pd(M) + depth(M) = depth(R) connects projective dimension to the concrete notion of regular sequences.

Explainer

Homological dimension quantifies the complexity of modules through resolutions. A projective resolution of an R-module M is an exact sequence ... → P_2 → P_1 → P_0 → M → 0 where each P_i is projective. The projective dimension pd(M) is the minimum length of such a resolution (or infinity if no finite resolution exists). Similarly, the injective dimension id(M) is the minimum length of an injective resolution 0 → M → E^0 → E^1 → .... The global dimension gl.dim(R) is the supremum of pd(M) over all R-modules M, equivalently the supremum of id(M) over all modules.

The Auslander-Buchsbaum formula is the central result connecting homological and commutative algebra. For a finitely generated module M over a Noetherian local ring (R, m), if pd(M) < ∞, then pd(M) + depth(M) = depth(R). This formula has immediate consequences: since depth(M) ≥ 0, we get pd(M) ≤ depth(R) ≤ dim(R), bounding projective dimension by the dimension of the ring. For a regular local ring of dimension d, depth(R) = d, so every finitely generated module has projective dimension at most d. The formula also shows that M is free (pd = 0) if and only if depth(M) = depth(R), a criterion used constantly in practice.

Serre's theorem is the crown jewel of homological commutative algebra: a Noetherian local ring (R, m) is regular if and only if gl.dim(R) < ∞. The forward direction constructs the Koszul complex on a regular system of parameters, giving an explicit free resolution of the residue field k = R/m of length dim(R). The reverse direction is deeper: if gl.dim(R) = d < ∞, then pd(k) = d, and the Auslander-Buchsbaum formula gives depth(R) = d. A careful analysis of Tor groups then shows dim_k(m/m^2) = d, which is the definition of regularity. Before Serre's theorem, it was not known whether the localization of a regular local ring is again regular. Serre's homological characterization made this immediate: localization cannot increase global dimension.

The Hilbert syzygy theorem is the global version for polynomial rings: every finitely generated module over k[x_1, ..., x_n] has a free resolution of length at most n. This is equivalent to saying gl.dim(k[x_1, ..., x_n]) = n. The theorem was originally proved by Hilbert using his basis theorem and explicit construction of syzygies (relations among generators). In modern terms, it follows from the fact that k[x_1, ..., x_n] localized at (x_1, ..., x_n) is a regular local ring of dimension n, combined with the fact that global dimension can be computed locally. The interplay between the Hilbert syzygy theorem, Serre's theorem, and the Auslander-Buchsbaum formula forms the homological backbone of modern commutative algebra, connecting abstract resolution theory to concrete invariants like depth and dimension.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineOpposites and Additive InversesAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsSystems of Equations — Graphing MethodSystems of Equations — Elimination MethodSystems of Three VariablesMatrices IntroductionLinear TransformationsModules over RingsAssociated PrimesRegular Sequences and DepthHomological Dimension

Longest path: 62 steps · 295 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.