Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 C be a first-quadrant homological double complex in an abelian category. If Hqv(Cp,)=0 for every p and every q>0, put Bp=H0v(Cp,) with differential induced by h. The natural projection ρ:Tot(C)B, given on Cn,0 by the quotient map and zero on other summands in degree n, is a quasi-isomorphism.

If instead Hph(C,q)=0 for p>0, the analogous projection to (H0h(C,q),v) is a quasi-isomorphism. In particular completely acyclic columns or completely acyclic rows imply an acyclic total complex.

Facts & Assumptions

[F2]

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.

[F3]

Edge homomorphisms of a first quadrant spectral sequence defines the horizontal edge via the last filtration quotient and inclusion into the page-two axis.

[F4]

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 C.

1.1

Since Cp,1=0, Bp=Cp,0/im(v:Cp,1Cp,0). Anticommutation gives hv=vh, so h preserves the indicated boundary images and induces a differential on B; its square is induced by h2=0. The prescribed ρ commutes with differentials on Cn,0 by this definition. On a summand Cp,1, its only potentially surviving output under ρd is a vertical boundary and is therefore killed. On summands with q>1 both outputs have positive vertical degree and are killed. Hence ρ is a chain map.

F1given
2.1

Regard B as a double complex D in row zero with horizontal differential that of B. The same formulas give a morphism CD and a column-filtered total map equal to ρ. Its map on vertical H0 is the identity BpBp, and its maps on positive vertical homology are isomorphisms 00 by hypothesis. Thus the induced map on E1 is an isomorphism. Natural homology transitions imply successively that its maps on Er for all r1 are isomorphisms.

F1F2step 1.1given
3.1

The page E1 is supported on q=0; Ep,02=Hp(B). For r2, an outgoing differential from (p,0) lands at positive second coordinate r1 and an incoming source has negative second coordinate 1r, so both maps are zero. Thus E2=E. In degree n0 the finite homology filtration has all quotients zero except possibly the one at p=n. A quotient Fp/Fp1=0 means Fp=Fp1; starting at F1=0 and applying this finitely often gives Fn1=0, while Fn=Hn. Consequently the sole graded piece canonically equals Hn, for both total complexes.

F1step 2.1
4.1

By naturality of the abutment, the isomorphism on that sole graded piece induced in step 2.1 is exactly Hn(ρ) 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 D the edge is the identity and the edge square for ρ commutes. Hence Hn(ρ) is invertible. Negative-degree homologies are zero and n=0 uses F1=0, so ρ is a quasi-isomorphism in all degrees.

F2F3F4step 2.1step 3.1
5.1

Exchange the two coordinates and the arrows h,v. 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 Bp=0 for every p, 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.

F1F4step 4.1

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