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.
The associated graded of a filtered complex is a bigraded complex
Statement
Let be an increasingly filtered chain complex in an abelian category, and let be the quotient projections. The family has the canonical differential uniquely characterized, for , by This differential has bidegree and satisfies . The family with this differential is the associated graded complex.
Facts & Assumptions
Given: A filtered chain complex in an abelian category.
The graded quotients exist as subquotients (Associated graded quotients are well defined subquotients).
and are subcomplexes (Filtered chain complex).
The differential of a complex descends to its quotient by a subcomplex, with square zero (The differential descends to a quotient complex).
Proof
The inclusion is a chain map of subcomplexes by [F2]. Apply [F3] to this inclusion: it gives , uniquely satisfying . The quotients are those supplied by [F1].
Writing , the target has complementary degree ; its filtration degree is still . Moreover , and the quotient map is epic. Hence , including zero graded pieces.
Source notes
Weibel, Chapter 5, Construction 5.4.6 and Lemma 5.4.7, pp.133–134; Sharifi, Theorem 4.2.3, pp.91–92. Increasing homological indices are used here.
Depends on
Used by
Dependency tree · two levels
9 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapter 5 (standard reference, not scraped)
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)