Synopses & Reviews
"... The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader. And it proves that the philosophical orientation of an author really can make a big difference. The mathematical content is intensely classical. ... Edwards makes it warmly accessible to any interested reader. And he is breaking fresh ground, in his rigorously constructive or constructivist presentation. So the book will interest anyone trying to learn these major, central topics in classical algebra and algebraic number theory. Also, anyone interested in constructivism, for or against. And even anyone who can be intrigued and drawn in by a masterly exposition of beautiful mathematics." Reuben Hersh This book aims to promote constructive mathematics, not by defining it or formalizing it, but by practicing it, by basing all definitions and proofs on finite algorithms. The topics covered derive from classic works of nineteenth century mathematics---among them Galois' theory of algebraic equations, Gauss's theory of binary quadratic forms and Abel's theorem about integrals of rational differentials on algebraic curves. It is not surprising that the first two topics can be treated constructively---although the constructive treatments shed a surprising amount of light on them---but the last topic, involving integrals and differentials as it does, might seem to call for infinite processes. In this case too, however, finite algorithms suffice to define the genus of an algebraic curve, to prove that birationally equivalent curves have the same genus, and to prove the Riemann-Roch theorem. The main algorithm in this case is Newton's polygon, which is given a full treatment. Other topics covered include the fundamental theorem of algebra, the factorization of polynomials over an algebraic number field, and the spectral theorem for symmetric matrices. Harold M. Edwards is Emeritus Professor of Mathematics at New York University. His previous books are Advanced Calculus (1969, 1980, 1993), Riemann's Zeta Function (1974, 2001), Fermat's Last Theorem (1977), Galois Theory (1984), Divisor Theory (1990) and Linear Algebra (1995). Readers of his Advanced Calculus will know that his preference for constructive mathematics is not new.
Review
From the reviews: "Harold Edwards is well known for his books with a constructivist slant, and his latest book aims to spread his message further. ... The major part of the book consists of essays ... telling a connected story, showing what can be achieved with such a constructive restriction imposed. The achievement is impressive ... . " (John Baylis, The Mathematical Gazette, Vol. 90 (5l9), 2006) "It is not a book about the history/philosophy of mathematics but rather a very serious book of mathematics. ... the mathematics is accessible to those with advanced undergraduate or graduate level courses in algebra ... . Without a doubt the mathematics in this book is rigorous ... . One of the nice features of this book is the bibliography which notes the sections where each reference appears. It should appeal to mathematicians and historians of mathematics alike." (Bonnie Shulman, MathDL, January, 2005) "The author of this volume points out immediately that it is not about the history or philosophy of mathematics, but rather a book about mathematics. It soon becomes clear, though, that historical and philosophical issues strongly influenced the topics discussed. ... The general point of view is that all definitions, theorems, constructs, and proofs should involve only algorithms that terminate in a finite number of steps. ... The book contains a wealth of interesting mathematics well worth reading." (Larry C. Grove, SIAM Review, Vol. 47 (4), 2005) "The book under review presents several important topics in mathematics from a constructivist point of view. ... This book is a delight to read. ... Moreover, the required background is kept to a minimum, so the book can be read by anyone with a good understanding of basic algebra. ... The style of the book itself is sufficient reason for reading it. ... One would wish that more mathematicians read the masters in search of inspiration, instead of merely following the most recent fads." (S. C. Coutinho, SIGACT News, Vol. 41 (2), 2010)
Synopsis
This book aims to promote constructive mathematics not by defining it or formalizing it but by practicing it. This means that its definitions and proofs use finite algorithms, not `algorithms' that require surveying an infinite number of possibilities to determine whether a given condition is met.
The topics covered derive from classic works of nineteenth century mathematics - among them Galois' theory of algebraic equations, Gauss's theory of binary quadratic forms and Abel's theorem about integrals of rational differentials on algebraic curves. For Abel's theorem the main algorithm is Newton's polygon, which is given a full treatment. Other topics covered include the fundamental theorem of algebra, the factorization of polynomials over an algebraic number field, and the spectral theorem for symmetric matrices.
Synopsis
Harold M. Edwards is Emeritus Professor of Mathematics at New York University. His previous books are Advanced Calculus (1969, 1980, 1993), Riemann's Zeta Function (1974, 2001), Fermat's Last Theorem (1977), Galois Theory (1984), Divisor Theory (1990) and Linear Algebra (1995). Readers of his Advanced Calculus will know that his preference for constructive mathematics is not new. In 1980 he was awarded the Steele Prize for mathematical exposition for the Riemann and Fermat books.
Synopsis
Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do algebra The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader
Table of Contents
Preface * Synopsis * PART 1: A Fundamental Theorem * General Arithmetic * A Fundamental Theorem * Roots Field (Simple Algebraic Extensions) * Factorization of Polynomials with Integer Coefficients * A Factorization Algorithm * Validation of the Factorization Algorithm * About the Factorization Algorithm * Proof of the Fundamental Theorem * Minimal Splitting Polynomials * PART 2: Topics in Algebra * Galois' Fundamental Theorem * Algebraic Quantities * Adjunctions and the Factorization of Polynomials * Symmetric Polynomials and the Splitting Field of x^n + c_1x^{n-1} + ... + c_n * A Fundamental Theorem of Divisor Theory * PART 3: Some Quadratic Problems * Hypernumbers * Modules * The Class Semigroup * Multiplication of Modules and Module Classes * Is A a Square Mod p? * Gauss's Composition of Forms * The Construction of Compositions * PART 4: The Genus of an Algebraic Curve * Abel's Memoir * Euler's Addition Formula * An Algebraic Definition of the Genus * Newton's Polygon * Determination of the Genus * Holomorphic Differentials * The Riemann-Roch Theorem * The Genus is a Birational Invariant * PART 5: Miscellany * On the So-Called Fundamental Theorem of Algebra * Proof by Contradiction and the Sylow Theorems * Overview of 'Linear Algebra' * The Spectral Theorem * Kronecker as One of E.T. Bell's 'Men of Mathematics' * References