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.

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

Depends on

Used by

Dependency tree · two levels

3 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