Non-surveyable proof
In the philosophy of mathematics, a non-surveyable proof is a mathematical proof that is considered infeasible for a human mathematician to verify and so of controversial validity. The term was coined by Thomas Tymoczko in 1980 in criticism of Kenneth Appel and Wolfgang Haken's computer-assisted proof of the Four-Color Theorem, and has since been applied to other arguments, mainly those with excessive case splitting and/or with portions dispatched by a difficult-to-verify computer program. Surveyability remains an important consideration in computational mathematics.
Tymoczko's argument
Tymoczko argued that three criteria determine whether an argument is a mathematical proof:
- Convincingness, which refers to the proof's ability to persuade a rational prover of its conclusion;
- Surveyability, which refers to the proof's accessibility for verification by members of the human mathematical community; and
- Formalizability, which refers to the proof's appealing to only logical relationships between concepts to substantiate its argument.[1]
In Tymoczko's view, the Appel–Hacken proof failed the surveyability criterion by, he argued, substituting experiment for deduction:
…if we accept the [Four-Color Theorem] as a theorem, we are committed to changing the sense of "theorem", or, more to the point, … the sense of the underlying concept of "proof".
…[the] use of computers in mathematics, as in the [Four-Color Theorem], introduces empirical experiments into mathematics. Whether or not we choose to regard the [Four-Color Theorem] as proved, we must admit that the current proof is no traditional proof, no a priori deduction of a statement from premises. It is a traditional proof with a … gap, which is filled by the results of a well-thought-out experiment.— Thomas Tymoczko, "The Four-Color Problem and its Mathematical Significance"[1]
Without surveyability, a proof may serve it first purpose of convincing a reader of its result and yet fail at its second purpose of enlightening the reader as to why that result is true—it may play the role of an observation rather than of an argument.[2][3]
This distinction is important because it means that non-surveyable proofs expose mathematics to a much higher potential for error. Especially in the case where non-surveyability is due to the use of a computer program (which may have bugs), most especially when that program is not published, convincingness may suffer as a result.[3] As Tymoczko wrote:
Suppose some supercomputer were set to work on the consistency of Peano arithmetic and it reported a proof of inconsistency, a proof which was so long and complex that no mathematician could understand it beyond the most general terms. Could we have sufficient faith in computers to accept this result, or would we say that the empirical evidence for their reliability is not enough?— Thomas Tymoczko, "The Four-Color Problem and its Mathematical Significance"[1]
Counterarguments to Tymoczko's claims of non-surveyability
Tymoczko's view is contested, however, by arguments that difficult-to-survey proofs are not necessarily as invalid as impossible-to-survey proofs.
Paul Teller claimed that surveyability was a matter of degree and reader-dependent, not something a proof has or does not. As proofs are not rejected when students have trouble understanding them, Teller argues, neither should proofs be rejected (though they may be criticized) simply because professional mathematicians find the argument hard to follow.[4][3] (Teller disagreed with Tymoczko's assessment that "[The Four-Color Theorem] has not been checked by mathematicians, step by step, as all other proofs have been checked. Indeed, it cannot be checked that way.")
An argument along similar lines is that case splitting is an accepted proof method, and the Appel–Hacken proof is only an extreme example of case splitting.[2]
Countermeasures against non-surveyability
On the other hand, Tymoczko's point that proofs must be at least possible to survey and that errors in difficult-to-survey proofs are less likely to fall to scrutiny is generally not contested; instead methods have been suggested to improve surveyability, especially of computer-assisted proofs. Among early suggestions was that of parallelization: the verification task could be split across many readers, each of which could survey a portion of the proof.[5] But modern practice, as made famous by Flyspeck, is to render the dubious portions of a proof in a restricted formalism and then verify them with a proof checker that is available itself for survey.[6] Indeed, the Appel–Hacken proof has been thus verified.[6]
Nonetheless, automated verification has yet to see widespread adoption.[7]
References
- 1 2 3 Thomas Tymoczko. The Four-Color Problem and its Mathematical Significance. 1980.
- 1 2 Bonnie Gold and Roger Simons. Proof and Other Dilemmas: Mathematics and Philosophy.
- 1 2 3 Giandomenico Sica. Essays on the Foundations of Mathematics and Logic. Volume 1.
- ↑ Paul Teller. "Computer Proof". The Journal of Philosophy. 1980.
- ↑ Neil Tennant. "The Taming of the True". 1997.
- 1 2 Julie Rehmeyer. "How to (Really) Trust a Mathematical Proof". ScienceNews. https://www.sciencenews.org/article/how-really-trust-mathematical-proof. Retrieved 2008-11-14.
- ↑ Freek Wiedijk, The QED Manifesto Revisited, 2007