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.
A filtered complex collapsing at e one
Example
Let , , with all other terms zero and the trivial filtration for p<0, for p≥0. This spectral sequence collapses at , with the single stable term .
Facts & Assumptions
Given: The trivial filtration on the multiplication-by-two complex.
Pages use the filtered numerator/denominator formula (R page of the spectral sequence of a filtered complex).
The initial differential is the graded map induced by d (The filtered differential induces d r on the r page).
Finite convergence gives the image-filtered homology (Bounded filtered complex spectral sequence abuts to filtered homology).
The map 2:ℤ→ℤ has zero kernel and cokernel ℤ/2 (Abelian-group model for spectral-sequence computations).
Verification
The initial page has ℤ at (0,1) and (0,0). Both generators have filtration degree 0, so is exactly multiplication by 2 between them. Thus its kernel at (0,1) is zero and its cokernel at (0,0) is ℤ/2 by [F4]. The r=1 formula [F1] gives these same quotients: the degree-one numerator is ker(2)=0 and the degree-zero denominator is 2ℤ.
For every r≥1, , so the degree-one numerator stays zero; makes the degree-zero denominator stay 2ℤ. All other pieces are zero. Thus all differentials from onward have zero source or target and the sequence collapses there. Its homology is with and for n≠0, agreeing with [F3].
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
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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)