### Abstract

Euler stated in 1752 that every convex polyhedron satisfied the formula $V - E + F = 2$ where $V$, $E$ and $F$ are the numbers of its vertices, edges, and faces. For three dimensions, the well-known proof involves removing one face and then flattening the remainder to form a planar graph, which then is iteratively transformed to leave a single triangle. The history of that proof is extensively discussed and elaborated by Imre Lakatos, leaving one finally wondering whether the theorem even holds. The formal proof provided here has been ported from HOL Light, where it is credited to Lawrence. The proof generalises Euler's observation from solid polyhedra to convex polytopes of arbitrary dimension.

### License

BSD License

### Topics

- Mathematics/Topology

### Related publications

- Lawrence, J. (1997). A Short Proof of Euler’s Relation for Convex Polytopes. Canadian Mathematical Bulletin, 40(4), 471–474. https://doi.org/10.4153/cmb-1997-056-4

### Session Euler_Polyhedron_Formula

- Library_Extras
- Inclusion_Exclusion
- Euler_Formula

## Cite

×

Euler_Polyhedron_Formula-AFP

    @article{Euler_Polyhedron_Formula-AFP,
      author  = {Lawrence C. Paulson},
      title   = {Euler's Polyhedron Formula},
      journal = {Archive of Formal Proofs},
      month   = {September},
      year    = {2023},
      note    = {\url{https://isa-afp.org/entries/Euler_Polyhedron_Formula.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest