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

The Hurewicz Theorem

Research Depth 109 in the knowledge graph ☐ I know this ☆ Set as goal
6topics build on this
486prerequisites beneath it
See this on the map →
Higher Homotopy GroupsSingular Homology Groups+1 more→→Degree Theory for Maps of Spheres
algebraic-topology hurewicz-theorem homotopy-groups homology

Core Idea

The Hurewicz theorem is the fundamental bridge between homotopy groups and homology groups. It states: if X is a path-connected space with pi_k(X) = 0 for all k < n (where n >= 2), then H_k(X) = 0 for k < n and the Hurewicz homomorphism h : pi_n(X) -> H_n(X) is an isomorphism. In the n = 1 case, h : pi_1(X) -> H_1(X) is abelianization. The theorem says that the "first nontrivial" homotopy group always equals the corresponding homology group, providing a computable entry point into the homotopy groups of a space.

Explainer

The Hurewicz homomorphism h : pi_n(X, x_0) -> H_n(X; Z) is defined by sending the homotopy class of a based map f : (Sn, s_0) -> (X, x_0) to the homology class f_*([Sn]) in H_n(X), where [Sn] in H_n(Sn) = Z is the fundamental class. Intuitively, h takes a "homotopy-theoretic n-sphere in X" and measures its "homological shadow." The Hurewicz theorem states that in the first nontrivial dimension, this shadow captures everything.

The n = 1 case: for any path-connected space X, h : pi_1(X) -> H_1(X) is surjective with kernel [pi_1, pi_1] (the commutator subgroup), so H_1(X) = pi_1(X)ab (the abelianization). This is why H_1 of the figure-eight is Z2 (the abelianization of the free group F_2), and H_1 of the torus is Z2 (the abelianization of Z2, which is already abelian). The abelianization perspective shows that H_1 captures the "abelian shadow" of the fundamental group, which is precisely the information encoded in the commutative group structure of homology.

The n >= 2 case (the main theorem): suppose X is (n-1)-connected, meaning path-connected with pi_k(X) = 0 for all 1 <= k <= n-1. Then H_k(X) = 0 for 1 <= k <= n-1, and h : pi_n(X) -> H_n(X) is an isomorphism. The condition "(n-1)-connected" means the space has no holes detectable by spheres of dimension less than n, so the first interesting homotopy group is pi_n. The theorem says that this first interesting homotopy group agrees with the corresponding homology group — the abelianization that normally makes homology a coarser invariant has no effect in the first nontrivial dimension (since pi_n is already abelian for n >= 2).

The most fundamental application is to spheres. Sn is (n-1)-connected (all homotopy groups below dimension n vanish, by cellular approximation or a direct argument). The Hurewicz theorem gives pi_n(Sn) = H_n(Sn) = Z, generated by the identity map. This is the rigorous foundation of degree theory: the homotopy class of a map f : Sn -> Sn is completely determined by the integer deg(f), which equals the induced map on the Z factor. The degree is simultaneously a homological quantity (how f_* acts on H_n) and a homotopical quantity (which class f represents in pi_n), and the Hurewicz theorem guarantees their agreement.

The theorem has a relative version: if (X, A) is an (n-1)-connected pair with A simply connected and n >= 2, then H_k(X, A) = 0 for k < n and h : pi_n(X, A) -> H_n(X, A) is an isomorphism. Combined with the long exact sequences of homotopy and homology, this provides tools for comparing the two theories systematically. However, the Hurewicz theorem gives information only at the "edge" — the first nontrivial dimension. Beyond that, homotopy groups and homology groups can diverge wildly. The computation of pi_3(S2) = Z (while H_3(S2) = 0) is the simplest example of this divergence, and it shows that homotopy groups encode qualitatively different information from homology in higher dimensions.

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 → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Classification of Finite Abelian Groups → Chain Complexes and the Boundary Operator → Exact Sequences in Homological Algebra → The Snake Lemma → Relative Homology and the Long Exact Sequence of a Pair → The Excision Theorem → The Mayer-Vietoris Sequence → Homology of Spheres → Higher Homotopy Groups → The Hurewicz Theorem

Longest path: 110 steps · 486 total prerequisite topics

Prerequisites (3)

Leads To (1)