Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Bounded filtered complex spectral sequence abuts to filtered homology

Statement

If the filtration on every Cn is finite, the spectral sequence of the filtered chain complex stabilizes pointwise and naturally abuts to Hn(C) with its image filtration. This homology filtration is finite, exhaustive and separated. No uniform filtration bound in n is required.

Facts & Assumptions

Given: A filtered complex with a finite filtration on each chain object and fixed p,n.

[F1]

Finite in degree n means FanCn=0 and FbnCn=Cn for some integers (Exhaustive separated bounded and finite filtration).

[F2]

Graded homology is (FpCn∩ker⁡dn)/((Fp−1Cn∩ker⁡dn)+(FpCn∩im⁡dn+1)) (The associated graded of filtered homology is a subquotient of chain level data).

[F3]

The page transition is the natural inclusion-induced homology isomorphism (The next page is the homology of the current page).

[F4]

Eventually stationary projected cycles and boundaries define E∞ (Limiting cycles boundaries and e infinity).

[F5]

Finite support on each diagonal forces pointwise stabilization (Degree reasons force stabilization in a bounded region).

[F6]

Abutment is a specified identification with the associated graded of filtered homology (Abutment to a filtered object).

[F7]

Image pullbacks and quotient comparisons are canonical and natural (Spectral sequence subquotient and local lifting calculus).

Proof

technique · direct
1.1F1F7

Fix n,p and write Z=ker⁡dn, D=im⁡dn+1. Choose R≥1 so that Fp−rCn−1=0 and Fp+r−1Cn+1=Cn+1 for every r≥R; [F1] supplies bounds in precisely these two degrees. Then Ap,nr=FpCn∩Z and Ap−1,nr−1=Fp−1Cn∩Z. Also Ap+r−1,n+1r−1=dn+1−1(FpCn), whose image is FpCn∩D by the epic-pullback calculation [F7].

2.1F1F2F4F5step 1.1

The page quotient is therefore stationary with value FpCn∩Z(Fp−1Cn∩Z)+(FpCn∩D). Its projected numerator and boundary subobjects are stationary too, giving exactly E∞ under [F4]. By [F2] this quotient is canonically gr⁡pHn(C). Separately the initial page on diagonal n vanishes outside an<p≤bn, so [F5] supplies vanishing of both incident differentials and stabilization in the specified sense.

2.2F1F2step 1.1

For p≤an, the cycle subobject FpCn∩Z is zero, so the image filtration on Hn(C) is zero. For p≥bn it is Z, whose quotient map surjects onto Z/D=Hn(C); hence FpHn(C)=Hn(C). Thus the filtration is finite. A family containing 0 and Hn has meet 0 and join Hn by the subobject order, proving separation and exhaustiveness without infinite exactness.

3.1F3F6F7step 1.1step 2.1step 2.2∎

A filtered chain map preserves the cycle and boundary subobjects in steps 1.1–2.1, and all quotient comparisons commute by [F7]. The page transitions [F3] were built from the same cycle inclusions; their stationary identifications agree with these comparisons. Thus the displayed isomorphisms form natural abutment data in the sense of [F6]. Each argument fixed n before using its finite bounds, so no common bounds over all degrees were needed.

Source notes

Stacks §12.24, Lemma 12.24.11 and equations 12.24.5.1–2; Weibel, bounded case of Theorem 5.5.1 pp.135–136. The chain proof explicitly uses degrees n−1 and n+1; no unbounded convergence clause is used.

Depends on

Dependency tree · 2 levels

Sources