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 more→→Brouwer 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 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 → Degree Theory for Maps of Spheres

Longest path: 111 steps · 487 total prerequisite topics

Prerequisites (3)

Leads To (4)