The Euler Characteristic
What You’ll Learn
Section titled “What You’ll Learn”In this lesson you’ll compute , see why it is independent of the subdivision, use it to prove there are exactly five Platonic solids, and meet its consequences from graph planarity to the hairy ball theorem.
The Concept
Section titled “The Concept”The definition
Section titled “The definition”For a surface cut into vertices, edges and faces,
The remarkable fact is that the answer depends only on the surface, not on how you cut it up.
The figure computes for four polyhedra and two triangulations of the torus. The four polyhedra have wildly different counts - the tetrahedron has 4 vertices, the icosahedron has 12 - and every one gives 2. The two torus triangulations likewise give 0 with different counts.
That invariance is the entire content. The individual numbers are accidents of the subdivision; the alternating sum is a property of the space.
Why it is invariant
Section titled “Why it is invariant”Any two subdivisions of a surface have a common refinement, so it suffices to check that refining does not change . There are two elementary moves:
- Split an edge by adding a vertex in the middle. Then increases by 1 and increases by 1, so is unchanged.
- Split a face by adding an edge across it. Then increases by 1 and increases by 1, so again nothing changes.
Every refinement is a sequence of these, so survives all of them. ∎
More generally is a homotopy invariant, which is much stronger than being a homeomorphism invariant: spaces that can be continuously deformed into each other share it.
The values
Section titled “The values”| Space | |
|---|---|
| Point | 1 |
| Interval, disc | 1 |
| Circle | 0 |
| Sphere | 2 |
| Torus | 0 |
| Genus orientable surface | |
| Klein bottle | 0 |
| 1 | |
Note that the disc and the point share : they are homotopy equivalent, since a disc contracts to its centre. So cannot tell them apart, and that is a feature of it being a homotopy invariant rather than a defect.
The five Platonic solids
Section titled “The five Platonic solids”Here is the classical application, and it is a genuine impossibility proof.
Suppose a convex polyhedron has all faces regular -gons with meeting at each vertex. Counting each edge twice, once from each of its two faces, and each edge twice again from its two endpoints:
Substituting into :
Since we need , and both . Enumerating:
| Solid | |
|---|---|
| tetrahedron | |
| cube | |
| octahedron | |
| dodecahedron | |
| icosahedron |
Any other pair fails the inequality: gives exactly , and anything larger gives less. Exactly five, and Euler’s formula is why. Nothing about angles or lengths was used.
Graph planarity
Section titled “Graph planarity”For a connected planar graph drawn without crossings, where the outer region counts as a face. Two corollaries:
- A simple planar graph satisfies .
- , the complete graph on 5 vertices, has and , so it is not planar.
- is not planar either, by a similar count using that its shortest cycle has length 4.
Those two graphs are exactly the obstructions, by Kuratowski’s theorem: a graph is planar iff it contains neither as a subdivision.
This is where the Königsberg bridges lead: circuit board layout, and whether a network can be drawn on a single layer, is decided by these counts.
The hairy ball theorem
Section titled “The hairy ball theorem”Poincaré–Hopf theorem. For a smooth vector field on a closed surface with isolated zeros, the sum of the indices of the zeros equals .
Since , a vector field on the sphere must have a zero:
Hairy ball theorem. There is no nowhere-zero continuous tangent vector field on .
You cannot comb a sphere flat. On the torus, where , you can - comb it around the hole. The reason one is possible and the other is not is a single integer.
The meteorological consequence is real: at any moment there is a point on Earth with zero horizontal wind, which is why there is always a cyclone or an eye somewhere.
Worked Examples
Section titled “Worked Examples”Example 1: Verify for the cube and the icosahedron.
Solution. Cube: , , , so ✓
Icosahedron: , , , so ✓
Completely different counts, same answer, because both are subdivisions of a sphere. ∎
Example 2: Compute for a triangulated torus and confirm it is 0.
Solution. Take a grid on the square with opposite edges identified. The 9 grid squares each split into 2 triangles, giving .
After identification, the grid has vertices. Each vertex has degree 6 in the triangulated grid, and counting each edge from both ends gives .
matching the figure’s first torus row ✓ ∎
Example 3: Find the genus of a surface with .
Solution. For an orientable closed surface, :
A four-holed torus. ∎
Example 4: Prove there are at most five Platonic solids.
Solution. As derived above, regularity forces
If then , so . If then , so . If then , so . If then and , giving a sum of at most - not enough.
Answer: five possibilities, and all five are realized. ∎
Example 5: Show is not planar.
Solution. has and .
A simple planar graph must satisfy , which here gives .
∎
A counting argument settles a drawing question, with no attempt to try layouts.
Example 6: Explain the hairy ball theorem via .
Solution. By Poincaré–Hopf, the indices of the zeros of any smooth tangent vector field on a closed surface sum to .
On that sum must be 2. A nowhere-zero field has no zeros, so its index sum is 0.
∎
On the torus , so a nowhere-zero field is not obstructed, and indeed the field pointing around the hole works.
Example 7: Compute of a disc with three holes.
Solution. Start with a disc, . Removing an open disc from a surface lowers by 1, since it deletes one face.
This is a “pair of pants” with an extra leg, and it has 4 boundary circles. ∎
Real-World Applications
Section titled “Real-World Applications”Circuit board design. Planarity decides whether a circuit fits on one layer, and the bound gives a quick impossibility test before any layout is attempted.
Mesh validation. Graphics and CAD software computes from a mesh’s vertex, edge and face counts to detect holes, cracks and duplicated geometry. An unexpected value means the mesh is broken.
Molecular topology. Counting atoms, bonds and rings gives an Euler-type relation, and it is used to determine the number of independent rings in a molecular structure.
Meteorology. The hairy ball theorem guarantees a point of zero horizontal wind on Earth at all times, so there is always at least one cyclonic centre.
Antenna and sensor arrays. Vector field constraints from Poincaré–Hopf limit how field patterns can be arranged over a closed surface, which constrains conformal antenna designs.
Robotics and control. Obstructions to globally continuous control laws on a configuration space are often Euler characteristic obstructions, which is why some systems provably require switching between controllers.
Retrying will remove your ✅ checkmark until you pass again.