Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

Half nine lemma

Statement

Consider a commutative 3×3 diagram in an abelian category whose three columns are short exact:

0A1A2A300B1B2B300C1C2C30:

If the bottom two rows are short exact, then the top row is exact at A1 and at A2.

Facts & Assumptions

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

[L1]

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

[L2]

Monicity is equivalent to cancellation on members (Monicity by member cancellation).

[L3]

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

Proof

technique · direct
1.1

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 second row is short exact, its left map is monic by [L1], so [L2] gives i1xi1y. The first column is also short exact, so its left map is monic; applying [L2] again yields xy. Hence the top-row map A1A2 is monic, so the top row is exact at A1.

L1L2givenalgebra
1.2

Let t be a member of A2 with image 0 in A3. Commutativity gives that i2t maps to 0 in B3. Exactness of the second row at B2 therefore yields a member y of B1 with b1yi2t by [L3]. Applying the right map of the first column gives c1p1y=p2b1yp2i2t0. Because the bottom row is short exact, its left map c1 is monic by [L1], so [L2] shows p1y0. Exactness of the first column at B1 now gives a member z of A1 with i1zy by [L3]. Then i2a1z=b1i1zb1yi2t. Since the second column is short exact, i2 is monic, so [L2] gives a1zt. Thus every member of A2 killed by A2A3 lifts from A1, and the top row is exact at A2 by [L3].

L1L2L3givenconstructalgebra
2.1

Therefore the top row is left exact whenever the bottom two rows and all three columns are short exact.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

16 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