IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-81-322-1599-8_7.html
   My bibliography  Save this book chapter

Rings with Chain Conditions

In: Basic Modern Algebra with Applications

Author

Listed:
  • Mahima Ranjan Adhikari

    (Institute for Mathematics, Bioinformatics, Information Technology and Computer Science (IMBIC))

  • Avishek Adhikari

    (University of Calcutta, Department of Pure Mathematics)

Abstract

Chapter 7 continues to develop the theory of rings and studies chain conditions for ideals of a ring. The motivation came from an interesting property of the ring of integers Z that its every ascending chain of ideals terminates. This interesting property of Z was first recognized by the German mathematician Emmy Noether (1882–1935). This property leads to the concept of Noetherian rings. On the other hand, Emil Artin (1898–1962) showed that there are some rings in which every infinite descending chain of ideals terminates. Such rings are called Artinian rings. The ring Z has an infinite descending chain of ideals. This property of Z shows that Z is not an Artinian ring. In this chapter special classes of rings are also studied and deeper results on ideal theory are proved. Some finiteness condition for ideals is imposed and Noetherian rings are introduced which are versatile. The most convenient equivalent formulation of the Noetherian requirement is that the ideals of the ring satisfy the ascending chain condition. A connection between a Noetherian domain and a factorization domain is established. Moreover, the Hilbert Basis Theorem is proved. This theorem has made a revolution and has given an extensive class of Noetherian rings. Its application to algebraic geometry is also discussed. The study in this chapter culminates in rings with a descending chain condition for ideals, which determines their ideal structure.

Suggested Citation

  • Mahima Ranjan Adhikari & Avishek Adhikari, 2014. "Rings with Chain Conditions," Springer Books, in: Basic Modern Algebra with Applications, edition 127, chapter 0, pages 257-271, Springer.
  • Handle: RePEc:spr:sprchp:978-81-322-1599-8_7
    DOI: 10.1007/978-81-322-1599-8_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-81-322-1599-8_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.