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

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

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