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

Primary Decomposition

Research Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
390prerequisites beneath it
See this on the map →
Maximal and Prime IdealsNoetherian Rings+2 more→→Associated Primes
primary-ideal primary-decomposition lasker-noether irredundant

Core Idea

A primary ideal Q in a ring R is one where ab ∈ Q implies a ∈ Q or bⁿ ∈ Q for some n — the radical √Q is prime, and Q is "concentrated" at √Q. The Lasker-Noether theorem states that in a Noetherian ring, every ideal decomposes as a finite intersection of primary ideals. This is the algebraic generalization of unique prime factorization of integers to ideals in higher-dimensional rings.

Explainer

Unique factorization of integers — 12 = 2² × 3 — is really a statement about ideals: (12) = (4) ∩ (3), where (4) is (2)-primary and (3) is (3)-primary. Primary decomposition generalizes this to ideals in any Noetherian ring. An ideal Q is primary if ab ∈ Q implies a ∈ Q or bⁿ ∈ Q for some positive integer n. The radical √Q (the set of elements with some power in Q) is always a prime ideal P, and we say Q is P-primary. Informally, a primary ideal is "concentrated at a single prime" — its deviation from being prime is controlled, consisting only of nilpotent elements in R/Q.

The Lasker-Noether theorem asserts that in a Noetherian ring, every ideal I can be written as a finite intersection I = Q₁ ∩ ··· ∩ Qₙ of primary ideals. The decomposition is called irredundant if no Qᵢ can be removed without changing the intersection. In an irredundant decomposition, the prime ideals Pᵢ = √Qᵢ are called the associated primes of I. The first uniqueness theorem says the set {P₁, ..., Pₙ} is uniquely determined by I (independent of the decomposition). The second uniqueness theorem says that Qᵢ is uniquely determined when Pᵢ is a minimal associated prime.

The distinction between minimal and embedded associated primes is geometrically significant. Consider the ideal I = (x², xy) in k[x,y]. Its primary decomposition is (x) ∩ (x², y) = (x) ∩ (x², xy, yn) for any n ≥ 1 — the (x,y)-primary component is not unique. The minimal prime (x) corresponds to the line x = 0; the embedded prime (x,y) corresponds to the origin, which is a "special point" on that line where extra vanishing occurs. Embedded primes detect subtle geometric features — thickened points, non-reduced structure, singularities.

Primary decomposition connects to many other parts of commutative algebra. The associated primes of an ideal determine where localization is trivial versus non-trivial. The Noetherian hypothesis is essential — non-Noetherian rings can have ideals without primary decomposition. The theory extends to modules (primary decomposition of submodules), which is the framework needed for the deeper theory of associated primes and support of modules.

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 → Primary Decomposition

Longest path: 93 steps · 390 total prerequisite topics

Prerequisites (4)

Leads To (1)