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 moreAssociated 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication 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 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrime and Maximal IdealsIdeal OperationsNoetherian RingsPrimary Decomposition

Longest path: 93 steps · 390 total prerequisite topics

Prerequisites (4)

Leads To (1)