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.
Morphism of spectral sequences
Definition
A morphism of spectral sequences from page s is a family of bidegree (0,0) maps for r≥s, where both sequences are defined, such that and Use Homological spectral sequence or Cohomological spectral sequence as appropriate; the map on homology is the unique cycle-quotient map of A chain map induces a well-defined map on homology. A map of abutments is additional filtered data, compatible with the stable graded maps; it is not inherent in f.
If is an isomorphism at every bidegree, all later are isomorphisms. In fact the inverse of commutes with differentials by multiplying the commutation equation on both sides by inverses. Thus and its inverse carry kernels and boundary images into each other and induce inverse quotient maps on homology. The displayed compatibility expresses as a composite of three isomorphisms. Repeating this argument a finite number of times proves the assertion at every r≥s.
Source notes
Weibel, Chapter 5, §5.2 pp.122–125 and Definitions 5.4.2–4 pp.132–133; Sharifi, §4.1 pp.87–89 and Definition 4.2.1 p.90. Mapping Lemma 5.2.4 and Sharifi Lemma 4.1.4.
Depends on
Used by
- Edge homomorphisms are natural Lemma
- Fiber and limit isomorphisms force a base-axis isomorphism Lemma
- A filtered chain map induces a morphism of spectral sequences Proposition
- A map of exact couples induces a map of spectral sequences Proposition
- A transgressive simple fiber system gives a polynomial base Theorem
- Spectral sequence comparison theorem 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)