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

Spectral Sequences Introduction

Research Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
571prerequisites beneath it
See this on the map →
Chain Complexes and Exact SequencesDerived Functors+3 more→
spectral-sequences filtered-complexes pages convergence

Core Idea

A spectral sequence is a doubly-indexed family of abelian groups (or objects in an abelian category) with differentials that exhibit increasingly refined information, converging to a target homology group. Spectral sequences systematize the computation of derived functors and homological invariants through a sequence of approximations, and are among the most powerful computational tools in algebraic topology and homological algebra.

How It's Best Learned

Study the spectral sequence associated to a filtered complex and the Leray spectral sequence for sheaf cohomology. Understand the E₁, E₂, E∞ pages and how differentials at each stage carry information. Practice computing spectral sequences in concrete examples and understanding convergence criteria.

Common Misconceptions

Spectral sequences do not directly yield the answer; they require careful analysis of differentials and extension problems. Not every spectral sequence converges, and convergence properties can be subtle. The notion of 'convergence' itself requires precise formulation.

Explainer

From chain complexes and long exact sequences, you know that a short exact sequence of chain complexes 0 → A• → B• → C• → 0 produces a long exact sequence in homology, connecting H_*(A), H_*(B), and H_*(C) through connecting homomorphisms. This is powerful when you have an exact sequence. A spectral sequence generalizes this: when your chain complex has a filtration — a nested chain of subcomplexes F₀ ⊂ F₁ ⊂ ··· ⊂ Fₙ = C• — the spectral sequence systematically extracts the homology of C• from the homology of the layers Fₚ/Fₚ₋₁, one approximation at a time.

The construction begins with the E¹ page: E¹_{p,q} = H_{p+q}(Fₚ/Fₚ₋₁), the homology of the graded pieces (quotient complexes). These are the "first approximation" — they see only what happens within each layer of the filtration. At the E¹ page, there are differentials d₁: E¹_{p,q} → E¹_{p−1,q} that encode boundary maps between adjacent layers. Taking homology with respect to d₁ produces the E² page, which sees interactions across adjacent layers. At each page Eʳ, differentials dᵣ go from Eʳ_{p,q} to Eʳ_{p−r,q+r−1} (step r to the left and r−1 up), and the next page is their homology. As r increases, the differentials reach further across the bigraded diagram.

The sequence converges when all differentials above some page r₀ are zero — the pages stabilize. The E∞ page gives the associated graded of the filtered homology: E∞_{p,q} ≅ Fₚ H_{p+q}(C•)/Fₚ₋₁ H_{p+q}(C•). In favorable cases (e.g., when the filtration is finite and bounded), this determines H_*(C•) up to extension problems. The mental model is a sequence of approximations converging on the true answer: each page strips away noise and reveals finer structure, until only the essential homology information remains.

A landmark application is the Leray-Serre spectral sequence for a fibration F → E → B: the E² page is E²_{p,q} = H_p(B; H_q(F)) (cohomology of the base with coefficients in the fiber's cohomology), and the spectral sequence converges to H_*(E). This computes the cohomology of E — often a complicated space — from the cohomology of the simpler spaces B and F. For a product E = B × F, all differentials above E² vanish (the sequence collapses), and H_*(B × F) = H_*(B) ⊗ H_*(F) (Künneth formula). For a non-trivial fibration, non-zero higher differentials encode the twisting, and reading them correctly is the analytical work. The hard technical skill with spectral sequences is not building them but interpreting them: surviving the differentials, tracking which elements are killed at which page, and then solving the extension problems that arise when assembling E∞ back into H_*(C•) — since knowing the associated graded does not uniquely determine the group when extensions are non-trivial.

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 → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Universal Properties → Initial and Terminal Objects → Products and Coproducts → Equalizers and Coequalizers → Limits and Colimits → Pullbacks and Pushouts → Adjoint Functors → Free Objects → Projective Objects and Projective Covers → Homological Dimension in Categories → Exact Sequences in Categories → Ext Functors as Derived Hom → Tor Functors as Derived Tensor Product → Derived Functors → Derived Categories and Derived Equivalences → Spectral Sequences Introduction

Longest path: 98 steps · 571 total prerequisite topics

Prerequisites (5)

Leads To (0)

No topics depend on this one yet.