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.

Snake lemma under the weaker Stacks hypotheses

Statement

For snake data in the weaker Stacks shape

XYZ00UVW;a®b¯°kl

there is an exact sequence ker(α)ker(β)ker(γ)δcoker(α)coker(β)coker(γ).

If a is monic, then ker(α)ker(β) is monic. If l is epic, then coker(β)coker(γ) is epic.

Facts & Assumptions

Given: The weaker snake-data diagram in the statement.

[L1]

In an exact sequence ending in 0, the last map is epic; in an exact sequence beginning at 0, the first map is monic (Degenerate exactness criteria).

[L2]

Kernels and cokernels are characterized by their universal properties (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).

[L3]

Pullbacks of epimorphisms are epimorphisms, and in a pullback square the induced map on kernels is an isomorphism (The pullback of an epimorphism is an epimorphism, In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).

[L4]

Under the endpoint hypotheses, the induced kernel and cokernel sequences are exact (Exactness of kernel and cokernel sequences under endpoint hypotheses).

[L5]

Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).

[L6]

The subtraction surrogate produces a member mapping to zero from two members with the same image (The subtraction surrogate).

[L7]

Exactness is self-dual (Exactness is self-dual).

Proof

technique · direct
1.1

Because the top row is exact and ends in 0, the map b is epic by [L1]. Because the bottom row is exact and begins at 0, the map k is monic by [L1]. Choose a kernel kγ:KZ of γ and a cokernel qα:UQ of α. Form the pullback tikzcd P \arrow[r, "\pi'"] \arrow[d, "\pi"'] & Y \arrow[d, "b"] \\ K \arrow[r, "k_\gamma"'] & Z. By [L3], π is epic. Since lβπ=γbπ=γkγπ=0, the kernel property of k gives a unique map r:PU such that kr=βπ.

L1L2L3givenconstruct
2.1

Let j:JP be a kernel of π. By [L3], the induced map Jker(b) is an isomorphism. Exactness of the top row at Y says that ker(b) is the image of a, so there is an epimorphism e:XJ with πje=a. Then krje=βπje=βa=kα, and monicity of k gives rje=α. Therefore qαrje=qαα=0. Because e is epic, qαrj=0. Since π is epic, it is the cokernel of its kernel j, so there is a unique morphism δ:KQ with δπ=qαr.

L1L2L3step 1.1constructalgebra
3.1

Applying [L4] to the given diagram gives exactness of ker(α)ker(β)ker(γ) and of coker(α)coker(β)coker(γ). If a is monic, then the sequence 0XaYbZ is exact, so the same theorem gives that ker(α)ker(β) is monic. Dually, if l is epic, then coker(β)coker(γ) is epic. Thus only exactness at ker(γ) and at coker(α) remains.

L1L4step 2.1
3.2

Let i:ker(β)Y be a kernel of β, and let s:ker(β)K be the induced map with kγs=bi. Because βi=0, the pair (i,s) factors through the pullback, giving t:ker(β)P with πt=i,πt=s. Then krt=βπt=βi=0, so monicity of k gives rt=0. Therefore δs=δπt=qαrt=0, which proves that δ kills the image of ker(β)ker(γ).

L2step 2.1constructalgebra
3.3

Conversely, let u be a member of K with δu0. Because π is epic, [L5] gives a member n of P with πnu. Then qαrn=δπnδu0, so the cokernel property of qα gives a member x of X with αxrn. Hence βπn=krnkαx=βax. Applying [L6] to πn and ax with respect to β, obtain a member y of Y with βy0 and bybπn. Since bπn=kγπnkγu, the member y factors through ker(β) and maps to u in ker(γ). Thus every member of ker(δ) lies in the image of ker(β)ker(γ), so the sequence is exact at ker(γ).

L2L5L6step 2.1constructalgebra
4.1

The exactness at coker(α) is the formal dual of step 3.3 in the opposite abelian category. By [L7], that dual exactness transports back to the statement that im(δ)=ker(coker(α)coker(β)).

L7step 3.3
5.1

Hence the displayed six-term sequence is exact under the weaker Stacks hypotheses, with the additional endpoint monic and epic clauses already proved in step 3.1.

step 3.1step 3.3step 4.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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