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

Completion

Research Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal
456prerequisites beneath it
See this on the map →
Local RingsNoetherian Rings+1 more→
completion i-adic-topology hensels-lemma formal-power-series complete-local-ring inverse-limit

Core Idea

The I-adic completion of a ring R with respect to an ideal I is the inverse limit of the quotients R/In, capturing the "formal neighborhood" of V(I). For a local ring (R, m), the m-adic completion R-hat retains the essential algebraic properties of R while gaining powerful analytic-like tools such as Hensel's lemma, which lifts approximate factorizations to exact ones. Completion is the algebraic analogue of passing from polynomials to power series, or from rational numbers to real numbers, and is indispensable in local algebraic geometry and number theory.

Explainer

Completion is the algebraic process of formally adjoining limits of Cauchy sequences with respect to an ideal-adic topology. Given a commutative ring R and an ideal I, the I-adic topology on R has the powers In as a basis of open neighborhoods of 0. The I-adic completion is the inverse limit R-hat = lim R/In, whose elements are coherent sequences (r_1, r_2, r_3, ...) with r_n in R/In and r_n ≡ r_{n+1} mod In. The natural map R → R-hat sends each element to the sequence of its residues, and this map is injective when the intersection of all In is zero (guaranteed by the Krull intersection theorem in the Noetherian local case).

The most important instance is the m-adic completion of a local ring (R, m). The completion R-hat is again a local ring with maximal ideal m-hat (the closure of m) and the same residue field R/m. The completion of k[x]_(x) is the formal power series ring k[[x]]; the completion of Z_(p) is the p-adic integers Z_p. These examples illustrate the general principle: completion replaces "polynomial-like" objects with "power-series-like" objects, gaining convergence properties at the cost of losing finite presentation.

The central payoff of completion is Hensel's lemma, which comes in several versions. The simplest: if f(x) is a polynomial over a complete local ring (R, m) and a in R satisfies f(a) ≡ 0 mod m with f'(a) a unit modulo m, then there exists a unique b in R with f(b) = 0 and b ≡ a mod m. The multiplicative version lifts coprime factorizations from the residue field to the complete ring. Hensel's lemma is the algebraic counterpart of Newton's method -- iterative refinement converges because completeness provides the necessary limits. It is the reason p-adic numbers are so powerful in number theory: factorization questions over Z can be reduced to factorization over the residue field F_p, then lifted to Z_p.

The Cohen structure theorem classifies complete local rings: every complete Noetherian local ring containing a field is isomorphic to a quotient k[[x_1, ..., x_n]]/I of a formal power series ring. This structure theorem has no analogue for non-complete rings and is one of the main reasons algebraic arguments often proceed by "passing to the completion." Completion is faithfully flat over the original ring, which means many properties (regularity, depth, being Cohen-Macaulay) can be checked after completion. This interplay between a ring and its completion -- reducing hard questions to the complete case where Cohen's theorem and Hensel's lemma provide powerful tools -- is a central technique in commutative algebra and algebraic geometry.

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 → Completion

Longest path: 93 steps · 456 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.