Euler characteristic

In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by .
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 vertices, edges, and faces, then the Euler characteristic of its surface is
Any three-dimensional convex polyhedron's surface has an Euler characteristic of. This equation, stated by Euler in 1758, is known as Euler's polyhedron formula. It corresponds to the Euler characteristic of the sphere, and applies identically to spherical polyhedra. An illustration of the formula for all Platonic solids is given below.

Name	Image	Vertices	Edges	Faces	Euler characteristic:
Tetrahedron	50px	4	6	4	2
Hexahedron or cube	50px	8	12	6	2
Octahedron	50px	6	12	8	2
Dodecahedron	50px	20	30	12	2
Icosahedron	50px	12	30	20	2

The surfaces of nonconvex polyhedra can have various Euler characteristics:

Name	Image	Vertices	Edges	Faces	Euler characteristic:
Tetrahemihexahedron	100px	6	12	7	1
Octahemioctahedron	100px	12	24	12	0
Cubohemioctahedron	100px	12	24	10	−2
Small stellated dodecahedron	100px	12	30	12	−6
Great stellated dodecahedron	100px	20	30	12	2

For regular polyhedra, Arthur Cayley derived a modified form of Euler's formula using the density, vertex figure density and face density
This version holds both for convex polyhedra 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 formula as for polyhedral surfaces, where is the number of faces in the graph, including the exterior face.
The Euler characteristic of any plane connected graph is 2. This is easily proved by induction on the number of faces determined by, starting with a tree as the base case. For trees, and If has components, the same argument by induction on shows that 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. 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 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 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:

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
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

These transformations eventually reduce the planar graph to a single triangle.
At this point the lone triangle has and so that Since each of the two above transformation steps preserved this quantity, we have shown for the deformed, planar object thus demonstrating for the polyhedron. This proves the theorem.
For additional proofs, see Eppstein. Multiple proofs, including their flaws and limitations, are used as examples in Proofs and Refutations by Lakatos.

Topological definition

The polyhedral surfaces discussed above are, in modern language, two-dimensional finite CW-complexes. In general, for any finite CW-complex, the Euler characteristic can be defined as the alternating sum
where k_n denotes the number of cells of dimension n in the complex.
Similarly, for a simplicial complex, the Euler characteristic equals the alternating sum
where k_n denotes the number of n-simplexes in the complex.

Betti number alternative

More generally still, for any topological space, we can define the nth Betti number b_n as the rank of the n-th singular homology group. The Euler characteristic can then be defined as the alternating sum
This quantity is well-defined if the Betti numbers are all finite and if they are zero beyond a certain index n₀. For simplicial complexes, this is not the same definition as in the previous paragraph but a homology computation shows that the two definitions will give the same value for.

Differentiable point of view

For an oriented, compact smooth manifold without boundary,, one defines
The number of self oriented intersections of the diagonal of, , inside

Properties

The Euler characteristic behaves well with respect to many basic operations on topological spaces, as follows.

Homotopy invariance

Homology is a topological invariant, and moreover a homotopy invariant: Two topological spaces that are homotopy equivalent have isomorphic homology groups. It follows that the Euler characteristic is also a homotopy invariant.
For example, any contractible space has trivial homology, meaning that the 0th Betti number is 1 and the others 0. Therefore, its Euler characteristic is 1. This case includes Euclidean space of any dimension, as well as the solid unit ball in any Euclidean space — the one-dimensional interval, the two-dimensional disk, the three-dimensional ball, etc.
For another example, any convex polyhedron is homeomorphic to the three-dimensional ball, so its surface is homeomorphic to the two-dimensional sphere, which has Euler characteristic 2. This explains why the surface of a convex polyhedron has Euler characteristic 2.

Inclusion–exclusion principle

If M and N are any two topological spaces, then the Euler characteristic of their disjoint union is the sum of their Euler characteristics, since homology is additive under disjoint union:
More generally, if M and N are subspaces of a larger space X, then so are their union and intersection. In some cases, the Euler characteristic obeys a version of the inclusion–exclusion principle:
This is true in the following cases:

if M and N are an excisive couple. In particular, if the interiors of M and N inside the union still cover the union.
if X is a locally compact space, and one uses Euler characteristics with compact supports, no assumptions on M or N are needed.
if X is a stratified space all of whose strata are even-dimensional, the inclusion–exclusion principle holds if M and N are unions of strata. This applies in particular if M and N are subvarieties of a complex algebraic variety.

In general, the inclusion–exclusion principle is false. A counterexample is given by taking X to be the real line, M a subset consisting of one point and N the complement of M.

Quotient space

If X is a finite CW-complex and A is a subcomplex, then
The formula could be more succinctly written for the reduced Euler characteristic—the alternating sum of ranks of reduced homology groups.