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.
Exact couple
Definition
Fix an integer and an abelian category. A page- homological exact couple is a pair of indexed families and and maps For every require the three subobject equalities These are exactness at the three positions, meaning the corresponding kernel modulo image is zero. In particular each consecutive composite , or , with the displayed shifts understood, is zero.
An initial exact couple means : then has bidegree . Its first spectral page will be called , not . A morphism between two page- couples is a pair of bidegree-zero families and satisfying All-zero families are allowed. Graded objects here mean indexed families: no infinite direct sum, convergence or abutment is part of the definition.
Depends on
Used by
- Derived exact couple Definition
- Differential associated to an exact couple Definition
- The exact couple of a two step filtration Example
- Every exact couple is a long exact sequence with no extra grading data False statement
- The derived couple maps are well defined Lemma
- The exact couple differential squares to zero Lemma
- A map of exact couples induces a map of spectral sequences Proposition
- A filtered complex produces an exact couple Theorem
- An exact couple generates a spectral sequence Theorem
- The derived couple is exact Theorem
Dependency tree · two levels
7 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, Definition 12.21.1 and Remark 12.21.5 (homological grading) (standard reference, not scraped)