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.
Acyclic assembly lemma for a first quadrant double complex
Statement
Let be a first-quadrant homological double complex in an abelian category. If for every and every , put with differential induced by . The natural projection , given on by the quotient map and zero on other summands in degree , is a quasi-isomorphism.
If instead for , the analogous projection to is a quasi-isomorphism. In particular completely acyclic columns or completely acyclic rows imply an acyclic total complex.
Facts & Assumptions
The column filtration spectral sequence of a first quadrant double complex gives vertical-first pages and finite column convergence; The row filtration spectral sequence of a first quadrant double complex gives the transposed version.
The next page is the homology of the current page gives natural homology transitions; Bounded filtered complex spectral sequence abuts to filtered homology gives natural graded abutment identifications.
Edge homomorphisms of a first quadrant spectral sequence defines the horizontal edge via the last filtration quotient and inclusion into the page-two axis.
Quasi-isomorphism means that the given chain map induces an isomorphism in each homology degree.
Proof
Given: The column homology hypothesis first, and the anticommuting convention for .
Since , . Anticommutation gives , so preserves the indicated boundary images and induces a differential on ; its square is induced by . The prescribed commutes with differentials on by this definition. On a summand , its only potentially surviving output under is a vertical boundary and is therefore killed. On summands with both outputs have positive vertical degree and are killed. Hence is a chain map.
Regard as a double complex in row zero with horizontal differential that of . The same formulas give a morphism and a column-filtered total map equal to . Its map on vertical is the identity , and its maps on positive vertical homology are isomorphisms by hypothesis. Thus the induced map on is an isomorphism. Natural homology transitions imply successively that its maps on for all are isomorphisms.
The page is supported on ; . For , an outgoing differential from lands at positive second coordinate and an incoming source has negative second coordinate , so both maps are zero. Thus . In degree the finite homology filtration has all quotients zero except possibly the one at . A quotient means ; starting at and applying this finitely often gives , while . Consequently the sole graded piece canonically equals , for both total complexes.
By naturality of the abutment, the isomorphism on that sole graded piece induced in step 2.1 is exactly under these canonical identifications, rather than an unspecified isomorphism of the two homology objects. Equivalently it is the horizontal edge of the column sequence: for the edge is the identity and the edge square for commutes. Hence is invertible. Negative-degree homologies are zero and uses , so is a quasi-isomorphism in all degrees.
Exchange the two coordinates and the arrows . Their anticommuting sum and total complex are unchanged under summand permutation, while columns become rows. The same projection and proof give the row assertion. If columns are completely acyclic, then also for every , so the first quasi-isomorphism has zero target; the row conclusion follows in the same manner. No surviving nonzero edge is asserted in these completely acyclic cases. All maps are canonical quotients and finite-filtration maps, requiring no AC.
Depends on
Used by
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
- Stacks Project, Lemma 12.25.4 (homological projection variant) (standard reference, not scraped)