A Formal Proof of the Irrationality of ζ(3)

12/13/2019
by   Assia Mahboubi, et al.
0

This paper presents a complete formal verification of a proof that the evaluation of the Riemann zeta function at 3 is irrational, using the Coq proof assistant. This result was first presented by Apéry in 1978, and the proof we have formalized essentially 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 asymptotic analysis, which we conduct by extending the Mathematical Components libraries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2021

Formal verification of Zagier's one-sentence proof

We comment on two formal proofs of Fermat's sum of two squares theorem, ...
research
05/03/2023

Proof in the time of machines

We compare the values associated with (traditional) community based proo...
research
01/03/2022

Spreads and Packings of PG(3,2), Formally!

We study how to formalize in the Coq proof assistant the smallest projec...
research
01/11/2018

Formal verification of an interior point algorithm instanciation

With the increasing power of computers, real-time algorithms tends to be...
research
01/17/2021

A bi-directional extensible interface between Lean and Mathematica

We implement a user-extensible ad hoc connection between the Lean proof ...
research
08/06/2022

On the Fundamental Limits of Formally (Dis)Proving Robustness in Proof-of-Learning

Proof-of-learning (PoL) proposes a model owner use machine learning trai...
research
09/01/2016

Verifier Theory and Unverifiability

Despite significant developments in Proof Theory, surprisingly little at...

Please sign up or login with your details

Forgot password? Click here to reset