Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials
We describe the formalisation in Coq of a proof that the numbers e and pi are transcendental. This is the first formalized proof of transcendance for pi. This proof lies at the interface of two domains of mathematics that are often considered separately: calculus (real and elementary complex analysis) and algebra. For the work on calculus, we rely on the Coquelicot library and for the work on algebra, we rely on the Mathematical Components library. Moreover, some of the elements of formalized proof originate in the more ancient library for real numbers included in the Coq distribution. The case of pi relied extensively on properties of multivariate polynomials and this experiment was also an occasion to put to test a newly developed library for these multivariate polynomials. In the paper, we describe the various original aspects of the work: orchestrating a development based on several libraries, designing a new library for multivariate polynomials, and specialized developments performed solely for this proof. Apart from achieving a landmark result, this work also teaches lessons about the evolution of modern formalized mathematics.
Mon 18 JanDisplayed time zone: Guadalajara, Mexico City, Monterrey change
16:00 - 18:00 | |||
16:00 30mTalk | A Modular, Efficient Formalisation of Real Algebraic Numbers CPP | ||
16:30 30mTalk | Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials CPP Sophie Bernard INRIA, Yves Bertot INRIA, Laurence Rideau INRIA, Pierre-Yves Strub IMDEA Software Institute | ||
17:00 30mTalk | Formalizing Jordan Normal Forms in Isabelle/HOL CPP | ||
17:30 30mTalk | Formalization of a Newton series representation of polynomials CPP |