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.

A first quadrant five term exact sequence

Example

Over k=Z/2, take C1=kakb, C2=kc, zero in every other degree, and da=0, db=c. Give a,b,c weights 1,0,2 respectively and let FpC be spanned by vectors of weight at least p. Its cohomological spectral sequence is first quadrant and has the nonzero differential d2[b]=[c]. Its five-term sequence is 0k1k0k1k0, with the two middle homology targets H1(C)=k[a] and H2(C)=0 occupying the positions prescribed by the five-term theorem.

Facts & Assumptions

[F1]

The cohomological filtered complex construction constructs the pages, degree (r,1r) and finite image-filtration abutment by index reversal.

[F2]

The filtered differential induces d r on the r page computes a page differential by [x][dx]; reversing the two indices as in [F1] gives the same positive formula in cohomological notation.

[F3]

Five term exact sequence of a first quadrant cohomological spectral sequence specifies the five-term maps under normalized finite abutment.

[F4]

Abelian-group model for spectral-sequence computations supplies the binary coefficient group and finite coordinate quotient calculations.

Verification

Given: The cochain complex and weight filtration above; scalars are binary.

1.1

The only nonzero differential sends the weight-zero vector b to the weight-two vector c. Thus it preserves every decreasing piece, and d2=0 because the next degree is zero. All filtration pieces are full for p0 and zero for p3, so the finite construction applies. The E0 terms are k[a] at (1,0), k[b] at (0,1) and k[c] at (2,0); all other positions vanish. This support is first quadrant.

F1F4
2.1

The differential raises weight by two on b and vanishes on a,c, so its graded d0 is zero. The d1 of [b] is its differential projected to weight one in degree two, which is zero, and all other d1 maps are zero as well. Hence E2=E1=E0 as the displayed graded groups. On page two, db=cF2C2 gives d2[b]=[c] by [F2]. Both classes generate their copies of k, so this map is identity under those identifications. The class [a] has zero differential and receives none, and every later nonzero term is therefore just k[a] at (1,0).

F1F2F4step 1.1
2.2

Directly, the kernel of d:C1C2 is ka, there are no incoming boundaries in degree one, and d(C1)=kc=C2. Thus H1=k[a] and H2=0. The class [a] is represented in F1C, so F1H1=H1 and F2H1=0. This is the normalized finite abutment of [F1]; all degree-two target pieces are zero.

F1F4step 1.1
3.1

In [F3], the map E21,0H1 sends [a] to [a] and is identity. The next map H1E20,1 factors through H1/F1H1=0, so is zero. The transgression is the identity [b][c] from step 2.1, and the last map has zero target H2. Thus at the first k the kernel is zero, at the second k the zero-map kernel is all k and equals the preceding image, at the third k the identity-map kernel is zero and equals the preceding image, and at the fourth k the next kernel is all k and equals the transgression image. The terminal target is zero. This checks the printed sequence at every position, including its nonzero d2 and both ends, with no AC.

F3step 2.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

1 result within one dependency step 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