Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese

definition - Euler_characteristic

definition of Wikipedia

   Advertizing ▼


Euler characteristic


In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler–Poincaré 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 \chi (Greek letter chi).

The Euler characteristic was originally defined for polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. Leonhard Euler, for whom the concept is named, was responsible for much of this early work. In modern mathematics, the Euler characteristic arises from homology and connects to many other invariants.



The Euler characteristic \chi was classically defined for the surfaces of polyhedra, according to the formula

\chi=V-E+F \,\!

where V, E, and F are respectively the numbers of vertices (corners), edges and faces in the given polyhedron. Any convex polyhedron's surface has Euler characteristic

\chi = V - E + F = 2. \,\!

This result is known as Euler's polyhedron formula or theorem. It corresponds to the Euler characteristic of the sphere (i.e. χ = 2), and applies identically to spherical polyhedra. An illustration of the formula on some polyhedra is given below.

Name Image Vertices
Euler characteristic:
VE + F
Tetrahedron Tetrahedron.png 4 6 4 2
Hexahedron or cube Hexahedron.png 8 12 6 2
Octahedron Octahedron.png 6 12 8 2
Dodecahedron Dodecahedron.png 20 30 12 2
Icosahedron Icosahedron.png 12 30 20 2

The surfaces of nonconvex polyhedra can have various Euler characteristics;

Name Image Vertices
Euler characteristic:
VE + F
Tetrahemihexahedron Tetrahemihexahedron.png 6 12 7 1
Octahemioctahedron Octahemioctahedron.png 12 24 12 0
Cubohemioctahedron Cubohemioctahedron.png 12 24 10 −2
Great icosahedron Great icosahedron.png 12 30 20 2

For regular polyhedra, Arthur Cayley derived a modified form of Euler's formula using the densities of the polyhedronD, vertex figures d_v and faces d_f:

d_v V - E + d_f F = 2D.

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

Projective polyhedra all have Euler characteristic 1, corresponding to the real projective plane, while toroidal polyhedra all have Euler characteristic 0, corresponding to the torus.

  Planar graphs

The Euler characteristic can be defined for connected planar 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 planar 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, 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 two-dimensional 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

First steps of the proof in the case of a cube

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, 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 VE + 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 aren't connected yet. This adds one edge and one face and does not change the number of vertices, so it does not change the quantity VE + 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:

  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 VE + 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 VE + F.

Repeat these two steps, one after the other, until only one triangle remains.

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

For additional proofs, see Nineteen Proofs of Euler's Formula by David Eppstein. Multiple proofs, including their flaws and limitations, are used as examples in Proofs and Refutations by Imre Lakatos.[1]

  Topological definition

The polyhedral surfaces discussed above are, in modern language, two-dimensional finite CW-complexes. (When only triangular faces are used, they are two-dimensional finite simplicial complexes.) In general, for any finite CW-complex, the Euler characteristic can be defined as the alternating sum

\chi = k_0 - k_1 + k_2 - k_3 + \cdots,\

where kn denotes the number of cells of dimension n in the complex.

Similarly, for a simplicial complex, the Euler characteristic equals the alternating sum

\chi = k_0 - k_1 + k_2 - k_3 + \cdots,\

where kn denotes the number of n-simplexes in the complex.

More generally still, for any topological space, we can define the nth Betti number bn as the rank of the n-th singular homology group. The Euler characteristic can then be defined as the alternating sum

\chi = b_0 - b_1 + b_2 - b_3 + \cdots.\

This quantity is well-defined if the Betti numbers are all finite and if they are zero beyond a certain index n0. 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 \chi.


The Euler characteristic of any closed odd-dimensional manifold is zero.[2]. The case for orientable examples is a corollary of Poincaré duality. This property applies more generally to any compact stratified space all of whose strata are odd-dimensional. Furthermore, the Euler characteristic behaves well with respect to many basic operations on topological spaces, as follows.

  Homotopy invariance

Since the homology is a topological invariant (in fact, a homotopy invariant — two topological spaces that are homotopy equivalent have isomorphic homology groups), so is the Euler characteristic.

For example, any convex polyhedron is homeomorphic to the three-dimensional ball, so its surface is homeomorphic (hence homotopy equivalent) to the two-dimensional sphere, which has Euler characteristic 2. This explains why convex polyhedra have 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:

\chi(M \sqcup N) = \chi(M) + \chi(N).

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:

\chi(M \cup N) = \chi(M) + \chi(N) - \chi(M \cap N).

This is true in the following cases:

  • 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.[4]

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.

  Product property

Also, the Euler characteristic of any product space M × N is

\chi(M \times N) = \chi(M) \cdot \chi(N).

These addition and multiplication properties are also enjoyed by cardinality of sets. In this way, the Euler characteristic can be viewed as a generalisation of cardinality; see [1].

  Covering spaces

Similarly, for an k-sheeted covering space \tilde{M} \to M, one has

\chi(\tilde{M}) = k \cdot \chi(M).

More generally, for a ramified covering space, the Euler characteristic of the cover can be computed from the above, with a correction factor for the ramification points, which yields the Riemann–Hurwitz formula.

  Fibration property

The product property holds much more generally, for fibrations with certain conditions.

If p\colon E \to B is a fibration with fiber F, with the base B path-connected, and the fibration is orientable over a field K, then the Euler characteristic with coefficients in the field K satisfies the product property:[5]

\chi(E) = \chi(F)\cdot \chi(B).

This includes product spaces and covering spaces as special cases, and can be proven by the Serre spectral sequence on homology of a fibration.

For fiber bundles, this can also be understood in terms of a transfer map \tau\colon H_*(B) \to H_*(E) – note that this is a lifting and goes "the wrong way" – whose composition with the projection map p_*\colon H_*(E) \to H_*(B) is multiplication by the Euler class of the fiber:[6]

p_* \circ \tau = \chi(F) \cdot 1.

  Relations to other invariants

The Euler characteristic of a closed orientable surface can be calculated from its genus g (the number of tori in a connected sum decomposition of the surface; intuitively, the number of "handles") as

\chi = 2 - 2g.\

The Euler characteristic of a closed non-orientable surface can be calculated from its non-orientable genus k (the number of real projective planes in a connected sum decomposition of the surface) as

\chi = 2 - k.\

For closed smooth manifolds, the Euler characteristic coincides with the Euler number, i.e., the Euler class of its tangent bundle evaluated on the fundamental class of a manifold. The Euler class, in turn, relates to all other characteristic classes of vector bundles.

For closed Riemannian manifolds, the Euler characteristic can also be found by integrating the curvature; see the Gauss–Bonnet theorem for the two-dimensional case and the generalized Gauss–Bonnet theorem for the general case.

A discrete analog of the Gauss–Bonnet theorem is Descartes' theorem that the "total defect" of a polyhedron, measured in full circles, is the Euler characteristic of the polyhedron; see defect (geometry).

Hadwiger's theorem characterizes the Euler characteristic as the unique (up to scalar multiplication) translation-invariant, finitely additive, not-necessarily-nonnegative set function defined on finite unions of compact convex sets in Rn that is "homogeneous of degree 0".


The Euler characteristic can be calculated easily for general surfaces by finding a polygonization of the surface (that is, a description as a CW-complex) and using the above definitions.

Name Image Euler characteristic
Interval Complete graph K2.svg 1
Circle Cirklo.svg 0
Disk Disc Plain grey.svg 1
Sphere Sphere-wireframe.png 2
(Product of two circles)
Torus illustration.png 0
Double torus Double torus illustration.png −2
Triple torus Triple torus illustration.png −4
Real projective plane Steiners Roman.png 1
Möbius strip MobiusStrip-01.png 0
Klein bottle KleinBottle-01.png 0
Two spheres (not connected)
(Disjoint union of two spheres)
Sphere-wireframe.pngSphere-wireframe.png 2 + 2 = 4
Three spheres (not connected)
(Disjoint union of three spheres)
Sphere-wireframe.pngSphere-wireframe.pngSphere-wireframe.png 2 + 2 + 2 = 6

Any contractible space (that is, one homotopy equivalent to a point) 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 \mathbb{R}^n 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.

The n-dimensional sphere has Betti number 1 in dimensions 0 and n, and all other Betti numbers 0. Hence its Euler characteristic is 1 + (-1)^n — that is, either 0 or 2.

The n-dimensional real projective space is the quotient of the n-sphere by the antipodal map. It follows that its Euler characteristic is exactly half that of the corresponding sphere — either 0 or 1.

The n-dimensional torus is the product space of n circles. Its Euler characteristic is 0, by the product property.

  Soccer ball example

How many pentagons and hexagons does it take to make a soccer ball? Assume we use H hexagons and P pentagons; then we have F=H+P faces. Every pentagon (hexagon) has 5 vertices (6 vertices), and each one is shared between 3 faces, hence we have V=(5 P+6 H)/3 vertices. Similarly, every pentagon (hexagon) has 5 edges (6 edges), and each one is shared between 2 faces, hence we have E=(5 P+6 H)/2 edges. The Euler characteristic is thus (P+H)-(\frac{5}{2}P+3H)+(\frac{5}{3}P+2H) = (1-\frac{5}{2}+\frac{5}{3})P + (1-3+2)H = \frac{1}{6}P + 0H. Since the sphere has Euler characteristic 2, it follows that P=12. The result is that we always need 12 pentagons on a football/soccer ball; the number of hexagons is in principle unconstrained (but for a real football/soccer ball one obviously chooses a number that makes the ball as spherical as possible). This result is also applicable to fullerenes.


For every combinatorial cell complex, one defines the Euler characteristic as the number of 0-cells, minus the number of 1-cells, plus the number of 2-cells, etc., if this alternating sum is finite. In particular, the Euler characteristic of a finite set is simply its cardinality, and the Euler characteristic of a graph is the number of vertices minus the number of edges.[7]

More generally, one can define the Euler characteristic of any chain complex to be the alternating sum of the ranks of the homology groups of the chain complex.

A version used in algebraic geometry is as follows. For any sheaf \scriptstyle\mathcal{F} on a projective scheme X, one defines its Euler characteristic

\chi ( \mathcal{F})= \Sigma (-1)^i h^i(X,\mathcal{F}),

where \scriptstyle h^i(X, \mathcal{F}) is the dimension of the i-th sheaf cohomology group of \scriptstyle\mathcal{F}.

Another generalization of the concept of Euler characteristic on manifolds comes from orbifolds. While every manifold has an integer Euler characteristic, an orbifold can have a fractional Euler characteristic. For example, the teardrop orbifold has Euler characteristic 1 + 1/p, where p is a prime number corresponding to the cone angle 2π / p.

The concept of Euler characteristic of a bounded finite poset is another generalization, important in combinatorics. A poset is "bounded" if it has smallest and largest elements; call them 0 and 1. The Euler characteristic of such a poset is defined as the integer μ(0,1), where μ is the Möbius function in that poset's incidence algebra.

This can be further generalized by defining a Q-valued Euler characteristic for certain finite categories, a notion compatible with the Euler characteristics of graphs, orbifolds and posets mentioned above. In this setting, the Euler characteristic of a finite group or monoid G is 1/|G|, and the Euler characteristic of a finite groupoid is the sum of 1/|Gi|, where we picked one representative group Gi for each connected component of the groupoid.[8]

  See also


  1. ^ Imre Lakatos: Proofs and Refutations, Cambridge Technology Press, 1976
  2. ^ Richeson, D., Euler's Gem, Princeton, 2008 (p. 261)
  3. ^ Edwin Spanier: Algebraic Topology, Springer 1966, p. 205.
  4. ^ William Fulton: Introduction to toric varieties, 1993, Princeton University Press, p. 141.
  5. ^ Spanier, Edwin Henry (1982), Algebraic Topology, Springer, ISBN 978-0-387-94426-5, http://books.google.com/?id=h-wc3TnZMCcC , Applications of the homology spectral sequence, p. 481
  6. ^ Gottlieb, Daniel Henry (1975), "Fibre bundles and the Euler characteristic", Journal of Differential Geometry 10 (1): 39–48, http://www.math.purdue.edu/~gottlieb/Bibliography/17FibreBundlesAndtheEulerCharacteristic.pdf 
  7. ^ Olaf Post calls this a "well-known formula": Post, Olaf (2009), "Spectral analysis of metric graphs and related spaces", Limits of graphs in group theory and computer science, Lausanne, Switzerland: EPFL Press, pp. 109–140, arXiv:0712.1507 .
  8. ^ Tom Leinster, "The Euler characteristic of a category", Documenta Mathematica, 13 (2008), pp. 21–49

  Further reading

  • Richeson, David S. (2008) Euler's Gem: The Polyhedron Formula and the Birth of Topology. Princeton University Press.
  • H. Graham Flegg: From Geometry to Topology. Dover 2001, p. 40

  External links



All translations of Euler_characteristic

sensagent's content

  • definitions
  • synonyms
  • antonyms
  • encyclopedia

Dictionary and translator for handheld

⇨ New : sensagent is now available on your handheld

   Advertising ▼

sensagent's office

Shortkey or widget. Free.

Windows Shortkey: sensagent. Free.

Vista Widget : sensagent. Free.

Webmaster Solution


A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

Try here  or   get the code


With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

Business solution

Improve your site content

Add new content to your site from Sensagent by XML.

Crawl products or adds

Get XML access to reach the best products.

Index images and define metadata

Get XML access to fix the meaning of your metadata.

Please, email us to describe your idea.


The English word games are:
○   Anagrams
○   Wildcard, crossword
○   Lettris
○   Boggle.


Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.


Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary
Main references

Most English definitions are provided by WordNet .
English thesaurus is mainly derived from The Integral Dictionary (TID).
English Encyclopedia is licensed by Wikipedia (GNU).


The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.
The web service Alexandria is granted from Memodata for the Ebay search.
The SensagentBox are offered by sensAgent.


Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

5488 online visitors

computed in 0.327s

I would like to report:
section :
a spelling or a grammatical mistake
an offensive content(racist, pornographic, injurious, etc.)
a copyright violation
an error
a missing statement
please precise:



Company informations

My account



   Advertising ▼