Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

An exhaustive nonseparated filtration with the wrong naive abutment

Statement refuted

It is false that an exhaustive filtered complex with zero limiting page must have zero actual homology. A nonseparated chain filtration gives one counterexample; an exhaustive separated but incomplete chain filtration gives another.

Facts & Assumptions

[F1]

Abelian-group model for spectral-sequence computations supplies k=Z/2 and subgroup homology quotients. Countable sequence groups and tail filtrations supplies SP, tails Tm and the proper completion SP.

[F3]

Induced filtration on homology uses images in actual homology. Failure of separatedness or completeness can destroy the claimed abutment distinguishes these failures from legitimate weak graded identifications.

Counterexample

Given: First C=k[0] with FpC=C at every integer index; second the inclusion complex K1=SK0=P with Fm=Tm for m0 and full positive pieces.

1.1

In the first example every graded quotient is k/k=0, so every page is zero. But H0(C)=k0 and FpH0(C)=k for every p, by the identity inclusion of the whole subcomplex. Its filtration is exhaustive, nonseparated, and has zero associated graded. Thus its zero limiting page can identify with its zero graded homology without implying zero homology. The filtration is not finite, since no piece is zero.

F1F2F3
1.2

In the second example the inclusion preserves every tail, so the pieces are subcomplexes. Both chain filtrations are exhaustive (F0 is full) and separated, but the degree-one completion map is the nonsurjective SP. At p=m each of the degree-one and degree-zero graded groups is Tm/Tm+1=k via coordinate m, and the graded differential is the identity. At p>0 both graded groups are zero. Therefore E1(K)=0 and every later page vanishes.

F1F2
2.1

The inclusion is injective, so H1(K)=0, while H0(K)=P/S. The constant-one sequence represents a nonzero class. For any xP and any m, delete its first m coordinates to obtain tTmP. The difference xt has finite support, so [x]=[t] in P/S. Thus the homology image of every tail subcomplex is all of P/S, and FpH0(K)=P/S at every index. The chain filtration was separated, but its homology filtration is not. This example fails chain completeness and finite bounds; the first fails separation already on chains. Neither is a counterexample to a theorem that requires these missing hypotheses. Empty deleted prefixes at m=0, zero other degrees and every positive filtration index obey the same calculations, without AC.

F1F3step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

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