How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Filtered colimits of abelian groups are exact
Statement
Let be a small filtered category (Filtered categories and filtered colimits). The filtered colimit functor on abelian groups is exact (Exact functor between abelian categories). Equivalently:
- for a -indexed diagram of short exact sequences of abelian groups, the colimit sequence is short exact;
- for a -indexed diagram of cochain complexes of abelian groups , the canonical map is an isomorphism for every ; in particular the colimit of a diagram of exact complexes is exact in every degree.
Facts & Assumptions
Abelian groups and -modules have the same objects and morphisms, so a categorical or functorial property of one category transfers to the other (Abelian groups and -modules have the same objects and morphisms).
For every ring the category of left -modules is a Grothendieck category (Module categories are Grothendieck categories).
A Grothendieck category is an abelian category that satisfies AB5 and has a generator (Grothendieck category).
An abelian category satisfies AB3 when it has all small coproducts, which in the abelian setting is the same as being cocomplete (The axioms AB3 and AB3*).
In a cocomplete abelian category, AB5 holds if and only if every small filtered colimit functor on it is exact (AB5 is equivalent to exactness of filtered colimits).
An exact functor between abelian categories is additive and preserves the finite limits and finite colimits that exist in its source, hence in particular preserves kernels, cokernels and images (Exact functor between abelian categories).
Proof
Given: A small filtered category .
By [F1] the categories and have the same objects and morphisms, so every statement about the categorical structure of one holds for the other. By [F2] is a Grothendieck category, hence by [F3] an abelian category satisfying AB5 and having a generator, and satisfying AB5 includes AB3 by [F4], so is a cocomplete abelian category satisfying AB5. By [F1] the same holds for , and [F5] then gives that for every small filtered category the filtered colimit functor is exact.
Let be a diagram of short exact sequences of abelian groups. Viewing it as an object of concentrated in cohomological degrees , it is a diagram of complexes that is exact in each degree. By [F6] the exact functor preserves kernels and cokernels, hence also images; applied to the diagrams , , with their structure maps it therefore yields the short exact sequence . Concretely, injectivity on the left is preservation of the kernel of , surjectivity on the right is preservation of the cokernel of , and exactness at the middle term follows because the image of a morphism is the kernel of its cokernel: .
Let be a diagram of cochain complexes of abelian groups with differentials , and put and , so that and are pointwise exact sequences of diagrams of abelian groups. By [step 2.1] the colimits of these two diagrams of short exact sequences are short exact: and . Since is exact it preserves kernels and images [F6], so and . It also preserves cokernels, so ; combining the identifications gives , which is assertion 2.
If every complex is exact, then for all and all , so assertion 2 gives for every and the colimit complex is exact in every degree. Assertion 1 is [step 2.1] and the exactness of the filtered colimit functor itself is [step 1.1]; no choice principle is used anywhere, the proof resting only on the identification of abelian groups with -modules and on AB5 for module categories. ∎
Depends on
Used by
Dependency tree · two levels
36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- The Stacks Project, Algebra (filtered colimits of modules) (standard reference, not scraped)