← Graph View All Domains
Mathematics β€Ί Commutative Algebra

Nakayama's Lemma

Research Depth 59 in the knowledge graph ☐ I know this ☆ Set as goal
nakayama local-ring minimal-generators finitely-generated

Core Idea

Nakayama's lemma states that if M is a finitely generated module over a local ring (R, π”ͺ) and π”ͺM = M, then M = 0. Equivalently, elements of M that generate M/π”ͺM (a vector space over the residue field) lift to generators of M itself. This seemingly simple result is one of the most frequently used tools in commutative algebra, enabling the "linear algebra over the residue field controls the module" principle.

Explainer

Nakayama's lemma is perhaps the most used single result in commutative algebra. In its simplest form, it says: if (R, π”ͺ) is a local ring and M is a finitely generated R-module with π”ͺM = M, then M = 0. The hypothesis π”ͺM = M says "multiplying M by the maximal ideal recovers all of M," and the conclusion is the surprisingly strong statement that M must be trivial. The proof is a slick induction: write the last generator as an π”ͺ-linear combination of all generators, use the fact that 1 - a is a unit when a ∈ π”ͺ, and eliminate one generator, contradicting minimality.

The more useful form is the generator-lifting corollary. Let k = R/π”ͺ be the residue field. For any finitely generated R-module M, the quotient M/π”ͺM is a finite-dimensional k-vector space (since π”ͺ acts as zero). Nakayama's lemma implies that elements of M that map to a basis of M/π”ͺM generate M over R, and the minimal number of generators of M equals dim_k(M/π”ͺM). This is extraordinarily useful: to find generators of an R-module, you reduce to the residue field (a much simpler object), find a basis there, and lift. The number of generators is controlled by a dimension computation over a field.

The finite generation hypothesis is not a technicality β€” it is essential. The β„š-module over β„€β‚β‚šβ‚Ž satisfies π”ͺβ„š = pβ„š = β„š (every rational number is p times another rational number) but β„š is very far from zero. The issue is that β„š requires infinitely many generators over β„€β‚β‚šβ‚Ž. In practice, the finite generation hypothesis is almost always available because the modules studied in commutative algebra are typically finitely generated over Noetherian rings.

Nakayama's lemma has far-reaching consequences. It implies that finitely generated projective modules over local rings are free β€” a major simplification that reduces projectivity questions to the local case. It is the key ingredient in the proof that regular local rings have finite global dimension. It underlies the Krull intersection theorem (βˆ©β‚™ π”ͺⁿ = 0 in a Noetherian local domain). And it is used constantly in algebraic geometry: the dimension of the fiber of a coherent sheaf at a point equals dim_k(M/π”ͺM), which by Nakayama controls the local structure of the sheaf.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10 β†’ Counting to 20 β†’ Understanding Zero β†’ The Number Zero β†’ Counting to Five β†’ One-to-One Correspondence β†’ Combining Small Groups Within 5 β†’ Addition Within 10 β†’ Addition Within 20 β†’ Two-Digit Addition Without Regrouping β†’ Two-Digit Addition with Regrouping β†’ Addition Within 100 β†’ Repeated Addition as Multiplication β†’ 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 β†’ Two-Digit by One-Digit Division β†’ Division with Remainders β†’ Remainders and Quotients in Division β†’ 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 β†’ Opposites and Additive Inverses β†’ Absolute Value β†’ Adding Integers β†’ Subtracting Integers β†’ Multiplying Integers β†’ Dividing Integers β†’ Unit Rates β†’ Proportions β†’ Percent Concept β†’ Converting Between Fractions, Decimals, and Percents β†’ Operations with Rational Numbers β†’ Two-Step Equations β†’ Solving Multi-Step Equations β†’ Equations with Variables on Both Sides β†’ Literal Equations β†’ Slope-Intercept Form β†’ Point-Slope Form β†’ Writing Linear Equations β†’ Parallel and Perpendicular Line Slopes β†’ Graphing Linear Equations β†’ Systems of Equations β€” Graphing Method β†’ Systems of Equations β€” Elimination Method β†’ Systems of Three Variables β†’ Matrices Introduction β†’ Linear Transformations β†’ Modules over Rings β†’ Nakayama's Lemma

Longest path: 60 steps · 288 total prerequisite topics

Prerequisites (2)

Modules over Ringshard Local Ringshard

Leads To (0)

No topics depend on this one yet.