Write . Every element of the extension of an ideal is a fraction with and : a finite sum of such fractions has a common denominator and numerator still in the ideal . If , then , so
Conversely, let be a nilpotent element of the localization at a prime ideal . For some , . The vanishing criterion in a module localization supplies with . It follows that
so . Since ,
This proves that the nilradical commutes with localization:
The multiplication by is necessary: the numerator of a nilpotent element in a localization need not itself be nilpotent in .
A ring is reduced if its only nilpotent element is zero. Equivalently,
The second expression says that its nilradical vanishes. A reduced ring may have zero divisors; for example, the direct product of rings is reduced but .
Use the direct product of rings
with coordinatewise addition and multiplication and unit . Define the shift
Coordinatewise operations show that preserves addition, multiplication and the unit, so it is a ring endomorphism. It is surjective because maps to any prescribed . Its kernel of a ring homomorphism is
so it is not injective. This is the noninjective surjective shift on a product of fields.
This ring fails the Noetherian hypothesis in c. Indeed, let have a single in coordinate . The ideals form the strictly ascending chain
since .
For , let , where the power denotes repeated composition of the ring endomorphism. These ideals form an ascending chain:
The ascending chain condition for a Noetherian ring gives for some . Take . Since is surjective, its iterate is surjective, so choose with . Then
so . Therefore .
Thus the kernel of a ring homomorphism is zero. This proves that a surjective endomorphism of a Noetherian ring is an automorphism, and in particular
The image is a unit in the localization at a prime ideal , because . The universal property of localization, applied to the ring homomorphism and the multiplicative subset , gives a unique ring homomorphism fixing the image of :
Fixing the image of is exactly the required compatibility with the algebra over a ring structures. Uniqueness also follows directly: such a ring homomorphism must send to the inverse of , and these elements together with generate .
Put , and . The quotient ring is an integral domain, so is a prime ideal and hence a primary ideal. Put . Then
The polynomial ring is a Noetherian ring by the Hilbert basis theorem, and is a maximal ideal since . Therefore the maximal-primary ideal criterion from c makes -primary. In particular its radical of an ideal is , distinct from .
Neither primary ideal can be omitted: , while . Thus the given intersection is already a minimal primary decomposition. To express the ideal by generators, write an element of as . Reducing modulo the prime ideal gives in the integral domain , so . Cancelling in the integral domain gives . Hence
By the first uniqueness theorem for primary decomposition, the associated primes of a module are exactly the two radicals of ideals. Their strict inclusion gives
One can also see both associated primes of a module directly through annihilators:
For the first colon ideal, reducing modulo forces , and the reverse inclusion follows from . For the second colon ideal, cancel in . Both represented elements of the quotient module are nonzero.
Suppose first that is -primary. Since is a Noetherian ring, choose a finite generating set of an ideal . The equality of radicals of ideals supplies positive integers with . Set
Every product of generators has some appearing at least times. Such products generate the product of ideals , so . Also . If , take directly.
Conversely, suppose . Taking radicals of ideals gives
Hence . The only maximal ideal containing is : any such maximal ideal contains and therefore equals . By the correspondence theorem for ideals, the quotient ring is a local ring with maximal ideal . Every element outside this maximal ideal is a unit.
If and , then cannot be outside , since multiplying by its inverse in the quotient ring would give . Thus and , proving the required primary ideal condition. We have proved the maximal-primary ideal criterion
An ideal is -primary if it is a proper primary ideal whose radical of an ideal is . Explicitly,
Equivalently, and imply : multiplication by every element outside is injective on the quotient ring .
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
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
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 .
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
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.
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.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact