Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Four lemma in an abelian category

Statement

Consider a commutative diagram in an abelian category with exact rows

WXYZW0X0Y0Z0®¯°±

Then:

  1. if α and γ are epic and δ is monic, then β is epic;
  2. if β and δ are monic and α is epic, then γ is monic.

Facts & Assumptions

Given: The commutative exact-row diagram in the statement.

[L1]

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

[L2]

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

[L3]

Exactness at a node is equivalent to the member-lifting condition (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.1L1L2L3assume-hypconstruct

Write the top row as W→iX→jY→pZ and the bottom row as W′→i′X′→j′Y′→p′Z′. Assume that α and γ are epic and that δ is monic. To prove that β is epic, let x′ be a member of X′. Since γ is epic, [L2] gives a member y of Y with γy≡j′x′. Then δpy=p′γy≡p′j′x′≡0. Because δ is monic, [L1] gives py≡0. Exactness of the top row at Y now gives a member x0 of X with jx0≡y by [L3].

1.2L1L3L4assume-hypchooseconstructalgebra

Assume instead that β and δ are monic and that α is epic. To prove that γ is monic, let y and y′ be members of Y with γy≡γy′. Then δpy=p′γy≡p′γy′=δpy′, so [L1] gives py≡py′. By [L4], replace y and y′ by representatives on one common epic refinement of the witnesses for both equalities and define t:=y−y′. Then γt=pt=0 and y=y′+t on that domain. Exactness of the top row at Y gives a member x of X with jx≡t by [L3].

2.1L2L3L4step 1.1chooseconstructalgebra

From step 1.1 we get j′βx0=γjx0≡γy≡j′x′. By [L4], replace βx0 and x′ by representatives on a common epic domain and define z′:=x′−βx0. Then j′z′=0 and x′=βx0+z′ on that domain. Exactness of the bottom row at X′ gives a member w′ of W′ with i′w′≡z′ by [L3], and epicity of α gives a member w of W with αw≡w′ by [L2]. Therefore β(x0+iw)≡βx0+i′αw≡βx0+i′w′≡βx0+z′≡x′. So every member of X′ lifts along β, and [L2] makes β epic.

2.2L1L2L3step 1.2algebra

From step 1.2 we get j′βx=γjx≡γt≡0. Exactness of the bottom row at X′ therefore gives a member w′ of W′ with i′w′≡βx by [L3]. Because α is epic, [L2] gives a member w of W with αw≡w′. Then β(x−iw)≡βx−i′αw≡βx−i′w′≡0. Since β is monic, [L1] yields x≡iw. Therefore t≡jx≡jiw≡0, because the top row is a complex. So y≡y′, and [L1] makes γ monic.

3.1step 1.2step 2.2∎

Therefore the four lemma holds in both the epic and the monic form stated above.

Depends on

Used by

Dependency tree · two levels

20 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