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.
E zero is the associated graded complex
Statement
In the specified quotient model, is the associated graded complex: .
Facts & Assumptions
Given: A filtered chain complex with the specified initial-page quotient model.
The initial page is (R page of the spectral sequence of a filtered complex).
At , the page differential is characterized on quotient representatives by (The filtered differential induces d r on the r page).
The associated graded complex has the unique differential satisfying (The associated graded of a filtered complex is a bigraded complex), as supplied by quotient-complex descent (The differential descends to a quotient complex).
Proof
The defining numerator and denominator of [F1] are and . Their quotient is exactly the chosen model of .
By [F2], the initial-page differential sends every quotient representative to , so its composite with the quotient projection is . By [F3], the associated-graded quotient differential is the unique map with that same composite. The quotient projection is epic, hence the two maps agree. With , their common bidegree is .
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
12 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)