Alphabeta Math
Pipeline-generated
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.

Double Complexes Exact Couples and Convergence

1 · Prerequisites

2 · Summary

A double complex carries two differentials, and its total complex turns them into a single differential. We use anticommuting homological maps and total differential h+v; a commuting convention first needs the stated sign twist. Direct sums and products require their own existence hypotheses. Finite diagonals identify the two totalisations, while the binary infinite-diagonal example shows why this cannot be extended without a bound.

The row filtration takes horizontal homology first and transposes the double-complex coordinates; the column filtration takes vertical homology first. Their finite first-quadrant constructions compute the same total homology with potentially different image filtrations. The assembly theorem uses the actual projection onto surviving degree-zero column homology. It does not choose representatives to embed that homology into the total complex.

Exact couples provide a second construction. The derived maps are proved well defined and exact at all three vertices, with the changing degree of j written explicitly. The comparison with filtered subquotients preserves the differential sign and the specified page transitions. Here “regular” means eventual vanishing of both incident differentials; outgoing-only source regularity is named separately.

Convergence identifies limiting terms with graded pieces of a filtered target. The finite-filtration theorem includes completeness by a constant inverse-system tail. The countable completion and six-term tower sequences explicitly assume AC for representatives and lifts. A three-term double-Delta calculation controls approximate-cycle obstructions. Outgoing regularity then yields actual-cycle weak convergence; an upper diagonal bound gives finite descent of primitives and strong convergence. The owner resolved that Step 3 escalation by repair on 2026-09-10, and the proof supplied here is the reviewed object. The comparison theorem instead assumes the necessary abutment data, and its finite or complete filtered-isomorphism lifting lemma is choice-free.

The two five-term sequences are derived separately with their normalized filtration endpoints. Finite projective graded pieces split a filtration only noncanonically. The final refutations and the companion calculations distinguish page information, filtration data and the underlying homology target.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Homological double complex

Definition

In an abelian category, a homological double complex consists of objects Cp,q for all (p,q)Z2 and morphisms hp,q:Cp,qCp1,q,vp,q:Cp,qCp,q1. For every pair of integers they satisfy hp1,qhp,q=0,vp,q1vp,q=0,hp,q1vp,q+vp1,qhp,q=0. The third equality is in Hom(Cp,q,Cp1,q1). The first two equalities say that every row and every column is a chain complex. They are separate axioms; anticommutation alone does not imply them.

A morphism f:CD consists of maps fp,q:Cp,qDp,q with fp1,qhp,qC=hp,qDfp,q,fp,q1vp,qC=vp,qDfp,q. Identities and composition are componentwise. The complex is first quadrant if Cp,q=0 whenever p<0 or q<0.

Zero objects and complexes supported at one bidegree are allowed. Arrows meeting a zero object are zero, including the outgoing arrows on the axes of a first-quadrant complex. This definition requires no infinite products, coproducts, or choices of representatives.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Commuting versus anticommuting double complex conventions

Conventions

Suppose horizontal and vertical homological arrows h,v separately square to zero and satisfy the commuting convention hv=vh. Define v~p,q=(1)pvp,q, leaving h unchanged. On Cp,q the two mixed composites have sum hp,q1v~p,q+v~p1,qhp,q=(1)php,q1vp,q+(1)p1vp1,qhp,q=0. Also v~p,q1v~p,q=(1)2pvp,q1vp,q=0. Thus (C,h,v~) satisfies Homological double complex.

Applying the same twist twice restores v. Starting with anticommuting arrows instead, the same calculation gives commuting twisted arrows. Bidegree-preserving morphisms commute with the twist because their source and target have the same p. Zero arrows and characteristic two cause no exception: an additive inverse and its original still sum to zero.

Consequently the expression for the total differential is h+(1)pv in the commuting convention and h+v~ after translation. The library starts with anticommuting arrows, so its total differential is simply h+v. An additional sign twist on those arrows would change the convention again. All signs are specified integers; no selection or infinite summation occurs.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Direct sum total complex of a double complex

Definition

Let C be a homological double complex in an abelian category. Suppose that for every integer n the diagonal coproduct below exists, and write its injections as ιp,qn: Tn=Totn(C)=p+q=nCp,q. Define dn:TnTn1 to be the unique arrow with dnιp,qn=ιp1,qn1hp,q+ιp,q1n1vp,q(p+q=n). Each right-hand side is the sum of two morphisms with the same source and target. The coproduct universal property supplies a unique dn from this family; no infinite sum in a morphism group is required.

The resulting direct-sum total complex has differential of degree 1. Its chain condition is established in The total differential squares to zero . A diagonal with only zero objects has zero coproduct: every family of maps from its objects is the unique zero family. A diagonal with exactly one nonzero object has that object as coproduct. For general infinite diagonals existence is a hypothesis, not an implication of being an abelian category. No choices of elements or representatives enter this construction.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The total differential squares to zero

Statement

For the direct-sum totalisation of an anticommuting homological double complex, dn1dn=0 for every integer n.

Facts & Assumptions

[F1]

Direct sum total complex of a double complex defines dn by its composites with the diagonal coproduct injections.

[F2]

Homological double complex gives h2=0, v2=0 and the indexed anticommuting-square identity.

[F3]

Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations gives uniqueness of an arrow out of a coproduct from its composites with all injections.

Proof

Given: Such a double complex C and its existing diagonal coproducts Tn, with injections ιp,qn and differentials dn.

1.1

Fix n and p+q=n. Substitute the defining formula for d twice and distribute composition over addition. This gives dn1dnιp,qn=ιp2,qn2hp1,qhp,q+ιp1,q1n2(vp1,qhp,q+hp,q1vp,q)+ιp,q2n2vp,q1vp,q. Each term is an arrow from Cp,q to Tn2.

F1algebra
2.1

The first and last composites vanish by the two square-zero axioms; the middle parenthesis vanishes by anticommutation. Therefore dn1dnιp,qn=0 for every p+q=n, including when any of the source or target components is zero.

F2step 1.1
3.1

The zero arrow TnTn2 has these same composites with every injection. Coproduct uniqueness therefore gives dn1dn=0. Since n was arbitrary, all chain identities hold. The argument also covers an all-zero or a single-supported diagonal and uses no exactness of infinite coproducts or representative selections.

F3step 2.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Product total complex of a double complex

Definition

For a homological double complex C in an abelian category, suppose each diagonal product exists. Write Pn=TotnΠ(C)=p+q=nCp,q,πp,qn:PnCp,q. Define dn:PnPn1 by the equations πa,bn1dn=ha+1,bπa+1,bn+va,b+1πa,b+1n(a+b=n1). The product universal property gives a unique arrow from this family of two-term sums; no support condition is imposed on product coordinates.

Here the chain condition can be checked directly. For a+b=n2, composing the coordinate formula twice gives πa,bn2dn1dn=ha+1,bha+2,bπa+2,bn+(ha+1,bva+1,b+1+va,b+1ha+1,b+1)πa+1,b+1n+va,b+1va,b+2πa,b+2n=0. The three coefficients vanish respectively by h2=0, anticommutation at (a+1,b+1) and v2=0. Product uniqueness implies dn1dn=0.

Thus (P,d) is the product total complex. An all-zero diagonal gives the zero product, and a single nonzero component gives that component. The construction and calculation apply in these cases too. Existence of the specified products is retained as a hypothesis; neither product exactness nor any choice of lifts is needed.

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Sum and product totalisations agree on finite diagonal double complexes

Statement

If each diagonal of a homological double complex C in an abelian category contains only finitely many nonzero objects, both totalisations exist and the canonical comparison η:Tot(C)TotΠ(C) is an isomorphism of chain complexes.

Facts & Assumptions

[F1]

Additive category supplies finite biproducts; Biproduct identifies the finite coproduct-to-product comparison as an isomorphism.

[F3]

Direct sum total complex of a double complex specifies the differential on each injection; The total differential squares to zero proves its chain condition.

[F4]

Product total complex of a double complex specifies the differential after each projection and verifies its chain condition.

Proof

Given: C as stated. Write Tn,Pn for the sum and product total objects, and ιp,qn,πp,qn for their structure maps whenever constructed.

1.1

Fix n and let In={(p,q):p+q=n, Cp,q0}. A finite biproduct of the objects indexed by In exists. Adjoining the unique maps from and to each omitted zero object makes its coproduct and product structures satisfy the universal properties for the whole diagonal: those omitted components impose no conditions on a family of maps. This constructs Tn and Pn, including In=, when both are zero.

F1F2given
2.1

Define ηn:TnPn by πa,bnηnιp,qn=1Cp,q if (a,b)=(p,q) and zero otherwise. Successive coproduct and product universal properties give its existence and uniqueness. Under the identifications in the preceding step it is precisely the finite biproduct comparison, so it is invertible. If In has one element, it is the identity on that component.

F1F2step 1.1
3.1

Test dnPηn and ηn1dnT by precomposing with ιp,qn and postcomposing with πa,bn1. Both composites are hp,q for (a,b)=(p1,q), vp,q for (a,b)=(p,q1), and zero otherwise, by the two differential formulas. Universal-property uniqueness gives dnPηn=ηn1dnT.

F2F3F4step 2.1
4.1

Multiplying this equation by the inverses gives dnTηn1=ηn11dnP. Hence the degreewise inverse is also a chain map. All components of the comparison are uniquely specified, and its inverses are unique; no simultaneous choice of lifts or representatives is involved. The conclusion holds for the zero complex and for a complex supported on one row or column as well.

step 2.1step 3.1algebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Countable sequence groups and tail filtrations

Statement

Let k=Z/2, P=kN, and let SP consist of the sequences with finite support, with N={0,1,}. Coordinate addition makes P the product and S the coproduct of countably many copies of k in abelian groups. The inclusion SP is injective but not surjective; S is countably infinite and P is uncountable.

For A=S or P, put TmA={xA:xj=0 for j<m}, m0. Then mTmA=0 and A/TmAkm, compatibly with truncation. Define its tail completion to be A^=limmA/TmA with these truncation maps. Both completions identify with P. Under these identifications SS^ is the displayed proper inclusion, while PP^ is the identity. Thus P is complete and both filtrations are separated. These assertions require no AC.

Facts & Assumptions

[F1]

Abelian-group model for spectral-sequence computations supplies abelian groups as an abelian category, coset quotients, and k=Z/2 with residues 0,1 and 1+1=0.

[F2]

Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations characterizes products by coordinate maps and coproducts by maps from their summands.

Proof

Given: k,P,S,TmA as in the statement. Residues 0,1 are identified with those digits when used in integer expressions.

1.1

The abelian group identities for coordinate addition on P hold at each index by the identities in k. The zero sequence has empty support; negatives preserve support and the support of a sum is contained in the union of the two supports, so S is a subgroup. For maps fj:Gk, the unique map GP is g(fj(g))j. For maps gj:kG, define SG by xjsupp(x)gj(xj). This sum is finite; extending the summation set by zero terms proves additivity, and the identity x=jιj(xj) proves uniqueness. These are precisely the product and coproduct properties.

F1F2given
1.2

The inclusion is injective. The constant-one sequence belongs to P but has infinite support, so does not belong to S. Each unit sequence belongs to S, and different indices give different unit sequences.

F1given
2.1

Encode xS by b(x)=j2jxjN. If xy, their finite union of supports has a largest differing index r. The magnitude of the contribution there is 2r, while the sum of the magnitudes at lower indices is at most j<r2j=2r1; the latter identity follows by starting with 0=11 and adding 2r at the next index. Hence b(x)b(y). Conversely, successive unique divisions of any nonnegative integer by 2 give its binary digits; the nonzero quotients strictly decrease, so after finitely many divisions the quotient is zero. Substituting the equations aj=2aj+1+rj back gives a0=j2jrj. Thus b is a bijection SN.

F4step 1.2algebra
2.2

The first-m-coordinates map Akm is onto by extension by zero, for either A=S or P, and has kernel TmA. It therefore induces a bijective homomorphism A/TmAkm: equality of images means the difference lies in TmA, and every tuple is represented by its zero extension. For m=0 the quotient and empty tuple group are zero. If xmTmA, take m=j+1 to conclude xj=0 at each index, so x=0.

F1step 1.1given
3.1

For any map e:NP, the sequence yj=1e(j)j lies in P and differs from e(j) at coordinate j. Thus e is not onto. If an injection PN existed, inversion on its image and the zero sequence as value off that image would define a surjection NP, which has just been excluded. Hence P is uncountable and cannot be bijective with S.

F1step 2.1given
3.2

Let L be the subgroup of m0km consisting of tuples (z(m))m for which truncating z(m+1) gives z(m). For any compatible cone of homomorphisms into km, the map sending an element to its tuple of cone images is the unique homomorphism into L inducing that cone. Thus L is the inverse limit. The homomorphism PL sends a sequence to its initial segments. Its inverse sends a compatible tuple to xj=zj(j+1); compatibility proves that all its first-m coordinates equal z(m). These formulas are mutually inverse and select no representatives.

F1F3step 2.2
4.1

The quotient identifications in step 2.2 commute with truncation, so they identify both S^ and P^ with LP. The completion map sends x to its initial segments, hence becomes the original inclusion for S and the identity for P. Step 2.2 proves separatedness for both, and step 1.2 proves the first inclusion is proper. All constructions use explicit coordinates, finite sums, or uniquely specified digits; AC has not been used.

step 1.2step 2.2step 3.2
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Row and column filtrations of a first quadrant double complex

Definition

Let C be a first-quadrant homological double complex. Its totalisation T exists: each nonnegative diagonal has at most n+1 nonzero terms and negative diagonals are zero. The finite sum/product identification is provided by Sum and product totalisations agree on finite diagonal double complexes, and The total differential squares to zero gives the chain condition.

For integers s,n, its column filtration and row filtration are the partial biproducts FscolTn=p+q=n, psCp,q,FsrowTn=p+q=n, qsCp,q. Their injections into Tn are split monomorphisms: projecting onto the selected summands is a left inverse. Thus these are subobjects. The selected index sets increase with s, giving the filtration inclusions.

Both arrows preserve each cutoff: h lowers p and fixes q, while v fixes p and lowers q. Consequently h+v restricts to each partial sum, and the two families are filtered subcomplexes. They vanish for s<0 and equal Tn for sn when n0. For n<0 every piece and Tn are zero. In particular degree zero has just the single possible component C0,0; both filtrations jump there at s=0.

The quotient Fs/Fs1 selects column s with remaining differential v, or row s with remaining differential h, respectively. In spectral coordinates (s,t), total degree is s+t; hence these associated graded components are respectively Cs,t and Ct,s. No sign is inserted: the original double-complex arrows already anticommute. The construction uses only the specified finite biproduct maps and no choices.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The row filtration spectral sequence of a first quadrant double complex

Statement

For a first-quadrant homological double complex C, the row filtration of T=Tot(C) has a spectral sequence with Ep,q1=Hqh(C,p),d1 induced by v,Ep,q2=Hpv(Hqh(C)). The differential on page r has bidegree (r,r1), and the stationary page identifies canonically with Ep,qFprowHp+q(T)/Fp1rowHp+q(T),FprowHn(T)=im(Hn(FprowT)Hn(T)). This target filtration is finite in each total degree. Horizontal homology is taken first; the spectral first coordinate is the original vertical index.

Facts & Assumptions

[F1]

Row and column filtrations of a first quadrant double complex gives the finite row cutoff and associated graded Cq,p with differential h.

[F2]

The next page is the homology of the current page gives the natural page transition H(Er,dr)Er+1.

[F3]

The filtered differential induces d r on the r page gives bidegree (r,r1) and the local rule [x][dx].

[F4]

Spectral sequence subquotient and local lifting calculus licenses local representatives after epic pullback and descent of maps preserving numerator and denominator.

[F5]

Bounded filtered complex spectral sequence abuts to filtered homology proves natural abutment for degreewise finite filtrations; Induced filtration on homology specifies the image filtration.

Proof

Given: C as stated, with hv+vh=0 and h2=v2=0.

1.1

The row-p quotient of total degree p+q is Cq,p. The arrow h stays in this row and v enters the preceding row, which is zero in the quotient. Thus Ep,q0=Cq,p and d0=h. This remains valid when either index is negative, as the component is then zero.

F1given
2.1

Taking homology gives Ep,q1=Hqh(C,p). A horizontal cycle x has total differential dx=vx, so the page-one rule gives d1[x]=[vx]. This is a well-defined horizontal homology class: h(vx)=v(hx)=0, and if x changes by hy then vx changes by vhy=hvy, a horizontal boundary. In an abelian category these calculations mean preservation of kernel and image subobjects; they may be checked after epic pullback and descend uniquely. No global representatives are selected.

F2F3F4step 1.1given
3.1

Since v2=0, the induced page-one arrows square to zero, and their homology is precisely Hpv(Hqh(C)). The next-page isomorphism therefore gives the displayed E2. Both E0 and all later subquotients vanish off the first quadrant. The differential bidegrees are those of the filtered construction, (r,r1), with no extra sign in d1 because h+v was already the total differential.

F2F3step 2.1given
4.1

In degree n0, F1rowTn=0 and FnrowTn=Tn; negative degrees are zero. Thus the bounded-filtration theorem applies degree by degree to this spectral sequence and identifies its stationary page with the associated graded of the displayed image filtration. That filtration is zero at p=1 and all of Hn(T) at p=n for n0. For n=0 there is only one possible quotient, and for the zero complex all pages and quotients are zero. The argument uses no infinite exactness or AC.

F1F5step 3.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The column filtration spectral sequence of a first quadrant double complex

Statement

For a first-quadrant homological double complex C, the column filtration of T=Tot(C) has Ep,q1=Hqv(Cp,),d1 induced by h,Ep,q2=Hph(Hqv(C)). Its differentials have bidegree (r,r1), and Ep,qFpcolHp+q(T)/Fp1colHp+q(T),FpcolHn(T)=im(Hn(FpcolT)Hn(T)). The target filtration is finite in each degree.

Facts & Assumptions

[F1]

Row and column filtrations of a first quadrant double complex specifies both cutoffs and their finite biproduct total objects.

[F2]

The row filtration spectral sequence of a first quadrant double complex computes the row pages, differential and finite image-filtration abutment.

[F3]

The next page is the homology of the current page supplies natural page transitions; Bounded filtered complex spectral sequence abuts to filtered homology supplies natural abutment identifications; Induced filtration on homology defines the target as an image.

Proof

Given: The first-quadrant complex C in the statement, with anticommuting arrows h,v.

1.1

Define Da,b=Cb,a, with ha,bD=vb,aC and va,bD=hb,aC. The two square-zero identities for D are those for vC,hC respectively, and its mixed sum is the mixed sum for C with the two summands exchanged. Thus D is again a first-quadrant anticommuting double complex. In each total degree, permutation of the finite summands gives an isomorphism Tot(D)T. It commutes with total differentials because it changes hD+vD into vC+hC=hC+vC. The row cutoff bp in D becomes the column cutoff in C.

F1given
2.1

Apply the row theorem to D. Its horizontal homology at (q,p) is Hqv(Cp,), and its induced vertical differential is the original hC. Its second page is therefore Hph(Hqv(C)), with the same filtered bidegrees. These are the pages of the column-filtered T: the filtration-preserving isomorphism in step 1.1 identifies their graded objects and differentials, and natural page transitions propagate the identification through every page. No sign twist is needed in the transposition.

F2F3step 1.1
3.1

The same filtered isomorphism sends Hn(FprowTot(D))Hn(Tot(D)) to Hn(FpcolT)Hn(T), hence sends their images to each other. Naturality of finite convergence identifies the stationary page in step 2.1 with the stated associated graded of these images. The bounds are 1 and n for n0; for negative n the complex is zero. This includes n=0, a zero complex and a complex in one column. All maps are specified by finite permutations and universal properties, so no choice assumption enters.

F1F2F3step 1.1step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The two double complex spectral sequences have the same abutment but not the same pages

Statement

The row and column spectral sequences of a first-quadrant double complex abut to the same unfiltered object H(Tot(C)). Their early pages need not be isomorphic, and their filtrations on that target can differ.

Facts & Assumptions

[F1]

The row filtration spectral sequence of a first quadrant double complex computes horizontal-first pages and the row image filtration.

[F2]

The column filtration spectral sequence of a first quadrant double complex computes vertical-first pages and the column image filtration.

[F3]

Abelian-group model for spectral-sequence computations supplies the abelian-group category and the nonzero group k=Z/2.

Proof

Given: The two spectral sequences of a first-quadrant homological double complex, with the conventions in the statement.

1.1

Both convergence theorems identify the unfiltered target in degree n with Hn(T) for the same total complex T and the same differential h+v. They make different specified filtrations on that object; equality of targets alone asserts neither equality of those filtrations nor equality of the pages.

F1F2
1.2

For the early-page witness, take C1,0=C0,0=k, h1,0=1k, and every other component and arrow zero. The only row complex is k1k, whose kernel in degree one and cokernel in degree zero are both zero. Thus the row E1 page is zero. Each nonzero column is a single k, so column E1,01=E0,01=k, with d1,01=1k. Hence its E1 page is nonzero but its E2 page is zero. The total complex is also k1k and has zero homology.

F1F2F3
1.3

For the filtration witness, instead take just C1,0=k with all arrows zero. Then H1(T)=k. The row filtration has F0rowH1(T)=k, since vertical index zero is already included. The column filtration has F0colH1(T)=0 and F1colH1(T)=k. Thus the filtrations on the same nonzero target differ; the jumps occur at different filtration degrees.

F1F2F3
2.1

These witnesses establish the two possible failures while step 1.1 proves the common-target assertion. All witnesses have finite support and specified zero or identity maps, with no representative choices. The zero complex would give equal zero pages and filtrations, which is consistent with the claim that differences can occur.

step 1.1step 1.2step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Acyclic assembly lemma for a first quadrant double complex

Statement

Let C be a first-quadrant homological double complex in an abelian category. If Hqv(Cp,)=0 for every p and every q>0, put Bp=H0v(Cp,) with differential induced by h. The natural projection ρ:Tot(C)B, given on Cn,0 by the quotient map and zero on other summands in degree n, is a quasi-isomorphism.

If instead Hph(C,q)=0 for p>0, the analogous projection to (H0h(C,q),v) is a quasi-isomorphism. In particular completely acyclic columns or completely acyclic rows imply an acyclic total complex.

Facts & Assumptions

[F2]

The next page is the homology of the current page gives natural homology transitions; Bounded filtered complex spectral sequence abuts to filtered homology gives natural graded abutment identifications.

[F3]

Edge homomorphisms of a first quadrant spectral sequence defines the horizontal edge via the last filtration quotient and inclusion into the page-two axis.

[F4]

Quasi-isomorphism means that the given chain map induces an isomorphism in each homology degree.

Proof

Given: The column homology hypothesis first, and the anticommuting convention for C.

1.1

Since Cp,1=0, Bp=Cp,0/im(v:Cp,1Cp,0). Anticommutation gives hv=vh, so h preserves the indicated boundary images and induces a differential on B; its square is induced by h2=0. The prescribed ρ commutes with differentials on Cn,0 by this definition. On a summand Cp,1, its only potentially surviving output under ρd is a vertical boundary and is therefore killed. On summands with q>1 both outputs have positive vertical degree and are killed. Hence ρ is a chain map.

F1given
2.1

Regard B as a double complex D in row zero with horizontal differential that of B. The same formulas give a morphism CD and a column-filtered total map equal to ρ. Its map on vertical H0 is the identity BpBp, and its maps on positive vertical homology are isomorphisms 00 by hypothesis. Thus the induced map on E1 is an isomorphism. Natural homology transitions imply successively that its maps on Er for all r1 are isomorphisms.

F1F2step 1.1given
3.1

The page E1 is supported on q=0; Ep,02=Hp(B). For r2, an outgoing differential from (p,0) lands at positive second coordinate r1 and an incoming source has negative second coordinate 1r, so both maps are zero. Thus E2=E. In degree n0 the finite homology filtration has all quotients zero except possibly the one at p=n. A quotient Fp/Fp1=0 means Fp=Fp1; starting at F1=0 and applying this finitely often gives Fn1=0, while Fn=Hn. Consequently the sole graded piece canonically equals Hn, for both total complexes.

F1step 2.1
4.1

By naturality of the abutment, the isomorphism on that sole graded piece induced in step 2.1 is exactly Hn(ρ) under these canonical identifications, rather than an unspecified isomorphism of the two homology objects. Equivalently it is the horizontal edge of the column sequence: for D the edge is the identity and the edge square for ρ commutes. Hence Hn(ρ) is invertible. Negative-degree homologies are zero and n=0 uses F1=0, so ρ is a quasi-isomorphism in all degrees.

F2F3F4step 2.1step 3.1
5.1

Exchange the two coordinates and the arrows h,v. Their anticommuting sum and total complex are unchanged under summand permutation, while columns become rows. The same projection and proof give the row assertion. If columns are completely acyclic, then also Bp=0 for every p, so the first quasi-isomorphism has zero target; the row conclusion follows in the same manner. No surviving nonzero edge is asserted in these completely acyclic cases. All maps are canonical quotients and finite-filtration maps, requiring no AC.

F1F4step 4.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Exact couple

Definition

Fix an integer r1 and an abelian category. A page-r homological exact couple is a pair of indexed families (Dp,q)p,qZ and (Ep,q)p,qZ and maps ip,q:Dp,qDp+1,q1,jp,q:Dp,qEp+1r,q+r1,kp,q:Ep,qDp1,q. For every (p,q) require the three subobject equalities im(ip1,q+1)=ker(jp,q) in Dp,q, im(jp+r1,qr+1)=ker(kp,q) in Ep,q, im(kp+1,q)=ker(ip,q) in Dp,q. These are exactness at the three positions, meaning the corresponding kernel modulo image is zero. In particular each consecutive composite ji, kj or ik, with the displayed shifts understood, is zero.

An initial exact couple means r=1: then j has bidegree (0,0). Its first spectral page will be called E1, not E0. A morphism between two page-r couples is a pair of bidegree-zero families up,q:Dp,qD~p,q and wp,q:Ep,qE~p,q satisfying up+1,q1ip,q=i~p,qup,q,wp+1r,q+r1jp,q=j~p,qup,q,up1,qkp,q=k~p,qwp,q. All-zero families are allowed. Graded objects here mean indexed families: no infinite direct sum, convergence or abutment is part of the definition.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Differential associated to an exact couple

Definition

For a page-r exact couple, define its associated differential by dp,q=jp1,qkp,q:Ep,qEpr,q+r1. The bidegrees of k and j add to (1,0)+(1r,r1)=(r,r1), so total degree decreases by one. The square-zero identity is proved in The exact couple differential squares to zero before homology is formed. For an initial couple r=1 this map has bidegree (1,0). The zero couple has zero differential. The composite is specified uniquely; neither a section of i nor a preimage selection is part of this definition.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The exact couple differential squares to zero

Statement

The associated differential of a page-r exact couple satisfies dpr,q+r1dp,q=0 for every p,qZ and every r1.

Facts & Assumptions

[F1]

Exact couple gives exactness at Epr,q+r1, in particular kpr,q+r1jp1,q=0.

[F2]

Differential associated to an exact couple specifies dp,q=jp1,qkp,q.

Proof

Given: A page-r exact couple with the stated indexed maps.

1.1

At the component Epr,q+r1, exactness says that the image of jp1,q lies in the kernel of kpr,q+r1. Therefore kpr,q+r1jp1,q=0 as an arrow from Dp1,q to Dpr1,q+r1. This is valid even when any component or arrow is zero.

F1given
2.1

Substituting both differential formulas and using associativity gives dpr,q+r1dp,q=jpr1,q+r1(kpr,q+r1jp1,q)kp,q=0. Its target is Ep2r,q+2r2, as required for the square of a map of bidegree (r,r1). This works at r=1 and all larger integers, with no choice or convergence assumption.

F2step 1.1algebra
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Derived exact couple

Definition

For a page-r exact couple (D,E,i,j,k), let d=jk. The square-zero identity allows the quotient Dp,q=im(ip1,q+1:Dp1,q+1Dp,q),Ep,q=ker(dp,q)/im(dp+r,qr+1). Define the following maps by their local formulas: ip,q:Dp,qDp+1,q1,i(a)=i(a), jp,q:Dp,qEpr,q+r,j(ix)=[jx](x at Dp1,q+1), kp,q:Ep,qDp1,q,k([e])=ke. In the last formula e is a d-cycle. The local preimage x and local representative e are understood after an epimorphism onto a test object's domain, as in Spectral sequence subquotient and local lifting calculus. They do not mean a chosen section of i or of a quotient map.

The existence and independence of these maps are established in The derived couple maps are well defined , and their exactness in The derived couple is exact . These data form the derived exact couple, a page-(r+1) couple: the degrees of i and k are unchanged, while j has degree (r,r). For an initial couple this changes the degree of j from (0,0) to (1,1). Zero kernels, images and quotients are permitted; every construction is componentwise, with no infinite sum.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The derived couple maps are well defined

Statement

The three maps i,j,k of the derived-couple construction exist in every abelian category and are independent of all local preimages and cycle representatives. Their degrees are (1,1), (r,r) and (1,0), respectively. No choice of global sections is needed.

Facts & Assumptions

[F1]

Derived exact couple gives the image and homology quotient objects and the proposed formulas.

[F2]

Exact couple gives kerj=imi, kerk=imj, keri=imk and the consecutive zero composites.

[F3]

Spectral sequence subquotient and local lifting calculus permits epic local lifting, descent of subobject membership and unique quotient maps.

Proof

Given: A page-r exact couple. All expressions below are at a fixed homogeneous component with the typed shifts in [F1]; local lifts mean epic pullbacks as in [F3].

1.1

If a is locally ix, then ia=i(ix) lies in imi. Descent of this membership shows that i restricted to DD factors through the target D. Its factorization is unique because that inclusion is monic. This defines i without any preimage choice.

F1F3
1.2

The composite j:DE lands in kerd since dj=jkj=0. Follow it by kerdE. This map kills keri: an arrow into keri=imk locally has form kz, and its image is [jkz]=[dz]=0. Hence it descends through D/keriimi to j, uniquely. Explicitly, if ix=iy locally, then xy=kz after a further epic pullback, so [jx][jy]=[dz]=0. Thus its formula is independent of the preimage.

F1F2F3
1.3

On kerd, the map k lands in kerj=imi, because jke=de=0. Changing a cycle representative by a boundary dz changes its image by kdz=kjkz=0. Thus this restricted map kills the boundary image and descends uniquely to k:ED. Equality after the epic cycle quotient also proves independence for arbitrary maps into E, not just element representatives.

F1F2F3
2.1

For i the degree remains (1,1). To compute j on Dp,q, its local i-preimage is at Dp1,q+1 and j sends it to Epr,q+r, giving degree (r,r). The cycle restriction and quotient for k preserve the original degree (1,0). The constructions above still apply when any image or homology object is zero, and for r=1 give degj=(1,1). Every lift was a finite local epic pullback used to prove a canonical factorization; no global representative selection or AC was used.

F1step 1.1step 1.2step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The derived couple is exact

Statement

The derived data of a page-r exact couple form a page-(r+1) exact couple. In particular imi=kerj, imj=kerk and imk=keri, at their respective shifted vertices.

Facts & Assumptions

[F1]

Derived exact couple and The derived couple maps are well defined supply the canonical maps of degrees (1,1), (r,r) and (1,0), with rules i(a)=ia, j(ix)=[jx], k([e])=ke.

[F2]

Exact couple supplies the three original exactness conditions and consecutive zero composites.

[F3]

Spectral sequence subquotient and local lifting calculus licenses local epic lifts and descent of subobject containments.

Proof

Given: The original page-r exact couple. All local representatives and subsequent lifts are obtained by finitely many epic pullbacks; after each computation subobject membership descends by [F3].

1.1

At Dp,q, let a lie locally in kerj and write a=ix with x at Dp1,q+1. The condition [jx]=0 says locally jx=dz=jkz for z at Ep,q+1. Thus xkzkerj and locally xkz=iy for y at Dp2,q+2. It follows that a=ix=i2y, since ik=0. This belongs to imi because iy is in Dp1,q+1. Conversely a local element of imi has the form i2y and j(i2y)=[jiy]=0. These two local containments descend to kerjp,q=imip1,q+1.

F1F2F3
1.2

At Ep,q, represent a local class in kerk by a d-cycle e. Since Dp1,qDp1,q is monic, k[e]=0 implies ke=0 in D. Original exactness gives locally e=jx for x at Dp+r1,qr+1. Then [e]=j(ix), with ix at Dp+r,qr. Conversely kj(ix)=kjx=0. Thus kerkp,q=imjp+r,qr after descent.

F1F2F3
1.3

At Dp,q, let a lie in keri. Its image in Dp,q satisfies ia=0, so locally a=ke for e at Ep+1,q. Since a already lies in D=imi, we have ja=0; therefore de=jke=ja=0. The class [e] is defined and k[e]=a. Conversely ik[e]=ike=0 for every cycle class. Descending gives kerip,q=imkp+1,q.

F1F2F3
2.1

These are exactly the three equalities required for page r+1, with the degrees supplied by [F1]. The arguments include zero kernels, images and homology objects: the reverse containments are zero-composite identities and never require a nonzero witness. At r=1 the shifted indices give the first derived couple; every larger page is covered by the same printed formulas. No section, global lift or axiom of choice is used.

F1F2step 1.1step 1.2step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

An exact couple generates a spectral sequence

Statement

An initial homological exact couple (D,E,i,j,k) gives, by repeated derivation, a homological spectral sequence starting at E1=E with degdr=(r,r1). Write im for m consecutive shifted i maps, including i0=1. Define subobjects of the original Ep,q by Np,qr=kp,q1(im(ir1:Dpr,q+r1Dp1,q)), Bp,qr=jp,q(ker(ir1:Dp,qDp+r1,qr+1)). Then canonically Ep,qrNp,qr/Bp,qr. Under this identification, if locally ke=ir1x, then dr[e]=[jx]. An arbitrary exact couple is not asserted to have an abutment.

Facts & Assumptions

[F1]

Exact couple supplies keri=imk, kerk=imj, kerj=imi, with the initial j of degree zero.

[F2]

Derived exact couple defines the derived image and homology objects and their maps; The derived couple is exact allows their repeated derivation and gives the new degrees.

[F3]

Homological spectral sequence requires square-zero differentials and specified homology-to-next-page isomorphisms.

[F4]

Spectral sequence subquotient and local lifting calculus supplies finite epic lifts, natural quotient identifications and descent of containments.

Proof

Given: The initial exact couple and the indexed subobjects in the statement. Every local lift is after a finite epic pullback, with the descent meaning of [F4].

1.1

Applying the derived-couple theorem to any page-r couple produces a page-(r+1) couple whose E object is exactly the homology of the preceding jk differential. The associated differentials square to zero and their degrees are (r,r1). Starting with the given initial couple and repeating this construction for each positive integer therefore supplies the objects, differentials and homology identifications required for a spectral sequence. The initial page is E1=E.

F2F3given
1.2

The kernels of successive i powers increase and their images decrease. Since kj=0, BrNs for every r,s1. Thus BrBr+1Nr+1Nr and each stated quotient exists. For r=1, N1=E and B1=j(ker1)=0.

F1F4given
2.1

For e through Np,qr, take a local x at Dpr,q+r1 with ke=ir1x. The arrow jx lies in every Ns since kjx=0. Two such lifts differ by kerir1 and hence give the same class modulo Br in the target. Replacing e by a local Br representative jz changes ke by zero. Consequently the rule [e][jx] defines a unique map on Nr/Br, by quotient descent. Its degree is (r,r1) and its square is zero: for the representative jx its k image is zero, so the next lift may be taken to be zero. At r=1 this rule is the original jk.

F1F4step 1.2
3.1

The kernel of this map is represented by exactly Nr+1. Indeed a zero image means locally jx=jz with ir1z=0. Then xzkerj=imi, so locally xz=iy and ke=ir1x=iry. Conversely if ke=iry, one may take x=iy and then jx=0. Both containments descend. The incoming image is exactly Br+1/Br: every output jx has irx=i(ke)=0, and conversely if irx=0, then ir1xkeri=imk has a local lift e with ke=ir1x. This e belongs to the appropriate Nr and its image is jx. Thus the homology of the quotient at page r is canonically Nr+1/Br+1.

F1F4step 2.1
4.1

To match these quotient pages with repeated derived couples in step 1.1, note that at the rth couple the D object is imir1 inside the original D. Its k map is induced by the original k on Nr, and its j map sends ir1x to [jx]. These assertions hold initially. On deriving once, the image of the restricted i is imir; the new k is induced by the same original k on the new cycles in step 3.1; and taking one more i-preimage changes iry into ir1y, so the new j sends iry to [jy]. Step 3.1 identifies the new homology quotient and its transition by the inclusion of its numerator. This proves the asserted compatibility at every stage of the iteration.

F2F4step 1.1step 3.1
5.1

Hence the stated subquotients and differentials describe precisely the spectral sequence of the exact couple, with specified canonical transition isomorphisms. The zero couple gives zero quotients at all pages. The use of finite composites at each fixed r, and canonical kernels, images and quotients, requires neither infinite sums nor AC. No target filtration or abutment has been constructed or inferred.

F3step 1.2step 4.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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
PropositionStatement: AI-adaptedProof: AI-adaptedOpen item page →

The exact couple and subquotient constructions of the filtered complex spectral sequence agree

Statement

For a filtered chain complex in an abelian category, its exact-couple and filtered-subquotient spectral sequences are naturally isomorphic from E1 onward, preserving differential signs, bidegrees and next-page isomorphisms. The filtered-subquotient construction additionally has its specified E0 page; the initial exact couple starts at E1.

Facts & Assumptions

[F1]

A filtered complex produces an exact couple constructs the initial couple; An exact couple generates a spectral sequence gives its cycle numerator Nr=k1(imir1), boundary subobject Br=j(kerir1) and local differential.

[F2]

R page of the spectral sequence of a filtered complex and The filtered differential induces d r on the r page give the filtered quotient pages and their differential [c][dc].

[F3]

The next page is the homology of the current page constructs transition isomorphisms by inclusion of the next cycle numerator, with correction of a representative by a lower-filtration chain.

[F4]

Spectral sequence subquotient and local lifting calculus permits local epic lifts and unique natural quotient comparisons.

Proof

Given: (C,d,F), an integer r1, and n=p+q. Write Ap,nr=FpCnd1(FprCn1). Local expressions denote morphisms after finite epic pullback as in [F4].

1.1

Both initial pages identify with Hn(FpC/Fp1C): in the subquotient construction a cycle modulo the previous filtration is precisely a lift cFpCn with dcFp1Cn1, modulo Fp1Cn+d(FpCn+1). This is the homology quotient defining the initial exact-couple page.

F1F2F4
1.2

The connector k sends this class to [dc]Hn1(Fp1C) with a positive sign. Indeed the snake construction first pulls back the epic upper-row map, then factors its vertical differential through the monic lower-row map, and defines the connecting arrow by the equation δπ=qa, where that factor a satisfies inclusion composed with a equal to the vertical differential. In the quotient-kernel diagram of complexes this vertical arrow is induced by d, so a lifted c gives exactly the class of dc. The preconnecting and connecting definitions preserve this equation. This verifies the sign in every abelian category after epic pullback; in modules it is the stated elementwise formula.

F4F5
2.1

A class represented by c on the initial page lies in Nr exactly when its class [dc] in Hn1(Fp1C) is induced by a cycle zFprCn1. Locally this means dc=z+db for bFp1Cn. Then cbAp,nr and represents the same initial-page class. Conversely cAp,nr gives the lower-filtration cycle dc, so its class belongs to Nr. Thus Ap,nr maps epimorphically onto Nr.

F1F4step 1.1step 1.2
3.1

The inverse image of Br under this epimorphism is Ap1,nr1+d(Ap+r1,n+1r1). To prove this, a Br class is represented by a cycle aFpCn that becomes a boundary in Fp+r1C: locally a=dw with wFp+r1Cn+1. Equality of its initial-page class with that of cAr means ca=b+dt for bFp1Cn and tFpCn+1. Hence c=b+d(w+t). Now db=dcFpr, so bAp1,nr1, and d(w+t)=cbFp, so w+tAp+r1,n+1r1. Conversely the first denominator summand maps to zero on the initial page, while an element of the second is a cycle in Fp that bounds in Fp+r1 and therefore maps into Br. These local containments descend by [F4].

F1F2F4step 2.1
4.1

The quotient comparison now identifies Nr/Br with Ap,nr/(Ap1,nr1+d(Ap+r1,n+1r1)), precisely the filtered page. For cAr, the lift of k[c] through ir1 is the homology class of dc in Fpr. The exact-couple differential therefore sends [c] to [dc] on the corresponding target page, exactly the filtered differential. The target bidegree is (pr,q+r1) on both sides.

F1F2F4step 1.2step 3.1
5.1

In both constructions the next-page isomorphism is induced by including the next cycle numerator and then inverting the resulting homology isomorphism. The comparisons above come from the same chain representatives and lower-filtration corrections; hence those inclusions commute with the comparisons, and so do their inverses. Every filtered chain map preserves Ar, the denominator summands and the cycle/boundary comparisons, so quotient uniqueness proves naturality. At r=1 these are the identifications in step 1.1; zero pieces and stationary filtrations simply give zero quotients where appropriate. No global representatives, infinite sums or convergence hypotheses are used.

F3F4step 1.1step 3.1step 4.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Regular spectral sequence

Definition

For a homological spectral sequence as in Homological spectral sequence, two-sided regularity means that for every (p,q) there is an integer Rr0 such that for every rR both dp,qr:Ep,qrEpr,q+r1r,dp+r,qr+1r:Ep+r,qr+1rEp,qr are zero. On this page the design term regular means this two-sided condition. The bound may depend on (p,q); there need not be a single collapse page.

This differs from the convention on the prerequisite spectral-sequences page and in Stacks, Definition 12.24.7: there regular means eventual outgoing vanishing alone and coregular means eventual incoming vanishing. We call these outgoing regularity and incoming regularity when only one is intended. Neither may silently replace the two-sided hypothesis.

When both maps vanish the specified next-page isomorphism identifies Ep,qr+1 with Ep,qr itself, since its kernel is the whole term and its incoming image is zero. Thus the condition gives canonical pointwise stationarity, as in Degree reasons force stabilization in a bounded region. For first-quadrant support, the outgoing target is zero for r>p, and the incoming source is zero for r>q+1. Outside that support every page term is zero. These bounds include the axes and the entirely zero sequence, without a choice of representatives or an assumption of AC.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Weak convergence of a spectral sequence

Definition

A spectral sequence converges weakly to a family Hn with increasing filtrations FpHn if it has a defined limiting page and specified isomorphisms Ep,qFpHp+q/Fp1Hp+q. The limiting page means the quotient of limiting cycle and boundary subobjects when their meet and join exist, as in Limiting cycles boundaries and e infinity, or the canonically stationary page when both incident differentials eventually vanish. The isomorphisms are part of the data; an abstract equality of isomorphism types is insufficient.

For a filtered-complex spectral sequence with target its homology and induced image filtration, the comparison must be the one induced by actual cycles and boundaries: a cycle cFpCp+q represents the associated-graded homology class of [c], and its limiting-page class must correspond to this class. Weak convergence asserts that this prescription yields the specified isomorphism. It does not assume that every approximate cycle is an actual cycle without proof.

This extends the abutment terminology of Abutment to a filtered object beyond that page's finite-filtration setting. It asserts neither exhaustiveness, separatedness nor completeness of the target filtration, and never identifies the unfiltered Hn with its associated graded. Zero graded pieces are allowed, including a zero limiting page with a nonzero target and nonseparated filtration. For decreasing cohomological filtrations the quotient is FpHp+q/Fp+1Hp+q. No choice axiom is part of this definition.

Source notes

Stacks, Definition 12.24.9, translated to increasing homological indices. The actual-cycle requirement is retained.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Strong convergence of a spectral sequence

Definition

A spectral sequence converges strongly to (Hn,F) on this page if it converges weakly with specified identifications as in Weak convergence of a spectral sequence, is two-sided regular as in Regular spectral sequence, and for each n its target filtration is exhaustive, separated and complete. Here exhaustiveness and separatedness mean pFpHn=Hn,pFpHn=0, as in Exhaustive separated bounded and finite filtration, and completeness means that the canonical map HnlimpHn/FpHn is an isomorphism. All indicated subobject meets, joins and inverse limits must exist. The limit has the universal-property meaning of Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties: the transition for pp is the quotient Hn/FpHnHn/FpHn. In modules the limit is the module of compatible residue classes. All these conditions are required; the weak-convergence identifications remain part of the data.

A finite filtration is complete: if FaHn=0, every quotient with pa is canonically Hn, with identity transitions. A cone is determined by its component at any such index, and its components at larger indices are its quotient maps. Thus Hn itself is the inverse limit, even if the ambient category does not admit arbitrary inverse limits. The same finite lower endpoint gives separatedness, and a finite upper endpoint FbHn=Hn gives exhaustiveness. This includes Hn=0 and repeated filtration terms.

For decreasing cohomological filtrations use Hnlimp+Hn/FpHn and graded pieces Fp/Fp+1. No splitting of the filtration and no choice axiom is included. The two-sided regularity convention is stronger than the outgoing-only meaning of regularity in Stacks, Definition 12.24.9; a source criterion must be checked against every condition above.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

A first quadrant filtered complex spectral sequence converges to filtered homology

Statement

An exhaustive first-quadrant filtered chain complex in an abelian category, with finite filtration on each chain object, has a pointwise stationary spectral sequence strongly converging to its homology with the induced finite image filtration. No uniform bound over all chain degrees is required. In the normalized case F1C=0 and FnCn=Cn, one has F1Hn(C)=0 and FnHn(C)=Hn(C).

Facts & Assumptions

[F1]

Bounded filtered complex spectral sequence abuts to filtered homology proves pointwise stabilization, natural actual-cycle graded identifications and finiteness of the homology image filtration for a degreewise finite filtration.

[F2]

Induced filtration on homology defines that filtration as the image of Hn(FpC)Hn(C).

[F3]

Strong convergence of a spectral sequence requires the weak identifications, two-sided regularity, exhaustiveness, separatedness and completeness; it specifies the inverse-system orientation and proves the constant-tail limit description.

Proof

Given: Such a filtered complex (C,d,F). Fix a degree n.

1.1

Choose finite endpoints aj,bj in each of the three degrees j=n1,n,n+1. The hypothesis of [F1] holds degreewise. Its proof identifies the stationary page with the quotient of FpCnkerdn by (Fp1Cnkerdn)+(FpCnimdn+1): the lower endpoint in degree n1 makes approximate cycles actual cycles, and the upper endpoint in degree n+1 includes all actual boundaries. Thus its graded isomorphisms have exactly the actual-cycle meaning required for weak convergence, and are natural in filtered chain maps. The same theorem gives eventual vanishing of both incident differentials, hence two-sided regularity.

F1F3
1.2

The image filtration satisfies FpHn(C)=0 for pan, since there are no degree-n cycles in FpC. It satisfies FpHn(C)=Hn(C) for pbn, since every cycle of Cn is then a cycle in FpC. Images, not the possibly larger domain homology groups, are being used. The filtration is therefore finite, and its meet is zero and its join is Hn(C). This proves separatedness and exhaustiveness, including when Hn(C)=0.

F1F2
2.1

For pan the quotients Hn(C)/FpHn(C) are canonically Hn(C) and their transitions are identities. A compatible cone into the full inverse system is uniquely determined by its component at an: compatibility fixes every smaller-index component and every larger-index component is its quotient. Consequently Hn(C) with the quotient maps satisfies the limit universal property, and the canonical completion map is an isomorphism. All the conditions in [F3] now hold. No general existence of infinite limits or choice of a family of representatives is required.

F3step 1.1step 1.2
3.1

Under the normalized hypotheses, the zero subcomplex F1C has zero homology, giving F1Hn(C)=0. Every degree-n cycle lies in FnCn=Cn, so the inclusion FnCC is surjective on degree-n homology, giving the other endpoint. The statements also hold for zero chain degrees, repeated filtration terms and the boundary axis of the first quadrant. The proof above fixed n and used finitely many integer bounds, so it introduces no uniform-degree bound or AC assumption.

F2step 1.2

Source notes

Stacks, Lemma 12.24.11, with increasing homological indices. The local bounded supplier gives the full numerator proof; the constant-tail argument supplies completeness in the stated strong-convergence convention.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Lim one obstruction to completeness

Definition

Let M0u0M1u1M2 be a countable tower of abelian groups and homomorphisms. The product P=m0Mm has coordinatewise addition, zero and negatives; these operations satisfy the group laws coordinatewise. It contains the all-zero tuple without any choice assumption. Define Δ:PP,Δ(x)m=xmum(xm+1). Additivity of each um gives Δ(x+y)m=Δ(x)m+Δ(y)m, so this is a homomorphism. Using the subgroup kernels and coset cokernels of Abelian-group model for spectral-sequence computations, set limMm=kerΔ,lim1Mm=cokerΔ=P/Δ(P). The first consists precisely of tuples satisfying xm=um(xm+1) for every m. A cone of homomorphisms fm:TMm factors uniquely by t(fm(t))m, which belongs to that subgroup exactly by cone compatibility. Thus it is the categorical limit of Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties. The notation lim1 here names this particular cokernel; no unproved identification with general derived functors is included.

For an increasing filtration on an abelian group A as in Exhaustive separated bounded and finite filtration, put Gm=FmA with inclusion transitions. The term lim1Gm will measure the failure of surjectivity of AlimmA/Gm through the following completion exact sequence. This is a claim about this subgroup tower, not an assertion that every unrelated tower measures completeness of A. The present definitions and coordinate formulas require no AC. They also apply to modules over a fixed ring with coordinate scalar multiplication; Δ is then linear. Zero groups and zero or identity transitions are allowed.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Countable tower completion obstruction exact sequence

Statement

Assume AC. If G0G1 are subgroups of an abelian group A, there is a natural exact sequence 0mGmAηlimmA/Gmlimm1Gm0. Here η(a)=(a+Gm)m, and lim1 has the countable Delta-cokernel meaning. Consequently, for a separated filtration with Gm=FmA, completeness is equivalent to limm1Gm=0. Naturality means homomorphisms f:AA with f(Gm)Gm at every index.

Facts & Assumptions

[F1]

Lim one obstruction to completeness defines the compatible-tuple limit and lim1Gm=(mGm)/Δ(mGm), with Δ(g)m=gmgm+1 for these inclusion transitions.

[F2]

The Axiom of Choice supplies a representative in each member of a countable family of nonempty cosets. This is the sole use of AC below.

Proof

Given: A and the descending subgroup tower. Put L=limmA/Gm and Q=limm1Gm.

1.1

For c=(cm)L, select amcm for every m using [F2]. Compatibility says amam+1Gm. Thus b=(amam+1)mmGm, and set (c)=[b]Q. Another representative sequence has the form am=am+gm, with gmGm, and gives b=b+Δ(g). The class is therefore independent of every representative choice. Using the sequence am+am for the sum of two compatible families shows (c+c)=(c)+(c). Hence is a uniquely defined homomorphism, with no fixed section of any quotient included in its data.

F1F2
1.2

The inclusion of mGm in A is injective. The tuple η(a) is compatible, and η(a)=0 exactly when aGm for every m. This proves exactness at the first two nonzero terms.

F1
2.1

If c=η(a), use the constant representative sequence am=a, whose difference is zero; thus (c)=0. Conversely, if (c)=0, a representative sequence from step 1.1 has difference Δ(g) for some gmGm. The elements amgm then satisfy amgm=am+1gm+1 for every m, so all equal a0g0. Their cosets are cm, giving c=η(a0g0). This proves exactness at L in both directions.

F1step 1.1
2.2

For any class [b]Q, take one tuple b=(bm)mGm representing it. Define a0=0 and am=j<mbj for m>0. Then amam+1=bmGm, so (am+Gm)m is compatible and maps to [b]. These finite sums require no choice, and a single existential representative of one quotient class requires no choice axiom. Thus is surjective, proving the terminal exactness.

F1step 1.1
3.1

If f:AA preserves every subgroup, it sends a compatible tuple of cosets to a compatible tuple, and sends a representative sequence am to f(am). Its differences are f(amam+1). The product map also commutes with Δ, so it induces the map on Q; the displayed sequence consequently commutes with f at every term. If mGm=0, step 1.2 makes η injective, while steps 2.1–2.2 identify its cokernel with Q. Thus η is an isomorphism exactly when Q=0. For Gm=FmA, the nonpositive indices are cofinal toward minus infinity: all other quotient components are uniquely determined by quotienting the component at zero. This limit is precisely the completion limit.

F1step 1.1step 1.2step 2.1step 2.2
4.1

The zero group gives a zero sequence. If all Gm=0, then L=A and Q=0. If all Gm=A, then L=0, the intersection is A, and step 2.2 shows Δ is onto, so again Q=0. These constant cases show why the separatedness hypothesis is needed for the final equivalence with an isomorphism. No strict inclusions, finite generation or completeness of A were assumed. The only countable selection was of the coset representatives in step 1.1.

F1step 1.1step 1.2step 2.2
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Countable tower six term limit sequence

Statement

Assume AC. Write L(A)=kerΔA and R(A)=cokerΔA for a countable inverse tower of modules over a fixed ring. A termwise exact sequence of towers 0ABC0 gives a natural exact sequence 0L(A)L(B)L(C)R(A)R(B)R(C)0. If all transitions of a tower A are surjective, then R(A)=0 and each projection L(A)Am is surjective. Removing finitely many initial coordinates induces isomorphisms on both L and R.

Facts & Assumptions

[F1]

Lim one obstruction to completeness defines P(A)=mAm, ΔA(x)m=xmumxm+1, its kernel and its cokernel.

[F2]

The Axiom of Choice permits simultaneous representatives of countably many nonempty cosets and sections of surjective transition maps. These are the uses of AC below.

Proof

Given: The towers in the statement; identify Am with its submodule in Bm. All tower squares commute.

1.1

The map P(B)P(C) is onto: choose a lift in each coordinate by [F2]. If cL(C), lift it to bP(B). Then ΔBbP(A) by commutation, so define c=[ΔBb]. Replacing b by b+a changes the result by ΔAa, hence leaves its class unchanged. Sum and scalar multiple lifts establish linearity.

F1F2
1.2

The map L(A)L(B) is injective coordinatewise. A compatible B tuple whose image in L(C) vanishes lies coordinatewise in A and is still compatible. This proves exactness at L(B) as well.

F1
1.3

Suppose every um is onto. By [F2] choose a right inverse as a set map for each um. For prescribed yP(A) put x0=0 and recursively choose xm+1 with umxm+1=xmym using these sections. Then ΔAx=y, proving R(A)=0. For prescribed xmAm, the same recursion with y=0 constructs later coordinates, while compositions of transitions determine earlier ones. This proves surjectivity of L(A)Am. No sections are asserted linear.

F1F2
1.4

Restriction to mN gives a bijection on compatible tuples: earlier coordinates are forced by the transitions. It is surjective on Delta cokernels because a tail representative can be extended by zero. If a full representative restricts to Δx on the tail, extend x backwards by the finite recursion xm=ym+umxm+1. The original representative is now a full Delta boundary. Hence restriction is also injective on cokernels and is linear. These identifications commute with tower morphisms.

F1
2.1

A compatible B lift of c has zero connecting class. Conversely if c=0, a lift b has ΔBb=ΔAa for some aP(A); then ba is a compatible lift. Thus exactness holds at L(C) in both directions.

step 1.1
2.2

A connecting class becomes zero in R(B). Conversely if aP(A) represents a class becoming zero there, write a=ΔBb. The image c of b is compatible and has c=[a]. This proves exactness at R(A).

F1step 1.1
2.3

If bP(B) maps to ΔCc, lift c to tP(B) as in step 1.1. Then bΔBtP(A) represents the same R(B) class. Every image from R(A) conversely maps to zero in R(C). Finally any representative in P(C) lifts to P(B), proving surjectivity at R(C).

F1step 1.1
3.1

A morphism of the exact tower sequences sends a selected lift to a lift and commutes with Delta. Thus it commutes with ; it plainly commutes with coordinate inclusions and quotient maps too. The entire sequence is natural, including its end terms.

F1step 1.1step 1.2step 2.1step 2.2step 2.3
4.1

The exactness assertions follow from steps 1.2–2.3 and naturality from step 3.1; steps 1.3 and 1.4 prove the two additional claims. Zero modules, zero maps where exactness permits them, and repeated or constant terms cause no exceptions. A single nonzero term followed by zeros has zero L and R by the tail assertion. A constant identity tower has L=A0 and R=0. The index set is the nonempty set of natural numbers; no empty tower is being claimed. All infinite selections were explicitly made in steps 1.1 and 1.3 under AC.

F1step 1.2step 2.1step 2.2step 2.3step 3.1step 1.3step 1.4

Source notes

The local coordinate chase is complete. Boardman section 1 is background for the six-term interface; its omitted chase is supplied above. The owner research argument research/phase-2-next-20-topology-owner-delta-alternatives.md, sections 1–2 and 5, supplied the candidate evaluated here. No source-fetch verification or independent review is inferred.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Two by two Delta complex for a double tower

Statement

Assume AC. Let Ai,j, i,j0, be a commuting double inverse system of modules over one ring. Write L and R for the countable Delta kernel and cokernel. Set P=i,jAi,j, D=Δi, and E=Δj. The complex K:Px(Dx,Ex)PP(a,b)EaDbP in degrees 0,1,2 has natural identifications and an exact sequence H0(K)=LiLjA,0RiLjAH1(K)LiRjA0,H2(K)=RiRjA. The analogous statements with i,j interchanged hold. In particular, if LiAi,j=RiAi,j=0 for each j, then H1(K)=0 and LiRjA=0.

Facts & Assumptions

[F1]

Lim one obstruction to completeness defines coordinate Delta kernels and cokernels for modules.

[F2]

The Axiom of Choice supplies simultaneous representatives of countably many quotient classes and simultaneous preimages of elements in the images of coordinate Delta maps.

Proof

Given: The double tower, whose transition squares commute; the cohomology of this three-term complex means its kernel modulo image.

1.1

Write horizontal and vertical transitions as u,v. At (i,j), both DEx and EDx equal xi,juxi+1,jvxi,j+1+uvxi+1,j+1, with the last equality using the commuting square. Thus DE=ED and the displayed composite is zero. If V=kerE and W=P/EP, then D preserves V and induces a map on W. The common kernel is exactly ker(D:VV).

F1
2.1

Send a closed pair (a,b), satisfying Ea=Db, to [b]W. Its D image vanishes. A boundary (Dx,Ex) maps to zero, so this gives H1(K)ker(D:WW). It is onto: for [b] in that kernel, Db=Ea for some a, and the pair is closed. The rule is independent of cohomology representatives and is linear because both the coordinate map and quotient map are linear.

step 1.1
3.1

The map VH1(K) sends a to [(a,0)]. Its kernel is D(V): a pair (a,0) is (Dx,Ex) exactly when xV and a=Dx. Hence it induces an injection coker(D:VV)H1(K). If a closed pair has [b]=0, write b=Ex and subtract (Dx,Ex); the new pair is (aDx,0) with first coordinate in V. Conversely such a pair has zero image in W. This proves middle exactness in both directions.

step 1.1step 2.1
4.1

The last cohomology is P/(EP+DP), since EaDb runs through that sum of submodules. This quotient is precisely coker(D:WW), by sending the class of z to its class modulo EP+DP; both kernels are the stated sum. All maps just constructed commute with a morphism of double towers, since it commutes with D,E, sends closed pairs to closed pairs and boundaries to boundaries.

step 1.1step 2.1step 3.1
5.1

Coordinate grouping identifies V with iLjAi,j without choice. The map PiRjAi,j is onto by [F2], choosing one representative tuple for each i. Its kernel consists of tuples whose i row lies in the image of Δj; choosing a Delta preimage for each row by [F2] identifies that kernel with EP. Hence WiRjAi,j. Both identifications intertwine the induced D with the i-direction Delta. Substitution into steps 1.1–4.1 proves all displayed formulas.

F1F2step 1.1step 2.1step 3.1step 4.1
6.1

Swap i,j and the middle coordinates. The degree-zero map is identity, the degree-one map is (a,b)(b,a), and the degree-two map is multiplication by 1. These maps form a complex isomorphism, since DbEa=(EaDb). Applying step 5.1 in this order gives 0RjLiAH1(K)LjRiA0. If every LiA and RiA is zero, both end terms vanish, hence H1(K)=0. In the original exact sequence its quotient LiRjA is therefore zero.

step 5.1
7.1

The formulas and consequence now follow. The zero double system makes every term zero. If only A0,0=M is nonzero, then D=E=1 on P=M; the complex is the diagonal inclusion followed by (a,b)ab, so all cohomology is zero as the formulas predict. No transition is required to be strict, nonzero, or surjective. Both towers are indexed by all natural numbers, not an empty index set. The only use of AC was the two countable selections in step 5.1; the finite pair manipulations and sign reversal need none.

step 1.1step 2.1step 3.1step 4.1step 5.1step 6.1

Source notes

This explicit three-term calculation supplies the interchange needed in the owner Delta alternatives, section 4, without a later Grothendieck spectral sequence. The source citation identifies the convergence problem it serves; it is not used in place of the calculation.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Approximate cycle obstruction sequence for a complete filtered complex

Statement

Assume AC. Let (C,d,F) be an increasing filtered complex of modules, complete in each degree: the canonical map Cklimm0Ck/FmCk is an isomorphism. Fix n and define A(p,t)=FpCnd1(FtCn1),Zp=FpCnkerd,Qp=RtA(p,t). Here L,R mean countable Delta kernel and cokernel; a tower toward minus infinity is indexed by t=Tm, m0, with inclusion transitions. Finite changes of T give the canonical same result. Let S(p,t) be the image of A(p,t) in FpCn/Fp1Cn, and put S(p,)=tS(p,t). There is a natural exact sequence 0Zp1ZpS(p,)Qp1QpRtS(p,t)0. Moreover LpQp=0 and RpZp=0. Naturality is for filtration-preserving chain maps of complete filtered complexes. Exhaustiveness is not needed for this lemma.

Facts & Assumptions

[F1]

In a Filtered chain complex, d(FpCk)FpCk1 and d2=0.

[F2]

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

[F3]

Countable tower six term limit sequence gives the natural six-term sequence and invariance under finite cofinal tails, under AC.

[F4]

Two by two Delta complex for a double tower says that a commuting double system with LpA=RpA=0 for each t has LpRtA=0, under AC.

[F5]

The Axiom of Choice is assumed for the coordinate lifts in [F2]–[F4]; the residue and tail-sum constructions below select unique values and require no additional choice.

Proof

Given: The complete filtered complex and degree n of the statement. All submodules and quotients below have their usual element meaning.

1.1

Completeness includes injectivity, so mFmCk=0. Every fixed FpCk is closed in the residue sense: if xt(FpCk+FtCk), take tp to get xFpCk. A compatible family of residues defines a unique element of Ck by completeness, and if every sufficiently fine residue is represented in FpCk, its value lies in FpCk by this same test. Filtration preservation makes application of d compatible with residues.

F1
2.1

The transition maps of A(p,t) are inclusions in both coordinates and commute. For fixed t and pt one has A(p,t)=FpCn: [F1] gives the forward inclusion in the inverse-image condition, and the reverse is part of the definition. The cofinal p tower therefore has zero limit by separatedness and zero Delta cokernel by [F2] and completeness. The finite-tail identifications of [F3] give LpA(p,t)=RpA(p,t)=0 for the full p tower with any fixed upper endpoint.

F1F2F3F5step 1.1
2.2

For the cycle tower at indices m, let ymZm be any product tuple. For each m and l0 define a residue modulo FlCn by the finite sum mk<lyk when l>m, and zero when lm. The residues are compatible since all newly removed summands lie in the coarser filtration piece. Completeness supplies a unique xmCn. Its residue modulo Fm is zero, so xmFmCn. Applying d to every residue gives zero because each yk is a cycle; separatedness of Cn1 implies dxm=0. Thus xmZm. Comparing the finite sums in every quotient gives xmxm+1=ym, since the quotient family separates elements. Delta on this cycle tower is onto, so RpZp=0, again with arbitrary upper endpoint by [F3].

F1F3step 1.1
3.1

For fixed p, compatibility in the inclusion tower A(p,t) means a single element lies in every A(p,t). By separatedness of Cn1 this is precisely Zp. Apply [F4] to the rectangular system restricted to any fixed upper endpoints in p,t. Step 2.1 verifies both required vanishings. Thus LpQp=LpRtA(p,t)=0. Changing endpoints gives the same result by [F3], so this holds for the full minus-infinity tower of the Qp.

F3F4F5step 1.1step 2.1
4.1

Fix p and use a common t endpoint for A(p1,t) and A(p,t). The kernel of their map to FpCn/Fp1Cn is exactly A(p1,t); hence 0A(p1,t)A(p,t)S(p,t)0 is termwise exact. The maps on S are inclusions of nested submodules in the fixed graded module. Its limit is their intersection: compatibility means every coordinate is the same element. Applying [F3] and step 3.1 identifies the first three limit terms as Zp1,Zp,S(p,) and gives the asserted sequence, with the Q map induced by inclusion.

F3F5step 3.1
5.1

A filtration-preserving chain map sends each A(p,t), Zp and S(p,t) to its counterpart. It commutes with their inclusions and quotient maps and therefore with the six-term sequence by [F3]. The double-Delta comparison is natural by [F4]; the residue construction is compatible because a continuous filtered map sends the uniquely determined residues to their images. This proves the stated naturality.

F1F3F4step 3.1step 4.1step 2.2
6.1

Steps 3.1, 4.1 and 2.2 establish the sequence and both vanishings. Zero chain groups give zero towers and zero sequences. A finite lower filtration bound makes all sufficiently small A(p,t) in the p direction zero, consistently with the argument. Repeated pieces and zero differentials are allowed: for d=0, A(p,t)=Zp=FpCn is constant in t, so Qp=0 and the exact sequence reduces to the graded quotient sequence. No sum over an unbounded set of nonvanishing residues was taken: each residue in step 2.2 is a finite sum, including the empty sum at lm. AC is confined to the cited tower lemmas as declared in [F5].

F3F5step 3.1step 4.1step 2.2step 5.1

Source notes

The owner Delta alternatives sections 4–5 supplied the candidate. This proof supplies the approximate-cycle comparison and obstruction-limit vanishing directly, instead of importing the later double-derived-functor interchange in Weibel 5.8.7. The complete filtered hypotheses and the exact rectangular indices are part of the statement.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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.

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Failure of separatedness or completeness can destroy the claimed abutment

Statement

Failure of separatedness or completeness can invalidate recovery of a claimed target from the limiting page. There is a nonseparated filtered complex with nonzero homology and every spectral page zero. There is a separated exhaustive, but incomplete, filtered complex with E1=0 and nonzero homology. An object and its completion can also have the same associated-graded spectral pages and nonisomorphic homology targets. All three examples below are choice-free.

Facts & Assumptions

[F1]

Countable sequence groups and tail filtrations gives k=Z/2, the finite-support group SP=kN, their tails Tm, quotients km, separatedness, completions and different cardinalities.

[F2]

Abelian-group model for spectral-sequence computations licenses the abelian-group complexes and their subgroup kernels and coset homology quotients.

[F4]

Induced filtration on homology uses actual homology images. Weak convergence of a spectral sequence identifies only the graded target; Strong convergence of a spectral sequence additionally requires separation and completeness.

Proof

Given: The groups in [F1]. All omitted chain degrees are zero.

1.1

Put C0=k with zero differential and FpC0=k for every integer p. Each graded quotient is k/k=0, so E0=0 and every later page is zero by successive homology. But H0(C)=k and every homology filtration term equals k, whose intersection is nonzero. The zero limiting page agrees with the zero associated graded of this target; it does not imply that the target is zero. Thus this is weak convergence without separatedness or strong convergence.

F2F3F4
1.2

Next take C1=S, C0=P, with differential the inclusion. On either nonzero degree set FmCj=TmCj for m0 and FpCj=Cj for p>0. The inclusion preserves every tail, so these are subcomplexes. The filtration is increasing and exhaustive because F0C=C. Its intersection is zero in both degrees, but its degree-one completion map is the proper inclusion SP; hence the filtered complex is incomplete.

F1F2
2.1

For p=m0, the successive quotient in either nonzero chain degree is Tm/Tm+1k, by the coordinate m map with zero-extension inverse. The induced differential between these two graded terms is the identity of k. For p>0 the quotient is zero. Thus every fixed-p graded complex is either k1k in degrees 1,0 or the zero complex; its homology vanishes. Hence E1=0, and all later pages vanish. In contrast H1(C)=0 and H0(C)=P/S; the constant-one sequence gives a nonzero class because it is not finitely supported.

F1F2F3step 1.2
3.1

Every xP differs from its tail obtained by deleting coordinates 0,,m1 by an element of S. Thus TmPP/S is surjective for every m, and the induced homology filtration has FpH0(C)=P/S for every integer p. This explains the lost target: the limiting zero page agrees with a zero associated graded, while the homology filtration is nonseparated. The chain complex's incompleteness was already checked in step 1.2; no complete-convergence theorem applies to it.

F1F4step 1.2step 2.1
4.1

Finally take the zero-differential complexes S[0] and P[0] with the same tail filtrations. Their associated-graded terms are k at (p,q)=(m,m) for each m0, and zero elsewhere. Every spectral differential is zero because the chain differential is zero, so these graded identifications persist on every page. Their homology targets are respectively S and P, which are not isomorphic even as sets by [F1]. The inclusion induces the page isomorphisms and is the completion map, but is not onto on homology. Thus equal graded pages cannot replace the missing completeness hypothesis. The initial level m=0, zero positive levels and empty deleted prefix all satisfy the displayed formulas. Every construction uses fixed coordinates or finite truncations, without AC.

F1F3F4step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Finite and complete filtered isomorphism lifting

Statement

Let f:AB preserve increasing filtrations and induce isomorphisms FpA/Fp1AFpB/Fp1B for every integer p. If both filtrations are finite in an abelian category, f is an isomorphism of filtered objects. The same conclusion holds for exhaustive, separated, complete filtrations of modules over a fixed ring. In particular its inverse preserves each filtration piece. Neither conclusion needs AC or a splitting; the complete case needs no finite filtration bound.

Facts & Assumptions

[F1]

Spectral sequence subquotient and local lifting calculus supplies finite quotient comparisons, epic local lifting and descent in an abelian category.

[F2]

Strong convergence of a spectral sequence specifies completeness by the compatible quotient inverse limit, and exhaustiveness and separatedness separately. Here these are hypotheses on the filtered objects, without requiring a spectral sequence.

Proof

Given: f with the stated graded isomorphisms.

1.1

Consider a commutative diagram of short exact sequences 0UXV0 and 0UXV0, whose maps on U and V are isomorphisms. If a morphism into X is killed by the middle map, its image in V is killed by the isomorphism to V, hence zero. It factors through U, where the isomorphism to U and the monic inclusion force it to be zero. Thus the middle map is monic. To lift a morphism into X, first project to V, use the inverse on V, and lift into X after epic pullback. Its difference from the prescribed map lies in U, so use the inverse on U to correct the lift. Thus the middle map is epic by epic cancellation. A monic epic in an abelian category is invertible by its coimage-image factorization. The local lifts and their cancellation have precisely the meaning of [F1]; no global representatives are chosen.

F1
1.2

Under the complete module hypotheses, completeness identifies FpA with limk<pFpA/FkA. Indeed a compatible tuple in these subquotients is a tuple in A/FkA for k<p. Its component at p and at larger indices is zero, since each tuple entry has a representative in FpA. This extends it uniquely to a compatible tuple in the full quotient system. Completeness supplies a unique aA with those residues, and its zero residue at p says aFpA. Conversely an element of FpA gives that tuple, and its uniqueness follows from separatedness (also from the injective completion map). The formulas preserve addition and scalar multiplication. The same argument applies to B.

F2
2.1

For finite filtrations take common integer bounds a<b such that both Fa pieces are zero and both Fb pieces are the whole objects. At a the restriction of f is an isomorphism of zero objects. Apply step 1.1 to the sequences 0Fp1FpFp/Fp10 for a<pb. Finite induction proves every restriction FpAFpB invertible, including f at b. Below a and above b the restrictions are respectively the zero and whole-object maps. Their inverses are the restrictions of f1 by uniqueness, so the inverse is filtered. Empty graded pieces and repeated filtration terms cause no change to the argument.

F1step 1.1
3.1

Now assume the complete module hypotheses. For any fixed k<p, filter FpA/FkA and FpB/FkB by the images of the intermediate Fj for kjp. The successive quotients are the original graded pieces by the nested-quotient comparison. The finite argument therefore gives an isomorphism fp,k:FpA/FkAFpB/FkB. For k<k its quotient-transition squares commute; applying inverses on both sides proves the inverse squares commute as well.

F1step 2.1
4.1

The compatible inverse maps in step 3.1 send a compatible tuple on the B side to one on the A side. By step 1.2 they give an inverse to f:FpAFpB for every p. This constructs the inverse without selecting representatives: all residue inverses and their limits are unique. Every bB lies in some FpB by exhaustiveness and therefore has a preimage in FpA. Every kernel element in A lies in some FpA and is zero by injectivity there. Thus f is bijective and linear, and its inverse sends FpB into FpA. The zero module and any one-step finite filtration satisfy the same formulas. Infinite index sets enter only through unique compatible tuples, so no AC is used.

F2step 3.1step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Spectral sequence comparison theorem

Statement

Let f:EE~ be a morphism of spectral sequences that is an isomorphism at every bidegree on one page s. Suppose the two sequences strongly converge in this page's convention to filtered families Hn and H~n, and let hn:HnH~n be filtered maps compatible with the specified abutment identifications. Then every grphn is an isomorphism. Each hn is an isomorphism of filtered objects if both degree-n filtrations are finite in an abelian category, or if the targets are modules with exhaustive separated complete filtrations. An abstract page isomorphism without compatible target maps supplies no such target conclusion.

Facts & Assumptions

[F1]

Morphism of spectral sequences requires differential commutation and fr+1αr=α~rH(fr); the abutment maps are additional data.

[F2]

Homology object of a chain complex takes homology as cycles modulo boundaries.

[F3]

Strong convergence of a spectral sequence provides two-sided pointwise stationarity, specified weak-convergence identifications and the stated target-filtration conditions.

[F4]

Finite and complete filtered isomorphism lifting upgrades a graded isomorphism to a filtered isomorphism under either of the two target hypotheses, without AC.

Proof

Given: f, its page s, and the compatible filtered maps hn.

1.1

The inverse of the page map fs commutes with differentials: multiply d~fs=fsd by the componentwise inverses at the source and target to obtain dfs1=fs1d~. Hence both maps preserve cycle kernels and incoming boundary images. They induce mutually inverse homology quotient maps. The transition identity gives fs+1=α~sH(fs)αs1, an isomorphism. Induction proves fr is an isomorphism at every bidegree for every rs.

F1F2
2.1

Fix (p,q). Choose an integer rs beyond the two stationarity bounds for this position in both sequences. Their specified transitions canonically identify these terms with their limiting terms. By step 1.1 the resulting limiting map f:Ep,qE~p,q is an isomorphism. Compatibility of hp+q with the abutment data says that its graded map is this map conjugated by the two specified graded identifications. Thus grphp+q is an isomorphism. Only finitely many bounds were compared at each fixed position; there is no uniform-collapse hypothesis.

F1F3step 1.1
3.1

Fix n. Step 2.1 proves that the filtered map hn induces an isomorphism on every graded piece. Apply [F4] to its finite filtrations in the abelian-category case, or to its exhaustive separated complete module filtrations in the other case. It follows that hn is invertible with filtered inverse. This uses strong convergence as supplied data, and does not invoke any theorem asserting convergence of an unbounded filtered complex. Zero page terms, a zero target, and a single filtration jump are included in [F4]. No AC is introduced. Without the compatibility in step 2.1, the page map would say nothing about the graded map of the specified hn, so that hypothesis cannot be omitted from this argument.

F3F4step 2.1
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Quasi isomorphism criterion from a filtered map

Statement

Let f:CD be a filtered chain map whose maps on every associated-graded complex are quasi-isomorphisms. If both filtered-complex spectral sequences strongly converge to their actual homology with target filtrations satisfying the finite or complete module hypotheses of the comparison theorem, then f is a quasi-isomorphism. Degreewise finite filtrations on both complexes suffice, without a first-quadrant or uniform-bound hypothesis.

Facts & Assumptions

[F1]

Filtered chain map and A filtered chain map induces a morphism of spectral sequences give the induced spectral morphism. E one is homology of the associated graded complex identifies its first page naturally with graded-complex homology.

[F2]

Induced filtration on homology is the homology image filtration. The actual-cycle abutment and completeness conventions are in Strong convergence of a spectral sequence.

[F3]

Spectral sequence comparison theorem applies to page isomorphisms with compatible filtered target maps under the stated target hypotheses.

[F4]

Bounded filtered complex spectral sequence abuts to filtered homology proves the degreewise finite abutment and stabilization, without a quadrant restriction. A first quadrant filtered complex spectral sequence converges to filtered homology gives its first-quadrant specialization with completeness.

[F5]

Quasi-isomorphism requires isomorphisms on homology in every degree.

Proof

Given: f and the graded quasi-isomorphism hypothesis.

1.1

By [F1] there is a morphism of spectral sequences, whose component at (p,q) on page one identifies with Hp+q(grpf). This is an isomorphism by the hypothesis and [F5], for every p,q. Thus the required isomorphism is on an entire page, including every zero graded complex.

F1F5
1.2

The map Hn(f) preserves the homology image filtration: a cycle coming from FpC maps to a cycle coming from FpD. On its graded quotient, it sends the class of an actual cycle c to that of f(c). The spectral map does the same on the limiting actual-cycle classes, because it is induced by the filtered chain map. Hence the given strong abutment identifications commute with the maps Hn(f); these are the actual maps required by comparison.

F1F2
2.1

Under the conditional strong-convergence and target hypotheses, apply [F3] to steps 1.1–1.2. It makes every Hn(f) an isomorphism, which is exactly the quasi-isomorphism conclusion. This does not claim that completeness of the complexes by itself establishes those convergence hypotheses.

F3F5step 1.1step 1.2
3.1

If instead both chain filtrations are degreewise finite, [F4] supplies canonical actual-cycle abutments, two-sided stationarity and finite homology filtrations. Each such finite target filtration is exhaustive and separated, and its lower quotient tail is constant equal to the target, so its completion map is an isomorphism by [F2]. Thus strong convergence and the finite comparison hypotheses hold, and step 2.1 applies. This argument uses the unrestricted bounded theorem in [F4], so no first-quadrant assumption is silently added; the first-quadrant theorem is its named special case. Finite bounds may vary with degree, repeated terms and a one-step filtration are allowed, and neither branch introduces AC.

F2F4step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Five term exact sequence of a first quadrant cohomological spectral sequence

Statement

Let Erp,q be a cohomological spectral sequence in an abelian category, first quadrant from page 2, with specified finite abutment to Hn and decreasing filtration normalized by F0Hn=Hn, Fn+1Hn=0 for n0. There is an exact sequence 0E21,0H1E20,1d2E22,0H2, whose maps adjacent to H1,H2 are the corresponding edge maps. No terminal surjectivity onto H2 is asserted.

Facts & Assumptions

[F1]

Cohomological spectral sequence gives degree (r,1r) and the specified homology transitions.

[F2]

Edge homomorphisms of a first quadrant spectral sequence specifies the cohomological edge maps through the finite filtration's extreme graded pieces.

[F3]

Spectral sequence subquotient and local lifting calculus gives canonical kernel, image and quotient comparisons in an abelian category.

Proof

Given: The sequence and normalized abutment in the statement. All support claims refer to pages r2; a zero term remains zero under a homology transition.

1.1

At (1,0) the outgoing target (1+r,1r) has negative second coordinate and the incoming source (1r,r1) has negative first coordinate. Both are zero. Thus E21,0 is canonically the stable term E1,0=F1H1/F2H1=F1H1. Its edge map is the monic filtration inclusion into H1.

F1F2
1.2

At (0,1) every incoming source (r,r) is zero. The outgoing target is (r,2r), which is in the first quadrant only for r=2. Consequently the transition identifies E30,1 with ker(d2:E20,1E22,0), and all later transitions there are stationary. By abutment this kernel is E0,1=H1/F1H1. Therefore the edge H1E20,1 is the quotient onto this kernel followed by its inclusion.

F1F2F3
1.3

At (2,0) all outgoing targets (2+r,1r) are zero. The incoming source (2r,r1) is in the quadrant only for r=2, when it is (0,1). Hence E2,0=cokerd2. Abutment identifies this with F2H2/F3H2=F2H2. Its edge into H2 is the cokernel projection followed by that filtration inclusion.

F1F2F3
2.1

Step 1.1 proves exactness at E21,0 including the initial zero. The kernel at H1 in step 1.2 is F1H1, the preceding image. Its image at E20,1 is exactly kerd2. Step 1.3 says that the kernel of the next edge at E22,0 is exactly imd2, because its second factor is monic. These are every asserted exactness position; H2 has no outgoing arrow in the statement. The formulas remain valid when any term or d2 is zero; when d2=0, its kernel and cokernel are their whole source and target. All identifications use specified transitions and abutment maps, not chosen splittings, and require no AC.

F3step 1.1step 1.2step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Five term exact sequence of a first quadrant homological spectral sequence

Statement

Let Ep,qr be a homological spectral sequence in an abelian category, first quadrant from page 2, with specified finite abutment to Hn and increasing filtration normalized by F1Hn=0, FnHn=Hn for n0. There is an exact sequence H2E2,02d2E0,12H1E1,020. The maps adjacent to homology are the edge maps. No initial injectivity of H2E2,02 is asserted.

Facts & Assumptions

[F1]

Homological spectral sequence gives degree (r,r1) and homology transitions.

[F2]

Edge homomorphisms of a first quadrant spectral sequence specifies the homological edge maps through normalized extreme filtration pieces.

[F3]

Spectral sequence subquotient and local lifting calculus gives canonical kernel, image and quotient comparisons.

Proof

Given: The sequence and normalized abutment in the statement. All page indices below satisfy r2; terms outside the first quadrant stay zero.

1.1

At (1,0) the outgoing target (1r,r1) and incoming source (1+r,1r) are zero. Thus E1,02 is canonically E1,0=H1/F0H1, and the edge H1E1,02 is the epic quotient map.

F1F2
1.2

At (0,1) all outgoing targets (r,r) vanish. Its incoming source is (r,2r), which lies in the quadrant only for r=2. Therefore E0,1=coker(d2:E2,02E0,12), identified by abutment with F0H1/F1H1=F0H1. The edge E0,12H1 is the cokernel projection followed by the filtration inclusion.

F1F2F3
1.3

At (2,0) all incoming sources (2+r,1r) vanish. Its outgoing target (2r,r1) lies in the quadrant only at r=2. Hence E2,0=kerd2, identified with F2H2/F1H2=H2/F1H2. The edge H2E2,02 is the quotient onto that kernel followed by its monic inclusion.

F1F2F3
2.1

Step 1.3 proves that the image at E2,02 is kerd2. Step 1.2 proves that the next kernel at E0,12 is imd2, and its image in H1 is F0H1. This is the kernel of the quotient in step 1.1, which is onto, proving exactness also at E1,02 before the terminal zero. These are precisely all claimed positions. There is no claim about a kernel at the initial H2 without a preceding map. Zero terms and zero d2 give the same kernel and cokernel factorizations; the degree-one normalized endpoints are used explicitly. All maps are canonical from the specified data, without splittings or AC.

F3step 1.1step 1.2step 1.3
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Collapse with projective associated graded pieces splits the finite filtration noncanonically

Statement

If an R-module H has a finite increasing filtration whose associated-graded pieces are projective, then H is noncanonically isomorphic, as a filtered module, to the finite direct sum of those pieces with its partial-sum filtration. In particular a collapsed convergent spectral sequence whose target filtration is finite and whose graded target pieces are projective has a splitting of its target filtration. This establishes existence of a splitting, not a canonical choice.

Facts & Assumptions

[F1]

Projective modules and the lifting property lifts maps from a projective module across a surjective module homomorphism.

[F2]

Exhaustive separated bounded and finite filtration supplies finite zero/full endpoints.

[F3]

Weak convergence of a spectral sequence identifies limiting terms with the graded target pieces; it does not identify the unfiltered target with them.

[F4]

Abelian-group model for spectral-sequence computations supplies the integer group, finite biproducts and coordinate operations used in the noncanonicity witness.

Proof

Given: FaH=0, FbH=H for integers a<b, and projective Gp=FpH/Fp1H for a<pb.

1.1

The quotient map qp:FpHGp is surjective. Apply [F1] with the identity of Gp to obtain a linear section sp:GpFpH, with qpsp=1. Then ϕp:Fp1HGpFpH, (x,y)x+sp(y), is linear. If its value is zero, applying qp gives y=0 and then x=0. For any zFpH, take y=qpz; the remainder zsp(y) lies in kerqp=Fp1H, so z is in its image. Thus ϕp is an isomorphism restricting to the given inclusion on the first summand.

F1
2.1

Starting from FaH=0, apply step 1.1 successively at the finitely many indices a+1,,b. This gives Ha<pbGp and sends each partial sum through p onto FpH. The inverse is therefore filtered too. Only finitely many sections are selected, by finite induction, so no arbitrary-index choice or AC is needed. Zero pieces require only the zero section; the zero module and a single nonzero stage are included. Bounds below a and above b add zero graded pieces and do not change the conclusion.

F2step 1.1
3.1

Under the spectral-sequence hypothesis, the target filtration is finite by assumption, and the supplied abutment isomorphisms in [F3] identify its projective limiting terms with the modules Gp. Step 2.1 then applies degree by degree. No claim that collapse alone forces finiteness, projectivity or a determination of the extension was used.

F3step 2.1
4.1

Noncanonicity occurs already for H=ZZ with filtration 0Z0H. Both graded pieces are projective: given a surjection of abelian groups and a map from Z, lift the image of 1 to one element and extend by integer multiples. The quotient onto the second coordinate has distinct sections s0(y)=(0,y) and s1(y)=(y,y). The automorphism T(x,y)=(x+y,y) preserves the filtration and induces the identity on both graded pieces, but takes s0 to s1. More strongly, every section has s(1)=(t,1) for an integer t, and T(s(1))=(t+1,1)s(1). Thus no section can be invariant under all automorphisms of the given filtered data; a canonical splitting does not follow. This uses only the elementary integer-module operations, not AC.

F1F4step 1.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

A map of exact couples induces a map of spectral sequences

Statement

A morphism of graded exact couples induces a morphism of their derived exact couples and therefore a morphism of their spectral sequences, preserving every bidegree and page transition. This construction respects identities and composition.

Facts & Assumptions

[F1]

Exact couple defines bidegree-zero pairs (u,v) commuting with i,j,k. Derived exact couple gives D=imi, E=H(E,jk) and the formulas i(a)=ia, j(ix)=[jx], k[e]=ke.

[F2]

An exact couple generates a spectral sequence iterates this derivation with its specified homology transitions.

[F3]

Morphism of spectral sequences requires differential and homology-transition commutation.

[F4]

Spectral sequence subquotient and local lifting calculus permits local epic lifts, image restrictions and unique quotient descent.

Proof

Given: A map (u,v):(D,E,i,j,k)(D~,E~,i~,j~,k~) of page-r exact couples. Tildes denote the target structure throughout.

1.1

Since ui=i~u, the component of u at (p,q) sends Dp,q=imip1,q+1 into D~p,q, giving a restriction u. Also vjk=j~uk=j~k~v, so v commutes with the page differential, sends cycles to cycles and boundaries to boundaries, and induces v:Ep,qE~p,q. Both maps preserve the bidegree.

F1F4
2.1

For aDp,q, the equality uia=u(ia)=i~(ua)=i~ua proves the derived i square. Locally write a=ix, where x has bidegree (p1,q+1). Then vja=[vjx]=[j~ux]=j~(i~ux)=j~ua, at bidegree (pr,q+r). The formula is independent of the local lift by the already defined derived maps, and equality descends by epic cancellation. For a cycle eEp,q, uk[e]=uke=k~ve=k~v[e], with target D~p1,q. Quotient descent proves this last equality on all of E. These are every derived-couple commutation square with its required degrees.

F1F4step 1.1
3.1

Repeat steps 1.1–2.1 at each derived couple. On its E terms the next map is precisely the map induced on homology by the current v map. Thus the maps commute with every differential and with each transition in [F2], as required by [F3]. Image restrictions of identity maps are identities; quotient maps induced by identities are identities. Restrictions and quotient descents of a composite agree with composites of the restrictions and descents by their uniqueness. This proves identity and composition compatibility at every finite stage. Zero images, zero homology quotients and the initial r=1 case all use the same formulas; the latter sends the derived j to degree (1,1) as required. No global lifts or AC are used.

F2F3F4step 1.1step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Sum and product totalisations can differ on infinite diagonals

Statement refuted

Whenever both totalisations of a homological double complex exist, they are isomorphic as chain complexes.

Facts & Assumptions

[F2]

Product total complex of a double complex gives the product total complex.

[F3]

Countable sequence groups and tail filtrations constructs S=(Z/2)(N) and P=(Z/2)N and proves that S is countably infinite while P is uncountable.

Counterexample

Given: The category of abelian groups, and Cj,j=Z/2 for j0, with every other component zero and every horizontal and vertical arrow zero.

1.1

Each individual square and each mixed composite is zero, so these data are an anticommuting double complex. Its only nonzero diagonal is total degree zero. The two total objects there are respectively S and P by their universal properties; all other total degrees are zero. The total differentials are zero by their defining formulas, so both constructions exist as chain complexes.

F1F2F3given
2.1

Any chain-complex isomorphism between them would have an isomorphism SP in degree zero, hence a bijection of the underlying sets. Composing it with the enumeration of S would enumerate P, contrary to its proved uncountability. Thus even an abstract chain isomorphism is impossible. In particular the canonical comparison is the finite-support inclusion, which misses the constant-one sequence. The infinitely many nonzero components in degree zero are essential to this witness; the zero groups in other degrees cause no exception.

F3step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

The two spectral sequences of a double complex have identical e one pages

Statement

False: The two spectral sequences of every double complex have identical E1 pages.

Facts & Assumptions

Refutation

Given: C1,0=C0,0=k, h1,0=1k, and every other component and map zero. All double-complex identities hold because every possible double composite is zero.

1.1

The only nonzero horizontal complex is k1k. Its kernel at the source and cokernel at the target are zero. Thus every row E1 term is zero. The two nonzero vertical complexes each consist of a single k with zero differential; therefore column E1,01=E0,01=k. The row and column formulas have exactly the hypotheses in [F1], since the witness is first quadrant and finitely supported.

F1F2
2.1

In particular the row term at (0,0) is zero while the column term there is the nonzero group k, so the pages are not even isomorphic as bigraded objects. Both sequences nevertheless abut to the zero homology of the total identity complex. The zero double complex would have equal pages, but cannot rescue the universal assertion. The witness uses only two components and zero or identity maps, with no choice assumption.

F2step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Direct sum and product totalisations are always isomorphic

Statement

False: Direct-sum and product totalisations are always isomorphic whenever both exist.

Facts & Assumptions

[F1]

Direct sum total complex of a double complex and Product total complex of a double complex specify the diagonal objects and total differentials.

[F2]

Countable sequence groups and tail filtrations constructs S=(Z/2)(N) and P=(Z/2)N and proves that they have different cardinalities.

Refutation

Given: The infinite-diagonal witness of Sum and product totalisations can differ on infinite diagonals: Cj,j=Z/2 for j0, every other component zero, and all arrows zero.

1.1

All double-complex identities hold because all maps vanish. The degree-zero direct-sum total object is S and the degree-zero product total object is P by [F1, F2]. Every other total degree is zero and both total differentials are zero. Thus both totalisations exist, with infinitely many nonzero summands on their sole nonzero diagonal.

F1F2
2.1

An isomorphism of these chain complexes would induce a bijection SP, impossible because S is countably infinite and P is uncountable. The canonical comparison is also explicitly nonsurjective: the constant-one sequence lies in P and has infinite support, so is absent from S. This verifies the failed conclusion for abstract as well as canonical isomorphisms. All zero degrees and the index j=0 are included; the cardinality proof and this witness require no AC.

F2step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Every exact couple is a long exact sequence with no extra grading data

Statement

False: An ungraded long exact sequence, without additional grading and repeated-object data, determines the specified homological exact-couple spectral sequence.

Facts & Assumptions

[F1]

Exact couple requires the bigraded objects and degrees degi=(1,1), degj=(0,0), degk=(1,0) in an initial couple, in addition to three exactness conditions.

[F2]

Abelian-group model for spectral-sequence computations proves that multiplication by 2 on Z is injective, with image 2Z and cokernel Z/2.

Refutation

Given: The ungraded long exact sequence with nonzero terms L0=Z, L1=Z, L2=Z/2, maps L0L1 multiplication by 2 and L1L2 reduction modulo 2, and Ln=0 for every other integer n. All other maps are zero.

1.1

This sequence is exact: multiplication by 2 is injective, its image is the kernel of reduction, and reduction is surjective. Exactness at every zero term is equality of zero subgroups.

F2
2.1

For each c{0,1} define Dp,q(c)=Z and Ep,q(c)=Z/2 when p+q=c, and zero otherwise. Let i be multiplication by 2 on supported components, j reduction on supported components, and k the zero map to its prescribed target Dp1,q(c). All off-support maps are zero. The shift (1,1) preserves support, and j has degree (0,0). At supported D, imi=2Z=kerj and imk=0=keri; at supported E, imj=E=kerk. At off-support targets each required image and kernel is zero, including any zero map from a supported source. Thus these are initial exact couples with exactly the degrees in [F1].

F1F2step 1.1
3.1

To specify the underlying long exact sequences without dropping zero terms, fix any integer a. Following i,j,k in the c-couple gives, for every integer m, the consecutive terms Da,cam(c)iDa+1,cam1(c)jEa+1,cam1(c)kDa,cam1(c). The last term is the first term for m+1. Assign the first three terms sequence positions 3m,3m+1,3m+2. Their total bidegree is cm, so they are nonzero exactly when m=0. Forgetting bidegrees therefore gives exactly the sequence L of step 1.1, for both c=0 and c=1, for every a. In particular the zero target of each supported k remains a zero term. No sum of the indexed families is being taken.

step 1.1step 2.1
4.1

The two E1 pages differ: E0,0(0)=Z/2 whereas E0,0(1)=0. Hence they cannot be isomorphic by bidegree-zero maps. Even the displayed collection of underlying long exact sequences is identical in the two constructions, while their specified first spectral pages are different. Thus the ungraded sequence does not determine the specified homological exact-couple spectral sequence; bidegree allocation is essential extra data. This asserts neither failure of ungraded exactness nor a convergence statement, and uses no choice.

F1F2step 3.1
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

First quadrant support alone identifies the abutment without a filtration

Statement

False: First-quadrant support by itself determines a target and its abutment without any target filtration data.

Facts & Assumptions

[F1]

Homological spectral sequence defines first-quadrant support, page differentials and homology transitions, without target data. Weak convergence of a spectral sequence requires separate specified graded-target identifications.

[F2]

Abelian-group model for spectral-sequence computations supplies Z/4, k=Z/2 and k2 with their explicit additions. Isomorphic associated graded objects need not give isomorphic filtered objects specifies the two finite filtrations with graded pieces k,k.

Refutation

Given: A stationary spectral sequence from page 2 with terms k at (0,1) and (1,0) and zero elsewhere, zero differentials and identity homology transitions.

1.1

These data satisfy [F1]: all differential composites vanish and the homology of each page is that same page. The support is first quadrant. Put H1=A=Z/4 with F1A=0, F0A={0,2}, F1A=A, constant beyond these endpoints. The degree-zero graded piece is k by [a]2[2a]4; the degree-one quotient is k by parity of the representative. Alternatively put H~1=B=k2 with F1B=0, F0B=k×0, F1B=B. Its two pieces are k by the first coordinate in the subobject and the second coordinate in the quotient. Take every other target degree zero. Thus the same specified stationary page has finite normalized abutment data to either target.

F1F2
2.1

Every element of B is killed by 2, whereas 2[1]4=[2]40 in A. An additive isomorphism AB would send [2]4 to zero, contradicting injectivity. Therefore the two possible targets are not even isomorphic as unfiltered objects. Support alone cannot select between them or supply the missing extension data. The all-zero spectral sequence is also first quadrant but contains no target as part of its definition; the nonzero example above proves underdetermination even after fixing graded identifications. Zero other degrees, both finite endpoints and all four residues have been checked, without AC.

F1F2step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

An isomorphism on e infinity automatically gives an isomorphism of unfiltered targets

Statement

False: An isomorphism on E automatically makes a compatible unfiltered target map an isomorphism, without finite or complete separated filtration hypotheses.

Facts & Assumptions

[F1]

Countable sequence groups and tail filtrations constructs the inclusion SP of finite-support into all binary sequences, with separated tails, common completion P and finite quotient identifications.

[F2]

R page of the spectral sequence of a filtered complex gives the graded initial page; The filtered differential induces d r on the r page gives its differentials from the chain differential. Failure of separatedness or completeness can destroy the claimed abutment establishes the possible failure of recovery from these pages.

[F3]

Spectral sequence comparison theorem requires compatible target maps and finite or exhaustive separated complete target filtrations for its lifting conclusion.

Refutation

Given: The inclusion f:S[0]P[0] of complexes concentrated in degree zero, filtered by Fm=Tm for m0 and the whole group for positive indices.

1.1

The induced graded map at p=m is the identity on k=Z/2 via the coordinate m identification Tm/Tm+1k. All positive graded pieces are zero. Since both chain differentials vanish, every page differential is zero and these identifications persist on every page, including E at positions (m,m). The homology targets are S and P themselves, with the same tails, and the induced target map is the inclusion. Its graded maps are precisely the page maps, so compatibility is satisfied.

F1F2
2.1

The constant-one sequence in P is not in S, so this compatible target map is not surjective. Both filtrations are exhaustive (F0 is full) and separated, but the source completion map is this same proper inclusion SP, hence is not an isomorphism. Thus the finite or complete-target lifting premise of [F3] fails on the source, while the limiting-page isomorphism holds. The index m=0 and zero positive levels were included in step 1.1, and the counterexample is choice-free.

F1F3step 1.1
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Exhaustive filtration implies separated and complete filtration

Statement

False: An exhaustive filtration is automatically separated and complete.

Facts & Assumptions

[F1]

Strong convergence of a spectral sequence specifies exhaustiveness by union, separatedness by zero intersection and completeness by the canonical inverse-quotient map in modules.

[F2]

Abelian-group model for spectral-sequence computations supplies the nonzero group k=Z/2. Countable sequence groups and tail filtrations gives the separated tail filtrations of S=k(N) and P=kN and the proper completion inclusion SP.

Refutation

Given: First the constant increasing filtration Fpk=k for every integer p.

1.1

Its union is k, so it is exhaustive. Its intersection is also k0, so it is not separated. Every quotient k/Fpk is zero, and the inverse system therefore has zero limit: a cone into zero objects has exactly the unique zero map into the zero object. The completion map k0 kills the nonzero class of 1 and is not an isomorphism. Thus the same exhaustive filtration fails both asserted conclusions.

F1F2
2.1

Separately filter S by FmS=TmS for m0 and FpS=S for p>0. This is exhaustive since F0S=S. If a sequence lies in every tail, its coordinate j is zero by taking m=j+1, so the filtration is separated. Its quotients are km with truncation maps, and their limit is P by [F2]. The completion map misses the constant-one sequence, hence is not onto. This second example shows that even adding separatedness to exhaustiveness does not force completeness. The index m=0 gives the zero quotient by the whole group; the zero group itself would satisfy all three properties and is not a refuting witness. All maps and sequences used are explicit and require no AC.

F1F2

Sources