Primary Decomposition - Core Definitions
Primary decomposition generalizes unique prime factorization to ideals, providing a geometric decomposition into irreducible components.
An ideal is primary if whenever and , we have for some .
Equivalently, is primary if has the property that every zero divisor is nilpotent. Prime ideals are primary, but not conversely.
- is primary but not prime, since but , yet
- is primary for any prime and
- In , the ideal is not primary: but and no power of equals zero
- is primary with radical
If is primary, its radical is always a prime ideal, called the associated prime of .
We say is -primary if . This establishes a connection between primary ideals and prime ideals.
An ideal has a primary decomposition if: where each is primary. The decomposition is minimal or irredundant if:
- No is redundant (removing any changes the intersection)
- The radicals are all distinct
For , the ideal is a primary decomposition, since each is primary with associated prime .
This algebraically encodes the fundamental theorem of arithmetic.
Primary decomposition generalizes to modules: a submodule is primary if every zero divisor on is nilpotent. The theory parallels that for ideals, though with added complexity.
For an ideal with primary decomposition , the associated primes are where .
The set of associated primes is independent of the choice of minimal primary decomposition, forming an intrinsic invariant of .
Geometrically, primary decomposition corresponds to decomposing an algebraic variety into irreducible components with multiplicities. The associated primes correspond to the irreducible components, while the primary ideals encode both components and multiplicities.
Primary decomposition provides an algebraic analogue of factorization, expressing ideals as intersections of "prime power" components.