Filtered Differential Objects

Executive summary

Approximate the complex, then correct

A filtration of a chain complex breaks the differential into pieces according to how far they move through the filtration. The associated graded complex uses only the part that preserves the filtration degree, and its homology is the first approximation. Successive pages account for the parts that move one step, two steps, and so on. That is the entire conceptual content of a spectral sequence of a filtered complex.

Learning objectives

Define a filtration and the associated graded complex.
Explain how the pages successively correct the approximation.
Distinguish bounded, exhaustive and complete filtrations.
Identify the filtration on the target that E_∞ describes.

Section 01Filtrations

An increasing filtration is a chain of subcomplexes … ⊆ F_p−1C ⊆ F_pC ⊆ … with associated graded

gr_p C = F_pC / F_p−1C

Conditions on a filtration
Condition	Meaning	Why it matters
Bounded	F_pC = 0 for small p and = C for large p, in each degree	Guarantees convergence with no further hypotheses
Exhaustive	The union of all F_pC is C	Necessary for the sequence to see all of C
Hausdorff	The intersection of all F_pC is 0	Prevents information being invisible to the filtration
Complete	C is the inverse limit of C/F_pC	Needed for convergence in the unbounded case, along with vanishing lim¹

Section 02The pages as successive corrections

Stage 01E₀The associated graded complex itself, with only the filtration-preserving part of the differential.
Stage 02E₁Its homology — the first approximation to H(C), correct if the differential never left the filtration degree.
Stage 03E₂Corrects for the part of the differential that drops filtration by one step.
Stage 04E_rCorrects for drops of r−1 steps. Eventually every correction has been applied.
Stage 05E_∞The associated graded of the induced filtration on H(C) — not H(C) itself.

The one-sentence summary

A spectral sequence computes the homology of the associated graded and then corrects it, page by page, for everything the grading discarded. The corrections are the differentials, and E_∞ is what remains.

Section 03The extension problem

E_∞^p,q is F_pH_n / F_p−1H_n where n = p + q. Reconstructing H_n requires solving a chain of extension problems.

Two groups with the same graded pieces need not be isomorphic

If E_∞ in total degree 1 has pieces ℤ/2 and ℤ/2, the target could be ℤ/2 ⊕ ℤ/2 or ℤ/4. The spectral sequence does not distinguish them. Additional input — a ring structure, a naturality argument, a known special case — is required.

Over a field the problem disappears, since every extension of vector spaces splits. This is one more reason field coefficients are preferred when the extension data is not needed.

ReferenceFrequently asked questions

Which direction should the filtration run?

Either, with the appropriate conventions. Increasing filtrations are standard in homology, decreasing in cohomology. Sources differ, and the indexing of the pages changes accordingly, so conventions should be checked before comparing formulas.

What happens if the filtration is not exhaustive?

The spectral sequence computes the homology of the union of the filtration stages, not of the whole complex. Exhaustiveness is what connects the answer to the intended target.

Can a spectral sequence collapse and still be uninformative?

Yes, if the extension problems remain unsolved. Collapse at E₂ means all differentials vanish, which determines the associated graded exactly — but the target may still admit several non-isomorphic filtrations with that graded object.

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 Filtered Differential Objects. 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 Filtered Differential Objects as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—filtered, spectral, complex, section, filtrations—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 Filtered Differential Objects?