Mathematics and the formal turn

Authors

Type: Article
Publication Date: 2024-02-15
Citations: 5
DOI: https://doi.org/10.1090/bull/1832

Abstract

Since the early twentieth century, it has been understood that mathematical definitions and proofs can be represented in formal systems with precise grammars and rules of use. Building on such foundations, computational proof assistants now make it possible to encode mathematical knowledge in digital form. This article enumerates some of the ways that these and related technologies can help us do mathematics.

Locations

  • arXiv (Cornell University)
  • Bulletin of the American Mathematical Society

Ask a Question About This Paper

Summary

This paper discusses how mathematics can be represented in formal axiomatic systems with precise grammars and rules. The ability to represent mathematical definitions and proofs in formal systems is a striking contribution of modern logic. Building on these foundations, computational proof assistants make it possible to encode mathematical knowledge in digital form. The paper explores some ways these technologies can help us do mathematics.


Key innovations mentioned:
1. Verifying Theorems: Proof assistants can verify the correctness of mathematical proofs. Notable examples include the verification of Thomas Hales's proof of the Kepler conjecture and the Liquid Tensor Experiment.
2. Correcting Mistakes: Formal verification helps discover and correct errors in mathematical literature, as demonstrated by the formalization of the Kepler conjecture and Sébastien Gouëzel's work.
3. Gaining Insight: Formalization often leads to new insights. Examples include George Gonthier's characterization of planarity in terms of a hypermap and Scholze's realization about the computation of Ext-groups in the Liquid Tensor Experiment.
4. Building Libraries: The development of formal mathematical libraries, such as those of Mizar, Isabelle, HOL Light, Coq, Metamath, and Lean, leads to standardization of definitions and notation.
5. Searching for Definitions and Theorems: Technology like contemporary sledgehammer technology is beginning to help us find definitions and theorems. Large language models can also assist with formal oversight.
6. Refactoring Proofs: Digital formats allow mathematics to be searched, analyzed, and manipulated. Proof assistants enable users to tinker with and improve their mathematics.
7. Refactoring Libraries: Communities of formalizers often revise and refine fundamental concepts, with proof assistants helping to see the effects on downstream results.
8. Engineering Concepts: Refactoring formal libraries and proofs yields insights, such as using filters for the concept of a limit and embeddings between structures.
9. Communicating: New modes of communication have emerged around formal technologies, with mailing lists and social media platforms fostering collaboration.
10. Collaborating: Digital platforms support collaborative efforts, as demonstrated by the Liquid Tensor Experiment and formalization of the sphere eversion theorem.
11. Managing Complexity: Digital technology helps manage complexity by modularizing mathematical data and providing clear interfaces.
12. Managing the Literature: Conventional mathematical texts empower authors, but formal libraries put the reader in control by reducing definitions and proofs to axiomatic primitives.
13. Teaching: Interactive proof assistants provide quick feedback and help students recognize logical forms and keep track of objects and assumptions.
14. Improving Access: Formal technology makes mathematics more like writing computer programs, potentially improving access to a broader audience.
15. Using Mathematical Computation: Formal methods can make the use of symbolic and numeric computation more reliable.
16. Using Automated Reasoning: Automated reasoning tools, including first-order theorem provers, SAT solvers, SMT solvers, and term rewriters, can be used in mathematics.
17. Using Machine Learning: Machine learning can decide which theorems in a large formal library to use with a sledgehammer, and large language models can draft formal proof outlines.
18. Supporting a Synthesis of Machine Learning and Symbolic AI: Formal methods provide a platform for the synthesis of machine learning and symbolic reasoning, potentially leading to benefits beyond mathematics itself.


Main prior ingredients:
* Zermelo's axiomatization of set theory
* Russell and Whitehead's system of ramified type theory
* Automated reasoning tools
* Interactive proof assistants
* Formal axiomatic systems

Similar Works

Action Title Date Authors
Mathematics and the formal turn 2023-01-01 Jeremy Avigad
+
Logic and mathematical argument 2004-05-13 J. F. Humphreys Mike Prest
Mathematics and language 2015-01-01 Jeremy Avigad
The Space of Mathematical Software Systems - A Survey of Paradigmatic Systems. 2020-02-12 Katja BerÄŤiÄŤ Jacques Carette William M. Farmer Michael Kohlhase Dennis MĂĽller Florian Rabe Yasmine Sharoda
+
The Mathematica language 2015-11-30 Paul R. Wellin
Formal Mathematical Reasoning: A New Frontier in AI 2024-12-20 Kaiyu Yang Gabriel Poesia Jingxuan He Wenda Li Kristin Lauter Swarat Chaudhuri Dawn Song
The Space of Mathematical Software Systems -- A Survey of Paradigmatic Systems 2020-01-01 Katja BerÄŤiÄŤ Jacques Carette William M. Farmer Michael Kohlhase Dennis MĂĽller Florian Rabe Yasmine Sharoda
+
Proof and Computation: Perspectives for Mathematics, Computer Science, and Philosophy 2021-07-29 Klaus Mainzer
+
Mathematical logic 2007-01-01 Ian Chiswell Wilfrid Hodges
Mathematical Proof Between Generations 2023-12-14 Jonas Bayer Christoph BenzmĂĽller Kevin Buzzard Marco David Leslie Lampert Yuri Matiyasevich Lawrence Paulsen Dierk Schleicher Benedikt Stock Efim Zelmanov
+
Formal logic and mathematics 1947-01-01 A. Heyting
+
Proof in Mathematics Education, 1980-2020: An Overview 2020-08-31 Gila Hanna Christine Knipping
+
Mathematical Logic 2009-07-27 William Johnston Alex M McAllister
Mathematical Proof Between Generations 2022-01-01 Jonas Bayer Christoph BenzmĂĽller Kevin Buzzard Marco David Leslie Lamport Yuri Matiyasevich Lawrence C. Paulson Dierk Schleicher Benedikt Stock Efim Zelmanov
+
Deductive Mathematics: an Introduction to Proof and Discovery for Mathematics Education 2003-01-01 Andrew Wohlgemuth
+
Mathematical Proofs: A Transition to Advanced Mathematics 2002-06-07 Gary Chartrand Albert D. Polimeni Ping Zhang
+
Mathematical logic: Tool and object lesson for science 1985-02-01 G. Kreisel
+
Formal Science from Logic to Mathematics 1985-01-01 Mario Bunge
+
The Meaning of Proofs 2022-09-27 Gabriele Lolli
+
Paradigms and proofs: how revolutions transform mathematics 1996-01-01 Joseph W. Dauben

Citing (15)

Action Title Date Authors
A FORMAL PROOF OF THE KEPLER CONJECTURE 2017-01-01 Thomas Hales Mark Adams Gertrud Bauer TAT DAT DANG John Harrison Hoang Le Truong Cezary Kaliszyk Victor Magron Sean McLaughlin TAT THANG NGUYEN
A Revision of the Proof of the Kepler Conjecture 2009-03-16 Thomas Hales John Harrison Sean McLaughlin Tobias Nipkow Steven Obua Roland Zumkeller
A proof of the Kepler conjecture 2005-11-01 Thomas Hales
A corrected quantitative version of the Morse lemma 2019-03-21 Sébastien Gouëzel Vladimir Shchur
Mathematics in the age of the Turing machine 2014-05-01 Thomas Hales
+
The Resolution of Keller’s Conjecture 2020-01-01 Joshua Brakensiek Marijn J. H. Heule John Mackey David E. Narváez
The sphere packing problem in dimension $24$ 2017-02-24 Henry Cohn Abhinav Kumar Stephen D. Miller Danylo Radchenko Maryna Viazovska
Advancing mathematics by guiding human intuition with AI 2021-12-01 Alex Davies Petar Veličković Lars Buesing Sam Blackwell Daniel Zheng Nenad Tomašev Richard Tanburn Peter Battaglia Charles Blundell András Juhász
+
Dense Sphere Packings 2012-09-06 Thomas Hales
Notices of the American Mathematical Society 2012-08-16
Developments in Formal Proofs 2014-01-01 Thomas Hales
Formalising the h-Principle and Sphere Eversion 2023-01-11 Floris van Doorn Patrick Massot Oliver Nash
A formal proof of the four color theorem 2009-01-01 Limin Xiang
The lean mathematical library 2020-01-20 The mathlib Community
A Formalization of Dedekind Domains and Class Groups of Global Fields 2022-09-08 Anne Baanen Sander R. Dahmen Ashvni Narayanan Filippo Alberto Edoardo Nuccio Mortarino Majno Di Capriglio