On the alleged simplicity of impure proof

In Roman Kossak & Philip Ording (eds.), Simplicity: Ideals of Practice in Mathematics and the Arts. pp. 207-226 (2017)
Download Edit this record How to cite View on PhilPapers
Roughly, a proof of a theorem, is “pure” if it draws only on what is “close” or “intrinsic” to that theorem. Mathematicians employ a variety of terms to identify pure proofs, saying that a pure proof is one that avoids what is “extrinsic,” “extraneous,” “distant,” “remote,” “alien,” or “foreign” to the problem or theorem under investigation. In the background of these attributions is the view that there is a distance measure (or a variety of such measures) between mathematical statements and proofs. Mathematicians have paid little attention to specifying such distance measures precisely because in practice certain methods of proof have seemed self- evidently impure by design: think for instance of analytic geometry and analytic number theory. By contrast, mathematicians have paid considerable attention to whether such impurities are a good thing or to be avoided, and some have claimed that they are valuable because generally impure proofs are simpler than pure proofs. This article is an investigation of this claim, formulated more precisely by proof- theoretic means. After assembling evidence from proof theory that may be thought to support this claim, we will argue that on the contrary this evidence does not support the claim.
(categorize this paper)
PhilPapers/Archive ID
Upload history
Archival date: 2019-09-16
View other versions
Added to PP index

Total views
101 ( #34,775 of 52,686 )

Recent downloads (6 months)
41 ( #15,108 of 52,686 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.