Math 2.0

Convex and discrete geometry Theorem

Euler's polyhedron formula

Builds on Polyhedron

Statement

Let PP be a convex polyhedron in ℝ3\mathbb{R}^3 with VV vertices, EE edges and FF faces. Then V−E+F=2.V - E + F = 2.

Remarks

The number V−E+FV - E + F is the Euler characteristic of the surface of PP. The value 22 is the Euler characteristic of the sphere. The formula also holds for each polyhedron whose surface is topologically a sphere and whose faces are topologically discs. It can fail for other polyhedra. The surface of a polyhedron with the shape of a torus has V−E+F=0V - E + F = 0. For the cube, 8−12+6=28 - 12 + 6 = 2. For the regular tetrahedron, 4−6+4=24 - 6 + 4 = 2.

History

Euler stated the formula in 1758. Cauchy gave a proof in 1811.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Polyhedron concept
  2. Euler's polyhedron formula statement

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Euler_characteristic, Polyhedra
  2. Web https://en.wikipedia.org/wiki/Euler_characteristic, Proof of Euler's formula
About this page
Tag09HT3P35YP
URIm2://09HT3P35YP
Aliaseseuler-formula-for-polyhedra
Kindstatement, theorem
WritingW1 stated
MSC52B10
StatusThis copy of the site has no build data. Run m2 status 09HT3P35YP.
UsesPolyhedron

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by