Completions of Filtrations and lim1

Executive summary

The first derived functor of the inverse limit

Inverse limits are left exact but not exact, and the failure is measured by lim¹, the first derived functor. It appears whenever a filtered object is completed, in the Milnor sequence relating the cohomology of a limit to the limit of cohomologies, and in the convergence of unbounded spectral sequences. The Mittag-Leffler condition — that the images in the inverse system stabilise — forces it to vanish and is the standard hypothesis in practice.

Learning objectives

Explain why inverse limits fail to be exact.
Define lim¹ and compute it in a simple case.
State the Mittag-Leffler condition.
Identify the Milnor sequence and where lim¹ appears.

Section 01Failure of exactness

Given a short exact sequence of inverse systems, the limit functor gives

0 → lim A_n → lim B_n → lim C_n → lim¹ A_n → lim¹ B_n → lim¹ C_n → 0

The surjectivity of the third map can fail: a compatible family of elements of C_n need not lift to a compatible family in B_n, because each individual lift is possible but the choices may not be made consistently. lim¹ records exactly that inconsistency.

Only two derived functors

For inverse systems indexed by the natural numbers, limⁿ = 0 for n ≥ 2. So the sequence above is the complete story, which is why lim¹ appears everywhere and lim² never does in this setting.

Section 02The Mittag-Leffler condition

AlgorithmTesting for vanishing lim1in: an inverse system → out: whether lim¹ vanishes

Consider the inverse system … → A₂ → A₁ → A₀.
For each n, look at the images of A_m in A_n as m increases.
The system is Mittag-Leffler when these images stabilise for each n. Surjective transition maps are the commonest sufficient condition.
Mittag-Leffler implies lim¹ = 0.
The converse fails in general, so the condition is sufficient but not necessary.

Standard examples
System	lim¹
Surjective transition maps	0 — Mittag-Leffler holds
ℤ →^×p ℤ →^×p …	The p-adic integers modulo ℤ — non-zero
Finite groups	0 — images stabilise by finiteness
Filtration quotients of a bounded filtration	0 — eventually constant

Section 03Where it appears

Appearance

Milnor sequence

For a space that is a colimit of subspaces, cohomology of the colimit sits in a short exact sequence with a lim¹ of the cohomologies of the stages.

Appearance

Spectral sequence convergence

An unbounded filtration converges to the intended target only when the relevant lim¹ vanishes.

Appearance

Completion

The homology of a completed complex differs from the limit of the homologies by exactly a lim¹ term.

Appearance

Ext of a direct limit

Ext against a colimit involves an inverse limit in one variable and hence a lim¹ correction.

Appearance

Profinite completion

Cohomology of a profinite group is a colimit over finite quotients; comparisons with the abstract group involve lim¹.

Appearance

Homotopy limits

The Bousfield–Kan spectral sequence has lim¹ terms in its E₂ page.

ReferenceFrequently asked questions

Why is there no lim2 for sequences?

Because an inverse system indexed by the natural numbers has a two-term resolution by products, so the derived functors vanish above degree 1. For systems indexed by more complicated posets higher derived functors can be non-zero.

Is lim1 ever computable explicitly?

For the standard examples yes — it is the cokernel of an explicit map between products. In general it is more often shown to vanish than computed, which is what the Mittag-Leffler condition is for.

Does the dual problem arise for direct limits?

No, in module categories: filtered colimits are exact, so there is no colim¹. This asymmetry between limits and colimits is one of the most practically consequential facts in the subject.

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 Completions of Filtrations and lim1. 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 Completions of Filtrations and lim1 as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—sequence, inverse, mittag-leffler, milnor, completion—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 Completions of Filtrations and lim1?