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.
Grothendieck spectral sequence
Statement
Let and be additive left-exact functors between abelian categories, with enough injectives in and . Suppose carries injectives to -acyclic objects. With supplied injective and Cartan–Eilenberg resolutions and compatible comparison data, there is a natural first-quadrant spectral sequence The differential has bidegree . Convergence is strong with finite decreasing filtration , and . Its edges are . Alternatively DC supplies the countable choices for each construction in the ambient-set convention of the existence theorem; no global simultaneous choice over all objects is asserted.
Facts & Assumptions
Given: The functors, categories and acyclicity/data hypotheses above.
Cartan–Eilenberg resolutions exist with the stated supplied-choice or DC qualification (Cartan-Eilenberg injective resolutions exist).
The two composite filtrations identify , the derived-composite target and its canonical edges (The two filtrations identify E2 and the composite edge).
Object maps extend to injective resolutions, uniquely up to cochain homotopy under DC (Injective comparison maps exist, Injective comparison maps are unique up to cochain homotopy).
Cartan–Eilenberg comparisons induce canonical maps from horizontal-first with DC or supplied comparison data (Cartan–Eilenberg comparisons preserve both filtrations).
Proof
Take the supplied injective resolution and a Cartan–Eilenberg resolution , or obtain the latter by F1. Apply to and use the filtration by its resolution degree. F2 gives , identifies its total target with , and identifies both edge maps. All indices are nonnegative.
The finite total diagonals of give exactly the finite target filtration in F2: in degree only resolution degrees occur. The associated graded is its stationary page, with differential bidegree , so this is strong convergence, not just an asserted target. In degree zero the sole quotient is ; zero objects and zero filtration pieces require no separate reconstruction.
For lift to using F3 or supplied data, apply , then lift to by F4. This preserves resolution degree and gives a spectral-sequence map. On it is the map . Different injective comparison maps are homotopic, so additivity of gives the same maps on , and hence on ; different Cartan–Eilenberg lifts give the same map by F4. Equality propagates to every later page by taking homology. On the target, additivity of preserves the original injective homotopy and the augmentation comparison in F2 intertwines the maps, so the target maps also agree. Identity and composition now establish naturality.
Depends on
- The two filtrations identify E2 and the composite edge
- Cartan-Eilenberg injective resolutions exist
- Cartan–Eilenberg comparisons preserve both filtrations
- Injective comparison maps exist
- Injective comparison maps are unique up to cochain homotopy
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
- Derived composition isomorphisms under total acyclicity Corollary
- Grothendieck collapse when one functor is exact Corollary
- Grothendieck needs only left exactness False statement
- Dual left-derived Grothendieck spectral sequence Remark
- Five-term exact sequence of the Grothendieck spectral sequence Theorem
- Lyndon-Hochschild-Serre spectral sequence Theorem
- Naturality of the Grothendieck spectral sequence Theorem
Dependency tree · two levels
24 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, Theorem 5.8.3 (standard reference, not scraped)
- Stacks Project, Tag 015N (standard reference, not scraped)