Portal de Periódicos da CAPES

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

2014; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-319-08970-6_11

1611-3349

Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, E. ̃Tassi,

Logic, programming, and type systems

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.