Lably
Skip to content

Euler characteristic

Topological invariant in mathematics

  • 12 min read
  • 6 chapters

Related on Lably

Through Mathematics, Polyhedron and Platonic solid

The Euler characteristic was originally defined for polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant. In modern mathematics, the Euler characteristic arises from homology and, more abstractly, homological algebra.

Polyhedra

The Euler characteristic was classically defined for the surface of a three-dimensional polyhedron. If the polyhedron has V vertices (corners), E edges, and F faces, then the Euler characteristic χ of its surface is χ=V−E+F. Any three-dimensional convex polyhedron's surface has an Euler characteristic of χ=2. This equation, stated by Euler in 1758, is known as Euler's polyhedron formula. It corresponds to the Euler characteristic of the sphere (i.e. χ=2), and applies identically to spherical polyhedra. An illustration of the formula for all Platonic solids is given below.

The surfaces of nonconvex polyhedra can have various Euler characteristics:

For regular polyhedra, Arthur Cayley derived a modified form of Euler's formula using the density D, vertex figure density dv, and face density df:

dvV−E+dfF=2D.

This version holds both for convex polyhedra (where the densities are all 1) and the non-convex Kepler–Poinsot polyhedra.

Projective polyhedra all have Euler characteristic 1, like the real projective plane, while the surfaces of toroidal polyhedra all have Euler characteristic 0, like the torus.

Plane graphs

The Euler characteristic can be defined for connected plane graphs by the same V−E+F formula as for polyhedral surfaces, where F is the number of faces in the graph, including the exterior face.

The Euler characteristic of any plane connected graph G is 2. This is easily proved by induction on the number of faces determined by G, starting with a tree as the base case. For trees, E=V−1 and F=1. If G has C components (disconnected graphs), the same argument by induction on F shows that V−E+F−C=1. One of the few graph theory papers of Cauchy also proves this result.

Via stereographic projection the plane maps to the 2-sphere, such that a connected graph maps to a polygonal decomposition of the sphere, which has Euler characteristic 2. This viewpoint is implicit in Cauchy's proof of Euler's formula given below.

Proof of Euler's formula

There are many proofs of Euler's formula. One was given by Cauchy in 1811, as follows. It applies to any convex polyhedron, and more generally to any polyhedron whose boundary is topologically equivalent to a sphere and whose faces are topologically equivalent to disks.

Remove one face of the polyhedral surface. By pulling the edges of the missing face away from each other, deform all the rest into a planar graph of points and curves, in such a way that the perimeter of the missing face is placed externally, surrounding the graph obtained, as illustrated by the first of the three graphs for the special case of the cube. (The assumption that the polyhedral surface is homeomorphic to the sphere at the beginning is what makes this possible.) After this deformation, the regular faces are generally not regular anymore. The number of vertices and edges has remained the same, but the number of faces has been reduced by 1. Therefore, proving Euler's formula for the polyhedron reduces to proving V−E+F=1 for this deformed, planar object.

If there is a face with more than three sides, draw a diagonal—that is, a curve through the face connecting two vertices that are not yet connected. Each new diagonal adds one edge and one face and does not change the number of vertices, so it does not change the quantity V−E+F. (The assumption that all faces are disks is needed here, to show via the Jordan curve theorem that this operation increases the number of faces by one.) Continue adding edges in this manner until all of the faces are triangular.

Apply repeatedly either of the following two transformations, maintaining the invariant that the exterior boundary is always a simple cycle:

  1. Remove a triangle with only one edge adjacent to the exterior, as illustrated by the second graph. This decreases the number of edges and faces by one each and does not change the number of vertices, so it preserves V−E+F.
  2. Remove a triangle with two edges shared by the exterior of the network, as illustrated by the third graph. Each triangle removal removes a vertex, two edges and one face, so it preserves V−E+F.

These transformations eventually reduce the planar graph to a single triangle. (Without the simple-cycle invariant, removing a triangle might disconnect the remaining triangles, invalidating the rest of the argument. A valid removal order is an elementary example of a shelling.)

At this point the lone triangle has V=3,E=3, and F=1, so that V−E+F=1. Since each of the two above transformation steps preserved this quantity, we have shown V−E+F=1 for the deformed, planar object thus demonstrating V−E+F=2 for the polyhedron. This proves the theorem.

For additional proofs, see Eppstein (2013). Multiple proofs, including their flaws and limitations, are used as examples in Proofs and Refutations by Lakatos (1976).

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Geometry