The first three formalisations of major mathematical proofs have heralded a new age in formalised mathematics, establishing that informal proofs at the limits of what can be understood by humans can be checked by machine. However, formalisation itself can be subject to error, and yet there is currently no accepted process in checking, or even much concern that such checks have not been performed. In this paper, we motivate why we should be concerned about correctness, and argue the need for proof auditing, to rigorously and independently check a formalisation. We discuss the issues involved in performing an audit, and propose an effective and efficient auditing process. Throughout we use the Flyspeck Project, that formalises the Kepler Conjecture proof, to illustrate our point.
@article{4576,
title = {Proof Auditing Formalised Mathematics},
journal = {Journal of Formalized Reasoning},
volume = {9},
year = {2016},
doi = {10.6092/issn.1972-5787/4576},
language = {EN},
url = {http://dml.mathdoc.fr/item/4576}
}
Adams, Mark Miles. Proof Auditing Formalised Mathematics. Journal of Formalized Reasoning, Tome 9 (2016) . doi : 10.6092/issn.1972-5787/4576. http://gdmltest.u-ga.fr/item/4576/