Alphabeta Math
ExampleConstruction: 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 two by two double complex

Example

Put k=Z/2 in all four positions C1,1,C0,1,C1,0,C0,0. Let h1,1=1k, h1,0=0, and let every vertical map and every other component be zero. The two spectral sequences have different early pages and different degree-one filtration jumps, but both compute H0(TotC)=k, H1(TotC)=k, with all other total homology zero.

Facts & Assumptions

[F1]

The row filtration spectral sequence of a first quadrant double complex computes horizontal homology first, with Ep,q0=Cq,p and the row cutoff in vertical index.

[F2]

The column filtration spectral sequence of a first quadrant double complex computes vertical homology first, with Ep,q0=Cp,q and the column cutoff in horizontal index.

[F3]

Abelian-group model for spectral-sequence computations supplies the binary group and coordinate finite biproducts and homology quotients.

Verification

Given: The displayed two-by-two data. Every horizontal square is zero and every mixed composite includes a zero vertical map, so the double-complex identities hold.

1.1

In the column sequence the vertical differential is zero, so E1 consists of the four copies of k. Its d1 is identity from (1,1) to (0,1) and zero from (1,0) to (0,0). Thus E2 is k at (0,0),(1,0) and zero elsewhere. No higher differential has both source and target among those two positions, so these are also the limiting terms.

F2F3
1.2

In the row sequence, the row with vertical index one is the identity complex kk and has zero homology. The row with vertical index zero has zero horizontal differential, so its two homology terms are k. With the required transposition these lie at spectral positions (0,0),(0,1). The induced vertical d1 is zero, and all later differentials have zero endpoints. Thus this E1 page is already stationary.

F1F3
1.3

Order total degree one as C1,0C0,1. Then the total complex is kx(0,x)k20k in degrees 2,1,0. The first map is injective, its image is 0k, and the second map has kernel k2 and zero image. Consequently H2=0, H1=k2/(0k)k by the first coordinate, and H0=k. Other degrees are zero.

F1F2F3
2.1

The surviving H1 class is represented by C1,0. Row cutoff zero already includes it, giving F0rowH1=H1 and F1rowH1=0. Column cutoff zero includes only the degree-one summand C0,1, whose class in total homology is zero, so F0colH1=0 and F1colH1=H1. This accounts for the limiting positions (0,1) versus (1,0) despite the common total target. The first-quadrant finite bounds, axes and all omitted zero degrees have been checked; no representatives or maps were selected using AC.

F1F2step 1.1step 1.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

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