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.
Short exact sequences of filtered complexes give compatible exact couples
Statement
Let be a short exact sequence of filtered complexes in an abelian category, whose maps are strict degreewise. Thus, identifying with its image in , one has and , so is exact for all . Then the associated-graded sequences are short exact sequences of complexes. The filtered maps induce morphisms between the three associated exact couples, commuting with , and hence compatible morphisms of all their derived couples and spectral sequences. This does not assert short exactness of the homology or terms.
Facts & Assumptions
Filtered chain map preserves all filtration subcomplexes. A filtered complex produces an exact couple constructs and with inclusion, quotient and connecting maps.
Spectral sequence subquotient and local lifting calculus supplies epic local lifts, nested quotients and descent of subobject containments.
Naturality of the homology connecting morphism gives the connecting square for a morphism of short exact sequences of complexes. Homology respects identities and composition preserves commuting chain-map squares under homology.
A map of exact couples induces a map of spectral sequences derives and iterates commuting couple maps.
Proof
Given: The strict filtered short exact sequence. Fix and write .
The restriction of to is monic. Its image is , exactly the kernel of the restriction of to . Strict surjectivity makes the latter map epic onto . The maps commute with the restricted differentials by [F1], so these are short exact sequences of subcomplexes for every .
For either filtered map or , there is a commutative ladder from to the corresponding sequence for its target . Passing to homology gives the couple's and comparison maps. The squares for and commute because their chain maps are respectively filtration inclusions and quotient projections and homology preserves compositions. The square for is exactly the connecting square in [F3], with homology degree decreasing from to . Hence all three couple squares commute at their prescribed bidegrees.
The induced graded map from is monic: an element of mapping into lies in . The graded map to is epic by lifting from to locally. If maps into , lift that image locally to . Then is the image of an element of , and has the same graded class as . Conversely a graded class from maps to zero because . This proves both kernel-image containments. The element notation means morphisms after finite epic pullbacks, and all equalities descend by [F2]. Thus the graded sequence is short exact degreewise; its maps commute with differentials by quotient descent.
Apply [F4] to both maps from step 1.2 to obtain the derived-couple and spectral maps on all pages. The graded short exactness in step 2.1 is a statement at the chain level; step 1.2 applies homology and yields its natural connecting ladders, not a claim that each induced homology arrow is monic or epic. Zero complexes, equal successive filtration pieces and all integer indices are permitted throughout. Only finite epic lifting and canonical quotient arrows were used, without AC or a choice of splitting.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Weibel, An Introduction to Homological Algebra, Chapter 5 (standard reference, not scraped)
- The Stacks Project, Homological Algebra (standard reference, not scraped)