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.

Sharp nine lemma

Statement

In a commutative 3×3 diagram, assume the three columns and the last two rows are exact at their first two nodes. Then the first row is exact at its first two nodes.

If, in addition, the first column and the middle row are short exact, then the first row is short exact.

Facts & Assumptions

Given: The commutative 3×3 diagram in the statement.

[L1]

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

[L2]

Monicity and epicity are equivalent to member cancellation and member lifting (Monicity by member cancellation, Epimorphy is detected by members).

[L3]

Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).

[L4]

The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).

Proof

technique · direct
1.1L1L2givenalgebra

Write the horizontal maps of the three rows as a1,a2, b1,b2, and c1,c2, and the vertical maps of the three columns as i1,i2,i3 from top to middle and p1,p2,p3 from middle to bottom. Assume the three columns and the last two rows are exact at their first two nodes. Let x and y be members of A1 with the same image in A2. Commutativity gives the same image of i1x and i1y in B2. Because the middle row is exact at its first node, b1 is monic by [L1], so [L2] gives i1x≡i1y. Because the first column is exact at its first node, i1 is monic, and another use of [L2] yields x≡y. Thus the top row is exact at A1.

1.2L1L2L3givenconstructalgebra

Let t be a member of A2 with image 0 in A3. Commutativity gives that i2t maps to 0 in B3. Exactness of the middle row at B2 therefore yields a member y of B1 with b1y≡i2t by [L3]. Applying the right map of the first column gives c1p1y=p2b1y≡p2i2t≡0. Because the bottom row is exact at its first node, c1 is monic by [L1], so [L2] shows p1y≡0. Exactness of the first column at B1 now gives a member z of A1 with i1z≡y by [L3]. Then i2a1z=b1i1z≡b1y≡i2t. Since the second column is exact at its first node, i2 is monic, so [L2] gives a1z≡t. Thus the top row is exact at A2.

2.1L1L2L3L4step 1.1step 1.2chooseconstructalgebra

Assume in addition that the first column and the middle row are short exact. By steps 1.1 and 1.2, the top row is already exact at its first two nodes, so only epicity of a2:A2→A3 remains. Let s be a member of A3. Because the middle row is short exact, b2 is epic by [L1], so [L2] gives a member t of B2 with b2t≡i3s. Then c2p2t=p3b2t≡p3i3s≡0, so exactness of the bottom row at C2 gives a member u of C1 with c1u≡p2t by [L3]. Since the first column is short exact, p1 is epic by [L1], so [L2] gives a member y of B1 with p1y≡u. Now p2b1y=c1p1y≡c1u≡p2t. By [L4], pass to one common epic refinement of all the preceding equivalences and define w:=t−b1y. Then p2w=0, t=b1y+w, and b2t=i3s on that domain. Exactness of the second column at B2 gives a member x of A2 with i2x≡w by [L3]. Therefore i3a2x=b2i2x≡b2w=b2t≡i3s. Because the third column is exact at its first node, i3 is monic, so [L2] gives a2x≡s. Hence a2 is epic, and the top row is short exact.

3.1step 1.1step 1.2step 2.1∎

Hence the sharp nine lemma is the left-exact half together with the precise extra hypotheses needed to upgrade it to a short exact row.

Depends on

Used by

Dependency tree · two levels

25 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