- Membership
- MAA Press
- Meetings
- Competitions
- Community
- Programs
- Students
- High School Teachers
- Faculty and Departments
- Underrepresented Groups
- MAA Awards
- MAA Grants

- News
- About MAA

Publisher:

Princeton University Press

Publication Date:

2004

Number of Pages:

204

Format:

Hardcover

Price:

27.95

ISBN:

0-691-09294-X

Category:

General

[Reviewed by , on ]

P. N. Ruane

01/1/2005

Odifreddi's book successfully portrays the major developments in 20^{th} century mathematics by an examination of the mathematical problems that have gained prominence during the past 100 years. In the process, it traces the early historical context from which such problems have emerged, thereby linking the respective areas of contemporary mathematics to their classical origins. As such, it comes very near to being that intangible entity — a history of modern mathematics. Moreover, the literary style is such that the contents are made accessible to a very wide readership, but with no hint of oversimplification.

Speaking of literary style, one should bear in mind that the book was first published in Italian in 2000 and translated into English in 2004 by Arturo Sangalli. Without access to the original, it is difficult to pronounce with certainty as to the accuracy of the translation, except to say that, apart from two notable slips of between the tongues, the style is fluent and the mathematical narrative is generally sound.

The success of this book is partly due to the way in which its contents are structured but mainly to the way in which the problems are classified. There are just five chapters, as follows:

**Chapter 1: 'The Foundations':**Sets, Structures, Categories, Functions.**Chapter 2: Pure Mathematics:**Analysis, Algebra, Number Theory, Topology, Gödel's Incompleteness Theorem, Model Theory, Discrete Geometry, etc.**Chapter 3: Applied Mathematics:**Crystallography, Tensor Calculus, Game Theory, Functional Analysis, Optimisation Theory, Dynamical Systems, etc.**Chapter 4: Mathematics and the Computer:**Theory of Algorithms, Artificial Intelligence, Chaos Theory, Computer Assisted Proofs, Fractals.**Chapter 5: Open Problems:**Perfect Numbers, the Riemann Hypothesis, the Poincaré Conjecture, Complexity Theory.

Under these headings, the author provides much more detail than indicated above. For instance, with respect to algebra in chapter 2, there are sections allocated to Gorenstein's classification of finite groups and Steinitz's classification of fields. For topology, there are sections on Thurston's classification of 3d surfaces and Milnor's exotic structures and so on.

Discussion of the problems runs along two parallel tracks, the first of which is based upon thirteen of the Hilbert problems together with a historical survey of another twenty-one problems, beginning with Euclid's work on perfect numbers and culminating with the Moonshine Conjecture (amusingly mistranslated as the "Moonlight" Conjecture) of Conway and Norton (1979). Included this time span there is also mention of problems tackled by Kepler (configuration of spheres), Fermat, Goldbach, Riemann, Cantor, Mertens (bounds on the Möbius M function) and so on.

The second track is devoted to discussion of mathematical results that have led to the award of major prizes such as the Fields Medal, Wolf Prize, Nobel Prize and the Turing award and there is a total of sixty-six problems within these three categories.

The first chapter (Foundations) is by far the shortest, but it nicely sets the tone for the rest of the book. It illustrates how 'foundational' matters have been of importance since the time of the Pythagoreans and it covers issues like the *extensionality principle* of Leibniz and moves on to those well-known matters addressed by Frege, Russell and Cantor. This is followed by consideration of other foundational notions, such as the Bourbaki structural viewpoint, category theory and the lambda calculus of Alonzo Church. Odifreddi introduces the main players in these areas of work and he concludes with an explanation as to why Dana Scott earned the Turing Award in 1976.

Chapter 2 (Pure Mathematics) covers fifteen mathematical themes and mentions a myriad of mathematicians in the process. To convey the historical approach used by the author, a look at one of these topics may suffice. For example, section 2.11 explains the emergence of singularity theory and Thom's classification of catastrophes. Here, the starting point the work on conics by early Greek mathematicians, followed by mention of Descartes' use of algebra for the purpose of classification. Newton comes next by virtue of his work on cubics. We then read that, in 1740, J-P de Gua de Malves discovered that singular points of algebraic curves may be obtained by composing knots, cusps and inflexions in various ways. Proceeding to the 20^{th} century, the author reviews the work of Marston Morse and the theorem that characterises singular points. He introduces us to Hassler Witney and his work on cusps (Wolf prize 1982), which inspired René Thom to undertake his work on the classification of catastrophes. This section culminates with discourse on the related achievements of John Mather, Christopher Zeeman and Igor Prigogine (Nobel Prize 1977).

Another section epitomising the flavour of the text is 2.12 (Gorentstein's classification of finite groups). This is almost a mini history of group theory that begins with Bablyonian knowledge of solutions of quadratics goes on to discuss major achievements in the field of Lie groups and ends with mention of John Thompson's work on the second Burnside conjecture (Fields medal, 1970).

Chapter 3 is devoted to applied mathematics and its ten sections are concerned with:

- Crystallography: Bierbach's symmetry groups (1910)
- Tensor calculus: Einstein's general theory (1915)
- Game theory: Von Neuman's minimax theorem (1928)
- Functional analysis: Von Neuman's axiomatization of quantum mechanics (1932)
- Probability theory: Kolmogorov's axiomatization (1933)
- Opitmization theory: Dantzig's simplex method (1947)
- Equilibrium theory: Arrow-Debreu existence theorem (1954)
- Formal languages: Chomsky's classification (1957)
- Dynamical systems: The KAM theorem (1962)
- Knot theory: Jones invariants (1984)

The penultimate chapter yields another five of the author's chosen 30, which, in order of appearance, represent the achievements of Turing, Shannon, Lorenz, Appel and Haken and Mandelbrot. The chapter heading is, of course, 'Mathematics and the Computer'.

Obviously, a book whose theme is mathematical problem solving would be incomplete without reference to unsolved problems. So, by way of conclusion, the final chapter is devoted to this very subject. Accordingly, Odifreddi places emphasis on four particular examples:

- The perfect numbers problem
- The Riemann hypothesis
- The Poincaré conjecture
- The P = NP conjecture (complexity theory)< /li >

However, the distinction between problems that are presently *unsolved* and problems that are deemed *unsolvable* is another matter.

So, what *are* Odifreddi's 30 greatest problems? He enumerates 15 from the areas of applied and computer-related mathematics (as above) and this review has mentioned several of those he has chosen from the realm of pure mathematics. As for the remainder, purchase of this excellent little book (little in size, massive in scope!) will reveal their identity.

Peter Ruane (ruane.p@blueyonder.co.uk) has been involved with the teaching of mathematics at many levels since 1966. He has taught children from five to eighteen years old and he was employed in the field of mathematics education of teachers for over 25 years. Prior to his career in mathematics education he was variously employed, for a period of twelve years, as a docker (stevedore), slaughterman, bartender, farm labourer, hotel worker, shop assistant, etc. One of his ambitions is to be able to write books like Odifreddi's!

Foreword xi

Acknowledgments xvii

Introduction 1

CHAPTER 1: THE FOUNDATIONS 8

1.1. The 1920s: Sets 10

1.2. The 1940s: Structures 14

1.3. The 1960s: Categories 17

1.4. The 1980s: Functions 21

CHAPTER TWO: PURE MATHEMATICS 25

2.1. Mathematical Analysis: Lebesgue Measure (1902) 29

2.2. Algebra: Steinitz Classification of Fields (1910) 33

2.3. Topology: Brouwer's Fixed-Point Theorem (1910) 37

2.4. Number Theory: Gelfand Transcendental Numbers (1929) 39

2.5. Logic: Gâ€del's Incompleteness Theorem (1931) 43

2.6. The Calculus of Variations: Douglas's Minimal Surfaces (1931) 47

2.7. Mathematical Analysis: Schwartz's Theory of Distributions (1945) 52

2.8. Differential Topology: Milnor's Exotic Structures (1956) 56

2.9. Model Theory: Robinson's Hyperreal Numbers (1961) 59

2.10. Set Theory: Cohen's Independence Theorem (1963) 63

2.11. Singularity Theory: Thom's Classification of Catastrophes (1964) 66

2.12. Algebra: Gorenstein's Classification of Finite Groups (1972) 71

2.13. Topology: Thurston's Classification of 3-Dimensional Surfaces (1982) 78

2.14. Number Theory: Wiles's Proof of Fermat's Last Theorem (1995) 82

2.15. Discrete Geometry: Hales's Solution of Kepler's Problem (1998) 87

CHAPTER THREE: APPLIED MATHEMATICS 92

3.1. Crystallography: Bieberbach's Symmetry Groups (1910) 98

3.2. Tensor Calculus: Einstein's General Theory of Relativity (1915) 104

3.3. Game Theory: Von Neumann's Minimax Theorem (1928) 108

3.4. Functional Analysis: Von Neumann's Axiomatization of Quantum Mechanics (1932) 112

3.5. Probability Theory: Kolmogorov's Axiomatization (1933) 116

3.6. Optimization Theory: Dantzig's Simplex Method (1947) 120

3.7. General Equilibrium Theory: The Arrow-Debreu Existence Theorem (1954) 122

3.8. The Theory of Formal Languages: Chomsky's Classification (1957) 125

3.9. Dynamical Systems Theory: The KAM Theorem (1962) 128

3.10. Knot Theory: Jones Invariants (1984) 132

CHAPTER FOUR: MATHEMATICS AND THE COMPUTER 139

4.1. The Theory of Algorithms: Turing's Characterization (1936) 145

4.2. Artificial Intelligence: Shannon's Analysis of the Game of Chess (1950) 148

4.3. Chaos Theory: Lorenz's Strange Attractor (1963) 151

4.4. Computer-Assisted Proofs: The Four-Color Theorem of Appel and Haken (1976) 154

4.5. Fractals: The Mandelbrot Set (1980) 159

CHAPTER FIVE: OPEN PROBLEMS 165

5.1. Arithmetic: The Perfect Numbers Problem (300 BC) 166

5.2. Complex Analysis: The Riemann Hypothesis (1859) 168

5.3. Algebraic Topology: The Poincare Conjecture (1904) 172

5.4. Complexity Theory: The P=NP Problem (1972) 176

Conclusion 181

References and Further Reading 187

Index 189

Acknowledgments xvii

Introduction 1

CHAPTER 1: THE FOUNDATIONS 8

1.1. The 1920s: Sets 10

1.2. The 1940s: Structures 14

1.3. The 1960s: Categories 17

1.4. The 1980s: Functions 21

CHAPTER TWO: PURE MATHEMATICS 25

2.1. Mathematical Analysis: Lebesgue Measure (1902) 29

2.2. Algebra: Steinitz Classification of Fields (1910) 33

2.3. Topology: Brouwer's Fixed-Point Theorem (1910) 37

2.4. Number Theory: Gelfand Transcendental Numbers (1929) 39

2.5. Logic: Gâ€del's Incompleteness Theorem (1931) 43

2.6. The Calculus of Variations: Douglas's Minimal Surfaces (1931) 47

2.7. Mathematical Analysis: Schwartz's Theory of Distributions (1945) 52

2.8. Differential Topology: Milnor's Exotic Structures (1956) 56

2.9. Model Theory: Robinson's Hyperreal Numbers (1961) 59

2.10. Set Theory: Cohen's Independence Theorem (1963) 63

2.11. Singularity Theory: Thom's Classification of Catastrophes (1964) 66

2.12. Algebra: Gorenstein's Classification of Finite Groups (1972) 71

2.13. Topology: Thurston's Classification of 3-Dimensional Surfaces (1982) 78

2.14. Number Theory: Wiles's Proof of Fermat's Last Theorem (1995) 82

2.15. Discrete Geometry: Hales's Solution of Kepler's Problem (1998) 87

CHAPTER THREE: APPLIED MATHEMATICS 92

3.1. Crystallography: Bieberbach's Symmetry Groups (1910) 98

3.2. Tensor Calculus: Einstein's General Theory of Relativity (1915) 104

3.3. Game Theory: Von Neumann's Minimax Theorem (1928) 108

3.4. Functional Analysis: Von Neumann's Axiomatization of Quantum Mechanics (1932) 112

3.5. Probability Theory: Kolmogorov's Axiomatization (1933) 116

3.6. Optimization Theory: Dantzig's Simplex Method (1947) 120

3.7. General Equilibrium Theory: The Arrow-Debreu Existence Theorem (1954) 122

3.8. The Theory of Formal Languages: Chomsky's Classification (1957) 125

3.9. Dynamical Systems Theory: The KAM Theorem (1962) 128

3.10. Knot Theory: Jones Invariants (1984) 132

CHAPTER FOUR: MATHEMATICS AND THE COMPUTER 139

4.1. The Theory of Algorithms: Turing's Characterization (1936) 145

4.2. Artificial Intelligence: Shannon's Analysis of the Game of Chess (1950) 148

4.3. Chaos Theory: Lorenz's Strange Attractor (1963) 151

4.4. Computer-Assisted Proofs: The Four-Color Theorem of Appel and Haken (1976) 154

4.5. Fractals: The Mandelbrot Set (1980) 159

CHAPTER FIVE: OPEN PROBLEMS 165

5.1. Arithmetic: The Perfect Numbers Problem (300 BC) 166

5.2. Complex Analysis: The Riemann Hypothesis (1859) 168

5.3. Algebraic Topology: The Poincare Conjecture (1904) 172

5.4. Complexity Theory: The P=NP Problem (1972) 176

Conclusion 181

References and Further Reading 187

Index 189

- Log in to post comments