Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/20673Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Alama, Jesse | - |
| dc.date.accessioned | 2026-07-30T07:03:03Z | - |
| dc.date.available | 2026-07-30T07:03:03Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 16, Issue 1, Pages 7-17 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/20673 | - |
| dc.description.abstract | Euler’s polyhedron theorem states for a polyhedron p, that V −E+F =2, where V, E, and F are, respectively, the number of vertices, edges, and faces of p. The formula was first stated in print by Euler in 1758 [11]. The proof given here is based on Poincar´e’s linear algebraic proof, stated in [17] (with a corrected proof in [18]), as adapted by Imre Lakatos in the latter’s Proofs and Refutations [15]. As is well known, Euler’s formula is not true for all polyhedra. The condition on polyhedra considered here is that of being a homology sphere, which says that the cycles (chains whose boundary is zero) are exactly the bounding chains (chains that are the boundary of a chain of one higher dimension). The present proof actually goes beyond the three-dimensional version of the polyhedral formula given by Lakatos; it is dimension-free, in the sense that it gives a formula in which the dimension of the polyhedron is a parameter. The classical Euler relation V − E + F = 2 is corresponds to the case where the dimension of the polyhedron is 3. The main theorem, expressed in the language of the present article, is Sum alternating − characteristic − sequence(p) = 0, where p is a polyhedron. The alternating characteristic sequence of a polyhedron is the sequence −N(−1),+N(0),−N(1),...,〖(-1)〗^(dim(p)) ∗ N(dim(p)), where N(k) is the number of polytopes of p of dimension k. The special case of dim(p) = 3 yields Euler’s classical relation. (N(−1) and N(3) will turn out to be equal, by definition, to 1.) Two other special cases are proved: the first says that a one-dimensional “po lyhedron” that is a homology sphere consists of just two vertices (and thus consists of just a single edge); the second special case asserts that a two-dimensional polyhedron that is a homology sphere (a polygon) has as many vertices as edges. A treatment of the more general version of Euler’s relation can be found in [12] and [6]. The former contains a proof of Steinitz’s theorem, which shows that the abstract polyhedra treated in Poincar´e’s proof, which might not appear to be about polyhedra in the usual sense of the word, are in fact embeddable in R3 under certain conditions. It would be valuable to formalize a proof of Steinitz’s theorem and relate it to the development contained here. | pl |
| dc.language.iso | en | pl |
| dc.publisher | University of Białystok | pl |
| dc.rights | Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) | - |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | - |
| dc.title | Euler’s Polyhedron Formula | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2009 Jesse Alama, published by University of Białystok | pl |
| dc.rights.holder | This work is licensed under the Creative Commons License. | pl |
| dc.identifier.doi | 10.2478/v10037-008-0002-6 | - |
| dc.description.Affiliation | Department of Philosophy, Stanford University, USA | pl |
| dc.description.references | Jesse Alama. The rank+nullity theorem. Formalized Mathematics, 15(3):137–142, 2007. | pl |
| dc.description.references | Jesse Alama. The vector space of subsets of a set based on symmetric difference. Formalized Mathematics, 16(1):1–5, 2008. | pl |
| dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990. | pl |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | pl |
| dc.description.references | Arne Brøndsted. An Introduction to Convex Polytopes. Graduate Texts in Mathematics. Springer, 1983. | pl |
| dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990. | pl |
| dc.description.references | Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990. | pl |
| dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990. | pl |
| dc.description.references | Leonhard Euler. Elementa doctrinae solidorum. Novi Commentarii Academiae Scientarum Petropolitanae, 4:109–140, 1758. | pl |
| dc.description.references | Branko Gr¨unbaum. Convex Polytopes. Number 221 in Graduate Texts in Mathematics. Springer, 2nd edition, 2003. | pl |
| dc.description.references | Eugeniusz Kusak, Wojciech Leończuk, and Michał Muzalewski. Abelian groups, fields and vector spaces. Formalized Mathematics, 1(2):335–342, 1990. | pl |
| dc.description.references | Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887–890, 1990. | pl |
| dc.description.references | Imre Lakatos. Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, 1976. Edited by John Worrall and Elie Zahar. | pl |
| dc.description.references | Michał Muzalewski. Rings and modules– part II. Formalized Mathematics, 2(4):579–585, 1991. | pl |
| dc.description.references | Henri Poincar´e. Sur la g´en´eralisation d’un th´eor`eme d’Euler relatif aux poly`edres. Comptes Rendus de S´eances de l’Academie des Sciences, 117:144, 1893. | pl |
| dc.description.references | Henri Poincar´e. Compl´ement `a l’analysis situs. Rendiconti del Circolo Matematico di Palermo, 13:285–343, 1899. | pl |
| dc.description.references | Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335–338, 1997. | pl |
| dc.description.references | Dariusz Surowik. Cyclic groups and some of their properties– part I. Formalized Mathematics, 2(5):623–627, 1991. | pl |
| dc.description.references | Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329–334, 1990. | pl |
| dc.description.references | Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501–505, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Groups. Formalized Mathematics, 1(5):821–827, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Linear combinations in vector space. Formalized Mathematics, 1(5):877–882, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Subspaces and cosets of subspaces in vector space. Formalized Mathematics, 1(5):865–870, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Vectors in real linear space. Formalized Mathematics, 1(2):291–296, 1990. | pl |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990. | pl |
| dc.description.references | Mariusz Żynel. The Steinitz theorem and the dimension of a vector space. Formalized Mathematics, 5(3):423–428, 1996. | pl |
| dc.identifier.eissn | 1898-9934 | - |
| dc.description.volume | 16 | pl |
| dc.description.issue | 1 | pl |
| dc.description.firstpage | 7 | pl |
| dc.description.lastpage | 17 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2008, Volume 16, Issue 1 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Euler's_Polyhedron_Formula.pdf | 287,01 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
