Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 low-degree filtration sequence of a first-quadrant bicomplex

Statement

Let Dpq, p,q0, be a bicomplex with h:DpqDp1,q, v:DpqDp,q1, h2=v2=hv+vh=0. Set Tn=p+q=nDpq, d=h+v, and Epq2=Hp(Hq(D,,v),h). Then there is a natural exact sequence H2(T)e2E202d2E012jH1(T)e1E1020. The filtration is FrTn=pr,p+q=nDpq. This holds for module bicomplexes, and with the same kernel/image constructions in an abelian category. No general spectral-sequence convergence theorem is assumed.

Facts & Assumptions

Given: A first-quadrant anticommuting bicomplex as stated; missing negative positions mean zero.

[F1]

A differential has square zero (Chain complex in an abelian category).

[F2]

Homology is cycles modulo boundaries (Homology object of a chain complex).

Proof

1.1

The identity (h+v)2=0 makes T a chain complex, and h lowers p while v preserves it, so FrT is a subcomplex. The quotient FrT/Fr1T has just differential v; its homology is the rth column homology, whose induced differential is h. This yields the stated E2 subquotients using only kernels and images. Below, an element denotes a representative in these subquotients. In an abelian category the same notation means a morphism into the indicated kernel after pulling back the epimorphism onto the image; every lift below is of this form, and equality of subobjects can be checked after such epimorphic pullbacks. Thus the calculations do not require objects to have underlying sets.

F1F2givenalgebra
2.1

A class in E202 is represented by xD20 with hx=vy for some yD11. Set d2[x]=[hy]E012. Indeed vhy=hvy=h2x=0. Replacing y by another such lift changes hy by h of a vertical cycle, zero in E2. Replacing x by x+vt+hu with tD21, uD30 changes a compatible y to y+ht; its h-image is unchanged. These are precisely the vertical-boundary and horizontal-boundary changes allowed in E202. Hence d2 is a well-defined homomorphism.

step 1.1algebra
3.1

A total 2-cycle has components (x,y,z)D20D11D02 with hx+vy=0 and hy+vz=0. Define e2[(x,y,z)]=[x]. A total 3-boundary changes x by hu+vt from D30 and D21, so e2 is well-defined. Its image is in the kernel of d2. Conversely if d2[x]=0, choose y as in step 2.1. Then hy=ha+vb for a vertical cycle aD11 and bD02. The triple (x,ya,b) is a total cycle and maps to [x]. This proves exactness at E202.

step 2.1algebra
3.2

A vertical cycle zD01 is a total cycle; define j[z]=[(0,z)]. Replacing z by vb+ha with va=0 adds the total boundary d(b+a), so j is well-defined on E012. If z=hy as in step 2.1, then z=d(x+y), proving jd2=0. Conversely, if (0,z)=d(x+y+b), its p=1 component gives hx+vy=0 and its p=0 component gives z=hy+vb. Therefore [z]=d2[x]. This proves exactness at E012.

step 2.1algebra
4.1

A total 1-cycle (a,b)D10D01 satisfies ha+vb=0. Define e1[(a,b)]=[a]E102. Boundaries change a by hx+vy, so e1 is well-defined. Every E102 representative a admits b with ha=vb, hence e1 is onto. Clearly e1j=0. If [a]=0, write a=hx+vy with xD20, yD11. Subtract d(x+y) from (a,b); the result is (0,bhy), a vertical cycle, hence in the image of j. This proves exactness at H1(T) and at the final nonzero term.

step 1.1step 3.2algebra
5.1

All constructions commute with morphisms of bicomplexes: they use the same components, and images of chosen lifts are compatible lifts in the target, whose class is independent of the lift. Only components of total degree at most three were used. In particular F0H1(T)=imjE012/imd2 and H1(T)/F0H1(T)E102 by steps 3.2–4.1. These explicit subquotients establish the required low-degree filtration assertions without an infinite limiting process. Zero rows or columns are permitted throughout.

step 3.1step 3.2step 4.1algebra

Remarks

The source low-degree sequences are Löh Theorem 3.2.18 and Weibel Low Degree Terms 6.8.3. The finite component chase above supplies the filtration argument locally.

Depends on

Used by

Dependency tree · two levels

6 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