Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Exactness of kernel and cokernel sequences under endpoint hypotheses

Statement

Consider a commutative diagram in an abelian category

XYZUVW:f®g¯°kl

Then:

  1. if the top row is exact and k is monic, the induced sequence ker(α)ker(β)ker(γ) is exact;
  2. if the bottom row is exact and g is epic, the induced sequence coker(α)coker(β)coker(γ) is exact.

Facts & Assumptions

Given: The commutative diagram in the statement.

[L1]

Exactness can be tested by the covering criterion (The covering criterion for exactness).

[L2]

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

[L3]

Kernels are universal for morphisms annihilated by the given map, and cokernels are dual (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).

Proof

technique · direct
1.1

Assume the top row is exact and k is monic. Choose kernels h:ker(α)X, i:ker(β)Y, and j:ker(γ)Z. By [L3], the commutative diagram induces morphisms a:ker(α)ker(β),b:ker(β)ker(γ) with ia=fh,jb=gi.

L3assume-hypconstruct
2.1

To prove exactness of ker(α)aker(β)bker(γ), apply the covering criterion [L1] to the pair (a,b). Let u:Tker(β) satisfy bu=0. Then giu=jbu=0, so exactness of the top row gives an object P, an epimorphism e:PT, and a morphism x:PX with iue=fx.

L1L3step 1.1construct
3.1

Applying β to the displayed equality gives 0=βiue=kαx. Since k is monic, αx=0. The kernel property of h therefore gives x:Pker(α) with hx=x. Now iue=fhx=iax, so monicity of i from [L4] yields ue=ax. Also jba=gia=gfh=0, so monicity of j from [L4] gives ba=0. Thus the pair (a,b) satisfies both parts of the covering criterion [L1], and the kernel sequence is exact.

L1L3L4step 1.1step 2.1algebra
4.1

The cokernel statement is the formal dual of steps 1.1 to 3.1 in the opposite abelian category: bottom-row exactness becomes top-row exactness, the epicity of g becomes monicity of gop, kernels become cokernels, and [L2] transports the resulting exact sequence back to the original category.

L2step 1.1step 2.1step 3.1
5.1

Therefore both displayed induced sequences are exact under the stated endpoint hypotheses.

step 3.1step 4.1

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