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.

Nine lemma variants by which rows are assumed exact

Statement

In the 3×3 short-exact-column diagram of the nine lemma:

  1. if the bottom two rows are short exact, then the top row is short exact;
  2. if the top two rows are short exact, then the bottom row is short exact;
  3. if the top and bottom rows are short exact and the middle row is a complex, then the middle row is short exact.

Facts & Assumptions

Given: A commutative 3×3 diagram whose three columns are short exact.

[L1]

The nine lemma exchanges short exactness of the top and bottom rows when the middle row is short exact (Nine lemma in an abelian category).

[L2]

In a short exact sequence, the left map is monic, the right map is epic, and the middle node is exact (Degenerate exactness criteria).

[L3]

Monicity, epicity, and exactness can be checked by member cancellation and member lifting. Equivalent members have representatives on a common epic domain, where hom-set subtraction is defined (Monicity by member cancellation, Epimorphy is detected by members, Exactness is detected by members, Equivalence of members, Member equivalence is transitive, Abelian category).

Proof

technique · direct
1.1

If the bottom two rows are short exact, then the standing hypotheses of [L1] are met, so the top row is short exact.

L1assume-hyp
1.2

If the top two rows are short exact, the same theorem [L1] applied after swapping the top and bottom rows shows that the bottom row is short exact.

L1assume-hyp
1.3

Assume the top and bottom rows are short exact and that the middle row is a complex. To prove exactness at B1, let x be a member of B1 with image 0 in B2. Applying the right map of the first column gives c1p1x=p2b1x0. Since the bottom row is short exact, its left map c1 is monic by [L2], so [L3] gives p1x0. Exactness of the first column at B1 gives a member u of A1 with i1ux. Then i2a1u=b1i1ub1x0. Because the second column is short exact, its left map i2 is monic, so [L3] gives a1u0. The top row is short exact, hence its left map is monic by [L2]; another use of [L3] gives u0, and therefore x0. Thus the middle-row map B1B2 is monic.

L2L3givenconstructalgebra
1.4

Still under the same hypotheses, let t be a member of B2 with image 0 in B3. Because the bottom row is exact at C2, there is a member z of C1 with c1zp2t by [L3]. Since the first column is short exact, its right map is epic by [L2], so [L3] yields a member x of B1 with p1xz. Then p2b1x=c1p1xc1zp2t. By [L3], pass to one common epic refinement of these equalities and the hypothesis b2t0, and define w:=tb1x. Then p2w=0, b2w=0, and t=b1x+w on that domain. Exactness of the second column at B2 gives a member u of A2 with i2uw by [L3]. The middle row is a complex, so i3a2u=b2i2ub2w=0. Because the third column is short exact, i3 is monic; [L3] gives a2u0. Exactness of the top row at A2 therefore gives a member v of A1 with a1vu by [L3]. Hence wi2ui2a1v=b1i1v, so tb1(x+i1v). This proves exactness of the middle row at B2 by [L3].

L2L3givenchooseconstructalgebra
1.5

Let s be a member of B3. Since the bottom row is short exact, its right map is epic by [L2], so [L3] gives a member z of C2 with c2zp3s. Since the second column is short exact, its right map is epic as well, choose a member y of B2 with p2yz. Then p3b2y=c2p2yc2zp3s. By [L3], pass to one common epic refinement of these equalities and define w:=sb2y. Then p3w=0 and s=b2y+w on that domain. Exactness of the third column at B3 gives a member u of A3 with i3uw by [L3]. Because the top row is short exact, its right map is epic by [L2], so [L3] gives a member v of A2 with a2vu. Therefore wi3ui3a2v=b2i2v, and hence sb2(y+i2v). By [L3], the map B2B3 is epic.

L2L3givenchooseconstructalgebra
2.1

Steps 1.3, 1.4, and 1.5 prove that the middle row is short exact.

L2step 1.3step 1.4step 1.5
3.1

These are exactly the three standard variants of the nine lemma distinguished by which rows are assumed exact.

step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

28 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