Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 in an abelian category

Statement

In a commutative 3×3 diagram in an abelian category, assume all three columns and the middle row are short exact:

0A1A2A300B1B2B300C1C2C30:

Then the top row is short exact if and only if the bottom row is short exact.

Facts & Assumptions

Given: The 3×3 diagram in the statement.

[L1]

If the bottom two rows are short exact, then the top row is exact at its first two nodes (Half nine lemma).

[L2]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

[L3]

Short exactness, monicity, epicity, and exactness are detected by the standard member rules (Degenerate exactness criteria, Monicity by member cancellation, Epimorphy is detected by members, 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.1

Assume the bottom row is short exact. Applying [L1] to the given diagram shows that the top row is exact at its first two nodes.

L1assume-hyp
2.1

Write the horizontal maps as a1,a2, b1,b2, and c1,c2, and the vertical maps as i1,i2,i3 and then p1,p2,p3. It remains after step 1.1 to prove that a2 is epic. Let s be a member of A3. Lift i3s along the epic map b2 to a member t of B2. Exactness of the bottom row gives a member u of C1 with c1up2t, and epicity of p1 gives a member y of B1 with p1yu. Then p2b1y=c1p1yc1up2t. By [L4], pass to one common epic refinement of all the preceding equivalences and put w:=tb1y. Then p2w=0, t=b1y+w, and b2t=i3s there. Exactness of the second column gives a member x of A2 with i2xw. Consequently i3a2x=b2i2xb2w=b2ti3s. Since i3 is monic, a2xs. Thus a2 is epic by [L3], and the top row is short exact.

L3L4step 1.1chooseconstructalgebra
3.1

For the converse, pass to the opposite category. After drawing its vertical arrows downward, the original top row is the bottom row and the original bottom row is the top row. Thus the implication proved in steps 1.1 and 2.1, applied in the abelian category from [L2], carries short exactness of the original top row to short exactness of the original bottom row.

L2step 1.1step 2.1assume-hyp
4.1

Hence, under the standing short-exactness of the middle row and all three columns, the top row is short exact if and only if the bottom row is short exact.

step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

29 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