Advertisement

© 2015

Commutative Algebra: Constructive Methods

Finite Projective Modules

Benefits

  • Brings a fresh approach to traditional theories such as Galois theory and the Dedekind rings

  • Provides a systematic constructive approach to various basic concepts of commutative algebra

  • Written in a lively and engaging style

Book

Part of the Algebra and Applications book series (AA, volume 20)

Table of contents

  1. Front Matter
    Pages i-xlix
  2. Henri Lombardi, Claude Quitté
    Pages 1-14
  3. Henri Lombardi, Claude Quitté
    Pages 15-75
  4. Henri Lombardi, Claude Quitté
    Pages 77-172
  5. Henri Lombardi, Claude Quitté
    Pages 173-238
  6. Henri Lombardi, Claude Quitté
    Pages 239-293
  7. Henri Lombardi, Claude Quitté
    Pages 295-377
  8. Henri Lombardi, Claude Quitté
    Pages 379-434
  9. Henri Lombardi, Claude Quitté
    Pages 435-475
  10. Henri Lombardi, Claude Quitté
    Pages 477-522
  11. Henri Lombardi, Claude Quitté
    Pages 523-608
  12. Henri Lombardi, Claude Quitté
    Pages 609-668
  13. Henri Lombardi, Claude Quitté
    Pages 669-733
  14. Henri Lombardi, Claude Quitté
    Pages 735-795
  15. Henri Lombardi, Claude Quitté
    Pages 797-833
  16. Henri Lombardi, Claude Quitté
    Pages 835-884
  17. Henri Lombardi, Claude Quitté
    Pages 885-928
  18. Henri Lombardi, Claude Quitté
    Pages 929-945
  19. Back Matter
    Pages 947-996

About this book

Introduction

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.

Keywords

Commutative Algebra Constructive Methods Dedekind-Mertens Lemma Finitely Generated Projective Modules Kronecker Theorem Local-Global Principles

Authors and affiliations

  1. 1.University of Franche-ComtéBesançonFrance
  2. 2.University of PoitiersPoitiersFrance

About the authors

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 Épistémologie mathématique, (Ellipse, 2011), and Méthodes matricielles. Introduction à la complexité algébrique, (Springer, 2003, in collaboration with Jounaïdi Abdeljaoued).

Claude Quitté is a researcher in effective commutative algebra, computer algebra and computer science. He has published Algorithmique algébrique, (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).

Bibliographic information

Reviews

“The book treats many of the standard topics from commutative algebra and projective modules in great detail, all using constructive methods. … The exhaustive bibliography draws both from classical and constructive mathematics. … This will be a great addition to the bookshelves of the community of constructive mathematicians.” (N. Mohan Kumar, Mathematical Reviews, October, 2016)

“The book has over 350 well-arranged exercises, together with helpful hints for solution. … Many methods, like lazy evaluation and dynamic evaluation, are discussed in great detail. … There is a detailed flow chart on chapter dependencies and the order in which chapters should be read. … The book will be useful for graduate students, as well as researchers, instructors, and theoretical computer scientists.” (Naga Narayanaswamy, Computing Reviews, February, 2016)

“The book under review is the faithful English translation of the original French edition published in 2011 under the same title. … No doubt, the English edition … will certainly increase both its international significance and its wider popularity among graduate students, researchers, instructors, and interested scientists in general.” (Werner Kleinert, zbMATH 1327.13001, 2016)