Elements of Purity

A proof of a theorem can be said to be pure if it draws only on what is 'close' or 'intrinsic' to that theorem. In this Element we will investigate the apparent preference for pure proofs that has persisted in mathematics since antiquity, alongside a competing preference for impurity. In Section 1, we present two examples of purity, from geometry and number theory. In Section 2, we give a brief history of purity in mathematics. In Section 3, we discuss several different types of purity, based on different measures of distance between theorem and proof. In Section 4 we discuss reasons for preferring pure proofs, for the varieties of purity constraints presented in Section 3. In Section 5 we conclude by reflecting briefly on purity as a preference for the local and how issues of translation intersect with the considerations we have raised throughout this work.

Author: Andrew Arana
Binding Type: Hardcover
Publisher: Cambridge University Press
Published: 01/16/2025
Series: Elements in the Philosophy of Mathematics
Pages: 84
Weight: 0.63lbs
Size: 9.00h x 6.00w x 0.25d
ISBN: 9781009539708