POPL 2020 (series) / CPP 2020 (series) / The 9th ACM SIGPLAN International Conference on Certified Programs and Proofs /
Formalising perfectoid spaces
Perfectoid spaces are sophisticated objects in arithmetic geometry introduced by Peter Scholze in 2012. We formalised enough definitions and theorems in topology, algebra and geometry to define perfectoid spaces in the Lean theorem prover. This experiment confirms that a proof assistant can handle complexity in that direction, which is rather different from formalising a long proof about simple objects. It also confirms that mathematicians with no computer science training can become proficient users of a proof assistant in a relatively short period of time. Finally, we observe that formalising a piece of mathematics that is a trending topic boosts the visibility of proof assistants amongst pure mathematicians.
Slides (perfectoid-cpp-talk.pdf) | 991KiB |
Tue 21 JanDisplayed time zone: Saskatchewan, Central America change
Tue 21 Jan
Displayed time zone: Saskatchewan, Central America change
15:35 - 16:40 | |||
15:35 21mTalk | Formalising perfectoid spaces CPP Patrick Massot Université Paris Sud, Kevin Buzzard Imperial College London, Johan Commelin Universität Freiburg DOI Pre-print Media Attached File Attached | ||
15:56 21mTalk | A Constructive Formalization of the Weak Perfect Graph Theorem CPP Abhishek Kr Singh Tata Institute of Fundamental Research Mumbai, Raja Natarajan Tata Institute of Fundamental Research Mumbai DOI Pre-print Media Attached File Attached | ||
16:18 21mTalk | Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq CPP DOI Pre-print Media Attached |