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.
Exhaustive separated bounded and finite filtration
Definition
For an increasing filtration as in Increasing and decreasing filtration of an object, exhaustive means and separated means , when those joins and meets exist in the subobject order. In modules these are the usual union and intersection. A filtration is bounded below if for some , bounded above if for some , and finite if both hold; the witnesses may be enlarged to give . Thus finite does not require distinct consecutive subobjects.
For a complex, degreewise bounded means and for each , with bounds permitted to depend on ; uniformly bounded requires the same bounds for all degrees. For decreasing filtrations finite means and for . For orientation only, completeness means that the canonical map is an isomorphism, when that inverse limit exists. No assertion about convergence of an unbounded spectral sequence is part of these definitions.
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. Sharifi 4.1.14 reverses the decreasing endpoints in its prose; the endpoints above agree with its Definition 4.2.1(b).
Depends on
Used by
Dependency tree · two levels
2 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)