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 moreDegree 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for GroupsDirect Products of GroupsClassification of Finite Abelian GroupsChain Complexes and the Boundary OperatorExact Sequences in Homological AlgebraThe Snake LemmaRelative Homology and the Long Exact Sequence of a PairThe Excision TheoremThe Mayer-Vietoris SequenceHomology of SpheresHigher Homotopy GroupsThe Hurewicz Theorem

Longest path: 110 steps · 486 total prerequisite topics

Prerequisites (3)

Leads To (1)