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.
Edge maps from a first quadrant spectral sequence
Example
For the complex --2--> with the degree-zero stalk, and for p<0, both first-quadrant edge maps in degree zero, taken from , identify ℤ/2 with . All positive-degree edges are zero maps between zero groups.
Facts & Assumptions
Given: The two-step filtered multiplication-by-two complex and s=2.
At s≥2 the homological edges factor through and (Edge homomorphisms of a first quadrant spectral sequence).
Finite filtered convergence identifies the stable page with graded homology (Bounded filtered complex spectral sequence abuts to filtered homology).
2:ℤ→ℤ is injective with cokernel ℤ/2 (Abelian-group model for spectral-sequence computations).
The first two pages use the explicit filtered quotient formulas (R page of the spectral sequence of a filtered complex).
The differential on a page sends a representative to its chain differential (The filtered differential induces d r on the r page).
Verification
The filtration is finite and preserved by d. Its graded terms are ℤ at (1,0),(0,0), with ; the next differential sends x to 2y, so its kernel is zero and cokernel ℤ/2 by [F3]. Therefore has only (0,0)=ℤ/2 and remains constant. Direct homology gives . The image of onto is all ℤ/2. Thus , agreeing with [F2].
For n=0 the vertical edge of [F1] is , taking [a] to [a] at every stage. The horizontal edge is , again [a]↦[a]. For n>0 all these and axis terms vanish by step 1.1, so both edges are the unique zero maps. The normalization holds for every n≥0.
Source notes
Weibel, Example 5.2.6; explicit calculation in this item.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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)