Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-13
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.

Finite-diagonal cohomological double-complex spectral sequences

Statement

Let Ca,b be a commuting double cochain complex in an abelian category, zero for a<0 or b<0. Put Tn=a+b=nCa,b with D=h+(1)av. The decreasing filtrations by ap and by bp give spectral sequences with E1p,q=Hq(Cp,),E1p,q=Hq(C,p). The first d1 is induced by h; the second by (1)qv. Both have dr:Erp,qErp+r,qr+1. Their stationary terms are FpHp+q(T)/Fp+1Hp+q(T), where FpHn(T)=im(Hn(FpT)Hn(T)). For each n0, F0Hn=Hn and Fn+1Hn=0. In particular convergence is strong with a finite filtration. A lower bound ac is allowed by translation, retaining original total degree a+b.

Facts & Assumptions

Given: The bicomplex and two decreasing filtrations above.

[F1]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

[F2]

The homological column and row theorems compute the two pages and their finite image-filtration abutments (The column filtration spectral sequence of a first quadrant double complex, The row filtration spectral sequence of a first quadrant double complex).

[F3]

A short exact sequence of cochain complexes yields the long exact cohomology sequence (The long exact sequence in cohomology).

Proof

1.1

Replace v on column a by (1)av. The mixed composites sum to (1)ahv+(1)a+1vh=0, and the new vertical arrow still squares to zero. Then regard the resulting cochain arrows as arrows in the opposite category. Thus the arrow from Ca1,b to Ca,b becomes a homological arrow from bidegree (a,b) to (a1,b) in the opposite category, with analogous vertical arrows. The square-zero and anticommuting identities are unchanged on reversing composition. The total complex there is the opposite of T. The increasing column cutoff through p is the quotient T/Fp+1T viewed as a subobject in the opposite category; the same holds for the row cutoff.

F1givenalgebra
2.1

Apply both homological theorems in that category. Opposite-category homology is original-category cohomology, since kernel and cokernel exchange. Reversing a page arrow of bidegree (r,r1) gives bidegree (r,1r). For the first page, the within-column differential is (1)pv. This constant sign does not change its kernel, image, or their canonical quotient, so vertical cohomology has its canonical quotient identification and the d1 on that quotient is induced by h. For the row filtration the within-row differential is h and the next differential on horizontal degree q is (1)qv.

F2step 1.1
2.2

Translate the abutment precisely. An image subobject of Hn(Top) in the opposite category corresponds to the quotient of Hn(T) by ker(Hn(T)Hn(T/Fp+1T)). The long exact sequence for 0Fp+1TTT/Fp+1T0 identifies this kernel with Fp+1Hn(T). Thus the opposite of the successive quotient between cutoffs p1 and p is exactly FpHn/Fp+1Hn, proving the asserted abutment rather than an unrelated filtration.

F2F3step 1.1
3.1

In total degree n all summands have indices between zero and n, giving the stated endpoints; negative total degrees vanish. Finite filtrations are exhaustive and separated, and their quotient towers are eventually constant with value Hn(T), so the completion map is an isomorphism. The first-quadrant bounds make both incident differentials eventually zero at each bidegree. These prove strong convergence, including zero and one-summand diagonals. If ac, set a=ac and replace v by (1)cv; then h+(1)a((1)cv)=h+(1)av. The normalized total degree is nc, and translation back preserves the original target degree. All constructions use finite biproducts and prescribed signs; no choice is used.

F2step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

16 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