Homology and Euler characteristic
Turn cycles and boundaries into computable invariants, with coefficients and finiteness assumptions stated explicitly.
On this page
The question for today
What you’ll understand
- Compute homology as cycles modulo boundaries.
- Explain why a boundary of a boundary vanishes.
- Calculate Euler characteristic from cells or homology over a field.
Counting holes from a picture becomes unreliable in higher dimensions. Homology replaces that visual task by algebra. Chains are formal combinations of geometric pieces, their boundaries fit into linear maps, and cycles differing by a boundary represent the same class. Field coefficients make finite examples accessible through matrix rank. The Euler characteristic compresses an alternating list of homology dimensions into one number, useful but far from a complete description of topology.
Chains record oriented pieces with coefficients
In a finite simplicial complex, choose orientations for edges, triangles, and higher simplices. A k-chain is a formal sum of k-simplices with coefficients in a declared ring; use real coefficients first. The boundary of an oriented edge [a,b] is b−a, and the boundary of an oriented triangle [a,b,c] is [b,c]−[a,c]+[a,b]. Applying the boundary operation again cancels each vertex twice with opposite signs. The same alternating-face rule makes the boundary of a boundary zero in every degree.
A cycle is a chain with zero boundary. A boundary is a chain that is itself the boundary of a higher-dimensional chain. Since ∂²=0, every boundary is a cycle. Homology identifies cycles whose difference is a boundary. The perimeter of an unfilled triangle gives a nontrivial one-cycle, while filling the triangle makes that same perimeter a boundary and kills its homology class. Thus the available two-dimensional pieces matter even when the visible edge loop is unchanged.
Coefficients affect what survives
With field coefficients, the dimension of Hₖ is the kth Betti number. For a finite complex it can be computed as the number of k-simplices minus the ranks of the two adjacent boundary maps. With integer coefficients, homology groups can also contain torsion, such as an element killed by multiplication by two. Passing to real coefficients loses that torsion information. For example, the real projective plane has first integer homology ℤ/2, while its first real homology is zero.
Over the field with two elements, signs disappear because one equals minus one. This simplifies computation but changes some answers: the real projective plane has a nonzero first homology group over that field. Coefficients must therefore accompany a homology claim. Singular homology extends the construction beyond a chosen triangulation, and comparison theorems show agreement with simplicial homology in the appropriate setting. Invariance under homotopy is a theorem, not a consequence of simply counting arbitrary drawing elements.
Euler characteristic remembers an alternating total
For a finite complex, rank-nullity makes the boundary-map ranks cancel in the alternating sum, proving the equality between alternating cell counts and alternating Betti numbers. Subdividing a triangulation changes its counts but preserves that sum. A connected circle has one independent component and one independent one-cycle, giving Euler characteristic zero. A connected sphere has one component and one two-dimensional homology class, giving Euler characteristic two. These conclusions use ordinary, unreduced homology.
Equal Euler characteristics do not imply homeomorphism or equal homology. A point and a circle joined to a two-sphere at one point both have Euler characteristic one, although their first and second Betti numbers differ. For an infinite complex, subtracting infinite cell counts is undefined; additional finiteness or convergence structure is necessary. Combine this total with the graded homology information and the declared class of spaces.
Work it through
Fill one loop and watch a class disappear
Compute real homology and Euler characteristic for the three-edge perimeter of a triangle, then add its filled interior as one two-simplex.
For the perimeter, the chain dimensions are dim C₀=3 and dim C₁=3. The edge boundary map has rank two: its image consists of vertex combinations whose coefficients sum to zero. Thus H₀ has dimension 3−2=1.
There are no two-chains, so H₁ has dimension 3−2−0=1. The Euler characteristic is 3−3=0, also 1−1=0 from the Betti numbers.
Add one oriented triangular face. Its boundary is the nonzero perimeter cycle, so ∂₂ has rank one. Now b₁=3−2−1=0 and b₂=1−1=0, while b₀ stays one. Euler characteristic becomes 3−3+1=1.
The unfilled perimeter has (b₀,b₁)=(1,1) and χ=0. The filled triangle has only b₀=1 and χ=1.
The living notebook
Explore the model
Interactive lab · vectors
A cycle depends on its ambient space
Set magnitude one and sweep the angle from −180° to 180° to trace a circle with the vector endpoint. Now decrease magnitude to zero. Predict why this contraction is allowed in the whole plane but not in the punctured plane: its final point is excluded there. The single-vector lab illustrates this family of loops; it neither builds chains nor computes homology matrices.
- x component
- 1.393
- y component
- 0.975
- Magnitude
- 1.7
Playback traces a fixed vector and its projections. Angle and magnitude set the geometry; the moving marker does not change them. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA circle bounds a disk in the plane, but no such filling lies entirely inside the punctured plane. The ambient space determines which cycles become boundaries.
Pause & reason
Check your understanding
Your turn
Try it yourself
A connected finite graph has five vertices and six edges, with no higher-dimensional cells. Find its real Betti numbers and Euler characteristic.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The boundary map from edges to vertices of a connected graph has rank V−1.
Compare with the solution
Its boundary rank is four, so b₀=5−4=1 and b₁=6−4=2. There are no higher chain groups and hence no higher homology. Euler characteristic is 5−6=−1, agreeing with 1−2=−1. Connectedness is needed for the rank-four assertion; disconnected graphs have a different rank.
Keep the idea
Take it with you
- Homology measures cycles modulo boundaries through maps satisfying ∂²=0.
- Coefficient choices can reveal or erase torsion information.
- Euler characteristic is a finite alternating total, not a complete topological classification.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.