Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Short exact sequences of filtered complexes give compatible exact couples

Statement

Let 0AαBβC0 be a short exact sequence of filtered complexes in an abelian category, whose maps are strict degreewise. Thus, identifying An with its image in Bn, one has FpAn=AnFpBn and βn(FpBn)=FpCn, so 0FpAnFpBnFpCn0 is exact for all p,n. Then the associated-graded sequences are short exact sequences of complexes. The filtered maps induce morphisms between the three associated exact couples, commuting with i,j,k, and hence compatible morphisms of all their derived couples and spectral sequences. This does not assert short exactness of the homology D or E terms.

Facts & Assumptions

[F1]

Filtered chain map preserves all filtration subcomplexes. A filtered complex produces an exact couple constructs Dp,q=Hp+q(Fp) and Ep,q=Hp+q(Fp/Fp1) with inclusion, quotient and connecting maps.

[F2]

Spectral sequence subquotient and local lifting calculus supplies epic local lifts, nested quotients and descent of subobject containments.

[F3]

Naturality of the homology connecting morphism gives the connecting square for a morphism of short exact sequences of complexes. Homology respects identities and composition preserves commuting chain-map squares under homology.

[F4]

A map of exact couples induces a map of spectral sequences derives and iterates commuting couple maps.

Proof

Given: The strict filtered short exact sequence. Fix p,n and write grpX=FpX/Fp1X.

1.1

The restriction of αn to FpAn is monic. Its image is AnFpBn, exactly the kernel of the restriction of βn to FpBn. Strict surjectivity makes the latter map epic onto FpCn. The maps commute with the restricted differentials by [F1], so these are short exact sequences of subcomplexes for every p.

F1F2
1.2

For either filtered map f=α or β, there is a commutative ladder from 0Fp1XFpXgrpX0 to the corresponding sequence for its target Y. Passing to homology gives the couple's D and E comparison maps. The squares for i and j commute because their chain maps are respectively filtration inclusions and quotient projections and homology preserves compositions. The square for k:Ep,qDp1,q is exactly the connecting square in [F3], with homology degree decreasing from p+q to p+q1. Hence all three couple squares commute at their prescribed bidegrees.

F1F3
2.1

The induced graded map from A is monic: an element of FpAn mapping into Fp1Bn lies in AnFp1Bn=Fp1An. The graded map to C is epic by lifting from FpCn to FpBn locally. If bFpBn maps into Fp1Cn, lift that image locally to bFp1Bn. Then bbkerβnFpBn is the image of an element of FpAn, and has the same graded class as b. Conversely a graded class from A maps to zero because βα=0. This proves both kernel-image containments. The element notation means morphisms after finite epic pullbacks, and all equalities descend by [F2]. Thus the graded sequence is short exact degreewise; its maps commute with differentials by quotient descent.

F1F2step 1.1
3.1

Apply [F4] to both maps from step 1.2 to obtain the derived-couple and spectral maps on all pages. The graded short exactness in step 2.1 is a statement at the chain level; step 1.2 applies homology and yields its natural connecting ladders, not a claim that each induced homology arrow is monic or epic. Zero complexes, equal successive filtration pieces and all integer indices are permitted throughout. Only finite epic lifting and canonical quotient arrows were used, without AC or a choice of splitting.

F4step 2.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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