Topology
The fundamental group
The fundamental group records which loops in a space can be shrunk to a point and which cannot, turning geometric shape into algebra; it proves via winding number, the 2D Brouwer fixed-point theorem via a no-retraction argument, and classifies topological defects in liquid crystals and vortices.
IntuitionCan you shrink the loop to a point?
Tie a rubber band around your wrist and slide it off — it shrinks to nothing along the way, no problem. Now imagine a rubber band looped around a doughnut through the central hole: no matter how you slide, stretch, or wiggle it while keeping it on the surface, it can never shrink to a point without cutting it. The fundamental group is the precise algebraic tool that tells these two situations apart, and counts exactly how many "essentially different" ways a loop can wind around a space.
AdvancedPath homotopy and the fundamental group
Definition: Path homotopy
Two paths with the same endpoints (, ) are path-homotopic, written , if there is a continuous map with , , and , for all : a continuous family of paths that deforms into while keeping the endpoints fixed the whole time. A loop is a path with ; its equivalence class under is written .
Loops can be concatenated: traverses on (sped up) then on , provided . This operation respects path-homotopy classes, giving a well-defined product on the set of loop-classes based at a fixed point . This set with this product is the fundamental group : the identity is the class of the constant loop, and the inverse of is the class of traversed backwards, .
| Space | Why | |
|---|---|---|
| or a disk | trivial, | every loop shrinks straight-line to the center |
| circle | classified by winding number | |
| sphere | trivial, | any loop can slide off the sphere and shrink (dimension gives room) |
| torus | independent winding around each of the 2 holes-directions | |
| figure-eight | free group (non-abelian) | order of looping around each circle matters |
AdvancedTheorems
, via the map sending a loop to its winding number (degree) : the net number of times wraps around the circle counterclockwise.
Why is it true?
It converts a geometric, hard-to-pin-down question ("how many essentially different loops are there on a circle?") into ordinary integer arithmetic, and is the single computation that all of algebraic topology's winding-number arguments trace back to.
Proof
Step 1 — Set up the covering map. Let be , a continuous surjection where every point of has an evenly-covered neighborhood (a small arc's preimage under is a disjoint union of open intervals in , each mapped homeomorphically onto the arc). Fix basepoint .
Step 2 — Path lifting. Given any loop with , there is a unique continuous lift with and (construct it by covering with finitely many subintervals on which stays inside one evenly-covered neighborhood, and lift piece by piece, each time choosing the branch of continuing from the previous endpoint). Define (an integer since forces ).
Step 3 — Homotopy invariance. If via homotopy , the homotopy lifting property (proved the same way as path lifting, one strip at a time) gives a continuous lift with , and for all (constant, since it lifts the constant basepoint loop). Then is a continuous integer-valued function of (by the same argument as Step 2), hence constant; so . Thus is well-defined on homotopy classes .
Step 4 — Homomorphism property. For loops , lifting by first lifting to end at , then lifting starting from (a shifted copy of 's lift, valid since is invariant under integer translation) shows . So is a group homomorphism .
Step 5 — Bijectivity. Surjective: for any , is a loop with . Injective: if , the lift is a loop in based at (since ); is convex so the straight-line homotopy contracts to the constant path at rel endpoints, and composing with gives a path-homotopy from to the constant loop, so is trivial. Hence is a bijective homomorphism, i.e. an isomorphism .
Every continuous map from the closed disk to itself has a fixed point: some with .
Why is it true?
It guarantees solutions in an astonishing range of settings (Nash equilibria, differential equations, economic equilibrium) purely from the shape of , with no formula for needed at all — and the proof is a beautiful example of translating a hard analysis question into an easy algebra question about .
Proof
Step 1 — Suppose for contradiction has no fixed point. Then for every , so the ray from through is well-defined; let be the point where this ray exits the disk. Since varies continuously and never vanishes, is continuous.
Step 2 — is a retraction. For already on the boundary, the ray from through exits exactly at itself (since is already on the boundary and the ray only crosses the boundary once going outward from inside), so for all . Thus is a retraction: a continuous map fixing the subspace pointwise.
Step 3 — Retractions are impossible: apply the functor . Let be inclusion. Since (by definition of retraction), applying the fundamental group functor gives on the level of groups (functoriality: turns composition of continuous maps into composition of homomorphisms). But while is trivial (every loop in the convex disk contracts by the straight-line homotopy), so and compose to the zero map, which cannot equal the identity on (a nontrivial group) — contradiction.
Step 4 — Conclude. The contradiction in Step 3 shows no such retraction can exist, so the assumption in Step 1 (that has no fixed point) must be false. Hence every continuous has a fixed point.
If with open, path-connected, containing basepoint , and path-connected, then is the amalgamated free product : generated by and together, with relations only from how loops in the overlap are seen from each side.
Why is it true?
It is the main computational tool of the subject: it lets you build the fundamental group of a complicated space out of the (often much simpler) fundamental groups of overlapping pieces, which is exactly how the free group for the figure-eight is computed (two circles overlapping in a point).
Proof
A full proof requires careful combinatorial bookkeeping; here is the structural outline. Step 1 — Generators. Any loop in based at can be subdivided into finitely many sub-paths, each lying entirely in or entirely in (using a Lebesgue number argument on the open cover of the compact interval ), so can be written as a product of loops each representing an element of or (after connecting sub-path endpoints back to through chosen paths in , which is path-connected). This shows is generated by the images of and .
Step 2 — Relations. Any loop lying in represents, a priori, two possibly-different elements: (viewing as a loop in ) and (viewing it as a loop in ). Since is literally the same loop in , its images under and must agree; this forces exactly the amalgamation relations for every .
Step 3 — No further relations. A more delicate argument (subdividing homotopies the same way, using compactness of the square to get a finite grid where each cell lies in or ) shows that these amalgamation relations are the only relations needed: any two words in the generators representing the same element of can be related by a finite sequence of moves each justified by an amalgamation relation. This identifies exactly with the amalgamated free product.
AdvancedReal-World Applications and Worked Examples
In liquid crystals and superfluids, the order parameter (e.g. molecular orientation angle) at each point of space takes values in a space like ; a topological defect (a disclination line, an Abrikosov vortex) is a point around which the order parameter winds a nonzero number of times, classified exactly by the winding number of a small loop around the defect — and this integer is a robust "topological charge" that cannot change under any continuous perturbation, only by defects merging or annihilating in pairs of opposite charge. In robotics, when several cables or tethered robots must be routed around fixed obstacles in a plane, the different ways of routing correspond exactly to different elements of the fundamental group of the punctured plane, so two routings are interchangeable without re-threading exactly when their winding numbers around each obstacle agree.
Example: Winding number of a liquid-crystal defect
Near a point defect in a 2D liquid crystal, the molecular orientation angle is as a function of the polar angle around the defect (so orientation direction is given by the unit vector at angle ). As goes once around the defect (), compute the winding number of the loop in , i.e. the element of it represents.
Solution
Step 1 — Track the total angle change. As goes from to , goes from to .
Step 2 — Convert total angle to winding number. The winding number of a loop is the total change in divided by (since one full trip around corresponds to a change in angle): .
Step 3 — Interpret the non-integer result. A half-integer winding number is only possible because the target here is really the projective line (molecular orientation has no arrowhead, so and represent the same physical state) rather than honest ; the true winding number in , using the double cover , corresponds to this defect being a genuine stable "half-integer" disclination well known in nematic liquid crystals, distinct from integer-charge defects.
Example: Are two cable routings interchangeable?
Two tethered robots must route their cables from the same start point to the same end point in a plane with one fixed circular obstacle at the origin. Routing passes once counterclockwise around the obstacle before reaching the endpoint; routing passes once clockwise then once more counterclockwise around the obstacle. Using winding numbers in of the punctured plane , determine whether routing can be continuously deformed into routing without crossing the obstacle (i.e. without re-threading the cable).
Solution
Step 1 — Compute the winding number of routing . One counterclockwise loop around the obstacle contributes to the winding number, so , i.e. represents the element .
Step 2 — Compute the winding number of routing . One clockwise loop contributes and one counterclockwise loop contributes , and winding numbers add under concatenation (Step 4 of the proof), so .
Step 3 — Compare and conclude. Since , routings and represent different elements of , i.e. they are not path-homotopic rel endpoints; cannot be continuously deformed into without crossing the obstacle at some point. Physically: no matter how you wiggle cable while keeping both ends fixed and avoiding the obstacle, you can never make it look like cable — you would have to cut and re-thread it.
What is the winding number of for , as an element of ?
What is of the figure-eight space ?
A nematic liquid crystal defect has order parameter winding described by (order parameter in true , not ). What is its topological charge (winding number)?
Why does every continuous have a fixed point?
References
- Allen Hatcher (2002). Algebraic Topology
- James Munkres (2000). Topology
- Grigori Perelman (2002). The entropy of the Ricci flow and the Poincaré conjecture · arXiv:math/0211159
- Michael Farber (2003). Topological Robotics: Motion Planning in Projective Spaces