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 impu...
Saved in:
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2024
|
| Series: | Cambridge elements. Elements in the philosophy of mathematics
|
| Links: | https://doi.org/10.1017/9781009052719 |
| Summary: | 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. |
| Physical Description: | 1 Online-Ressource (77 Seiten) |
| ISBN: | 9781009052719 |
| ISSN: | 2399-2883 |
Staff View
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781009052719 | ||
| 003 | UkCbUP | ||
| 005 | 20250106070305.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 210216s2024||||enk o ||1 0|eng|d | ||
| 020 | |a 9781009052719 | ||
| 100 | 1 | |a Arana, Andrew Peter | |
| 245 | 1 | 0 | |a Elements of purity |c Andrew Arana |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2024 | |
| 300 | |a 1 Online-Ressource (77 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge elements. Elements in the philosophy of mathematics |x 2399-2883 | |
| 520 | |a 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. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781009055895 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781009539708 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781009052719 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781009052719 |
|---|---|
| _version_ | 1827038445080412161 |
| adam_text | |
| any_adam_object | |
| author | Arana, Andrew Peter |
| author_facet | Arana, Andrew Peter |
| author_role | |
| author_sort | Arana, Andrew Peter |
| author_variant | a p a ap apa |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01679nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781009052719</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20250106070305.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">210216s2024||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009052719</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Arana, Andrew Peter</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of purity</subfield><subfield code="c">Andrew Arana</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2024</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (77 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge elements. Elements in the philosophy of mathematics</subfield><subfield code="x">2399-2883</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781009055895</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781009539708</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781009052719</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781009052719 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-19T15:53:59Z |
| institution | BVB |
| isbn | 9781009052719 |
| issn | 2399-2883 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (77 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2024 |
| publishDateSearch | 2024 |
| publishDateSort | 2024 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge elements. Elements in the philosophy of mathematics |
| spelling | Arana, Andrew Peter Elements of purity Andrew Arana Cambridge Cambridge University Press 2024 1 Online-Ressource (77 Seiten) txt c cr Cambridge elements. Elements in the philosophy of mathematics 2399-2883 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. Erscheint auch als Druck-Ausgabe 9781009055895 Erscheint auch als Druck-Ausgabe 9781009539708 |
| spellingShingle | Arana, Andrew Peter Elements of purity |
| title | Elements of purity |
| title_auth | Elements of purity |
| title_exact_search | Elements of purity |
| title_full | Elements of purity Andrew Arana |
| title_fullStr | Elements of purity Andrew Arana |
| title_full_unstemmed | Elements of purity Andrew Arana |
| title_short | Elements of purity |
| title_sort | elements of purity |
| work_keys_str_mv | AT aranaandrewpeter elementsofpurity |