Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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 δ:ker⁡c→coker⁡a for which 0→ker⁡a→ker⁡b→ker⁡c→δcoker⁡a→coker⁡b→coker⁡c→0 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 ⁣:A→B, p ⁣:B→C, i′ ⁣:A′→B′, p′ ⁣:B′→C′, a ⁣:A→A′, b ⁣:B→B′, c ⁣:C→C′.

[C1]

b∘i=i′∘a (given).

[C2]

c∘p=p′∘b (given).

[F1]

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

[F2]

coker⁡f is the quotient of the codomain by im⁡f (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 ker⁡a→ker⁡b and ker⁡b→ker⁡c are induced by i and p using [C1] and [C2]. The formulas [x′]↦[i′(x′)] and [y′]↦[p′(y′)] define maps coker⁡a→coker⁡b and coker⁡b→coker⁡c: [C1] and [C2] make the relevant images vanish in the target quotients, so [L1] applies.

C1C2F2L1construct
1.2

For z∈ker⁡c, choose y∈B with p(y)=z. Then [C2] gives p′(b(y))=c(z)=0, so [F1] gives a unique x′∈A′ with i′(x′)=b(y). Define δ(z):=[x′]∈coker⁡a.

C2F1F2chooseconstruct
2.1

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

step 1.2C1F1F2
2.2

Exactness at ker⁡a holds because its map is the restriction of the injective map i. At ker⁡b, the composite induced by p∘i is zero; if y∈ker⁡b maps to zero in ker⁡c, then p(y)=0, so y=i(x) by [F1], and [C1] with injectivity of i′ gives a(x)=0, hence x∈ker⁡a.

step 1.1C1F1
2.3

If y∈ker⁡b, the construction of step 1.2 applied to z=p(y) has x′=0, so δ(z)=0. Conversely, if z∈ker⁡c has δ(z)=0, choose y,x′ as in step 1.2; then x′=a(x) for some x, so [C1] gives b(y−i(x))=0 and p(y−i(x))=z. Thus exactness holds at ker⁡c.

step 1.2C1F1F2
2.4

The map coker⁡a→coker⁡b 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 coker⁡a.

step 1.1step 1.2C2F2
2.5

The next composite is zero because p′i′=0. If [y′]∈coker⁡b maps to zero in coker⁡c, write p′(y′)=c(z), choose y∈B with p(y)=z, and use [C2] to obtain y′−b(y)∈ker⁡p′=im⁡i′. Hence [y′] comes from coker⁡a, proving exactness at coker⁡b.

step 1.1C2F1F2choose
2.6

The map coker⁡b→coker⁡c is surjective: for a class [z′], choose y′∈B′ with p′(y′)=z′ using [F1], and [y′] maps to [z′].

step 1.1F1F2choose
3.1

For z1,z2∈ker⁡c and r∈R, 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

Dependency tree · two levels

10 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