Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30
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 complex is exact at n exactly when its nth homology is zero

Statement

Let C be a chain complex in an abelian category and let nZ. Then C is exact at degree n if and only if Hn(C) is a zero object.

Facts & Assumptions

Given: A chain complex C and an integer n.

[L1]

Exactness at degree n means that the canonical map βn:Bn(C)Zn(C) is an isomorphism (Exactness of a complex at a degree and acyclic complexes).

[L2]

The homology object Hn(C) is the cokernel of βn (Homology object of a chain complex).

[L3]

In an abelian category, a morphism is epic exactly when its cokernel is zero (In an abelian category, monic means zero kernel and epic means zero cokernel).

[L4]

In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).

Proof

technique · direct
1.1

Assume C is exact at degree n. Then [L1] says βn is an isomorphism, hence in particular epic. By [L2] and [L3], the cokernel of βn, namely Hn(C), is therefore zero.

L1L2L3
2.1

Conversely, assume Hn(C) is zero. By [L2], the cokernel of βn is zero, so [L3] makes βn epic. The map βn is monic because it factors the monic image inclusion of Bn(C) through the monic cycle inclusion. Hence [L4] makes βn an isomorphism, and [L1] says that C is exact at degree n.

L1L2L3L4algebra

Depends on

Used by

Dependency tree · two levels

15 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