An ideal is prime when implies or , equivalently when the quotient is an integral domain.
The prime ideals of with are the zero ideal and the principal ideals generated by nonconstant primitive polynomials that are irreducible in .
To prove the description, invert the nonzero integers to obtain the localization . The extension of an ideal consists of the polynomials with and . Its contraction is : if and , the defining condition puts , so primeness gives . The prime ideal correspondence for localization makes this extension a proper prime ideal of .
If , its extension has a nonzero generator because is a principal ideal domain. Dividing this generator by its rational polynomial content gives an integer-coefficient primitive polynomial generating the same extended ideal. Divisibility descent by Gauss lemma for polynomials then gives in . The proper prime ideal in makes irreducible there. Conversely, any such polynomial generates a prime ideal in whose contraction is and whose intersection with is zero.
The intersection condition is essential: is a maximal ideal of , since its quotient ring is , but it is not principal. A common divisor of and must be a unit, which would generate the whole ring.
Let be a unique factorization domain and let be a prime element. The only prime ideals contained in the principal ideal are and . To prove this, suppose . Then . For , unique factorization allows us to write with . Since is a prime ideal and , repeated primality gives , a contradiction.
In the particular polynomial ring , when is a prime number, the same proof uses only the integer coefficients: factor out the largest common power of from the coefficients of a nonzero polynomial . This gives with directly, without requiring the general unique factorization domain theorem for polynomial rings.
A minimal prime ideal is a prime ideal containing no strictly smaller prime ideal. If is a reduced ring and is minimal, the localization at a prime ideal is a field: its only prime is its maximal ideal, and reducedness makes that ideal its zero nilradical. Every nonzero commutative ring has a minimal prime.
A prime ideal is minimal over an ideal if and no smaller prime ideal contains . The definition also applies to two-sided prime ideals of a noncommutative ring.
Every proper ideal of a unital commutative ring is contained in a minimal prime over that ideal. A maximal ideal supplies a prime containing it, and an intersection of a decreasing chain of primes is still prime. Zorn's lemma, with reverse inclusion, therefore supplies a minimal member. No Noetherian assumption is needed.
In , the ideal has radical of an ideal , a prime ideal, and hence a unique minimal prime ideal. Nevertheless , , and for all , so is not a primary ideal. The same example works after adjoining inverses of and ; thus it also gives an example in a two-variable Laurent polynomial ring.
In a Noetherian ring, an ideal disjoint from a nonempty multiplicative subset extends to an ideal maximal among those disjoint from , by the ascending chain condition. It is proper. If but neither factor belongs to , both and meet . Multiplying such representatives puts an element of in , a contradiction. Thus is a prime ideal. For a general commutative ring the same argument follows after applying the Zorn lemma to disjoint ideals; the union of a chain is disjoint from .
The th symbolic power of a prime ideal is
where the intersection denotes contraction of an ideal. It is always a -primary ideal. The ordinary power equals precisely when is -primary; this assertion does not require to be Noetherian.
For a commutative unital ring , an ideal is prime exactly when is an integral domain. The zero-product condition in the quotient translates directly to .

Ancestors (5)

  1. Commutative algebra
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.