Skip to content
ISEGORIABenjamin Haire

ISEGORIA / MATH ENCYCLOPEDIA

Algebraic topology: detecting holes

Build complexes, distinguish cycles from holes, and vary scale.

Before you begin: Sets, graphs, and elementary linear algebra

Predict, manipulate, then check your reasoning against the example and question. Graphs illustrate the mathematics; they do not replace a proof.

1. Build a complex

Build a square one simplex at a time: four vertices, the four sides, a diagonal, then the two triangles. Beside the picture are the boundary matrices over the two-element field. Watch each new edge either join two components, raising rank ∂₁ and lowering β₀, or close a cycle, raising β₁; each face turns one cycle into a boundary.

Worked example. After the four sides, V = 4, E = 4 and rank ∂₁ = 3, so β₀ = 1 and β₁ = 1. The diagonal makes β₁ = 2, and the two triangles bring it back to 0.

Watch out. A drawn loop is not necessarily a homological hole: it may bound a filled surface.

Why does filling a face never change the number of components?

β₀ = V − rank ∂₁ does not involve faces at all: a face's boundary already lies in one component.

Reference: Allen Hatcher · Algebraic Topology, Chapter 2

2. Holes across scales

Put a disk of diameter ε around each point, join two points when their disks touch, and fill every triangle whose three edges are present. As ε grows, components merge and loops are born and then filled. The barcode records each feature from the ε where it appears to the ε where it dies, computed by reducing the boundary matrix over the two-element field. Drag the points to reshape the cloud.

Worked example. For eight evenly spaced points on the unit circle, adjacent points join at ε ≈ 0.765, giving an octagon with β₁ = 1. The loop survives until ε ≈ 1.848, when triangles through every third point fill it.

Watch out. Only the two-skeleton is displayed. It suffices for H₀ and H₁, but not for higher-dimensional homology.

Why can a larger threshold destroy a hole?

New triangles can fill a cycle that was not a boundary before, so the class dies in H₁.

Reference: Allen Hatcher · Algebraic Topology, Chapter 2

3. Euler characteristic

Choose a triangulated surface and count vertices, edges and faces. The alternating sum V − E + F equals the alternating sum of Betti numbers, computed here from the boundary matrices. Press Play to place the triangles one at a time: the two sums agree at every stage, not only for the finished surface.

Worked example. A tetrahedron surface has 4 − 6 + 4 = 2 with β = (1, 0, 1). The 3 by 3 torus has 9 − 27 + 18 = 0 with β = (1, 2, 1).

Watch out. The sphere here is the surface of the tetrahedron, not the solid. Betti numbers are computed over the two-element field; χ is the same over any field.

Why does a disk have Euler characteristic one?

It has one component and no positive-dimensional homology.

Reference: Allen Hatcher · Algebraic Topology, Chapter 2

Continue exploring

Linear algebra: the geometry of transformationsFourier analysis: functions made of wavesDynamical systems: stability and chaosOptimization: the geometry of the best choiceProbability: learning from uncertaintyGroup theory: symmetry as algebraNumerical analysis: when computation misleadsNumber theory: patterns in the integersGraph theory: routes, trees, and networksPartial differential equations: fields in motionInformation theory: uncertainty and codesCalculus of variations: paths and principlesClassical mechanics: motion and forcesElectromagnetism: fields and inductionOptics: rays, waves, and colourThermodynamics: energy, work, and entropyQuantum mechanics: amplitudes and spinComplex analysis: maps, residues, and harmonic fieldsFluid dynamics: flow, pressure, and vorticityStatistics and inference: signals in dataSpecial relativity: space, time, and lightDifferential geometry: curvature and shapeStatistical mechanics: microstates and temperatureMeasure theory: size, approximation, and convergenceMarkov chains: transition, stationarity, and absorptionDifferential forms: circulation, curl, and pullbacksGeneral relativity: curvature, clocks, and lightFunctional analysis: norms, projections, and operatorsPlasma physics: screening, orbits, and wavesLie groups and Lie algebras: continuous symmetryHamiltonian mechanics: phase space and its geometryStochastic processes: Brownian motion and noiseSolid-state physics: waves in a crystalControl theory: feedback, poles, and stabilityLogic and computability: what can be computedHyperbolic geometry: where parallels multiplyRigid-body dynamics: spinning, tumbling, precessingElliptic curves: geometry that addsAtomic physics: orbitals and spectraQuaternions: rotation as multiplicationPush-forward and pullback: integrating through a mapKnot theory: telling tangles apartFractal geometry: dimension between the integersQuantum information: entanglement and its limitsCosmology: the expanding universeCellular automata: computation from local rulesComplex systems: order from many simple partsGalois theory: the symmetry of equationsMagnetism and the Ising model: order from alignmentOscillators and escapements: how a watch keeps timeGears and mechanisms: transmitting motion exactlyQuartz resonators: a crystal that keeps timeLoudspeakers: the moving-coil driverFilters and crossovers: splitting sound between driversRoom acoustics: the room is part of the speakerWavelets: zooming in on a signalLaser physics: light that copies itselfRepresentation theory: groups acting as matricesSemiconductor physics: bands, doping, junctions

Back to the math encyclopedia