A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

van Kampen's Theorem

Research Depth 84 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
425prerequisites beneath it
See this on the map →
The Fundamental GroupCovering Spaces+2 more→→Classification of Compact Surfaces
van-kampen fundamental-group amalgamated-product

Core Idea

van Kampen's theorem computes the fundamental group of a space glued from pieces: π₁(X) ≅ π₁(U) *_{π₁(U∩V)} π₁(V) when X = U ∪ V with overlapping U and V. This is the fundamental tool for computing fundamental groups of complex spaces from simpler pieces.

Explainer

You know the fundamental group π₁(X, x₀): equivalence classes of loops based at x₀, where two loops are equivalent if one can be continuously deformed into the other (homotopy). Computing π₁ directly from the definition requires finding all loops and checking which homotopies exist, which is intractable for any but the simplest spaces. Van Kampen's theorem is the systematic computational engine: it expresses the fundamental group of a space assembled from pieces in terms of the fundamental groups of those pieces.

The setup: suppose X = U ∪ V where U and V are open, path-connected subsets of X, and their intersection U ∩ V is also path-connected (all three share a common basepoint). Then π₁(X) is the amalgamated free product π₁(U) \*_{π₁(U∩V)} π₁(V). Concretely, this means: take all the loops from U and all the loops from V as generators, and impose exactly the relations that come from U ∩ V — any loop in U ∩ V that looks like one loop when viewed inside U must equal the "same" loop when viewed inside V. No other relations are imposed.

The wedge sum S¹ ∨ S¹ (two circles joined at a point) illustrates the theorem cleanly. Take U to be an open neighborhood of the first circle (slightly overlapping the second near the join point), and V to be an open neighborhood of the second circle. Each of U and V deformation-retracts to a circle, so π₁(U) ≅ π₁(V) ≅ ℤ. The intersection U ∩ V deformation-retracts to the join point, which is simply connected: π₁(U ∩ V) = {e}. The amalgamated free product over a trivial group is just the free product ℤ \* ℤ, which is the free group on two generators. So π₁(S¹ ∨ S¹) ≅ ℤ \* ℤ — loops on the first circle and loops on the second circle generate independent, non-commuting elements.

The torus T² = S¹ × S¹ gives a richer example. Represent the torus as a square with opposite edges identified (top = bottom with label a, left = right with label b). Remove a small open disk from the interior to get U, and let V be a small open disk around the center. U deformation-retracts to the boundary square (a loop aba⁻¹b⁻¹), V is simply connected, and U ∩ V is a circle (simply connected intersection gives a free product, but the loop of U ∩ V bounds a disk in V). Van Kampen then gives π₁(T²) = ⟨a, b | aba⁻¹b⁻¹ = e⟩ = ℤ × ℤ: the two generators commute, reflecting the fact that going around the torus one way then the other way is homotopic to going the other way first. The theorem reduces a global topological question to an algebraic calculation from local data.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Neighborhood Bases → Continuity in Topological Spaces → Homotopy of Continuous Maps → Homotopy of Paths → Path Connectedness → Homotopy of Paths → The Fundamental Group → Simply Connected Spaces → Covering Spaces → van Kampen's Theorem

Longest path: 85 steps · 425 total prerequisite topics

Prerequisites (4)

Leads To (1)