Formal verification of Zagier's one-sentence proof

03/21/2021
by   Guillaume Dubach, et al.
0

We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's more recent proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics. With the same method, we also provide a formal proof of another classical result on primes of the form a^2 + 2 b^2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2019

A Formal Proof of the Irrationality of ζ(3)

This paper presents a complete formal verification of a proof that the e...
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
04/04/2023

Introduction to Pylog

PyLog is a minimal experimental proof assistant based on linearised natu...
research
01/25/2013

Recycling Proof Patterns in Coq: Case Studies

Development of Interactive Theorem Provers has led to the creation of bi...
research
11/01/2019

A Formal Proof of PAC Learnability for Decision Stumps

We present a machine-checked, formal proof of PAC learnability of the co...
research
02/24/2016

Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants

Mathematical theorems are human knowledge able to be accumulated in the ...
research
12/18/2009

A Geometric Proof of Calibration

We provide yet another proof of the existence of calibrated forecasters;...

Please sign up or login with your details

Forgot password? Click here to reset