Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

Acyclic assembly by exact columns

Statement

Let Kp,q be a first-quadrant double cochain complex whose signed total complex uses finite direct sums on every diagonal. Suppose a cochain complex C maps to the bottom edge so that, for every p, the augmented column 0CpKp,0vKp,1vKp,2 is exact and the augmentations commute with the horizontal maps. Then the induced cochain map CTotK is a quasi-isomorphism.

Facts & Assumptions

Given: The first-quadrant double complex, compatible column augmentations, and exact augmented columns stated above.

Proof

technique · direct
1.1

Adjoin Cp in vertical degree 1. Compatibility makes this an augmented double complex, and the cone of CTotK is its signed total complex up to shift. In total degree n, only the finitely many columns 0pn+1 occur; filtering by the largest horizontal degree has successive quotients equal to shifts of the exact augmented columns.

givenalgebra
2.1

Starting with one column and adjoining the others, the short exact sequences of successive filtered complexes show inductively that every finite truncation is acyclic. These truncations stabilize degreewise, so the full cone is acyclic. Hence CTotK is a quasi-isomorphism.

step 1.1algebra

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