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 collapse when one functor is exact
Statement
Assume the Grothendieck hypotheses and supplied-data/choice conventions. If is exact, then . If is exact, then . Both are natural edge isomorphisms for every . In the first alternative the hypothesis that sends injectives to -acyclics is still required.
Facts & Assumptions
Given: The Grothendieck setup and either stated exactness hypothesis.
The second page, finite target filtration and canonical edges are those of the Grothendieck theorem (Grothendieck spectral sequence).
Exact functors have zero positive relative derived objects (An exact functor has vanishing positive derived functors).
Collapse at means at every bidegree for every , so identifies with the stable page (Collapse at a page).
Proof
If is exact, F2 makes for . Thus F1 is supported on and . If is exact, F2 instead makes for , leaving . In either alternative, a differential of bidegree with cannot have both source and target on that one axis. All such differentials vanish, and repeated page homology preserves this support, proving collapse in the sense of F3.
In degree the first alternative has only the quotient at , so all preceding filtration quotients vanish and , with . Its lower edge is therefore the first claimed isomorphism. The second alternative has only ; all positive filtration pieces are zero, so its upper edge is the second claimed isomorphism. Naturality comes from the edge maps in F1. For these are the identification with ; if both functors are exact the positive targets are zero. No splitting or additional choice is used.
Depends on
Used by
Dependency tree · two levels
19 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
- Stacks Project, Tags 015J-015N (standard reference, not scraped)