Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Euler characteristic
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Topological invariant in mathematics}} {{About|Euler characteristic number|Euler characteristic class|Euler class|Euler number in 3-manifold topology|Seifert fiber space}} In [[mathematics]], and more specifically in [[algebraic topology]] and [[polyhedral combinatorics]], the '''Euler characteristic''' (or '''Euler number''', 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 <math> \chi </math> ([[Greek alphabet|Greek lower-case letter]] [[chi (letter)|chi]]). The Euler characteristic was originally defined for [[polyhedron|polyhedra]] and used to prove various theorems about them, including the classification of the [[Platonic solid]]s. It was stated for Platonic solids in 1537 in an unpublished manuscript by [[Francesco Maurolico]].<ref>{{cite book|first= Michael|last=Friedman|publisher=Birkhäuser|year=2018|title=A History of Folding in Mathematics: Mathematizing the Margins|title-link=A History of Folding in Mathematics|series=Science Networks. Historical Studies|volume=59|isbn=978-3-319-72486-7|doi=10.1007/978-3-319-72487-4|page=71}}</ref> [[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 (mathematics)|homology]] and, more abstractly, [[homological algebra]]. == Polyhedra == [[File:Vertex edge face.svg|thumb|Vertex, edge and face of a cube]] The '''Euler characteristic''' {{math|χ}} was classically defined for the surfaces of polyhedra, according to the formula :<math> \chi = V - E + F </math> where {{mvar|V}}, {{mvar|E}}, and {{mvar|F}} are respectively the numbers of [[Vertex (geometry)|<u>v</u>ertices]] (corners), [[Edge (geometry)|<u>e</u>dge]]s and [[Face (geometry)|<u>f</u>aces]] in the given polyhedron.<ref>{{Cite web |last=Weisstein |first=Eric W. |title=Euler Characteristic |url=https://mathworld.wolfram.com/EulerCharacteristic.html |access-date=2025-02-09 |website=mathworld.wolfram.com |language=en}}</ref> Any [[convex polyhedron]]'s surface has Euler characteristic :<math>\ \chi = V - E + F = 2 ~.</math> This equation, stated by [[Leonhard Euler|Euler]] in 1758,<ref> {{cite journal |last=Euler |first=L. |author-link=Leonhard Euler |year=1758 |title=Elementa doctrinae solidorum |lang=la |trans-title=Elements of rubrics for solids |journal=Novi Commentarii Academiae Scientiarum Petropolitanae |pages=109–140 |url=https://scholarlycommons.pacific.edu/euler-works/230 |via=[[University of the Pacific, Stockton|U. Pacific]], Stockton, CA }} </ref> is known as '''Euler's polyhedron formula'''.<ref>{{harvp|Richeson|2008}}</ref> It corresponds to the Euler characteristic of the [[sphere]] (i.e. <math>\ \chi = 2\ </math>), and applies identically to [[spherical polyhedra]]. An illustration of the formula on all Platonic polyhedra is given below. {| class="wikitable" |- ! Name !! Image !! Vertices<br>{{mvar|V}} !! Edges<br>{{mvar|E}} !! Faces<br>{{mvar|F}} ! Euler characteristic:<br><math>\ \chi = V - E + F\ </math> |- align=center |[[Tetrahedron]] || [[Image:tetrahedron.png|50px]] || 4 || 6 || 4 || '''2''' |- align=center | [[Hexahedron]] or [[cube (geometry)|cube]] || [[Image:hexahedron.png|50px]] || 8 || 12 || 6 || '''2''' |- align=center | [[Octahedron]] || [[Image:octahedron.png|50px]] || 6 || 12 || 8 || '''2''' |- align=center | [[Dodecahedron]] || [[Image:dodecahedron.png|50px]] || 20 || 30 || 12 || '''2''' |- align=center | [[Icosahedron]] || [[Image:icosahedron.png|50px]] || 12 || 30 || 20 || '''2''' |} The surfaces of nonconvex polyhedra can have various Euler characteristics: {| class="wikitable" |- ! Name !! Image !! Vertices<br>{{mvar|V}} !! Edges<br>{{mvar|E}} !! Faces<br>{{mvar|F}} ! Euler characteristic:<br><math>\ \chi = V - E + F\ </math> |- align=center | [[Tetrahemihexahedron]] || [[Image:Tetrahemihexahedron.png|100px]] || 6 || 12 || 7 || '''1''' |- align=center | [[Octahemioctahedron]] || [[Image:Octahemioctahedron.png|100px]] || 12 || 24 || 12 || '''0''' |- align=center | [[Cubohemioctahedron]] || [[Image:Cubohemioctahedron.png|100px]] || 12 || 24 || 10 || '''−2''' |- align=center | [[Small stellated dodecahedron]] || [[Image:Small stellated dodecahedron.png|100px]] || 12 || 30 || 12 || '''−6''' |- align=center | [[Great stellated dodecahedron]] || [[Image:Great stellated dodecahedron.png|100px]] || 20 || 30 || 12 || '''2''' |} For regular polyhedra, [[Arthur Cayley]] derived a modified form of Euler's formula using the [[Density (polytope)|density]] {{mvar|D}}, [[vertex figure]] density <math>\ d_v\ ,</math> and face density <math>\ d_f\ :</math> :<math>\ d_v V - E + d_f F = 2 D ~.</math> This version holds both for convex polyhedra (where the densities are all 1) and the non-convex [[Kepler–Poinsot polyhedron|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=== {{See also|Planar graph#Euler's formula}} The Euler characteristic can be defined for [[Connectivity (graph theory)|connected]] [[plane graph]]s by the same <math>\ V - E + F\ </math> formula as for polyhedral surfaces, where {{mvar|F}} is the number of faces in the graph, including the exterior face. The Euler characteristic of any plane connected graph {{mvar|G}} is 2. This is easily proved by induction on the number of faces determined by {{mvar|G}}, starting with a tree as the base case. For [[Tree_(graph_theory)|trees]], <math>\ E = V - 1\ </math> and <math>\ F = 1 ~.</math> If {{mvar|G}} has {{mvar|C}} components (disconnected graphs), the same argument by induction on {{mvar|F}} shows that <math>\ V - E + F - C = 1 ~.</math> 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=== [[Image:V-E+F=2 Proof Illustration.svg|frame|right|First steps of the proof in the case of a cube]] There are many proofs of Euler's formula. One was given by [[Augustin Louis Cauchy|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 <math>\ V - E + F = 1\ </math> 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 <math>\ V - E + F ~.</math> (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]]: #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 <math>\ V - E + F ~.</math> #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 <math>\ V - E + F ~.</math> 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 (topology)|shelling]].) At this point the lone triangle has <math>\ V = 3\ ,</math><math>\ E = 3\ ,</math> and <math>\ F = 1\ ,</math> so that <math>\ V - E + F = 1 ~.</math> Since each of the two above transformation steps preserved this quantity, we have shown <math>\ V - E + F = 1\ </math> for the deformed, planar object thus demonstrating <math>\ V - E + F = 2\ </math> for the polyhedron. This proves the theorem. For additional proofs, see [[David Eppstein|Eppstein]] (2013).<ref name=Eppstein2013>{{cite web |last=Eppstein |first=David |year=2013 |title=Twenty-one proofs of Euler's formula: {{nobr|{{math| V − E + F {{=}} 2 }} }} |type=acad. pers. wbs. |url=http://www.ics.uci.edu/~eppstein/junkyard/euler/ |access-date=27 May 2022 |via=[[University of California, Irvine|UC Irvine]] }}</ref> Multiple proofs, including their flaws and limitations, are used as examples in ''[[Proofs and Refutations]]'' by [[Imre Lakatos|Lakatos]] (1976).<ref>{{cite book |author=Lakatos, I. |author-link=Imre Lakatos |year=1976 |title=Proofs and Refutations |title-link=Proofs and Refutations |publisher=Cambridge Technology Press}}</ref> ==Topological definition== The polyhedral surfaces discussed above are, in modern language, two-dimensional finite [[CW-complex]]es. (When only triangular faces are used, they are two-dimensional finite [[simplicial complex]]es.) In general, for any finite CW-complex, the '''Euler characteristic''' can be defined as the alternating sum :<math>\chi = k_0 - k_1 + k_2 - k_3 + \cdots,</math> where ''k''<sub>''n''</sub> denotes the number of cells of dimension ''n'' in the complex. Similarly, for a [[simplicial complex]], the '''Euler characteristic''' equals the alternating sum :<math>\chi = k_0 - k_1 + k_2 - k_3 + \cdots,</math> where ''k''<sub>''n''</sub> denotes the number of [[Simplex|''n''-simplexes]] in the complex. ===Betti number alternative=== More generally still, for any [[topological space]], we can define the ''n''th [[Betti number]] ''b''<sub>''n''</sub> as the [[rank of an abelian group|rank]] of the ''n''-th [[singular homology]] group. The '''Euler characteristic''' can then be defined as the alternating sum :<math>\chi = b_0 - b_1 + b_2 - b_3 + \cdots.</math> This quantity is well-defined if the Betti numbers are all finite and if they are zero beyond a certain index ''n''<sub>0</sub>. 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 <math>\chi</math>. ==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 [[group isomorphism|isomorphic]] homology groups. It follows that the Euler characteristic is also a homotopy invariant. For example, 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]] <math>\mathbb{R}^n</math> 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 (mathematics)|ball]], so its surface is homeomorphic (hence homotopy equivalent) 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: :<math>\chi(M \sqcup N) = \chi(M) + \chi(N).</math> 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]]: :<math>\chi(M \cup N) = \chi(M) + \chi(N) - \chi(M \cap N).</math> This is true in the following cases: *if ''M'' and ''N'' are an [[excisive couple]]. In particular, if the [[interior (topology)|interiors]] of ''M'' and ''N'' inside the union still cover the union.<ref>Edwin Spanier: Algebraic Topology, Springer 1966, p. 205.</ref> *if ''X'' is a [[locally compact space]], and one uses Euler characteristics with [[compact space|compact]] [[support (mathematics)|supports]], no assumptions on ''M'' or ''N'' are needed. *if ''X'' is a [[topologically stratified space|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 number|complex]] [[algebraic variety]].<ref>William Fulton: Introduction to toric varieties, 1993, Princeton University Press, p. 141.</ref> 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 (set theory)|complement]] of ''M''. ===Connected sum=== For two connected closed n-manifolds <math>M, N</math> one can obtain a new connected manifold <math>M \# N</math> via the [[connected sum]] operation. The Euler characteristic is related by the formula <ref>{{cite web | url = http://topospaces.subwiki.org/wiki/Homology_of_connected_sum | title = Homology of connected sum | access-date = 2016-07-13 }}</ref> :<math> \chi(M \# N) = \chi(M) + \chi(N) - \chi(S^n).</math> ===Product property=== Also, the Euler characteristic of any [[product space]] ''M'' × ''N'' is :<math>\chi(M \times N) = \chi(M) \cdot \chi(N).</math> These addition and multiplication properties are also enjoyed by [[cardinality]] of [[set (mathematics)|set]]s. In this way, the Euler characteristic can be viewed as a generalisation of cardinality; see [http://math.ucr.edu/home/baez/counting/]. ===Covering spaces=== {{details|Riemann–Hurwitz formula}} Similarly, for a ''k''-sheeted [[covering space]] <math>\tilde{M} \to M,</math> one has :<math>\chi(\tilde{M}) = k \cdot \chi(M).</math> 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 <math>p\colon E \to B</math> 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:<ref>{{citation |title=Algebraic Topology |first=Edwin Henry |last=Spanier |author-link=Edwin Spanier |publisher=Springer |year=1982 |isbn=978-0-387-94426-5 |url=https://books.google.com/books?id=h-wc3TnZMCcC }}, [https://books.google.com/books?id=h-wc3TnZMCcC&pg=PA481 Applications of the homology spectral sequence, p. 481]</ref> :<math>\chi(E) = \chi(F)\cdot \chi(B).</math> 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]] <math>\tau\colon H_*(B) \to H_*(E)</math> – note that this is a lifting and goes "the wrong way" – whose composition with the projection map <math>p_*\colon H_*(E) \to H_*(B)</math> is multiplication by the [[Euler class]] of the fiber:<ref>{{citation |title=Fibre bundles and the Euler characteristic |first=Daniel Henry |last=Gottlieb |journal=Journal of Differential Geometry |volume=10 |issue=1 |year=1975 |pages=39–48 |doi=10.4310/jdg/1214432674 |s2cid=118905134 |url=http://www.math.purdue.edu/~gottlieb/Bibliography/17FibreBundlesAndtheEulerCharacteristic.pdf }}</ref> :<math>p_* \circ \tau = \chi(F) \cdot 1.</math> ==Examples== ===Surfaces=== 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. {| class="wikitable" |- !Name !Image !<abbr title="Euler characteristic">'''χ'''</abbr> |- |[[Interval (mathematics)|Interval]] |[[Image:Complete graph K2.svg|100px]] |'''{{0}}1''' |- |[[Circle]] |[[Image:Cirklo.svg|100px]] |'''{{0}}0''' |- |[[Unit disk|Disk]] |[[Image:Disc Plain grey.svg|100px]] |'''{{0}}1''' |- |[[Sphere]] |[[Image:Sphere-wireframe.png|100px]] |'''{{0}}2''' |- |[[Torus]] <br>''(Product of<br>two circles)'' |[[Image:Torus illustration.png|100px]] |'''{{0}}0''' |- |[[Double torus]] |[[Image:Double torus illustration.png|100px]] |'''−2''' |- |[[Triple torus]] |[[Image:Triple torus illustration.png|100px]] |'''−4''' |- |[[Real projective plane|Real projective<br>plane]] |[[Image:Steiners Roman.png|100px]] |'''{{0}}1''' |- |[[Möbius strip]] |[[Image:MobiusStrip-01.svg|100px]] |'''{{0}}0''' |- |[[Klein bottle]] |[[Image:KleinBottle-01.png|100px]] |'''{{0}}0''' |- |Two spheres<br>(not connected) <br>''(Disjoint union<br>of two spheres)'' |[[File:2-spheres.png|200x200px]] |2 + 2 = '''4''' |- |Three spheres<br>(not connected) <br>''(Disjoint union<br>of three spheres)'' |[[File:Sphere-wireframe.png|100x100px]][[File:Sphere-wireframe.png|100x100px]][[File:Sphere-wireframe.png|100x100px]] |2 + 2 + 2 = '''6''' |- |<math>n</math> spheres<br>(not connected) <br>''(Disjoint union<br>of ''n'' spheres)'' | [[File:Sphere-wireframe.png|100x100px]]'''<big> ...</big>'''[[File:Sphere-wireframe.png|100x100px]] |{{nowrap|2 + ... + 2 {{=}} '''2n'''}} |} ===Soccer ball=== It is common to construct [[soccer ball]]s by stitching together pentagonal and hexagonal pieces, with three pieces meeting at each vertex (see for example the [[Adidas Telstar]]). If {{mvar|P}} pentagons and {{mvar|H}} hexagons are used, then there are <math>\ F = P + H\ </math> faces, <math>\ V = \tfrac{1}{3}\left(\ 5 P + 6 H\ \right)\ </math> vertices, and <math>\ E = \tfrac{1}{2} \left(\ 5P + 6H\ \right)\ </math> edges. The Euler characteristic is thus : <math> V - E + F = \tfrac{1}{3} \left(\ 5 P + 6 H\ \right) - \tfrac{1}{2} \left(\ 5 P + 6 H\ \right) + P + H = \tfrac{1}{6} P ~.</math> Because the sphere has Euler characteristic 2, it follows that <math>\ P = 12 ~.</math> That is, a soccer ball constructed in this way always has 12 pentagons. The number of hexagons can be any [[nonnegative integer]] except 1.<ref>{{cite book |first1=P.W. |last1=Fowler |name-list-style=amp |first2=D.E. |last2=Manolopoulos |year=1995 |title=An Atlas of Fullerenes |page=32}}</ref> This result is applicable to [[fullerene]]s and [[Goldberg polyhedra]]. ===Arbitrary dimensions=== [[File:Euler_characteristic_hypercube_simplex.svg|thumb|250px|Comparison of Euler characteristics of [[hypercube]]s and [[simplex|simplices]] of dimensions 1 to 4]] {| class="wikitable floatright" style="text-align:right;" |+ <small>Euler characteristics of the six [[regular 4-polytope|4 dimensional analogues of the regular polyhedra]]</small> ! Regular<br/>4 polytope ! [[Vertex (geometry)|{{mvar|V}}]]<br/>{{mvar|k}}{{sub|0}} ! [[Edge (geometry)|{{mvar|E}}]]<br/>{{mvar|k}}{{sub|1}} ! [[Face (geometry)|{{mvar|F}}]]<br/>{{mvar|k}}{{sub|2}} ! [[Cell (geometry)|{{mvar|C}}]]<br/>{{mvar|k}}{{sub|3}} ! {{right| <math> \chi = V - E\ +</math><br/><math> +\ F - C</math>}} |- | [[5-cell|5 cell]] || 5 || 10 || 10 || 5 || {{center|'''0'''}} |- | [[8-cell|8 cell]] || 16 || 32 || 24 || 8 || {{center|'''0'''}} |- | [[16-cell|16 cell]] || 8 || 24 || 32 || 16 || {{center|'''0'''}} |- | [[24-cell|24 cell]] || 24 || 96 || 96 || 24 || {{center|'''0'''}} |- | [[120-cell|120 cell]] || 600 || 1200 || 720 || 120 || {{center|'''0'''}} |- | [[600-cell|600 cell]] || 120 || 720 || 1200 || 600 || {{center|'''0'''}} |} The {{mvar|n}} dimensional sphere has singular [[homology group]]s equal to :<math>H_k(\mathrm{S}^n) = \begin{cases} \mathbb{Z} ~& k = 0 ~~ \mathsf{ or } ~~ k = n \\ \{0\} & \mathsf{otherwise}\ , \end{cases}</math> hence has Betti number 1 in dimensions 0 and {{mvar|n}}, and all other Betti numbers are 0. Its Euler characteristic is then {{nobr|{{math|χ {{=}} 1 + (−1)}}{{sup| {{mvar|n}} }} ;}} that is, either 0 if {{mvar|n}} is [[odd number|odd]], or 2 if {{mvar|n}} is [[even number|even]]. The {{mvar|n}} dimensional real [[projective space]] is the quotient of the {{mvar|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 {{mvar|n}} dimensional torus is the product space of {{mvar|n}} circles. Its Euler characteristic is 0, by the product property. More generally, any compact [[parallelizable manifold]], including any compact [[Lie group]], has Euler characteristic 0.<ref>{{cite book |author1-link=John Milnor |last1=Milnor |first1=J.W. |name-list-style=amp |last2=Stasheff |first2=James D. |year=1974 |title=Characteristic Classes |publisher=Princeton University Press}}</ref> The Euler characteristic of any [[closed manifold|closed]] odd-dimensional manifold is also 0.<ref>{{harvp|Richeson|2008|p=261}}</ref> The case for [[Orientability|orientable]] examples is a corollary of [[Poincaré duality]]. This property applies more generally to any [[compact space|compact]] [[topologically stratified space|stratified space]] all of whose strata have odd dimension. It also applies to closed odd-dimensional non-orientable manifolds, via the two-to-one [[Orientability#Orientable double cover|orientable double cover]]. == Relations to other invariants == The Euler characteristic of a closed [[Orientability|orientable]] [[Surface (topology)|surface]] can be calculated from its [[genus (mathematics)|genus]] {{mvar|g}} (the number of [[torus|tori]] in a [[connected sum]] decomposition of the surface; intuitively, the number of "handles") as :<math>\chi = 2 - 2g ~.</math> The Euler characteristic of a closed non-orientable surface can be calculated from its non-orientable genus {{mvar|k}} (the number of [[real projective plane]]s in a connected sum decomposition of the surface) as :<math>\chi = 2 - k ~.</math> 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 class]]es of [[vector bundle]]s. For closed [[Riemannian manifold]]s, 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 [[René Descartes|Descartes']] theorem that the "total [[defect (geometry)|defect]]" of a [[polyhedron]], measured in full circles, is the Euler characteristic of the polyhedron. [[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 space|compact]] [[Convex polyhedron|convex]] sets in {{math| ℝ{{sup|''n''}} }} that is "homogeneous of degree 0". ==Generalizations== 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 (discrete mathematics)|graph]] is the number of vertices minus the number of edges. More generally, one can define the Euler characteristic of any [[chain complex]] to be the alternating sum of the [[rank of an abelian group|ranks]] of the homology groups of the chain complex, assuming that all these ranks are finite.<ref>{{nlab|id=Euler+characteristic|title=Euler characteristic}}</ref> A version of Euler characteristic used in [[algebraic geometry]] is as follows. For any [[coherent sheaf]] <math>\mathcal{F}</math> on a proper [[Scheme (mathematics)|scheme]] {{mvar|X}}, one defines its Euler characteristic to be :<math> \chi ( \mathcal{F})= \sum_i (-1)^i h^i(X,\mathcal{F})\ ,</math> where <math>\ h^i(X, \mathcal{F})\ </math> is the dimension of the {{mvar|i}}-th [[sheaf cohomology]] group of <math>\mathcal{F}</math>. In this case, the dimensions are all finite by [[Coherent_sheaf_cohomology#Finite-dimensionality_of_cohomology|Grothendieck's finiteness theorem]]. This is an instance of the Euler characteristic of a chain complex, where the chain complex is a finite resolution of <math>\ \mathcal{F}\ </math> by acyclic sheaves. Another generalization of the concept of Euler characteristic on manifolds comes from [[orbifold]]s (see [[Euler characteristic of an orbifold]]). While every manifold has an integer Euler characteristic, an orbifold can have a fractional Euler characteristic. For example, the teardrop orbifold has Euler characteristic {{nobr|1 + {{sfrac|1| {{mvar|p}} }} ,}} where {{mvar|p}} is a prime number corresponding to the cone angle {{sfrac| 2{{pi}} | {{mvar|p}} }}. The concept of Euler characteristic of the [[reduced homology]] of a bounded finite [[partially ordered set|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 {{math|''μ''(0,1)}}, where {{mvar|μ}} is the [[Incidence algebra|Möbius function]] in that poset's [[incidence algebra]]. This can be further generalized by defining a [[rational number|rational valued]] Euler characteristic for certain finite [[category (mathematics)|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 (mathematics)|group]] or [[monoid]] {{mvar|G}} is {{sfrac|1| {{abs| {{mvar|G}} }} }}, and the Euler characteristic of a finite [[groupoid]] is the sum of {{sfrac|1| {{abs|{{mvar|G}}{{sub|{{mvar|i}}}} }}}}, where we picked one representative group {{mvar|G}}{{sub|{{mvar|i}}}} for each connected component of the groupoid.<ref>{{cite journal |first=Tom |last=Leinster |year=2008 |title=The Euler characteristic of a category |journal=Documenta Mathematica |volume=13 |pages=21–49 |doi=10.4171/dm/240 |doi-access=free |s2cid=1046313 |url=http://www.math.uiuc.edu/documenta/vol-13/02.pdf |via=[[University of Illinois, Urbana-Champaign|U. Illinois, Urbana-Champaign]] |archive-url=https://web.archive.org/web/20140606220358/http://www.math.uiuc.edu/documenta/vol-13/02.pdf |archive-date=2014-06-06}}</ref> == See also == * [[Euler calculus]] * [[Euler class]] * [[List of topics named after Leonhard Euler]] * [[List of uniform polyhedra]] ==References== === Notes === {{Reflist}} ===Bibliography=== {{refbegin|small=yes|colwidth=25em}} * {{cite book |author-link=David Richeson |last=Richeson |first=D.S. |year=2008 |title-link=Euler's Gem |title=Euler's Gem: The polyhedron formula and the birth of topology |publisher=Princeton University Press}} <br/> {{refend}} == Further reading == *Flegg, H. Graham; ''From Geometry to Topology'', Dover 2001, p. 40. == External links == *{{Mathworld | urlname=EulerCharacteristic | title=Euler characteristic }} *{{Mathworld | urlname=PolyhedralFormula | title=Polyhedral formula }} *{{SpringerEOM| title=Euler characteristic | id=Euler_characteristic | oldid=16333 | first=S.V. | last=Matveev }} *[https://www.youtube.com/watch?v=80EazC2_0Qo An animated version of a proof of Euler's formula using spherical geometry]. {{Topology}} [[Category:Algebraic topology]] [[Category:Topological graph theory]] [[Category:Polyhedral combinatorics]] [[Category:Articles containing proofs]] [[Category:Leonhard Euler]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:0
(
edit
)
Template:About
(
edit
)
Template:Center
(
edit
)
Template:Citation
(
edit
)
Template:Cite book
(
edit
)
Template:Cite journal
(
edit
)
Template:Cite web
(
edit
)
Template:Details
(
edit
)
Template:Harvp
(
edit
)
Template:Math
(
edit
)
Template:Mathworld
(
edit
)
Template:Mvar
(
edit
)
Template:Nlab
(
edit
)
Template:Nobr
(
edit
)
Template:Nowrap
(
edit
)
Template:Refbegin
(
edit
)
Template:Refend
(
edit
)
Template:Reflist
(
edit
)
Template:Right
(
edit
)
Template:See also
(
edit
)
Template:Sfrac
(
edit
)
Template:Short description
(
edit
)
Template:SpringerEOM
(
edit
)
Template:Sub
(
edit
)
Template:Topology
(
edit
)