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

Regular Sequences and Depth

Research Depth 94 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
460prerequisites beneath it
See this on the map →
Associated PrimesLocal Rings+2 more→→Homological Dimension
regular-sequence depth cohen-macaulay grade koszul-complex auslander-buchsbaum

Core Idea

A regular sequence on a module M is an ordered sequence of elements (f_1, ..., f_r) where each f_i is a non-zero-divisor on M/(f_1, ..., f_{i-1})M. The depth of M (with respect to an ideal I) is the length of a maximal regular sequence in I on M. A Noetherian local ring is Cohen-Macaulay if its depth equals its Krull dimension -- the maximum possible value. Cohen-Macaulay rings are the class where dimension theory, homological algebra, and intersection theory work optimally, forming the "good" class between arbitrary Noetherian rings and regular local rings.

Explainer

A regular sequence on an R-module M is a sequence of elements f_1, ..., f_r in R such that: (1) f_1 is a non-zero-divisor on M, (2) f_2 is a non-zero-divisor on M/f_1 M, and in general (3) f_i is a non-zero-divisor on M/(f_1, ..., f_{i-1})M, and (4) M/(f_1, ..., f_r)M is nonzero. The order matters: (x, y(1-x)) is regular in k[x, y] but (y(1-x), x) is not, because in the latter case the image of x in k[x,y]/(y(1-x)) is a zero divisor. In a local ring, however, any permutation of a regular sequence is again regular -- this is a non-trivial fact proved using the Koszul complex.

The depth of M with respect to an ideal I, denoted depth_I(M), is the length of a maximal regular sequence in I on M. By the Rees theorem, all maximal regular sequences in I on M have the same length, so depth is well-defined. In a Noetherian local ring (R, m), the depth of R (taken with respect to m) satisfies the fundamental inequality depth(R) ≤ dim(R). When equality holds, R is called Cohen-Macaulay. The depth can also be computed homologically: depth_I(M) = min{i : Exti_R(R/I, M) ≠ 0}, connecting regular sequences to the derived category.

Cohen-Macaulay rings form the largest natural class of Noetherian rings where the theories of dimension, primary decomposition, and intersection theory work "as expected." In a Cohen-Macaulay local ring, every system of parameters is a regular sequence, there are no embedded associated primes of parameter ideals, and the unmixedness theorem holds: every ideal generated by a regular sequence of length r has all associated primes of height exactly r. This geometric property -- that hypersurface sections cut out varieties of the expected codimension with no spurious embedded components -- is what makes Cohen-Macaulay rings essential in algebraic geometry.

The relationship between regular sequences and homological algebra runs deep. The Auslander-Buchsbaum formula states that for a finitely generated module M of finite projective dimension over a Noetherian local ring R: pd(M) + depth(M) = depth(R). This connects depth (defined via regular sequences) to projective dimension (a homological invariant). For regular local rings, every finitely generated module has finite projective dimension, and the formula gives a complete numerical relationship between the two fundamental measures of "complexity." The Koszul complex K(f_1, ..., f_r; R) provides the explicit homological machinery: its homology detects whether (f_1, ..., f_r) is a regular sequence, and it is the starting point for computing Tor and Ext groups in many situations.

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 → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Prime and Maximal Ideals → Ideal Operations → Noetherian Rings → Chain Conditions and Artinian Rings → Krull Dimension → Regular Sequences and Depth

Longest path: 95 steps · 460 total prerequisite topics

Prerequisites (4)

Leads To (1)