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

Homology of Spheres

Research Depth 107 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
476prerequisites beneath it
See this on the map →
Singular Homology GroupsThe Mayer-Vietoris Sequence→→Degree Theory for Maps of SpheresHigher Homotopy Groups+1 more
algebraic-topology spheres homology-computation suspension

Core Idea

The n-sphere Sn has singular homology H_k(Sn) = Z for k = 0 and k = n, and H_k(Sn) = 0 otherwise. This computation, established via the Mayer-Vietoris sequence or the long exact sequence of the pair (Dn, Sn-1), is one of the most important results in algebraic topology. It provides the foundation for degree theory, the Brouwer fixed point theorem, and the classification of maps between spheres, and it reveals that each sphere has exactly one nontrivial "hole" in its own dimension.

Explainer

The computation of the homology of spheres is a cornerstone of algebraic topology: nearly every major theorem and application refers back to H_*(Sn). The result is clean and beautiful: H_k(Sn) is Z when k = 0 or k = n, and zero otherwise. The 0-dimensional homology H_0(Sn) = Z reflects that Sn is connected (for n >= 1; S0 consists of two points, giving H_0(S0) = Z2). The n-dimensional homology H_n(Sn) = Z detects the single "n-dimensional hole" — the cavity enclosed by the sphere. All intermediate homology vanishes: Sn has no holes of any dimension other than 0 and n.

The Mayer-Vietoris induction is the most elegant computation method. Decompose Sn into two open hemispheres U and V, each contractible (they deformation retract to a point). Their intersection U intersect V deformation retracts to the equatorial (n-1)-sphere Sn-1. The Mayer-Vietoris long exact sequence reads: ... -> H_k(U) direct sum H_k(V) -> H_k(Sn) -> H_{k-1}(Sn-1) -> H_{k-1}(U) direct sum H_{k-1}(V) -> ... Since U and V are contractible, H_k(U) = H_k(V) = 0 for k > 0, and the sequence collapses to isomorphisms H_k(Sn) = H_{k-1}(Sn-1) for k >= 2. Starting from S0 (two points with H_0 = Z2, all higher homology zero), we get: H_1(S1) = H_0(S0)/corrections = Z, H_2(S2) = H_1(S1) = Z, and inductively H_n(Sn) = Z.

An alternative approach uses the long exact sequence of the pair (Dn, Sn-1). Since the disk Dn is contractible, H_k(Dn) = 0 for k > 0. The long exact sequence ... -> H_k(Dn) -> H_k(Dn, Sn-1) -> H_{k-1}(Sn-1) -> H_{k-1}(Dn) -> ... gives isomorphisms H_k(Dn, Sn-1) = H_{k-1}(Sn-1) for k >= 2. The relative homology H_k(Dn, Sn-1) is isomorphic to the reduced homology of the quotient Dn/Sn-1 = Sn (by excision-type arguments), giving the same inductive formula. Both methods reduce to the same recursion and yield the same answer.

The fundamental class [Sn], the generator of H_n(Sn), is the homological incarnation of the sphere's orientation. For any triangulation of Sn, the fundamental class is represented by the sum of all n-simplices with orientations consistent with the global orientation. The fact that H_n(Sn) = Z means that every n-cycle on Sn is a multiple of the fundamental class — it wraps around the sphere some integer number of times. This integer is the foundation of degree theory: for a continuous map f : Sn -> Sn, the induced map f_* : H_n(Sn) -> H_n(Sn) is multiplication by an integer deg(f), the degree of f. The degree is the single most important homotopy invariant of such maps and connects to winding numbers, Brouwer's theorem, and the Borsuk-Ulam theorem.

The homology of spheres also reveals a key limitation of the fundamental group and motivates the study of higher-dimensional invariants. The sphere Sn for n >= 2 has trivial fundamental group (every loop can be contracted to a point), yet its homology is nontrivial in dimension n. The fundamental group is blind to these higher-dimensional holes. This is precisely why homology (and later, higher homotopy groups and cohomology) are essential: they detect topological features that no single algebraic invariant can capture alone. The spheres, as the simplest spaces with holes of each dimension, serve as the calibration targets for all these invariants.

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

Longest path: 108 steps · 476 total prerequisite topics

Prerequisites (2)

Leads To (3)