A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)

Abstract

This paper describes the formal verification of an irrationality proof of ζ(3), the evaluation of the Riemann zeta function, using the Coq proof assistant. This result was first proved by Apéry in 1978, and the proof we have formalized follows the path of his original presentation. The crux of this proof is to establish that some sequences satisfy a common recurrence. We formally prove this result by an a posteriori verification of calculations performed by computer algebra algorithms in a Maple session. The rest of the proof combines arithmetical ingredients and some asymptotic analysis that we conduct by extending the Mathematical Components libraries. The formalization of this proof is complete up to a weak corollary of the Prime Number Theorem.
Fichier principal
Vignette du fichier
main.pdf (354.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00984057 , version 1 (27-04-2014)

Identifiers

  • HAL Id : hal-00984057 , version 1

Cite

Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, Enrico Tassi. A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3). ITP - 5th International Conference on Interactive Theorem Proving, 2014, Vienna, Austria. ⟨hal-00984057⟩

Collections

INRIA INRIA2
562 View
627 Download

Share

Gmail Mastodon Facebook X LinkedIn More