Commutative algebra: Constructive methods. Finite projective modules

Abstract

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic content content. In particular, when a theorem affirms the existence of an object -- the solution of a problem -- a construction algorithm of the object can always be extracted from the given proof. We revisit with a new and often simplifying eye several abstract classical theories. In particular, we review theories which did not have any algorithmic content in their general natural framework, such as Galois theory, the Dedekind domains, the finitely generated projective modules or the Krull dimension.

Cited by in corpus (20)

• Extension by Conservation. Sikorski's Theorem
• Using the internal language of toposes in algebraic geometry
• The syzygy theorem for Bézout rings
• Revisiting Zariski Main Theorem from a constructive point of view
• Sets of Special Subvarieties of Bounded Degree
• A basis for a quotient of symmetric polynomials
• A General Glivenko-Gödel Theorem for Nuclei
• Anneaux à diviseurs et anneaux de Krull (une approche constructive)
• A Foundation for Synthetic Algebraic Geometry
• Towards a constructive framework for control theory
• Some remarks about normal rings
• Decompositions of Nonlinear Input-Output Systems to Zero the Output
• Central H-spaces and banded types
• An Effective Positivstellensatz over the Rational Numbers for Finite Semialgebraic Sets
• A constructive proof of the general Nullstellensatz for Jacobson rings
• Torsion-free nilpotent groups of small Hirsch length with isomorphic finite quotients
• Algebra in Bishop's style: some major features of the book "A Course in Constructive Algebra'' by Mines, Richman, and Ruitenburg
• Constructive basic theory of central simple algebras
• K-theory of n-coherent rings
• Résolutions libres finies. Méthodes constructives