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.
Quasi isomorphism criterion from a filtered map
Statement
Let be a filtered chain map whose maps on every associated-graded complex are quasi-isomorphisms. If both filtered-complex spectral sequences strongly converge to their actual homology with target filtrations satisfying the finite or complete module hypotheses of the comparison theorem, then is a quasi-isomorphism. Degreewise finite filtrations on both complexes suffice, without a first-quadrant or uniform-bound hypothesis.
Facts & Assumptions
Filtered chain map and A filtered chain map induces a morphism of spectral sequences give the induced spectral morphism. E one is homology of the associated graded complex identifies its first page naturally with graded-complex homology.
Induced filtration on homology is the homology image filtration. The actual-cycle abutment and completeness conventions are in Strong convergence of a spectral sequence.
Spectral sequence comparison theorem applies to page isomorphisms with compatible filtered target maps under the stated target hypotheses.
Bounded filtered complex spectral sequence abuts to filtered homology proves the degreewise finite abutment and stabilization, without a quadrant restriction. A first quadrant filtered complex spectral sequence converges to filtered homology gives its first-quadrant specialization with completeness.
Quasi-isomorphism requires isomorphisms on homology in every degree.
Proof
Given: and the graded quasi-isomorphism hypothesis.
By [F1] there is a morphism of spectral sequences, whose component at on page one identifies with . This is an isomorphism by the hypothesis and [F5], for every . Thus the required isomorphism is on an entire page, including every zero graded complex.
The map preserves the homology image filtration: a cycle coming from maps to a cycle coming from . On its graded quotient, it sends the class of an actual cycle to that of . The spectral map does the same on the limiting actual-cycle classes, because it is induced by the filtered chain map. Hence the given strong abutment identifications commute with the maps ; these are the actual maps required by comparison.
Under the conditional strong-convergence and target hypotheses, apply [F3] to steps 1.1–1.2. It makes every an isomorphism, which is exactly the quasi-isomorphism conclusion. This does not claim that completeness of the complexes by itself establishes those convergence hypotheses.
If instead both chain filtrations are degreewise finite, [F4] supplies canonical actual-cycle abutments, two-sided stationarity and finite homology filtrations. Each such finite target filtration is exhaustive and separated, and its lower quotient tail is constant equal to the target, so its completion map is an isomorphism by [F2]. Thus strong convergence and the finite comparison hypotheses hold, and step 2.1 applies. This argument uses the unrestricted bounded theorem in [F4], so no first-quadrant assumption is silently added; the first-quadrant theorem is its named special case. Finite bounds may vary with degree, repeated terms and a one-step filtration are allowed, and neither branch introduces AC.
Depends on
Used by
Dependency tree · two levels
10 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)