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

A filtered complex produces an exact couple

Statement

For an increasingly filtered chain complex (C,d,F) in an abelian category, the families Dp,q1=Hp+q(FpC),Ep,q1=Hp+q(FpC/Fp1C) form an initial exact couple. Its maps are induced by inclusion i, quotient j, and the homology connecting morphism k, of degrees (1,1), (0,0) and (1,0) respectively. No boundedness or completeness hypothesis on the filtration is needed for this construction.

Facts & Assumptions

[F1]

Filtered chain complex makes each filtration piece a subcomplex.

[F2]

Spectral sequence subquotient and local lifting calculus supplies quotient descent and normality of subobjects; Short exact sequence of complexes means exactness in every chain degree.

[F3]

The long exact sequence in homology gives the exact homology sequence of each short exact sequence of complexes, with connecting degree 1.

[F4]

Exact couple specifies the three required exactness conditions and initial grading.

Proof

Given: The filtered chain complex in the statement, with integer indices throughout.

1.1

Since d preserves Fp1CFpC, it induces a unique differential on each quotient GpC=FpC/Fp1C. Its square is zero after precomposition with the epic quotient, since d2=0. The inclusion and quotient therefore form chain maps. In each degree the inclusion is a kernel of its cokernel, so 0Fp1CFpCGpC0 is a short exact sequence of complexes.

F1F2given
2.1

With n=p+q, the homology sequence contains Hn(Fp1C)Hn(FpC)Hn(GpC)Hn1(Fp1C)Hn1(FpC). In the proposed notation these arrows are Dp1,q+11iDp,q1jEp,q1kDp1,q1iDp,q11. This calculates the degrees of all three maps, including the q coordinate of the connector.

F3step 1.1
3.1

Exactness of this sequence gives imi=kerj in Dp,q1, imj=kerk in Ep,q1, and imk=keri in Dp1,q1. Letting (p,q) range over all integers gives every vertex required by the initial exact-couple definition. The argument applies when adjacent filtration pieces coincide or vanish; their zero quotient causes no exception. It treats the families componentwise and never takes an infinite sum of exact sequences, so no infinite exactness or choice hypothesis is used.

F3F4step 2.1

Depends on

Used by

Dependency tree · two levels

13 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