Van Kampen's Theorem - Key Proof
We provide a detailed proof of Van Kampen's theorem, establishing the fundamental tool for computing fundamental groups via decomposition.
Theorem: Let with path-connected and . Then .
Step 1: Surjectivity
We first show that the natural map is surjective.
Let be represented by a loop . By compactness and the Lebesgue number lemma, we can partition such that each lies entirely in or entirely in .
Construct paths and connecting paths from to in (using path-connectivity). The loop is homotopic to the product:
Each term is a loop based at lying entirely in or , hence in the image of . Therefore is in the image, proving surjectivity.
Step 2: Defining the inverse
To show injectivity (and construct an explicit inverse), we use the universal property. Suppose maps to the trivial element in .
This means the corresponding loop in is nullhomotopic via some with , , and .
Step 3: Refining the homotopy
Subdivide into small squares such that each square maps entirely into or . This uses compactness and the Lebesgue number lemma again.
For each square:
- If it maps to , the corresponding portion of can be contracted in
- If it maps to , the corresponding portion contracts in
- Squares mapping to handle transitions
Step 4: Algebraic rewriting
Track how the subdivision allows us to rewrite in the amalgamated product. Each square contributes relations showing that adjacent pieces (one in , one in ) agree on their overlap in .
The homotopy provides a sequence of moves in the amalgamated product: where and . The contractibility in translates to relations showing this product equals the identity in the amalgamated product.
Step 5: Conclusion
Since is surjective and injective, it is an isomorphism. The construction is natural in the sense that it commutes with continuous maps, confirming functoriality. ∎
The key technical tool is the Lebesgue number lemma: for an open cover of a compact metric space, there exists such that every set of diameter less than is contained in some element of the cover. This allows us to make the decomposition fine enough.
The proof generalizes to arbitrary covers: use the same subdivision technique, but track multiple open sets. The colimit in category theory handles the bookkeeping systematically.