[go: nahoru, domu]

Editing Euler's Gem

You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to a username, among other benefits.
Content that violates any copyrights will be deleted. Encyclopedic content must be verifiable through citations to reliable sources.
Latest revision Your text
Line 3: Line 3:


==Topics==
==Topics==
The book is organized historically, and reviewer Robert Bradley divides the topics of the book into three parts.{{r|bradley}} The first part discusses the earlier history of polyhedra, including the works of [[Pythagoras]], [[Thales]], [[Euclid]], and [[Johannes Kepler]], and the discovery by [[René Descartes]] of a polyhedral version of the [[Gauss–Bonnet theorem]] (later seen to be equivalent to Euler's formula). It surveys the life of [[Euler]], his discovery in the early 1750s that the [[Euler characteristic]] <math>V-E+F</math> (the number of vertices minus the number of edges plus the number of faces) is equal to 2 for all [[convex polyhedron|convex polyhedra]], and his flawed attempts at a proof, and concludes with the first rigorous proof of this identity in 1794 by [[Adrien-Marie Legendre]],{{r|bradley|bultheel|wagner}} based on [[Girard's theorem]] relating the angular excess of triangles in [[spherical trigonometry]] to their area.{{r|roth|martin}}
The book is organized historically, and reviewer Robert Bradley divides the topics of the book into three parts.{{r|bradley}} The first part discusses the earlier history of polyhedra, including the works of [[Pythagoras]], [[Thales]], [[Euclid]], and [[Johannes Kepler]], and the discovery by [[René Descartes]] of a polyhedral version of the [[Gauss–Bonnet theorem]] (later seen to be equivalent to Euler's formula). It surveys the life of [[Euler]], his discovery in the early 1750s that the [[Euler characteristic]] <math>V-E+F</math> is equal to two for all [[convex polyhedron|convex polyhedra]], and his flawed attempts at a proof, and concludes with the first rigorous proof of this identity in 1794 by [[Adrien-Marie Legendre]],{{r|bradley|bultheel|wagner}}
based on Girard's theorem relating the angular excess of triangles in [[spherical trigonometry]] to their area.{{r|roth|martin}}


Although polyhedra are geometric objects, ''Euler's Gem'' argues that Euler discovered his formula by being the first to view them topologically (as abstract incidence patterns of vertices, faces, and edges), rather than through their geometric distances and angles.{{r|daems}} (However, this argument is undermined by the book's discussion of similar ideas in the earlier works of Kepler and Descartes.){{r|martin}} The birth of topology is conventionally marked by an earlier contribution of Euler, his 1736 work on the [[Seven Bridges of Königsberg]], and the middle part of the book connects these two works through the [[graph theory|theory of graphs]].{{r|bradley}} It proves Euler's formula in a topological rather than geometric form, for [[planar graph]]s, and discusses its uses in proving that these graphs have vertices of low [[degree (graph theory)|degree]], a key component in proofs of the [[four color theorem]]. It even makes connections to [[combinatorial game theory]] through the graph-based games of [[Sprouts (game)|Sprouts]] and Brussels Sprouts and their analysis using Euler's formula.{{r|bradley|bultheel}}
Although polyhedra are geometric objects, ''Euler's Gem'' argues that Euler discovered his formula by being the first to view them topologically (as abstract incidence patterns of vertices, faces, and edges), rather than through their geometric distances and angles.{{r|daems}} (However, this argument is undermined by the book's discussion of similar ideas in the earlier works of Kepler and Descartes.){{r|martin}} The birth of topology is conventionally marked by an earlier contribution of Euler, his 1736 work on the [[Seven Bridges of Königsberg]], and the middle part of the book connects these two works through the [[graph theory|theory of graphs]].{{r|bradley}} It proves Euler's formula in a topological rather than geometric form, for [[planar graph]]s, and discusses its uses in proving that these graphs have vertices of low [[degree (graph theory)|degree]], a key component in proofs of the [[four color theorem]]. It even makes connections to [[combinatorial game theory]] through the graph-based games of [[Sprouts (game)|Sprouts]] and Brussels Sprouts and their analysis using Euler's formula.{{r|bradley|bultheel}}


In the third part of the book, Bradley moves on from the topology of the plane and the sphere to arbitrary topological surfaces.{{r|bradley}} For any surface, the Euler characteristics of all subdivisions of the surface are equal, but they depend on the surface rather than always being 2. Here, the book describes the work of [[Bernhard Riemann]], [[Max Dehn]], and [[Poul Heegaard]] on the [[classification of manifolds]], in which it was shown that the two-dimensional [[Closed manifold|compact]] topological surfaces can be completely described by their Euler characteristics and their [[orientability]]. Other topics discussed in this part include [[knot theory]] and the Euler characteristic of [[Seifert surface]]s, the [[Poincaré–Hopf theorem]], the [[Brouwer fixed point theorem]], [[Betti number]]s, and [[Grigori Perelman]]'s proof of the [[Poincaré conjecture]].{{r|ciesielski|bultheel}}
In the third part of the book, Bradley moves on from the topology of the plane and the sphere to arbitrary topological surfaces.{{r|bradley}} For any surface, the Euler characteristics of all subdivisions of the surface are equal, but they depend on the surface rather than always being 2. Here, the book describes the work of [[Bernhard Riemann]], [[Max Dehn]], and [[Poul Heegaard]] on the [[classification of manifolds]], in which it was shown that the two-dimensional topological surfaces can be completely described by their Euler characteristics and their [[orientability]]. Other topics discussed in this part include [[knot theory]] and the Euler characteristic of [[Seifert surface]]s, the [[Poincaré–Hopf theorem]], the [[Brouwer fixed point theorem]], [[Betti number]]s, and [[Grigori Perelman]]'s proof of the [[Poincaré conjecture]].{{r|ciesielski|bultheel}}


An appendix includes instructions for creating paper and soap-bubble models of some of the examples from the book.{{r|ciesielski|bultheel}}
An appendix includes instructions for creating paper and soap-bubble models of some of the examples from the book.{{r|ciesielski|bultheel}}


==Audience and reception==
==Audience and reception==
''Euler's Gem'' is aimed at a general audience interested in mathematical topics, with biographical sketches and portraits of the mathematicians it discusses, many diagrams and visual reasoning in place of rigorous proofs, and only a few simple equations.{{r|bradley|bultheel|ciesielski}} With no exercises, it is not a textbook.{{r|satzer}} However, the later parts of the book may be heavy going for amateurs, requiring at least an undergraduate-level understanding of [[calculus]] and [[differential geometry]].{{r|bultheel|karpenkov}} Reviewer Dustin L. Jones suggests that teachers would find its examples, intuitive explanations, and historical background material useful in the classroom.{{r|jones}}
''Euler's Gem'' is aimed at a general audience interested in mathematical topics, with biographical sketches and portraits of the mathematicians it discusses, many diagrams and visual reasoning in place of rigorous proofs, and only a few simple equations.{{r|bradley|bultheel|ciesielski}} With no exercises, it is not a textbook.{{r|satzer}} However, the later parts of the book may be heavy going for amateurs, requiring at least an undergraduate-level understanding of [[calculus]] and [[differential geometry]].{{r|bultheel|karpenkov}} Reviewer Dustin L. Jones also suggests that teachers would find its examples, intuitive explanations, and historical background material useful in the classroom.{{r|jones}}


Although reviewer Jeremy L. Martin complains that "the book's generalizations about mathematical history and aesthetics are a bit simplistic or even one-sided", points out a significant mathematical error in the book's conflation of [[Dual polyhedron|polar duality]] with [[Poincaré duality]], and views the book's attitude towards [[computer-assisted proof]] as "unnecessarily dismissive", he nevertheless concludes that the book's mathematical content "outweighs these occasional flaws".{{r|martin}} Dustin Jones evaluates the book as "a unique blend of history and mathematics ... engaging and enjoyable",{{r|jones}} and reviewer Bruce Roth calls it "well written and full of interesting ideas".{{r|roth}} Reviewer Janine Daems writes, "It was a pleasure reading this book, and I recommend it to everyone who is not afraid of mathematical arguments".{{r|daems}}
Although reviewer Jeremy L. Martin complains that "the book's generalizations about mathematical history and aesthetics are a bit simplistic or even one-sided", points out a significant mathematical error in the book's conflation of [[Dual polyhedron|polar duality]] with [[Poincaré duality]], and views the book's attitude towards [[computer-assisted proof]] as "unnecessarily dismissive", he nevertheless concludes that the book's mathematical content "outweighs these occasional flaws".{{r|martin}} Dustin Jones evaluates the book as "a unique blend of history and mathematics ... engaging and enjoyable",{{r|jones}} and reviewer Bruce Roth calls it "well written and full of interesting ideas".{{r|roth}} Reviewer Janine Daems writes, "It was a pleasure reading this book, and I recommend it to everyone who is not afraid of mathematical arguments".{{r|daems}}
By publishing changes, you agree to the Terms of Use, and you irrevocably agree to release your contribution under the CC BY-SA 4.0 License and the GFDL. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel Editing help (opens in new window)

Copy and paste: – — ° ′ ″ ≈ ≠ ≤ ≥ ± − × ÷ ← → · §   Cite your sources: <ref></ref>


{{}}   {{{}}}   |   []   [[]]   [[Category:]]   #REDIRECT [[]]   &nbsp;   <s></s>   <sup></sup>   <sub></sub>   <code></code>   <pre></pre>   <blockquote></blockquote>   <ref></ref> <ref name="" />   {{Reflist}}   <references />   <includeonly></includeonly>   <noinclude></noinclude>   {{DEFAULTSORT:}}   <nowiki></nowiki>   <!-- -->   <span class="plainlinks"></span>


Symbols: ~ | ¡ ¿ † ‡ ↔ ↑ ↓ • ¶   # ∞   ‹› «»   ¤ ₳ ฿ ₵ ¢ ₡ ₢ $ ₫ ₯ € ₠ ₣ ƒ ₴ ₭ ₤ ℳ ₥ ₦ № ₧ ₰ £ ៛ ₨ ₪ ৳ ₮ ₩ ¥   ♠ ♣ ♥ ♦   𝄫 ♭ ♮ ♯ 𝄪   © ® ™
Latin: A a Á á À à  â Ä ä Ǎ ǎ Ă ă Ā ā à ã Å å Ą ą Æ æ Ǣ ǣ   B b   C c Ć ć Ċ ċ Ĉ ĉ Č č Ç ç   D d Ď ď Đ đ Ḍ ḍ Ð ð   E e É é È è Ė ė Ê ê Ë ë Ě ě Ĕ ĕ Ē ē Ẽ ẽ Ę ę Ẹ ẹ Ɛ ɛ Ǝ ǝ Ə ə   F f   G g Ġ ġ Ĝ ĝ Ğ ğ Ģ ģ   H h Ĥ ĥ Ħ ħ Ḥ ḥ   I i İ ı Í í Ì ì Î î Ï ï Ǐ ǐ Ĭ ĭ Ī ī Ĩ ĩ Į į Ị ị   J j Ĵ ĵ   K k Ķ ķ   L l Ĺ ĺ Ŀ ŀ Ľ ľ Ļ ļ Ł ł Ḷ ḷ Ḹ ḹ   M m Ṃ ṃ   N n Ń ń Ň ň Ñ ñ Ņ ņ Ṇ ṇ Ŋ ŋ   O o Ó ó Ò ò Ô ô Ö ö Ǒ ǒ Ŏ ŏ Ō ō Õ õ Ǫ ǫ Ọ ọ Ő ő Ø ø Œ œ   Ɔ ɔ   P p   Q q   R r Ŕ ŕ Ř ř Ŗ ŗ Ṛ ṛ Ṝ ṝ   S s Ś ś Ŝ ŝ Š š Ş ş Ș ș Ṣ ṣ ß   T t Ť ť Ţ ţ Ț ț Ṭ ṭ Þ þ   U u Ú ú Ù ù Û û Ü ü Ǔ ǔ Ŭ ŭ Ū ū Ũ ũ Ů ů Ų ų Ụ ụ Ű ű Ǘ ǘ Ǜ ǜ Ǚ ǚ Ǖ ǖ   V v   W w Ŵ ŵ   X x   Y y Ý ý Ŷ ŷ Ÿ ÿ Ỹ ỹ Ȳ ȳ   Z z Ź ź Ż ż Ž ž   ß Ð ð Þ þ Ŋ ŋ Ə ə
Greek: Ά ά Έ έ Ή ή Ί ί Ό ό Ύ ύ Ώ ώ   Α α Β β Γ γ Δ δ   Ε ε Ζ ζ Η η Θ θ   Ι ι Κ κ Λ λ Μ μ   Ν ν Ξ ξ Ο ο Π π   Ρ ρ Σ σ ς Τ τ Υ υ   Φ φ Χ χ Ψ ψ Ω ω   {{Polytonic|}}
Cyrillic: А а Б б В в Г г   Ґ ґ Ѓ ѓ Д д Ђ ђ   Е е Ё ё Є є Ж ж   З з Ѕ ѕ И и І і   Ї ї Й й Ј ј К к   Ќ ќ Л л Љ љ М м   Н н Њ њ О о П п   Р р С с Т т Ћ ћ   У у Ў ў Ф ф Х х   Ц ц Ч ч Џ џ Ш ш   Щ щ Ъ ъ Ы ы Ь ь   Э э Ю ю Я я   ́
IPA: t̪ d̪ ʈ ɖ ɟ ɡ ɢ ʡ ʔ   ɸ β θ ð ʃ ʒ ɕ ʑ ʂ ʐ ç ʝ ɣ χ ʁ ħ ʕ ʜ ʢ ɦ   ɱ ɳ ɲ ŋ ɴ   ʋ ɹ ɻ ɰ   ʙ ⱱ ʀ ɾ ɽ   ɫ ɬ ɮ ɺ ɭ ʎ ʟ   ɥ ʍ ɧ   ʼ   ɓ ɗ ʄ ɠ ʛ   ʘ ǀ ǃ ǂ ǁ   ɨ ʉ ɯ   ɪ ʏ ʊ   ø ɘ ɵ ɤ   ə ɚ   ɛ œ ɜ ɝ ɞ ʌ ɔ   æ   ɐ ɶ ɑ ɒ   ʰ ʱ ʷ ʲ ˠ ˤ ⁿ ˡ   ˈ ˌ ː ˑ ̪   {{IPA|}}

Wikidata entities used in this page

Pages transcluded onto the current version of this page (help):

This page is a member of 1 hidden category (help):