Elements of Purity

Cambridge: Cambridge University Press (2024)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Impurity in Contemporary Mathematics.Ellen Lehet - 2021 - Notre Dame Journal of Formal Logic 62 (1):67-82.
Ontological Purity for Formal Proofs.Robin Martinot - 2024 - Review of Symbolic Logic 17 (2):395-434.
Purity of Methods.Michael Detlefsen & Andrew Arana - 2011 - Philosophers' Imprint 11.

Analytics

Added to PP
2024-12-12

Downloads
8 (#1,588,140)

6 months
8 (#613,944)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrew Arana
Université de Lorraine

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references