Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

A short exact sequence is a kernel-cokernel pair

Statement

For morphisms 0AiBpC0 in an abelian category, the following are equivalent:

  1. the sequence is short exact;
  2. i is a kernel of p and p is a cokernel of i.

Facts & Assumptions

Given: Morphisms i:AB and p:BC in an abelian category.

[L1]

A short exact sequence is exact at A, B, and C (Exact sequence and short exact sequence in an abelian category).

[L2]

Exactness at a node can be tested by the two arrow equalities gf=0 and qk=0 (The arrow-theoretic criterion for exactness).

[L3]

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

[L4]

The identity of A is a cokernel of 0A, and dually the identity of C is a kernel of C0 (The cokernel of the zero map out of the zero object is the target, and dually for kernels).

[L5]

Exactness at B gives both [im(i)]=[ker(p)] and [coker(i)]=[coim(p)] (Exactness at a node).

Proof

technique · direct
1.1

Assume the displayed sequence is short exact. Exactness at A and [L4] make the arrow criterion [L2] read 1Ak=0 for a kernel k of i, so ker(i)=0 and [L3] makes i monic. Dually, exactness at C gives coker(p)=0, so p is epic.

L1L2L3L4
1.2

Conversely, assume i is a kernel of p and p is a cokernel of i. Then [L7] makes i monic and p epic, so [L3] gives endpoint exactness. Also pi=0, and if k is a kernel of p while q is a cokernel of i, then k factors through i, hence qk=0 because qi=0. Thus [L2] gives exactness at B, so the sequence is short exact.

L2L3L7
2.1

Exactness at B gives pi=0 by [L2]. Since i is monic by step 1.1, the factorization i=i1A is an epi-mono factorization of i, so every u:UB with pu=0 factors through i. Thus i is a kernel of p.

L2step 1.1
2.2

The same exactness at B, read through the second equality in [L5], identifies coker(i) with coim(p). Because step 1.1 makes p epic, [L6] says that p itself represents coim(p). Hence p represents the quotient coker(i), which is exactly to say that p is a cokernel of i.

L5L6step 1.1
3.1

Steps 1.1 and 2.1 show that short exactness forces i to be the kernel of p.

step 1.1step 2.1
4.1

Steps 2.2 and 1.2 complete the equivalence.

step 2.2step 1.2

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