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.

Complete exhaustive filtered complex convergence criterion

Statement

Assume AC. Let (C,d,F) be an increasing filtered complex of modules over a fixed ring, exhaustive and complete in every degree: pFpCn=Cn,Cnlimm0Cn/FmCn. Suppose that at every bidegree (p,q) all outgoing differentials dp,qr vanish for sufficiently large r, with a bound depending on (p,q). Then its spectral sequence converges weakly to actual homology with the induced image filtration and actual-cycle identifications.

If additionally it is bounded above on each total-degree diagonal, then convergence is strong: the homology filtration is exhaustive, separated and complete, and incoming differentials also eventually vanish at each bidegree. Precisely, the sufficient diagonal condition used here is that for every integer k there are finite integers ak0 and Pk such that Es,ksak=0 for all s>Pk. In particular the condition holds if a single fixed starting page is bounded above on each diagonal. Completeness without outgoing regularity is not asserted to suffice.

Facts & Assumptions

[F1]

Approximate cycle obstruction sequence for a complete filtered complex supplies, in each chain degree, the exact sequence for A(p,t), Zp, S(p,t), Qp=RtA(p,t), together with LpQp=0 and RpZp=0, under AC.

[F2]

Countable tower six term limit sequence supplies the six-term sequence, cofinal-tail invariance, and surjectivity of limit projections for towers with surjective transitions, under AC.

[F3]

R page of the spectral sequence of a filtered complex and R cycles and r boundaries of an increasingly filtered complex give Ap,nr=FpCnd1FprCn1, Er=Ar/(Ap1r1+dAp+r1r1) for r1, and its projected model Zˉr/Bˉr in E0.

[F4]

The filtered differential induces d r on the r page gives dr[x]=[dx]; The next page is the homology of the current page identifies each next page with the homology of this differential.

[F5]

Limiting cycles boundaries and e infinity defines E=(rZˉr)/(rBˉr) for modules. Induced filtration on homology defines FpHn by images of actual filtered cycles.

[F6]

Countable tower completion obstruction exact sequence identifies the kernel and cokernel of homology completion with the intersection and Delta cokernel of its subgroup tower, under AC.

[F7]

Weak convergence of a spectral sequence requires the actual-cycle graded identifications. Strong convergence of a spectral sequence additionally requires two-sided regularity and exhaustive, separated, complete target filtration.

[F8]

The Axiom of Choice is assumed for the cited tower lemmas, simultaneous approximate primitives and recursive compatible lifts. No splitting of the homology filtration is selected.

Proof

Given: The complete exhaustive filtered complex in the statement. In each degree use the notation of [F1] and put Bn=d(Cn+1). All towers tend toward minus infinity with fixed finite upper endpoints; [F2] identifies different endpoints.

1.1

Fix n,p and r1. In the projected model, S(p,pr)=Zˉp,npr. We claim the outgoing kernel in Er is S(p,pr1)/Bˉr. Indeed if dr[x]=0, [F3]–[F4] give dx=a+db with aApr1,n1r1 and bAp1,nr1. Then xbAp,nr+1 and has the same image as x modulo Fp1Cn. Conversely an (r+1)-cycle has differential in Fpr1, hence in the first summand of the target denominator because its next differential is zero; it is therefore killed by dr. Every projected boundary is represented by an actual differential and lies in every later projected cycle group. The claimed kernel follows in both directions.

F3F4
1.2

For the second clause only, assume the additional diagonal hypothesis in this step and fix n. Take a1 and P such that Es,n+1sa=0 for s>P; increasing an+1 to 1 if necessary preserves vanishing by [F4]. There is a uniform primitive bound: if tPa and bFtCnd(Cn+1), then b=dy for some yFPCn+1. Start with any primitive in some Fs by exhaustiveness. If s>P, then dy=bFtFsa, so yAs,n+1a. Since the corresponding Ea is zero, [F3] writes y=z+dw with zAs1,n+1a1Fs1Cn+1. Replacing y by z preserves its differential. Repeat this finite process sP times to obtain the bound. If initially sP, no reduction is needed. No infinite family of primitive choices is involved in this finite descent.

F3F4
1.3

For each n the sequence of subgroup towers 0BnFmCnZmFmHn(C)0 is exact: boundaries are cycles and the last map is onto by the image-filtration definition. The right end of [F2] and RmZm=0 from [F1] imply RmFmHn(C)=0. Thus [F6] makes the canonical completion map on homology onto. This surjectivity in fact used only the first-clause hypotheses.

F1F2F5F6F8
2.1

By step 1.1, outgoing dr=0 exactly when S(p,pr)=S(p,pr1): these nested groups have the same quotient by the common subgroup Bˉr precisely when they are equal. Thus outgoing regularity makes the inclusion tower S(p,t) eventually constant. Its Rt is zero by [F2]. The sequence of [F1] then makes every Qp1Qp surjective. By [F2], LpQp projects onto every term of this tower, whereas [F1] makes that limit zero. Hence Qp=0 for every p, in every chain degree. The same exact sequence now identifies Zp/Zp1 with S(p,) by the actual-cycle map.

F1F2F8step 1.1
3.1

Exhaustiveness identifies rBˉr with the image of FpCnd(Cn+1) in FpCn/Fp1Cn. For if b=dyFpCn, put yFsCn+1 by exhaustiveness and choose r1 with p+r1s. Then yAp+r1,n+1r1 because its differential lies in Fp, so b is a page boundary. The converse holds since every such representative is a differential. Combining [F5] with step 2.1 gives Ep,npZp/(Zp1+(FpCnd(Cn+1))). The right quotient is FpHn/Fp1Hn: a cycle zZp has class in the previous image exactly when z=z+b for a cycle zZp1 and an actual boundary b, necessarily in FpCn. Thus the map is onto and has exactly the displayed kernel. It sends an actual cycle to its own homology class, proving weak convergence as defined in [F7]. All maps commute with filtered chain maps because they are inclusions and quotient maps.

F3F5F7step 2.1
3.2

For any fixed P, the submodule d(FPCn+1) is closed in Cn. Explicitly suppose xt(d(FPCn+1)+FtCn). Choose ytFPCn+1 with xdytFtCn for countably many cofinal t, using [F8]. Their classes modulo A(P,t), now formed in degree n+1, are compatible: for tt, d(ytyt)FtCn. Apply [F2] to 0A(P,t)FPCn+1FPCn+1/A(P,t)0 with constant middle tower. Its RtA(P,t)=QP is zero by step 2.1, so one yFPCn+1 realizes all the classes. Then xdy lies in every FtCn and vanishes by completeness's injectivity. This proves the asserted closedness.

F1F2F8step 2.1
4.1

Under the additional diagonal hypothesis, the full boundary submodule Bn=d(Cn+1) is closed. Suppose xt(Bn+FtCn). Fix t0Pa and b0Bn with xb0Ft0. For every tt0 there is btBn with xbtFt. Then btb0BnFt0, so step 1.2 puts it in d(FPCn+1). Hence xb0 lies in the closure of this fixed-bound image and belongs to it by step 3.2. Thus xBn. This argument does not assume that x or the individual approximating boundaries already have small filtration.

step 3.2step 1.2
5.1

Under the second-clause hypotheses the homology filtration is separated. If a class lies in every FtHn, represent it by a cycle z. For every t it has a representative ztFtCn with zztBn. Hence zt(Bn+FtCn)=Bn by step 4.1, so the class is zero. Exhaustiveness follows by putting any single cycle in some FpCn. The completion map is injective by this separatedness and [F6], and is surjective by step 1.3, hence is an isomorphism.

F5F6step 4.1step 1.3
6.1

At (p,np) the incoming differential on page r has source of degree n+1 and filtration p+r. For ra and p+r>P, that source is zero because it is a successive subquotient of the zero Ep+r,n+1pra term by [F4]. Thus incoming differentials vanish eventually at every fixed bidegree. Together with outgoing regularity this gives two-sided stationarity. Step 3.1 supplies the actual-cycle comparison and step 5.1 supplies the exhaustive, separated and complete homology filtration. These are exactly all requirements of strong convergence in [F7].

F4F7step 3.1step 1.2step 5.1
7.1

The two clauses follow from steps 3.1 and 6.1. Zero complexes and zero modules satisfy the residue, quotient and primitive calculations; repeated filtration pieces cause no exception. For a one-piece finite filtration, the arguments reduce to the ordinary homology page, with zero sufficiently small filtration and constant completion tail. There is no first-quadrant or nonnegative-degree assumption. The endpoint a=0 is handled by its replacement with 1 in step 1.2, and s=P needs no descent. Countable tower sections and simultaneous representatives use AC through [F1], [F2], [F6] and step 3.2; no assertion is made without that assumption. Weak convergence alone has not been used to assert separatedness.

F1F2F6F8step 3.1step 3.2step 1.2step 6.1

Source notes

Weibel, Chapter 5, Corollary 5.5.8, Proposition 5.5.9 and Theorem 5.5.10, printed pp.138–140, motivate the two clauses. The actual proof here uses the fully supplied elementary Delta lemmas and bounded primitive descent, developed in the owner research argument research/phase-2-next-20-topology-owner-delta-alternatives.md, sections 1,4–6. No later Grothendieck theorem, Milnor sequence or unproved Mittag–Leffler implication is consumed. Earlier incomplete source extraction is not retrospectively certified. The Step 3 escalation was resolved by the owner repair recorded on 2026-09-10 (research/phase-2-next-20-step3b-owner-thm-complete-exhaustive-filtered-complex-convergence-criterion.json); this authored proof is the reviewed object.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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