Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources