Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-30 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.

Short five lemma by pullback without members

Statement

For a morphism of short exact sequences in an abelian category, the three conclusions of the short five lemma hold without using members: monic outer maps force the middle map to be monic, epic outer maps force it to be epic, and isomorphic outer maps force it to be an isomorphism.

Facts & Assumptions

Given: A morphism of short exact sequences 0AiBpC0, 0AiBpC0, with vertical maps f,g,h.

[L1]

In a short exact sequence, the left map is a kernel and the right map is a cokernel (A short exact sequence is a kernel-cokernel pair).

[L2]

The pullback square of an epimorphism is again a pullback square with epic left projection, and its induced map on kernels is an isomorphism (In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).

[L3]

A cartesian square over an epimorphism is also cocartesian (A cartesian square over an epimorphism is also cocartesian).

[L4]

In an abelian category, monic-plus-epic implies isomorphism (An abelian category is balanced).

Pullback diagram

The proof uses the following pullback of p along h:

PB0CC0:¯®p0h

Proof

technique · direct
1.1

Form the pullback of p along h shown above. Because pg=hp, there is a unique comparison map u:BP with αu=p and βu=g. Since p is the cokernel of i by [L1], it is epic, so [L3] makes the square also cocartesian, and [L2] identifies ker(β) with ker(h).

L1L2L3construct
2.1

Assume f and h are monic. Then ker(h)=0, so step 1.1 makes β monic. If ut=0, then pt=αut=0. Because i=ker(p) by [L1], there is s with t=is. Now 0=βut=gis=ifs. The map i is monic by [L1], and f is monic by hypothesis, so s=0 and hence t=0. Thus u is monic, and therefore g=βu is monic.

L1step 1.1assume-hypalgebra
2.2

Still with the pullback square of step 1.1, let j:AP be a kernel of α; by [L2] this exists and agrees with the induced map from ker(p)=im(i) to P. Assume now that f and h are epic. To show that u is epic, let t:PT satisfy tu=0. Then tjf=tui=0. Since f is epic, tj=0. Because j=ker(α), there is r:CT with rα=t. But then 0=tu=rαu=rp, and p is epic by [L1], so r=0 and hence t=0. Therefore u is epic.

L1L2step 1.1assume-hypalgebra
3.1

To show that β is epic under the same hypotheses, let s:BT satisfy sβ=0. Since the square of step 1.1 is cocartesian by [L3], the compatible pair of maps 0:CT and s:BT induces a unique v:CT with vh=0 and vp=s. Because h is epic, v=0, so s=0. Thus β is epic, and therefore g=βu is epic.

L3step 1.1step 2.2algebra
4.1

If f and h are isomorphisms, steps 2.1 and 3.1 show that g is both monic and epic. Therefore [L4] makes g an isomorphism.

L4step 2.1step 3.1
5.1

This gives the short five lemma again, now by a pullback-and-pushout argument and without any use of members.

step 2.1step 3.1step 4.1

Depends on

Used by

Nothing in the library uses this result yet.

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