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.

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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