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.
R cycles and r boundaries of an increasingly filtered complex
Definition
For a filtered chain complex as in Filtered chain complex, put and, for , Inverse images and intersections are the pullbacks of Spectral sequence subquotient and local lifting calculus. Since preserves , . For define the subobjects The image in the second summand lies in since . Separately set , . The symbols include lower-filtration approximate cycles, not just actual boundaries.
For comparison with projected conventions, let and be the images of and in for ; set and .
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
- Collapse with a nonsplit extension problem Counterexample
- R page of the spectral sequence of a filtered complex Definition
- Multiplicative filtered cochains induce products on every spectral-sequence page Lemma
- R boundaries embed in r cycles Lemma
- Serre transgression agrees with the relative connecting construction Proposition
- Complete exhaustive filtered complex convergence criterion Theorem
- Homological Serre spectral sequence Theorem
- Naturality of the homological Serre spectral sequence Theorem
Dependency tree · two levels
7 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)