Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 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 sequence of chain maps is exact exactly when it is exact degreewise

Statement

Let AuBvC be composable chain maps in an abelian category. The sequence is exact at B in Ch(A) if and only if for every nZ the sequence AnunBnvnCn is exact at Bn in A.

Facts & Assumptions

Given: Composable chain maps AuBvC.

[L2]

Exactness at a node means equality of the image and kernel subobjects (Exactness at a node).

[L3]

Images and kernels of chain maps are computed degreewise (Images and coimages of chain maps are computed degreewise).

Proof

technique · direct
1.1

If the sequence is exact at B in Ch(A), then [L2] says im(u)=ker(v) as subobjects of B. By [L3], their nth components are im(un) and ker(vn), so [L2] gives exactness of AnBnCn in every degree.

L1L2L3
2.1

Conversely, if every degreewise sequence is exact, then [L2] gives im(un)=ker(vn) inside Bn for every n. By [L3], that is exactly the degreewise comparison between the image and kernel complexes, so [L2] makes the sequence exact at B in Ch(A).

L2L3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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