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 SequenceDegree 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 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 Spheres

Longest path: 108 steps · 476 total prerequisite topics

Prerequisites (2)

Leads To (3)