The Ladder of an Exact Couple and Rees Systems

Executive summary

Making the convergence bookkeeping explicit

An exact couple arising from a filtered complex carries more structure than the couple alone records: the filtration stages assemble into a ladder of long exact sequences, and tracking that ladder is what allows convergence to be proved rather than assumed. Rees systems package the ladder into a single algebraic object, so that questions about limits and completions become questions about the system.

Learning objectives

Describe the ladder attached to a filtered complex.
State what a Rees system records.
Explain how the limit of the system relates to the target.
Identify where the lim¹ obstruction enters.

Section 01The ladder

Each inclusion F_p−1C ⊆ F_pC gives a short exact sequence of complexes and hence a long exact homology sequence. Stacking these produces a ladder, with the exact couple assembling the two graded objects

D = ⊕_p H(F_pC), E = ⊕_p H(gr_p C)

The maps i, j, k are induced by the inclusion, the projection to the graded piece, and the connecting homomorphism respectively.

The couple is a compression of the ladder

All the information used by the spectral sequence sits in the couple, but questions about whether the answer is the homology of C — rather than of some limit — require the ladder, because they concern how the filtration stages assemble.

Section 02Rees systems

A Rees system records the ladder together with the maps relating a filtered complex to its completion. It carries two exact couples and comparison maps between them, so that both the spectral sequence and the convergence question are visible in a single object.

What the system tracks
Component	Records
The exact couple	The spectral sequence and its pages
The direct limit	Whether the filtration is exhaustive
The inverse limit	Whether the filtration is complete
The comparison maps	How H(C) relates to the limit of the H(C/F_pC)
lim¹ of the system	The obstruction to the comparison being an isomorphism

Why the formalism is worth having

For bounded filtrations none of this is needed — convergence is immediate. The machinery earns its place for unbounded filtrations, completions, and pro-objects, where informal arguments give wrong answers.

Section 03Limits and the obstruction

The homology of the completed complex sits in a short exact sequence

0 → lim¹ H_n+1(C/F_p) → H_n(lim C/F_p) → lim H_n(C/F_p) → 0

so the answer computed by the spectral sequence is the right-hand term, and the lim¹ contribution is invisible to it. When lim¹ vanishes the two agree; when it does not, the spectral sequence converges to something other than the intended target.

This is the standard trap in unbounded cases

Every page of the spectral sequence can be correct and the conclusion still wrong, because the target was never what the sequence converges to. Checking a Mittag-Leffler condition — which forces lim¹ to vanish — is the usual remedy.

ReferenceFrequently asked questions

Do I need Rees systems to use spectral sequences?

For first-quadrant sequences, no — convergence is automatic and the couple suffices. The formalism matters when filtrations are unbounded or when completions are involved, which is common in stable homotopy theory and in pro-algebraic settings.

What is the Mittag-Leffler condition?

That the images of the maps in an inverse system stabilise. It implies lim¹ vanishes and is the standard checkable hypothesis in convergence statements.

Is the ladder the same as the exact couple?

The couple is obtained from the ladder by taking direct sums over the filtration index. The ladder retains the individual sequences, which is what convergence arguments need.

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 The Ladder of an Exact Couple and Rees Systems. 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 The Ladder of an Exact Couple and Rees Systems as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—ladder, rees, exact, couple, systems—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 The Ladder of an Exact Couple and Rees Systems?