Alphabeta Math
PropositionStatement: 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.

A filtered chain map induces a morphism of spectral sequences

Statement

Every filtered chain map induces a morphism of spectral sequences from page zero, respecting identities and composition. If its map on some page s is an isomorphism in every bidegree, it is an isomorphism on every later page and on E∞ whenever the defining limiting subobjects exist.

Facts & Assumptions

Given: A filtered chain map f:C→D between filtered complexes in an abelian category.

[F1]

A filtered chain map satisfies df=fd and preserves each filtration piece (Filtered chain map).

[F2]

The next-page isomorphisms are induced by inclusion of corrected cycle numerators and are natural (The next page is the homology of the current page).

[F3]

A page morphism commutes with d and with the specified homology transitions (Morphism of spectral sequences).

[F4]

Maps preserving subobjects descend uniquely to quotients (Spectral sequence subquotient and local lifting calculus).

[F5]

The limiting term is the quotient of the meet of projected cycles by the join of projected boundaries, conditional on existence (Limiting cycles boundaries and e infinity).

[F6]

The filtered pages have their projected cycle/boundary quotient model inside the initial page (R page of the spectral sequence of a filtered complex).

Proof

technique · direct
1.1F1F4

For x through Ap,nr(C), fnx lies in FpDn and dDfnx=fn−1dCx lies in Fp−rDn−1. Hence f carries Ar(C) into Ar(D). It also carries Ap−1r−1(C) into its target counterpart and dCAp+r−1r−1(C) into dDAp+r−1r−1(D). For r=0 it preserves both Fp and Fp−1. Thus [F4] supplies each quotient map fr.

1.2F4F5F6

Fix a bidegree. For subobjects Bs⊆U⊆Zs, the map U↦U/Bs identifies this interval with the subobjects of Zs/Bs=Es. The inverse is pullback under the epic quotient: its restricted projection is epic by [F4], with kernel Bs, so the two operations are inverse by the image and quotient identities in [F4]. Both preserve inclusion. An order isomorphism preserves every existing meet and join: its inverse sends each lower bound back to a lower bound, proving the greatest-lower-bound property in both directions, and the upper-bound argument is identical. Apply this to the tail families Zt,Bt for t≥s. Earlier cycles contain Zs and earlier boundaries lie in Bs, so deleting their finitely many terms changes neither limit. Thus the limits of the tail inside Es are Z∞/Bs and B∞/Bs; their quotient is Z∞/B∞ by the nested-quotient identity [F4]. This identifies the limiting model started at s with [F5].

2.1F1F2F3F4step 1.1

On the numerator, dDfn=fn−1dC, so after quotient descent and epic cancellation dDrfr=frdCr. The inclusion-induced comparisons used to define α in [F2] commute with f by the same numerator restrictions; their inverses commute too. Thus fr+1αrC=αrDH(fr), exactly [F3].

2.2F4step 1.1

For an identity chain map the descended map is the identity because its composite with the quotient is unchanged. For g after f, both (gf)r and grfr compose with the source quotient to the map induced by gnfn. Uniqueness in [F4] equates them.

3.1F3F4step 2.1

Suppose fs is an isomorphism in every bidegree. Its inverse commutes with the differentials: multiply d′fs=fsd on the two sides by the corresponding inverse components. The restrictions of these inverse maps give inverse maps on kernels and images and hence on homology by [F4]. The transition identity in step 2.1 then makes fs+1 an isomorphism. Induction gives the assertion on all later pages, and their inverses respect the transitions.

4.1F2F4F5F6step 3.1step 1.2∎

By step 3.1 the isomorphism fs and its inverse carry each recursively defined cycle and boundary subobject of Es(C) onto its counterpart in Es(D): start at s with the whole object and zero; at each transition take inverse images of the outgoing kernel and incoming image under the current cycle quotient. These are the projected subobjects of [F6]. At r=0, the kernel is the projection of Ap,n1 and the incoming image is the projection of d(FpCn+1), directly from d0[x]=[dx], where n=p+q. For r≥1, if dx=a+db represents zero in the target, lift locally by [F4]; the target lower-filtration term a permits x−b on the next cycle numerator, while b has filtration p−1 and vanishes on projection. Conversely a next-cycle representative maps to zero. The incoming image is the projection of dAp+r,n+1r, precisely the new projected boundary term. This proves the recursive identification with both directions for cycles and the exact image for boundaries; it is also the quotient comparison in [F2]. The resulting order isomorphism therefore identifies the existing meets and joins by step 1.2. Quotient descent gives inverse maps on their quotients. Under the limiting identifications of step 1.2 this is the induced f∞, proving the assertion without assuming unbounded abutment or exactness of infinite sums.

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. Compare Stacks §12.24, Lemma 12.24.4.

The infinity clause supplies the promised argument for Weibel, Chapter 5, Exercise 5.2.3, printed p.125; existence of the limiting subobjects is explicit, as in the warning preceding that exercise.

Depends on

Dependency tree · 2 levels

Sources