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 one is homology of the associated graded complex
Statement
There is a canonical isomorphism , inverse to the specified initial next-page map. If for all , then and is the map between these graded objects induced by .
Facts & Assumptions
Given: A filtered chain complex and integers p,q.
is a natural isomorphism (The next page is the homology of the current page).
is the associated graded complex with its differential (E zero is the associated graded complex).
The page differential is induced by the chain differential on its numerator (The filtered differential induces d r on the r page).
Proof
Fix p. By [F2], the terms at total degrees n are , and the differential lowers n by one while fixing p. Consequently the kernel and boundary quotient at is exactly .
Apply the inverse of from [F1] and then the identification in step 1.1. The composite is the asserted isomorphism; each factor is canonical and natural, so their composite is too.
Under the additional lowering hypothesis, the induced differential on is zero, because the image of lies in the denominator. Its homology is therefore the same graded object. Steps 1.1 and 2.1 identify this with . At the next filtration level, , so is well defined from to . By [F3] this is precisely , including when either graded object is zero.
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.
The lowering-hypothesis clause is the increasing homological translation of Stacks §12.24, Lemma 12.24.3(2). The proof here is componentwise and requires no countable direct sum.