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

Homotopy Exact Sequence of a Fibration

Research Depth 109 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
490prerequisites beneath it
See this on the map →
Higher Homotopy GroupsCW Complexes+1 more→→The Borsuk-Ulam Theorem
algebraic-topology fibrations fiber-bundles long-exact-sequence homotopy

Core Idea

A fibration p : E -> B with fiber F gives rise to a long exact sequence of homotopy groups: ... -> pi_n(F) -> pi_n(E) -> pi_n(B) -> pi_{n-1}(F) -> ... -> pi_1(B) -> pi_0(F) -> pi_0(E). This sequence relates the homotopy groups of the total space, base, and fiber, and is the primary computational tool for homotopy groups. It generalizes the long exact sequence of a covering space (where the fiber is discrete) and is analogous to the long exact sequence of a pair in homology.

Explainer

A fibration is a continuous map p : E -> B satisfying the homotopy lifting property (HLP): given any homotopy h : X x [0,1] -> B and a lift h_0 : X -> E of the starting map (p compose h_0 = h(-, 0)), there exists a homotopy H : X x [0,1] -> E lifting the entire homotopy (p compose H = h). Intuitively, any continuous deformation in the base can be "tracked" in the total space. The fiber F = p-1(b_0) over a basepoint b_0 is the preimage, and under mild conditions (B path-connected), all fibers are homotopy equivalent.

The long exact sequence of a fibration is the analog of the long exact sequence of a pair for homotopy groups. For a fibration F -> E -> B with connected base B, there is an exact sequence: ... -> pi_n(F) -i_*-> pi_n(E) -p_*-> pi_n(B) -partial-> pi_{n-1}(F) -> ... -> pi_1(E) -p_*-> pi_1(B) -partial-> pi_0(F) -> pi_0(E). The maps i_* and p_* are induced by the inclusion F hookrightarrow E and the projection p : E -> B. The connecting homomorphism partial : pi_n(B) -> pi_{n-1}(F) is constructed using the homotopy lifting property: given a based map f : Sn -> B representing a class in pi_n(B), lift the induced map Dn -> B to a map Dn -> E. The restriction of this lift to the boundary Sn-1 = boundary(Dn) lands in the fiber F, giving a class in pi_{n-1}(F).

The most celebrated application is to the Hopf fibration S1 -> S3 -> S2. The long exact sequence reads: ... -> pi_n(S1) -> pi_n(S3) -> pi_n(S2) -> pi_{n-1}(S1) -> ... Since pi_k(S1) = 0 for k >= 2 (the universal cover R is contractible), the sequence gives isomorphisms pi_n(S3) = pi_n(S2) for n >= 3. In particular, pi_3(S2) = pi_3(S3) = Z. This is how the nontrivial pi_3(S2) is computed: not by direct construction, but by recognizing S2 as the base of the Hopf fibration and using the exact sequence to transfer the computation to the simpler space S3.

Covering spaces are a special case: a covering p : E -> B is a fibration with discrete fiber F. Since discrete spaces have trivial higher homotopy groups (pi_n(F) = 0 for n >= 1), the long exact sequence gives isomorphisms pi_n(E) = pi_n(B) for n >= 2 and a short exact sequence 1 -> pi_1(E) -> pi_1(B) -> pi_0(F) for n = 1. This recovers the classical theory: a covering space has the same higher homotopy groups as the base, and its fundamental group is a subgroup of pi_1(B) with index equal to the number of sheets.

The path-loop fibration is another fundamental example: for any pointed space (B, b_0), the path space PB = {paths in B starting at b_0} is contractible, and the endpoint evaluation map PB -> B is a fibration with fiber Omega B = {loops in B based at b_0} (the loop space). Since PB is contractible, the long exact sequence gives isomorphisms pi_n(B) = pi_{n-1}(Omega B) for all n >= 1. This "looping" operation shifts homotopy groups down by one dimension and is one of the most important structural results in homotopy theory. It underpins the theory of iterated loop spaces, spectra, and stable homotopy theory — the modern framework for understanding the deep structure of homotopy groups.

Practice Questions 4 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 → Homotopy Exact Sequence of a Fibration

Longest path: 110 steps · 490 total prerequisite topics

Prerequisites (3)

Leads To (1)