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

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.1L1assume-hyp

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

1.2L1assume-hyp

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.

1.3L2L3givenconstructalgebra

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=p2b1x≡0. Since the bottom row is short exact, its left map c1 is monic by [L2], so [L3] gives p1x≡0. Exactness of the first column at B1 gives a member u of A1 with i1u≡x. Then i2a1u=b1i1u≡b1x≡0. Because the second column is short exact, its left map i2 is monic, so [L3] gives a1u≡0. The top row is short exact, hence its left map is monic by [L2]; another use of [L3] gives u≡0, and therefore x≡0. Thus the middle-row map B1→B2 is monic.

1.4L2L3givenchooseconstructalgebra

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 c1z≡p2t 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 p1x≡z. Then p2b1x=c1p1x≡c1z≡p2t. By [L3], pass to one common epic refinement of these equalities and the hypothesis b2t≡0, and define w:=t−b1x. 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 i2u≡w by [L3]. The middle row is a complex, so i3a2u=b2i2u≡b2w=0. Because the third column is short exact, i3 is monic; [L3] gives a2u≡0. Exactness of the top row at A2 therefore gives a member v of A1 with a1v≡u by [L3]. Hence w≡i2u≡i2a1v=b1i1v, so t≡b1(x+i1v). This proves exactness of the middle row at B2 by [L3].

1.5L2L3givenchooseconstructalgebra

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 c2z≡p3s. Since the second column is short exact, its right map is epic as well, choose a member y of B2 with p2y≡z. Then p3b2y=c2p2y≡c2z≡p3s. By [L3], pass to one common epic refinement of these equalities and define w:=s−b2y. Then p3w=0 and s=b2y+w on that domain. Exactness of the third column at B3 gives a member u of A3 with i3u≡w 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 a2v≡u. Therefore w≡i3u≡i3a2v=b2i2v, and hence s≡b2(y+i2v). By [L3], the map B2→B3 is epic.

2.1L2step 1.3step 1.4step 1.5

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

3.1step 1.1step 1.2step 2.1∎

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

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