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

Degree Theory for Maps of Spheres

Research Depth 110 in the knowledge graph I know this Set as goal
5topics build on this
487prerequisites beneath it
See this on the map →
Homology of SpheresSingular Homology Groups+1 moreBrouwer Fixed Point Theorem (Homological Proof)Cellular Homology+2 more
algebraic-topology degree-theory maps-of-spheres winding-number

Core Idea

The degree of a continuous map f : Sn -> Sn is the integer d such that the induced map f_* : H_n(Sn) -> H_n(Sn) sends the generator [Sn] to d[Sn]. Since H_n(Sn) = Z, f_* is determined by this single integer. The degree classifies maps of spheres up to homotopy (two maps are homotopic if and only if they have the same degree), satisfies deg(g compose f) = deg(g) * deg(f), and has powerful consequences: the antipodal map has degree (-1)n+1, reflections have degree -1, and maps with nonzero degree are surjective.

Explainer

Degree theory assigns an integer to every continuous map f : Sn -> Sn, measuring "how many times f wraps the sphere around itself." Since H_n(Sn) = Z with generator [Sn] (the fundamental class), the induced homomorphism f_* : H_n(Sn) -> H_n(Sn) is multiplication by some integer d. This integer is the degree of f, denoted deg(f). It generalizes the classical winding number (for n = 1) to all dimensions and is the most important single invariant of maps between spheres.

The degree has a clean set of properties. Functoriality gives deg(g compose f) = deg(g) * deg(f). The identity has degree 1, and constant maps have degree 0. A reflection (negating one coordinate in Rn+1) has degree -1, since it reverses the orientation of Sn. The antipodal map a(x) = -x is the composition of (n+1) reflections (one for each coordinate), so deg(a) = (-1)n+1. This means the antipodal map is homotopic to the identity when n is odd and has degree -1 when n is even — a key fact underlying the Borsuk-Ulam theorem and the nonexistence of nowhere-vanishing vector fields on even-dimensional spheres.

The Hopf degree theorem states that two maps f, g : Sn -> Sn are homotopic if and only if deg(f) = deg(g). In other words, the degree is a complete homotopy invariant for self-maps of spheres. Combined with the Hurewicz theorem (pi_n(Sn) = H_n(Sn) = Z), this means the homotopy classes of maps Sn -> Sn are in bijection with the integers, with the degree providing the bijection. Every integer occurs as the degree of some map (e.g., the map z -> zd on S1, or its higher-dimensional analogues), so [Sn, Sn] = Z.

Degree theory has far-reaching applications. A map with nonzero degree is surjective (it must hit every point of the target sphere with nonzero algebraic multiplicity). This is the key observation in the Brouwer fixed point theorem: if f : Dn -> Dn had no fixed point, we could construct a map Sn-1 -> Sn-1 of degree 1 that is also a retraction, contradicting degree properties. The hairy ball theorem (no nowhere-vanishing continuous tangent vector field on S2k) follows from degree theory: such a vector field would give a homotopy from the identity to the antipodal map, but these have different degrees (1 versus -1) on even-dimensional spheres. The Borsuk-Ulam theorem and the computation of the Lefschetz number also rely on degree theory as their foundation.

For smooth maps, the degree has an alternative differential-topological characterization: deg(f) = sum of signs of the Jacobian determinant at preimages of a regular value. This connects the homological degree to the analytical notion of local orientation-preserving or orientation-reversing behavior. A map that wraps Sn around Sn d times, covering the target with the same orientation everywhere, has degree d. A map that covers the target with both orientations has degree equal to the algebraic sum. This geometric picture makes the degree intuitive: it counts "signed wrapping."

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 TheoremDegree Theory for Maps of Spheres

Longest path: 111 steps · 487 total prerequisite topics

Prerequisites (3)

Leads To (4)