Translated from the popular French edition, this book offers a detailed introduction to various basic concepts, methods, principles, and results of commutative algebra. It takes a constructive viewpoint in commutative algebra and studies algorithmic approaches alongside several abstract classical theories. Indeed, it revisits these traditional topics with a new and simplifying manner, making the subject both accessible and innovative.

The algorithmic aspects of such naturally abstract topics as Galois theory, Dedekind rings, Prüfer rings, finitely generated projective modules, dimension theory of commutative rings, and others in the current treatise, are all analysed in the spirit of the great developers of constructive algebra in the nineteenth century.

This updated and revised edition contains over 350 well-arranged exercises, together with their helpful hints for solution. A basic knowledge of linear algebra, group theory, elementary number theory as well as the fundamentals of ring and module theory is required. Commutative Algebra: Constructive Methods will be useful for graduate students, and also researchers, instructors, and theoretical computer scientists.

Autorentext

Henri Lombardi is a researcher in constructive mathematics, real algebra and algorithmic complexity. Since 2003, with Marie-Françoise Roy and Thierry Coquand, he has developed the international group MAP (Mathematics, Algorithms, Proofs). He has published Epistemologie mathematique, (Ellipse, 2011), and Methodes matricielles. Introduction a la complexite algebrique, (Springer, 2003, in collaboration with Jounaidi Abdeljaoued).

Claude Quitté is a researcher in effective commutative algebra, computer algebra and computer science. He has published Algorithmique algebrique, (Masson, 1991) in collaboration with Patrice Naudin.

Henri Lombardi and Claude Quitté also published together with Maria-Gema Díaz-Toca the book Modules sur les anneaux commutatifs (Calvage & Mounet, 2014).

Inhalt
Examples.- The basic local-global principle and systems of linear equations.- The method of undetermined coefficients.- Finitely presented modules.- Finitely generated projective modules.-Examples.- The basic local-global principle and systems of linear equations.- The method of undetermined coefficients.- Finitely presented modules.- Finitely generated projective modules, 1.- Strictly finite algebras and Galois algebras.- The dynamic method.- Flat modules.- Local rings, or just about.- Finitely generated projective modules, 2.- Distributive lattices, lattice-groups.- Prüfer and Dedekind rings.- Krull dimension.- The number of generators of a module.- The local-global principle.- Extended projective modules.- Suslin's stability theorem.- Annex.- Constructive logic.