1 Primary ideals and their radicals

1.1 Definitions: primary and prime ideals

Let \(R\) be a commutative ring with \(1\), and let \(I\subseteq R\) be an ideal. The ideal \(I\) is primary if \(I\neq R\) and whenever \(ab\in I\), then either \(a\in I\) or \(b^n\in I\) for some \(n\ge 1\).

An ideal \(P\subseteq R\) is prime if \(P\neq R\) and \(ab\in P\) implies \(a\in P\) or \(b\in P\).

Every prime ideal is primary: if \(ab\in P\) and \(a\notin P\), then \(b\in P\), hence \(b^n\in P\) for all \(n\). In contrast, primary ideals allow “power containment” for the second factor rather than strict membership.

1.2 Examples illustrating primary behavior

A standard source of primary ideals comes from powers of prime ideals. If \(P\) is prime, then \(P^n\) is \(P\)-primary for every \(n\ge 1\). Intuitively, membership in \(P^n\) behaves like requiring a certain level of “divisibility” by elements of the prime locus.

Another basic example occurs in a principal ideal domain \(R\). In such rings, nonzero ideals generated by prime powers are primary, because their ideal quotient structure reflects the exponent behavior: divisibility by a power is forced, but only up to exponent.

In more general rings, primary ideals can be subtler: the condition depends on how zero divisors and nilpotent effects behave inside \(R/I\), rather than purely on generators.

1.3 Equivalent characterizations (colon ideals, zero-divisors)

Let \(Q\) be an ideal. Write \(\operatorname{rad}(Q)\) for its radical. A central equivalence is that \(Q\) is primary with associated prime \(\operatorname{rad}(Q)\) precisely when the set of zero divisors of \(R/Q\) forms the radical. Concretely: \[ Q \text{ is primary } \Longleftrightarrow \text{ the set of } r+Q \in R/Q \text{ that are zero divisors is a prime ideal.} \] Equivalently, the colon ideals encode the same phenomenon. For \(a\notin Q\), the set \((Q:a)=\{\,r\in R: ra\in Q\,\}\) behaves in a controlled way for primary \(Q\): if \(a\notin Q\), then \((Q:a)\) is “large” in the sense that it forces powers into \(Q\). These colon conditions are used heavily when constructing or verifying primary components.

1.4 Radicals: relationship between primary ideals and primes

For a primary ideal \(Q\), its radical \(\sqrt{Q}\) is prime. This prime is often called the associated prime (or radical of \(Q\)) and it governs where the primary component “lives” geometrically and algebraically.

In particular, \(\sqrt{Q}\) captures all elements \(r\in R\) such that \(r^n\in Q\) for some \(n\). Passing from \(Q\) to \(\sqrt{Q}\) removes nilpotent thickness while retaining the prime skeleton. This is a key mechanism behind uniqueness statements in primary decomposition theory.

2 Primary decomposition of ideals

2.1 Statement of the primary decomposition theorem

A typical primary decomposition theorem asserts that under suitable hypotheses on \(R\) (most commonly \(R\) Noetherian), every ideal \(I\) can be written as an intersection of finitely many primary ideals: \[ I = Q_1 \cap \cdots \cap Q_t, \] where each \(Q_i\) is primary and the radicals \(\sqrt{Q_i}\) are prime ideals.

This representation refines the structure of \(R/I\) by breaking it into components associated with primes, while allowing each component to carry nilpotent information through the primary condition.

2.2 Decomposition as intersections of primary ideals

The theorem uses intersections rather than sums because primary components naturally correspond to “simultaneous” vanishing conditions. Intersections reflect imposing multiple conditions at once, with each primary ideal governing behavior near a prime in the sense of radicals.

While one might expect direct-sum or product decompositions, the primary ideal framework is designed for the way algebraic relations propagate through radicals and colon behavior. The intersection structure aligns with how varieties and prime spectra combine through vanishing ideals.

2.3 When decompositions exist (Noetherian hypotheses)

Primary decomposition is guaranteed in a wide and important class of rings: Noetherian rings. The Noetherian condition ensures finiteness properties that prevent infinite strictly descending chains of ideals and make inductive constructions terminate.

Without Noetherian assumptions, ideals may fail to have a finite primary decomposition, or decompositions may be more complicated to manage. In practice, primary decomposition is most often applied in Noetherian settings such as polynomial rings over fields or more general finitely generated algebras.

2.4 Independence phenomena (associated primes vs. non-unique components)

Even though the primary ideals \(Q_i\) in a decomposition might vary, certain data are stable. One fundamental invariant is the set of associated primes of \(R/I\). Closely related are the embedded primes (when present), which indicate components of higher codimension or “thicker” nilpotent behavior.

The individual primary components can be non-unique; however, their radicals and their placement with respect to inclusion are governed by rigid algebraic constraints. This stability is formalized in later sections via uniqueness up to redundancy and repetition.

3 From modules to primary decomposition

3.1 Primary decomposition for submodules

Primary decomposition extends naturally from ideals to submodules. If \(M\) is a finitely generated module over a Noetherian ring and \(N\subseteq M\) is a submodule, one can often decompose \(N\) as an intersection of submodules \(Q_i\) that are primary in a module-theoretic sense.

In this setting, one views \(M/N\) as the main object: a “primary component” corresponds to a submodule whose quotient has behavior controlled by a single prime. This generalization is essential because many problems in algebra reduce to analyzing quotients and submodules.

3.2 Associated primes of modules

For a finitely generated module \(M\), an associated prime of \(M\) is a prime ideal that occurs as an annihilator of an element of \(M\). Equivalently, a prime \(P\) is associated if there exists \(m\in M\) such that \(\operatorname{Ann}(m)=P\).

Associated primes track where elements of the module behave like “torsion supported at \(P\).” They also control which primes can appear as radicals of primary components in a decomposition of \(0\subseteq M\) or \(N\subseteq M\).

3.3 Torsion elements and how primary components reflect them

Given a module \(M\), elements can be torsion with respect to primes: an element may be annihilated by some prime power. Primary components reflect these annihilation patterns. If \(M\) has elements whose annihilators are contained in a given prime, then the decomposition must include primary parts supported at that prime.

Thus, primary decomposition acts as a bookkeeping device: each primary component isolates contributions from elements with a common radical annihilator, allowing nilpotent phenomena to remain localized instead of spreading across primes.

3.4 Connections to annihilators and radicals

Annihilators and radicals are tightly linked. For a submodule \(N\subseteq M\), the annihilator \(\operatorname{Ann}(M/N)\) relates to which primes can occur in the decomposition. Moreover, moving from a primary submodule to its associated prime corresponds to passing to the radical in the ideal case.

This relationship provides the algebraic bridge between:

  • the internal torsion structure of modules (annihilators of elements),
  • the prime-level support (associated primes),
  • and the “nilpotent thickness” (primary vs. radical behavior).

4 Computing primary components

4.1 Strategies using colon ideals

Colon ideals \((I:f)\) are one of the main tools for extracting primary information. For an ideal \(I\) and element \(f\), the colon ideal collects all elements that send \(f\) into \(I\). In primary decomposition computations, colon ideals help isolate components corresponding to different primes by studying how membership changes when multiplying by carefully chosen elements.

A common approach is to use colon ideals to peel off parts supported on a particular prime, then iterate. The primary property ensures that once the correct prime is targeted, colon behavior becomes predictable: elements outside the relevant primary ideal force power containment into it.

4.2 Dealing with saturation and localization

Saturation refines an ideal by removing embedded or lower-dimensional noise relative to a chosen multiplicative set. Given an element \(f\), the saturation of \(I\) with respect to \(f\) can be expressed in terms of repeated colon ideals and captures what remains after forcing invertibility of \(f\).

Localization formalizes the same idea more conceptually: localize \(R\) at a prime \(P\) (or at a multiplicative set) to focus on behavior near \(P\). Primary decomposition computations often use this to reduce global problems to local ones, where primary components supported at primes different from \(P\) disappear or simplify.

4.3 Decomposition via Gröbner bases (overview-level)

In polynomial rings over fields, Gröbner basis techniques provide a systematic way to compute decompositions. While Gröbner bases do not directly output a primary decomposition in one step in all cases, they can be used to compute radicals, saturations, elimination ideals, and related invariants that feed into decomposition algorithms.

The overarching strategy typically combines:

  1. computing algebraic data (such as radicals or relevant ideals),
  2. using saturation/localization steps to separate prime-supported pieces,
  3. reconstructing primary components consistent with the computed invariants.

Because computational Gröbner methods can be expensive, algorithm design focuses on choosing elimination orders and intermediate computations that keep degrees and intermediate ideals manageable.

4.4 Algorithmic considerations and common pitfalls

Several practical issues arise in computation:

  • Non-uniqueness of components: algorithms may produce redundant primary ideals or different representatives unless normalized using inclusion or minimality criteria.
  • Embedded components: these require careful saturation/localization choices; ignoring them can yield incomplete decompositions.
  • Degree and complexity blow-up: especially in Gröbner-based methods, intermediate computations can grow quickly.
  • Verification: computed components should be checked by recombining them via intersection and confirming equality with the target ideal, along with checking primariness conditions (often indirectly through radicals and zero-divisor tests).

Well-designed workflows therefore interleave computation with invariant checks to ensure correctness.

5 Uniqueness and associated primes

5.1 Minimal vs. redundant primary components

A decomposition may contain redundant primary ideals that do not contribute essentially to the intersection. The notion of minimality typically refers to removing components that are unnecessary because they contain others in the decomposition chain.

In standard treatments, one distinguishes decompositions where no component can be omitted without changing the intersection from decompositions containing redundant parts. Minimal primary decompositions correspond more closely to the intrinsic prime structure.

5.2 Uniqueness up to inclusion and repetition

Although primary components themselves may not be uniquely determined, the decomposition is unique in a controlled sense. If one restricts attention to minimal primary components, the set of associated primes is determined, and each prime corresponds to a primary component that is unique up to repetition and inclusion constraints.

In particular, different decompositions must align on:

  • which primes occur as radicals,
  • how many times a given prime-supported component appears (with possible repetition when components are not reduced to a minimal form).

5.3 Embedded primes and their meaning

Associated primes come in two types: those that are minimal over the annihilator (or over \(I\) in the ideal case) and those that are embedded primes, appearing as associated primes but not minimal.

Embedded primes capture subtler structure: they correspond to components that are not detected merely by the reduced variety/prime spectrum. Their presence indicates torsion behavior and can reflect failure of unmixedness.

In primary decomposition terms, embedded primes correspond to primary components whose radicals strictly contain minimal primes, adding nilpotent or torsion layers supported on deeper strata.

5.4 Extracting invariants from a decomposition

From a primary decomposition one can compute invariants such as:

  • \(\sqrt{I}\), obtained by intersecting radicals of the primary components (equivalently, intersecting the associated prime ideals),
  • the set of associated primes and which are embedded,
  • depth-related information and various homological signatures (often indirectly through module invariants).

These invariants are useful because they do not depend on the chosen decomposition once normalized appropriately.

6 Geometric interpretation (algebraic viewpoint)

6.1 Correspondence between primes and irreducible pieces

In algebraic geometry, prime ideals correspond to irreducible closed subsets of \(\operatorname{Spec}(R)\). In this dictionary, the radical \(\sqrt{Q}\) of a primary component identifies the underlying prime “piece” where the component concentrates.

Thus, the decomposition \[ I = \bigcap Q_i \] can be read as: the object defined by \(I\) is built from layers associated with prime ideals \(\sqrt{Q_i}\), which represent irreducible components at the reduced level.

6.2 Primary components and nilpotent structure

Primary components encode more than reduced geometry. Because \(Q_i\) is primary rather than prime, it retains nilpotent information: functions vanishing to higher order along the associated prime are represented by the primary ideal’s failure to be radical.

Geometrically, this corresponds to embedded thickness or multiple-order vanishing along an irreducible component, rather than just set-theoretic presence.

6.3 Intersections of varieties vs. scheme-like structure

The intersection of varieties corresponds to intersection of radical ideals. Primary decomposition refines this by replacing a radical intersection with an intersection of primary ideals, which is sensitive to scheme-theoretic structure.

Consequently, two different ideals with the same radical define the same reduced set but can differ in multiplicity and infinitesimal structure. Primary decomposition is one systematic route to understanding those differences.

6.4 How radicals simplify geometric intuition

Taking radicals collapses nilpotent structure and returns the prime backbone. In many geometric questions, one first studies \(\sqrt{I}\) to identify underlying components, then uses primary components to address multiplicities, embedded phenomena, and local thickness.

This two-stage perspective—radical first, primary refinement second—matches how both algebraic and geometric intuition often proceed.

7 Applications in algebra and geometry-adjacent settings

Primary decomposition supports conceptual links to dimension theory and depth. Since associated primes reflect where torsion concentrates, they influence depth and the behavior of regular sequences. In many settings, the distribution of associated primes provides a combinatorial-homological shadow of the module’s structure.

7.2 Detecting embedded components

By revealing embedded primes, primary decomposition can detect components that are not visible in the reduced or equidimensional picture. Such embedded parts are often responsible for unexpected solutions, extra multiplicities, or failure of naive counting arguments.

7.3 Structure theorems for quotient rings

Quotient rings \(R/I\) inherit their structure from how \(I\) decomposes. Primary components correspond to primary quotients, and their radicals control the prime spectrum of the quotient. Many structural statements about \(R/I\) can be proved by reducing to the case of primary quotients and then assembling results through intersections.

7.4 Implications for solving polynomial systems (high-level)

At a high level, polynomial systems can exhibit multiple roots, multiplicity along components, and extraneous solutions created by degeneracies. Primary decomposition organizes these features by separating components according to prime support and keeping track of nilpotent thickness.

Thus, in algebraic computation and reasoning, primary decomposition helps distinguish “where solutions live” from “how solutions behave there,” especially when polynomial equations define non-reduced schemes.