Convergence of Spectral Sequences

Executive summary

Convergence is a hypothesis, not a conclusion

A spectral sequence converges when every entry stabilises and the stable page is the associated graded of a filtration of the intended target. For first-quadrant sequences with a bounded filtration this is automatic. Outside that setting it must be established, and the standard failure is a non-vanishing lim¹ term: each page behaves correctly and the limit still fails to compute the target. Convergence statements always carry hypotheses, and they are not decorative.

Learning objectives

State when convergence is automatic.
Identify the role of boundedness and exhaustiveness.
Recognise collapse and degeneration.
Name the standard failure modes.

Section 01The easy case

If the spectral sequence is first-quadrant — entries vanish outside p, q ≥ 0 — then for each bidegree the differentials in and out vanish for large r, so the entry stabilises after finitely many pages. With a bounded filtration on the target, convergence follows.

Why first-quadrant is the comfortable setting

Differentials on page r have bidegree (r, 1−r), so for large r either the source or the target leaves the quadrant. Every entry is therefore eventually untouched. Almost every spectral sequence met in a first course is of this type.

Convergence in the standard cases
Setting	Convergence
First-quadrant, bounded filtration	Automatic
Bounded double complex	Automatic
Half-plane with exiting differentials	Automatic
Half-plane with entering differentials	Needs completeness and vanishing lim¹
Unbounded	Conditional convergence at best; extra hypotheses required

Section 02Collapse and degeneration

Collapse at E<sub>r</sub>All later differentials vanish

E_r = E_∞. The associated graded is then known, but the extension problem remains.

Concentration in one row or columnA stronger collapse

If E₂ is concentrated in a single row or column, all differentials vanish for degree reasons AND the filtration has one step, so the target is determined exactly.

Concentration is what makes edge arguments work

Balance of Ext is proved by concentration: one filtration leaves a single column, the other a single row, and both compute the same total homology. The five-term exact sequence is the next-best case, where only two positions contribute in low total degree.

Section 03Failure modes

Failure

Non-vanishing lim¹

For unbounded filtrations, the inverse limit of the filtration quotients may not compute the target. A lim¹ term intervenes and must be shown to vanish.

Failure

Unsolved extensions

The associated graded is known but the target is not determined. Common and often unavoidable without additional structure.

Failure

Unknown differentials

The E₂ page is computable but a differential cannot be determined. The answer is then bounded above and below, not pinned down.

Failure

Non-exhaustive filtration

The sequence converges to the homology of the union of stages, which may be a proper part of the target.

Failure

Wrong convergence direction

Cohomological and homological conventions differ; applying a homological convergence statement to a cohomological sequence gives a false conclusion.

Failure

Conditional convergence only

Boardman's conditional convergence gives a weaker statement that becomes genuine convergence only under an additional vanishing hypothesis.

ReferenceFrequently asked questions

Does convergence guarantee I can compute the answer?

No. It guarantees the associated graded of a filtration of the answer. The extension problems and any unknown differentials remain, and both are frequently the hard part of a computation.

What is conditional convergence?

Boardman's notion for unbounded spectral sequences: the sequence converges conditionally when the relevant inverse limit and its first derived functor vanish appropriately. It becomes strong convergence under an additional hypothesis on the E_∞ page.

How do I show a differential vanishes?

Common arguments: the source or target is zero for degree reasons; naturality with respect to a map where the answer is known; multiplicativity if the sequence is a ring; or comparison with a case computed independently.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Convergence of Spectral Sequences. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Convergence of Spectral Sequences as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—convergence, spectral, sequences, section, bounded—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Convergence of Spectral Sequences?