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.
Regular spectral sequence
Definition
For a homological spectral sequence as in Homological spectral sequence, two-sided regularity means that for every there is an integer such that for every both are zero. On this page the design term regular means this two-sided condition. The bound may depend on ; there need not be a single collapse page.
This differs from the convention on the prerequisite spectral-sequences page and in Stacks, Definition 12.24.7: there regular means eventual outgoing vanishing alone and coregular means eventual incoming vanishing. We call these outgoing regularity and incoming regularity when only one is intended. Neither may silently replace the two-sided hypothesis.
When both maps vanish the specified next-page isomorphism identifies with itself, since its kernel is the whole term and its incoming image is zero. Thus the condition gives canonical pointwise stationarity, as in Degree reasons force stabilization in a bounded region. For first-quadrant support, the outgoing target is zero for , and the incoming source is zero for . Outside that support every page term is zero. These bounds include the axes and the entirely zero sequence, without a choice of representatives or an assumption of AC.
Depends on
Used by
- Strong convergence of a spectral sequence Definition
Dependency tree · two levels
5 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
- Weibel, An Introduction to Homological Algebra, Chapter 5 (standard reference, not scraped)
- The Stacks Project, Homological Algebra (standard reference, not scraped)