A commutative ring is a Noetherian ring if every ideal has a finite generating set of an ideal. Equivalently, it satisfies the ascending chain condition on ideals. Indeed, the union of an ascending chain is an ideal, and finitely many generators all belong to one term, after which the chain stabilizes. Conversely, an ideal without a finite generating set of an ideal would allow us to choose successively , producing a strictly ascending chain of ideals.
Let be a surjective ring homomorphism, where is a Noetherian ring. For any ideal of , its inverse image is an ideal of , say . Taking images gives
Thus homomorphic images of Noetherian rings are Noetherian. This also applies to the image of an arbitrary ring homomorphism, by taking its image as the codomain.
The Hilbert basis theorem states that if is a Noetherian ring, then the polynomial ring is a Noetherian ring. Repeating this gives the result for finitely many variables.
To prove it, fix an ideal . For , define the coefficient ideals of a polynomial ideal
Here the zero polynomial is allowed. Each is an ideal: addition and multiplication by constants preserve the required degree bound. Multiplying a representing polynomial by gives . The ascending chain condition therefore supplies such that for every .
For each , choose a finite generating set of an ideal for , omitting zero generators, and choose of polynomial degree with leading coefficient . If , choose no such polynomials. We claim that the finitely many generate .
Take a nonzero of polynomial degree . Put . Its leading coefficient belongs to , so write it as . The polynomial
belongs to and is either zero or has polynomial degree strictly below . Induction on polynomial degree now expresses as a combination of the chosen ; when , the displayed difference is zero. Hence is finitely generated. Since was arbitrary, is a Noetherian ring.
For , let be the indicator function of . In the ring of functions , multiplication is pointwise, so
Suppose first that is finite, and let be an ideal of . Define . If , choose such an ; multiplying it by shows that . Every satisfies
where the real scalars are constant functions. Thus has a finite generating set of an ideal, so is a Noetherian ring. If is empty, is the zero ring, and the conclusion still holds.
If is infinite, consider the ideal
It is an ideal because a sum has support contained in the union of the two supports, and multiplication by any function cannot enlarge support. If generated , their supports would have a finite union . Every element of would vanish outside , whereas for any . This contradiction proves
No. Write in the quotient ring . Its defining relations are
Consequently , using the permitted assumption, while . Thus every is a nonzero nilpotent element.
The principal ideals satisfy
Every inclusion is strict. Otherwise for some , and hence
The fact that one minus a nilpotent element is a unit applies: if , then . Here is nilpotent, so multiplication by this inverse would give , a contradiction. The strictly ascending chain of ideals violates the ascending chain condition. Therefore
The radical of an ideal is
We first establish the properties needed below. If , every term of the binomial theorem expansion of contains either or , so . Also and . Thus is an ideal. The definition gives and shows that implies . Finally, if , then for some , so . Hence ; in other words, is a radical ideal.
We prove the stronger fact that the radical of an ideal is the intersection of the prime ideals containing it:
If and is a prime ideal, then for some , and repeated application of the definition of a prime ideal gives . This proves one inclusion.
Conversely, fix . The multiplicatively closed set is disjoint from . Consider the ideals containing and disjoint from . This collection is nonempty, and the union of any chain in it is another such ideal. By Zorn's lemma, there is a maximal member . It is proper because .
To prove that is a prime ideal, suppose but . Maximality forces both and to meet . Thus, for some ,
Multiplication gives , since every term lies in , including . This contradicts disjointness from . Therefore is a prime ideal containing and avoiding . This proves the other inclusion, including the required prime ideal avoiding a multiplicative subset argument without using any unproved facts about the nilradical.
If , the displayed intersection represents as required. Conversely, an intersection of ideals that are all prime ideals is a radical ideal: if belongs to every one of them, then so does . Consequently
The unit ideal is included by interpreting the empty intersection as .
If , write with and . Choose such that and . In the binomial theorem expansion
each term has either at least factors , or at least factors . Hence every term belongs to the sum of ideals , and
Thus comaximal ideals can be recognized from their radicals of ideals.
For the general identity, gives
On the other hand, implies . Since the latter is an ideal, . Taking radicals of ideals and using the idempotence proved in a yields
Therefore the radical of a sum of ideals satisfies
Fix and suppose, for a contradiction, that . Set . Since is a Noetherian ring, this ideal is a finitely generated module, say . It is nonzero: if , then because is an integral domain.
The equality allows us to write
Let and . Then . The adjugate matrix identity implies that annihilates every . In the determinant expansion of , the constant term is and every other term contains an entry of , so
This is the determinant trick. Since some , multiplicative cancellation in an integral domain gives . But then , contradicting . We have proved the strict descent of powers of a nonzero proper ideal in a Noetherian domain:
All these powers of an ideal have the same radical of an ideal. Indeed, gives . Conversely, if , then , so . Thus
and gives infinitely many distinct ideals with the prescribed radical of an ideal. If the convention is used, the additional inequality follows immediately from properness.
No. A domain with a nonzero idempotent maximal ideal is a counterexample. Consider
This can be realized concretely as a ring of functions on : its elements are finite sums of rational multiples of nonnegative dyadic rational powers of . Each stage is a polynomial ring, because a nonzero polynomial cannot vanish for all . Any two elements lie in one stage, which is an integral domain, so their product is nonzero if both are nonzero. Thus is an integral domain.
The constant term defines a surjective ring homomorphism . It is well defined because replacing by preserves the constant term. Its kernel of a ring homomorphism
is a maximal ideal, since is a field, by the maximal ideal quotient criterion. Also is nonzero.
If , choose a stage in which for a polynomial . Then
Both factors belong to , so . The reverse inclusion holds for every ideal, proving that is an idempotent ideal. Hence
The Noetherian ring hypothesis in c is therefore essential even for a maximal ideal.
The Krull dimension of a commutative ring is
The length of a prime chain counts strict inclusions, rather than the number of prime ideals.
Let be a principal ideal domain that is not a field. We first show that every nonzero prime ideal is a maximal ideal. Write such a prime ideal as with , and suppose . Then for some . Since , either , in which case , or . In the second case for some , and gives by multiplicative cancellation in an integral domain. Thus . This proves maximality.
Since is an integral domain, is a prime ideal, and every other prime ideal is maximal. Consequently every prime chain has length at most one. For the opposite inequality, choose a nonzero nonunit , which exists because is not a field. The proper principal ideal is contained in a maximal ideal ; existence follows from Zorn's lemma applied to the proper ideals containing . A maximal ideal is a prime ideal, since its quotient ring is a field. Therefore is a prime chain of length one. Thus the Krull dimension of a principal ideal domain that is not a field is
Let be a prime ideal of disjoint from the multiplicatively closed set . In the localization , its extension of an ideal is
Indeed, finite sums of such fractions have a common denominator in and numerator in , and every generator has this form.
We show that its contraction of an ideal recovers :
One inclusion is immediate. Conversely, if with and , equality of fractions in the field of fractions of the integral domain gives . Since and is a prime ideal, .
If , contracting would therefore give , contrary to the hypothesis. Hence
We will also need the fact that is a prime ideal, part of the prime ideal correspondence for localization. It is proper by the contraction identity, since otherwise . If , multiplication by the denominator gives , and contraction gives . Thus or , so one of the two fractions belongs to .
Suppose, for a contradiction, that . Then too. Both prime ideals are disjoint from the multiplicatively closed set . The localization is
each fraction on the left has rational coefficients, and every polynomial with rational coefficients has a common nonzero integer denominator.
By b, the extended prime ideals form a strict inclusion
The first is nonzero, because contains a nonzero polynomial and the map is injective.
The polynomial ring is a principal ideal domain: in any nonzero ideal, a nonzero polynomial of least polynomial degree generates the ideal, since the polynomial division algorithm gives a remainder of smaller polynomial degree, which must be zero. By a, every nonzero prime ideal of this principal ideal domain is maximal. The strict inclusion of extended prime ideals is therefore impossible. We obtain
For any prime number , there is a prime chain
in . These are prime ideals because the respective quotient rings are , , and , all integral domains. The inclusions are strict because and . Hence .
To prove the upper bound, suppose there were a prime chain of length at least three. Since is an integral domain, we could insert at its beginning if necessary and select a chain
By c, . This intersection is a proper prime ideal of : if a product of integers lies in it, primality of puts one factor in it. Therefore for a prime number , and .
We need to check that . Here prime ideals below a principal prime give the necessary restriction: no nonzero prime ideal can lie strictly below . If , then . Choose and factor out the largest common power of from its integer coefficients:
Such a finite exists because has at least one nonzero integer coefficient. Since and is a prime ideal, repeated primality gives , a contradiction. Applied to , this rules out .
It follows that is a nonzero prime ideal of
As in c, the polynomial division algorithm makes a principal ideal domain, so its nonzero prime ideals are maximal by a. Thus is maximal. The ideal correspondence theorem makes a maximal ideal of , contradicting . Consequently

Articles by others on the same topic (0)

There are currently no matching articles.