Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passaudited 2026-09-01
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 long exact sequence in cohomology

Statement

Let 0→A∙→B∙→C∙→0 be a short exact sequence of cochain complexes in an abelian category. Then there is a natural exact sequence ⋯→Hn(A)→Hn(B)→Hn(C)→∂nHn+1(A)→Hn+1(B)→Hn+1(C)→⋯ .

Facts & Assumptions

Given: A short exact sequence 0→A∙→B∙→C∙→0 of cochain complexes.

[L1]

A cochain complex may be read as a reindexed chain complex with (C♯)n=C−n (Cochain complex in an abelian category).

[L2]

The cohomology object Hn(C) is the homology of that reindexed chain complex in degree −n (Cohomology object of a cochain complex).

[L3]

Short exact sequences of chain complexes carry long exact sequences in homology (The long exact sequence in homology).

Proof

technique · direct
1.1L1L3givenconstruct

By [L1], the given short exact sequence of cochain complexes is the same data as a short exact sequence of reindexed chain complexes. Applying [L3] gives a long exact sequence in homology for those chain complexes.

2.1L1L2step 1.1algebra∎

Replace each term H−n(X♯) by Hn(X) using [L2]. Under the same reindexing, the connecting map from degree −n homology to degree −n−1 homology becomes a map ∂n:Hn(C)→Hn+1(A). This is the displayed long exact cohomology sequence.

Depends on

Used by

Dependency tree · two levels

13 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