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.
Row and column filtrations of a first quadrant double complex
Definition
Let be a first-quadrant homological double complex. Its totalisation exists: each nonnegative diagonal has at most nonzero terms and negative diagonals are zero. The finite sum/product identification is provided by Sum and product totalisations agree on finite diagonal double complexes, and The total differential squares to zero gives the chain condition.
For integers , its column filtration and row filtration are the partial biproducts Their injections into are split monomorphisms: projecting onto the selected summands is a left inverse. Thus these are subobjects. The selected index sets increase with , giving the filtration inclusions.
Both arrows preserve each cutoff: lowers and fixes , while fixes and lowers . Consequently restricts to each partial sum, and the two families are filtered subcomplexes. They vanish for and equal for when . For every piece and are zero. In particular degree zero has just the single possible component ; both filtrations jump there at .
The quotient selects column with remaining differential , or row with remaining differential , respectively. In spectral coordinates , total degree is ; hence these associated graded components are respectively and . No sign is inserted: the original double-complex arrows already anticommute. The construction uses only the specified finite biproduct maps and no choices.
Depends on
Used by
Dependency tree · two levels
8 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, Section 12.25, the two filtration formulas (homological translation) (standard reference, not scraped)