Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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.

The Snake Lemma for modules

Statement

Given a commutative diagram of short exact sequences

0ABC00A0B0C00iapbci0p0

there is a connecting homomorphism δ:kerccokera for which 0kerakerbkercδcokeracokerbcokerc0 is exact. The unnamed maps are the restrictions and quotient maps induced by i,p,i,p.

Facts & Assumptions

Given: The commutative diagram in the statement, with both rows short exact.

Diagram: i ⁣:AB, p ⁣:BC, i ⁣:AB, p ⁣:BC, a ⁣:AA, b ⁣:BB, c ⁣:CC.

[C1]

bi=ia (given).

[C2]

cp=pb (given).

[F1]

Short exactness says i,i are injective, p,p are surjective, imi=kerp, and imi=kerp (Exact sequences and short exact sequences of modules, The endpoints of a short exact sequence encode injectivity and surjectivity).

[F2]

cokerf is the quotient of the codomain by imf (Module homomorphism and isomorphism, kernel, image and cokernel).

[L1]

A homomorphism that vanishes on a submodule factors uniquely through the quotient by that submodule (A module homomorphism vanishing on N factors uniquely through M/N).

Proof

technique · constructive
1.1

The restrictions kerakerb and kerbkerc are induced by i and p using [C1] and [C2]. The formulas [x][i(x)] and [y][p(y)] define maps cokeracokerb and cokerbcokerc: [C1] and [C2] make the relevant images vanish in the target quotients, so [L1] applies.

C1C2F2L1construct
1.2

For zkerc, choose yB with p(y)=z. Then [C2] gives p(b(y))=c(z)=0, so [F1] gives a unique xA with i(x)=b(y). Define δ(z):=[x]cokera.

C2F1F2chooseconstruct
2.1

If y~ is another lift of z, then y~y=i(x) for some xA by [F1]. If i(x~)=b(y~), then [C1] and injectivity of i give x~x=a(x), so [x~]=[x] in cokera. Thus δ is well defined.

step 1.2C1F1F2
2.2

Exactness at kera holds because its map is the restriction of the injective map i. At kerb, the composite induced by pi is zero; if ykerb maps to zero in kerc, then p(y)=0, so y=i(x) by [F1], and [C1] with injectivity of i gives a(x)=0, hence xkera.

step 1.1C1F1
2.3

If ykerb, the construction of step 1.2 applied to z=p(y) has x=0, so δ(z)=0. Conversely, if zkerc has δ(z)=0, choose y,x as in step 1.2; then x=a(x) for some x, so [C1] gives b(yi(x))=0 and p(yi(x))=z. Thus exactness holds at kerc.

step 1.2C1F1F2
2.4

The map cokeracokerb kills δ(z) because i(x)=b(y). Conversely, if [x] maps to zero, write i(x)=b(y); then [C2] gives c(p(y))=0, and the construction with lift y gives δ(p(y))=[x]. Thus exactness holds at cokera.

step 1.1step 1.2C2F2
2.5

The next composite is zero because pi=0. If [y]cokerb maps to zero in cokerc, write p(y)=c(z), choose yB with p(y)=z, and use [C2] to obtain yb(y)kerp=imi. Hence [y] comes from cokera, proving exactness at cokerb.

step 1.1C2F1F2choose
2.6

The map cokerbcokerc is surjective: for a class [z], choose yB with p(y)=z using [F1], and [y] maps to [z].

step 1.1F1F2choose
3.1

For z1,z2kerc and rR, the choices y1+y2 and ry1 in step 1.2 lead to x1+x2 and rx1; uniqueness through the injective map i then gives δ(z1+z2)=δ(z1)+δ(z2) and δ(rz1)=rδ(z1).

step 1.2step 2.1F1
4.1

Steps 2.2 through 2.6 establish exactness at every displayed term. Steps 1.2, 2.1, and 3.1 construct a well-defined linear connecting homomorphism.

step 2.1step 3.1step 2.2step 2.3step 2.4step 2.5step 2.6discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 26 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources