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 nonzero d two differential in a small filtered complex
Example
There is a finite filtered complex with and nonzero. Take , and dx=y, with filtration degrees 2 for x and 0 for y, and all other terms zero. Then is the identity ℤ→ℤ.
Facts & Assumptions
Given: The displayed complex with generator filtration levels 2 and 0.
Pages are computed from and the specified denominators (R page of the spectral sequence of a filtered complex).
Finite filtrations converge to image-filtered homology (Bounded filtered complex spectral sequence abuts to filtered homology).
Abelian-group kernels and quotients compute the homology (Abelian-group model for spectral-sequence computations).
Verification
The filtration is by subcomplexes because d sends filtration 2 into filtration 0. has ℤx at (2,0) and ℤy at (0,1). since the only nonzero chain differential drops filtration. For r=1 and r=2 the x numerator is ℤx (dx lies in ) and its denominator is zero. The y denominator is zero since its potential sources and are zero. Thus have the same two terms.
The possible from x targets (1,0), a zero group; all vanish. At r=2, [F2] instead gives [x]↦[y], an isomorphism between the two nonzero terms, whose inverse sends [y] to [x]. In particular the generator has nonzero image. At r=3 the x numerator is zero because , and the y denominator contains . All terms on and later are zero.
The unfiltered complex has kernel and cokernel of the identity equal to zero, so all . Its image filtration and every associated graded homology piece are zero, exactly matching under [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)