Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-29
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 covering criterion for exactness

Statement

For a composable pair X→fY→gZ in an abelian category, the following are equivalent:

  1. the pair is exact at Y;
  2. gf=0, and for every morphism h:W→Y with gh=0, there exist an object V, an epimorphism k:V→W, and a morphism l:V→X such that hk=fl.

Facts & Assumptions

Given: The composable pair X→fY→gZ.

[L1]

Exactness at Y is equivalent to the member criterion gy≡0⇒∃x,  fx≡y (Exactness is detected by members).

[L2]

Member equivalence means equality after precomposition by one common pair of epimorphisms (Equivalence of members).

Proof

technique · direct
1.1L1L2assume-hypchooseconstruct

Assume the pair is exact. Then [L1] gives gf=0. Now let h:W→Y satisfy gh=0. Then gh≡0, so [L1] gives a member x:U→X with fx≡h. By [L2], there exist an object V and epimorphisms a:V→U and k:V→W such that fxa=hk. Putting l:=xa proves the covering condition.

1.2L1L2assume-hypconstruct

Assume gf=0 and the covering condition. Let y:W→Y be a member with gy≡0. Choose an epic u:W′→W with gyu=0, and apply the covering condition to h:=yu. This gives an epic k:V→W′ and a map l:V→X with yuk=fl. Since uk is epic, [L2] says exactly that fl≡y. Therefore [L1] gives exactness at Y.

2.1step 1.1step 1.2∎

Thus the covering condition is equivalent to exactness.

Depends on

Used by

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