Euler's Polyhedron Formula

被引:5
|
作者
Alama, Jesse [1 ]
机构
[1] Stanford Univ, Dept Philosophy, Stanford, CA 94305 USA
来源
FORMALIZED MATHEMATICS | 2008年 / 16卷 / 01期
关键词
D O I
10.2478/v10037-008-0002-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 Poincare'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 "polyhedron" 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 Poincare's proof, which might not appear to be about polyhedra in the usual sense of the word, are in fact embeddable in R-3 under certain conditions. It would be valuable to formalize a proof of Steinitz's theorem and relate it to the development contained here.
引用
收藏
页码:7 / 17
页数:11
相关论文
共 50 条
  • [31] AN APPROXIMATION FORMULA FOR EULER-MASCHERONI'S CONSTANT
    Panzone, Pablo A.
    REVISTA DE LA UNION MATEMATICA ARGENTINA, 2016, 57 (01): : 9 - 22
  • [32] The flaw in Euler's proof of his polyhedral formula
    Francese, Christopher
    Richeson, David
    AMERICAN MATHEMATICAL MONTHLY, 2007, 114 (04): : 286 - 296
  • [33] Betti numbers and Euler’s formula for combinatorial foliations
    Gábor Elek
    manuscripta mathematica, 1997, 92 : 239 - 247
  • [34] The recursive nature of Euler's formula for harmonic series
    Khan, Rasul A.
    MATHEMATICAL GAZETTE, 2010, 94 (531): : 488 - 492
  • [35] Euler Savary's Formula On Complex Plane C
    Akbiyik, Mucahit
    Yucc, Salim
    APPLIED MATHEMATICS E-NOTES, 2016, 16 : 65 - 71
  • [36] Application of Padé Approximation to Euler’s constant and Stirling’s formula
    M. Prévost
    T. Rivoal
    The Ramanujan Journal, 2021, 54 : 177 - 195
  • [37] Application of Pade Approximation to Euler's constant and Stirling's formula
    Prevost, M.
    Rivoal, T.
    RAMANUJAN JOURNAL, 2021, 54 (01): : 177 - 195
  • [38] An elementary proof of Euler?s formula using Cauchy?s method
    Brasselet, Jean-Paul
    Bich Thuy, Nguyen Thi
    TOPOLOGY AND ITS APPLICATIONS, 2021, 293
  • [40] The New Euler's Formula of the Crossed DNA Polyhedral Links
    Li, Xiao-Wei
    Wang, Wen-Xing
    Qiu, Wen-Yuan
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70 (01) : 365 - 382