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.

The next page is the homology of the current page

Statement

For the pages of a filtered complex there is a specified natural isomorphism αr:H(Er,dr)p,q→∼Ep,qr+1(r≥0). The homology at (p,q) uses the incoming map from (p+r,q−r+1) and outgoing map to (p−r,q+r−1).

Facts & Assumptions

Given: A filtered complex in an abelian category, integers p,q, and r≥0. All element notation denotes morphisms after epic pullback as in [F4].

[F1]

Er=Ar/(Ap−1r−1+dAp+r−1r−1), with the separate r=0 quotient (R page of the spectral sequence of a filtered complex).

[F2]

The induced differential is [x]↦[dx] (The filtered differential induces d r on the r page).

[F3]

The page differential squares to zero (The rth differential squares to zero).

[F4]

Local epic lifts, modularity and quotient identities hold in the ambient abelian category (Spectral sequence subquotient and local lifting calculus).

[F5]

Homology is the quotient of the kernel by the boundary image (Homology object of a chain complex).

Proof

technique · direct
1.1F1F2F4F5

Fix n=p+q. For r=0 the inverse image of ker⁡d0 in FpCn is Ap,n1, since d0[x]=0 exactly when dx factors through Fp−1Cn−1. The incoming image is represented by d(FpCn+1). Thus [F4] and [F5] identify H(E0)p,q with Ap,n1/(Fp−1Cn+d(FpCn+1))=Ep,q1.

1.2F1F2F4

For r≥1 abbreviate A=Ap,nr, N=Ap,nr+1, L=Ap−1,nr−1 and J=d(Ap+r,n+1r). Let K be the inverse image in A of ker⁡dr. For a morphism x into K, [F2] says dx factors through Ap−r−1,n−1r−1+d(Ap−1,nr−1). By [F4], after an epic cover write dx=a+db with a and b through those respective subobjects. Then d(x−b)=a lies in Fp−r−1Cn−1 and x−b lies in FpCn, so x−b factors through N; b factors through L. Descent of subobject membership gives K⊆N+L.

2.1F1F2F3F4F5step 1.2

Conversely, for x through N, dx lies in Fp−r−1Cn−1 and d(dx)=0, hence through Ap−r−1,n−1r−1; for b through L, db lies in the target boundary-image summand. Therefore [F2] sends both to zero and N+L⊆K. Thus K=N+L. The original boundary summand d(Ap+r−1,n+1r−1) lies in J, because its preimage has filtration at most p+r and differential at most p. The incoming image in [F5] is the image of J in A/Br. By [F3] it lies in the kernel. Consequently H(Er)p,q≅(N+L)/(L+J).

3.1F1F4step 2.1

Every map through J has differential zero and filtration at most p, so J⊆N. Modularity [F4] gives N∩(L+J)=(N∩L)+J. The intersection N∩L is Fp−1Cn∩d−1(Fp−r−1Cn−1)=Ap−1,nr. The sum/quotient formula therefore gives (N+L)/(L+J)≅N/(Ap−1,nr+d(Ap+r,n+1r))=Ep,qr+1. In particular the inclusion N→K is epic after taking homology and has exactly the displayed kernel; this verifies both surjectivity and injectivity of the induced comparison.

4.1F4step 1.1step 1.2step 3.1∎

Define αr to be the inverse of this inclusion-induced isomorphism Er+1→H(Er), using step 1.1 when r=0. Its local rule sends a homology class represented by x to the class of x-b constructed in step 1.2. Independence of the correction follows from the kernel calculation in step 3.1, rather than from choosing b canonically. For a filtration-preserving chain map f, the inclusions of N into K commute with f, and f(x−b)=f(x)−f(b) with d′f=fd. The induced quotient squares commute by [F4]; their inverses do too. This proves naturality.

Source notes

Weibel, Chapter 5, Construction 5.4.6 and Lemma 5.4.7, pp.133–134; Sharifi, Theorem 4.2.3, pp.91–92. Increasing homological indices are used here.

Depends on

Dependency tree · 2 levels

Sources