Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Suppose first that every ideal of is finitely generated. For an ascending chain
the union is an ideal. Its finite generating set lies in one , so for all . Thus satisfies the ascending chain condition and is a Noetherian ring.
Conversely, if an ideal is not finitely generated, choose , and after choosing , choose
This creates a strictly ascending chain of ideals, contradicting Noetherianity. Hence every ideal is finitely generated.
If is surjective and , then is an ideal of . If it is generated by , then is generated by . Thus every ideal of is finitely generated, so is Noetherian.
The Hilbert basis theorem states that if is a commutative Noetherian ring, then is Noetherian. To prove it, let . The leading coefficients of polynomials in generate an ideal of ; choose generators that occur as leading coefficients of , and let . For each degree below , the leading coefficients of members of of at most that degree likewise form a finitely generated ideal; choose finitely many corresponding polynomials. Any of degree at least can have its leading term cancelled by a linear combination of monomial multiples of the . Repeating lowers its degree below , where the second finite list completes the reduction. These finitely many selected polynomials generate , proving the theorem.
For every , the ring is Noetherian. If is transcendental, evaluation identifies it with . If is algebraic, it is a quotient of . The integers are Noetherian, the Hilbert basis theorem handles , and quotients preserve Noetherianity.
For a unique factorization domain that is not Noetherian, take
Every polynomial and every factorization uses only finitely many variables, so existence and uniqueness of factorization reduce to a finite-variable polynomial ring, which is a UFD. But
is a strictly ascending chain, so the ring is not Noetherian.
Finally, the ring is not Noetherian. For , let
These are ideals and : the distance function to belongs to but not to . This strict ascending chain proves the claim.
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 9G
  2. Paper 1
  3. Ib
  4. 2021
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home