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.
The filtered differential induces d r on the r page
Statement
For each , the filtered differential induces a morphism characterized on local representatives by , where .
Facts & Assumptions
Given: A filtered complex, , and ; symbols have [F1] conventions.
is the quotient of the specified numerator by its two denominator summands (R page of the spectral sequence of a filtered complex).
The associated graded differential is well defined (The associated graded of a filtered complex is a bigraded complex).
Maps preserving numerator and denominator descend uniquely; image representatives can be lifted after epic pullback (Spectral sequence subquotient and local lifting calculus).
Proof
For r=0 use [F2]. For r≥1, the restriction of d to lands in . Its next differential is zero, so it lands in , the target numerator in [F1].
If changes by , then lies in the target boundary summand . If x changes by with , its differential changes by . These are subobject factorization calculations: the sum epimorphism allows their verification after an epic cover by [F3].
Consequently the map from the source numerator to the target quotient kills both denominator summands and hence their sum. Cokernel descent [F3] gives a unique satisfying the stated rule. Equality after the epic source quotient proves that the rule is independent of every permitted local representative.
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
- An exhaustive nonseparated filtration with the wrong naive abutment Counterexample
- Collapse with a nonsplit extension problem Counterexample
- Identical E2 pages with different later differentials Counterexample
- A filtered complex collapsing at e one Example
- A first quadrant five term exact sequence Example
- A nonzero d two differential in a small filtered complex Example
- Edge maps from a first quadrant spectral sequence Example
- The cohomological reindexing of a homological spectral sequence Example
- The two step filtration and its spectral sequence Example
- A spectral sequence collapses when one differential is zero False statement
- An isomorphism on e infinity automatically gives an isomorphism of unfiltered targets False statement
- Collapse solves all extension problems False statement
- Multiplicative filtered cochains induce products on every spectral-sequence page Lemma
- The rth differential squares to zero Lemma
- An E2 page alone does not determine the abutment Proposition
- Collapse does not in general split the abutment Proposition
- E one is homology of the associated graded complex Proposition
- E zero is the associated graded complex Proposition
- Failure of separatedness or completeness can destroy the claimed abutment Proposition
- Serre transgression agrees with the relative connecting construction Proposition
- The exact couple and subquotient constructions of the filtered complex spectral sequence agree Proposition
- The rth differential has bidegree minus r r minus one Proposition
- Complete exhaustive filtered complex convergence criterion Theorem
- Homological Serre spectral sequence Theorem
- The next page is the homology of the current page Theorem
- The row filtration spectral sequence of a first quadrant double complex Theorem
Dependency tree · two levels
11 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)