Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 kernel row and cokernel row of a morphism of short exact sequences are exact at two nodes each

Statement

Given a morphism of short exact sequences in an abelian category

0ABC00A0B0C00iapbci0p0

the induced kernel sequence 0→ker⁡(a)→ker⁡(b)→ker⁡(c) is exact at ker⁡(a) and at ker⁡(b).

Dually, the induced cokernel sequence coker⁡(a)→coker⁡(b)→coker⁡(c)→0 is exact at coker⁡(b) and at coker⁡(c).

Facts & Assumptions

Given: The morphism of short exact sequences in the statement.

[L1]

In a short exact sequence, the left map is a kernel and the right map is a cokernel (Degenerate exactness criteria).

[L2]

Under the stated endpoint hypotheses, the induced kernel or cokernel sequence is exact at its middle node (Exactness of kernel and cokernel sequences under endpoint hypotheses).

[L4]

Exactness is self-dual (Exactness is self-dual).

Proof

technique · direct
1.1L1L2

Because both rows are short exact, [L1] says that the left square is a morphism between exact pairs and that i′ is monic. Therefore [L2] applies and gives exactness of the induced kernel sequence ker⁡(a)→ker⁡(b)→ker⁡(c) at ker⁡(b).

1.2L1L3algebra

Let u:ker⁡(a)→ker⁡(b) be the induced map and choose kernel arrows ka:ker⁡(a)→A and kb:ker⁡(b)→B. If us=ut, then ikas=kbus=kbut=ikat. The map i is monic by [L1], and ka is monic by [L3], so s=t. Hence u is monic, which is exactly exactness of 0→ker⁡(a)→ker⁡(b) at ker⁡(a).

2.1L4step 1.1step 1.2

Passing to the opposite category turns the diagram into a morphism of short exact sequences again. Applying steps 1.1 and 1.2 there and transporting the result back with [L4] yields exactness of the induced cokernel sequence at coker⁡(b) and at coker⁡(c).

3.1step 1.1step 1.2step 2.1∎

Hence the kernel row is exact at ker⁡(a) and ker⁡(b), and the cokernel row is exact at coker⁡(b) and coker⁡(c).

Depends on

Used by

Dependency tree · two levels

14 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