Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Edge maps from a first quadrant spectral sequence

Example

For the complex C1=Z --2--> C0=Z with F0C the degree-zero stalk, F1C=C and FpC=0 for p<0, both first-quadrant edge maps in degree zero, taken from E2, identify ℤ/2 with H0(C)=Z/2. All positive-degree edges are zero maps between zero groups.

Facts & Assumptions

Given: The two-step filtered multiplication-by-two complex and s=2.

[F1]

At s≥2 the homological edges factor through F0Hn and Hn/Fn1Hn (Edge homomorphisms of a first quadrant spectral sequence).

[F2]

Finite filtered convergence identifies the stable page with graded homology (Bounded filtered complex spectral sequence abuts to filtered homology).

[F3]

2:ℤ→ℤ is injective with cokernel ℤ/2 (Abelian-group model for spectral-sequence computations).

[F4]

The first two pages use the explicit filtered quotient formulas (R page of the spectral sequence of a filtered complex).

[F5]

The differential on a page sends a representative to its chain differential (The filtered differential induces d r on the r page).

Verification

technique · direct
1.1

The filtration is finite and preserved by d. Its graded terms are ℤ at (1,0),(0,0), with d0=0; the next differential sends x to 2y, so its kernel is zero and cokernel ℤ/2 by [F3]. Therefore E2 has only (0,0)=ℤ/2 and remains constant. Direct homology gives H1=0,H0=Z/2. The image of H0(F0C)=Z onto H0(C) is all ℤ/2. Thus F1H0=0,F0H0=H0, agreeing with [F2].

F2F3F4F5
2.1

For n=0 the vertical edge of [F1] is Z/2E0,0F0H0H0, taking [a] to [a] at every stage. The horizontal edge is H0H0/F1H0E0,0E0,02, again [a]↦[a]. For n>0 all these Hn and axis terms vanish by step 1.1, so both edges are the unique zero maps. The normalization FnHn=Hn holds for every n≥0.

F1step 1.1

Source notes

Weibel, Example 5.2.6; explicit calculation in this item.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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